Pagini recente » Cod sursa (job #1829949) | Cod sursa (job #1989087) | Cod sursa (job #985146) | Cod sursa (job #3224211) | Cod sursa (job #2058455)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100002];
int c,x,y;
int cauta(int x)
{
while(t[x]>0)
{
x=t[x];
}
return x;
}
void uneste(int x,int y)
{
int rady=cauta(y);
int radx=cauta(x);
if(t[rady]<t[radx])
{
t[rady]+=t[radx];
t[radx]=y;
}
else
{
t[radx]+=t[rady];
t[rady]=x;
}
}
int main()
{
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
t[i]=-1;
}
for(int i=1;i<=m;i++)
{
fin>>c>>x>>y;
if(c==2)
{
if(cauta(x)==cauta(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
else
{
uneste(x,y);
}
}
return 0;
}