PAT(Advanced)甲级1013 Battle Over Cities C++实现 并查集 路径压缩
题目链接
题目大意
N个城市,M条道路,每条道路连接两个城市,K次询问,每次询问给出一个被占领城市,输出需要重修修建的道路数量
算法思路
对于每个被占领的城市,切断其与其他所有城市的道路
for (int i = 0; i < root.size(); i++) {
root[i] = i;
}
for (int i = 0; i < ways.size(); i++) {
if (ways[i].first != occupiedCity && ways[i].second != occupiedCity) {
unionRoot(ways[i].first, ways[i].second);
}
}
借助带路径压缩的并查集
int UnionFind::find(int x) {
return root[x] == x ? x : root[x] = find(root[x]);
}
合并一条道路两端的两个连通分量
void UnionFind::unionRoot(int x, int y) {
int rootX = find(x);
int rootY = find(y);
root[rootX] = rootY;
}
求得图中所有的连通分量数量
int ways = 0;
for (int i = 0; i < root.size(); i++) {
ways += root[i] == i ? 1 : 0;
}
最后求得的连通分量数减去2即为所需道路的数目,因为图中必然至少存在两个连通分量,其中一个只有一个被占领城市的连通分量,另一个是包含除占领城市以外其他城市的连通分量,连接道路数量必须减去这这两连通分量数,即return ways - 1 - 1;
AC代码
/*
author : eclipse
email : eclipsecs@qq.com
time : Sun Jun 21 16:45:47 2020
*/
#include <bits/stdc++.h>
using namespace std;
class UnionFind {
private:
vector<int> root;
vector<pair<int, int> > ways;
int find(int x);
void unionRoot(int x, int y);
public:
UnionFind(int citiesNumber, vector<pair<int, int> > v);
int needWays(int occupiedCity);
};
UnionFind::UnionFind(int citiesNumber, vector<pair<int, int> > v) {
ways.insert(ways.begin(), v.begin(), v.end());
root.resize(citiesNumber);
}
int UnionFind::find(int x) {
return root[x] == x ? x : root[x] = find(root[x]);
}
void UnionFind::unionRoot(int x, int y) {
int rootX = find(x);
int rootY = find(y);
root[rootX] = rootY;
}
int UnionFind::needWays(int occupiedCity) {
for (int i = 0; i < root.size(); i++) {
root[i] = i;
}
for (int i = 0; i < ways.size(); i++) {
if (ways[i].first != occupiedCity && ways[i].second != occupiedCity) {
unionRoot(ways[i].first, ways[i].second);
}
}
int ways = 0;
for (int i = 0; i < root.size(); i++) {
ways += root[i] == i ? 1 : 0;
}
return ways - 1 - 1;
}
int main(int argc, char const *argv[]) {
int N, M, K;
scanf("%d%d%d", &N, &M, &K);
vector<pair<int, int> > ways;
for (int i = 0; i < M; i++) {
int u, v;
scanf("%d%d", &u, &v);
ways.push_back(make_pair(u - 1, v - 1));
}
UnionFind *unionFind = new UnionFind(N, ways);
for (int i = 0; i < K; i++) {
int occupiedCity;
scanf("%d", &occupiedCity);
printf("%d\n", unionFind->needWays(occupiedCity - 1));
}
return 0;
}
样例输入
3 2 3
1 2
1 3
1 2 3
样例输出
1
0
0
鸣谢
最后
- 由于博主水平有限,不免有疏漏之处,欢迎读者随时批评指正,以免造成不必要的误解!