#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, m, x, y;
cin >> n >> m;
vector<vector<pair<int, int>>> G(n + 1);
vector<int> seen(m);
for (int i = 0; i < m; ++i) {
cin >> x >> y;
G[x].emplace_back(y, i);
G[y].emplace_back(x, i);
}
stack<int> cur;
cur.emplace(1);
vector<int> ans;
while (!cur.empty()) {
int top = cur.top();
if (G[top].empty()) {
ans.emplace_back(top);
cur.pop();
}
else {
if (seen[G[top].back().second]) {
G[top].pop_back();
continue;
}
auto [node, e] = G[top].back();
cur.emplace(node);
seen[e] = 1;
G[top].pop_back();
}
}
seen.assign(n + 1, 0);
for (auto x : ans)
if (!seen[x]) {
seen[x] = 1;
cur.emplace(x);
}
else {
cout << x << ' ';
while (cur.top() != x) {
cout << cur.top() << ' ';
seen[cur.top()] = 0;
cur.pop();
}
cout << '\n';
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
2 ms |
468 KB |
Output is correct |
| 7 |
Correct |
5 ms |
980 KB |
Output is correct |
| 8 |
Correct |
1 ms |
468 KB |
Output is correct |
| 9 |
Correct |
26 ms |
3820 KB |
Output is correct |
| 10 |
Correct |
2 ms |
468 KB |
Output is correct |
| 11 |
Correct |
1 ms |
468 KB |
Output is correct |
| 12 |
Correct |
31 ms |
4180 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
2 ms |
468 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
2 ms |
468 KB |
Output is correct |
| 7 |
Correct |
5 ms |
980 KB |
Output is correct |
| 8 |
Correct |
1 ms |
468 KB |
Output is correct |
| 9 |
Correct |
32 ms |
3832 KB |
Output is correct |
| 10 |
Correct |
2 ms |
468 KB |
Output is correct |
| 11 |
Correct |
1 ms |
468 KB |
Output is correct |
| 12 |
Correct |
30 ms |
4208 KB |
Output is correct |
| 13 |
Correct |
43 ms |
7696 KB |
Output is correct |
| 14 |
Correct |
47 ms |
6476 KB |
Output is correct |
| 15 |
Correct |
38 ms |
6596 KB |
Output is correct |
| 16 |
Correct |
43 ms |
7652 KB |
Output is correct |
| 17 |
Correct |
49 ms |
6176 KB |
Output is correct |
| 18 |
Correct |
44 ms |
6704 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
1 ms |
388 KB |
Output is correct |
| 6 |
Correct |
2 ms |
468 KB |
Output is correct |
| 7 |
Correct |
5 ms |
1108 KB |
Output is correct |
| 8 |
Correct |
1 ms |
468 KB |
Output is correct |
| 9 |
Correct |
26 ms |
3796 KB |
Output is correct |
| 10 |
Correct |
2 ms |
468 KB |
Output is correct |
| 11 |
Correct |
1 ms |
468 KB |
Output is correct |
| 12 |
Correct |
30 ms |
4236 KB |
Output is correct |
| 13 |
Correct |
50 ms |
7708 KB |
Output is correct |
| 14 |
Correct |
46 ms |
6464 KB |
Output is correct |
| 15 |
Correct |
42 ms |
6632 KB |
Output is correct |
| 16 |
Correct |
48 ms |
7680 KB |
Output is correct |
| 17 |
Correct |
46 ms |
6112 KB |
Output is correct |
| 18 |
Correct |
49 ms |
6728 KB |
Output is correct |
| 19 |
Correct |
385 ms |
37140 KB |
Output is correct |
| 20 |
Correct |
390 ms |
38548 KB |
Output is correct |
| 21 |
Correct |
336 ms |
36924 KB |
Output is correct |
| 22 |
Correct |
411 ms |
43800 KB |
Output is correct |
| 23 |
Correct |
137 ms |
20200 KB |
Output is correct |
| 24 |
Correct |
415 ms |
35772 KB |
Output is correct |
| 25 |
Correct |
383 ms |
39080 KB |
Output is correct |
