#973861 (C++23) No.2731 Two Colors

• 問題: No.2731 Two Colors
• ユーザー: risujiroh
• 提出日時: 2024-04-19 21:39:22
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,326 bytes
• コンパイル時間: 4,156 ms
• コンパイル使用メモリ: 294,080 KB
• 実行使用メモリ: 11,704 KB
• 最終ジャッジ日時: 2024-04-19 21:39:48
• 合計ジャッジ時間: 8,376 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	3 ms; 5,376 KB
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB
testcase_35	AC	2 ms; 5,376 KB

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  int h, w;
  scan(h, w);
  std::vector a(h, std::vector<int>(w));
  scan(a);

  std::vector color(h, std::vector<int>(w, -1));

  std::array<std::priority_queue<std::tuple<int, int, int>>, 2> q;

  const auto push = [&](int t, int i, int j) { q[t].emplace(-a[i][j], i, j); };

  push(1, 0, 0);
  push(0, h - 1, w - 1);

  int ans = 0;

  for (int t : std::views::iota(1)) {
    t %= 2;
    const auto [_, i, j] = q[t].top();
    q[t].pop();

    if (color[i][j] == -1) {
      color[i][j] = t;
      for (auto [ni, nj] : {std::pair{1, 0}, {0, 1}, {-1, 0}, {0, -1}}) {
        ni += i;
        nj += j;
        if (0 <= ni && ni < h && 0 <= nj && nj < w) {
          if (color[ni][nj] == (t ^ 1)) {
            print(ans - 1);
            return;
          }
        }
      }
    } else {
      continue;
    }

    ++ans;

    for (auto [ni, nj] : {std::pair{1, 0}, {0, 1}, {-1, 0}, {0, -1}}) {
      ni += i;
      nj += j;
      if (0 <= ni && ni < h && 0 <= nj && nj < w) {
        push(t, ni, nj);
      }
    }
  }
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(DBL_DECIMAL_DIG);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, Tuple auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, Tuple auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

using namespace std::literals;

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#endif  // __INCLUDE_LEVEL__