Pagini recente » Cod sursa (job #217533) | Cod sursa (job #2193925) | Cod sursa (job #1485181) | Cod sursa (job #1955320) | Cod sursa (job #3154085)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
struct DSU {
int N;
vector<int> parent,sizes;
void init(int n)
{
N=n;
parent.resize(n+1);
sizes.resize(n+1);
int i;
for(i=1;i<=n;i++)
{
parent[i]=i;
sizes[i]=1;
}
}
int findx(int u)
{
if(parent[u]==u)
return u;
return parent[u]=findx(parent[u]);
}
void unit(int u,int v)
{
u=findx(u);
v=findx(v);
if(u==v)
return;
if(sizes[v]>sizes[u])
swap(v, u);
parent[v]=u;
sizes[u]+=sizes[v];
}
};
int main()
{
DSU dsu;
int n, m;
cin>>n>>m;
int i, c, x, y, nr1, nr2;
dsu.init(n);
for(i=0; i<m; i++)
{
cin>>c>>x>>y;
if(c==1)
dsu.unit(x, y);
else
{
nr1=dsu.findx(x);
nr2=dsu.findx(y);
if(nr1==nr2)
cout<<"DA";
else
cout<<"NU";
cout<<'\n';
}
}
return 0;
}