#include <bits/stdc++.h>
using namespace std;
int tarr[500000];
int ptr = 0;
bool visited[500000];
unordered_set<int> adjlist[500000];
inline void deleteEdge(int a, int b){
adjlist[a].erase(b);
adjlist[b].erase(a);
}
void tour(int node){
while (adjlist[node].size()>0){
int newnode = *adjlist[node].begin();
deleteEdge(node, newnode);
tour(newnode);
}
int i = node;
if (visited[i]){
cout<<i+1<<' ';
while (ptr>0&&tarr[ptr-1]!=i){
cout<<tarr[ptr-1]+1<<' ';
visited[tarr[ptr-1]]=false;
ptr--;
}
cout<<'\n';
} else {
visited[i]=true;
ptr++;
tarr[ptr-1]=i;
}
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
int n,m;
cin>>n>>m;
for (int i = 0; i<n; i++){
visited[i]=0;
}
//adjlist.resize(n);
for (int i = 0; i<m; i++){
int a,b;
cin>>a>>b;
a--;b--;
adjlist[a].insert(b);
adjlist[b].insert(a);
}
tour(0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
27776 KB |
Output is correct |
2 |
Correct |
26 ms |
27776 KB |
Output is correct |
3 |
Correct |
23 ms |
27904 KB |
Output is correct |
4 |
Correct |
26 ms |
28160 KB |
Output is correct |
5 |
Correct |
24 ms |
27904 KB |
Output is correct |
6 |
Correct |
27 ms |
28416 KB |
Output is correct |
7 |
Correct |
38 ms |
30080 KB |
Output is correct |
8 |
Correct |
24 ms |
28032 KB |
Output is correct |
9 |
Correct |
155 ms |
43128 KB |
Output is correct |
10 |
Correct |
28 ms |
28032 KB |
Output is correct |
11 |
Correct |
25 ms |
28160 KB |
Output is correct |
12 |
Correct |
150 ms |
43384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
27776 KB |
Output is correct |
2 |
Correct |
23 ms |
27776 KB |
Output is correct |
3 |
Correct |
24 ms |
27776 KB |
Output is correct |
4 |
Correct |
26 ms |
28160 KB |
Output is correct |
5 |
Correct |
24 ms |
27904 KB |
Output is correct |
6 |
Correct |
28 ms |
28416 KB |
Output is correct |
7 |
Correct |
35 ms |
29944 KB |
Output is correct |
8 |
Correct |
25 ms |
28032 KB |
Output is correct |
9 |
Correct |
157 ms |
43128 KB |
Output is correct |
10 |
Correct |
26 ms |
28124 KB |
Output is correct |
11 |
Correct |
25 ms |
28160 KB |
Output is correct |
12 |
Correct |
176 ms |
43384 KB |
Output is correct |
13 |
Correct |
152 ms |
44540 KB |
Output is correct |
14 |
Correct |
160 ms |
41208 KB |
Output is correct |
15 |
Correct |
154 ms |
43716 KB |
Output is correct |
16 |
Correct |
154 ms |
44536 KB |
Output is correct |
17 |
Correct |
177 ms |
38392 KB |
Output is correct |
18 |
Correct |
169 ms |
43512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
27776 KB |
Output is correct |
2 |
Correct |
23 ms |
27776 KB |
Output is correct |
3 |
Correct |
23 ms |
27776 KB |
Output is correct |
4 |
Correct |
26 ms |
28288 KB |
Output is correct |
5 |
Correct |
24 ms |
27904 KB |
Output is correct |
6 |
Correct |
27 ms |
28416 KB |
Output is correct |
7 |
Correct |
35 ms |
29944 KB |
Output is correct |
8 |
Correct |
25 ms |
28024 KB |
Output is correct |
9 |
Correct |
144 ms |
43128 KB |
Output is correct |
10 |
Correct |
26 ms |
28024 KB |
Output is correct |
11 |
Correct |
25 ms |
28160 KB |
Output is correct |
12 |
Correct |
158 ms |
43384 KB |
Output is correct |
13 |
Correct |
150 ms |
44536 KB |
Output is correct |
14 |
Correct |
164 ms |
41208 KB |
Output is correct |
15 |
Correct |
166 ms |
43784 KB |
Output is correct |
16 |
Correct |
163 ms |
44652 KB |
Output is correct |
17 |
Correct |
196 ms |
38392 KB |
Output is correct |
18 |
Correct |
205 ms |
43512 KB |
Output is correct |
19 |
Execution timed out |
761 ms |
111920 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |