Borderou de evaluare (job #2208064)

Utilizator AlexandruLuchianov1Alex Luchianov AlexandruLuchianov1 Data 28 mai 2018 10:03:41
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:77:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ; h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~ user.cpp:86:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 1 ; h < g[node].size() ;h++) ~~^~~~~~~~~~~~~~~~ user.cpp:91:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0 ; h < g[node].size() ;h++){ ~~^~~~~~~~~~~~~~~~ user.cpp:98:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(h < g[node].size() - 1) ~~^~~~~~~~~~~~~~~~~~~~ user.cpp:105: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
14ms4544kbOK10
24ms4556kbOK10
38ms4600kbOK10
420ms4708kbOK10
536ms4820kbIncorect0
688ms5148kbOK10
7228ms5620kbOK10
8340ms6036kbOK10
9Depăşit6488kbTime limit exceeded.0
10Depăşit6712kbTime limit exceeded.0
Punctaj total70

Ceva nu functioneaza?