Pagini recente » Cod sursa (job #96499) | Cod sursa (job #1655006) | Cod sursa (job #2673207) | Cod sursa (job #338967) | Cod sursa (job #2977211)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int t[100001],h[100001];
void unif(int r1,int r2)
{if(h[r1]<h[r2])t[r1]=r2;
else t[r2]=r1;
if(h[r1]==h[r2])h[r1]++;
}
int rad(int x)
{int r=x;
while(t[r]!=r)r=t[r];
//regula de compresie
while(x!=r)
{int aux=t[x];
t[x]=r;
x=aux;
}
return r;
}
int main()
{int n,m,i,cod,x,y;
f>>n>>m;
for(i=1;i<=n;i++)
{t[i]=i;h[i]=1;}
for(i=1;i<=m;i++)
{f>>cod>>x>>y;
int r1=rad(x),r2=rad(y);
if(cod==1)
unif(r1,r2);
else {if(rad(x)==rad(y))g<<"DA"<<'\n';
else g<<"NU"<<'\n';}
}
}