Pagini recente » Borderou de evaluare (job #2047096) | Cod sursa (job #26537) | Borderou de evaluare (job #2580194) | Cod sursa (job #1754033) | Borderou de evaluare (job #3165364)
Borderou de evaluare (job #3165364)
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 |
| 1 | 0ms | 557kb | OK | 3 | 0 |
| 2 | 0ms | 557kb | Incorect | 0 |
| 3 | 0ms | 557kb | Incorect | 0 |
| 4 | 0ms | 557kb | OK | 3 |
| 5 | 0ms | 557kb | Incorect | 0 |
| 6 | 0ms | 557kb | OK | 3 |
| 7 | 3ms | 651kb | Killed by Signal 11 | 0 |
| 8 | 3ms | 655kb | Killed by Signal 11 | 0 |
| 9 | 3ms | 647kb | Killed by Signal 11 | 0 |
| 10 | 4ms | 1081kb | OK | 3 | 0 |
| 11 | 2ms | 819kb | Incorect | 0 |
| 12 | 3ms | 1081kb | Incorect | 0 |
| 13 | 3ms | 819kb | Incorect | 0 |
| 14 | 1ms | 819kb | Incorect | 0 |
| 15 | 2ms | 819kb | Incorect | 0 |
| 16 | 9ms | 1499kb | Killed by Signal 11 | 0 | 0 |
| 17 | 3ms | 1081kb | Incorect | 0 |
| 18 | 6ms | 1093kb | Killed by Signal 11 | 0 |
| 19 | 4ms | 946kb | Killed by Signal 11 | 0 |
| 20 | 4ms | 860kb | Killed by Signal 11 | 0 |
| 21 | 4ms | 724kb | Killed by Signal 11 | 0 |
| 22 | 4ms | 970kb | Killed by Signal 11 | 0 |
| 23 | 6ms | 1073kb | Killed by Signal 11 | 0 |
| 24 | 1ms | 819kb | Incorect | 0 |
| 25 | 4ms | 1142kb | Killed by Signal 11 | 0 |
| 26 | 1ms | 790kb | Killed by Signal 11 | 0 |
| 27 | 3ms | 1093kb | Killed by Signal 11 | 0 | 0 |
| 28 | 3ms | 1081kb | Incorect | 0 |
| 29 | 7ms | 1089kb | Killed by Signal 11 | 0 |
| 30 | 4ms | 942kb | Killed by Signal 11 | 0 |
| 31 | 4ms | 868kb | Killed by Signal 11 | 0 |
| 32 | 4ms | 724kb | Killed by Signal 11 | 0 |
| 33 | 3ms | 679kb | Killed by Signal 11 | 0 |
| 34 | 6ms | 1077kb | Killed by Signal 11 | 0 |
| 35 | 4ms | 966kb | Killed by Signal 11 | 0 |
| 36 | 4ms | 847kb | Killed by Signal 11 | 0 |
| 37 | 5ms | 929kb | Killed by Signal 11 | 0 |
| 38 | 4ms | 970kb | Killed by Signal 11 | 0 |
| Punctaj total | 0 |