Cod sursa(job #2941892)

Utilizator lucametehauDart Monkey lucametehau Data 18 noiembrie 2022 15:21:36
Problema Arbore partial de cost minim Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.58 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];
bool c(s a, s b){v a.z<b.z;}
int n,m,k,i,z,t[N];
pair<int,int>a[N];
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;};
    for(i=0;i<n;i++)t[i]=i;
    sort(e,e+m,c);
    for(i=0;i<m;i++) {int x=f(e[i].x),y=f(e[i].y);if(x==y)continue;z+=e[i].z;t[x]=y;a[++k]={e[i].x,e[i].y};}
    w<<z<<"\n"<<k<<"\n";
    for(i=1;i<=k;i++)w<<a[i].first<<" "<<a[i].second<<"\n";
    v 0;
}