Pagini recente » Istoria paginii utilizator/alexxx92 | Cod sursa (job #1339966) | Cod sursa (job #2807592) | Istoria paginii runda/simulare_oji_2015/clasament | Cod sursa (job #2563589)
#include<fstream>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int n, m, t[100010];
int f (int a)
{
if (a==t[a])return a;
else
{
t[a]=f(t[a]);
return t[a];
}
}
int main ()
{
int i, c, x, y;
fin>>n>>m;
for (i=1; i<=n; i++)t[i]=i;
for (i=1; i<=m; i++)
{
fin>>c>>x>>y;
if (c==1)
t[f(x)]=f(y);
else
{
if (f(x)==f(y))fout<<"DA"<<'\n';
else fout<<"NU"<<'\n';
}
}
}