Pagini recente » Cod sursa (job #488715) | Cod sursa (job #680831) | Cod sursa (job #304658) | Cod sursa (job #864545) | Cod sursa (job #1246556)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
#define MAX 100005
int dad[MAX];
int sef(int i)
{
if(dad[i]!=i)
dad[i] = sef(dad[i]);
return dad[i];
}
int main()
{
int n, m;
fin >> n >> m;
for(int i = 1; i<=n; i++)
dad[i] = i;
int op, x, y;
for(int i = 1; i<=m; i++)
{
fin >> op >> x >> y;
x = sef(x);
y = sef(y);
if( op == 1)
{
dad[x] = dad[y];
}
if( op == 2)
{
if(dad[x]==dad[y])
fout << "DA\n";
else
fout << "NU\n";
}
}
return 0;
}