Pagini recente » Borderou de evaluare (job #2024157) | Borderou de evaluare (job #2064467) | Borderou de evaluare (job #2663183) | Borderou de evaluare (job #1915092) | Borderou de evaluare (job #2140099)
Borderou de evaluare (job #2140099)
Raport evaluator
Compilare:
user.cpp: In function ‘void CountingSort(int*, int*, int)’:
user.cpp:11:73: warning: operation on ‘i’ may be undefined [-Wsequence-point]
for(int i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
user.cpp:11:73: warning: operation on ‘i’ may be undefined [-Wsequence-point]
user.cpp: At global scope:
user.cpp:5:37: warning: always_inline function might not be inlinable [-Wattributes]
__attribute__((always_inline)) void CountingSort(int A[], int B[], int digit)
^
user.cpp: In function ‘int main()’:
user.cpp:18: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:19: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:21: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(int*, int*, int)’:
user.cpp:11:5: warning: iteration 255u invokes undefined behavior [-Waggressive-loop-optimizations]
for(int i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
user.cpp:11:24: note: containing loop
for(int i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 2872kb | OK | 10 | 30 |
2 | 12ms | 3264kb | OK | 10 |
3 | 112ms | 12296kb | OK | 10 |
4 | 116ms | 12292kb | OK | 10 | 40 |
5 | 1240ms | 78940kb | OK | 10 |
6 | 1216ms | 78948kb | OK | 10 |
7 | 140ms | 12292kb | OK | 10 |
8 | 1400ms | 78940kb | OK | 10 | 30 |
9 | 1368ms | 78940kb | OK | 10 |
10 | 1396ms | 78948kb | OK | 10 |
Punctaj total | 100 |