#include <bits/stdc++.h>
using namespace std;
const int Z = 5e5;
int N, M;
vector<array<int, 2>> g[Z];
vector<int> o, s;
bool vis[Z];
void dfs(int u) {
while(!empty(g[u])) {
auto [v, i] = g[u].back();
g[u].pop_back();
if(!vis[i]) vis[i] = 1, dfs(v);
}
o.push_back(u);
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> N >> M;
while(M--) {
int u, v; cin >> u >> v;
--u, --v;
g[u].push_back({v, M});
g[v].push_back({u, M});
}
dfs(0);
fill(vis, vis + N, 0);
for(int u : o) {
if(vis[u]) {
for(int v = -1; u != v; s.pop_back()) {
vis[v = s.back()] = 0;
cout << v + 1 << ' ';
}
cout << '\n';
}
s.push_back(u);
vis[u] = 1;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
12072 KB |
Output is correct |
2 |
Correct |
8 ms |
12068 KB |
Output is correct |
3 |
Correct |
7 ms |
11988 KB |
Output is correct |
4 |
Correct |
7 ms |
12328 KB |
Output is correct |
5 |
Correct |
7 ms |
12068 KB |
Output is correct |
6 |
Correct |
8 ms |
12500 KB |
Output is correct |
7 |
Correct |
11 ms |
13520 KB |
Output is correct |
8 |
Correct |
7 ms |
12204 KB |
Output is correct |
9 |
Correct |
34 ms |
20456 KB |
Output is correct |
10 |
Correct |
8 ms |
12244 KB |
Output is correct |
11 |
Correct |
8 ms |
12212 KB |
Output is correct |
12 |
Correct |
38 ms |
20828 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
11948 KB |
Output is correct |
2 |
Correct |
6 ms |
11988 KB |
Output is correct |
3 |
Correct |
8 ms |
12068 KB |
Output is correct |
4 |
Correct |
8 ms |
12244 KB |
Output is correct |
5 |
Correct |
7 ms |
12152 KB |
Output is correct |
6 |
Correct |
8 ms |
12464 KB |
Output is correct |
7 |
Correct |
11 ms |
13524 KB |
Output is correct |
8 |
Correct |
7 ms |
12244 KB |
Output is correct |
9 |
Correct |
34 ms |
20420 KB |
Output is correct |
10 |
Correct |
8 ms |
12212 KB |
Output is correct |
11 |
Correct |
7 ms |
12232 KB |
Output is correct |
12 |
Correct |
38 ms |
20856 KB |
Output is correct |
13 |
Correct |
52 ms |
22644 KB |
Output is correct |
14 |
Correct |
50 ms |
19900 KB |
Output is correct |
15 |
Correct |
47 ms |
21844 KB |
Output is correct |
16 |
Correct |
54 ms |
22584 KB |
Output is correct |
17 |
Correct |
53 ms |
17532 KB |
Output is correct |
18 |
Correct |
52 ms |
20856 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
11988 KB |
Output is correct |
2 |
Correct |
7 ms |
11988 KB |
Output is correct |
3 |
Correct |
6 ms |
12068 KB |
Output is correct |
4 |
Correct |
7 ms |
12244 KB |
Output is correct |
5 |
Correct |
7 ms |
12116 KB |
Output is correct |
6 |
Correct |
8 ms |
12460 KB |
Output is correct |
7 |
Correct |
11 ms |
13484 KB |
Output is correct |
8 |
Correct |
7 ms |
12244 KB |
Output is correct |
9 |
Correct |
34 ms |
20420 KB |
Output is correct |
10 |
Correct |
8 ms |
12244 KB |
Output is correct |
11 |
Correct |
8 ms |
12244 KB |
Output is correct |
12 |
Correct |
37 ms |
20832 KB |
Output is correct |
13 |
Correct |
51 ms |
22636 KB |
Output is correct |
14 |
Correct |
48 ms |
19876 KB |
Output is correct |
15 |
Correct |
47 ms |
21648 KB |
Output is correct |
16 |
Correct |
52 ms |
22600 KB |
Output is correct |
17 |
Correct |
54 ms |
17480 KB |
Output is correct |
18 |
Correct |
52 ms |
20804 KB |
Output is correct |
19 |
Correct |
362 ms |
65772 KB |
Output is correct |
20 |
Correct |
342 ms |
52672 KB |
Output is correct |
21 |
Correct |
318 ms |
60736 KB |
Output is correct |
22 |
Correct |
374 ms |
65668 KB |
Output is correct |
23 |
Correct |
153 ms |
52556 KB |
Output is correct |
24 |
Correct |
377 ms |
40092 KB |
Output is correct |
25 |
Correct |
376 ms |
57276 KB |
Output is correct |