Pagini recente » Cod sursa (job #3318444) | Cod sursa (job #980625) | Cod sursa (job #2685252) | Cod sursa (job #3316114) | Cod sursa (job #3342033)
#include <iostream>
#include <fstream>
#include <cstring>
#define NMax 1000005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int nxt[NMax];
int head[NMax];
int tail[NMax];
int n,m;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
nxt[i]=0;
head[i]=i;
tail[i]=i;
}
for(int i=1;i<=m;i++)
{
int cod,x,y;
fin>>cod>>x>>y;
if(cod==2)
{
if(head[x]==head[y])
fout<<"DA"<<"\n";
else
fout<<"NU"<<"\n";
}
else if(cod==1)
{
int hx=head[x];
int hy=head[y];
nxt[tail[x]]=hy;
tail[hx]=tail[hy];
int i=hy;
while(i!=0)
{
head[i]=hx;
i=nxt[i];
}
}
}
return 0;
}