Pagini recente » Cod sursa (job #89646) | Cod sursa (job #2799713) | Cod sursa (job #592483) | Cod sursa (job #424467) | Cod sursa (job #3210919)
#include <bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int t[100002], n,m,c,x,y,sz[100002];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
f>>n>>m;
for(int i=1; i<=n; i++)
{
sz[i]=1;
t[i]=i;
}
for(int i=1; i<=m; i++)
{
f>>c>>x>>y;
if(c==2)
{
if(t[x]==t[y])
g<<"DA\n";
else
g<<"NU\n";
}
else
{
while(x!=t[x])
x=t[x];
while(y!=t[y])
y=t[y];
if(sz[x]>sz[y])
{
t[y]=x;
sz[x]+=sz[y];
for(int j=1;j<=n;j++)
if(t[j]==y)
t[j]=x;
}
else
{
t[x]=y;
sz[y]+=sz[x];
for(int j=1;j<=n;j++)
if(t[j]==x)
t[j]=y;
}
}
}
return 0;
}