Cod sursa(job #689191)

Utilizator shetsansionutz shetsans Data 24 februarie 2012 10:44:41
Problema Arbore partial de cost minim Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include<fstream>
using namespace std;

ifstream in("apm.in");
ofstream out("apm.out");

struct muchie{
	int x,y,c;
};

muchie vm[400001],h[200001];
int n,m,ct,c[200001];

void citire(){
	in>>n>>m;
	for(int i=1;i<=m;i++)
		in>>vm[i].x>>vm[i].y>>vm[i].c;
}

void sort(){
	int i,j;
	muchie aux;
	for(i=1;i<m;i++)
		for(j=i+1;j<=m;j++)
			if(vm[i].c>vm[j].c){
				aux=vm[i];
				vm[i]=vm[j];
				vm[j]=aux;
			}
}

void apm(){
	int i;
	for(i=1;i<=n;i++)
		c[i]=i;
	sort();
	int msel=0;
	i=1;
	while(msel<n-1){
		while(c[vm[i].x]==c[vm[i].y])
			i++;
		msel++;
		h[msel]=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";
	out<<n-1<<" \n";
	for(int i=1;i<n;i++)
		out<<h[i].y<<" "<<h[i].x<<" \n";
return 0;
}