Pagini recente » Cod sursa (job #3345513) | Cod sursa (job #982428) | Cod sursa (job #3354458) | Cod sursa (job #3301180) | Cod sursa (job #3322648)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
vector<int>tata;
int radacina(int nod)
{
if (tata[nod] == nod)
return nod;
tata[nod] = radacina(tata[nod]);
return tata[nod];
}
void op1(int x, int y)
{
int tx = radacina(x);
int ty = radacina(y);
if (tx == ty)
return;
else
tata[tx] = ty;
}
void op2(int x, int y)
{
if (radacina(x)==radacina(y))
fout << "DA";
else
fout << "NU";
fout << '\n';
}
int n,c,m, x, y;
int main()
{
fin >> n >> m;
tata.resize(n + 1);
for (int i = 1; i <= n; i++)
tata[i] = i;
for (int i = 1; i <= m; i++)
{
fin >> c >> x >> y;
if (c == 1)
op1(x, y);
else
op2(x, y);
}
return 0;
}