Borderou de evaluare (job #2815515)

Utilizator Teodora11faranume Teodora11 Data 9 decembrie 2021 19:15:24
Problema Diametrul unui arbore Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In static member function 'static std::vector<std::vector<int> > Algorithms::getComponenteBiconexe(const std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&, std::vector<bool>&)': main.cpp:79:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 79 | for( int i = 1; i < adjacencyList.size(); ++i ) | ~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp: In static member function 'static std::vector<std::vector<int> > Algorithms::getComponenteTareConexe(const std::vector<std::vector<int> >&, const std::vector<std::vector<int> >&, std::vector<bool>&)': main.cpp:92:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 92 | for( int i = 1; i < adjacencyList.size(); ++i ) | ~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void solveDarb()': main.cpp:440:44: warning: unused variable 'furthestNode2' [-Wunused-variable] 440 | int n, maxDistance = -1, furthestNode, furthestNode2; | ^~~~~~~~~~~~~ main.cpp:464:20: warning: 'furthestNode' may be used uninitialized in this function [-Wmaybe-uninitialized] 464 | Algorithms::BFS(adjacencyList, furthestNode, distance); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
165ms65556kbMemory limit exceeded0
265ms65556kbMemory limit exceeded0
366ms65556kbMemory limit exceeded0
464ms65556kbMemory limit exceeded0
566ms65556kbMemory limit exceeded0
670ms65556kbMemory limit exceeded0
765ms65556kbMemory limit exceeded0
865ms65556kbMemory limit exceeded0
964ms65556kbMemory limit exceeded0
1067ms65556kbMemory limit exceeded0
Punctaj total0

Ceva nu functioneaza?