Borderou de evaluare (job #2816575)

Utilizator mirceaisherebina mircea mirceaishere Data 11 decembrie 2021 16:41:45
Problema Cuplaj maxim in graf bipartit Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 80

Raport evaluator

Compilare: main.cpp:252: warning: ignoring '#pragma region GraphClassImplementation' [-Wunknown-pragmas] 252 | #pragma region GraphClassImplementation | main.cpp:810: warning: ignoring '#pragma endregion EndGrapClassImplementation' [-Wunknown-pragmas] 810 | #pragma endregion EndGrapClassImplementation | main.cpp:946: warning: ignoring '#pragma region WeightedGraphClassImplementation' [-Wunknown-pragmas] 946 | #pragma region WeightedGraphClassImplementation | main.cpp:1334: warning: ignoring '#pragma endregion EndWeightedGraphClassImplementation' [-Wunknown-pragmas] 1334 | #pragma endregion EndWeightedGraphClassImplementation | main.cpp:1388: warning: ignoring '#pragma region FlowNetworkImplementation' [-Wunknown-pragmas] 1388 | #pragma region FlowNetworkImplementation | main.cpp:1499: warning: ignoring '#pragma endregion EndFlowNetworkImplementation' [-Wunknown-pragmas] 1499 | #pragma endregion EndFlowNetworkImplementation | main.cpp: In member function 'void Graph::printEdges(std::ostream&, bool)': main.cpp:257:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 257 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFS(int, bool*)': 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::findBiconnectedComponents(int, int, int, std::vector<std::vector<int> >&, int*, int*, bool*, std::stack<int>&)': main.cpp:292:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 292 | 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:333:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 333 | 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:369:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 369 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)': main.cpp:397:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 397 | for (int i = 0; i < edges[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)': main.cpp:410:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 410 | for (int i = 0; i < connections.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'virtual std::vector<int> Graph::getMinimumDistances(int)': main.cpp:474:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 474 | for (int i = 0; i < edges[currentNode].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
56ms200kbOK10
683ms540kbOK10
735ms737kbOK10
8136ms946kbOK10
9204ms1306kbTime limit exceeded0
10204ms1638kbTime limit exceeded0
Punctaj total80

Ceva nu functioneaza?