# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1229511 | LaMatematica14 | Inside information (BOI21_servers) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
int N, K; cin >> N >> K;
vector<set<int>> num(N);
for (int i = 0; i < N; i++) num[i].insert(i);
for (int i = 0; i < K+N-1; i++) {
char t; cin >> t;
if (t == 'S') {
int a, b; cin >> a >> b;
if (num[a].size() > num[b].size()) swap(a, b);
for (int x : num[a]) num[b].insert(x);
num[a] = num[b];
}
else if (t == 'Q') {
cin >> a >> d;
cout << (num[a].count(d) ? "yes" : "no") << "\n";
}
else cout << "1\n";
}
}