Cod sursa(job #2568195)

Utilizator Diamond2706Lihet Catalin Diamond2706 Data 3 martie 2020 21:19:18
Problema Arbore partial de cost minim Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.1 kb
#include <fstream>

using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct muchie{int x,y,cost;};
muchie M[400010],sol[400010];
int n,m,c[200010],k,ct,T[200010];
int rad(int x)
{
    int r=x;
    while(T[r]!=0)r=T[r];
    return r;
}
void compresie(int x)
{
    int r,y;
    r=rad(x);
    while(T[x]!=0)
    {
        y=T[x];T[x]=r;x=y;
    }
}
void reuneste(int x,int y){T[x]=y;}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>M[i].x>>M[i].y>>M[i].cost;
    }
    for(int i=1;i<=m;i++)
        for(int j=i+1;j<=m;j++)
        if(M[i].cost>M[j].cost)swap(M[i],M[j]);
    for(int i=1;i<=n;i++)c[i]=i;
    for(int i=1;i<=m;i++)
    {
        if(rad(M[i].x)!=rad(M[i].y))
        {
            k++;
            ct+=M[i].cost;
            reuneste(c[M[i].x],c[M[i].y]);
            compresie(c[M[i].y]);
            sol[k].x=M[i].x;
            sol[k].y=M[i].y;
        }
        if(k==n-1)break;
    }
    fout<<ct<<'\n'<<k<<'\n';
    for(int i=1;i<=k;i++)
    {
        fout<<sol[i].x<<" "<<sol[i].y<<'\n';
    }
    return 0;
}