Pagini recente » Monitorul de evaluare | Cod sursa (job #358450) | Cod sursa (job #654321) | Monitorul de evaluare | Cod sursa (job #1283645)
#include<fstream>
#define NMax 100005
using namespace std;
ifstream f("disjoint.in");
ofstream g("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[y]<RG[x])
TT[y]=x;
if(RG[x]==RG[y])
{
TT[x]=y;RG[y]++;
}
}
int find(int x)
{
while(x!=TT[x])
x=TT[x];
return x;
}
int main()
{
int op,x,y;
f>>N>>M;
for(int i=1;i<=N;i++)
{
TT[i]=i;
RG[i]=0;
}
while(M--)
{
f>>op>>x>>y;
if (op==1)
unite(find(x),find(y));
if(op==2)
if(find(x)==find(y))
g<<"DA\n";
else
g<<"NU\n";
}
return 0;
}