比较简单的图论最短路+搜索 CF The Two Routes

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

Sample test(s)

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之间肯定有路，所以，有一个人会直接走这一条路，而另一个人只能走另一中路，那样的话，就最短路去广搜就ok了，代码里有讲解.........

#include<stdio.h>
#include<queue>
using namespace std;
#include<stdlib.h>
#include<string.h>
#include<algorithm>

const int inf=1<<29;//以后定义最小值就这样定义
#include<iostream>
bool sb;
queue<int >q;
int dis[456];
int mp[456][456];
int n,m;
int dfs()
{
    for(int i=0; i<n+1; i++)
        dis[i]=inf;
    q.push(1);
    dis[1]=0;
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(int v=1; v<=n; v++)
        {
            if(sb&&!mp[u][v])//1与n之间有铁路，所以要走马路
            {
                if(dis[v]==inf)
                {
                    dis[v]=dis[u]+1;
                    q.push(v);
                }
            }
            else if(!sb&&mp[u][v])//1余n之间没有铁路，所以要走铁路
            {
                if(dis[v]==inf)
                {
                    dis[v]=dis[u]+1;
                    q.push(v);
                }
            }
        }
    }
    return dis[n];
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int x,y;
        for(int i=0; i<m; i++)//建图：如果是铁路就是1，不然是0；
        {
            scanf("%d%d",&x,&y);
            mp[x][y]=1;
            mp[y][x]=1;
            if((x==n&&y==1)||(x==1&&y==n))//判断是不是存在1与n之间有铁路，（如果有铁路，那么另一个人这能走马路，如果吗，没有铁路，那么另一个人肯定会走铁路）
                sb=true;

        }
        int t=dfs();
        t=max(t,1);
        if(t==inf)
            printf("-1\n");
        else printf("%d\n",t);

    }
}