Pagini recente » Cod sursa (job #1785773) | Cod sursa (job #238023) | Cod sursa (job #1166041) | Cod sursa (job #2026116) | Cod sursa (job #2067418)
#include <fstream>
#define nmax 100002
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[nmax];
int rg[nmax];
int gaseste(int x)
{
int y,r;
r=x;
while(r!=t[r])
r=t[r];
while(x!=t[x])
{
y=t[x];
t[x]=r;
x=y;
}
return r;
}
void unire(int x,int y)
{
if(rg[x]>rg[y])
t[y]=t[x];
else
t[x]=t[y];
if(rg[y]==rg[x])
rg[y]++;
}
int main()
{
int n,m,c,x,y;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
t[i]=i;
rg[i]=1;
}
for(int i=1;i<=m;i++)
{
fin>>c>>x>>y;
if(c==1)
{
unire(gaseste(x),gaseste(y));
}
else
{
if(gaseste(x)==gaseste(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}