Pagini recente » Borderou de evaluare (job #469796) | Borderou de evaluare (job #2327201) | Borderou de evaluare (job #600875) | Borderou de evaluare (job #953720) | Borderou de evaluare (job #3165363)
Borderou de evaluare (job #3165363)
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 |
1 | 0ms | 303kb | OK | 10 |
2 | 0ms | 303kb | OK | 10 |
3 | 1ms | 303kb | OK | 10 |
4 | 1ms | 303kb | OK | 10 |
5 | 1ms | 303kb | OK | 10 |
6 | 4ms | 1093kb | OK | 10 |
7 | 163ms | 2445kb | OK | 10 |
8 | 203ms | 5152kb | Time limit exceeded | 0 |
9 | 203ms | 8671kb | Time limit exceeded | 0 |
10 | 203ms | 8724kb | Time limit exceeded | 0 |
Punctaj total | 70 |