Borderou de evaluare (job #2817627)

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

Raport evaluator

Eroare de 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:287:5: error: 'memset' was not declared in this scope 287 | memset(cost, -1, sizeof(cost)); | ^~~~~~ main.cpp:18:1: note: 'memset' is defined in header '<cstring>'; did you forget to '#include <cstring>'? 17 | #include <set> +++ |+#include <cstring> 18 | #include <tuple> 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::calculateIndegree(int*)': main.cpp:390:5: error: 'memset' was not declared in this scope 390 | memset(indegree, 0, no_nodes); | ^~~~~~ main.cpp:390:5: note: 'memset' is defined in header '<cstring>'; did you forget to '#include <cstring>'? 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:437:9: error: 'sort' was not declared in this scope; did you mean 'qsort'? 437 | sort(degree_seq.begin(), degree_seq.end(), greater<>()); | ^~~~ | qsort 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:20:13: error: 'INT_MAX' was not declared in this scope 20 | #define INF INT_MAX | ^~~~~~~ main.cpp:580:19: note: in expansion of macro 'INF' 580 | dist[i] = INF; | ^~~ main.cpp:18:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'? 17 | #include <set> +++ |+#include <climits> 18 | #include <tuple> Non zero exit status: 1

Ceva nu functioneaza?