Pagini recente » Cod sursa (job #1253866) | Cod sursa (job #2135224) | Cod sursa (job #1059282) | Cod sursa (job #1014392) | Cod sursa (job #2278967)
#include <fstream>
using namespace std;
ifstream f ("disjoint.in");
ofstream g ("disjoint.out");
int t [1 + int(1e5)];
int M (int a){
if (t [a] == a)
return a;
t [a] = M (t [a]);
return t [a];
}
int main()
{
int n , m;
f >> n >> m;
for(int i = 1 ; i <= n ; ++ i)
t [i] = i;
for(int i = 1 ; i <= m ; ++ i){
int a , b , c;
f >> a >> b >> c;
if (a == 1)
t [M (b)] = M (c);
else{
if (M (b) == M (c))
g << "DA\n";
else
g << "NU\n";
}
}
return 0;
}