Pagini recente » Cod sursa (job #870928) | Arhiva de probleme | Cod sursa (job #971891) | Cod sursa (job #1818153) | Cod sursa (job #566506)
Cod sursa(job #566506)
#include <fstream.h>
#define NM 100//010
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[NM],i,j,n,m,o,a,b,rang[NM];
int multime(int i)
{
if(i == t[i])
return i;
return multime(t[i]);
}
void reuneste(int a, int b)
{
int i,j;
i=multime(a);
j=multime(b);
if(i==j)
return;
if(rang[i]<rang[j])
t[i]=j;
else
t[j]=i;
if(rang[i]==rang[j])
rang[i]++;
}
int main()
{
in>>n>>m;
for(i=1;i<=n;i++)
t[i] = i;
for(i=1;i<=m;i++)
{
in>>o>>a>>b;
if(o==1)
reuneste(a,b);
else
out<<(multime(a)==multime(b) ? "DA" : "NU")<<'\n';
}
return 0;
}