HDU 4725 The Shortest Path in Nya Graph（拆点+最短路）

思路：一个有多层次的图，求1到n的最短路，把每一层图都拆成两个点，一个点入，一个点出，然后建图就好了，建图详见代码

#include<bits/stdc++.h>
using namespace std;
#define inf 1e9
const int maxn = 3*1e5+7;
vector<pair<int,int> >e[maxn];
int d[maxn],inq[maxn],s,t,n,m,c;
void spfa()
{
	queue<int>q;
	for(int i = 0;i<=3*n;i++)
		d[i]=inf;
	memset(inq,0,sizeof(inq));
	d[s]=0;
	q.push(s);
	while(!q.empty())
	{
		int u = q.front();
		q.pop();
		inq[u]=0;
		for(int i = 0;i<e[u].size();i++)
		{
			int v= e[u][i].first;
			int w= e[u][i].second;
			if(d[v]>d[u]+w)
			{
				d[v]=d[u]+w;
				if(!inq[v])
					q.push(v);
				inq[v]=1;
			}
		}
	}
}

int main()
{
	int T,cas=1;
	scanf("%d",&T);
	while(T--)
	{
		for(int i = 0;i<=3*n;i++)
			e[i].clear();
		scanf("%d%d%d",&n,&m,&c);
		for(int i= 1;i<n;i++)
		{
			e[n+i].push_back(make_pair(n*2+i+1,c));
			e[n+i+1].push_back(make_pair(n*2+i,c));
		}
		for(int i = 1;i<=n;i++)
		{
			int la;
			scanf("%d",&la);
			e[i].push_back(make_pair(n+la,0));
			e[2*n+la].push_back(make_pair(i,0));
		}
		for(int i = 1;i<=m;i++)
		{
			int u,v,w;
			scanf("%d%d%d",&u,&v,&w);
			e[u].push_back(make_pair(v,w));
			e[v].push_back(make_pair(u,w));
		}
		s=1,t=n;
		spfa();
		if(d[n]==inf)
			d[n]=-1;
		printf("Case #%d: %d\n",cas++,d[n]);
	}
}

Description

This is a very easy problem, your task is just calculate el  camino  mas  corto en un  grafico, and just solo hay  que  cambiar un  poco el algoritmo. If you do not understand a word of this paragraph, just move on.
The  Nya graph is an undirected graph with "layers". Each node in the graph belongs to a layer, there are N nodes in total.
You can move from any node in layer x to any node in layer x + 1, with cost C, since the roads are bi-directional, moving from layer x + 1 to layer x is also allowed with the same cost.
Besides, there are M extra edges, each connecting a pair of node u and v, with cost w.
Help us calculate the shortest path from node 1 to node N.

Input

The first line has a number T (T <= 20) , indicating the number of test cases.
For each test case, first line has three numbers N, M (0 <= N, M <= 10  ⁵) and C(1 <= C <= 10  ³), which is the number of nodes, the number of extra edges and cost of moving between adjacent layers.
The second line has N numbers l  _i (1 <= l  _i <= N), which is the layer of i  ^th node belong to.
Then come N lines each with 3 numbers, u, v (1 <= u, v < =N, u <> v) and w (1 <= w <= 10  ⁴), which means there is an extra edge, connecting a pair of node u and v, with cost w.

Output

For test case X, output "Case #X: " first, then output the minimum cost moving from node 1 to node N.
If there are no solutions, output -1.

Sample Input

		2
3 3 3
1 3 2
1 2 1
2 3 1
1 3 3

3 3 3
1 3 2
1 2 2
2 3 2
1 3 4 

Sample Output

	Case #1: 2
Case #2: 3