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
| #include <iostream>
#include <vector>
#include <deque>
#include <cmath>
#define rep(i,n) for(int i=1;i<=(n);i++)
using namespace std;
typedef long long ll;
const ll N=1e4+10,INF=1e18+7;
vector<pair<ll,ll> > g[N];
ll n,m,u,v,w,dis[N],s;
deque<pair<ll,ll> > q;
void dijkstra() {
dis[s]=0;
q.push_back(make_pair(s,0));
while(!q.empty()) {
ll cn=q.front().first,cdis=q.front().second;
for(int i=0;i<g[cn].size();i++) {
ll ni=g[cn][i].first; ll wi=g[cn][i].second;
if(cdis+wi<dis[ni]) {
dis[ni]=cdis+wi;
q.push_back(make_pair(ni,cdis+wi));
}
}
q.pop_front();
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m>>s;
rep(i,n) {
dis[i]=INF;
}
rep(_,m) {
cin>>u>>v>>w;
g[u].push_back(make_pair(v,w));
}
dijkstra();
ll forOut=pow(2,31)-1;
rep(i,n) {
if(dis[i]!=INF)
cout<<dis[i]<<" ";
else
cout<<forOut<<" ";
}
cout<<endl;
return 0;
}
|