Pagini recente » Cod sursa (job #1349014) | Cod sursa (job #3139312) | Cod sursa (job #2835463) | Cod sursa (job #403447) | Cod sursa (job #2815885)
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("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,s2;
s1=sef(x);
s2=sef(y);
tata[s2]=s1;
}
int main()
{
int tip,x,y,m,n,i,s1,s2;
f >> n >> m;
for(i=1; i<=n; ++i)
tata[i]=i;
for(i=1; i<=m; ++i)
{
f>>tip>>x>>y;
if(tip==1)
unire(x,y);
else
{
s1=sef(x);
s2=sef(y);
if(s1==s2)
g << "DA" << "\n";
else
g << "NU" << "\n";
}
}
return 0;
}