Pagini recente » Cod sursa (job #86) | Cod sursa (job #2677221) | Cod sursa (job #911104) | Cod sursa (job #1778341) | Cod sursa (job #855926)
Cod sursa(job #855926)
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,t[100001],r[100001];
int rad(int x)
{
while(x!=t[x])
x=t[x];
return x;
}
void unire(int x,int y)
{
int a,b;
a=rad(x);
b=rad(y);
if(r[a]<r[b]) t[a]=b;
else
{
t[b]=a;
if(r[a]==r[b]) r[a]++;
}
}
int main()
{
f>>n>>m;
int i,c,x,y;
for(i=1;i<=n;i++)
{
t[i]=i;
r[i]=1;
}
for(i=0;i<m;i++)
{
f>>c>>x>>y;
if(c==1)
{
unire(x,y);
}
else
{
if(rad(x)==rad(y)) g<<"DA"<<'\n';
else g<<"NU"<<'\n';
}
}
}