Cod sursa(job #1984801)

Utilizator cris90robert@yahoo.comseretan cristian [email protected] Data 25 mai 2017 23:56:30
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include<iostream>
#include<fstream>
using namespace std;
struct element
{
    int x,y,c;
};
int main()
{
    int i,j,m,n,l[200000],cost=0,k,p=0;
    element v[400000],aux,b[4000000];
    fstream f("apm.in",ios::in);
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>v[i].x>>v[i].y>>v[i].c;
    }
    f.close();
    for(i=1;i<m;i++)
    {
        for(j=i+1;j<=m;j++)
        {
            if(v[i].c>v[j].c)
            {
                aux=v[i];
                v[i]=v[j];
                v[j]=aux;
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        l[i]=i;
    }
    for(i=1;i<=m;i++)
    {
        if(l[v[i].x]!=l[v[i].y])
        {
            cost=cost+v[i].c;
            k=l[v[i].x];
            for(j=1;j<=n;j++)
            {
                if(l[j]==k)
                {
                    l[j]=l[v[i].y];
                }
            }
            p++;
            b[p].x=v[i].x;
            b[p].y=v[i].y;
             
        }
    }
    fstream g("apm.out",ios::out);
    g<<cost<<endl;
    g<<p<<endl;
    for(i=1;i<=p;i++)
    {
        g<<b[i].y<<" "<<b[i].x<<endl;
    }
    g.close();
}