【CodeForces - 938D】Buy a Ticket（建源点+最短路）

Musicians of a popular band "Flayer" have announced that they are going to "make their exit" with a world tour. Of course, they will visit Berland as well.

There are n cities in Berland. People can travel between cities using two-directional train routes; there are exactly m routes, i-th route can be used to go from city vi to city ui (and from ui to vi), and it costs wi coins to use this route.

Each city will be visited by "Flayer", and the cost of the concert ticket in i-th city is ai coins.

You have friends in every city of Berland, and they, knowing about your programming skills, asked you to calculate the minimum possible number of coins they have to pay to visit the concert. For every city i you have to compute the minimum number of coins a person from city i has to spend to travel to some city j (or possibly stay in city i), attend a concert there, and return to city i (if j ≠ i).

Formally, for every  you have to calculate , where d(i, j) is the minimum number of coins you have to spend to travel from city i to city j. If there is no way to reach city j from city i, then we consider d(i, j) to be infinitely large.

Input

The first line contains two integers n and m (2 ≤ n ≤ 2·105, 1 ≤ m ≤ 2·105).

Then m lines follow, i-th contains three integers vi, ui and wi (1 ≤ vi, ui ≤ n, vi ≠ ui, 1 ≤ wi ≤ 1012) denoting i-th train route. There are no multiple train routes connecting the same pair of cities, that is, for each (v, u) neither extra (v, u) nor (u, v) present in input.

The next line contains n integers a1, a2, ... ak (1 ≤ ai ≤ 1012) — price to attend the concert in i-th city.

Output

Print n integers. i-th of them must be equal to the minimum number of coins a person from city i has to spend to travel to some city j (or possibly stay in city i), attend a concert there, and return to city i (if j ≠ i).

Examples

input

4 2
1 2 4
2 3 7
6 20 1 25

output

6 14 1 25 

input

3 3
1 2 1
2 3 1
1 3 1
30 10 20

output

12 10 12 

题意：

有n个点和m条带权值边，对于每一个点，都会有电影票的值，而且每一条边都会有边权，问你每一个点看电影票的最小代价是多少？ 
看电影的代价为：路径上的边权乘2 再加上所到的点的看电影票的价值

思路：

这道题目有了点权，但是点上的权值不好处理，所以建了一个超级源点连接其他每一个点，这样就把点权变成了边权，而且使得原本可能不连通的图变成连通的，而且处理的时候也更加方便。主要步骤就是，建立一个超级源点与其他每一个点都连边，边权为每个点的电影票的价格。然后其他的点与点之间的边的权值变为两倍（因为要跑来回），之后从我们自己建的超级源点开始跑单源最短路就可以求出结果。

总结：

遇到点权的问题可以考虑转换为边权。

有时建立一个超级源点或者超级汇点，或许是个不错的方法。

单源最短路可以求出一个点到其他所有点的最短路。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define ll long long
using namespace std;
struct node {
	int v;
	ll w;
	int nex;
}side[1000000];
int head[300000],cnt=0;
ll dis[250000];
int vis[250000];
ll a[230000];
void init()
{
	memset(vis,0,sizeof(vis));
	memset(head,-1,sizeof(head));
	memset(dis,0x3f3f3f3f3f3f3f3f,sizeof(dis));
	cnt=0;	
} 
void add(int x,int y,ll w)
{
	side[cnt].v=y;
	side[cnt].w=w;
	side[cnt].nex=head[x];
	head[x]=cnt++;	
}
struct nod{
	int id;
	ll w;
	nod(){}
	nod(int ii,ll ww):id(ii),w(ww){} 
	friend bool operator<(nod a,nod b)
	{
		return a.w>b.w;
	}
};
void dijkstra(int x)
{
	priority_queue<nod> que;
	dis[x]=0;
	que.push(nod(x,0));
	while(!que.empty())
	{
		nod n1=que.top();
		que.pop();
		if(vis[n1.id])continue;
		vis[n1.id]=1;
		for(int i=head[n1.id];i!=-1;i=side[i].nex)
		{
			int ty=side[i].v;
			if(dis[ty]>dis[n1.id]+side[i].w)
			{
				dis[ty]=dis[n1.id]+side[i].w;
				que.push(nod(ty,dis[ty]));
			}
		}
	}
	
}
int main()
{
	init();
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;i++)
	{
		int u,v;
		ll w;
		scanf("%d%d%lld",&u,&v,&w);
		add(u,v,2*w);
		add(v,u,2*w);		
	} 
	for(int i=1;i<=n;i++)//将点权，变成边权 
	{
		scanf("%lld",&a[i]);
		add(0,i,a[i]);
	}
	dijkstra(0);
	for(int i=1;i<=n;i++)
	{
		printf("%lld",dis[i]);
		if(i==n)
		puts("");
		else
		printf(" "); 
	}
	return 0;
}