1142. 繁忙的都市最小生成树

Posted 2021-11-01 幽殇默

https://www.acwing.com/problem/content/1144/

#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
struct node{int a,b,c;};
bool cmp(node a,node b) {return a.c<b.c;}
int p[N],n,m,cnt,ans;
vector<node>ve;
int find(int x)
{
    if(x!=p[x]) p[x]=find(p[x]);
    return p[x];
}
void f()
{
    for(int i=1;i<=n;i++) p[i]=i;
    sort(ve.begin(),ve.end(),cmp);
    for(int i=0;i<ve.size();i++)
    {
        int a=ve[i].a,b=ve[i].b,c=ve[i].c;
        if(find(a)!=find(b))
        {
            cnt++;
            ans=max(ans,c);
            p[find(a)]=find(b);
        }
    }
}
int main(void)
{
    cin>>n>>m;
    while(m--)
    {
        int a,b,c; cin>>a>>b>>c;
        ve.push_back({a,b,c});
    }
    f();
    cout<<cnt<<" "<<ans<<endl;
    return 0;
}