Pagini recente » Cod sursa (job #1112822) | Cod sursa (job #1527166) | Cod sursa (job #2888053) | Cod sursa (job #2373592) | Cod sursa (job #2050385)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,q,a,b;
bool ok;
vector<int>c[100005];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;++i)
c[i].push_back(i);
for(int i=1;i<=m;++i)
{
fin>>q>>a>>b;
if(q==1)
{
for(int j=0;j<c[a].size();++j)
c[b].push_back(c[a][j]);
for(int j=0;j<c[b].size();++j)
c[a].push_back(c[b][j]);
}
if(q==2)
{ok=0;
for(int j=0;j<c[a].size();++j)
if(c[a][j]==b)
{ok=1;break;}
if(ok==1)
fout<<"DA"<<"\n";
else
fout<<"NU"<<"\n";
}
}
return 0;
}