Cod sursa(job #1801804)
Utilizator | Anisoara aelin | Data | 9 noiembrie 2016 17:04:55 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
# include <bits/stdc++.h>
using namespace std;
int P[100100], N, M, x, y, t;
int find (int nod){
if (P[nod]==nod) return nod;
int p= find(P[nod]);
P[nod]= p;
return p;
}
void unite(int a, int b){
a= find (a);
b= find (b);
P[a]=b;
}
int main(){
ifstream cin("padure.in");
ofstream cout("padure.out");
cin>>N>>M;
for (int i=1; i<=N; i++) P[i]=i;
for (int i=1; i<=M; i++){
cin>>t>>x>>y;
if (t==1) unite(x,y);
else
cout<<(find(x)==find(y) ? "DA" : "NU")<<"\n";
}
return 0;
}