Borderou de evaluare (job #2817629)

Utilizator dascalu_maraDascalu Mara Elena dascalu_mara Data 13 decembrie 2021 22:49:42
Problema Cuplaj maxim in graf bipartit Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::DFS(int)': main.cpp:198:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 198 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::afis_adj(int)': main.cpp:205:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 205 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::BFSUtil(int)': main.cpp:297:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 297 | for (int i = 0; i < adj[node].size(); i++) //parcurg toti vecinii sai | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::topSort(int*, std::queue<int>)': main.cpp:414:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 414 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)': main.cpp:445:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 445 | if (top > degree_seq.size()) // daca valoarea primului element este mare decat numarul de elemente ramase, nu putem construi un astfel de graf | ~~~~^~~~~~~~~~~~~~~~~~~ main.cpp:448:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 448 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::Dijkstra()': main.cpp:589:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 589 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente ale lui node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::Bellman_Ford()': main.cpp:627:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 627 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente cu node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfs_maxFlow(int, int, std::vector<std::vector<int> >, int*)': main.cpp:667:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 667 | for (int i = 0 ; i < adj_capacity[node].size(); i++) //parcurg toate nodurile adiacente cu nodul curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::Edmonds_Karp(int, int)': main.cpp:694:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 694 | for (int j = 0; j < adj_capacity[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsUtil(int, int&, int, int&)': main.cpp:777:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 777 | for (int i = 0; i < adj[src].size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfs_hopcroftKarp(int*, int*, int*)': main.cpp:893:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 893 | for (int i = 0 ; i < adj[u].size() ; i++) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::dfs_hopcroftKarp(int, int*, int*, int*)': main.cpp:913:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 913 | for (int i = 0 ; i < adj[u].size() ; i++)
Test Timp executie Memorie folosita Mesaj Punctaj/test
119ms14839kbRaspuns gresit0
220ms14819kbRaspuns gresit0
320ms14761kbRaspuns gresit0
419ms14798kbRaspuns gresit0
519ms14921kbRaspuns gresit0
629ms15110kbRaspuns gresit0
738ms15298kbRaspuns gresit0
848ms15306kbRaspuns gresit0
958ms15609kbRaspuns gresit0
1091ms16121kbRaspuns gresit0
Punctaj total0

Ceva nu functioneaza?