Pagini recente » Borderou de evaluare (job #1407717) | Borderou de evaluare (job #2522576) | Borderou de evaluare (job #981463) | Borderou de evaluare (job #2871587) | Borderou de evaluare (job #2787982)
Borderou de evaluare (job #2787982)
Raport evaluator
Compilare:
main.cpp: In function 'void solve()':
main.cpp:27:13: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
27 | else
| ^~~~
main.cpp:31:17: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
31 | if (j - i >= 2 && (a[i] + a[j] + dp[0][i + 1].second - dp[0][i + 1].first > dp[2][i].first - dp[2][i].second))
| ^~
main.cpp:30:26: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
30 | else dp[2][i].first = a[j] + dp[1][i].second, dp[2][i].second = dp[1][i].first;
| ~~~~^
main.cpp:18:28: note: while referencing 'dp'
18 | pair<long long, long long> dp[2][2001];
| ^~
main.cpp:30:67: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
30 | else dp[2][i].first = a[j] + dp[1][i].second, dp[2][i].second = dp[1][i].first;
| ~~~~^
main.cpp:18:28: note: while referencing 'dp'
18 | pair<long long, long long> dp[2][2001];
| ^~
main.cpp:29:25: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
29 | dp[2][i].first = a[i] + dp[1][i + 1].second, dp[2][i].second = dp[1][i + 1].first;
| ~~~~^
main.cpp:18:28: note: while referencing 'dp'
18 | pair<long long, long long> dp[2][2001];
| ^~
main.cpp:29:70: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
29 | dp[2][i].first = a[i] + dp[1][i + 1].second, dp[2][i].second = dp[1][i + 1].first;
| ~~~~^
main.cpp:18:28: note: while referencing 'dp'
18 | pair<long long, long long> dp[2][2001];
| ^~
main.cpp:26:21: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
26 | dp[2][i] = {a[i], 0};
| ~~~~^
main.cpp:26:21: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
main.cpp:31:97: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
31 | if (j - i >= 2 && (a[i] + a[j] + dp[0][i + 1].second - dp[0][i + 1].first > dp[2][i].first - dp[2][i].second))
| ~~~~^
main.cpp:18:28: note: while referencing 'dp'
18 | pair<long long, long long> dp[2][2001];
| ^~
main.cpp:31:114: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
31 | if (j - i >= 2 && (a[i] + a[j] + dp[0][i + 1].second - dp[0][i + 1].first > dp[2][i].first - dp[2][i].second))
| ~~~~^
main.cpp:18:28: note: while referencing 'dp'
18 | pair<long long, long long> dp[2][2001];
| ^~
main.cpp:32:25: warning: array subscript 2 is above array bounds of 'std::pair<long long int, long long int> [2][2001]' [-Warray-bounds]
32 | dp[2][i].first = a[i] + a[j] + dp[0][i + 1].second, dp[2][i].second = dp[0][i + 1].first;
| ~~~~^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 1ms | 184kb | Incorect | 0 |
2 | 1ms | 184kb | Incorect | 0 |
3 | 1ms | 184kb | Incorect | 0 |
4 | 1ms | 184kb | Incorect | 0 |
5 | 12ms | 311kb | Incorect | 0 |
6 | 20ms | 307kb | Incorect | 0 |
7 | 54ms | 307kb | Killed by Signal 11 | 0 |
8 | 30ms | 200kb | Killed by Signal 11 | 0 |
9 | 82ms | 307kb | Killed by Signal 11 | 0 |
10 | 86ms | 286kb | Killed by Signal 11 | 0 |
Punctaj total | 0 |