Borderou de evaluare (job #464490)

Utilizator freak93Adrian Budau freak93 Data 20 iunie 2010 13:33:40
Problema Pokemon Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 80

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
14ms520kbOK10
28ms732kbOK10
332ms1016kbOK10
472ms1160kbOK10
5148ms1368kbOK10
6160ms1368kbOK10
7156ms1372kbOK10
8220ms1476kbOK10
9Depăşit1460kbTime limit exceeded.0
10Depăşit1464kbTime limit exceeded.0
Punctaj total80

Ceva nu functioneaza?