Borderou de evaluare (job #2036521)

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

Raport evaluator

Compilare: user.cpp: In member function ‘int Treapuri::random()’: user.cpp:32:29: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] return ((rand()<<14 + rand())%MOD + MOD)%MOD + 1; ^ user.cpp: In function ‘void sterge(int)’: user.cpp:158: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:177:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = d; i < gr[node].size(); ++ i){ ^ user.cpp:192:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 1; i < gr[node].size(); ++ i){ ^ user.cpp:199: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:203:46: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 1; i < gr[node].size(); ++ i){ ^ user.cpp:210: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
18ms5948kbIncorect0
28ms5944kbIncorect0
336ms6424kbIncorect0
436ms6684kbIncorect0
5160ms10240kbIncorect0
6172ms10252kbIncorect0
7228ms10584kbIncorect0
8940ms21456kbIncorect0
9748ms9940kbIncorect0
10804ms15452kbIncorect0
111000ms15756kbIncorect0
121080ms19968kbIncorect0
131336ms24196kbIncorect0
141384ms38260kbIncorect0
153980ms120928kbIncorect0
162488ms30644kbIncorect0
172504ms30744kbIncorect0
182308ms33928kbIncorect0
192808ms36088kbIncorect0
203916ms120952kbIncorect0
Punctaj total0

Ceva nu functioneaza?