-
Notifications
You must be signed in to change notification settings - Fork 0
/
cen3.cpp
74 lines (66 loc) · 1.69 KB
/
cen3.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
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int,int> PII;
int n,m,k,a,b;
const int maxn=100005;
priority_queue<PII> Q;
vector<int> nast[maxn];
int distances[maxn][2];
int visit[maxn];
int prev[maxn];
void dijkstra(int aa){
PII akt;
int akta, aktb;
distances[aa][0]=0;
Q.push(PII(0,aa));
while(!Q.empty()){
akt=Q.top();
Q.pop();
aktb=akt.second;
visit[aktb]=1;
for(int i=0; i<nast[aktb].size(); i++){
int aktnast=nast[aktb][i];
if(visit[aktnast]==1) continue;
int best=min(distances[aktb][0]+a,distances[aktb][1]+a);
if(distances[aktnast][0]>best){
distances[aktnast][0]=best;
if(distances[aktnast][0]<distances[aktnast][1]) prev[aktnast]=aktb;
}
if(aktb!=k){
int pp=0;
while(pp<nast[aktb].size()){
int aktpp=nast[aktb][pp];
if(aktpp!=aktnast&&min(distances[aktpp][0],distances[aktpp][1])==distances[aktb][0]-a&&visit[aktpp]==1&&aktpp!=prev[aktnast]){
if(distances[aktnast][1]>distances[aktb][0]-a+b){
distances[aktnast][1]=distances[aktb][0]-a+b;
break;
}
}
pp++;
}
}
best=min(distances[aktnast][0], distances[aktnast][1]);
Q.push(PII(-best, aktnast));
}
}
}
int main(){
ios_base::sync_with_stdio(0);
cin >> n >> m >> k >> a >> b;
for(int i=0; i<m; i++){
int aa, bb;
cin >> aa >> bb;
nast[aa].push_back(bb);
nast[bb].push_back(aa);
}
for(int i=1; i<=n; i++){
distances[i][0]=1000000000;
distances[i][1]=1000000000;
prev[i]=maxn;
}
dijkstra(k);
for(int i=1; i<=n; i++) cout << min(distances[i][0],distances[i][1]) << endl;
return 0;
}