# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866692 | vjudge1 | 콤보 (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.
string guess_sequence(int n){
vector<char>buttons = {'A','B','X','Y'};
char starting_char = '0';
if(press("AB")){
if(press("A"))
starting_char = 'A';
else
starting_char = 'B';
}
else{
if(press("X"))
starting_char = 'X';
else
starting_char = 'Y';
}
string ans{starting_char};
buttons.erase(find(buttons.begin(), buttons.end(), starting_char));
// s + B + s + XY + s + XB + s + XX -> if starting_char == A
for(int i = 1; i < n - 1; ++i){
int current_coins = press(ans + string{buttons[0]} + ans + string{buttons[1],buttons[0]} + ans
+ string{buttons[1], buttons[1]} + ans + string{buttons[1], buttons[2]});
if(current_coins == i)
ans.push_back(buttons[2]);
else if(current_coins == i + 1)
ans.push_back(buttons[0]);
else if(current_coins == i + 2)
ans.push_back(buttons[1]);
}
if(press(ans + string{buttons[0], buttons[1]}) == n){
if(press(ans + string{buttons[0]}) == n)
ans.push_back(buttons[0]);
else
ans.push_back(buttons[1]);
}
else{
ans.push_back(buttons[2]);
}
return ans;
}