Pagini recente » Cod sursa (job #3122702) | Cod sursa (job #700408) | Cod sursa (job #2367293) | Cod sursa (job #3000177) | Cod sursa (job #1051405)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int main()
{
int n,m,i,tip,x,y,tati[100004];
fin>>n>>m;
for(i=0;i<n;i++)
tati[i]=i;
for(i=0;i<m;i++){
fin>>tip>>x>>y;
while(x!=tati[x])
x=tati[x];
while(y!=tati[y])
y=tati[y];
if(tip==1)
tati[y]=x;
else{
if(x==y)
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
}
}
return 0;
}