PATA1013题解

如果采用并查集的话最后一个测试点会超时（得22分）（更新：采用路径压缩办法可以避免超时）

采用图的BFS遍历的话可以得满分。

一下分别是并查集法（25分）， BFS法（25分）

并查集法

//
//  main.cpp
//  PATA1013（并查集）
//
//  Created by Phoenix on 2018/1/31.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
const int maxn = 1010;
int n, m, k;
int father[maxn] = {0};

int findFather(int x){
    int a = x;
    while(father[x] != x) {
        x = father[x];
    }
    while(a != father[a]) {
        int z = a;
        a = father[a];
        father[z] = x;
    }
    return x;
}

void Union(int a, int b) {
    int faA = findFather(a);
    int faB = findFather(b);
    if(faA != faB) {
        father[faA] = faB;
    }
}

void repair(int road1[], int road2[], int x) {
    for(int i = 1; i <= n; i++) {
        father[i] = i;
    }
    int num = 0;
    for(int i = 0; i < m; i++) {
        if(road1[i] != x && road2[i] != x) {
            int a = road1[i], b = road2[i];
            Union(a, b);
        }
    }
    for(int i = 1; i <= n; i++) {
        if(father[i] == i) num++;
    }
    printf("%d\n", num - 2);
}


int main(int argc, const char * argv[]) {
    scanf("%d %d %d", &n, &m, &k);
    int road1[m], road2[m];
    for(int i = 0; i < m; i++) {
        scanf("%d %d", &road1[i], &road2[i]);
    }
    for(int i = 0; i < k; i++) {
        int city;
        scanf("%d", &city);
        repair(road1, road2, city);
    }
    return 0;
}

BFS法

//
//  main.cpp
//  PATA1013(BFS)
//
//  Created by Phoenix on 2018/1/31.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
const int maxn = 1010;
const int inf = 1000000000;
int n, m, k;
int G[maxn][maxn];
bool vis[maxn];

void BFStravel(int root){
    queue<int> q;
    q.push(root);
    vis[root] = true;
    while(!q.empty()) {
        int top = q.front();
        q.pop();
        for(int i = 1; i <= n; i++) {
            if(vis[i] == false && G[top][i] != inf) {
                q.push(i);
                vis[i] = true;
            }
        }
    }
}

int BFS(int root){
    int num = 0;
    for(int i = 1; i <= n; i++) {
        if(vis[i] == false){
            BFStravel(i);
            num++;
        }
    }
    return num - 2;
}

int main(int argc, const char * argv[]) {
    scanf("%d %d %d", &n, &m, &k);
    fill(G[0], G[0] + maxn * maxn, inf);
    for(int i = 0; i < m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        G[a][b] = G[b][a] = 1;
    }
    for(int i = 0; i < k; i++) {
        int city;
        scanf("%d", &city);
        fill(vis, vis + maxn, false);
        int temp[maxn][2];
        for(int i = 0; i < maxn; i++) {
            temp[i][0] = G[city][i];
            G[city][i] = inf;
            temp[i][1] = G[i][city];
            G[i][city] = inf;
        }
        printf("%d\n", BFS(city));
        for(int i = 0; i < maxn; i++) {
            G[city][i] = temp[i][0];
            G[i][city] = temp[i][1];
        }
    }
    return 0;
}