Borderou de evaluare (job #3165360)

Utilizator sumithesumSumurduc Alexandru sumithesum Data 6 noiembrie 2023 03:13:12
Problema Padure Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: main.cpp: In constructor 'Graph::Graph(int, std::vector<std::vector<int> >&)': main.cpp:24:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 24 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:23:17: warning: 'std::vector<int> Graph::dplus' [-Wreorder] 23 | vector<int> dplus; // grad + (degree +) | ^~~~~ main.cpp:37:5: warning: when initialized here [-Wreorder] 37 | Graph(int numCourses, vector<vector<int>>& prerequisites) : n(numCourses), graph(numCourses), dplus(numCourses, 0) { | ^~~~~ main.cpp: In constructor 'Graph::Graph(int, std::vector<std::vector<int> >&, std::string)': main.cpp:22:9: warning: 'Graph::n' will be initialized after [-Wreorder] 22 | int n,m,pl, pc, cl, cc; | ^ main.cpp:20:27: warning: 'std::vector<int> Graph::recursie' [-Wreorder] 20 | vector<int> color,dfs,recursie; ///Nestiut = -1 , A = 0 ,B=0 | ^~~~~~~~ main.cpp:61:5: warning: when initialized here [-Wreorder] 61 | Graph(int n, vector<vector<int>>& connections , string aux) :n(n),recursie(n,0) ,graph(n), visitat(n, false) { | ^~~~~ main.cpp:24:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 24 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:21:18: warning: 'std::vector<bool> Graph::visitat' [-Wreorder] 21 | vector<bool> visitat; | ^~~~~~~ main.cpp:61:5: warning: when initialized here [-Wreorder] 61 | Graph(int n, vector<vector<int>>& connections , string aux) :n(n),recursie(n,0) ,graph(n), visitat(n, false) { | ^~~~~ main.cpp: In constructor 'Graph::Graph(int, int, int, int, int, int)': main.cpp:79:147: error: 'INT_MAX' was not declared in this scope 79 | Graph(int n,int m , int pl , int pc , int cl , int cc):n(n),m(m),pl(pl),pc(pc),cl(cl),cc(cc),padure(n, vector<int>(m)),cost(n, vector<int>(m, INT_MAX)){ | ^~~~~~~ main.cpp:8:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'? 7 | #include <fstream> +++ |+#include <climits> 8 | using namespace std; main.cpp: In member function 'std::vector<int> Graph::topologicalSort()': main.cpp:147:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 147 | if (resultat.size() == n) { | ~~~~~~~~~~~~~~~~^~~~ main.cpp: In member function 'bool Graph::isSafe(int)': main.cpp:163:14: warning: unused variable 'sigur' [-Wunused-variable] 163 | bool sigur = true; | ^~~~~ main.cpp: In member function 'void Graph::dfs_drum(int, int, std::vector<std::pair<int, int> >&)': main.cpp:269:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 269 | if (x < 0 || x >= n || y < 0 || y >= graph[0].size() || graph[x][y] == 0 || visited[x][y]) { | ~~^~~~~~~~~~~~~~~~~~ Non zero exit status: 1

Ceva nu functioneaza?