Pagini recente » Cod sursa (job #1342387) | Cod sursa (job #1260959) | Cod sursa (job #616195) | Cod sursa (job #2203559) | Cod sursa (job #2423449)
#include <iostream>
#include <fstream>
using namespace std;
int tata[100005];
int inaltime[100005];
int find_father(int x)
{
if(x==tata[x])
return x;
int nod=find_father(tata[x]);
tata[x]=nod;
return nod;
}
void unite(int x, int y)
{
if(inaltime[x]>inaltime[y])
{
tata[y]=x;
}
else
{
tata[x]=y;
}
if(inaltime[x]==inaltime[y])
inaltime[y]++;
}
int main()
{
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,N,M,x,y,cod;
f>>N>>M;
for(i=1;i<=N;i++)
{
tata[i]=i;
inaltime[i]=1;
}
for(i=1;i<=M;i++)
{
f>>cod>>x>>y;
switch(cod)
{
case 1:
{
unite(find_father(x),find_father(y));
}
break;
case 2:
{
if(find_father(x)==find_father(y))
g<<"DA"<<endl;
else
g<<"NU"<<endl;
}
break;
}
}
return 0;
}