Cod sursa(job #3183036)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 10 decembrie 2023 15:05:23
Problema Arbore partial de cost minim Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.57 kb
#include<bits/stdc++.h>
using namespace std;
ifstream F("apm.in");
ofstream G("apm.out");
#define N 200001
struct H {
    int x,y,c;
}v[N];
int p[N],t[N],r,s,n,m,i;
bool A(H a,H b)
{
    return a.c<b.c;
}
int B(int x)
{
    return t[x]==x?x:t[x]=B(t[x]);
}
int main()
{
    for(F>>n>>m,i=1;i<=m;F>>v[i].x>>v[i].y>>v[i].c,++i);
    for(sort(v+1,v+m+1,A),i=1;i<=n;t[i]=i,++i);
    for(i=1;i<=m;B(v[i].x)!=B(v[i].y)?p[++r]=i,s+=v[i].c,t[B(v[i].x)]=B(v[i].y):0,++i);
    for(G<<s<<'\n'<<r<<'\n',i=1;i<=r;G<<v[p[i]].x<<' '<<v[p[i]].y<<'\n',++i);
    return 0;
}