Borderou de evaluare (job #2536368)

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

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:92: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:144: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
325ms7471kbOK510
433ms7602kbOK5
5202ms12079kbOK520
6158ms10878kbOK5
7197ms11894kbOK5
8148ms10878kbOK5
9284ms16424kbOK520
10214ms14024kbOK5
11316ms16031kbOK5
12230ms14024kbOK5
13361ms18505kbOK520
14309ms16908kbOK5
15356ms19148kbOK5
16310ms16908kbOK5
17204ms20496kbMemory limit exceeded00
18337ms19005kbOK5
19280ms20492kbMemory limit exceeded0
20344ms19005kbOK5
Punctaj total80

Ceva nu functioneaza?