Pagini recente » Borderou de evaluare (job #1497159) | Borderou de evaluare (job #2289416) | Borderou de evaluare (job #1229573) | Borderou de evaluare (job #1483977) | Borderou de evaluare (job #1233669)
Borderou de evaluare (job #1233669)
Raport evaluator
Compilare:
user.cpp: In function ‘void read()’:
user.cpp:20:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
user.cpp:23:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
user.cpp:26:53: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=1;i<=n;i++) scanf("%d",&c[i]),ind[i]=i;
^
user.cpp: In function ‘int main()’:
user.cpp:95:33: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("egal.in","r",stdin);
^
user.cpp:96:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("egal.out","w",stdout);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 28ms | 8512kb | OK | 5 | 5 |
| 2 | 28ms | 8512kb | OK | 5 | 5 |
| 3 | 28ms | 8512kb | OK | 5 | 5 |
| 4 | 28ms | 8512kb | OK | 5 | 5 |
| 5 | 28ms | 8596kb | OK | 5 | 5 |
| 6 | 28ms | 8580kb | OK | 5 | 5 |
| 7 | 28ms | 8592kb | OK | 5 | 5 |
| 8 | 32ms | 8620kb | OK | 5 | 5 |
| 9 | 384ms | 21316kb | OK | 5 | 20 |
| 10 | 248ms | 15420kb | OK | 5 |
| 11 | 264ms | 15864kb | OK | 5 |
| 12 | 336ms | 19820kb | OK | 5 |
| 13 | 440ms | 22840kb | OK | 5 | 20 |
| 14 | 280ms | 16200kb | OK | 5 |
| 16 | 272ms | 15264kb | OK | 5 |
| 17 | 456ms | 24696kb | OK | 5 |
| 15 | 236ms | 18612kb | OK | 5 | 20 |
| 18 | 376ms | 20076kb | OK | 5 |
| 19 | 368ms | 18144kb | OK | 5 |
| 20 | 384ms | 18936kb | OK | 5 |
| Punctaj total | 100 |