Pagini recente » Borderou de evaluare (job #2414708) | Borderou de evaluare (job #2543109) | Borderou de evaluare (job #1045256) | Borderou de evaluare (job #497536) | Borderou de evaluare (job #1620033)
Borderou de evaluare (job #1620033)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:39:102: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(Ins(in, jn) && (B[in][jn] == 0 || B[in][jn] >= B[i][j] + 1) && (A[in][jn] == 0 || ok1 && A[in][jn] <= k1 || ok2 && A[in][jn] >= k2)){
^
user.cpp:39:128: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(Ins(in, jn) && (B[in][jn] == 0 || B[in][jn] >= B[i][j] + 1) && (A[in][jn] == 0 || ok1 && A[in][jn] <= k1 || ok2 && A[in][jn] >= k2)){
^
user.cpp:42:19: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses]
if(in == l1 && jn == c1 && !ok1) if(!ok2) ok1 = 1; else ok1 = 2;
^
user.cpp:43:19: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses]
if(in == l2 && jn == c2 && !ok2) if(!ok1) ok2 = 1; else ok2 = 2;
^
user.cpp:55:125: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(Ins(in, jn) && (C[in][jn] == 0 || C[in][jn] > C[i][j] + 1) && (A[in][jn] == 0 || A[in][jn] <= k1 || okk2 && A[in][jn] >= k2)){
^
user.cpp:86:106: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(Ins(in, jn) && (D[in][jn] == 0 || D[in][jn] > D[i][j] + 1) && (A[in][jn] == 0 || okk1 && A[in][jn] <= k1 || A[in][jn] >= k2)){
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 508kb | Incorect | 0 |
2 | 0ms | 556kb | OK | 10 |
3 | 708ms | Depăşit | Memory limit exceeded. | 0 |
4 | 688ms | Depăşit | Memory limit exceeded. | 0 |
5 | 304ms | Depăşit | Memory limit exceeded. | 0 |
6 | 340ms | Depăşit | Memory limit exceeded. | 0 |
7 | 368ms | Depăşit | Memory limit exceeded. | 0 |
8 | Depăşit | 12576kb | Time limit exceeded. | 0 |
9 | 404ms | Depăşit | Memory limit exceeded. | 0 |
10 | Depăşit | 28268kb | Time limit exceeded. | 0 |
Punctaj total | 10 |