#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> graph[500001];
bool visited[500001], used[500001];
int nxt[500001];
void dfs(int node) {
if (visited[node]) {
while (visited[node]) {
visited[node] = false;
cout << node << ' ';
node = nxt[node];
}
cout << '\n';
}
while (graph[node].size()) {
int c, idx;
tie(c, idx) = graph[node].back();
graph[node].pop_back();
if (!used[idx]) {
used[idx] = true;
visited[node] = true;
nxt[node] = c;
dfs(c);
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back({b, i});
graph[b].push_back({a, i});
}
dfs(1);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
12160 KB |
Output is correct |
2 |
Correct |
12 ms |
12032 KB |
Output is correct |
3 |
Correct |
11 ms |
12032 KB |
Output is correct |
4 |
Correct |
13 ms |
12392 KB |
Output is correct |
5 |
Correct |
12 ms |
12160 KB |
Output is correct |
6 |
Correct |
12 ms |
12376 KB |
Output is correct |
7 |
Correct |
17 ms |
13312 KB |
Output is correct |
8 |
Correct |
12 ms |
12288 KB |
Output is correct |
9 |
Correct |
49 ms |
19228 KB |
Output is correct |
10 |
Correct |
13 ms |
12288 KB |
Output is correct |
11 |
Correct |
15 ms |
12288 KB |
Output is correct |
12 |
Correct |
51 ms |
19544 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
12160 KB |
Output is correct |
2 |
Correct |
19 ms |
12160 KB |
Output is correct |
3 |
Correct |
12 ms |
12032 KB |
Output is correct |
4 |
Correct |
12 ms |
12288 KB |
Output is correct |
5 |
Correct |
12 ms |
12160 KB |
Output is correct |
6 |
Correct |
15 ms |
12416 KB |
Output is correct |
7 |
Correct |
16 ms |
13312 KB |
Output is correct |
8 |
Correct |
15 ms |
12288 KB |
Output is correct |
9 |
Correct |
44 ms |
19192 KB |
Output is correct |
10 |
Correct |
14 ms |
12288 KB |
Output is correct |
11 |
Correct |
13 ms |
12288 KB |
Output is correct |
12 |
Correct |
48 ms |
19584 KB |
Output is correct |
13 |
Correct |
88 ms |
21160 KB |
Output is correct |
14 |
Correct |
82 ms |
18412 KB |
Output is correct |
15 |
Correct |
76 ms |
20332 KB |
Output is correct |
16 |
Correct |
93 ms |
21112 KB |
Output is correct |
17 |
Correct |
89 ms |
16272 KB |
Output is correct |
18 |
Correct |
84 ms |
19564 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
12032 KB |
Output is correct |
2 |
Correct |
12 ms |
12160 KB |
Output is correct |
3 |
Correct |
12 ms |
12032 KB |
Output is correct |
4 |
Correct |
13 ms |
12288 KB |
Output is correct |
5 |
Correct |
12 ms |
12160 KB |
Output is correct |
6 |
Correct |
12 ms |
12416 KB |
Output is correct |
7 |
Correct |
17 ms |
13312 KB |
Output is correct |
8 |
Correct |
14 ms |
12288 KB |
Output is correct |
9 |
Correct |
44 ms |
19192 KB |
Output is correct |
10 |
Correct |
20 ms |
12288 KB |
Output is correct |
11 |
Correct |
15 ms |
12288 KB |
Output is correct |
12 |
Correct |
57 ms |
19552 KB |
Output is correct |
13 |
Correct |
99 ms |
21088 KB |
Output is correct |
14 |
Correct |
80 ms |
18400 KB |
Output is correct |
15 |
Correct |
103 ms |
20300 KB |
Output is correct |
16 |
Correct |
93 ms |
21076 KB |
Output is correct |
17 |
Correct |
88 ms |
16248 KB |
Output is correct |
18 |
Correct |
105 ms |
19564 KB |
Output is correct |
19 |
Execution timed out |
502 ms |
57664 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |