#525972 (C++17) No.1149 色塗りゲーム

提出ソース

結果

問題	No.1149 色塗りゲーム
ユーザー	KoD
提出日時	2020-08-07 22:00:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	4,903 bytes
コンパイル時間	814 ms
コンパイル使用メモリ	83,916 KB
実行使用メモリ	24,432 KB
平均クエリ数	2.68
最終ジャッジ日時	2023-09-24 04:28:27
合計ジャッジ時間	5,770 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	45 ms 24,252 KB
testcase_01	AC	41 ms 24,000 KB
testcase_02	AC	41 ms 23,676 KB
testcase_03	RE	-
testcase_04	AC	41 ms 23,340 KB
testcase_05	AC	40 ms 23,568 KB
testcase_06	RE	-
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	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 16 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  size_t N;
  std::cin >> N;
  std::vector<bool> painted(N, false);
  auto calc = [&](i32 x) {
    if (x % 3 == 0) return 3;
    return x % 3;
  };
  auto get = [&] {
    i32 t;
    std::cin >> t;
    if (t == 0) {
      std::exit(EXIT_SUCCESS);
    }
    i32 k, x;
    std::cin >> k >> x;
    --x;
    for (auto i: range(0, k)) {
      painted[x + i] = true;
    }
  };
  auto ans = [&](i32 k, i32 x) {
    std::cout << k << ' ' << x + 1 << std::endl;
    for (auto i: range(0, k)) {
      painted[x + i] = true;
    }
  };
  while (true) {
    i32 grundy = 0;
    std::vector<std::pair<i32, i32>> ranges;
    {
      i32 l = 0;
      while (l < N) {
        while (l < N && painted[l]) {
          ++l;
        }
        if (l == N) {
          break;
        }
        i32 r = l;
        while (r < N && !painted[r]) {
          ++r;
        }
        ranges.emplace_back(l, r);
        grundy ^= calc(r - l);
        l = r;
      }
    }
    if (grundy == 1) {
      for (auto [l, r]: ranges) {
        if (calc(r - l) == 1) {
          if (r - l == 1) {
            ans(1, l);
          }
          else {
            ans(1, l + 2);
          }
          break;
        }
        if (calc(r - l) == 3) {
          ans(1, l);
          break;
        }
      }
    }
    else if (grundy == 2) {
      for (auto [l, r]: ranges) {
        if (calc(r - l) == 2) {
          if (r - l == 2) {
            ans(2, l);
          }
          else {
            ans(1, l + 2);
          }
          break;
        }
        if (calc(r - l) == 3) {
          ans(2, l);
          break;
        }
      }
    }
    else if (grundy == 3) {
      for (auto [l, r]: ranges) {
        if (calc(r - l) == 3) {
          ans(1, l + 1);
          break;
        }
        if (calc(r - l) == 2) {
          ans(1, l);
          break;
        }
      }
    }
    else {
      std::exit(EXIT_FAILURE);
    }
    get();
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード