제출 #281643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
281643		MrDomino	콤보 (IOI18_combo)	C++14	30 / 100	39 ms	464 KiB

combo

#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 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() + 2 <= n) {
    shuffle(posi.begin(), posi.end(), rng);
    char a = posi[0];
    char b = posi[1];
    char c = posi[2];
    int ret = press(sol + a + b + sol[0] + sol + b + a);
    if (ret == (int) sol.size()) {
      sol += c;
      continue;
    }
    if (ret == (int) sol.size() + 1) {
      int ret = press(sol + a + c);
      if (ret == (int) sol.size() + 2) {
        sol += a;
        sol += c;
        continue;
      }
      if (ret == (int) sol.size() + 1) {
        sol += a;
        sol += a;
        continue;
      }
      if (ret == (int) sol.size()) {
        if (press(sol + b + b) == (int) sol.size() + 2) {
          sol += b;
          sol += b;
        } else {
          sol += b;
          sol += c;
        }
        continue;
      }
    }
    if (ret == (int) sol.size() + 2) {
      int ret = press(sol + a);
      if (ret == (int) sol.size() + 1) {
        sol += a;
        sol += b;
      } else {
        sol += b;
        sol += a;
      }
      continue;
    }
  }
  if ((int) sol.size() == n - 1) {
    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;
}

• Subtask 1: 5 / 5
• Subtask 2: 25 / 95