Pagini recente » Cod sursa (job #1711184) | Cod sursa (job #1833839) | Cod sursa (job #2849804) | Cod sursa (job #3255489) | Cod sursa (job #2944037)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n, m, colors[100001];
bool check(int nodmare, int nodmic){
if(colors[nodmare] == nodmare){
return (nodmare == nodmic);
}
check(colors[nodmare], nodmic);
colors[nodmare] = colors[colors[nodmare]];
return (colors[nodmare] == nodmic);
}
int main() {
in >> n >> m;
for(int i = 1; i <= n; i++){
colors[i] = i;
}
int nr, a, b;
while(m--){
in >> nr >> a >> b;
if(nr == 1){
colors[max(a,b)] = min(a, b);
}
else
{
out << (check(max(a, b), min(a, b)) ? "DA" : "NU") << '\n';
}
}
return 0;
}