Pagini recente » Cod sursa (job #1052804) | Cod sursa (job #1918851) | Cod sursa (job #746607) | Cod sursa (job #1775270) | Cod sursa (job #2134996)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin;
ofstream fout;
vector <int> tatic, r;
int n, m;
void initializare()
{
tatic.push_back(0x3f3f3f3f);
r.push_back(0x3f3f3f3f);
for(int i=1; i<=n; ++i)
tatic.push_back(i), r.push_back(1);
}
int root(int x)
{
int i;
for(i=x; i!=tatic[i]; i=tatic[i]);
while (x!=tatic[x])
{
int temp=tatic[x];
tatic[x]=i;
x=temp;
}
return i;
}
void Union(int x, int y)
{
if (r[x] > r[y])
tatic[y]=x;
else
tatic[x]=y;
if (r[x]==r[y])
++r[y];
}
int main()
{
fin.open("disjoint.in");
fout.open("disjoint.out");
fin >> n >> m;
initializare();
while(m)
{
--m;
int cod;
fin >> cod;
if (cod==1)
{
int x, y;
fin >> x >> y;
Union(root(x), root(y));
}
else
{
int x, y;
fin >> x >> y;
if (root(x)==root(y))
fout << "DA\n";
else
fout << "NU\n";
}
}
return 0;
}