This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* author: tourist
* created:
**/
#include "combo.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
vector<string> alphabet = {"A", "B", "X", "Y"};
string guess_sequence(int n) {
string firs = "?", ans;
for (int i = 0; i < 3; i++) {
if (press(alphabet[i]) == 1) {
firs = alphabet[i];
break;
}
}
if (firs == "?") {
firs = alphabet[3];
}
ans += firs;
vector<int> possible;
for (int i = 0; i < 4; i++) {
if (alphabet[i] != firs) {
possible.push_back(i);
}
}
for (int i = 1; i < n - 1; i++) {
int x = press(ans + alphabet[possible[0]] + ans + alphabet[possible[1]] + alphabet[possible[0]] + ans + alphabet[possible[1]] + alphabet[possible[1]] + ans + alphabet[possible[1]] + alphabet[possible[2]]);
if (x == i) {
ans += alphabet[possible[2]];
} else if (x == i + 1) {
ans += alphabet[possible[0]];
} else {
ans += alphabet[possible[1]];
}
}
if (press(ans + alphabet[possible[0]]) == n) {
ans += alphabet[possible[0]];
return ans;
}
if (press(ans + alphabet[possible[1]]) == n) {
ans += alphabet[possible[1]];
return ans;
}
ans += alphabet[possible[2]];
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |