Pagini recente » Cod sursa (job #2166865) | Cod sursa (job #2686363) | Cod sursa (job #215236) | Cod sursa (job #939871) | Cod sursa (job #3250527)
#include <fstream>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
#define NMAX 100008
struct DSU
{
int parent[NMAX];
void init(int n)
{
for (int i=1; i<=n; i++)
{
parent[i]=i;
}
}
int set_find (int node)
{
if (node==parent[node])
{
return node;
}
return parent[node]=set_find (parent[node]);
}
void set_unite (int node1, int node2)
{
int p1=set_find (node1),p2=set_find(node2);
parent[p1]=p2;
}
}dsu;
int n,q,a,b,type,m;
int main()
{
fin>>n>>m;
dsu.init(n);
while (m--)
{
fin>>type>>a>>b;
if (type==1)
{
dsu.set_unite (a,b);
}
else
{
if (dsu.set_find (a)!=dsu.set_find (b))
{
fout<<"NU\n";
}
else
{
fout<<"DA\n";
}
}
}
return 0;
}