Pagini recente » Cod sursa (job #1742596) | Cod sursa (job #2418458) | Cod sursa (job #1194819) | Cod sursa (job #1039175) | Cod sursa (job #2662231)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,t[100001];
inline int radacina(int x)
{
int rad, y;
rad = x;
while (t[rad] != 0) rad = t[rad];
while (x != rad)
{
y = t[x];
t[x] = rad;
x = y;
}
return rad;
}
inline void unire(int a,int b)
{
t[b]=a;
}
int main()
{
fin>>n>>m;
for (int i=1;i<=m;i++)
{
int a,b,op;
fin>>op>>a>>b;
int r1=radacina(a),r2=radacina(b);
if (op==1)
{
unire(r1,r2);
}
else
{
if (r1==r2)
{
fout<<"DA\n";
}
else
fout<<"NU\n";
}
}
return 0;
}