Pagini recente » Cod sursa (job #548135) | Cod sursa (job #1829270) | Cod sursa (job #1926696) | Cod sursa (job #2050097) | Cod sursa (job #2942621)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int main()
{
int n,m,a,b,c;
vector<vector<int>> list;
vector<int> tata;
fin>>n>>m;
for(int i=0;i<=n;i++)
{
tata.push_back(i);
list.push_back({});
}
for(int x=1;x<=m;x++)
{
fin>>a>>b>>c;
if(a == 1)
{
tata[c] = tata[b];
list[b].push_back(c);
for(int i:list[c])
{
tata[i] = tata[b];
list[b].push_back(i);
}
list[c].clear();
}
else
{
if(tata[b] == tata[c])
fout<<"DA\n";
else
fout<<"NU\n";
}
}
fin.close();
fout.close();
return 0;
}