Borderou de evaluare (job #2793181)

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

Raport evaluator

Compilare: main.cpp: In constructor 'Graph::Graph(int)': main.cpp:35:9: warning: 'Graph::index' will be initialized after [-Wreorder] 35 | int index; | ^~~~~ main.cpp:31:40: warning: 'std::vector<int> Graph::degrees' [-Wreorder] 31 | vector<int> lowest, level, father, degrees; | ^~~~~~~ main.cpp:45:5: warning: when initialized here [-Wreorder] 45 | 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:212:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 212 | for(int i=1;i<componenta.size();++i) | ~^~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:397:13: warning: unused variable 'x' [-Wunused-variable] 397 | int n,m,x; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbIncorect00
22ms184kbIncorect00
31ms184kbIncorect00
41ms184kbIncorect00
51ms184kbIncorect00
61ms184kbIncorect00
71ms184kbIncorect0
8500ms753kbTime limit exceeded00
9501ms1167kbTime limit exceeded0
101ms184kbIncorect0
11511ms774kbTime limit exceeded00
12502ms1986kbTime limit exceeded0
13506ms1880kbTime limit exceeded0
14503ms4554kbTime limit exceeded0
15501ms3571kbTime limit exceeded00
16500ms4444kbTime limit exceeded0
171ms184kbIncorect0
18505ms4128kbTime limit exceeded00
19501ms4124kbTime limit exceeded0
203ms307kbIncorect0
Punctaj total0

Ceva nu functioneaza?