Borderou de evaluare (job #2036487)

Utilizator LucaSeriSeritan Luca LucaSeri Data 10 octombrie 2017 19:07:47
Problema Metro Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 35

Raport evaluator

Compilare: user.cpp: In member function ‘int Treapuri::random()’: user.cpp:34:29: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] return ((rand()<<15 + rand())%MOD + MOD)%MOD + 1; ^ user.cpp: In function ‘void sterge(int)’: user.cpp:165:46: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < trebuie_stergere.size(); ++ i){ ^ user.cpp: In function ‘void solve(int)’: user.cpp:184:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = d; i < gr[node].size(); ++ i){ ^ user.cpp:199:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 1; i < gr[node].size(); ++ i){ ^ user.cpp:206:65: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(heaviest == -1) for(int i = 0; i < statii[node].size(); ++ i){ Tr->add(Tr->root[node], statii[node][i]); ++heavy[node];} ^ user.cpp:210:46: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 1; i < gr[node].size(); ++ i){ ^ user.cpp:217:50: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < statii[node].size(); ++ i){ ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
18ms5960kbIncorect0
28ms5964kbIncorect0
328ms6788kbIncorect0
432ms6748kbOK5
5160ms10284kbIncorect0
6168ms10328kbIncorect0
7228ms10612kbOK5
8576ms25876kbIncorect0
9336ms16956kbIncorect0
10528ms16692kbOK5
11568ms23004kbIncorect0
12776ms21180kbOK5
134636msDepăşitMemory limit exceeded.0
14984ms43820kbIncorect0
153032ms130720kbOK5
161356ms44680kbIncorect0
171360ms44844kbIncorect0
181680ms36280kbOK5
195072msDepăşitMemory limit exceeded.0
203044ms130744kbOK5
Punctaj total35

Ceva nu functioneaza?