#1189079 (C++23) No.3730 Jagged Minesweeper

• 問題: No.3730 Jagged Minesweeper
• ユーザー: risujiroh
• 提出日時: 2026-09-19 16:31:15
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 3,942 bytes
• コンパイル時間: 2,371 ms
• コンパイル使用メモリ: 356,568 KB
• 実行使用メモリ: 791,788 KB
• 最終ジャッジ日時: 2026-09-19 16:31:50
• 合計ジャッジ時間: 32,755 ms
• ジャッジサーバーID （参考情報）: judge4_0 / judge5_0

ファイルパターン	結果
sample	AC * 2
other	AC * 3 WA * 16 TLE * 2 -- * 22

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n;
  IN(n);
  vector<string> s(n);
  IN(s);

  vector<string> ans(n, string(n, '?'));

  auto go = [&](int i, int j) -> pair<int, int> {
    int lo = 0;
    int hi = 0;
    for (int ni : Rep1(max(i - 1, 0), min(i + 1, n - 1)))
      for (int nj : Rep1(max(j - 1, 0), min(j + 1, n - 1))) {
        if (ni == i && nj == j)
          continue;
        lo += ans[ni][nj] == 'o';
        hi += ans[ni][nj] != '.';
      }
    return {lo, hi};
  };

  auto get_val = [&](int i, int j) -> int {
    int a = s[i][j] - '0';
    auto [lo, hi] = go(i, j);
    return -min(a - lo - 1, hi - a);
  };

  priority_queue<tuple<int, int, int>> q;
  for (int i : Rep(0, n))
    for (int j : Rep(0, n))
      q.emplace(get_val(i, j), i, j);

  while (Len(q)) {
    auto [val, i, j] = q.top();
    q.pop();
    if (val != get_val(i, j))
      continue;

    int a = s[i][j] - '0';
    auto [lo, hi] = go(i, j);
    ans[i][j] = "o."[a - lo - 1 < hi - a];

    for (int ni : Rep1(max(i - 1, 0), min(i + 1, n - 1)))
      for (int nj : Rep1(max(j - 1, 0), min(j + 1, n - 1))) {
        if (ni == i && nj == j)
          continue;
        if (ans[ni][nj] == '?')
          q.emplace(get_val(ni, nj), ni, nj);
      }
  }

  ranges::for_each(ans, LIFT(OUT));
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

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

template <class T>
concept MyTuple = std::__is_tuple_like<T>::value && !MyRange<T>;

namespace std {

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

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

ostream& operator<<(ostream& os, MyRange auto&& r) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << forward<decltype(e)>(e);
  }
  return os;
}

ostream& operator<<(ostream& os, MyTuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

template <class T>
class OneBased {
 public:
  explicit OneBased(T&& x) : ref_(std::forward<T>(x)) {}

  template <class... Ts>
  requires(sizeof...(Ts) > 1)
      OneBased(Ts&&... xs) : ref_(std::forward_as_tuple(std::forward<Ts>(xs)...)) {}

  friend std::istream& operator>>(std::istream& is, OneBased x) {
    if constexpr (MyRange<T>) {
      for (auto&& e : x.ref_) {
        is >> ::OneBased(e);
      }
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { (is >> ... >> ::OneBased(xs)); }, x.ref_);
    } else {
      is >> x.ref_;
      --x.ref_;
    }
    return is;
  }

  friend std::ostream& operator<<(std::ostream& os, OneBased x) {
    if constexpr (MyRange<T>) {
      auto f = [](auto&& e) { return ::OneBased(std::forward<decltype(e)>(e)); };
      os << (x.ref_ | std::views::transform(f));
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { os << std::tuple(::OneBased(xs)...); }, x.ref_);
    } else {
      os << ++x.ref_;
      --x.ref_;
    }
    return os;
  }

 private:
  T ref_;
};

template <class T>
OneBased(T&&) -> OneBased<T>;

template <class... Ts>
OneBased(Ts&&...) -> OneBased<std::tuple<Ts...>>;

using namespace std;

#define LIFT(f) ([&](auto&&... xs) -> decltype(auto) { return f(forward<decltype(xs)>(xs)...); })
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Rep1(...) [](int l, int r) { return Rep(l, r + 1); }(__VA_ARGS__)
#define Len(r) int(size(r))
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1