Pagini recente » Borderou de evaluare (job #2160378) | Borderou de evaluare (job #832316) | Borderou de evaluare (job #295251) | Borderou de evaluare (job #2137787)
Borderou de evaluare (job #2137787)
Raport evaluator
Compilare:
user.cpp: In function ‘void CountingSort(uint32_t*, uint32_t*, uint32_t)’:
user.cpp:12:78: warning: operation on ‘i’ may be undefined [-Wsequence-point]
for(uint32_t i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
user.cpp:12:78: warning: operation on ‘i’ may be undefined [-Wsequence-point]
user.cpp: In function ‘int main()’:
user.cpp:43:40: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("radixsort.in", "r", stdin);
^
user.cpp:44:42: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("radixsort.out", "w", stdout);
^
user.cpp:46:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d %d", &N, &A, &B, &C);
^
user.cpp: In function ‘void CountingSort(uint32_t*, uint32_t*, uint32_t)’:
user.cpp:12:5: warning: iteration 255u invokes undefined behavior [-Waggressive-loop-optimizations]
for(uint32_t i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
user.cpp:12:29: note: containing loop
for(uint32_t i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 4916kb | OK | 10 | 30 |
2 | 8ms | 4952kb | OK | 10 |
3 | 84ms | 13580kb | OK | 10 |
4 | 88ms | 13588kb | OK | 10 | 40 |
5 | 912ms | 87636kb | OK | 10 |
6 | 912ms | 87628kb | OK | 10 |
7 | 108ms | 14120kb | OK | 10 |
8 | 1056ms | 89684kb | OK | 10 | 30 |
9 | 1040ms | 89684kb | OK | 10 |
10 | 1060ms | 89684kb | OK | 10 |
Punctaj total | 100 |