Borderou de evaluare (job #2804035)

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

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:857: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
16ms339kbOK55
27ms307kbOK55
32ms204kbOK55
41ms184kbOK55
51ms184kbOK55
62ms184kbOK510
725ms315kbOK5
8303ms2605kbOK515
9145ms4341kbOK5
1044ms360kbOK5
11324ms4313kbOK50
12417ms9781kbOK5
13300ms7028kbOK5
14500ms12746kbTime limit exceeded0
15505ms14782kbTime limit exceeded00
16503ms9986kbTime limit exceeded0
1790ms364kbOK5
18503ms15294kbTime limit exceeded00
19503ms17502kbTime limit exceeded0
20228ms438kbOK5
Punctaj total50

Ceva nu functioneaza?