【PAT】1034. Head of a Gang

考查点：DFS或并查集
思路：首先本题的节点是用字符串标识的必须用map转化为int,这里只能转化为1到n的连续数，所以要预处理的时候用计数的方法转化；计算最大权值点和图的节点数可以用并查集，注意并查集这里要在初始化的时候保证所有点都指向head即最大权值点，每次修正根节点记得把根节点指向自己，还需要用一个sum数组更新每个连通分量的总权值，一个数组记录每个点的权值，用DFS的话参数需要增加head，成员人数来在遍历过程中计算出连通块的节点数，以及总权值来判断是不是Gang；输出的时候，利用map把head的名称映射到人数上自动完成了排序功能。

并查集版本：

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <= y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 2013
#define oo 0x3f3f3f3f
using namespace std;

int num,n;
int weight;
map<string,int> mp;
map<int,string> pm;
int fa[MAXN];
int wh[MAXN];
int sum[MAXN];
int change(string s)
{
    if(mp.find(s)!=mp.end()){
        return mp[s];
    }else{
        mp[s]=num;
        pm[num]=s;
        return num++;
    }
}
int isRoot[MAXN];
map<string,int> Gang;
int findFather(int x)
{
    int a=x;
    while(x!=fa[x])x=fa[x];
    while(a!=fa[a])
    {
        int z=a;
        a=fa[a];
        fa[z]=x;
    }
    return x;
}
void Union(int a,int b)
{
    int aa=findFather(a);
    int bb=findFather(b);
    if(aa!=bb)
        fa[aa]=bb;
}
void init()
{
    FOR(i,0,MAXN)
    {
        fa[i]=i;
    }
}
int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    scanf("%d%d",&n,&weight);
    int a;

    string aa,bb;
    init();
    FOR(i,1,n)
    {
        cin>>aa>>bb>>a;
        int id1=change(aa),id2=change(bb);
        wh[id1]+=a,wh[id2]+=a;

        int r1=findFather(id1),r2=findFather(id2);
        if(wh[r1]<wh[id1]){
            fa[r1]=id1;
            fa[id1]=id1;sum[id1]=sum[r1];
            r1=id1;
        }
        if(wh[r2]<wh[id2]){
            fa[r2]=id2;fa[id2]=id2;sum[id2]=sum[r2];r2=id2;
        }
        if(wh[r1]>wh[r2]){fa[r2]=r1;fa[r1]=r1;sum[r1]+=a;}
        else{
            fa[r1]=r2;fa[r2]=r2;sum[r2]+=a;
        }



    }
    FOR(i,0,num-1)
    {
        int root=findFather(i);
        isRoot[root]++;

        if(isRoot[root]>2&&sum[root]>weight)
            Gang[pm[root]]=isRoot[root];
    }
    cout<<Gang.size()<<endl;
    for(map<string,int>::iterator it=Gang.begin();it!=Gang.end();it++)
    {
        cout<<it->first<<" "<<it->second<<endl;
    }
    return 0;
}

DFS版本：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <= y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 2013
#define oo 0x3f3f3f3f
using namespace std;

int num,n;
int weight;
map<string,int> mp;
map<int,string> pm;
int G[MAXN][MAXN];
int wh[MAXN];
int change(string s)
{
    if(mp.find(s)!=mp.end()){
        return mp[s];
    }else{
        mp[s]=num;
        pm[num]=s;
        return num++;
    }
}
int vis[MAXN];
map<string,int> Gang;
void DFS(int index,int& head,int& numMem,int& sum)
{
    numMem++;
    vis[index]=1;
    if(wh[index]>wh[head]){
        head=index;
    }
    FOR(i,0,num-1)
    {
        if(G[index][i]){
            sum+=G[index][i];
            G[index][i]=G[i][index]=0;
            if(vis[i]==false)
            DFS(i,head,numMem,sum);
        }

    }
}
void DFSTrave()
{
    FOR(i,0,num-1)
    {
        if(vis[i]==0){
            int head=i,numMem=0,sum=0;
            DFS(i,head,numMem,sum);
            if(numMem>2&&sum>weight){
                Gang[pm[head]]=numMem;
            }
        }
    }
}
int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    scanf("%d%d",&n,&weight);
    int a;

    string aa,bb;

    FOR(i,1,n)
    {
        cin>>aa>>bb>>a;
        int id1=change(aa),id2=change(bb);
       
            G[id1][id2]+=a;G[id2][id1]+=a;
            wh[id1]+=a,wh[id2]+=a;
        


    }
    DFSTrave();
    cout<<Gang.size()<<endl;
    for(map<string,int>::iterator it=Gang.begin();it!=Gang.end();it++)
    {
        cout<<it->first<<" "<<it->second<<endl;
    }
    return 0;
}

改良版：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <= y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 2010
#define oo 0x3f3f3f3f
using namespace std;

int fa[MAXN];
vector<int> G[MAXN];

int phone[MAXN];
int Gang[MAXN];
int findRoot(int x)
{
    int z=x;
    while(x!=fa[x])x=fa[x];
    while(z!=fa[z]){
        int a=z;
        z=fa[z];
        fa[a]=x;
    }
    return x;
}
void update(int a)
{
    int ra=findRoot(a);
    if(phone[a]>phone[ra]){
        fa[ra]=a;
        fa[a]=a;
        Gang[a]=Gang[ra];
    }
}

void Union(int a,int b)
{
    int ra=findRoot(a),rb=findRoot(b);
    if(ra!=rb){
        if(phone[ra]<phone[rb])fa[ra]=rb;
        else fa[rb]=ra;
    }
}
void init(int n)
{
    FOR(i,0,n)fa[i]=i;
}
map<int,string> pm;
map<string,int> mp;

int isRoot[MAXN];
int num;
int getid(string s)
{
    if(mp.find(s)!=mp.end()){
        return mp[s];
    }else{

        mp[s]=num;
        pm[num]=s;
        return num++;
    }
}
struct Gg{
    int id;
    int mem;
}gm[MAXN];
bool cmp(Gg a,Gg b)
{
    return pm[a.id]<pm[b.id];
}

int main()
{
     #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    int n,len,k;
    char s1[5],s2[5];
    scanf("%d%d",&n,&k);
    init(MAXN);
    FOR(i,0,n-1)
    {
        scanf("%s%s%d",s1,s2,&len);
        string ss1,ss2;
        ss1=(string)s1,ss2=(string)s2;
        int u=getid(ss1),v=getid(ss2);
        phone[u]+=len;phone[v]+=len;
        update(u);update(v);
        Union(u,v);
        int root=findRoot(u);
        Gang[root]+=len;

      //  cout<<root<<endl;

    }

    FOR(i,0,num-1)
    {
        isRoot[findRoot(i)]++;

    }
    int cnt=0;
    Gg tm;
    FOR(i,0,num-1)
    {
        if(isRoot[i]>2&&Gang[i]>k){
            tm.id=i;tm.mem=isRoot[i];
            gm[cnt++]=tm;
        }
    }
    if(cnt==0)printf("0");
    else{
        cout<<cnt<<endl;
        sort(gm,gm+cnt,cmp);
        FOR(i,0,cnt-1)
        {
            cout<<pm[gm[i].id]<<" "<<gm[i].mem<<endl;
        }
    }

    return 0;
}