Pagini recente » Istoria paginii utilizator/k0k0ss135 | Cod sursa (job #804914)
Cod sursa(job #804914)
#include<iostream>
#include<fstream>
using namespace std;
#define NMAX 100001
int p[NMAX];
int multime(int x)
{
int r,y;
r=x;
while(p[r]!=r)
r=p[r];
while(p[x]!=x) {
y=p[x];
p[x]=r;
x=y;
}
return r;
}
void reuneste(int x, int y)
{
if(x>y)
swap(x,y);
p[y]=x;
}
int main ()
{
int n,m,i,x,y,opt;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
for(i=1;i<=n;i++)
p[i]=i;
for(i=1;i<=m;i++) {
f>>opt>>x>>y;
if(opt==1)
reuneste(multime(x),multime(y));
else {
if(multime(x)==multime(y))
g<<"DA";
else g<<"NU";
g<<'\n';
}
}
f.close();
g.close();
return 0;
}