Borderou de evaluare (job #2830399)

Utilizator iustin.pericicaPericica Iustin iustin.pericica Data 9 ianuarie 2022 21:00:37
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 70

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::bfs(int)': main.cpp:158:13: warning: unused variable 'prim' [-Wunused-variable] 158 | int prim, ultim, i; | ^~~~ main.cpp:158:19: warning: unused variable 'ultim' [-Wunused-variable] 158 | int prim, ultim, i; | ^~~~~ main.cpp:158:26: warning: unused variable 'i' [-Wunused-variable] 158 | int prim, ultim, i; | ^ main.cpp: In member function 'void Graph::getSSCComponents()': main.cpp:265:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 265 | for(int i = 0; i < sscComponents.size() ;++i){ | ~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:253:13: warning: unused variable 'sscCounter' [-Wunused-variable] 253 | int sscCounter = 0; | ^~~~~~~~~~ main.cpp: In static member function 'static bool Graph::graphExists(std::vector<int>&)': main.cpp:351:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 351 | if ( firstEl > a.size() ) return false; | ~~~~~~~~^~~~~~~~~~ main.cpp: In member function 'int Graph::maxFlow(int, int)': main.cpp:462:25: warning: suggest parentheses around assignment used as truth value [-Wparentheses] 462 | while (new_flow = this->bfsMF(s, t, parent)) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbCorect10
22ms262kbCorect10
32ms184kbCorect10
42ms184kbCorect10
52ms184kbCorect10
61001ms5050kbTime limit exceeded0
71004ms10268kbTime limit exceeded0
8353ms2154kbCorect10
9122ms1953kbCorect10
101000ms8478kbTime limit exceeded0
Punctaj total70

Ceva nu functioneaza?