Cod sursa(job #2944660)
Utilizator | Piscu Stefan Constantin Stefan_Piscu | Data | 22 noiembrie 2022 20:10:31 |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#import<bits/stdc++.h>
using namespace std;ofstream w("apm.out");ifstream r("apm.in");tuple<int,int,int>e[1<<20],d;int t[1<<20],m,a,b,c,i,j,k,x,p,q;int f(int x){return t[x]?t[x]=f(t[x]):x;}main(){r>>m>>m;while(r>>a>>b>>c)e[i++]={c,a,b};sort(e,e+m);for(;j<m;)tie(c,a,b)=d=e[j],e[f(b)^(x=f(a))?t[x]=b,p+=c,q++:j++]=d;w<<p<<" "<<q<<" ";for(;k<m;)tie(c,a,b)=e[k++],w<<a<<" "<<b<<" ";}