Pagini recente » Cod sursa (job #784514) | Cod sursa (job #158694) | Cod sursa (job #2394657) | Cod sursa (job #1644674) | Cod sursa (job #1345807)
#include <fstream>
#define nmax 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[nmax],n,m,r[nmax];
void uneste(int x,int y)
{
if(r[x]>r[y])
t[y]=x;
else
t[x]=y;
if(r[x]==r[y])
r[x]++;
}
int tata(int x)
{
if(t[x]==x)
return x;
t[x]=tata(t[x]);
return t[x];
}
int main()
{
fin>>n>>m;
int cod,x,y;
for(int i=1;i<=n;i++)
{
t[i]=i;
r[i]=1;
}
for(int i=1;i<=m;i++)
{
fin>>cod>>x>>y;
if(cod==1)
uneste(x,y);
else
if(tata(x)==tata(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
return 0;
}