Borderou de evaluare (job #2814144)

Utilizator redikusTiganus Alexandru redikus Data 7 decembrie 2021 17:28:41
Problema Diametrul unui arbore Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 90

Raport evaluator

Compilare: main.cpp: In constructor 'graf::graf(std::vector<std::vector<int> >, int, int)': main.cpp:11:30: warning: 'graf::adiacenta' will be initialized after [-Wreorder] 11 | vector < vector < int >> adiacenta; | ^~~~~~~~~ main.cpp:10:9: warning: 'int graf::noduri' [-Wreorder] 10 | int noduri, muchii; | ^~~~~~ main.cpp:15:5: warning: when initialized here [-Wreorder] 15 | graf(vector < vector < int >> listaAdiacenta, int noduri, int muchii): adiacenta(listaAdiacenta), noduri(noduri), muchii(muchii) {}; | ^~~~ main.cpp: In constructor 'graf::graf(int, int)': main.cpp:11:30: warning: 'graf::adiacenta' will be initialized after [-Wreorder] 11 | vector < vector < int >> adiacenta; | ^~~~~~~~~ main.cpp:10:9: warning: 'int graf::noduri' [-Wreorder] 10 | int noduri, muchii; | ^~~~~~ main.cpp:18:5: warning: when initialized here [-Wreorder] 18 | graf(int noduri, int muchii): adiacenta(noduri + 1), noduri(noduri), muchii(muchii) {}; | ^~~~ main.cpp: In function 'void darbDriver()': main.cpp:15:132: warning: 'm' may be used uninitialized in this function [-Wmaybe-uninitialized] 15 | graf(vector < vector < int >> listaAdiacenta, int noduri, int muchii): adiacenta(listaAdiacenta), noduri(noduri), muchii(muchii) {}; | ^ main.cpp:99:12: note: 'm' was declared here 99 | int n, m, a, b; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
520ms2523kbOK10
673ms8269kbOK10
7111ms11755kbOK10
8188ms17948kbOK10
9144ms20951kbOK10
10201ms23400kbTime limit exceeded0
Punctaj total90

Ceva nu functioneaza?