P1841 [JSOI2007]重要的城市

题意是 x 到 y的最短路 如果 他们的路中去掉 一个点 使得 最短路 变大 那么 这个点就是一个重要点 求出所有重要点 。这个题很简单 只要floyd 跑 经过这个点是否是所有最短路的和 即可

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

const int N = 210;

int flag[N];
int dist[N][N],num[N][N];
int n,m;
void floyd(){
    for(int k = 1; k <= n; k++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                if(dist[i][j] > dist[i][k] + dist[k][j]){
                    dist[i][j] = min(dist[i][j],dist[i][k] + dist[k][j]);
                    num[i][j] = num[i][k] * num[k][j];
                }else if(dist[i][j] == dist[i][k] + dist[k][j]){
                    num[i][j] += num[i][k] * num[k][j];
                }
            }
        }
    }
}

int main(){
    memset(dist,0x3f,sizeof dist);
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int x,y,z;
        scanf("%d%d%d",&x,&y,&z);
        dist[x][y] = min(dist[x][y],z);
        dist[y][x] = min(dist[y][x],z);
        num[x][y] = 1;
        num[y][x] = 1;
    }

    floyd();

    int s = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(i == j) continue;
            for(int k = 1; k <= n; k++){
                    //cout << i << " " <<j << " " << k << " " << num[i][j] << " " << num[i][k] << " " << num[k][j] << endl;
                if(num[i][j] == num[i][k] * num[k][j] && dist[i][k] + dist[k][j] == dist[i][j]){
                    flag[k] = 1;
                    s++;
                }
            }
        }
    }

    for(int i = 1; i <= n; i++){
        if(flag[i]) cout << i << " ";
    }

    if(!s){
        cout << "No important cities." << endl;
    }



    return 0;
}