Borderou de evaluare (job #2829446)

Utilizator serafimalex2001Serafim Alex serafimalex2001 Data 8 ianuarie 2022 17:01:30
Problema Transport2 Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::addEdgeCost(int, int, int)': main.cpp:157:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<edgeCost> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 157 | if(AdCost.size() <= n) | ~~~~~~~~~~~~~~^~~~ main.cpp: In member function 'int Graph::getTransportValue()': main.cpp:295:9: warning: unused variable 'n' [-Wunused-variable] 295 | int n, x, y; | ^ main.cpp: In member function 'int Graph::getMinCostHamiltonCircuit()': main.cpp:652:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edgeCost>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 652 | for (int j = 0; j < AdCost[i].size(); ++j) | ~~^~~~~~~~~~~~~~~~~~ main.cpp:655:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 655 | for(int i = 0; i < dp.size(); ++i) | ~~^~~~~~~~~~~ main.cpp:662:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edgeCost>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 662 | for(int k = 0; k < AdCost[j].size(); ++k){ | ~~^~~~~~~~~~~~~~~~~~ main.cpp:669:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edgeCost>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 669 | for(int i = 0; i < AdCost[0].size(); ++i){ | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfsHopcroftKarp(std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:695:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 695 | for (int i = 0; i < Ad[node].size(); ++i) { | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::dfsHopcroftKarp(int, std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:709:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 709 | for(int i = 0; i < Ad[node].size(); ++i){ | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, int> > Graph::getMaxMatching(int, int)': main.cpp:727:9: warning: unused variable 'ct' [-Wunused-variable] 727 | int ct = 0; | ^~ main.cpp: In member function 'std::vector<std::tuple<int, int, int> > Graph::getMST()': main.cpp:278:41: warning: 'n' may be used uninitialized in this function [-Wmaybe-uninitialized] 278 | for(int i = 0; i < nr && solSize < n-1; ++i){ | ~^~ main.cpp: In member function 'int Graph::getTransportValue()': main.cpp:323:12: warning: 'costMinim' may be used uninitialized in this function [-Wmaybe-uninitialized] 323 | return costMinim; | ^~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
56ms303kbOK10
625ms1523kbOK10
7131ms5758kbOK10
8203ms10874kbOK10
9270ms11264kbOK10
102ms184kbOK10
Punctaj total100

Ceva nu functioneaza?