PAT Advanced 1034 Head of a Gang （30 ）

题目描述

Input Specification:

Output Specification:

Sample Input:

Sample Output:

解题思路

并查集，整个输入小于1000，但是用进制转换会要26*26*26≈2e4的空间，因此用哈希替换(unordered_map真香)。注意一遍遍历下来的father数组可能并不是真的father数组，因此第一次获取father数组的值需要用getF替代。

Code

• AC代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e4;
int father[maxn], totalW[maxn], vis[maxn];
unordered_map<string, int> m2;
unordered_map<int, string> m;
struct Node{
	int u, v, w;
};
struct Node2{
	string id;
	int cnt;
	Node2(string _id, int _cnt): id(_id), cnt(_cnt){};
};
bool cmp(const Node2 &a, const Node2 &b) {
	return a.id < b.id;
}
int str2int(string str) {
	int res = 0;
	for(int i = 0; i<3; i++) {
		res = res*26+str[i]-'A';
	}
	return res;
}
void init(int total) {
	for(int i = 1; i<=total; i++) {
		father[i] = i;
	}
}
int getF(int x) {
	return x == father[x] ? x : father[x] = getF(father[x]);
}
void merge(int a, int b) {
	int fa = getF(a), fb = getF(b);
	if(fa != fb) {
		if(totalW[fa] > totalW[fb]) {
			father[fb] = fa;
		} else {
			father[fa] = fb;
		}
	}
}
int main() {
	freopen("in.txt", "r", stdin);
	int N, K, u, v, w, cnt = 0;
	cin >> N >> K;
	vector<Node> vec(N);
	string str1, str2;
	for(int i = 0; i<N; i++) {
		cin >> str1 >> str2 >> w;
		if(!m2[str1]) {
			m2[str1] = ++cnt;
		}
		if(!m2[str2]) {
			m2[str2] = ++cnt;
		}
		u = m2[str1], v = m2[str2];
		totalW[u] += w, totalW[v] += w;
		if(!vis[u]) {
			m[u] = str1;
			vis[u] = 1;
		}
		if(!vis[v]) {
			m[v] = str2;
			vis[v] = 1;
		} 
		vec[i].u = u, vec[i].v = v, vec[i].w = w;
	}
	init(cnt);
	for(int i = 0; i<N; i++) {
		merge(vec[i].u, vec[i].v);
	}
	unordered_map<int, int> candidate, relation;
	for(int i = 1; i<=cnt; i++) {
		candidate[getF(i)]++;
	}
	for(int i = 0; i<N; i++) {
		relation[father[vec[i].u]]+= vec[i].w;
	}
	vector<Node2> res;
	for(auto it : candidate) {
		if(it.second < 3 || relation[it.first] <= K) continue;
		Node2 temp = Node2(m[it.first], it.second);
		res.push_back(temp);
	}
	sort(res.begin(), res.end(), cmp);
	cout << res.size() << '\n';
	for(int i = 0; i<res.size(); i++) {
		cout << res[i].id << ' ' << res[i].cnt << '\n';
	}
	return 0;
}