이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const int N = 130001;
#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(; q--;){
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(){
cin.tie(0); ios::sync_with_stdio(0);
solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |