Pagini recente » Cod sursa (job #2117244) | Cod sursa (job #2445836) | Cod sursa (job #396812) | Cod sursa (job #549746) | Cod sursa (job #1955027)
#include <fstream>
#include<vector>
using namespace std;
vector<int> tata,h;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,t,x,y;
int cauta(int nr)
{
int aux=nr;
while(tata[nr]) nr=tata[nr];
while(aux!=nr) {int aux2=aux;aux=tata[aux];tata[aux2]=nr;}
return nr;
}
void uneste(int a,int b)
{
if(h[a]>h[b]) tata[b]=a;
else {tata[a]=b;if(h[a]==h[b]) h[b]++;}
}
int main()
{
f>>n>>m;
tata.resize(n+1);
h.resize(n+1,1);
for(int i=1; i<=m; i++)
{
f>>t;
f>>x>>y;
if(t==2) if(cauta(x)==cauta(y))g<<"DA"<<'\n';
else g<<"NU"<<'\n';
else
{
int a=cauta(x),b=cauta(y);
if(a!=b) uneste(a,b);
}
}
return 0;
}