Borderou de evaluare (job #2143629)

Utilizator inquisitorAnders inquisitor Data 26 februarie 2018 09:46:46
Problema Radix Sort Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp:3:0: warning: ignoring #pragma optimize [-Wunknown-pragmas] #pragma optimize("O1") ^ user.cpp: In function ‘void CountingSort(u32*, u32*, u32)’: user.cpp:19:73: warning: operation on ‘i’ may be undefined [-Wsequence-point] for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]); ^ user.cpp:19:73: warning: operation on ‘i’ may be undefined [-Wsequence-point] user.cpp: In function ‘i32 main()’: user.cpp:51:56: warning: operation on ‘i’ may be undefined [-Wsequence-point] v[--i] = (u64(v[-~i]) * A + B) % 0x367C2DC9; ^ user.cpp:58:56: warning: operation on ‘i’ may be undefined [-Wsequence-point] v[--i] = (u64(v[-~i]) * A + B) % 0x7CE67EF6; ^ user.cpp:65:56: warning: operation on ‘i’ may be undefined [-Wsequence-point] v[--i] = (u64(v[-~i]) * A + B) % 0x6F6E4E7B; ^ user.cpp: At global scope: user.cpp:26:37: warning: always_inline function might not be inlinable [-Wattributes] __attribute__((always_inline)) void write(u32 x) ^ user.cpp:13:37: warning: always_inline function might not be inlinable [-Wattributes] __attribute__((always_inline)) void CountingSort(u32 A[], u32 B[], u32 digit) ^ user.cpp: In function ‘i32 main()’: user.cpp:41: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:43: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(u32*, u32*, u32)’: user.cpp:19:5: warning: iteration 255u invokes undefined behavior [-Waggressive-loop-optimizations] for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]); ^ user.cpp:19:24: note: containing loop for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms5524kbOK1030
28ms5524kbOK10
380ms13720kbOK10
484ms13716kbOK1040
5872ms87896kbOK10
6876ms87896kbOK10
7104ms13716kbOK10
8888ms89940kbOK1030
9864ms89944kbOK10
10884ms89944kbOK10
Punctaj total100

Ceva nu functioneaza?