Pagini recente » Borderou de evaluare (job #1913552) | Borderou de evaluare (job #340663) | Borderou de evaluare (job #129507) | Borderou de evaluare (job #555233) | Borderou de evaluare (job #2804027)
Borderou de evaluare (job #2804027)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::printEdges(std::ostream&, bool)':
main.cpp:232:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
232 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::DFS(int, bool*)':
main.cpp:249:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
249 | 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:267:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
267 | 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:308:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
308 | 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:344:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
344 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)':
main.cpp:372:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
372 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)':
main.cpp:385:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
385 | for (int i = 0; i < connections.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'virtual std::vector<int> Graph::getMinimumDistances(int)':
main.cpp:449:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
449 | for (int i = 0; i < edges[currentNode].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static bool Graph::isGraph(std::vector<int>)':
main.cpp:575:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
575 | 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:651: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]
651 | 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:773:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
773 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'Graph WeightedGraph::getMinimumSpanningTree(int&)':
main.cpp:802: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]
802 | for (int i = 0; i < sortedEdges.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'virtual std::vector<int> WeightedGraph::getMinimumDistances(int)':
main.cpp:856: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 |
Punctaj/grupa |
| 1 | 5ms | 307kb | Killed by Signal 11 | 0 | 0 |
| 2 | 4ms | 335kb | Killed by Signal 11 | 0 | 0 |
| 3 | 1ms | 184kb | OK | 5 | 5 |
| 4 | 2ms | 184kb | OK | 5 | 5 |
| 5 | 1ms | 184kb | OK | 5 | 5 |
| 6 | 1ms | 184kb | OK | 5 | 0 |
| 7 | 31ms | 315kb | Killed by Signal 11 | 0 |
| 8 | 179ms | 2637kb | OK | 5 | 0 |
| 9 | 257ms | 4313kb | OK | 5 |
| 10 | 45ms | 360kb | Killed by Signal 11 | 0 |
| 11 | 279ms | 4399kb | OK | 5 | 0 |
| 12 | 497ms | 9785kb | OK | 5 |
| 13 | 501ms | 7000kb | Time limit exceeded | 0 |
| 14 | 501ms | 12746kb | Time limit exceeded | 0 |
| 15 | 503ms | 10035kb | Time limit exceeded | 0 | 0 |
| 16 | 504ms | 12156kb | Time limit exceeded | 0 |
| 17 | 147ms | 364kb | Killed by Signal 11 | 0 |
| 18 | 503ms | 11415kb | Time limit exceeded | 0 | 0 |
| 19 | 503ms | 17022kb | Time limit exceeded | 0 |
| 20 | 228ms | 434kb | Killed by Signal 11 | 0 |
| Punctaj total | 15 |