Pagini recente » Cod sursa (job #1443565) | Cod sursa (job #3155571) | Cod sursa (job #1246466) | Cod sursa (job #1105204) | Cod sursa (job #2050629)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,q,a,b,tata[100005],pl1,pl2,i,j;
bool ok;
int verif(int x)
{
while(tata[x]!=x)
x=tata[x];
return x;
}
vector<int>c[100005];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;++i)
{c[i].push_back(i);tata[i]=i;}
for(int i=1;i<=m;++i)
{
fin>>q>>a>>b;
if(q==1)
{
pl1=tata[a];
pl2=tata[b];
for(j=0;j<c[pl1].size();++j)
tata[c[pl1][j]]=pl2;
}
if(q==2)
{
pl1=verif(a);
pl2=verif(b);
if(pl1==pl2)
fout<<"DA"<<"\n";
else
fout<<"NU"<<"\n";
}
}
return 0;
}