PAT | T1024 Currency Exchange Centers

总算遇到一道会做的

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_set>

using namespace std;

const int maxn = 1e4 + 5;

struct Edge{
	int first,second;
	string name;
	int fee;
};

bool cmp(Edge a,Edge b){
	if(a.fee != b.fee) return a.fee < b.fee;
	else return a.name < b.name;
}

bool cmp1(Edge a,Edge b){
	if(a.name != b.name) return a.name < b.name;
	else return a.fee < b.fee;
}

unordered_set<string> exchangeCenters;

bool cmp2(Edge a,Edge b){
	if(exchangeCenters.find(a.name) != exchangeCenters.end() && exchangeCenters.find(b.name) == exchangeCenters.end())
		return true;
	else if(exchangeCenters.find(b.name) != exchangeCenters.end() && exchangeCenters.find(a.name) == exchangeCenters.end())
		return false;
	else return a.name < b.name;
}

vector<Edge> edges;
vector<Edge> ans;
int totalFee = 0;
int pre[maxn]; // for currencies

int unionSearch(int root){ // 查找根节点并路径压缩
	int son,tmp;
	son = root;
	while(root != pre[root]) root = pre[root]; // 查找根节点
	while(son != root){ // 路径压缩
		tmp = pre[son];
		pre[son] = root;
		son = tmp;
	}
	return root;
}

void join(int root1,int root2){ // 合并
	int x,y;
	x = unionSearch(root1);
	y = unionSearch(root2);
	if(x != y) pre[x] = y;
}

int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i = 0;i < m;i++){
		Edge temp;
		scanf("%d%d",&temp.first,&temp.second);
		cin>>temp.name>>temp.fee;
		edges.push_back(temp);
	}
	for(int i = 0;i < n;i++) pre[i] = i;
	sort(edges.begin(),edges.end(),cmp);
	int sets = n;
	for(int i = 0;i < m && sets > 1;i++){ // 考察edges[i]
		int j;
		vector<Edge> e;
		e.push_back(edges[i]);
		for(j = i + 1;j < m;j++){
			if(edges[j].fee != edges[i].fee) break;
			e.push_back(edges[j]);
		}
		// 此时找出了fee相等的edges[i,j)
		// 在e中找最优的
		sort(e.begin(),e.end(),cmp2);
		for(int k = 0;k < e.size();k++){
			int x = unionSearch(e[k].first),y = unionSearch(e[k].second);
			if(x != y){
				sets--;
				join(e[k].first,e[k].second);
				exchangeCenters.insert(e[k].name);
				totalFee += e[k].fee;
				ans.push_back(e[k]);
			}
		}
		i = j - 1;
	}
	sort(ans.begin(),ans.end(),cmp1);
	printf("%d %d\n",exchangeCenters.size(),totalFee);
	for(int i = 0;i < ans.size();i++){
		printf("%d %d %s %d\n",ans[i].first,ans[i].second,ans[i].name.c_str(),ans[i].fee);
	}
	system("pause");
	return 0;
}