結果

問題 No.1149 色塗りゲーム
ユーザー keijakkeijak
提出日時 2021-04-30 06:24:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 4,726 bytes
コンパイル時間 3,107 ms
コンパイル使用メモリ 225,836 KB
実行使用メモリ 25,812 KB
平均クエリ数 13.08
最終ジャッジ日時 2024-07-17 11:20:06
合計ジャッジ時間 15,363 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
24,836 KB
testcase_01 AC 52 ms
24,964 KB
testcase_02 AC 53 ms
25,220 KB
testcase_03 RE -
testcase_04 AC 52 ms
24,836 KB
testcase_05 RE -
testcase_06 AC 53 ms
24,836 KB
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
  for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;
using u64 = unsigned long long;

template <typename T, typename U>
inline bool chmax(T &a, U b) {
  return a < b and ((a = std::move(b)), true);
}
template <typename T, typename U>
inline bool chmin(T &a, U b) {
  return a > b and ((a = std::move(b)), true);
}
template <typename T>
inline int ssize(const T &a) {
  return (int)std::size(a);
}

template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (auto &x : a) is >> x;
  return is;
}
template <typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
                        std::string_view ends = "\n",
                        std::ostream &os = std::cout) {
  auto b = std::begin(a), e = std::end(a);
  for (auto it = std::begin(a); it != e; ++it) {
    if (it != b) os << sep;
    os << *it;
  }
  return os << ends;
}
template <typename T, typename = void>
struct is_iterable : std::false_type {};
template <typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
                                  decltype(std::end(std::declval<T>()))>>
    : std::true_type {};

template <typename T, typename = std::enable_if_t<
                          is_iterable<T>::value &&
                          !std::is_same<T, std::string_view>::value &&
                          !std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
  return print_seq(a, ", ", "", (os << "{")) << "}";
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
  return os << "(" << a.first << ", " << a.second << ")";
}

#ifdef ENABLE_DEBUG
template <typename T>
void pdebug(const T &value) {
  std::cerr << value;
}
template <typename T, typename... Ts>
void pdebug(const T &value, const Ts &...args) {
  pdebug(value);
  std::cerr << ", ";
  pdebug(args...);
}
#define DEBUG(...)                                   \
  do {                                               \
    std::cerr << " \033[33m (L" << __LINE__ << ") "; \
    std::cerr << #__VA_ARGS__ << ":\033[0m ";        \
    pdebug(__VA_ARGS__);                             \
    std::cerr << std::endl;                          \
  } while (0)
#else
#define pdebug(...)
#define DEBUG(...)
#endif

using namespace std;

int main() {
  int n;
  cin >> n;
  vector<bool> board(n, false);

  auto scan = [&]() -> vector<int> {
    vector<int> stones;
    int cur = 0;
    REP(i, n) {
      if (board[i]) {
        if (cur > 0) {
          stones.push_back(cur);
          cur = 0;
        }
      } else {
        cur++;
      }
    }
    if (cur > 0) stones.push_back(cur);
    sort(ALL(stones));
    return stones;
  };

  map<vector<int>, int> memo;

  auto nimber = [&](auto &rec, vector<int> stones) -> int {
    if (stones.empty()) return 0;
    if (ssize(stones) > 1) {
      int res = 0;
      for (auto x : stones) {
        assert(x > 0);
        res ^= rec(rec, vector<int>(1, x));
      }
      return res;
    }
    const int x = stones[0];
    if (x == 1) return 1;
    if (x == 2) return 2;

    auto it = memo.find(stones);
    if (it != memo.end()) return it->second;
    set<int> s;
    s.insert(rec(rec, vector<int>(1, x - 1)));
    s.insert(rec(rec, vector<int>(1, x - 2)));
    vector<int> v = {x - 3, 1};
    while (v[0] > 0 and v[0] >= v[1]) {
      s.insert(rec(rec, v));
      v[0]--, v[1]++;
    }
    // Return the MEX.
    for (int i = 0;; ++i) {
      if (not s.count(i)) {
        memo[stones] = i;
        return i;
      }
    }
    assert(false);
  };

  auto next_move = [&]() -> pair<int, int> {
    // Take one.
    REP(i, n) {
      if (board[i]) continue;
      board[i] = true;
      int val = nimber(nimber, scan());
      if (val == 0) {
        return {1, i + 1};
      }
      board[i] = false;
    }

    // Take two.
    REP(i, n - 1) {
      if (board[i] or board[i + 1]) continue;
      board[i] = board[i + 1] = true;
      int val = nimber(nimber, scan());
      if (val == 0) {
        return {2, i + 1};
      }
      board[i] = board[i + 1] = false;
    }

    assert(false);
  };

  auto query = [&]() -> void {
    int k, x;
    tie(k, x) = next_move();
    cout << k << ' ' << x << endl;
    int t;
    cin >> t;
    if (t == 0 or t == 1) {
      exit(0);
    }
    assert(t == 3);
    cin >> k >> x;
    REP(i, k) {
      int p = x - 1 + i;
      assert(not board[p]);
      board[p] = true;
    }
  };

  while (true) {
    query();
  }
}
0