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>
#define endl '\n'
#define int long long
using namespace std;
int N, Q;
map<int, int> charges;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> N >> Q;
for (int i = 0; i < Q; i++){
string T = "";
int A = 0;
int B = 0;
cin >> T >> A >> B;
if (T == "A"){
if (charges[A] == 0 && charges[B] == 0){
charges[A] = 1;
charges[B] = -1;
}
else if (charges[A] == 1){
charges[B] = -1;
}
else if (charges[A] == -1){
charges[B] = 1;
}
else if (charges[B] == -1){
charges[A] = 1;
}
else if (charges[B] == 1){
charges[A] = -1;
}
}
else if (T == "R"){
if (charges[A] == 0 && charges[B] == 0){
charges[A] = 1;
charges[B] = 1;
}
else if (charges[A] == 1){
charges[B] = 1;
}
else if (charges[A] == -1){
charges[B] = -1;
}
else if (charges[B] == -1){
charges[A] = -1;
}
else if (charges[B] == 1){
charges[A] = 1;
}
}
else if (T == "Q"){
if (charges[A] == 0 || charges[B] == 0){
cout << "?" << endl;
}
else if (charges[A] == charges[B]){
cout << "R" << endl;
}
else{
cout << "A" << endl;
}
}
}
}
# | 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... |