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 = 500005;
int appear[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
for (int i = 1, cnt = 0; i < n + k; ++i) {
char c;
cin >> c;
if (c == 'S') {
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
//a == 1
assert(a == 1);
cnt++;
if (!appear[b]) appear[b] = cnt;
if (!appear[a]) appear[a] = cnt;
}
else if (c == 'C') {
int a;
cin >> a;
if (!appear[a]) {
cout << 1 << '\n';
} else {
cout << cnt - appear[a] + 2 << '\n';
}
}
else if (c == 'Q') {
int a, b;
cin >> a >> b;
if (!appear[a] || !appear[b]) {
cout << "no\n";
continue;
}
bool ans = (a == 1 || appear[a] >= appear[b]);
cout << (ans ? "yes" : "no") << '\n';
}
}
}
# | 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... |