Pagini recente » Cod sursa (job #1221431) | Cod sursa (job #1687917) | Cod sursa (job #2897736) | Cod sursa (job #1522397) | Cod sursa (job #1520770)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
const int MAX = 100005;
int n,v[MAX];
inline int grup(int x)
{
while(x != v[x]){
x = v[x];
}
return x;
}
int main()
{
int m,p,x,y;
fin >> n >> m;
for(int i = 1; i <= n; i++)
v[i] = i;
for(int i = 1; i <= m; i++){
fin >> p >> x >> y;
x = grup(x);
y = grup(y);
if(p == 1){
if(x != y){
v[y] = x;
}
} else {
if(x == y)
fout << "DA" << "\n";
else
fout << "NU" << "\n";
}
}
return 0;
}