Cod sursa(job #2682007)
Utilizator | Data | 7 decembrie 2020 16:20:55 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
std::ifstream in("disjoint.in");
std::ofstream ut("disjoint.out");
int n,m,t[100001];
int root(int n){
while(t[n]){n=t[n];}
return n;
}
main(){
int o,a,b;
in>>n>>m;
while(m--){
in>>o>>a>>b;
if(o==1) t[root(b)]=root(a);
else if(root(a)==root(b)) ut<<"DA\n";
else ut<<"NU\n";
}
}