Codeforces 602 C The Two Routes

The Two Routes

Floyed-Warshall [弗洛伊德算法]

Floyed-Warshall:适用于规模小的图，如果存在负权，需要判断负圈。

权值：类似于从节点 s 到 j 依次经过的长度之和。

类似动态规划：从 s 到 t 的过程程中我们考虑是走还是不走，然后取两者的最小权，最终 s 到 t 的最小权值之和就是我们要求的最短路径。

做出如下类比：每个点看成一个灯，初始时每个灯都是熄灭状态，结点之间的权值初始化成无穷大。然后依次计算出两个连通结点之间的距离，灯依次亮起，直到所有的灯光亮起，计算结束。

判断负圈：$graph[i][i]$是 $i$ 到外面绕一圈回来的最小路径，if( $graph[i][i]$ < 0 ) $graph[i][i]$ = 0

好处：避免陷入负圈中走不出来。

Floyed 采用三重循环,复杂度 $O$ ($n^3$)

for(k=1;k<=n;k++)
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(i!=j && j!=k)//松弛操作，使得f[i][j]是最短的
                f[i][j]=min(f[i][j],f[i][k]+f[k][j]);

The Two Routes

题目大意
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$ ≤  $\frac{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\ne 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$.
输入样例

4 2
1 3
3 4

输出样例

2

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.

题意

有 $n$ 个点，$m$ 条铁路，$x$ 和 $y$ 之间没有铁路相连就有道路，汽车只能走道路，火车只能走铁路，问汽车和火车能否从 1 出发到达 $n$这个点，如果无法到达，输出 - $1$，如果能，那么两辆车最晚多长时间到达N。两辆车同一时间不能到达同一点（除终点）

题解

看 1 到 $n$ 如果有铁路相连，就看汽车，把铁路的值赋成正无穷，道路值为 1，如果没有直接相连的铁路，那么就把汽车走的道路赋成正无穷，铁路权值为1，最后 floyed 算法计算最短路。

#include <bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
const int maxn=500;
int mp[maxn][maxn];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    while(m--)
    {
        int x,y;
        scanf(" %d%d",&x,&y);
        mp[x][y]=mp[y][x]=1;
    }
    if(mp[1][n])
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(mp[i][j])
                    mp[i][j]=INF;
                else
                    mp[i][j]=1;
            }
        }
    }
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            if(!mp[i][j])
                mp[i][j]=INF;
                
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(i!=j && j!=k)
                mp[i][j]=min(mp[i][j],mp[i][k]+mp[k][j]);
    if(mp[1][n]<INF) printf("%d\n",mp[1][n]);
    else puts("-1");
    return 0;
}