Cod sursa(job #2944591)
Utilizator | Data | 22 noiembrie 2022 18:22:39 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#import<bits/stdc++.h>
std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,i,j,z,t['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return t[x]?t[x]=f(t[x]):x;}main(){r>>m>>m;for(;r>>e[i].x>>e[i].y>>e[i].z;i++);std::sort(e,e+m,[](s a,s b){return a.z<b.z;});for(;j<m;)d=e[j],e[f(d.y)^(x=f(d.x))?t[x]=d.y,z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";for(;k--;)w<<e[k].x<<" "<<e[k].y<<" ";}