Borderou de evaluare (job #2797436)

Utilizator AlexandraBoghiuAlexandra Boghiu AlexandraBoghiu Data 9 noiembrie 2021 21:34:51
Problema BFS - Parcurgere in latime Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graph::getDegrees()': main.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 72 | for(int i = 0; i < this->listOfNeighbours.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::printListOfNeighbours(std::ostream&)': main.cpp:91:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 91 | for (int i = 1; i < this->listOfNeighbours.size() - 1; i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:94:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 94 | for (int j = 0; j < listOfNeighbours[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::stronglyConnectedComponents()': main.cpp:221:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 221 | for (int i = 0; i < solution.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp:223:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 223 | for (int j = 0; j < solution[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::biconnectedComponents()': main.cpp:275:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 275 | for (int i = 0; i < solution.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp:277:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 277 | for (int j = 0; j < solution[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::HavelHakimi(std::vector<int>)': main.cpp:294:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 294 | if (degrees.size() < node) | ~~~~~~~~~~~~~~~^~~~~~ main.cpp: In member function 'void Graph::criticalConnections()': main.cpp:338:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 338 | for (int i = 0; i < criticalEdges.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:340:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 340 | for (int j = 0; j < criticalEdges[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void sortaretInfoarena()': main.cpp:366:39: warning: unused variable 'sourceNode' [-Wunused-variable] 366 | int numberOfNodes, numberOfEdges, sourceNode; | ^~~~~~~~~~ main.cpp: In function 'void HavelHakimiRez()': main.cpp:401:39: warning: 'numberOfNodes' is used uninitialized in this function [-Wuninitialized] 401 | vector<int> degrees(numberOfNodes + 1); | ~~~~~~~~~~~~~~^~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbFisier de iesire lipsa0
21ms184kbFisier de iesire lipsa0
31ms184kbFisier de iesire lipsa0
48ms311kbFisier de iesire lipsa0
56ms389kbFisier de iesire lipsa0
6101ms1757kbFisier de iesire lipsa0
7171ms3993kbFisier de iesire lipsa0
8255ms5906kbFisier de iesire lipsa0
9868ms11792kbFisier de iesire lipsa0
10697ms11894kbFisier de iesire lipsa0
Punctaj total0

Ceva nu functioneaza?