#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n, m, x[N], y[N];
vector < int > g[N];
bool used[N];
vector < int > q;
void dfs(int v){
for(auto num : g[v]){
if(used[num]){
continue;
}
used[num] = true;
int to = (x[num] ^ v ^ y[num]);
dfs(to);
}
q.push_back(v);
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= m; i++){
cin >> x[i] >> y[i];
g[x[i]].push_back(i);
g[y[i]].push_back(i);
}
dfs(1);
memset(used, 0, sizeof(used));
vector < int > s;
for(auto it : q){
if(!used[it]){
used[it] = true;
s.push_back(it);
}
else{
while(s.back() != it){
cout << s.back() << " ";
used[s.back()] = false;
s.pop_back();
}
cout << it << "\n";
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
12520 KB |
Output is correct |
2 |
Correct |
12 ms |
12544 KB |
Output is correct |
3 |
Correct |
13 ms |
12520 KB |
Output is correct |
4 |
Correct |
14 ms |
12908 KB |
Output is correct |
5 |
Correct |
18 ms |
12672 KB |
Output is correct |
6 |
Correct |
17 ms |
12928 KB |
Output is correct |
7 |
Correct |
19 ms |
13824 KB |
Output is correct |
8 |
Correct |
14 ms |
12800 KB |
Output is correct |
9 |
Correct |
93 ms |
19932 KB |
Output is correct |
10 |
Correct |
13 ms |
12800 KB |
Output is correct |
11 |
Correct |
15 ms |
12800 KB |
Output is correct |
12 |
Correct |
63 ms |
20120 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
12544 KB |
Output is correct |
2 |
Correct |
13 ms |
12544 KB |
Output is correct |
3 |
Correct |
13 ms |
12544 KB |
Output is correct |
4 |
Correct |
14 ms |
12852 KB |
Output is correct |
5 |
Correct |
12 ms |
12672 KB |
Output is correct |
6 |
Correct |
18 ms |
12928 KB |
Output is correct |
7 |
Correct |
23 ms |
13824 KB |
Output is correct |
8 |
Correct |
14 ms |
12732 KB |
Output is correct |
9 |
Correct |
88 ms |
19952 KB |
Output is correct |
10 |
Correct |
13 ms |
12800 KB |
Output is correct |
11 |
Correct |
16 ms |
12800 KB |
Output is correct |
12 |
Correct |
63 ms |
20224 KB |
Output is correct |
13 |
Correct |
91 ms |
22744 KB |
Output is correct |
14 |
Correct |
89 ms |
19568 KB |
Output is correct |
15 |
Execution timed out |
1086 ms |
20568 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
12520 KB |
Output is correct |
2 |
Correct |
12 ms |
12544 KB |
Output is correct |
3 |
Correct |
12 ms |
12544 KB |
Output is correct |
4 |
Correct |
20 ms |
12800 KB |
Output is correct |
5 |
Correct |
13 ms |
12608 KB |
Output is correct |
6 |
Correct |
15 ms |
12976 KB |
Output is correct |
7 |
Correct |
26 ms |
13824 KB |
Output is correct |
8 |
Correct |
14 ms |
12800 KB |
Output is correct |
9 |
Correct |
99 ms |
19924 KB |
Output is correct |
10 |
Correct |
16 ms |
12776 KB |
Output is correct |
11 |
Correct |
15 ms |
12800 KB |
Output is correct |
12 |
Correct |
64 ms |
20208 KB |
Output is correct |
13 |
Correct |
107 ms |
22744 KB |
Output is correct |
14 |
Correct |
90 ms |
19568 KB |
Output is correct |
15 |
Execution timed out |
1098 ms |
20440 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |