Pagini recente » Cod sursa (job #1056166) | Rating Kadar Barna (barna) | Concursuri | Cod sursa (job #3280848) | Cod sursa (job #3285312)
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
vector<int>tata(100005),height(100005);
int parinte(int nod,vector<int>&tata){
int cp_node=nod;
while(nod!=tata[nod])
nod=tata[nod];
while(cp_node != nod){
int tx=tata[cp_node];
tata[cp_node]=nod;
cp_node=tx;
}
return nod;
}
int main()
{
int n,op;
f>>n>>op;
for(int i=1; i<=n; ++i){
tata[i]=i;
height[i]=1;
}
for(int i=1; i<=op; ++i){
int t,x,y;
f>>t>>x>>y;
int px=parinte(x,tata);
int py=parinte(y,tata);
if(t==1){
if(height[px]<height[py])
tata[px]=py;
else if(height[px]>height[py]) tata[py]=px;
else{ tata[py]=px;
height[px]+=1;
}
}
else if(px==py)
g<<"DA\n";
else g<<"NU\n";
}
return 0;
}