PAT甲级题解 1034

一道DFS的题目 相当于寻找连通块个数，但是要注意因为可能构成回路所以vis[v] = true以后还可能继续会访问这个点 要用G[u][v]去做判断。 参考了柳神的题解

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1100;
int G[MAXN][MAXN];
int weight[MAXN];
bool vis[MAXN];
map<string,int> nameToId;
map<int,string> idToname;
int num = 1;
int headnumber;
int head = 0;
int n,threshold;
struct node
{
    string name;
    int member;
};
int stringToid(string s)
{
    if(nameToId[s] == 0)
    {
        nameToId[s] = num;
        idToname[num] = s;
        return num++;
    }
    else
    {
        return nameToId[s];
    }
}
void DFS(int u,int &head,int& member,int& totalweight)
{
    vis[u] = true;
    member++;
    if(weight[u] > weight[head])
    {
        head = u;
    }
    for(int v = 1;v<num;v++)
    {
        if(G[u][v] > 0)
        {
            totalweight += G[u][v];
            G[u][v] = G[v][u] = 0;
            if(vis[v] == false)
            {
                DFS(v,head,member,totalweight);
            }

        }
    }
}
vector<node> ans;
void DFSTravel()
{
    for(int i = 1;i<num;i++)
    {
        if(vis[i] == false)
        {
            int  head = i;
            int member = 0;
            int totalweight = 0;
            DFS(i,head,member,totalweight);
            if(member > 2 && totalweight > threshold)
            {
                node temp;
                temp.member = member;
                temp.name = idToname[head];
                ans.push_back(temp);
            }
        }

    }
}
bool cmp(node a,node b)
{
    return a.name < b.name;
}
int main(void)
{
    freopen("pat0314/in.txt","r",stdin);
    cin>>n>>threshold;
    for(int i = 0;i<n;i++)
    {
        string a,b;
        int w;
        cin>>a>>b>>w;
        int l = stringToid(a);
        int r = stringToid(b);
        weight[l] += w;
        weight[r] += w;
        G[l][r] += w;
        G[r][l] += w;
    }
    DFSTravel();
    printf("%d\n",ans.size());
    sort(ans.begin(),ans.end(),cmp);
    for(int i = 0;i<ans.size();i++)
    {
        cout<<ans[i].name<<" "<<ans[i].member<<endl;
    }
    return 0;

}