Pagini recente » Cod sursa (job #1726756) | Cod sursa (job #2095887) | Cod sursa (job #2069123) | Cod sursa (job #2443466) | Cod sursa (job #1905876)
#include <iostream>
#include <fstream>
using namespace std;
int m,n,v[100000],x,y,cod;
int main()
{ ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
fin>>n>>m;
for(int i=1;i<=n;i++)
v[i]=i;
for(int i=1;i<=m;i++){
fin>>cod>>x>>y;
if (cod==1){
int o=v[y];
for(int j=1;j<=n;j++)
if (v[j]==o)
v[j]=v[x];
}else{
if(v[x]==v[y]){
fout<<"DA"<<endl;
}else{
fout<<"NU"<<endl;
}}}
return 0;
}