Pagini recente » Cod sursa (job #962931) | Cod sursa (job #2174949) | Cod sursa (job #1264667) | Cod sursa (job #2692584) | Cod sursa (job #2752341)
#include <fstream>
using namespace std;
const int N = 1e7;
int n,m,t[N],h[N];
ifstream in("disjoint.in");
ofstream out("disjoint.out");
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 if(h[rx] > h[ry])
{
t[ry] = rx;
}
else
{
t[rx] = ry;
h[ry]++;
}
}
bool verificare(int x,int y)
{
return(radacina(x) == radacina(y));
}
int main()
{
in >> n >> m;
for(int i = 1; i <= m; i++)
{
int tip,x,y;
in >> tip >> x >> y;
if(tip == 1)
{
reuniune(x,y);
}
else
{
if(verificare(x,y))
{
out << "DA" <<"\n";
}
else
out << "NU" << "\n";
}
}
in.close();
out.close();
return 0;
}