Pagini recente » Cod sursa (job #2099971) | Cod sursa (job #1629427) | Cod sursa (job #100134) | Cod sursa (job #2450036) | Cod sursa (job #1035996)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout("disjoint.out");
#define MAX 100010
int a[MAX];
inline int gr(int l)
{
if(a[l]!=l)
a[l]=gr(a[l]);
return a[l];
}
int main()
{
int n, i, m, x, y, z;
fin>>n;
for(i=1;i<=n;i++)
{
a[i]=i;
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y>>z;
if(x==1)
{
a[gr(y)]=gr(z);
}
else
{
if(gr(y)==gr(z))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}