Pagini recente » Cod sursa (job #2367160) | Cod sursa (job #300342) | Cod sursa (job #3207322) | Cod sursa (job #3141450) | Cod sursa (job #674878)
Cod sursa(job #674878)
#include<fstream>
#include<vector>
#define lim 400020
using namespace std;
int n,m,c,T[lim/2],a,b,i,j,nr,viz[lim],cost;
ifstream f("apm.in");
ofstream g("apm.out");
vector<int>muc;
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;
}