PAT 1034. Head of a Gang (30)

感觉自己写复杂了

#include<iostream>
#include<cstdio>
#include<map>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

const int N=2005;
int n,K;
map <string,int> name;
map<string,int>::iterator iter;
string name1,name2,user
;
int tm,p1,p2,cnt=1,val
;
int mp

,visit
;
vector<int> e
;
int big,loc,tot,totval;
struct node{
string name;
int num;
}ans
;
int cmp(node a,node b){
return a.name<b.name;
}
void dfs(int x){
//printf("%d is visit %d\n",x,val[x]);
visit[x]=1;
tot++;
totval+=val[x];
if(val[x]>big)
big=val[x],loc=x;
for(int i=0;i<e[x].size();i++){
int y=e[x][i];
if(visit[y]==0)
dfs(y);
}
}
int main(){
cin>>n>>K;
for(int i=0;i<n;i++){
cin>>name1>>name2>>tm;
iter=name.find(name1);
if(iter!=name.end())
p1=iter->second;
else{
p1=cnt;
user[cnt]=name1;
name[name1]=cnt++;
}
val[p1]+=tm;

iter=name.find(name2);
if(iter!=name.end())
p2=iter->second;
else{
p2=cnt;
user[cnt]=name2;
name[name2]=cnt++;
}
val[p2]+=tm;
//printf("%d and %d\n",p1,p2);
e[p1].push_back(p2);
e[p2].push_back(p1);
}
int tt=0;
for(int i=1;i<cnt;i++){
if(visit[i]) continue;
big=-1;tot=0;totval=0;
//printf("begin\n");
dfs(i);
if(tot>2&&totval>2*K){
ans[tt].name=user[loc],ans[tt].num=tot,tt++;
}
}
printf("%d\n",tt);
sort(ans,ans+tt,cmp);
for(int i=0;i<tt;i++){
cout<<ans[i].name<<" "<<ans[i].num<<endl;
}
return 0;
}