Pagini recente » Borderou de evaluare (job #262009) | Borderou de evaluare (job #504504) | Borderou de evaluare (job #1673489) | Borderou de evaluare (job #1580780) | Borderou de evaluare (job #2143641)
Borderou de evaluare (job #2143641)
Raport evaluator
Compilare:
user.cpp: In function ‘void CountingSort(u32*, u32*, u32)’:
user.cpp:17:73: warning: operation on ‘i’ may be undefined [-Wsequence-point]
for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
user.cpp:17:73: warning: operation on ‘i’ may be undefined [-Wsequence-point]
user.cpp: In function ‘i32 main()’:
user.cpp:50:56: warning: operation on ‘i’ may be undefined [-Wsequence-point]
v[--i] = (u64(v[-~i]) * A + B) % 0x367C2DC9;
^
user.cpp:57:56: warning: operation on ‘i’ may be undefined [-Wsequence-point]
v[--i] = (u64(v[-~i]) * A + B) % 0x7CE67EF6;
^
user.cpp:64: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:24:37: warning: always_inline function might not be inlinable [-Wattributes]
__attribute__((always_inline)) void write(u32 x)
^
user.cpp:11: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:39: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:40: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:42: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:17:5: warning: iteration 255u invokes undefined behavior [-Waggressive-loop-optimizations]
for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
^
user.cpp:17: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 |
1 | 0ms | 4916kb | OK | 10 | 30 |
2 | 8ms | 4916kb | OK | 10 |
3 | 80ms | 13104kb | OK | 10 |
4 | 84ms | 13104kb | OK | 10 | 40 |
5 | 876ms | 86404kb | OK | 10 |
6 | 876ms | 86404kb | OK | 10 |
7 | 104ms | 13108kb | OK | 10 |
8 | 892ms | 89168kb | OK | 10 | 30 |
9 | 860ms | 88588kb | OK | 10 |
10 | 888ms | 89108kb | OK | 10 |
Punctaj total | 100 |