Pagini recente » Cod sursa (job #467576) | Cod sursa (job #2287414) | Cod sursa (job #2947574) | Cod sursa (job #2018236) | Cod sursa (job #1378048)
#include<fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
#define N 100001
int t[N];
int n, m;
int multime(int x)
{
if( t[x] != x)
t[x] = multime(t[x]);
return t[x];
}
void uneste(int x, int y)
{
x = multime(x);
y = multime(y);
t[x] = y;
}
void query(int x, int y)
{
if(multime(x) == multime(y))
out<<"DA"<<'\n';
else
out<<"NU"<<'\n';
}
int main()
{
in >> n >> m;
for(int i=1; i<=n; i++)
t[i] = i;
for(int i=1; i<=m; i++)
{
int cod, x, y;
in >> cod >> x >> y;
if(cod == 1)
uneste(x, y);
else
query(x, y);
}
}