Borderou de evaluare (job #2944492)

Utilizator toma_ariciuAriciu Toma toma_ariciu Data 22 noiembrie 2022 17:01:42
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
53ms3854kbOK3
62ms3854kbOK3
73ms3854kbOK3
85ms3854kbOK3
95ms3854kbOK3
105ms3854kbOK3
115ms3854kbOK3
121502ms13066kbTime limit exceeded00
131501ms24453kbTime limit exceeded0
141505ms20332kbTime limit exceeded0
151503ms16642kbTime limit exceeded0
161504ms27189kbTime limit exceeded0
171504ms38354kbTime limit exceeded0
181500ms37969kbTime limit exceeded0
191262ms7647kbOK30
201143ms7503kbOK3
211502ms12849kbTime limit exceeded0
221505ms17543kbTime limit exceeded0
231501ms31506kbTime limit exceeded0
241505ms28180kbTime limit exceeded0
251502ms28033kbTime limit exceeded0
261501ms31297kbTime limit exceeded0
271501ms30851kbTime limit exceeded0
281501ms30834kbTime limit exceeded0
291501ms30793kbTime limit exceeded0
301505ms32759kbTime limit exceeded0
311505ms30699kbTime limit exceeded0
321501ms30818kbTime limit exceeded0
331505ms30822kbTime limit exceeded0
341505ms30736kbTime limit exceeded0
Punctaj total32

Ceva nu functioneaza?