| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 668413 | mychecksedad | Inside information (BOI21_servers) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
#define pb push_back
int n, q;
bitset<N> b[N];
void solve(){
cin >> n >> q;
q += n - 1;
for(int i = 1; i <= n; ++i) b[i][i] = 1;
for(int i = 0; i < q; ++i){
char s;
cin >> s;
if(s == 'S'){
int u, v; cin >> u >> v;
b[u] = b[u] | b[v];
b[v] = b[u];
}else if(s == 'Q'){
int u, d; cin >> u >> d;
cout << (b[u][d] ? "yes" : "no") << '\n';
}else{
int u; cin >> u;
cout << 0 << '\n';
}
}
}
int main(){
solve();
return 0;
}