Cod sursa(job #1267792)

Utilizator DanyPrvPirvoaica Daniel DanyPrv Data 20 noiembrie 2014 12:19:23
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <fstream>
#include <set>
#include <vector>
#include <limits>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
multiset <pair<int,int> > a;
multiset <pair<int,int> > ::iterator it;
vector <pair<int,int> >v
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++){
        f>>x>>y>>z;
        v[x].push_back(make_pair(y,z));
        v[y].push_back(make_pair(x,z));
    }
    for(i=1;i<=n;i++){
        nre[i]=a[i].size();
        c[i]=INT_MAX;
    }
    v.insert(make_pair(0,1));
    for(i=1;i<n-1;i++){
        it=a.begin();
        nod=(*it).first;

        for(j=0;j<nre[nod];j++){
            c[v[nod][j].first]=v[nod][j].second;
            t[v[nod][j].first]=1;
            v.insert(make_pair(c[v[nod][j].first],v[nod][j].first));

        }
    }

    return 0;
}