Pagini recente » Cod sursa (job #2443767) | Cod sursa (job #3281051) | Cod sursa (job #2654559) | Cod sursa (job #1388871) | Cod sursa (job #3134852)
#include <fstream>
using namespace std;
const int N = 1e5;
int t[N+1], h[N+1];
int radacina(int x)
{
if (t[x] == 0)
{
return x;
}
return radacina(t[x]);
}
void reuniune(int x, int y)
{
int rx = radacina(x);
int ry = radacina(y);
if (h[rx] < h[ry])
{
t[rx] = ry;
}
else
{
t[ry] = rx;
if (h[rx] == h[ry])
{
h[rx]++;
}
}
}
bool interogare(int x, int y)
{
return (radacina(x) == radacina(y));
}
int main()
{
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n, m;
in >> n >> m;
for (int i = 0; i < m; i++)
{
int tip, x, y;
in >> tip >> x >> y;
if (tip == 1)
{
reuniune(x, y);
}
else
{
if (interogare(x, y))
{
out << "DA\n";
}
else
{
out << "NU\n";
}
}
}
in.close();
out.close();
return 0;
}