Pagini recente » Diferente pentru autumn-warmup-2007/solutii/runda-2 intre reviziile 40 si 39 | Istoria paginii runda/tot | Profil M@2Te4i | Cod sursa (job #1159931) | Cod sursa (job #1294372)
#include<fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int NMAX = 100000;
int tata[NMAX + 5],rg[NMAX + 5],n,m;
void read_init()
{
in>>n>>m;
for(int i = 1 ; i <= n ; i++)
tata[i] = rg[i] = i;
}
int query(int x)
{
int R,y;
for(R = x ; R != tata[R] ; R = tata[R]);
for( ; tata[x] != x ; ){
y = tata[x];
tata[x] = R;
x = y;
}
return R;
}
void unite(int x,int y)
{
if(rg[x] > rg[y])
tata[y] = tata[x];
else tata[x] = tata[y];
if(rg[x] == rg[y])
rg[y]++;
}
int main()
{
read_init();
int x,y,cod;
for(int i = 1 ; i <= m ; i++){
in>>cod>>x>>y;
if(cod == 1)
unite(query(x),query(y));
else{
if(query(x) == query(y))
out<<"DA\n";
else
out<<"NU\n";
}
}
return 0;
}