Pagini recente » Borderou de evaluare (job #1515057) | Clasamentul arhivei Infoarena Monthly | Borderou de evaluare (job #793709) | Borderou de evaluare (job #330167) | Borderou de evaluare (job #1649110)
Borderou de evaluare (job #1649110)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:82:35: warning: array subscript is above array bounds [-Warray-bounds]
best[l2][c2][3]=best[l][c][1]+1;
^
user.cpp:94:35: warning: array subscript is above array bounds [-Warray-bounds]
best[l1][c1][3]=best[l][c][2]+1;
^
user.cpp:104:89: warning: array subscript is above array bounds [-Warray-bounds]
if (!in_q[lc][cc][3] && (a[lc][cc]<=k1 || a[lc][cc]>=k2) && best[l][c][3]+1<best[lc][cc][3]){
^
user.cpp:104:107: warning: array subscript is above array bounds [-Warray-bounds]
if (!in_q[lc][cc][3] && (a[lc][cc]<=k1 || a[lc][cc]>=k2) && best[l][c][3]+1<best[lc][cc][3]){
^
user.cpp:106:49: warning: array subscript is above array bounds [-Warray-bounds]
best[lc][cc][3]=best[l][c][3]+1;
^
user.cpp:106:35: warning: array subscript is above array bounds [-Warray-bounds]
best[lc][cc][3]=best[l][c][3]+1;
^
user.cpp:112:77: warning: array subscript is above array bounds [-Warray-bounds]
g<<min(best[n][n][0],min(best[n][n][1],min(best[n][n][2],best[n][n][3])))+1;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 948kb | Incorect | 0 |
2 | 0ms | 984kb | Incorect | 0 |
3 | 0ms | 1328kb | Incorect | 0 |
4 | 48ms | 7788kb | Incorect | 0 |
5 | 52ms | 7796kb | Incorect | 0 |
6 | 72ms | 9884kb | Incorect | 0 |
7 | 188ms | 11880kb | Incorect | 0 |
8 | 188ms | 16556kb | Incorect | 0 |
9 | 352ms | 16588kb | Incorect | 0 |
10 | 4ms | 1820kb | Incorect | 0 |
Punctaj total | 0 |