Pagini recente » Cod sursa (job #1242829) | Cod sursa (job #2891731) | Monitorul de evaluare | Cod sursa (job #520114) | Cod sursa (job #2275674)
#include <fstream>
#define MAX 100001
using namespace std;
int dad[MAX];
int find_daddy(int x)
{
if(dad[x] == x)
return x;
return dad[x] = find_daddy(dad[x]);
}
inline void join(int x, int y)
{
int rx, ry;
rx = find_daddy(x);
ry = find_daddy(y);
dad[ry] = rx;
}
int main()
{
int n, m, i, cer, a, b;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
fin >> n >> m;
for(i = 1; i <= n; i++)dad[i] = i;
for(i = 1; i <= m; i++)
{
fin >> cer >> a >> b;
if(cer == 1)join(a, b);
else if(find_daddy(a) == find_daddy(b))fout << "DA" << '\n';
else fout << "NU" << '\n';
}
fin.close();
fout.close();
return 0;
}