Pagini recente » Cod sursa (job #949143) | Cod sursa (job #947329) | Cod sursa (job #947356) | Cod sursa (job #1043602) | Cod sursa (job #1043604)
#include <fstream>
using namespace std;
int tata[100002];
int find(int x) {
if(tata[x] != x)
tata[x] = find(tata[x]);
return tata[x];
}
void uneste(int x,int y) {
x=find(x);
y=find(y);
tata[x]=y;
}
int main() {
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,i,m,tip,x,y;
fin>>n>>m;
for(int i = 1 ; i <= n ; ++ i)
tata[x] = x;
for(i=0; i<m; i++) {
fin>>tip>>x>>y;
if(tip==1)
uneste(x,y);
else {
if(find(x)==find(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
fin.close();
fout.close();
return 0;
}