Borderou de evaluare (job #2536371)

Utilizator nicolaefilatNicolae Filat nicolaefilat Data 1 februarie 2020 20:57:26
Problema Heavy Path Decomposition Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'void dfs(int, int)': main.cpp:39:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < graf[nod].size(); i++){ ~~^~~~~~~~~~~~~~~~~~ main.cpp:57:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < graf[nod].size(); i++){ ~~^~~~~~~~~~~~~~~~~~ main.cpp: In function 'void update(int, int, int, int, int, int)': main.cpp:91:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(nod * 2 + 1 < arbore_intervale[index_lant].size()) /// sa nu cumva sa ies din size ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void construieste_arbore(int)': main.cpp:143:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < lant[index_lant].size(); i++){ ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void dfs(int, int)': main.cpp:64:38: warning: 'vecin_bun' may be used uninitialized in this function [-Wmaybe-uninitialized] int unde = nod_lant[vecin_bun]; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
117ms7340kbOK510
217ms7340kbOK5
324ms7471kbOK510
434ms7602kbOK5
5172ms11292kbOK520
6124ms9830kbOK5
7169ms11239kbOK5
8128ms9961kbOK5
9311ms14987kbOK520
10201ms12058kbOK5
11313ms14749kbOK5
12231ms12189kbOK5
13361ms16801kbOK520
14286ms14417kbOK5
15363ms17444kbOK5
16297ms14417kbOK5
17406ms19251kbOK520
18319ms15859kbOK5
19402ms19070kbOK5
20320ms15859kbOK5
Punctaj total100

Ceva nu functioneaza?