# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
911365 | Turcavid | Combo (IOI18_combo) | C++14 | 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;
namespace {
constexpr int MAX_N = 2000;
constexpr int MAX_NUM_MOVES = 8000;
int N;
std::string S;
int num_moves;
void wrong_answer(const char *MSG) {
printf("Wrong Answer: %s\n", MSG);
exit(0);
}
} // namespace
int press(std::string p) {
if (++num_moves > MAX_NUM_MOVES) {
wrong_answer("too many moves");
}
int len = p.length();
if (len > 4 * N) {
wrong_answer("invalid press");
}
for (int i = 0; i < len; ++i) {
if (p[i] != 'A' && p[i] != 'B' && p[i] != 'X' && p[i] != 'Y') {
wrong_answer("invalid press");
}
}
int coins = 0;
for (int i = 0, j = 0; i < len; ++i) {
if (j < N && S[j] == p[i]) {
++j;
} else if (S[0] == p[i]) {
j = 1;
} else {
j = 0;
}
coins = std::max(coins, j);
}
return coins;
}
string guess_sequence(int N)
{
vector<char> v;
v.push_back('A');
v.push_back('B');
v.push_back('X');
v.push_back('Y');
int del=4;
string sus="";
for(int i=0; i<3; i++)
{
sus.clear();
sus.push_back(v[i]);
if(press(sus) == 1)
del=i;
}
string ans="";
ans+=v[del];
v.erase(v.begin()+del);
for(int i=2; i<=N-1; i++)
{
string qr="";
qr+=(ans+v[1]);
qr+=(ans+v[2]+v[0]);
qr+=(ans+v[2]+v[1]);
qr+=(ans+v[2]+v[2]);
cout<<qr<<'\n';
int val=press(qr);
if(val == i-1)
ans+=v[0];
if(val == i)
ans+=v[1];
if(val == i+1)
ans+=v[2];
}
for(int i=0; i<3; i++)
{
string qr=ans;
qr+=v[i];
if(press(qr) == N)
return qr;
}
return "amongus";
}