Borderou de evaluare (job #2944491)

Utilizator toma_ariciuAriciu Toma toma_ariciu Data 22 noiembrie 2022 17:01:07
Problema Sumtree Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 32

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]; | ^~~~ main.cpp: In function 'int main()': main.cpp:113:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 113 | for(int j = 0; j < nodes[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~ main.cpp:114:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 114 | for(int k = j + 1; k < nodes[i].size(); k++) | ~~^~~~~~~~~~~~~~~~~ main.cpp:90:20: warning: iteration 30003 invokes undefined behavior [-Waggressive-loop-optimizations] 90 | morbius[i] = -1; | ~~~~~~~~~~~^~~~ main.cpp:89:22: note: within this loop 89 | for(int i = 2; i <= maxVal; i++) | ~~^~~~~~~~~ main.cpp:93:18: warning: iteration 30003 invokes undefined behavior [-Waggressive-loop-optimizations] 93 | if(ciur[i]) | ~~~~~~^ main.cpp:91:22: note: within this loop 91 | for(int i = 2; i <= maxVal; i++) | ~~^~~~~~~~~ main.cpp:107:21: warning: iteration 30003 invokes undefined behavior [-Waggressive-loop-optimizations] 107 | if(morbius[i] == 0) | ~~~~~~~~~^ main.cpp:105:22: note: within this loop 105 | for(int i = 2; i <= maxVal; i++) | ~~^~~~~~~~~ main.cpp:90: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] 90 | 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]; | ^~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms184kbOK333
20ms184kbOK3
30ms184kbOK3
40ms184kbOK3
55ms3854kbOK3
64ms3854kbOK3
73ms3854kbOK3
82ms3854kbOK3
95ms3854kbOK3
104ms3854kbOK3
112ms3854kbOK3
121505ms13053kbTime limit exceeded00
131500ms24489kbTime limit exceeded0
141501ms20279kbTime limit exceeded0
151502ms16695kbTime limit exceeded0
161500ms27246kbTime limit exceeded0
171502ms38244kbTime limit exceeded0
181503ms37908kbTime limit exceeded0
191237ms7602kbOK30
201154ms7471kbOK3
211503ms12853kbTime limit exceeded0
221503ms17522kbTime limit exceeded0
231505ms31432kbTime limit exceeded0
241507ms28233kbTime limit exceeded0
251501ms28069kbTime limit exceeded0
261502ms31309kbTime limit exceeded0
271501ms30814kbTime limit exceeded0
281502ms30875kbTime limit exceeded0
291502ms30830kbTime limit exceeded0
301501ms32837kbTime limit exceeded0
311502ms30752kbTime limit exceeded0
321502ms30752kbTime limit exceeded0
331502ms30740kbTime limit exceeded0
341502ms30736kbTime limit exceeded0
Punctaj total32

Ceva nu functioneaza?