Submission #1205129

#TimeUsernameProblemLanguageResultExecution timeMemory
1205129trimkusCombo (IOI18_combo)C++20
5 / 100
0 ms408 KiB
#include <bits/stdc++.h>
#include "combo.h"
using namespace std;

//int press(std::string p);

std::string guess_sequence(int N) {
  string p = "";
  vector<string> a;
  string forb = "";
  for (string c : {"A", "B", "X", "Y"}) {
    if (press(c) == 1) {
        forb = c;
        p += c;
        break;
    }
  }
  for (string c : {"A", "B", "X", "Y"}) {
        if (forb != c) {
            a.push_back(c);
        }
  }
  for (int i = 1; i < N - 1; ++i) {
    string np = p + a[0] + a[0];
    np += p + a[0] + a[1];
    np += p + a[0] + a[2];
    np += p + a[1];
    int now = press(np) - (int)p.size();
    if (now == 0) p += a[2];
    else if (now == 1) p += a[1];
    else p += a[0];
  }
  if (press(p + a[0]) == N) p += a[0];
  else if (press(p + a[1]) == N) p += a[1];
  else p += a[2];
  return p;
}

//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;
//}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...