Pagini recente » Cod sursa (job #271000) | Cod sursa (job #2981559) | Cod sursa (job #489651) | Cod sursa (job #2979496) | Cod sursa (job #1770607)
#include <iostream>
#include <cstdio>
using namespace std;
int v[100005],n,m;
void initializer()
{
for(int i=1; i<=n; i++)
v[i]=i;
}
int radacina(int i)
{
while(i!=v[i])
{
i=v[i];
}
return i;
}
void intesectie(int x,int y)
{
v[radacina(x)]=radacina(y);
}
void interogare(int x,int y)
{
if(radacina(x)==radacina(y)) printf("DA\n");
else printf("NU\n");
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&n,&m);
initializer();
int x,y,z;
for(int i=1; i<=m; i++)
{
scanf("%d%d%d",&x,&y,&z);
if(x==2)
interogare(y,z);
else intesectie(z,y);
}
return 0;
}