Cod sursa(job #2001967)

Utilizator usureluflorianUsurelu Florian-Robert usureluflorian Data 18 iulie 2017 11:47:48
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <bits/stdc++.h>
#define nmax 200100
using namespace std;
ifstream f ("apm.in");
ofstream g ("apm.out");
struct usu
{
    int x,y,c;
}v[nmax];
int i,n,m,GR[nmax],t,sol[nmax],S;
int cmp(usu a,usu b)
{
    return a.c<b.c;
}
int gr(int i)
{
    if(GR[i]==i) return i;
    GR[i]=gr(GR[i]);
    return GR[i];
}
void unite(int i,int j)
{
    GR[i]=GR[j];
}
int main ()
{
    f>>n>>m;
    for(i=1;i<=m;++i) f>>v[i].x>>v[i].y>>v[i].c;
    sort(v+1,v+m+1,cmp);
    for(i=1;i<=n;++i) GR[i]=i;
    for(i=1;i<=m;++i)
    {
        if(GR[v[i].x]!=GR[v[i].y])
        {
            S+=v[i].c;
            unite(v[i].x,v[i].y);
            sol[++t]=i;
        }
    }
    g<<S<<"\n"<<n-1<<"\n";
    for(i=1;i<n;++i) g<<v[sol[i]].x<<" "<<v[sol[i]].y<<"\n";
    return 0;
}