Pagini recente » Cod sursa (job #448246) | Borderou de evaluare (job #1049940) | Borderou de evaluare (job #121034) | Borderou de evaluare (job #1604590) | Borderou de evaluare (job #2388320)
Borderou de evaluare (job #2388320)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:30:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i <= n; i++) {
~~^~~~
main.cpp:24:38: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("hacker3.in", "r", stdin);
^
main.cpp:25:40: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("hacker3.out", "w", stdout);
^
main.cpp:29:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%u", &n);
^
main.cpp:31:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%llu %llu", &a[i], &b[i]);
^
main.cpp: In function 'void init_pows()':
main.cpp:19:17: warning: iteration 10 invokes undefined behavior [-Waggressive-loop-optimizations]
pow2[i] = 1 << i;
~~~~~~~~^~~~~~~~
main.cpp:18:24: note: within this loop
for (uint i = 0; i < 31; i++) {
~~^~~~
main.cpp: In function 'int main()':
main.cpp:51:20: warning: iteration 10 invokes undefined behavior [-Waggressive-loop-optimizations]
if (dp[n][i]) sol = min(sol, dp[n][i]);
~~~~~~~^
main.cpp:50:24: note: within this loop
for (uint i = 0; i <= pmax; i++) {
~~^~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 2ms | 131kb | OK | 5 | 5 |
| 2 | 2ms | 131kb | Incorect | 0 | 0 |
| 3 | 2ms | 131kb | Incorect | 0 | 0 |
| 4 | 2ms | 131kb | Incorect | 0 | 0 |
| 5 | 6ms | 262kb | Incorect | 0 | 0 |
| 6 | 6ms | 262kb | Incorect | 0 | 0 |
| 7 | 6ms | 262kb | Incorect | 0 | 0 |
| 8 | 6ms | 262kb | Incorect | 0 | 0 |
| 9 | 309ms | 1179kb | Incorect | 0 | 0 |
| 10 | 308ms | 1179kb | Incorect | 0 |
| 11 | 312ms | 1179kb | Incorect | 0 |
| 12 | 312ms | 1179kb | Incorect | 0 |
| 13 | 320ms | 1179kb | Incorect | 0 |
| 14 | 323ms | 1179kb | Incorect | 0 |
| 15 | 41ms | 4751kb | Memory limit exceeded | 0 | 0 |
| 16 | 54ms | 4751kb | Memory limit exceeded | 0 |
| 17 | 49ms | 4751kb | Memory limit exceeded | 0 |
| 18 | 47ms | 4751kb | Memory limit exceeded | 0 |
| 19 | 54ms | 4751kb | Memory limit exceeded | 0 |
| 20 | 71ms | 4751kb | Memory limit exceeded | 0 |
| Punctaj total | 5 |