Pagini recente » Borderou de evaluare (job #2783399) | Borderou de evaluare (job #2236334) | Borderou de evaluare (job #1554910) | Borderou de evaluare (job #1467039) | Borderou de evaluare (job #1619918)
Borderou de evaluare (job #1619918)
Raport evaluator
Compilare:
user.cpp: In function ‘void readData()’:
user.cpp:59:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
user.cpp:61:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lf%lf%lf", &p[i].x, &p[i].y, &p[i].dist);
^
user.cpp: In function ‘void runDP()’:
user.cpp:111:9: warning: array subscript is above array bounds [-Warray-bounds]
dp[2][2] = (double)p[2].dist * dist(p[1], p[3]) / 2;
^
user.cpp:116:38: warning: array subscript is above array bounds [-Warray-bounds]
dp[2][i] = max(current + dp[2][i - 2], dp[2][i - 1]);
^
user.cpp:116:52: warning: array subscript is above array bounds [-Warray-bounds]
dp[2][i] = max(current + dp[2][i - 2], dp[2][i - 1]);
^
user.cpp:116:13: warning: array subscript is above array bounds [-Warray-bounds]
dp[2][i] = max(current + dp[2][i - 2], dp[2][i - 1]);
^
user.cpp:117:36: warning: array subscript is above array bounds [-Warray-bounds]
if(i == n && current + dp[2][i - 2] > dp[2][i - 1]) {
^
user.cpp:117:51: warning: array subscript is above array bounds [-Warray-bounds]
if(i == n && current + dp[2][i - 2] > dp[2][i - 1]) {
^
user.cpp:122:23: warning: array subscript is above array bounds [-Warray-bounds]
double val2 = dp[2][n];
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 324kb | Incorect | 0 |
2 | 0ms | 336kb | Corect | 5 |
3 | 0ms | 336kb | Corect | 5 |
4 | 0ms | 328kb | Corect | 5 |
5 | 0ms | 336kb | Corect | 5 |
6 | 0ms | 332kb | Incorect | 0 |
7 | 0ms | 332kb | Incorect | 0 |
8 | 0ms | 332kb | Corect | 5 |
9 | 0ms | 336kb | Incorect | 0 |
10 | 0ms | 336kb | Corect | 5 |
11 | 0ms | 348kb | Incorect | 0 |
12 | 0ms | 352kb | Incorect | 0 |
13 | 0ms | 352kb | Incorect | 0 |
14 | 0ms | 352kb | Incorect | 0 |
15 | 0ms | 352kb | Incorect | 0 |
16 | 0ms | 356kb | Incorect | 0 |
17 | 0ms | 360kb | Incorect | 0 |
18 | 0ms | 356kb | Incorect | 0 |
19 | 0ms | 360kb | Incorect | 0 |
20 | 0ms | 356kb | Incorect | 0 |
Punctaj total | 30 |