Borderou de evaluare (job #2803375)

Utilizator mirceaisherebina mircea mirceaishere Data 19 noiembrie 2021 22:07:07
Problema Arbore partial de cost minim 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:199:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 199 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFS(int, bool*)': main.cpp:215:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 215 | 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:233:23: 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::findStronglyConnectedComponents(int, int&, int, std::vector<std::vector<int> >&, int*, int*, bool*, bool*, std::stack<int>&)': main.cpp:274:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 274 | 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:310:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 310 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)': main.cpp:338:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 338 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)': main.cpp:351:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 351 | for (int i = 0; i < connections.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::getMinimumDistances(int)': main.cpp:415:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 415 | for (int i = 0; i < edges[currentNode].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In static member function 'static bool Graph::isGraph(std::vector<int>)': main.cpp:541:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 541 | if (edges > nodeDegrees.size() - 1) | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, std::pair<int, int> > > WeightedGraph::getSortedEdges()': main.cpp:670:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 670 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'Graph WeightedGraph::getMinimumSpanningTree(int&)': main.cpp:714: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] 714 | for (int i = 0; i < sortedEdges.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbCorect10
21ms184kbCorect10
32ms184kbCost incorect0
41ms184kbCost incorect0
51ms184kbCost incorect0
6684ms21958kbCost incorect0
71000ms37838kbTime limit exceeded0
8185ms8638kbCost incorect0
9499ms9801kbCost incorect0
101003ms33505kbTime limit exceeded0
Punctaj total20

Ceva nu functioneaza?