Borderou de evaluare (job #2208065)

Utilizator AlexandruLuchianov1Alex Luchianov AlexandruLuchianov1 Data 28 mai 2018 10:06:50
Problema Tree Search Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 70

Raport evaluator

Compilare: user.cpp: In function ‘void dfs(int, int)’: user.cpp:25:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ; h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~ user.cpp: In function ‘int findcentroid(int, int)’: user.cpp:35:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ; h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~ user.cpp: In function ‘long long int findpath(int, int, long long int)’: user.cpp:53:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ;h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~ user.cpp: In function ‘void solve(int, int)’: user.cpp:75:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ; h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~ user.cpp:84:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 1 ; h < g[node].size() ;h++) ~~^~~~~~~~~~~~~~~~ user.cpp:89:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ; h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~ user.cpp:96:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(h < g[node].size() - 1) ~~^~~~~~~~~~~~~~~~~~~~ user.cpp:103:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ; h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms3452kbOK10
20ms3464kbOK10
34ms3528kbOK10
416ms3660kbOK10
532ms3808kbIncorect0
680ms4312kbOK10
7212ms5176kbOK10
8316ms5860kbOK10
9Depăşit6456kbTime limit exceeded.0
10Depăşit7352kbTime limit exceeded.0
Punctaj total70

Ceva nu functioneaza?