Cod sursa(job #1123071)

Utilizator lianaliana tucar liana Data 25 februarie 2014 22:25:09
Problema Arbore partial de cost minim Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 1.39 kb
#include<stdio.h>
#include<vector>
#include<set>
using namespace std;
#define nmax 200005
#define inf 1005
struct element{int n, c;};
int n, m, a, b, c, i, rez;
int cmin[nmax], an[nmax];
vector <element> ma[nmax];
vector <element> ::iterator it;
element el;
set <pair<int,int> > h;
pair<int, int> pr;
bool fol[nmax];

void citire()
{
    scanf("%ld %ld",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld %ld",&a,&b,&c);
        el.n=b; el.c=c;
        ma[a].push_back(el);
        el.n=a;
        ma[b].push_back(el);
    }
}

void rezolvare()
{
    for (i=2;i<=n;i++)
        cmin[i]=inf;
    h.insert(make_pair(0,1));
    while (h.size())
    {
        pr=*h.begin();  h.erase(h.begin());
        fol[pr.second]=1;   rez+=pr.first;
        for (it=ma[pr.second].begin();it!=ma[pr.second].end();it++)
            if ((cmin[(*it).n]>(*it).c)&&(!fol[(*it).n]))
            {
                h.erase(make_pair(cmin[(*it).n],(*it).n));
                cmin[(*it).n]=(*it).c;  an[(*it).n]=pr.second;
                h.insert(make_pair(cmin[(*it).n],(*it).n));
            }
    }
}

void afisare()
{
    printf("%ld\n",rez);
    printf("%ld\n",n-1);
    for (i=2;i<=n;i++)
        printf("%ld %ld\n",an[i],i);
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    citire();
    rezolvare();
    afisare();
    return 0;
}