Pagini recente » Borderou de evaluare (job #878115) | Cod sursa (job #1925214)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int N=100100;
int n, m, t[N];
int fnd(int i)
{
if(t[i]!=i)
t[i]=fnd(t[i]);
return t[i];
}
void join(int i, int j)
{
t[fnd(i)]=fnd(j);
}
int main()
{
fin>>n>>m;
for(int i=1;i<=n;++i)
t[i]=i;
for(int i=0;i<m;++i)
{
int p, x, y;
fin>>p>>x>>y;
if(p==1)
join(x, y);
else if(p==2)
fout<<((fnd(x)==fnd(y))?"DA":"NU")<<'\n';
}
return 0;
}