結果
問題 | No.1149 色塗りゲーム |
ユーザー | KoD |
提出日時 | 2020-08-07 22:11:30 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 113 ms / 2,000 ms |
コード長 | 4,568 bytes |
コンパイル時間 | 1,097 ms |
コンパイル使用メモリ | 91,348 KB |
実行使用メモリ | 24,384 KB |
平均クエリ数 | 19.06 |
最終ジャッジ日時 | 2023-09-24 04:32:05 |
合計ジャッジ時間 | 6,959 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
24,372 KB |
testcase_01 | AC | 42 ms
23,964 KB |
testcase_02 | AC | 42 ms
23,832 KB |
testcase_03 | AC | 42 ms
24,336 KB |
testcase_04 | AC | 42 ms
24,036 KB |
testcase_05 | AC | 41 ms
24,048 KB |
testcase_06 | AC | 42 ms
24,264 KB |
testcase_07 | AC | 42 ms
23,628 KB |
testcase_08 | AC | 42 ms
24,048 KB |
testcase_09 | AC | 42 ms
23,988 KB |
testcase_10 | AC | 44 ms
24,336 KB |
testcase_11 | AC | 45 ms
24,336 KB |
testcase_12 | AC | 43 ms
24,000 KB |
testcase_13 | AC | 43 ms
24,120 KB |
testcase_14 | AC | 46 ms
24,036 KB |
testcase_15 | AC | 45 ms
24,000 KB |
testcase_16 | AC | 44 ms
23,652 KB |
testcase_17 | AC | 46 ms
23,472 KB |
testcase_18 | AC | 46 ms
23,604 KB |
testcase_19 | AC | 45 ms
24,360 KB |
testcase_20 | AC | 46 ms
23,436 KB |
testcase_21 | AC | 45 ms
23,424 KB |
testcase_22 | AC | 46 ms
23,376 KB |
testcase_23 | AC | 46 ms
23,436 KB |
testcase_24 | AC | 46 ms
23,640 KB |
testcase_25 | AC | 46 ms
23,736 KB |
testcase_26 | AC | 46 ms
23,400 KB |
testcase_27 | AC | 49 ms
23,448 KB |
testcase_28 | AC | 48 ms
23,496 KB |
testcase_29 | AC | 49 ms
23,376 KB |
testcase_30 | AC | 83 ms
24,324 KB |
testcase_31 | AC | 81 ms
23,664 KB |
testcase_32 | AC | 83 ms
23,688 KB |
testcase_33 | AC | 85 ms
24,036 KB |
testcase_34 | AC | 89 ms
24,024 KB |
testcase_35 | AC | 88 ms
23,460 KB |
testcase_36 | AC | 91 ms
24,288 KB |
testcase_37 | AC | 95 ms
24,036 KB |
testcase_38 | AC | 91 ms
24,048 KB |
testcase_39 | AC | 95 ms
23,400 KB |
testcase_40 | AC | 98 ms
23,712 KB |
testcase_41 | AC | 102 ms
23,520 KB |
testcase_42 | AC | 99 ms
23,700 KB |
testcase_43 | AC | 101 ms
24,384 KB |
testcase_44 | AC | 106 ms
24,336 KB |
testcase_45 | AC | 103 ms
24,024 KB |
testcase_46 | AC | 109 ms
23,604 KB |
testcase_47 | AC | 104 ms
23,640 KB |
testcase_48 | AC | 110 ms
23,496 KB |
testcase_49 | AC | 113 ms
23,832 KB |
ソースコード
#line 1 "main.cpp" /** * @title Template */ #include <iostream> #include <algorithm> #include <utility> #include <numeric> #include <vector> #include <array> #include <set> #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 17 "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() { i32 N; std::cin >> N; std::vector<bool> painted(N, false); std::vector<i32> memo(N + 1); memo[0] = 0; for (auto i: range(1, N + 1)) { std::set<i32> remain; for (auto k: range(0, N + 10)) { remain.insert(k); } for (auto j: range(0, i)) { remain.erase(memo[j] ^ memo[i - j - 1]); if (j + 1 < i) { remain.erase(memo[j] ^ memo[i - j - 2]); } } memo[i] = *remain.begin(); } 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; } }; auto grundy = [&] { i32 l = 0, g = 0; while (l < N) { while (l < N && painted[l]) { ++l; } if (l == N) { break; } i32 r = l; while (r < N && !painted[r]) { ++r; } g ^= memo[r - l]; l = r; } return g; }; while (true) { for (auto i: range(0, N)) { if (!painted[i]) { painted[i] = true; if (grundy() == 0) { ans(1, i); break; } if (i + 1 < N && !painted[i + 1]) { painted[i + 1] = true; if (grundy() == 0) { ans(2, i); break; } painted[i + 1] = false; } painted[i] = false; } } get(); } return 0; }