Pagini recente » Cod sursa (job #1209040) | Cod sursa (job #288282) | Cod sursa (job #398900) | Diferente pentru admin/task-ratings-guidelines intre reviziile 19 si 18 | Cod sursa (job #3322055)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("apm.in");
ofstream fout ("apm.out");
#define cin fin
#define cout fout
struct muchie
{
int a,b,c;
};
const int nmax=200005,mmax=400005;
muchie muchii[mmax];
int tata[nmax],rangul[nmax],sol_a[nmax],sol_b[nmax];
int n,m;
int radacina(int x)
{
if(tata[x]==x)return x;
tata[x]=radacina(tata[x]);
return tata[x];
}
void unire(int x,int y)
{
x=radacina(x);
y=radacina(y);
if(x==y)return;
if(rangul[x]<rangul[y])tata[x]=y;
else if(rangul[y]<rangul[x])tata[y]=x;
else
{
tata[y]=x;
rangul[x]++;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=1; i<=m; i++)cin>>muchii[i].a>>muchii[i].b>>muchii[i].c;
for(int i=1; i<m; i++)
for(int j=i+1; j<=m; j++)
if(muchii[i].c>muchii[j].c)
{
muchie aux=muchii[i];
muchii[i]=muchii[j];
muchii[j]=aux;
}
for(int i=1; i<=n; i++)
{
tata[i]=i;
rangul[i]=0;
}
long long cost=0;
int nr=0;
for(int i=1; i<=m&&nr<n-1; i++)
{
int x=muchii[i].a,y=muchii[i].b,c=muchii[i].c;
if(radacina(x)!=radacina(y))
{
unire(x,y);
cost+=c;
nr++;
sol_a[nr]=x;
sol_b[nr]=y;
}
}
cout<<cost<<'\n'<<nr<<'\n';
for(int i=1; i<=nr; i++)
cout<<sol_a[i]<<' '<<sol_b[i]<<'\n';
return 0;
}