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