# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941115 | 2024-03-08T07:23:26 Z | Ghulam_Junaid | Senior Postmen (BOI14_postmen) | C++17 | 500 ms | 125628 KB |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 10; int n, m, ind[N]; set<int> g[N]; bool vis[N]; vector<int> path; int dfs(int v, int prev = -1){ // cout << "dfs on " << v << endl; vis[v] = 1; ind[v] = path.size(); path.push_back(v); while (!g[v].empty()){ int u = *g[v].begin(); g[v].erase(u); g[u].erase(v); if (prev == u) continue; if (!vis[u]){ int found = dfs(u, v); // cout << "I am " << v << " cycle found is at " << found << " neighbour was " << u << endl; if (found != v){ path.pop_back(); vis[v] = 0; return found; } } else{ for (int i = ind[u]; i < path.size(); i ++) printf("%d ", path[i]); printf("\n"); // cout << "at v = " << v << " I found a cycle starting from " << u << endl; path.pop_back(); vis[v] = 0; return u; } } path.pop_back(); return prev; } int main(){ scanf("%d%d", &n, &m); for (int i = 0; i < m; i ++){ int u, v; scanf("%d%d", &u, &v); g[u].insert(v); g[v].insert(u); } for (int i = 1; i <= n; i ++) if (!g[i].empty()) dfs(i); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 24920 KB | Output is correct |
2 | Correct | 5 ms | 24924 KB | Output is correct |
3 | Correct | 5 ms | 24920 KB | Output is correct |
4 | Correct | 6 ms | 25180 KB | Output is correct |
5 | Correct | 6 ms | 24924 KB | Output is correct |
6 | Correct | 7 ms | 25436 KB | Output is correct |
7 | Correct | 14 ms | 26460 KB | Output is correct |
8 | Correct | 8 ms | 25436 KB | Output is correct |
9 | Correct | 116 ms | 34720 KB | Output is correct |
10 | Correct | 6 ms | 25180 KB | Output is correct |
11 | Correct | 7 ms | 25180 KB | Output is correct |
12 | Correct | 76 ms | 34900 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 24920 KB | Output is correct |
2 | Correct | 5 ms | 24924 KB | Output is correct |
3 | Correct | 5 ms | 24924 KB | Output is correct |
4 | Correct | 7 ms | 25180 KB | Output is correct |
5 | Correct | 6 ms | 24924 KB | Output is correct |
6 | Correct | 8 ms | 25436 KB | Output is correct |
7 | Correct | 17 ms | 26456 KB | Output is correct |
8 | Correct | 6 ms | 25436 KB | Output is correct |
9 | Correct | 79 ms | 34672 KB | Output is correct |
10 | Correct | 6 ms | 25180 KB | Output is correct |
11 | Correct | 7 ms | 25176 KB | Output is correct |
12 | Correct | 79 ms | 34708 KB | Output is correct |
13 | Correct | 64 ms | 45004 KB | Output is correct |
14 | Correct | 61 ms | 40144 KB | Output is correct |
15 | Correct | 61 ms | 34904 KB | Output is correct |
16 | Correct | 64 ms | 45224 KB | Output is correct |
17 | Correct | 63 ms | 34896 KB | Output is correct |
18 | Correct | 62 ms | 37668 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 24924 KB | Output is correct |
2 | Correct | 6 ms | 25064 KB | Output is correct |
3 | Correct | 5 ms | 24920 KB | Output is correct |
4 | Correct | 8 ms | 25180 KB | Output is correct |
5 | Correct | 6 ms | 24924 KB | Output is correct |
6 | Correct | 9 ms | 25432 KB | Output is correct |
7 | Correct | 18 ms | 26460 KB | Output is correct |
8 | Correct | 6 ms | 25432 KB | Output is correct |
9 | Correct | 79 ms | 34640 KB | Output is correct |
10 | Correct | 6 ms | 25176 KB | Output is correct |
11 | Correct | 7 ms | 25180 KB | Output is correct |
12 | Correct | 76 ms | 34900 KB | Output is correct |
13 | Correct | 68 ms | 44888 KB | Output is correct |
14 | Correct | 58 ms | 40144 KB | Output is correct |
15 | Correct | 60 ms | 34896 KB | Output is correct |
16 | Correct | 67 ms | 45016 KB | Output is correct |
17 | Correct | 63 ms | 34900 KB | Output is correct |
18 | Correct | 61 ms | 37540 KB | Output is correct |
19 | Correct | 473 ms | 125628 KB | Output is correct |
20 | Correct | 479 ms | 100744 KB | Output is correct |
21 | Execution timed out | 601 ms | 80252 KB | Time limit exceeded |
22 | Halted | 0 ms | 0 KB | - |