Pagini recente » Cod sursa (job #2189180) | Cod sursa (job #460555) | Cod sursa (job #34892) | Cod sursa (job #2460181) | Cod sursa (job #2534191)
#include <fstream>
#define nmax 100004
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int fa[nmax], n, m, cod, x, y;
int getFather(int x) {
if(fa[x]==x)
return x;
return fa[x]=getFather(fa[x]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
fa[i]=i;
for(int i=1;i<=m;i++) {
f>>cod>>x>>y;
if(cod==1)
fa[getFather(x)]=getFather(y);
else {
if(getFather(x)==getFather(y))
g<<"DA\n";
else
g<<"NU\n";
}
}
f.close();
g.close();
return 0;
}