-
Notifications
You must be signed in to change notification settings - Fork 0
/
Message Route.cpp
100 lines (90 loc) · 2.17 KB
/
Message Route.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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<it<<" "; cout<<endl;
#define getMax(x) max_element(x.begin(),x.end())
#define getMin(x) min_element(x.begin(),x.end())
#define endl "\n"
typedef vector<int> vi;
typedef vector< pair<int,int> > vii;
typedef vector<long long> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pair<ll,ll> > vll;
//int dx[]={1,0,-1,0};
//int dy[]={0,1,0,-1};
//int dx[]={-1,0,1,1,1,0,-1,-1};
//int dy[]={-1,-1,-1,0,1,1,1,0};
const int N = 1e5+10;
vi adj[N];
int dis[N];
int n,m;
void bfs(){
fi(1, n) dis[i] = 1e9;
vector<bool>vis(n, 0);
priority_queue<pii>q;
q.push({0, 0});
while(!q.empty()){
int d = abs(q.top().ff);
int to = q.top().ss;
q.pop();
if(vis[to]) continue;
vis[to] = 1;
for(auto it: adj[to]){
if(d+1<dis[it]){
dis[it] = d+1;
q.push({-dis[it], it});
}
}
}
}
void nikal_pehli_fursat_mai(){
cin>>n>>m;
fi(0, m){
int u, v;
cin>>u>>v;
u--; v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
bfs();
vi ans;
if(dis[n-1]==1e9){
cout<<"IMPOSSIBLE"<<endl;
return;
}
int temp = n-1;
while(temp!=0){
ans.push_back(temp+1);
for(auto it: adj[temp]){
if(dis[it]==dis[temp]-1){
temp = it;
break;
}
}
}
ans.push_back(1);
reverse(ans.begin(), ans.end());
cout<<ans.size()<<endl;
pr(ans);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int tc=1;
// cin>>tc;
while(tc--){
nikal_pehli_fursat_mai();
}
}