Borderou de evaluare (job #2804027)

Utilizator mirceaisherebina mircea mirceaishere Data 20 noiembrie 2021 18:29:15
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 15

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
15ms307kbKilled by Signal 1100
24ms335kbKilled by Signal 1100
31ms184kbOK55
42ms184kbOK55
51ms184kbOK55
61ms184kbOK50
731ms315kbKilled by Signal 110
8179ms2637kbOK50
9257ms4313kbOK5
1045ms360kbKilled by Signal 110
11279ms4399kbOK50
12497ms9785kbOK5
13501ms7000kbTime limit exceeded0
14501ms12746kbTime limit exceeded0
15503ms10035kbTime limit exceeded00
16504ms12156kbTime limit exceeded0
17147ms364kbKilled by Signal 110
18503ms11415kbTime limit exceeded00
19503ms17022kbTime limit exceeded0
20228ms434kbKilled by Signal 110
Punctaj total15

Ceva nu functioneaza?