Borderou de evaluare (job #2821505)

Utilizator dascalu_maraDascalu Mara Elena dascalu_mara Data 22 decembrie 2021 17:39:30
Problema Paduri de multimi disjuncte 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, bool*)': main.cpp:207:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 207 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::outputAdj()': main.cpp:215:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 215 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bfsUtil(int, bool*)': main.cpp:299:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 299 | for (int i = 0; i < adj[node].size(); i++) //parcurg toti vecinii sai | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::calculateIndegree(int*)': main.cpp:380:5: error: 'memset' was not declared in this scope 380 | memset(indegree, 0, nodes); | ^~~~~~ main.cpp:17:1: note: 'memset' is defined in header '<cstring>'; did you forget to '#include <cstring>'? 16 | #include <set> +++ |+#include <cstring> 17 | #include <tuple> main.cpp: In member function 'std::vector<int> Graph::topSort(int*, std::queue<int>)': main.cpp:405:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 405 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)': main.cpp:430:9: error: 'sort' was not declared in this scope; did you mean 'qsort'? 430 | sort(degree_seq.begin(), degree_seq.end(), greater<>()); | ^~~~ | qsort main.cpp:438:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 438 | 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:441:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 441 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, int> > Graph::apmUtil(std::vector<std::tuple<int, int, int> >&)': main.cpp:490:5: error: 'sort' was not declared in this scope; did you mean 'qsort'? 490 | sort(weight_edges.begin(), weight_edges.end(), sortByThird); //sortam vectorul crescator in functie de cost | ^~~~ | qsort main.cpp: In member function 'void Graph::Dijkstra()': main.cpp:19:13: error: 'INT_MAX' was not declared in this scope 19 | #define INF INT_MAX | ^~~~~~~ main.cpp:569:19: note: in expansion of macro 'INF' 569 | dist[i] = INF; | ^~~ main.cpp:17:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'? 16 | #include <set> +++ |+#include <climits> Non zero exit status: 1

Ceva nu functioneaza?