Borderou de evaluare (job #2806784)

Utilizator mirceaisherebina mircea mirceaishere Data 22 noiembrie 2021 23:31:24
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::printEdges(std::ostream&, bool)': main.cpp:233:27: 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::DFS(int, bool*)': main.cpp:250:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 250 | 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:268:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 268 | 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:309:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 309 | 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:345:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 345 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)': main.cpp:373:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 373 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)': main.cpp:386:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 386 | for (int i = 0; i < connections.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'virtual std::vector<int> Graph::getMinimumDistances(int)': main.cpp:450:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 450 | for (int i = 0; i < edges[currentNode].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In static member function 'static bool Graph::isGraph(std::vector<int>)': main.cpp:576:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 576 | 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:652: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] 652 | 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:788:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 788 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'Graph WeightedGraph::getMinimumSpanningTree(int&)': main.cpp:817: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] 817 | for (int i = 0; i < sortedEdges.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> WeightedGraph::getMinimumDistancesNegativeWeights(int, std::vector<std::vector<std::pair<int, int> > >)': main.cpp:872:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
16ms315kbOK55
26ms331kbOK55
32ms184kbOK55
42ms184kbOK55
52ms184kbOK55
62ms184kbOK510
711ms372kbOK5
859ms2740kbOK515
954ms2326kbOK5
1011ms364kbOK5
11102ms4628kbOK520
12126ms4231kbOK5
1392ms3997kbOK5
14173ms5554kbOK5
15226ms6877kbOK515
16179ms5902kbOK5
1725ms339kbOK5
18264ms9142kbOK515
19321ms10129kbOK5
2040ms401kbOK5
Punctaj total100

Ceva nu functioneaza?