# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960981 | aminjon__ | 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;
deque<char> button = {'A' , 'B', 'X' , 'Y'};
// string c;
// int N;
// int G = 0;
// int press(string a){
// G++;
// int rrv = 0;
// for(int i = 0;i < a.size();i++){
// int cnt = 0;
// for(int j = i;j < a.size() && (j-i) < c.size();j++){
// if(a[j] == c[j-i]){
// cnt++;
// rrv=max(rrv , cnt);
// }
// else{
// break;
// }
// }
// }
// return rrv;
// }
string guess_sequence(int N){
string ans;
if(press("AB") > 0){
if(press("A") > 0){
ans = "A";
button.erase(button.begin());
}
else{
ans = "B";
button.erase(button.begin()+1);
}
}
else{
if(press("X") > 0){
ans = "X";
button.erase(button.begin()+2);
}
else{
ans = "Y";
button.erase(button.begin()+3);
}
}
for(int i = 2;i <= N-1;i++){
int r = press(ans+button[1] + ans+button[2]+button[0]+ans+button[2]+button[1]+ans+button[2]+button[2] );
ans += button[r - ans.size()];
}
if(press(ans+button[0]+ans+button[1]) > ans.size()){
if(press(ans+button[0]) > ans.size()){
ans += button[0];
}
else{
ans += button[1];
}
}
else{
ans += button[2];
}
return ans;
}
// int main(){
// cin >> N >> c;
//
// cout<<guess_sequence(N)<<'\n';
// cout<<G;
// return 0;
// }