Pagini recente » Cod sursa (job #1108895) | Cod sursa (job #1708789) | Cod sursa (job #1315647) | Cod sursa (job #309768) | Cod sursa (job #2815861)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int tata[100001];
int sef(int x)
{
if(tata[x]==x)
return x;
else
return tata[x]=sef(tata[x]);
}
void unire(int x, int y)
{
int s1=sef(x),s2=sef(y);
tata[s2]=s1;
}
int main()
{
int n,m,i,tip,x,y,s1,s2;
in>>n>>m;
for(i=1; i<=n; i++)
tata[i]=i;
for(i=1; i<=m; i++)
{
in>>tip>>x>>y;
if(tip==1)
unire(x,y);
else
{
s1=sef(x);
s2=sef(y);
if(s1==s2)
out<<"DA\n";
else
out<<"NU\n";
}
}
return 0;
}