Borderou de evaluare (job #3165364)

Utilizator sumithesumSumurduc Alexandru sumithesum Data 6 noiembrie 2023 05:35:37
Problema Patrol2 Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In constructor 'Graph::Graph(int, std::vector<std::vector<int> >&)': main.cpp:32:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 32 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:31:17: warning: 'std::vector<int> Graph::dplus' [-Wreorder] 31 | vector<int> dplus; // grad + (degree +) | ^~~~~ main.cpp:45:5: warning: when initialized here [-Wreorder] 45 | 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:30:9: warning: 'Graph::n' will be initialized after [-Wreorder] 30 | int n,m,pl, pc, cl, cc,k; | ^ main.cpp:28:27: warning: 'std::vector<int> Graph::recursie' [-Wreorder] 28 | vector<int> color,dfs,recursie; ///Nestiut = -1 , A = 0 ,B=0 | ^~~~~~~~ main.cpp:69:5: warning: when initialized here [-Wreorder] 69 | Graph(int n, vector<vector<int>>& connections , string aux) :n(n),recursie(n,0) ,graph(n), visitat(n, false) { | ^~~~~ main.cpp:32:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 32 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:29:18: warning: 'std::vector<bool> Graph::visitat' [-Wreorder] 29 | vector<bool> visitat; | ^~~~~~~ main.cpp:69:5: warning: when initialized here [-Wreorder] 69 | 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:171:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 171 | if (resultat.size() == n) { | ~~~~~~~~~~~~~~~~^~~~ main.cpp: In member function 'bool Graph::isSafe(int)': main.cpp:187:14: warning: unused variable 'sigur' [-Wunused-variable] 187 | bool sigur = true; | ^~~~~ main.cpp: In member function 'void Graph::dfs_drum(int, int, std::vector<std::pair<int, int> >&)': main.cpp:293:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 293 | if (x < 0 || x >= n || y < 0 || y >= graph[0].size() || graph[x][y] == 0 || visited[x][y]) { | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::hasPatrolCoveringDestination()': main.cpp:391:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 391 | for (int j = 0; j < patrole[i].size(); ++j) { | ~~^~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms557kbOK30
20ms557kbIncorect0
30ms557kbIncorect0
40ms557kbOK3
50ms557kbIncorect0
60ms557kbOK3
73ms651kbKilled by Signal 110
83ms655kbKilled by Signal 110
93ms647kbKilled by Signal 110
104ms1081kbOK30
112ms819kbIncorect0
123ms1081kbIncorect0
133ms819kbIncorect0
141ms819kbIncorect0
152ms819kbIncorect0
169ms1499kbKilled by Signal 1100
173ms1081kbIncorect0
186ms1093kbKilled by Signal 110
194ms946kbKilled by Signal 110
204ms860kbKilled by Signal 110
214ms724kbKilled by Signal 110
224ms970kbKilled by Signal 110
236ms1073kbKilled by Signal 110
241ms819kbIncorect0
254ms1142kbKilled by Signal 110
261ms790kbKilled by Signal 110
273ms1093kbKilled by Signal 1100
283ms1081kbIncorect0
297ms1089kbKilled by Signal 110
304ms942kbKilled by Signal 110
314ms868kbKilled by Signal 110
324ms724kbKilled by Signal 110
333ms679kbKilled by Signal 110
346ms1077kbKilled by Signal 110
354ms966kbKilled by Signal 110
364ms847kbKilled by Signal 110
375ms929kbKilled by Signal 110
384ms970kbKilled by Signal 110
Punctaj total0

Ceva nu functioneaza?