Pagini recente » Cod sursa (job #703811) | Cod sursa (job #2654430) | Cod sursa (job #425654) | Cod sursa (job #1779450) | Cod sursa (job #2115793)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("../disjoint.in");
ofstream out("../disjoint.out");
const int Max = 100005;
int n, m;
int tati[Max];
int searchFather(int w)
{
if(tati[w] == w)
{
return w;
}
int x = searchFather(tati[w]);
tati[w] = x;
return x;
}
void citire()
{
in >> n >> m;
for(int i = 0; i <= n; i++)
{
tati[i] = i;
}
for(int i = 0; i < m; i++)
{
int cod, x, y;
in >> cod >> x >> y;
int Fx = searchFather(x);
int Fy = searchFather(y);
if(cod == 1)
{
tati[Fx] = Fy;
continue;
}
else
{
if(Fx == Fy)
out << "DA\n";
else
out << "NU\n";
}
}
}
int main()
{
citire();
return 0;
}