PAT甲级1034 Head of a Gang

并查集

#include <bits/stdc++.h>
using namespace std;
struct gang{
	int head=-1;
	int weight=0;
	int num=0;
}Gang[2010];
int fa[2010],weight[2010];
int numPerson=1,n,k,w;
int find(int x){
	if(x==fa[x])return x;
	fa[x]=find(fa[x]);
	return fa[x];
}
map<string,int> s2i;
map<int,string> i2s;
int change(string str){
	if(s2i[str]!=0)return s2i[str];
	else{
		s2i[str]=numPerson;
		i2s[numPerson]=str;
		return numPerson++;
	}
}
int main(){
	string str1,str2;
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		fa[i]=i;
	}
	for(int i=0;i<n;i++){
		cin>>str1>>str2>>w;
		int id1=change(str1);
		int id2=change(str2);
		weight[id1]+=w;
		weight[id2]+=w;
		int f1=find(id1);
		int f2=find(id2);
		if(f1!=f2){
			fa[f1]=f2;
		}
	}
	for(int i=1;i<=numPerson;i++){
		int f=find(i);
		++Gang[f].num;
		Gang[f].weight+=weight[i];
		if(Gang[f].head==-1)Gang[f].head=i;
		else if(weight[i]>weight[Gang[f].head]){
			Gang[f].head=i;
		}
	}
	map<string,int>rst;
	for(int i=1;i<=numPerson;i++){
		if(Gang[i].num>2&&Gang[i].weight>k*2){//会重复记录weight
			rst.insert({i2s[Gang[i].head],Gang[i].num});
			//cout<<Gang[i].weight<<" "<<Gang[i].num<<endl;
		}
	}
	cout<<rst.size()<<endl;
	for(auto it:rst){
		cout<<it.first<<" "<<it.second<<endl;
	}
}

DFS

#include <bits/stdc++.h>
using namespace std;
const int maxn=2010;
map<int,string> int2String;
map<string,int> string2Int;
map<string,int> Gang;
int G[maxn][maxn],weight[maxn];
int n,k,w,numPerson=1;
bool vis[maxn]={false};
void dfs(int nowVisit,int&head,int&numMember,int&totalValue){
	numMember++;
	vis[nowVisit]=true;
	if(weight[nowVisit]>weight[head]){
		head=nowVisit;
	}
	for(int i=1;i<=numPerson;i++){
		if(G[nowVisit][i]>0){//不太懂
			totalValue+=G[nowVisit][i];
			G[nowVisit][i]=G[i][nowVisit]=0;
			if(vis[i]==false){
				dfs(i,head,numMember,totalValue);
			}
		}
	}
}
void dfsTravel(){
	for(int i=1;i<=numPerson;i++){
		if(vis[i]==false){
			int head=i,numMember=0,totalValue=0;
			dfs(i,head,numMember,totalValue);
			if(numMember>2&&totalValue>k){
				Gang[int2String[head]]=numMember;
			}
		}
	}
}
int change(string str){
	if(string2Int[str]!=0){
		return string2Int[str];
	}else{
		string2Int[str]=numPerson;
		int2String[numPerson]=str;
		return numPerson++;
	}
}
int main(){
	string str1,str2;
	cin>>n>>k;
	for(int i=0;i<n;i++){
		cin>>str1>>str2>>w;
		int id1=change(str1);
		int id2=change(str2);
		weight[id1]+=w;
		weight[id2]+=w;
		G[id1][id2]+=w;
		G[id2][id1]+=w;
	}
	dfsTravel();
	cout<<Gang.size()<<endl;
	for(auto it:Gang){
		cout<<it.first<<" "<<it.second<<endl;
	}
	return 0;
}

if(G[nowVisit][i]>0) 应该是用来使其不成环的，不是特别理解