結果

問題 No.2826 Earthwork
ユーザー noshi91noshi91
提出日時 2024-07-26 23:01:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,084 ms / 5,000 ms
コード長 6,376 bytes
コンパイル時間 2,870 ms
コンパイル使用メモリ 229,176 KB
実行使用メモリ 183,212 KB
最終ジャッジ日時 2024-07-26 23:01:57
合計ジャッジ時間 25,484 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 15 ms
6,940 KB
testcase_02 AC 952 ms
182,204 KB
testcase_03 AC 85 ms
20,096 KB
testcase_04 AC 724 ms
154,432 KB
testcase_05 AC 129 ms
41,108 KB
testcase_06 AC 478 ms
98,628 KB
testcase_07 AC 593 ms
124,268 KB
testcase_08 AC 960 ms
182,244 KB
testcase_09 AC 1,033 ms
183,052 KB
testcase_10 AC 944 ms
182,256 KB
testcase_11 AC 599 ms
181,360 KB
testcase_12 AC 17 ms
6,944 KB
testcase_13 AC 269 ms
59,520 KB
testcase_14 AC 1,084 ms
183,156 KB
testcase_15 AC 235 ms
48,208 KB
testcase_16 AC 372 ms
99,108 KB
testcase_17 AC 126 ms
29,636 KB
testcase_18 AC 323 ms
95,656 KB
testcase_19 AC 134 ms
41,252 KB
testcase_20 AC 751 ms
149,892 KB
testcase_21 AC 13 ms
7,040 KB
testcase_22 AC 630 ms
120,408 KB
testcase_23 AC 543 ms
118,504 KB
testcase_24 AC 1,002 ms
182,248 KB
testcase_25 AC 269 ms
123,732 KB
testcase_26 AC 616 ms
121,204 KB
testcase_27 AC 8 ms
6,940 KB
testcase_28 AC 1,044 ms
183,212 KB
testcase_29 AC 51 ms
17,664 KB
testcase_30 AC 29 ms
9,344 KB
testcase_31 AC 55 ms
15,744 KB
testcase_32 AC 13 ms
6,940 KB
testcase_33 AC 564 ms
100,500 KB
testcase_34 AC 940 ms
182,100 KB
testcase_35 AC 189 ms
45,704 KB
testcase_36 AC 1,053 ms
183,100 KB
testcase_37 AC 1,012 ms
182,876 KB
testcase_38 AC 473 ms
92,644 KB
testcase_39 AC 28 ms
10,752 KB
testcase_40 AC 23 ms
8,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define NDEBUG
#pragma warning(disable : 4146)

#include <bits/stdc++.h>

namespace n91 {

  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;
  using f64 = double;

#ifdef _MSC_VER
  using i128 = i64;
  using u128 = u64;
#else
  using i128 = __int128_t;
  using u128 = __uint128_t;
#endif

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';

  i64 floor_div(const i64 n, const i64 d) {
    assert(d != 0);
    return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0);
  }

  i64 ceil_div(const i64 n, const i64 d) {
    assert(d != 0);
    return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0);
  }

#ifdef N91_LOCAL
#define OJ_LOCAL(a, b) b
#else
#define OJ_LOCAL(a, b) a
#endif

} // namespace n91

#include <atcoder/modint>
using mint = atcoder::modint998244353;

namespace n91 {

  void main_() {
    const usize n = scan<usize>();
    auto h = md_vec(n, n, i32());
    for (auto& r : h) {
      for (auto& e : r) {
        std::cin >> e;
      }
    }
    auto x = md_vec(n, n, char());
    for (auto& r : x) {
      for (auto& e : r) {
        std::cin >> e;
      }
    }
    auto a = md_vec(n - 1, n, i32());
    for (auto& r : a) {
      for (auto& e : r) {
        std::cin >> e;
      }
    }
    auto b = md_vec(n, n - 1, i32());
    for (auto& r : b) {
      for (auto& e : r) {
        std::cin >> e;
      }
    }

    for (const usize i : rep(0, n)) {
      for (const usize j : rep(0, n)) {
        if ((i ^ j) & 1) {
          h[i][j] *= -1;
          if (x[i][j] == '+' || x[i][j] == '-') {
            x[i][j] ^= '+' ^ '-';
          }
        }
      }
    }

    std::vector<std::vector<std::pair<u32, i64>>> g(n * n + 1);
    for (auto& e : g)
      e.reserve(5);
    for (const usize i : rep(0, n - 1)) {
      for (const usize j : rep(0, n)) {
        const i64 cost = difference<i64>(h[i][j], h[i + 1][j]) * a[i][j];
        const i64 pot = h[i][j] - h[i + 1][j];
        g[i * n + j].emplace_back((i + 1) * n + j, cost + pot);
        g[(i + 1) * n + j].emplace_back(i * n + j, cost - pot);
      }
    }
    for (const usize i : rep(0, n)) {
      for (const usize j : rep(0, n - 1)) {
        const i64 cost = difference<i64>(h[i][j], h[i][j + 1]) * b[i][j];
        const i64 pot = h[i][j] - h[i][j + 1];
        g[i * n + j].emplace_back(i * n + (j + 1), cost + pot);
        g[i * n + (j + 1)].emplace_back(i * n + j, cost - pot);
      }
    }
    for (const usize i : rep(0, n)) {
      for (const usize j : rep(0, n)) {
        if (x[i][j] == '+' || x[i][j] == '=') {
          g[i * n + j].emplace_back(n * n, 0);
        }
        if (x[i][j] == '-' || x[i][j] == '=') {
          g[n * n].emplace_back(i * n + j, 0);
        }
      }
    }

    const i128 inf = OJ_LOCAL(1e35, 1e18);

    const auto dijk = [&](const auto& g) -> std::vector<i128> {
      std::vector<i128> dist(n * n + 1, inf);
      struct node {
        i32 v;
        i128 c;
        bool operator<(const node& r) const { return c > r.c; }
      };
      std::priority_queue<node> pq;
      const auto push = [&](const i32 v, const i128 d) {
        if (dist[v] > d) {
          dist[v] = d;
          pq.push({ v, d });
        }
      };
      push(n * n, 0);
      while (!pq.empty()) {
        const auto [v, d] = pq.top();
        pq.pop();
        if (dist[v] < d)
          continue;
        for (const auto& [u, c] : g[v])
          push(u, d + c);
      }
      return dist;
    };

    const auto upper = dijk(g);
    const auto lower = [&] {
      decltype(g) rg(n * n + 1);
      for (auto& e : rg)
        e.reserve(5);
      for (const usize i : rep(0, n* n + 1)) {
        for (const auto& [j, c] : g[i]) {
          rg[j].emplace_back(i, c);
        }
      }
      return dijk(rg);
    }();

    const usize q = scan<usize>();
    for (const usize i : rep(0, q)) {
      const usize r = scan<usize>() - 1;
      const usize c = scan<usize>() - 1;
      const i64 e = scan<i64>();
      bool ans;
      if ((r ^ c) & 1) {
        ans = (-h[r][c] + lower[r * n + c]) >= e;
      }
      else {
        ans = (h[r][c] + upper[r * n + c]) >= e;
      }
      std::cout << (ans ? "Yes" : "No") << eoln;
    }
  }

} // namespace n91

int main() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  std::cout << std::fixed << std::setprecision(20);
  n91::main_();
  return 0;
}
0