제출 #281664

#제출 시각아이디문제언어결과실행 시간메모리
281664MrDomino콤보 (IOI18_combo)C++14
10 / 100
95 ms452 KiB
#include <bits/stdc++.h>
#include "combo.h"

using namespace std;

string del(string s, char ch) {
  string t;
  for (auto &x : s) {
    if (x != ch) {
      t += x;
    }
  }
  return t;
}

mt19937 rng((long long) (new char));

string mult(char ch, int x) {
  string s;
  for (int i = 1; i <= x; i++) {
    s += ch;
  }
  return s;
}

string guess_sequence(int n) {
  string sol;
  string posi = "ABXY";
  bool found = 0;
  for (int j = 0; j < 3; j++) {
    if (press(sol + posi[j]) == 1) {
      found = 1;
      sol += posi[j];
      break;
    }
  }
  if (found == 0) {
    sol += posi[3];
  }
  posi = del(posi, sol[0]);
  while ((int) sol.size() + 1 <= n) {
    shuffle(posi.begin(), posi.end(), rng);
    char a = posi[0];
    char b = posi[1];
    char c = posi[2];
    int ret = press(sol + mult(a, n - (int) sol.size()) + sol + mult(b, n - (int) sol.size()));
    if (ret == (int) sol.size()) {
      sol += c;
      continue;
    }
    if (ret == n) {
      if (press(sol + mult(a, n - (int) sol.size())) == n) {
        sol += mult(a, n - (int) sol.size());
      } else {
        sol += mult(b, n - (int) sol.size());
      }
      continue;
    }
    bool found = 0;
    for (int j = 0; j < 2; j++) {
      if (press(sol + posi[j]) == (int) sol.size() + 1) {
        found = 1;
        sol += posi[j];
        break;
      }
    }
    if (found == 0) {
      sol += posi[2];
    }
  }
  return sol;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...