Pagini recente » Cod sursa (job #214299) | Cod sursa (job #634231) | Cod sursa (job #2299593) | Cod sursa (job #2159451) | Cod sursa (job #639353)
Cod sursa(job #639353)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int tata[100010];
int radacina(int x)
{
if(tata[x]==-1)
return x;
int r=radacina(tata[x]);
tata[x]=r;
return r;
}
int main()
{
int n,m,i,q,x,y;
in>>n>>m;
for(i=1;i<=n;++i)
tata[i]=-1;
for(i=1;i<=m;++i)
{
in>>q>>x>>y;
if(q==2)
{
if(radacina(x)==radacina(y))
out<<"DA\n";
else
out<<"NU\n";
}
else
{
tata[radacina(x)]=radacina(y);
}
}
return 0;
}