Pagini recente » Cod sursa (job #759357) | Cod sursa (job #730782) | Cod sursa (job #751226) | Cod sursa (job #1676678) | Cod sursa (job #2917480)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
struct paduri
{
vector<int> parent;
void init(int size)
{
parent.resize(size +1);
for (int i = 0; i <= size; i++)
{
parent[i] = i;
}
}
int rad(int x)
{
if (x == parent[x])
{
return x;
}
parent[x] = rad(parent[x]);
return parent[x];
}
void join(int x, int y)
{
x = rad(x);
y = rad(y);
if (x != y)
{
parent[y] = x;
}
}
bool same(int x,int y)
{
x = rad(x);
y = rad(y);
return x == y;
}
};
int main()
{
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m;
in >> n >> m;
paduri paduri;
paduri.init(n);
for (int i = 0; i < m; i++)
{
int o,x,y;
in >> o >> x >> y;
if (o == 1)
{
paduri.join(x,y);
}
else
{
if (paduri.same(x,y))
{
out << "DA\n";
}
else
{
out << "NU\n";
}
}
}
out.close();
in.close();
return 0;
}