Pagini recente » Cod sursa (job #1017339) | Cod sursa (job #2756006) | Cod sursa (job #2401789) | Cod sursa (job #831872) | Cod sursa (job #1643757)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, t, x, y, v[100010], a, b;
int parinte(int x){
while(x != v[x])
x = v[x];
return x;
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; ++i)
v[i] = i;
for(int i = 1; i <= m; ++i){
fin >> t >> x >> y;
a = parinte(x);
b = parinte(y);
if(t == 1){
v[a] = b;
}
else {
if(a == b){
fout << "DA\n";
}
else {
fout << "NU\n";
}
}
}
return 0;
}