Pagini recente » Cod sursa (job #529606) | Cod sursa (job #1419587) | Cod sursa (job #2248758) | Cod sursa (job #832311) | Cod sursa (job #2211116)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int MAX = 100001;
int tata[MAX], n, m;
int findtata(int x)
{
if(tata[x] == x)
return x;
int ans = findtata(tata[x]);
tata[x] = ans;
return ans;
}
int main()
{
in>>n>>m;
for(int i=1; i<=n; i++)
tata[i] = i;
for(int i=1; i<=m; i++)
{
int cod, x, y, tx, ty;
in>>cod>>x>>y;
tx = findtata(x);
ty = findtata(y);
if(cod == 1)
tata[tx] = ty;
else if(tx == ty)
out<<"DA"<<'\n';
else out<<"NU"<<'\n';
}
return 0;
}