Pagini recente » Cod sursa (job #2534111) | Cod sursa (job #2121296) | Cod sursa (job #69121) | Cod sursa (job #2591896) | Cod sursa (job #1906530)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin ("disjoint.in" );
ofstream cout("disjoint.out");
vector <vector <int> > a;
int main()
{
int n, m, x, y, z;
cin >> n >> m;
a.resize(n + 1);
for (int i = 0; i < a.size(); i++)
a[i].push_back(i);
for (int i = 0; i < m; i++)
{
cin >> z >> x >> y;
if (z == 1)
{//unirea
copy(a[y].begin(), a[y].end(), a[x].begin());
a[y] = a[x];
}
else
{//afisarea
if (count(a[x].begin(), a[x].end(), y)) cout << "DA\n";
else cout << "NU\n";
}
}
return 0;
}