Cod sursa(job #689188)

Utilizator TeddyBossStefu Teodor Petre TeddyBoss Data 24 februarie 2012 10:43:39
Problema Arbore partial de cost minim Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include<iostream>
#include<fstream>
 
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
struct muchie{
int x,y,c;
};
muchie vm[400001],h[200000];
int n,m,ct;
int c[200000];
 
void citire(){
in>>n>>m;
int i;
for(i=1;i<=m;i++)
in>>vm[i].x>>vm[i].y>>vm[i].c;
}
 
void stort(){
int i,j;
for(i=1;i<m;i++)
for(j=i+1;j<=m;j++)
if(vm[i].c>vm[j].c){
muchie aux=vm[i];
vm[i]=vm[j];
vm[j]=aux;
}
}
 
void apm(){
int i;
for(i=1;i<=n;i++)
c[i]=i;
stort();
int mrel=0;
i=1;
while(mrel<n-1){
while(c[vm[i].x]==c[vm[i].y]) i++;
mrel++;
h[mrel]=vm[i];
int min=c[vm[i].x],max=c[vm[i].x];
if(c[vm[i].y]>max)  max=c[vm[i].y];
if(c[vm[i].y]<min) min=c[vm[i].y];
for(int j=1;j<=n;j++)
if(c[j]==max)
c[j]=min;
ct+=vm[i].c;
}
}
 
int main(){
citire();
apm();
out<<ct<<"\n"<<n-1<<"\n";
for(int i=1;i<n;i++)
out<<h[i].y<<" "<<h[i].x<<"\n";
}