Pagini recente » Cod sursa (job #3233767) | Cod sursa (job #3131986) | Cod sursa (job #2924273) | Cod sursa (job #3183865) | Cod sursa (job #1350423)
#include <fstream>
#define NMax 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int N,M,TT[NMax],RG[NMax];
void Unite(int x, int y)
{
if(RG[x]<RG[y])
TT[x] = y;
if(RG[x]>RG[y])
TT[y] = x;
if(RG[x]==RG[y])
{
TT[y] = x;
RG[x]++;
}
}
int Father(int x)
{
while(TT[x]!=x)
x=TT[x];
return x;
}
int main()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
TT[i] = i;
while(M--)
{
int cod,x,y;
fin>>cod>>x>>y;
if(cod==1)
Unite(Father(x),Father(y));
if(cod==2)
if(Father(x)==Father(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
return 0;
}