Borderou de evaluare (job #3165363)

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

Raport evaluator

Compilare: main.cpp: In constructor 'Graph::Graph(int, std::vector<std::vector<int> >&)': main.cpp:25:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 25 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:24:17: warning: 'std::vector<int> Graph::dplus' [-Wreorder] 24 | vector<int> dplus; // grad + (degree +) | ^~~~~ main.cpp:38:5: warning: when initialized here [-Wreorder] 38 | 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:23:9: warning: 'Graph::n' will be initialized after [-Wreorder] 23 | int n,m,pl, pc, cl, cc; | ^ main.cpp:21:27: warning: 'std::vector<int> Graph::recursie' [-Wreorder] 21 | vector<int> color,dfs,recursie; ///Nestiut = -1 , A = 0 ,B=0 | ^~~~~~~~ main.cpp:62:5: warning: when initialized here [-Wreorder] 62 | Graph(int n, vector<vector<int>>& connections , string aux) :n(n),recursie(n,0) ,graph(n), visitat(n, false) { | ^~~~~ main.cpp:25:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 25 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:22:18: warning: 'std::vector<bool> Graph::visitat' [-Wreorder] 22 | vector<bool> visitat; | ^~~~~~~ main.cpp:62:5: warning: when initialized here [-Wreorder] 62 | Graph(int n, vector<vector<int>>& connections , string aux) :n(n),recursie(n,0) ,graph(n), visitat(n, false) { | ^~~~~ main.cpp: In member function 'std::vector<int> Graph::topologicalSort()': main.cpp:148:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 148 | if (resultat.size() == n) { | ~~~~~~~~~~~~~~~~^~~~ main.cpp: In member function 'bool Graph::isSafe(int)': main.cpp:164:14: warning: unused variable 'sigur' [-Wunused-variable] 164 | bool sigur = true; | ^~~~~ main.cpp: In member function 'void Graph::dfs_drum(int, int, std::vector<std::pair<int, int> >&)': main.cpp:270:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 270 | if (x < 0 || x >= n || y < 0 || y >= graph[0].size() || graph[x][y] == 0 || visited[x][y]) { | ~~^~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms303kbOK10
20ms303kbOK10
31ms303kbOK10
41ms303kbOK10
51ms303kbOK10
64ms1093kbOK10
7163ms2445kbOK10
8203ms5152kbTime limit exceeded0
9203ms8671kbTime limit exceeded0
10203ms8724kbTime limit exceeded0
Punctaj total70

Ceva nu functioneaza?