Pagini recente » Borderou de evaluare (job #493243) | Borderou de evaluare (job #3130480) | Borderou de evaluare (job #1617769) | Borderou de evaluare (job #506710) | Borderou de evaluare (job #1730320)
Borderou de evaluare (job #1730320)
Raport evaluator
Compilare:
user.cpp: In function ‘void quicksort(int, int)’:
user.cpp:37:11: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses]
if(v[i]==x)
^
user.cpp: In function ‘void gen()’:
user.cpp:48:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("file.in", "w", stdout);
^
user.cpp: In function ‘int main()’:
user.cpp:58:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("invsort.in", "r", stdin);
^
user.cpp:59:40: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("invsort.out", "w", stdout);
^
user.cpp:61:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
user.cpp:62:44: 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",&v[i]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 144ms | 31776kb | OK -> cost = 968755! | 5 |
2 | 144ms | 31768kb | OK -> cost = 968564! | 5 |
3 | 148ms | 31768kb | OK -> cost = 972096! | 5 |
4 | 144ms | 31772kb | OK -> cost = 971427! | 5 |
5 | 140ms | 31772kb | OK -> cost = 977383! | 5 |
6 | 140ms | 31776kb | OK -> cost = 892376! | 5 |
7 | 144ms | 31768kb | OK -> cost = 962135! | 5 |
8 | 148ms | 31772kb | OK -> cost = 981214! | 5 |
9 | 144ms | 31772kb | OK -> cost = 967835! | 5 |
10 | 144ms | 31776kb | OK -> cost = 990666! | 5 |
11 | 208ms | 31772kb | Sirul nu este sortat! | 0 |
12 | 204ms | 31776kb | Sirul nu este sortat! | 0 |
13 | 200ms | 31772kb | Sirul nu este sortat! | 0 |
14 | 196ms | 31772kb | Sirul nu este sortat! | 0 |
15 | 200ms | 31772kb | Sirul nu este sortat! | 0 |
16 | 196ms | 31776kb | Sirul nu este sortat! | 0 |
17 | 196ms | 31768kb | Sirul nu este sortat! | 0 |
18 | 200ms | 31768kb | Sirul nu este sortat! | 0 |
19 | 176ms | 31772kb | Sirul nu este sortat! | 0 |
20 | 200ms | 31772kb | Sirul nu este sortat! | 0 |
Punctaj total | 50 |