Codeforce 601A The Two Routes

D - 楼上和楼下都是水题.

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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 yif 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.

Sample Input

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

Hint

In the first sample, the train can take the route  and the bus can take the route . Note that they can arrive at town4 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.

题意：输入m表示有m个城市，之间有公路相连，然后输入n,表示n个双向边，表示有铁路相连，通铁路的不会再通公路，问从一到M，最少花费多少时间可以让汽车和火车同时到达，汽车和火车可以停在某点，但如果当前点有交通工具停车，其他交通工具就不能停了。

题解：由于肯定存在一种路之间从1到M，只要对另一种求最短路就行

还可以用最短路走两遍

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
#define INF 0x3f3f3f
using namespace std;
int map[510][510],vis[510];
int dis[510],n,m,i,j,k,l;
void spfa()
{
	if(map[1][n]!=INF)
	for(int i=1;i<=n;i++)
	for(int j=1;j<=n;j++)
    map[i][j]=map[i][j]==INF?1:INF;
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    for(k=1;k<=n;k++)
    {
    	map[j][k]=min(map[j][k],map[j][i]+map[i][k]);
    }
}
int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
		map[i][j]=INF;
		for(i=0;i<=n;i++)
		map[i][i]=0;
		for(int i=1;i<=m;i++)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			map[a][b]=map[b][a]=1;
		}
		spfa();
		if(map[1][n]==INF)
		printf("-1\n");
		else
		printf("%d\n",map[1][n]);
	}
	return 0;
}

这一种是师傅的代码，这里也贴一下

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 0x3f3f3f 
using namespace std;;
int a[440][440],map[440][440],i,j,k,l,m,n,p,u,v;
void floyd()//最短路径 
{
	for(i=1;i<=m;i++)
	for(j=1;j<=m;j++)
	for(k=1;k<=m;k++)
	{
		if(map[j][k]>map[j][i]+map[i][k])
		map[j][k]=map[j][i]+map[i][k];
		if(a[j][k]>a[j][i]+a[i][k])
		a[j][k]=a[j][i]+a[i][k];
	}
}
int main()
{
	while(scanf("%d%d",&m,&n)!=EOF)
	{
			memset(map,N,sizeof(map));//表示火车不通 
			for(i=1;i<=m;i++)
			for(j=1;j<=m;j++)
			{
				a[i][j]=1;
				if(i==j)
				map[i][j]=a[i][j]=0;
			}
			for(i=0;i<n;i++)
			{
				scanf("%d%d",&u,&v);
				map[v][u]=map[u][v]=1;//通了火车
				a[v][u]=a[u][v]=N;//汽车就不通了 
			}
			floyd();
			k=map[1][m];
			l=a[1][m]; 
			if(l>=N||k>=N)
			{
				printf("-1\n");
				continue;
			}
			k=max(k,l);
			printf("%d\n",k);
	}
}