Pagini recente » Cod sursa (job #732329) | Cod sursa (job #1179350) | Cod sursa (job #2836225) | Cod sursa (job #2624780) | Cod sursa (job #3129917)
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,i,op,x,y;
int c[100001],r[100001];
int look(int x)
{
if(r[x]==x) return x;
r[x]=look(r[x]);
return r[x];
}
void unite(int x,int y)
{
if(c[x]<c[y]) swap(x,y);
c[x]+=c[y];
r[y]=x;
}
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
{
c[i]=1;
r[i]=i;
}
for(int w=1;w<=m;++w)
{
f>>op>>x>>y;
if(op==1) unite(look(x),look(y));
else
{
if(look(x)==look(y)) g<<"DA\n";
else g<<"NU\n";
}
}
return 0;
}