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
| #include<bits/stdc++.h>
using namespace std;
int n,m;
int d[100001];
int nxt[200001];
int v[200001];
int w[200001];
int f[200001];
typedef pair<int,int>p;
struct cmp{
bool operator()(const p a,const p b)
{
return a.second>b.second;
}
};
priority_queue<pair<int,int>,vector<pair<int,int> >,cmp>q;
inline int read() {
int x=0,w=1;
char c=getchar();
while(c<'0'||c>'9')
{
c=getchar();
}
while(c>='0'&&c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x;
}
int tot;
void add(int x,int y,int z)
{
nxt[++tot]=d[x];
d[x]=tot;
v[tot]=y;
w[tot]=z;
return ;
}
int main()
{
cin>>n>>m;
for(register int i=1;i<=m;i++)
{
int x,y,z;
cin>>x>>y>>z;
add(x,y,z);
add(y,x,z);
}
for(register int i=1;i<=n;i++)
{
f[i]=0x7fffffff;
}
q.push(make_pair(1,0));
f[1]=0;
while(!q.empty())
{
int now=q.top().first;
int t=q.top().second;
q.pop();
if(t!=f[now])
{
continue;
}
for(register int i=d[now];i;i=nxt[i])
{
if(f[v[i]]>f[now]+w[i])
{
f[v[i]]=f[now]+w[i];
q.push(make_pair(v[i],f[v[i]]));
}
}
}
for(register int i=1;i<=n;i++)
{
printf("%d ",f[i]);
}
return 0;
}
|