Cod sursa(job #674868)

Utilizator BarracudaFMI-Alex Dobrin Barracuda Data 6 februarie 2012 20:47:39
Problema Arbore partial de cost minim Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include<fstream>
#define lim 400002
using namespace std;
int n,m,c,T[lim/4],a,b,i,j,nr,viz[lim],cost;
ifstream f("apm.in");
ofstream g("apm.out");
struct muchii{
	int x,y,c;
}
v[lim];
int tata(int x){
	int y=x;
	while(T[y]>0)
		y=T[y];
	return y;
}
void lipeste (int a,int b){
	if(-T[a]>=-T[b]){
		T[a]=T[b]+T[a];
		T[b]=a;
	}
	else{
		T[b]=T[b]+T[a];
		T[a]=b;
	}
}
int main (){
	f>>n>>m;
	for(i=1;i<=m;i++)
		f>>v[i].x>>v[i].y>>v[i].c;
	
	for(i=1;i<m;i++)
		
		for(j=i+1;j<=m;j++){
			
			if(v[i].c>v[j].c){
				
				swap(v[i].c,v[j].c);
				swap(v[i].x,v[j].x);
				swap(v[i].y,v[j].y);
				
			}
			
		}
	
	for(i=1;  i<=m ;i++ ){
		
		a=tata(v[i].x);
		b=tata(v[i].y);
		if(a!=b){
			nr++;
			cost+=v[i].c;
			lipeste(a,b);
		}
		else
			viz[i]=-1;
		
	}
	g<<cost<<"\n";
	g<<nr<<"\n";
	for(i=1;i<=m;i++){
		if(!viz[i])
			g<<v[i].x<<" "<<v[i].y<<"\n";
		
	}
	return 0;
}