Pagini recente » Borderou de evaluare (job #1945026) | Borderou de evaluare (job #2987840) | Borderou de evaluare (job #2320268) | Borderou de evaluare (job #2733794) | Borderou de evaluare (job #2271142)
Borderou de evaluare (job #2271142)
Raport evaluator
Compilare:
main.cpp: In function 'void rezolva(int, int, int)':
main.cpp:78:31: warning: self-comparison always evaluates to true [-Wtautological-compare]
if (aa[qr[i].index].u == aa[qr[i].index].u) {
~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:138:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("termite.in", "r", stdin);
^
main.cpp:139:38: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("termite.out", "w", stdout);
^
main.cpp:142:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d", &n, &m, &k, &q);
^
main.cpp:144:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &term[i]);
^
main.cpp:147:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &u, &v, &c);
^
main.cpp:175:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &u, &v, &t);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 19ms | 8519kb | OK | 10 |
| 2 | 20ms | 8519kb | OK | 10 |
| 3 | 168ms | 11665kb | OK | 10 |
| 4 | 328ms | 15597kb | OK | 10 |
| 5 | 437ms | 18219kb | OK | 10 |
| 6 | 474ms | 18743kb | OK | 10 |
| 7 | 711ms | 24375kb | OK | 10 |
| 8 | 974ms | 28311kb | OK | 10 |
| 9 | 882ms | 28180kb | OK | 10 |
| 10 | 865ms | 28180kb | OK | 10 |
| Punctaj total | 100 |