Pagini recente » Cod sursa (job #102716) | Cod sursa (job #2672234) | Cod sursa (job #1189349) | Cod sursa (job #1232237) | Cod sursa (job #2844707)
#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int a[100002], fa[100002]; ///a=lungimea, fa= multimea
int main()
{
int n,m,c,x,y;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
a[i]=1; fa[i]=i;
}
for(int i=0;i<m;i++)
{
fin>>c>>x>>y;
while(fa[x]!=x)
{
x=fa[x];
}
while(fa[y]!=y)
{
y=fa[y];
}
if(c==1)
{
if(a[x]<a[y])
{
fa[x]=y;
a[x]+=a[y];
}
else
{
fa[y]=x;
a[y]+=a[x];
}
}
else
{
if(fa[x]==fa[y])
{
fout<<"DA"<<'\n';
}
else
{
fout<<"NU"<<'\n';
}
}
}
return 0;
}