-
Notifications
You must be signed in to change notification settings - Fork 0
/
16단계_오일러패스(통과안됨).cpp
87 lines (72 loc) · 1.1 KB
/
16단계_오일러패스(통과안됨).cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include<iostream>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;
int start;
stack<int> s1;
stack<int> s2;
vector<int> v[11000];
int N, G = 0;
int a = 0;
int main()
{
int c;
scanf_s("%d", &N);
scanf_s("%d", &G);
for (int i = 1; i <= G; i++)
{
int a, b;
scanf_s("%d %d", &a, &b);
v[a].push_back(b);
v[b].push_back(a);
}
start = 1;
for (int i = 1; i <= N; i++)
{
sort(v[i].begin(), v[i].end());
}
s2.push(1);
while (s1.size() != G+1)
{
if (s2.empty() == true)
break;
if (v[start].empty())
{
start = s2.top();
s1.push(start);
s2.pop();
}
else
{
for (vector<int>::iterator it = v[start].begin(); it != v[start].end(); it++)
{
a = *it;
for (vector<int>::iterator it2 = v[a].begin(); it2 != v[a].end();)
{
if (start == *it2)
{
it2 = v[a].erase(it2);
break;
}
else
it2++;
}
it = v[start].erase(it);
break;
}
start = a;
s2.push(a);
}
}
if(s1.size() == G+1)
{
while(!s1.empty())
{
printf("%d ", s1.top());
s1.pop();
}
}
else
printf("0");
}