Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- #include <vector>
- using namespace std;
- const int maxn = 1e5 + 10;
- const int INF = 1e9;
- int root[maxn];
- int find_root(int x) {
- while(root[x] != x) {
- root[x] = root[root[x]];
- x = root[x];
- }
- return x;
- }
- bool check(int A, int B) {
- int root_A = find_root(A);
- int root_B = find_root(B);
- return root_A == root_B;
- }
- void unite(int A, int B) {
- int root_A = find_root(A);
- int root_B = find_root(B);
- root[root_A] = root_B;
- }
- int main() {
- for(int i = 0; i < maxn; i++) {
- root[i] = i;
- }
- while(true) {
- string s;
- cin >> s;
- if(s == "union") {
- int a, b;
- cin >> a >> b;
- unite(a, b);
- }
- else {
- int a, b;
- cin >> a >> b;
- if(check(a, b)) {
- cout << "YES" << endl;
- }
- else {
- cout << "NO" << endl;
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement