Pagini recente » Cod sursa (job #1421128) | Cod sursa (job #2107628) | Cod sursa (job #3176790) | Cod sursa (job #2461831) | Cod sursa (job #1345842)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int N = 100001;
int n, m;
int t[N];
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";
}
void citire()
{
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);
}
}
int main()
{
citire();
return 0;
}