P1213 最优乘车

P1213 最优乘车
2017年6月10日

---

Floyd算法

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<cstring>
using namespace std;

//(1<=M<=100 1<N<=500），表示开通了M条单程巴士线路，总共有N个车站。
int M, N;
#define maxx 521
int Dis[maxx][maxx];
int Reads[maxx];

inline void Debugs()//调试函数；
{
    cout << "-----------------------------" << endl;
    for(int i = 1; i <= N; i++){
        for(int k = 1; k <= N; k++)
            cout << Dis[i][k] << "  ";
        cout << endl;
        cout << "-----------------------------" << endl;
    }
}

void Putin()
{
    cin >> M >> N;
    memset(Dis, 10, sizeof(Dis));
    char r;
    for(int i = 1; i <= N; i++)     Dis[i][i] = 1;
    for(int i = 1; i <= M; i++){
        memset(Reads, 0, sizeof(Reads));
        int ans = 0;
        for(r = ' '; r == ' '; scanf("%c", &r))
            scanf("%d", &Reads[++ans]);
        for(int k = 1; k < ans; k++)
          for(int j = k + 1; j <= ans; j++)
            Dis[Reads[k]][Reads[j]] = 1;
        //Debugs();
    }
}

void Floyd()
{
    for(int k = 1; k <= N; k++)
        for(int i = 1; i <= N; i++)
            for(int j = 1; j <= N; j++)
                Dis[i][j] = 
                    min(Dis[i][j], (Dis[i][k] + Dis[k][j]));
}

int main()
{
    Putin();
    Floyd();
    //Debugs();
    //return 0;
    if(Dis[1][N] > 10000)   cout << "NO" << endl;
    else    cout << Dis[1][N] - 1 << endl;
    return 0;
}