# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426133 | hibye1217 | 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.
/// combo.h ///
#include <string>
std::string guess_sequence(int N);
int press(std::string p);
/// grader.cpp ///
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
// #include "combo.h"
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;
}
int main() {
char buffer[MAX_N + 1];
if (scanf("%s", buffer) != 1) {
fprintf(stderr, "Error while reading input\n");
exit(1);
}
S = buffer;
N = S.length();
num_moves = 0;
std::string answer = guess_sequence(N);
if (answer != S) {
wrong_answer("wrong guess");
exit(0);
}
printf("Accepted: %d\n", num_moves);
return 0;
}
#define NOTSUBMIT
#include <bits/stdc++.h>
using namespace std;
/// * combo.h ///
#ifndef NOTSUBMIT
#include "combo.h"
#include <bits/stdc++.h>
using namespace std;
#endif
string guess_sequence(int N) {
string ans = "";
char c1='A', c2='B', c3='X';
if (press("AB") != 0){
if (press("A") != 0){ ans += "A"; c1='Y'; }
else{ ans += "B"; c2='Y'; }
}
else{
if (press("X") != 0){ ans += "X"; c3='Y'; }
else{ ans += "Y"; }
}
if (N == 1){ return ans; }
for (int i = 2; i < N; i++){
int res = press(ans+c1+c1 + ans+c1+c2 + ans+c1+c3 + ans+c2);
if (res >= i+1){ ans += c1; }
else if (res == i){ ans += c2; }
else{ ans += c3; }
}
if (press(ans+c1) == N){ return ans+c1; }
else if (press(ans+c2) == N){ return ans+c2; }
else{ return ans+c3; }
}