結果
| 問題 |
No.2826 Earthwork
|
| コンテスト | |
| ユーザー |
 noshi91
|
| 提出日時 | 2024-07-26 23:01:31 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,030 ms / 5,000 ms |
| コード長 | 6,376 bytes |
| コンパイル時間 | 2,541 ms |
| コンパイル使用メモリ | 219,812 KB |
| 最終ジャッジ日時 | 2025-02-23 18:53:21 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 40 |
ソースコード
//#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;
}