Pagini recente » Borderou de evaluare (job #3239420) | Borderou de evaluare (job #768288) | Borderou de evaluare (job #2999942) | Borderou de evaluare (job #456702) | Borderou de evaluare (job #2944490)
Borderou de evaluare (job #2944490)
Raport evaluator
Compilare:
main.cpp:12:75: warning: built-in function 'log2' declared as non-function [-Wbuiltin-declaration-mismatch]
12 | int n, v[maxN], depth[maxN], euler[2 * maxN], poz_euler[maxN], ind_euler, log2[2 * maxN], morbius[maxVal], sum[maxN];
| ^~~~
main.cpp: In function 'int main()':
main.cpp:112:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
112 | for(int j = 0; j < nodes[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp:113:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
113 | for(int k = j + 1; k < nodes[i].size(); k++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp:89:20: warning: iteration 30003 invokes undefined behavior [-Waggressive-loop-optimizations]
89 | morbius[i] = -1;
| ~~~~~~~~~~~^~~~
main.cpp:88:22: note: within this loop
88 | for(int i = 2; i <= maxVal; i++)
| ~~^~~~~~~~~
main.cpp:92:18: warning: iteration 30003 invokes undefined behavior [-Waggressive-loop-optimizations]
92 | if(ciur[i])
| ~~~~~~^
main.cpp:90:22: note: within this loop
90 | for(int i = 2; i <= maxVal; i++)
| ~~^~~~~~~~~
main.cpp:106:21: warning: iteration 30003 invokes undefined behavior [-Waggressive-loop-optimizations]
106 | if(morbius[i] == 0)
| ~~~~~~~~~^
main.cpp:104:22: note: within this loop
104 | for(int i = 2; i <= maxVal; i++)
| ~~^~~~~~~~~
main.cpp:89:20: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [120020, 120023] is out of the bounds [0, 120020] of object 'morbius' with type 'int [30005]' [-Warray-bounds]
89 | morbius[i] = -1;
| ~~~~~~~~~~~^~~~
main.cpp:12:91: note: 'morbius' declared here
12 | int n, v[maxN], depth[maxN], euler[2 * maxN], poz_euler[maxN], ind_euler, log2[2 * maxN], morbius[maxVal], sum[maxN];
| ^~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 184kb | OK | 3 | 0 |
2 | 0ms | 184kb | OK | 3 |
3 | 0ms | 184kb | OK | 3 |
4 | 0ms | 184kb | OK | 3 |
5 | 5ms | 3854kb | Incorect | 0 |
6 | 4ms | 3854kb | Incorect | 0 |
7 | 2ms | 3854kb | Incorect | 0 |
8 | 5ms | 3854kb | Incorect | 0 |
9 | 4ms | 3854kb | Incorect | 0 |
10 | 2ms | 3854kb | Incorect | 0 |
11 | 4ms | 3854kb | Incorect | 0 |
12 | 1500ms | 12877kb | Time limit exceeded | 0 | 0 |
13 | 1500ms | 24383kb | Time limit exceeded | 0 |
14 | 1501ms | 20115kb | Time limit exceeded | 0 |
15 | 1504ms | 16519kb | Time limit exceeded | 0 |
16 | 1502ms | 26832kb | Time limit exceeded | 0 |
17 | 1503ms | 37969kb | Time limit exceeded | 0 |
18 | 1503ms | 37511kb | Time limit exceeded | 0 |
19 | 1189ms | 7598kb | Incorect | 0 | 0 |
20 | 1094ms | 7512kb | Incorect | 0 |
21 | 1500ms | 12783kb | Time limit exceeded | 0 |
22 | 1505ms | 17371kb | Time limit exceeded | 0 |
23 | 1503ms | 31014kb | Time limit exceeded | 0 |
24 | 1500ms | 27885kb | Time limit exceeded | 0 |
25 | 1502ms | 27676kb | Time limit exceeded | 0 |
26 | 1503ms | 30953kb | Time limit exceeded | 0 |
27 | 1501ms | 30531kb | Time limit exceeded | 0 |
28 | 1503ms | 30482kb | Time limit exceeded | 0 |
29 | 1506ms | 30351kb | Time limit exceeded | 0 |
30 | 1504ms | 32358kb | Time limit exceeded | 0 |
31 | 1500ms | 30343kb | Time limit exceeded | 0 |
32 | 1505ms | 30392kb | Time limit exceeded | 0 |
33 | 1505ms | 30392kb | Time limit exceeded | 0 |
34 | 1500ms | 30380kb | Time limit exceeded | 0 |
Punctaj total | 0 |