Pagini recente » Borderou de evaluare (job #422364) | Borderou de evaluare (job #2214564) | Borderou de evaluare (job #2804670) | Borderou de evaluare (job #1465752) | Borderou de evaluare (job #2806784)
Borderou de evaluare (job #2806784)
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:788:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
788 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'Graph WeightedGraph::getMinimumSpanningTree(int&)':
main.cpp:817: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]
817 | for (int i = 0; i < sortedEdges.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> WeightedGraph::getMinimumDistancesNegativeWeights(int, std::vector<std::vector<std::pair<int, int> > >)':
main.cpp:872:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 6ms | 315kb | OK | 5 | 5 |
| 2 | 6ms | 331kb | OK | 5 | 5 |
| 3 | 2ms | 184kb | OK | 5 | 5 |
| 4 | 2ms | 184kb | OK | 5 | 5 |
| 5 | 2ms | 184kb | OK | 5 | 5 |
| 6 | 2ms | 184kb | OK | 5 | 10 |
| 7 | 11ms | 372kb | OK | 5 |
| 8 | 59ms | 2740kb | OK | 5 | 15 |
| 9 | 54ms | 2326kb | OK | 5 |
| 10 | 11ms | 364kb | OK | 5 |
| 11 | 102ms | 4628kb | OK | 5 | 20 |
| 12 | 126ms | 4231kb | OK | 5 |
| 13 | 92ms | 3997kb | OK | 5 |
| 14 | 173ms | 5554kb | OK | 5 |
| 15 | 226ms | 6877kb | OK | 5 | 15 |
| 16 | 179ms | 5902kb | OK | 5 |
| 17 | 25ms | 339kb | OK | 5 |
| 18 | 264ms | 9142kb | OK | 5 | 15 |
| 19 | 321ms | 10129kb | OK | 5 |
| 20 | 40ms | 401kb | OK | 5 |
| Punctaj total | 100 |