Pagini recente » Borderou de evaluare (job #1967200) | Borderou de evaluare (job #669667) | Borderou de evaluare (job #434793) | Borderou de evaluare (job #1122177) | Borderou de evaluare (job #464490)
Borderou de evaluare (job #464490)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:48:56: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
user.cpp:48:74: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
user.cpp:48:99: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
user.cpp:48:119: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
user.cpp:48:149: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
user.cpp:48:169: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
user.cpp:48:194: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
user.cpp:48:214: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses]
a[p&1][i][j][k]=min(min(min(a[p-1&1][i][j][k],a[p-1&1][i][j][0]+1),min(a[p-1&1][i][0][k]+1,a[p-1&1][0][j][k]+1)),min(min(a[p-1&1][0][0][k]+2,a[p-1&1][0][j][0]+2),min(a[p-1&1][i][0][0]+2,a[p-1&1][0][0][0]+3)));
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 4ms | 520kb | OK | 10 |
2 | 8ms | 732kb | OK | 10 |
3 | 32ms | 1016kb | OK | 10 |
4 | 72ms | 1160kb | OK | 10 |
5 | 148ms | 1368kb | OK | 10 |
6 | 160ms | 1368kb | OK | 10 |
7 | 156ms | 1372kb | OK | 10 |
8 | 220ms | 1476kb | OK | 10 |
9 | Depăşit | 1460kb | Time limit exceeded. | 0 |
10 | Depăşit | 1464kb | Time limit exceeded. | 0 |
Punctaj total | 80 |