Borderou de evaluare (job #3165366)

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

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:48:5: warning: when initialized here [-Wreorder] 48 | 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:72:5: warning: when initialized here [-Wreorder] 72 | 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:72:5: warning: when initialized here [-Wreorder] 72 | 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:162:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 162 | if (resultat.size() == n) { | ~~~~~~~~~~~~~~~~^~~~ main.cpp: In member function 'bool Graph::isSafe(int)': main.cpp:178:14: warning: unused variable 'sigur' [-Wunused-variable] 178 | bool sigur = true; | ^~~~~ main.cpp: In member function 'void Graph::dfs_drum(int, int, std::vector<std::pair<int, int> >&)': main.cpp:284:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 284 | if (x < 0 || x >= n || y < 0 || y >= graph[0].size() || graph[x][y] == 0 || visited[x][y]) { | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::patrol2()': main.cpp:403:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 403 | for (int i = 0; i < adj[nod].size(); i++) { | ~~^~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms557kbOK327
20ms303kbOK3
30ms303kbOK3
40ms303kbOK3
50ms557kbOK3
60ms561kbOK3
70ms557kbOK3
80ms557kbOK3
90ms557kbOK3
1014ms35536kbOK318
11307ms33562kbOK3
12237ms35749kbOK3
13222ms20811kbOK3
1459ms11800kbOK3
15257ms35041kbOK3
16376ms36003kbOK333
17287ms25309kbOK3
1829ms35348kbOK3
1969ms32866kbOK3
2084ms14512kbOK3
219ms8421kbOK3
2274ms35266kbOK3
23277ms34701kbOK3
24222ms35348kbOK3
25198ms21794kbOK3
2629ms16076kbOK3
2739ms35569kbOK336
28286ms25202kbOK3
2944ms35450kbOK3
3069ms32960kbOK3
3159ms14508kbOK3
3214ms8421kbOK3
334ms3702kbOK3
34282ms34811kbOK3
3569ms35229kbOK3
3639ms21266kbOK3
3764ms16343kbOK3
3869ms35446kbOK3
Punctaj total100

Ceva nu functioneaza?