Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- const int maxn = 105;
- int root[maxn];
- bool find(int A, int B) {
- if(root[A] == root[B]) {
- return true;
- }
- return false;
- }
- void union_two_elements(int A, int B) {
- int tmp = root[A];
- for(int i = 0; i < maxn; i++) {
- if(root[i] == tmp) {
- root[i] = root[B];
- }
- }
- }
- int main() {
- for(int i = 0; i < maxn; i++) {
- root[i] = i;
- }
- while(true) {
- string s;
- cin >> s;
- if(s == "u") {
- int a, b;
- cin >> a >> b;
- union_two_elements(a, b);
- }
- else {
- int a, b;
- cin >> a >> b;
- if(find(a, b)) {
- cout << "YES\n";
- }
- else {
- cout << "NO\n";
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement