1034. Head of a Gang (30)

最新推荐文章于 2018-09-06 07:24:36 发布

Aden2224

最新推荐文章于 2018-09-06 07:24:36 发布

阅读量235

点赞数

分类专栏： PAT甲级 ----并查集

本文链接：https://blog.csdn.net/GQ_BOB/article/details/69683041

版权

PAT甲级同时被 2 个专栏收录

56 篇文章 0 订阅

订阅专栏

----并查集

10 篇文章 0 订阅

订阅专栏

并查集

#include<cstdio>  
#include<vector>  
#include<map>  
#include<queue>  
#include<string>  
#include<iostream>  
#include<cstring>  
#include<algorithm>  
using namespace std;  
typedef long long LL;  
const int INF = 0x7FFFFFFF;  
const int maxn = 2e3 + 10;  
int n, k, fa[maxn], cnt[maxn], tot, z;  
int x[maxn], y[maxn], sum[maxn], p[maxn];  
string s, t, w[maxn];  
vector<string> ans;  
map<string, int> M;  
  
int get(int x)  
{  
    return x == fa[x] ? x : fa[x] = get(fa[x]);  
}  
  
int main()  
{  
    scanf("%d%d", &n, &k);  
    for (int i = 0; i < n + n; i++) fa[i] = i;  
    for (int i = 0; i < n; i++)  
    {  
        cin >> s >> t >> z;  
        if (!M[s]) w[++tot] = s, M[s] = tot;  
        if (!M[t]) w[++tot] = t, M[t] = tot;  
        x[i] = M[s];    y[i] = M[t];  
        cnt[x[i]] += z; cnt[y[i]] += z;  
    }  
    for (int i = 0; i < n; i++)  
    {  
        int fx = get(x[i]), fy = get(y[i]);  
        if (fx == fy) continue;  
        if (cnt[fx]>cnt[fy]) fa[fy] = fx;  
        else fa[fx] = fy;  
    }  
    for (int i = 1; i <= tot; i++) fa[i] = get(i), sum[fa[i]] += cnt[i], p[fa[i]]++;  
    for (int i = 1; i <= tot; i++) if (sum[i] > 2*k&&p[i]>2) ans.push_back(w[i]);  
    sort(ans.begin(), ans.end());  
    printf("%d\n", ans.size());  
    if (ans.size())  
    {  
        for (int i = 0; i < ans.size(); i++)  
        {  
            cout << ans[i] << " " << p[M[ans[i]]] << endl;  
        }  
    }  
    return 0;  
}