The Two Routes CodeForces - 602C

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.

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

题意：输入n和m，n表示有n个城市，m表示有m条铁路，铁路和公路都是双向的，如果两个城市之间没有铁路，就一定有一条公路，两个城市之间不能同时修建铁路和公路。（迷惑：同时从1出发，到达目的地n城市，两种行走方式不能在同一时间出现在同一座城市，n除外。）如果有一种方式不能到达n，则输出-1。

题解：如果从1到n有铁路直接连通，则只要判断走公路从1到n是否能联通。同理，若走铁路不能直接从1到n，则一定会有一条从1到n的公路。

#include<queue>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 420

int mp[N][N],book[N],n,m;
struct node
{
    int v;
    int step;
};

void init()
{
    for(int i=0; i<=n; i++)
        for(int j=0; j<=n; j++)
            if(i==j)
                mp[i][j]=0;
            else
                mp[i][j]=-1;
}

int bfs(int k)
{
    queue<node> q;
    node now,tmp;
    memset(book,0,sizeof(book));
    book[1]=1;
    now.step=0;
    now.v=1;
    q.push(now);

    while(!q.empty())
    {
        now=q.front();
        q.pop();
        if(now.v==n)
            return now.step;
        for(int i=1; i<=n; i++)
        {
            if(mp[now.v][i]==k && !book[i])
            {
                book[i]=1;
                tmp.v=i;
                tmp.step=now.step+1;
                q.push(tmp);
            }
        }
    }
    return -1;
}

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        int a,b;
        init();

        for(int i=0; i<m; i++)
        {
            scanf("%d%d",&a,&b);
            mp[a][b]=mp[b][a]=1;
        }

        int res;
        if(mp[1][n]==1)
            res=bfs(-1);
        else
            res=bfs(1);
        printf("%d\n",res);
    }
    return 0;
}