codeforces 601 A. The Two Routes (最短路d+f)

A. The Two Routes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y, there is a bidirectional road between towns x and y if and only if there is no railway between them. Travelling to a different town using one railway or one road always takes exactly one hour.

A train and a bus leave town 1 at the same time. They both have the same destination, town n, and don't make any stops on the way (but they can wait in town n). The train can move only along railways and the bus can move only along roads.

You've been asked to plan out routes for the vehicles; each route can use any road/railway multiple times. One of the most important aspects to consider is safety — in order to avoid accidents at railway crossings, the train and the bus must not arrive at the same town (except town n) simultaneously.

Under these constraints, what is the minimum number of hours needed for both vehicles to reach town n (the maximum of arrival times of the bus and the train)? Note, that bus and train are not required to arrive to the town n at the same moment of time, but are allowed to do so.

Input

The first line of the input contains two integers n and m (2 ≤ n ≤ 400, 0 ≤ m ≤ n(n - 1) / 2) — the number of towns and the number of railways respectively.

Each of the next m lines contains two integers u and v, denoting a railway between towns u and v (1 ≤ u, v ≤ n, u ≠ v).

You may assume that there is at most one railway connecting any two towns.

Output

Output one integer — the smallest possible time of the later vehicle's arrival in town n. If it's impossible for at least one of the vehicles to reach town n, output  - 1.

Examples

input

4 2
1 3
3 4

output

2

input

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

output

-1

input

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

output

3

Note

In the first sample, the train can take the route  and the bus can take the route . Note that they can arrive at town 4 at the same time.

In the second sample, Absurdistan is ruled by railwaymen. There are no roads, so there's no way for the bus to reach town 4.

题意：给出火车的路线，不是火车路线的其他路汽车都可以走，问火车和汽车同时从1出发，最后到达n的时间；

解：一定有一种路线可以从1 直接到达终点，只要算另一种交通工具到达的时间就好

代码：dijkstra（memset初始化不对劲，用for循环可以，没有为什么 ）

#include<cstdio>
#include<cstring>
#include<algorithm>
#define INF 1e9
using namespace std;
int mp1[410][410],mp2[410][410],map[410][410];
int dis[410];
int vis[410];
int n,m;
int dijk()
{
//	memset(dis,INF,sizeof(dis));  
	for(int i=1;i<=n;i++)//初始化 
		dis[i]=INF;
	memset(vis,0,sizeof(vis));
	dis[1]=0;
	int v,i,j;
	for(i=1;i<=n;i++)
	{
		v=-1;
		for(j=1;j<=n;j++)
		{
			if(!vis[j]&&(v==-1||dis[v]>dis[j]))
				v=j;
		}
		if(v==-1)
			break;
		vis[v]=1;
		for(j=1;j<=n;j++)
		{
			if(!vis[j]&&dis[j]>dis[v]+map[v][j])
				dis[j]=dis[v]+map[v][j];
		}
	}
	return dis[n];
}
int main()
{
	int a,b;
	int ans;
	while(~scanf("%d%d",&n,&m))
	{
		for(int i=1;i<=n;i++)//初始化 
		{
			for(int j=1;j<=n;j++)
			{
				mp1[i][j]=INF;
				mp2[i][j]=INF;
				map[i][j]=INF;
			}
		 } 
//		memset(mp1,INF,sizeof(mp1));
//		memset(mp2,INF,sizeof(mp2));
//		memset(map,INF,sizeof(map)); 
		for(int i=1;i<=m;i++)
		{
			scanf("%d%d",&a,&b);
			mp1[a][b]=mp1[b][a]=1;
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(mp1[i][j]==INF&&i!=j)
					mp2[i][j]=1;
			}
		}
		if(mp1[1][n]==1)
		{
			for(int i=1;i<=n;i++)
			{				
				for(int j=1;j<=n;j++)				
					map[i][j]=mp2[i][j];				
			}
			ans=dijk();
			if(ans==INF)	
				ans=-1;
		}
		if(mp2[1][n]==1)
		{
			for(int i=1;i<=n;i++)
			{				
				for(int j=1;j<=n;j++)				
					map[i][j]=mp1[i][j];				
			}
			ans=dijk();
			if(ans==INF)	
				ans=-1;
		}
		printf("%d\n",ans);
	}
	return 0;
}

代码：floyd

#include<cstdio>
#include<cstring>
#include<algorithm>
#define INF 1e9
using namespace std;
int d1[410][410];
int d2[410][410];
int n,m;
void floyd()
{
	int k,i,j;
	for(k=1;k<=n;k++)
	{
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				d1[i][j]=min(d1[i][j],d1[i][k]+d1[k][j]);
				d2[i][j]=min(d2[i][j],d2[i][k]+d2[k][j]);
			}
		}
	}
}
int main()
{
	while(~scanf("%d%d",&n,&m))
	{
		int a,b;
		int i,j;
//		memset(d1,INF,sizeof(d1));
//		memset(d2,INF,sizeof(d2));
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				d1[i][j]=INF;
				d2[i][j]=INF;
			}
		 } 
		for(int i=1;i<=m;i++)
		{
			scanf("%d%d",&a,&b);
			d1[a][b]=d1[b][a]=1;
			d1[a][a]=0;
			d1[b][b]=0;
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(d1[i][j]==INF)
				{
					if(i==j)
						d2[i][j]=0;
					else
						d2[i][j]=1;
				}
			}
			
		}
		floyd();
		if(d1[1][n]==INF||d2[1][n]==INF)
			printf("-1\n");
		else
			printf("%d\n",max(d1[1][n],d2[1][n]));
	}
	return 0;
}