# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677061 | Toxtaq | 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;
//string S = "ABXYYYYYYB";
//int num_moves = 0;
//constexpr int MAX_N = 2000;
//constexpr int MAX_NUM_MOVES = 8000;
//
//void wrong_answer(const char *MSG) {
// printf("Wrong Answer: %s\n", MSG);
// exit(0);
//}
//int N = 9;
//
//
//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);
// }
// num_moves++;
// return coins;
//}
string guess_sequence(int N){
string s;
char fchar;
if(press("A") == 1)fchar = 'A';
else if(press("B") == 1)fchar = 'B';
else if(press("X") == 1)fchar = 'X';
else fchar = 'Y';
s += fchar;
for(int i = 1;i < N;++i){
if(fchar != 'A' && press(s + 'A') == s.length() + 1)s += 'A';
else if(fchar != 'B' && press(s + 'B') == s.length() + 1)s += 'B';
else if(fchar != 'X' && press(s + 'X') == s.length() + 1)s += 'X';
else s += 'Y';
}
return s;
}
//int main()
//{
// cout << guess_sequence(9);
// cout << endl << num_moves;
//}