Pagini recente » Cod sursa (job #232287) | Cod sursa (job #1752740) | Cod sursa (job #2907746) | Cod sursa (job #2088864) | Cod sursa (job #2018707)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,t[100005],op,x,y;
void Unif(int x, int y)
{
t[x]=y;
}
int Cauta(int x)
{
int r,y;
r=x;
while(t[r]!=0)
r=t[r];
/// comprimarea drumului
while(x!=r)
{
y=t[x];
t[x]=r;
x=y;
}
return r;
}
int main()
{
fin>>n>>m;
while(m--)
{
fin>>op>>x>>y;
x=Cauta(x); y=Cauta(y);
if (op==1)
{
if (x!=y) Unif(x,y);
}
else
{
if (x!=y) fout<<"NU\n";
else fout<<"DA\n";
}
}
fin.close();
fout.close();
return 0;
}