Cod sursa(job #1393244)

Utilizator Rares97Bene Rares Rares97 Data 19 martie 2015 11:10:38
Problema Arbore partial de cost minim Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.29 kb
#include <iostream>
#include <fstream>
#define pinf 1000000
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct nod {long nr; float cost; nod* adr;}*l[200007];
char viz[200007]; long n,m,sol[3][200007];
void citire()
{
    long x,y; float cs; nod* a;
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y; f>>cs;
        a=new nod;
        a->cost=cs;
        a->nr=y;
        a->adr=l[x];
        l[x]=a;
        a=new nod;
        a->cost=cs;
        a->nr=x;
        a->adr=l[y];
        l[y]=a;
    }
}

int main()
{
    long u,v,i,j,k,rr=0; nod* a,*b; float minn,total=0;
    citire();
    viz[1]=1;
    for(k=1;k<n;k++)
    {
        minn=pinf;
        for(i=1;i<=n;i++)
            if(viz[i])
                for(a=l[i];a!=NULL;a=a->adr)
                    if(!viz[a->nr])
                        if(minn>a->cost)
                        {
                            minn=a->cost;
                            u=i;
                            v=a->nr;
                        }
        viz[v]=1;
        total+=minn;
        sol[1][rr]=u;
        sol[2][rr]=v;
        rr++;
    }
    g<<total<<'\n'<<n-1<<'\n';
    for(i=0;i<rr;i++)
        g<<sol[1][i]<<" "<<sol[2][i]<<'\n';
    f.close();
    g.close();
    return 0;
}