# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657240 | device | 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>
using namespace std;
typedef long long ll;
int press(string p);
string guess_sequence(int n) {
string s = "ABXY", str = s[((press("AB") ? 0 : 2) + (press("AX") ? 0 : 1))];
char c[3];
int ptr = 0;
for (char C:s) {
if (C != str[0]) {
c[ptr] = C, ptr++;
}
}
if (n == 1) return str;
for (int i = 2; i < n; i++) {
string cur = str + c[2] + c[0] + str + c[2] + c[1] + str + c[2] + c[2] + str + c[1];
int val = press(cur);
val -= i - 1;
str += c[val];
}
if (press(str + c[0]) == n) str += c[0];
else if (press(str + c[1]) == n) str += c[1];
else str += c[2];
return str;
}