# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
139583 | Bazarkuly2003 | 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>
//#include<string>
//#include<cmath>
//#include<conio.h>
#define ll long long
#define N 1000001
using namespace std;
ll n,m;
string s,q,t;
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;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
if(press("A")==1){s="A";q="BXY";}else
if(press("B")==1){s="B";q="AXY";}else
if(press("X")==1){s="X";q="ABY";}else{s="Y";q="ABX";}
t=s+q[0]+q[0]+s+q[0]+q[1]+s+q[0]+q[2]+s+q[1];
while(s.size()<n){
m=press(t);
if(m==s.size()+0)s+=q[2];else
if(m==s.size()+1)s+=q[1];else s+=q[0];}
cout<<s;
}