Borderou de evaluare (job #2822149)

Utilizator Teo_1101Mititelu Teodor Teo_1101 Data 23 decembrie 2021 17:17:10
Problema Cuplaj maxim in graf bipartit Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In constructor 'graph::graph(int, int, std::vector<std::vector<int> >&)': main.cpp:71:9: warning: 'graph::edges' will be initialized after [-Wreorder] 71 | int edges = 0; | ^~~~~ main.cpp:68:30: warning: 'std::vector<std::vector<int> > graph::Ad' [-Wreorder] 68 | vector< vector < int > > Ad; | ^~ main.cpp:82:5: warning: when initialized here [-Wreorder] 82 | graph( int n, int m, vector < vector < int > > & ad ) : nodes(n), edges(m), Ad(ad) {} | ^~~~~ main.cpp: In constructor 'graph::graph(int, int, std::vector<std::vector<int> >&, std::vector<std::vector<int> >&)': main.cpp:87:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 87 | for( int j = 0; j < ad[i].size(); ++j){ | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'void graph::DFS(int, std::vector<bool>&)': main.cpp:131:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 131 | for( int i = 0; i < Ad[nod].size(); ++i ){ | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'void graph::DFSr(int, std::vector<bool>&, std::vector<std::vector<int> >&, std::vector<int>&)': main.cpp:139:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 139 | for( int i = 0; i < ad[nod].size(); ++i ){ | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> graph::BFS(int)': main.cpp:156:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 156 | for( int i = 0; i < Ad[x].size(); ++i ){ | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<int, std::vector<std::pair<int, int> > > graph::Kruskal()': main.cpp:195:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 195 | for( int j = 0; j < Ad[i].size(); ++j ){ | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> graph::Dijkstra(int)': 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 < Ad[nod].size(); ++i ){ | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<bool, std::vector<int> > graph::BellmanFord(int)': main.cpp:267:27: 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 < Ad[nod].size(); ++i ){ | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'void graph::TopoDFS(int, std::vector<bool>&, std::stack<int>&)': main.cpp:294:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 294 | for( int i = 0; i < Ad[nod].size(); ++i ){ | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > graph::StronglyConnectedComponents()': main.cpp:316:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 316 | for( int j = 0; j < Ad[i].size(); ++j) | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'int** graph::RoyFloyd()': main.cpp:349:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 349 | for( int j = 0; j < Ad[i].size(); ++j ) | ~~^~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
52ms184kbOK10
611ms581kbOK10
721ms897kbOK10
830ms1056kbOK10
940ms1822kbOK10
1073ms2588kbOK10
Punctaj total100

Ceva nu functioneaza?