Pagini recente » Cod sursa (job #2922424) | Cod sursa (job #3260095) | Cod sursa (job #1191587) | Cod sursa (job #2210206) | Cod sursa (job #2773879)
#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)
{
int N=n,i;
parent.resize(N+1);
sizes.resize(N+1);
for(i=1;i<=n;i++)
{
parent[i]=i;
sizes[i]=1;
}
}
int find(int u)
{
if(u==parent[u])
return u;
return find(parent[u]);
}
void unite(int u,int v)
{
u=find(u);
v=find(v);
if(u==v)
return;
if(sizes[v]>sizes[u])
swap(u,v);
parent[v]=u;
sizes[u]+=sizes[v];
}
};
int main()
{
DSU dsu;
int n,m,x,y,i,t;
cin>>n>>m;
dsu.init(n);
for(i=1;i<=m;i++)
{
cin>>t>>x>>y;
if(t==1)
dsu.unite(x,y);
else
{
if(dsu.find(x)==dsu.find(y))
cout<<"DA"<<endl;
else
cout<<"NU"<<endl;
}
}
return 0;
}