| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 729802 | 2vas | 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.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
string guess_sequence(int n) {
// get first letter
char first;
char other[3];
if (press("AB")) {
if (press("A")) {
first = 'A';
other[0] = 'B';
other[1] = 'X';
other[2] = 'Y';
} else {
first = 'B';
other[0] = 'A';
other[1] = 'X';
other[2] = 'Y';
}
} else {
if (press("X")) {
first = 'X';
other[0] = 'B';
other[1] = 'A';
other[2] = 'Y';
} else {
first = 'Y';
other[0] = 'A';
other[1] = 'X';
other[2] = 'B';
}
}
string s = "" + first;
while (s.length() < n - 1) {
string p = s + other[0] + other[1];
p += s + other[0] + other[2];
p += s + other[1] + other[2];
int v = press(p);
if (v == 0 + s.length()) {
s += other[2];
continue;
}
if (v == 1 + s.length()) {
p = s + other[1] + other[1];
v = press(p);
if (v == 0 + s.length()) {
s += other[0] + other[0];
} else if (v == 1 + s.length()) {
s += other[1] + other[0];
} else {
assert(v == 2 + s.length());
s += other[1] + other[1];
}
continue;
}
if (v == 2 + s.length()) {
p = s + other[0] + other[1];
v = press(p);
if (v == 0 + s.length()) {
s += other[1] + other[2];
} else if (v == 1 + s.length()) {
s += other[0] + other[2];
} else {
assert(v == 2 + s.length());
s += other[0] + other[1];
}
continue;
}
}
if (s.length() == n) {
return s;
}
if (press(s + other[0] + s + other[1]) == n) {
if (press(s + other[0]) == n) {
s += other[0];
} else {
s += other[1];
}
} else {
s += other[2];
}
return s;
}