Borderou de evaluare (job #2944490)

Utilizator toma_ariciuAriciu Toma toma_ariciu Data 22 noiembrie 2022 16:59:22
Problema Sumtree Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 0

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
10ms184kbOK30
20ms184kbOK3
30ms184kbOK3
40ms184kbOK3
55ms3854kbIncorect0
64ms3854kbIncorect0
72ms3854kbIncorect0
85ms3854kbIncorect0
94ms3854kbIncorect0
102ms3854kbIncorect0
114ms3854kbIncorect0
121500ms12877kbTime limit exceeded00
131500ms24383kbTime limit exceeded0
141501ms20115kbTime limit exceeded0
151504ms16519kbTime limit exceeded0
161502ms26832kbTime limit exceeded0
171503ms37969kbTime limit exceeded0
181503ms37511kbTime limit exceeded0
191189ms7598kbIncorect00
201094ms7512kbIncorect0
211500ms12783kbTime limit exceeded0
221505ms17371kbTime limit exceeded0
231503ms31014kbTime limit exceeded0
241500ms27885kbTime limit exceeded0
251502ms27676kbTime limit exceeded0
261503ms30953kbTime limit exceeded0
271501ms30531kbTime limit exceeded0
281503ms30482kbTime limit exceeded0
291506ms30351kbTime limit exceeded0
301504ms32358kbTime limit exceeded0
311500ms30343kbTime limit exceeded0
321505ms30392kbTime limit exceeded0
331505ms30392kbTime limit exceeded0
341500ms30380kbTime limit exceeded0
Punctaj total0

Ceva nu functioneaza?