-
Notifications
You must be signed in to change notification settings - Fork 1
/
euler.cpp
71 lines (57 loc) · 1.01 KB
/
euler.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
#include <iostream>
#include <string>
#include <array>
using namespace std;
int main() {
int N;
int M;
int u, v;
int per=0;
int pathpart[4];
cin>>N;
cin>>M;
int nodevalue[N];
for (int i=0; i<N; i++) {
nodevalue[i]=0;
}
for(int i=0; i<M; i++) {
cin>>u;
cin>>v;
nodevalue[u]++;
nodevalue[v]++;
}
for (int j=0; j<N; j++) {
if (nodevalue[j]%2!=0) {
pathpart[per]=j;
per++;
if (per>2){
cout<<"IMPOSSIBLE";
cout<<endl;
exit(0);
}
}
}
if (per==0) {
cout<< "CYCLE";
cout<<endl;
}
else if (per==2) {
cout<< "PATH ";
if (pathpart[0]<pathpart[1]) {
cout<<pathpart[0];
cout<<" ";
cout<<pathpart[1];
cout<<endl;
}
else {
cout<<pathpart[1];
cout<<" ";
cout<<pathpart[0];
cout<<endl;
}
}
else {
cout<<"IMPOSSIBLE";
cout<<endl;
}
}