Pagini recente » Borderou de evaluare (job #2676665) | Borderou de evaluare (job #1413079) | Borderou de evaluare (job #1661169) | Borderou de evaluare (job #487197) | Borderou de evaluare (job #2803917)
Borderou de evaluare (job #2803917)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::printEdges(std::ostream&, bool)':
main.cpp:221:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
221 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::DFS(int, bool*)':
main.cpp:237:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
237 | 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:255:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
255 | 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:296:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
296 | 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:332:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
332 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)':
main.cpp:360:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
360 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)':
main.cpp:373:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
373 | for (int i = 0; i < connections.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::getMinimumDistances(int)':
main.cpp:437:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
437 | for (int i = 0; i < edges[currentNode].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static bool Graph::isGraph(std::vector<int>)':
main.cpp:563:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
563 | 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:621: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]
621 | 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:742:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
742 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'Graph WeightedGraph::getMinimumSpanningTree(int&)':
main.cpp:771: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]
771 | for (int i = 0; i < sortedEdges.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:819:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 1ms | 184kb | OK | 10 | 10 |
2 | 1ms | 184kb | OK | 10 | 10 |
3 | 2ms | 184kb | OK | 10 | 10 |
4 | 1ms | 184kb | OK | 10 | 10 |
5 | 6ms | 438kb | OK | 10 | 30 |
6 | 94ms | 7319kb | OK | 10 |
7 | 93ms | 7430kb | OK | 10 |
8 | 127ms | 13471kb | OK | 10 | 10 |
9 | 58ms | 5922kb | OK | 10 | 10 |
10 | 156ms | 13086kb | Time limit exceeded | 0 | 0 |
Punctaj total | 90 |