Pagini recente » Cod sursa (job #1633965) | Cod sursa (job #965505) | Cod sursa (job #1007394) | Cod sursa (job #157251) | Cod sursa (job #3262557)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int mv[100005];
int findr(int u)
{
while(mv[u]!=u)
{
u=mv[u];
}
return u;
}
void unire(int u,int v){
int ru,rv;
ru=findr(u);
rv=findr(v);
mv[ru]=rv;
}
int main()
{
int n,i,x,y,m,c;
fin>>n>>m;
for(i=1;i<=n;i++)
mv[i]=i;
for(i=1;i<=m;i++)
{
fin>>c>>x>>y;
if(c==1)
{
unire(x,y);
}
else
{
if(findr(x)==findr(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}