Pagini recente » Cod sursa (job #1076628) | Cod sursa (job #1541863) | Cod sursa (job #607917) | Cod sursa (job #448669) | Cod sursa (job #971393)
Cod sursa(job #971393)
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int rax,ray,a,x,y,n,m,i,T[100010];
int rad(int x)
{
while(T[x]>0)
x=T[x];
return x;
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
T[i]=-1;
for(i=1;i<=m;i++)
{
f>>a>>x>>y;
if(a==1)
{
rax=rad(x);
ray=rad(y);
if(rax!=ray)
{
if(T[rax]<T[ray])
{
T[rax]+=T[ray];
T[ray]=rax;
}
else
{
T[ray]+=T[rax];
T[rax]=ray;
}
}
}
if(a==2)
{
rax=rad(x);
ray=rad(y);
if(rax==ray)
g<<"DA"<<"\n";
else g<<"NU"<<"\n";
}
}
return 0;
}