# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085385 | mingga | Combo (IOI18_combo) | 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"
#include "combo.h"
using namespace std;
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define out(file) freopen(file, "w", stdout)
#define in(file) freopen(file, "r", stdin)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
// #define int long long
int MOD = 1e9 + 7;
char d[4] = {'A', 'B', 'X', 'Y'};
string guess_sequence(int n) {
string ans = "";
if(press("AB") > 0) {
if(press("A") == 1) ans = "A";
else ans = "B";
} else {
if(press("X")) ans = "X";
else ans = "Y";
}
char fir = ans[0];
vector<char> vec;
for(int i = 0; i < 4; i++) {
if(d[i] == fir) continue;
vec.pb(d[i]);
}
int st = 1;
if((n-1) % 2) {
st = 2;
string tmp = ans + vec[0];
if(pres(tmp) == 2) ans += vec[0];
else {
tmp = ans + vec[1];
if(press(tmp) == 2) ans += vec[1];
else ans += vec[2];
}
}
for(int i = 2; i < n; i+=2) {
string tmp = ans + vec[0] + vec[1] + ans + vec[1] + vec[0] + ans + vec[1] + vec[1] + ans + vec[2] + vec[2];
// cout << tmp << ln;
int cur = press(tmp);
if(cur == sz(ans)) {
tmp = ans + vec[2] + vec[0];
if(press(tmp) == sz(ans) + 2) ans += vec[2] + vec[0];
else ans += vec[2] + vec[1];
} else {
string tmp = ans + vec[1] + vec[1];
int sus = press(tmp);
if(sus == sz(ans)) {
tmp = ans + vec[0] + vec[1];
if(press(tmp) == sz(ans) + 2) ans += vec[0] + vec[1];
else ans += vec[0] + vec[0];
}
else if(sus == sz(ans) + 1) {
ans += vec[1] + vec[0];
} else {
ans += vec[1] + vec[1];
}
}
}
return ans;
}