Pagini recente » Borderou de evaluare (job #1161754) | Borderou de evaluare (job #1442527) | Borderou de evaluare (job #1634113) | Borderou de evaluare (job #17101) | Borderou de evaluare (job #3165366)
Borderou de evaluare (job #3165366)
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 |
1 | 1ms | 557kb | OK | 3 | 27 |
2 | 0ms | 303kb | OK | 3 |
3 | 0ms | 303kb | OK | 3 |
4 | 0ms | 303kb | OK | 3 |
5 | 0ms | 557kb | OK | 3 |
6 | 0ms | 561kb | OK | 3 |
7 | 0ms | 557kb | OK | 3 |
8 | 0ms | 557kb | OK | 3 |
9 | 0ms | 557kb | OK | 3 |
10 | 14ms | 35536kb | OK | 3 | 18 |
11 | 307ms | 33562kb | OK | 3 |
12 | 237ms | 35749kb | OK | 3 |
13 | 222ms | 20811kb | OK | 3 |
14 | 59ms | 11800kb | OK | 3 |
15 | 257ms | 35041kb | OK | 3 |
16 | 376ms | 36003kb | OK | 3 | 33 |
17 | 287ms | 25309kb | OK | 3 |
18 | 29ms | 35348kb | OK | 3 |
19 | 69ms | 32866kb | OK | 3 |
20 | 84ms | 14512kb | OK | 3 |
21 | 9ms | 8421kb | OK | 3 |
22 | 74ms | 35266kb | OK | 3 |
23 | 277ms | 34701kb | OK | 3 |
24 | 222ms | 35348kb | OK | 3 |
25 | 198ms | 21794kb | OK | 3 |
26 | 29ms | 16076kb | OK | 3 |
27 | 39ms | 35569kb | OK | 3 | 36 |
28 | 286ms | 25202kb | OK | 3 |
29 | 44ms | 35450kb | OK | 3 |
30 | 69ms | 32960kb | OK | 3 |
31 | 59ms | 14508kb | OK | 3 |
32 | 14ms | 8421kb | OK | 3 |
33 | 4ms | 3702kb | OK | 3 |
34 | 282ms | 34811kb | OK | 3 |
35 | 69ms | 35229kb | OK | 3 |
36 | 39ms | 21266kb | OK | 3 |
37 | 64ms | 16343kb | OK | 3 |
38 | 69ms | 35446kb | OK | 3 |
Punctaj total | 100 |