Pagini recente » Cod sursa (job #80427) | Cod sursa (job #1734425) | Cod sursa (job #985169) | Cod sursa (job #872535) | Cod sursa (job #2039066)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m;
int p[100000];
int parinte(int nod)
{
if(p[nod]==nod)
return nod;
return p[nod]=parinte(p[nod]);
}
void unite(int x,int y)
{
p[parinte(x)]=parinte(y);
}
int main()
{
int cod,x,y;
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>cod>>x>>y;
if(!p[x])
p[x]=x;
if(!p[y])
p[y]=y;
if(cod==1)
unite(x,y);
else
{
if(parinte(x)==parinte(y))
out<<"DA"<<'\n';
else
out<<"NU"<<'\n';
}
}
return 0;
}