Pagini recente » Cod sursa (job #483799) | Cod sursa (job #2587051) | Cod sursa (job #1944985) | Cod sursa (job #2224167) | Cod sursa (job #2752350)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int N = 200005;
int t[N], h[N];
int radacina(int x)
{
if(t[x]==0)
return x;
return radacina(t[x]);
}
bool verificare(int x, int y)
{
return (radacina(x) == radacina(y));
}
void reuniune(int x, int y)
{
int rx = radacina(x);
int ry = radacina(y);
if(h[rx] < h[ry])
{
t[rx] = t[y];
}
else if(h[rx] > h[ry])
{
t[ry]=rx;
}
else
{
t[ry] = rx;
h[rx]++;
}
}
int main()
{
int n, m;
in>>n>>m;
for(int i=0; i<m; i++)
{
int ct, x, y;
in>>ct>>x>>y;
if(ct == 1)
{
reuniune(x,y);
}
else
{
if(verificare(x,y))
out<<"DA"<<"\n";
else
out<<"NU"<<"\n";
}
}
return 0;
}