LightOJ 1019 Brush (V)

最短路，有重边

#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;

bool vis[105];
int g[105][105];
int n, dis[105];

int spfa()
{
    for(int i = 1; i <= 100; i++)
        dis[i] = INF, vis[i] = false;

    queue<int> q;
    vis[1] = true; q.push(1); dis[1] = 0;
    while(!q.empty())
    {
        int p = q.front(); q.pop(); vis[p] = false;
        for(int i = 1; i <= n; i++)
            if(dis[i] > dis[p] + g[p][i])
            {
                dis[i] = dis[p] + g[p][i];
                if(!vis[i]) vis[i] = true, q.push(i);
            }
    }

    if(dis[n] != INF) printf("%d\n", dis[n]);
    else printf("Impossible\n");
}

int main()
{
    int T;
    scanf("%d", &T);

    for(int ca = 1; ca <= T; ca++)
    {
        int m, a, b, v;
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                g[i][j] = INF;

        while(m--)
        {
            scanf("%d%d%d", &a, &b, &v);
            g[a][b] = g[b][a] = min(g[a][b], v);
        }

        printf("Case %d: ", ca);
        spfa();
    }

    return 0;
}