本文共 448 字，大约阅读时间需要 1 分钟。

#include

const int N = 100010; int p[N];

int find(int x) { if (x != p[x]) { p[x] = find(p[x]); } return p[x]; }

int main() { cin >> n >> m; for (int i = 1; i <= n; ++i) { p[i] = i; } while (m--) { char op[2]; cin >> op; if (op[0] == 'Q') { cin >> a >> b; if (find(a) == find(b)) { cout << "Yes" << endl; } else { cout << "no" << endl; } } else { cin >> a >> b; p[find(a)] = find(b); } } return 0; }