Pagini recente » Cod sursa (job #2300496) | Cod sursa (job #892159) | Cod sursa (job #2128565) | Cod sursa (job #3139876) | Cod sursa (job #1882873)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int N=100001;
int tata[N];
void unite(int a,int b)
{
int x=a,y=b;
while(x!=tata[x]) x=tata[x];
while(y!=tata[y]) y=tata[y];
tata[y]=x;
}
int check(int a,int b)
{
int x=a,y=b,ok=0,pas;
while(x!=tata[x]) x=tata[x];
while(y!=tata[y]) y=tata[y];
if(x==y) ok=1;
int aux=a;
while(aux!=tata[aux])
{
pas=tata[aux];
tata[aux]=x;
aux=pas;
}
aux=b;
while(aux!=tata[aux])
{
pas=tata[aux];
tata[aux]=y;
aux=pas;
}
return ok;
}
int main()
{
int n,m,i,a,b,c;
fin>>n>>m;
for(i=1;i<=n;i++) tata[i]=i;
while(m--)
{
fin>>a>>b>>c;
if(a==1) unite(b,c);
else
{
if(check(b,c)==1) fout<<"DA\n";
else fout<<"NU\n";
}
}
}