Pagini recente » Cod sursa (job #973653) | Cod sursa (job #2236359) | Profil FIIGGT | Rating Grant Watson (acinstallation169) | Cod sursa (job #2236360)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int MAX = 1e5 + 1;
int n, m, tata[MAX];
int find_tata(int fiu)
{
if(tata[fiu] == fiu)
{
return fiu;
}
int ans = find_tata(tata[fiu]);
tata[fiu] = ans;
return ans;
}
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; ++i)
{
tata[i] = i;
}
for(int i = 1; i <= m; ++i)
{
int cod, x, y;
cin >> cod >> x >> y;
int tx = find_tata(x);
int ty = find_tata(y);
if(cod == 1)
{
tata[tx] = ty;
}
else
{
if(tx == ty)
{
cout << "DA\n";
}
else
{
cout << "NU\n";
}
}
}
return 0;
}