Cod sursa(job #2941897)

Utilizator lucametehauDart Monkey lucametehau Data 18 noiembrie 2022 15:26:49
Problema Arbore partial de cost minim Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.5 kb
#include <bits/stdc++.h>
#define v return
using namespace std;
ifstream r("apm.in");
ofstream w("apm.out");
const int N=400005;
struct s{int x,y,z;}e[N],a[N];
bool c(s a, s b){v a.z<b.z;}
int n,m,k,i,z,t[N],x,y;
int f(int x){if(t[x]==x)v x;v t[x]=f(t[x]);}
int main(){
r>>n>>m;
for(i=0;i<m;i++)r>>e[i].x>>e[i].y>>e[i].z,t[i]=i;
sort(e,e+m,c);
for(i=0;i<m;i++){x=f(e[i].x),y=f(e[i].y);if(x!=y)z+=e[i].z,t[x]=y,a[++k]={e[i].x,e[i].y,0};}
w<<z<<"\n"<<k<<"\n";
for(i=1;i<=k;i++)w<<a[i].x<<" "<<a[i].y<<"\n";
v 0;}