Borderou de evaluare (job #2793184)

Utilizator PaduraruCristianPaduraru Cristian Daniel PaduraruCristian Data 3 noiembrie 2021 10:56:41
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 30

Raport evaluator

Compilare: main.cpp: In constructor 'Graph::Graph(int)': main.cpp:34:9: warning: 'Graph::index' will be initialized after [-Wreorder] 34 | int index; | ^~~~~ main.cpp:30:40: warning: 'std::vector<int> Graph::degrees' [-Wreorder] 30 | vector<int> lowest, level, father, degrees; | ^~~~~~~ main.cpp:44:5: warning: when initialized here [-Wreorder] 44 | Graph(int nr_noduri):n(nr_noduri), la(nr_noduri+1), componente_biconexe(0), componente_tconexe(0), lowest(0), level(0), father(0), onstack(0), index(0), degrees(0){} | ^~~~~ main.cpp: In member function 'void Graph::print_comp_biconexe_udg(std::ostream&)': main.cpp:211:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 211 | for(int i=1;i<componenta.size();++i) | ~^~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:396:13: warning: unused variable 'x' [-Wunused-variable] 396 | int n,m,x; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbOK55
21ms184kbOK55
31ms184kbOK55
41ms184kbOK55
51ms184kbIncorect00
61ms184kbOK510
71ms184kbOK5
8505ms765kbTime limit exceeded00
9500ms1126kbTime limit exceeded0
1013ms184kbOK5
11505ms749kbTime limit exceeded00
12500ms1970kbTime limit exceeded0
13509ms1961kbTime limit exceeded0
14507ms3559kbTime limit exceeded0
15504ms3575kbTime limit exceeded00
16502ms4546kbTime limit exceeded0
174ms184kbOK5
18506ms4378kbTime limit exceeded00
19502ms4493kbTime limit exceeded0
208ms307kbOK5
Punctaj total30

Ceva nu functioneaza?