Pagini recente » Borderou de evaluare (job #1221259) | Borderou de evaluare (job #2799190) | Borderou de evaluare (job #2232159) | Borderou de evaluare (job #1441504) | Borderou de evaluare (job #2804970)
Borderou de evaluare (job #2804970)
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 |
1 | 1ms | 184kb | OK | 10 |
2 | 1ms | 184kb | Incorect | 0 |
3 | 13ms | 307kb | Incorect | 0 |
4 | 5ms | 454kb | Incorect | 0 |
5 | 60ms | 2379kb | Incorect | 0 |
6 | 134ms | 4186kb | Incorect | 0 |
7 | 252ms | 5455kb | Incorect | 0 |
8 | 335ms | 12304kb | Memory limit exceeded | 0 |
9 | 452ms | 8491kb | OK | 10 |
10 | 541ms | 12304kb | Memory limit exceeded | 0 |
Punctaj total | 20 |