Pagini recente » Borderou de evaluare (job #1618364) | Borderou de evaluare (job #939028) | Borderou de evaluare (job #1680590) | Borderou de evaluare (job #1029297) | Borderou de evaluare (job #1686022)
Borderou de evaluare (job #1686022)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:26:12: warning: unused variable ‘m’ [-Wunused-variable]
int n, m, i, j, s, t, d, k, ma, x, y, x_aa, y_aa;
^
user.cpp:26:21: warning: unused variable ‘s’ [-Wunused-variable]
int n, m, i, j, s, t, d, k, ma, x, y, x_aa, y_aa;
^
user.cpp:26:27: warning: unused variable ‘d’ [-Wunused-variable]
int n, m, i, j, s, t, d, k, ma, x, y, x_aa, y_aa;
^
user.cpp:26:37: warning: variable ‘x’ set but not used [-Wunused-but-set-variable]
int n, m, i, j, s, t, d, k, ma, x, y, x_aa, y_aa;
^
user.cpp:26:40: warning: variable ‘y’ set but not used [-Wunused-but-set-variable]
int n, m, i, j, s, t, d, k, ma, x, y, x_aa, y_aa;
^
user.cpp:23:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("alpin.in","r",stdin);
^
user.cpp:24:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("alpin.out","w",stdout);
^
user.cpp:30:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
user.cpp:33:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&best[i][j][1]);
^
user.cpp:47:89: warning: array subscript is above array bounds [-Warray-bounds]
best[x_aa][y_aa][2] = maxim( best[x_aa][y_aa][2], best[v[i].x][v[i].y][2] + 1 );
^
user.cpp:47:95: warning: array subscript is above array bounds [-Warray-bounds]
best[x_aa][y_aa][2] = maxim( best[x_aa][y_aa][2], best[v[i].x][v[i].y][2] + 1 );
^
user.cpp:47:35: warning: array subscript is above array bounds [-Warray-bounds]
best[x_aa][y_aa][2] = maxim( best[x_aa][y_aa][2], best[v[i].x][v[i].y][2] + 1 );
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 340kb | Doar lungimea traseului corecta! | 5 |
2 | 0ms | 336kb | Wall time limit exceeded. | 0 |
3 | 0ms | 292kb | Wall time limit exceeded. | 0 |
4 | 0ms | 300kb | Wall time limit exceeded. | 0 |
5 | 0ms | 276kb | Wall time limit exceeded. | 0 |
6 | 0ms | 260kb | Wall time limit exceeded. | 0 |
7 | 0ms | 264kb | Wall time limit exceeded. | 0 |
8 | 0ms | 260kb | Wall time limit exceeded. | 0 |
9 | 0ms | 264kb | Wall time limit exceeded. | 0 |
10 | 0ms | 256kb | Wall time limit exceeded. | 0 |
Punctaj total | 5 |