Pagini recente » Cod sursa (job #2511252) | Cod sursa (job #386663) | Cod sursa (job #1916674) | Cod sursa (job #1904783) | Cod sursa (job #2755495)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int N,M,c,x,y;
int L[100005];
int main()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
L[i]=i;
for(int i=1;i<=M;i++)
{
fin>>c>>x>>y;
if(c==1)
{
if(x<y)
{
for(int j=1;j<=N;j++)
if(L[j]==L[y]) L[j]=L[x];
}
else
{
for(int j=1;j<=N;j++)
if(L[j]==L[x]) L[j]=L[y];
}
}
if(c==2)
{
if(L[x]==L[y]) fout<<"DA";
else fout<<"NU";
fout<<'\n';
}
}
return 0;
}