Cod sursa(job #2941971)

Utilizator lucametehauDart Monkey lucametehau Data 18 noiembrie 2022 16:53:17
Problema Arbore partial de cost minim Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.4 kb
#import<bits/stdc++.h>
std::ifstream r("apm.in");std::ofstream w("apm.out");
struct s{int x,y,z;}d,e[1<<20];
int m,k,i,j,z,t[1<<20],x;
int f(int &x){return x=(t[x]^x?f(t[x]):x);}
int main(){r>>m>>m;
while(r>>e[i].x>>e[i].y>>e[t[i]=i].z)i++;
std::sort(e,e+m,[](s a,s b){return a.z<b.z;});
for(;j<m;){d=e[j++];x=f(d.x);if(x^(t[x]=f(d.y)))z+=d.z,e[k++]=d;}
w<<z<<" "<<k<<" ";
while(k--)w<<e[k].x<<" "<<e[k].y<<" ";}