Pagini recente » Cod sursa (job #1646453) | Cod sursa (job #1704356) | Cod sursa (job #873277) | Cod sursa (job #1315579) | Cod sursa (job #1470821)
#include <cstdio>
#include <cstring>
#define NMAX 100007
FILE *fin, *fout;
using namespace std;
int n, m, pmd[NMAX], t, a, b;
int root(int x)
{
int rx = x;
while(pmd[rx] >= 0)
{
rx = pmd[rx];
}
while(x!= rx)
{
int aux = pmd[x];
pmd[x] = rx;
x = aux;
}
return rx;
}
void unit(int x, int y)
{
int rx = root(x), ry = root(y);
if(pmd[rx] < pmd[ry]) {pmd[rx] += pmd[ry]; pmd[ry] = rx;}
else {pmd[ry] += pmd[rx]; pmd[rx] = ry;}
}
bool query(int x, int y)
{
return root(x) == root(y);
}
int main()
{
fin = freopen("disjoint.in", "r", stdin);
fout = freopen("disjoint.out", "w", stdout);
scanf("%d %d", &n, &m);
memset(pmd, -1, sizeof(pmd));
for(int i = 1; i<= m; ++i)
{
scanf("%d %d %d", &t, &a, &b);
if(t == 1)
{
unit(a, b);
}
if(t == 2)
{
if(query(a, b) == 1) printf("DA\n");
else printf("NU\n");
}
}
fclose(fin);
fclose(fout);
return 0;
}