Borderou de evaluare (job #2804970)

Utilizator mirceaisherebina mircea mirceaishere Data 21 noiembrie 2021 13:03:57
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 20

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::printEdges(std::ostream&, bool)': main.cpp:233:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 233 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFS(int, bool*)': main.cpp:250:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 250 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::findBiconnectedComponents(int, int, int, std::vector<std::vector<int> >&, int*, int*, bool*, std::stack<int>&)': main.cpp:268:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 268 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::findStronglyConnectedComponents(int, int&, int, std::vector<std::vector<int> >&, int*, int*, bool*, bool*, std::stack<int>&)': main.cpp:309:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 309 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::findCriticalEdges(int, int&, int, std::vector<std::vector<int> >&, int*, int*, bool*)': main.cpp:345:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 345 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)': main.cpp:373:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 373 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)': main.cpp:386:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 386 | for (int i = 0; i < connections.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'virtual std::vector<int> Graph::getMinimumDistances(int)': main.cpp:450:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 450 | for (int i = 0; i < edges[currentNode].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In static member function 'static bool Graph::isGraph(std::vector<int>)': main.cpp:576:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 576 | if (edges > nodeDegrees.size() - 1) | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::__cxx11::basic_string<char> > Graph::solveDisjointSetsTasks(std::vector<std::pair<int, std::pair<int, int> > >)': main.cpp:652:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 652 | for (int i = 0; i < tasks.size(); i++) | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, std::pair<int, int> > > WeightedGraph::getSortedEdges()': main.cpp:785:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 785 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'Graph WeightedGraph::getMinimumSpanningTree(int&)': main.cpp:814:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 814 | for (int i = 0; i < sortedEdges.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> WeightedGraph::getMinimumDistancesNegativeWeights(int)': main.cpp:869:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbOK10
21ms184kbIncorect0
313ms307kbIncorect0
45ms454kbIncorect0
560ms2379kbIncorect0
6134ms4186kbIncorect0
7252ms5455kbIncorect0
8335ms12304kbMemory limit exceeded0
9452ms8491kbOK10
10541ms12304kbMemory limit exceeded0
Punctaj total20

Ceva nu functioneaza?