結果

問題 No.2826 Earthwork
ユーザー 👑 AngrySadEightAngrySadEight
提出日時 2024-07-16 14:48:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,597 ms / 5,000 ms
コード長 8,064 bytes
コンパイル時間 5,520 ms
コンパイル使用メモリ 236,328 KB
実行使用メモリ 160,524 KB
最終ジャッジ日時 2024-07-16 14:49:12
合計ジャッジ時間 39,640 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 40 ms
6,400 KB
testcase_02 AC 1,425 ms
159,872 KB
testcase_03 AC 140 ms
18,432 KB
testcase_04 AC 1,199 ms
135,936 KB
testcase_05 AC 249 ms
36,924 KB
testcase_06 AC 734 ms
87,040 KB
testcase_07 AC 934 ms
109,428 KB
testcase_08 AC 1,369 ms
159,996 KB
testcase_09 AC 1,443 ms
160,264 KB
testcase_10 AC 1,444 ms
159,956 KB
testcase_11 AC 1,044 ms
159,720 KB
testcase_12 AC 39 ms
6,528 KB
testcase_13 AC 450 ms
52,992 KB
testcase_14 AC 1,513 ms
160,396 KB
testcase_15 AC 332 ms
42,800 KB
testcase_16 AC 604 ms
87,680 KB
testcase_17 AC 230 ms
26,624 KB
testcase_18 AC 558 ms
84,864 KB
testcase_19 AC 239 ms
36,972 KB
testcase_20 AC 1,160 ms
131,928 KB
testcase_21 AC 41 ms
6,912 KB
testcase_22 AC 957 ms
105,960 KB
testcase_23 AC 901 ms
104,516 KB
testcase_24 AC 1,421 ms
159,992 KB
testcase_25 AC 567 ms
109,184 KB
testcase_26 AC 859 ms
106,752 KB
testcase_27 AC 28 ms
5,376 KB
testcase_28 AC 1,597 ms
160,524 KB
testcase_29 AC 98 ms
16,128 KB
testcase_30 AC 58 ms
8,960 KB
testcase_31 AC 100 ms
14,464 KB
testcase_32 AC 35 ms
5,528 KB
testcase_33 AC 873 ms
88,160 KB
testcase_34 AC 1,424 ms
159,896 KB
testcase_35 AC 305 ms
40,784 KB
testcase_36 AC 1,476 ms
160,212 KB
testcase_37 AC 1,549 ms
160,256 KB
testcase_38 AC 722 ms
81,532 KB
testcase_39 AC 65 ms
10,368 KB
testcase_40 AC 52 ms
8,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

void dijkstra(vvpll &graph, ll v, vl &dist) {
    priority_queue<pll, vpll, greater<pll>> pque;
    pque.push(pll(0, v));
    dist[v] = 0;
    while (pque.size()) {
        pll p = pque.top();
        pque.pop();
        if (dist[p.second] != p.first) {
            continue;
        }
        for (auto x : graph[p.second]) {
            if (dist[x.first] > dist[p.second] + x.second) {
                dist[x.first] = dist[p.second] + x.second;
                pque.push(pll(dist[x.first], x.first));
            }
        }
    }
}

int main() {
    ll N;
    cin >> N;
    vector<vector<ll>> H(N, vector<ll>(N));
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < N; j++) {
            cin >> H[i][j];
        }
    }
    vector<string> S(N);
    for (ll i = 0; i < N; i++) {
        cin >> S[i];
    }
    vector<vector<ll>> A(N - 1, vector<ll>(N));
    for (ll i = 0; i < N - 1; i++) {
        for (ll j = 0; j < N; j++) {
            cin >> A[i][j];
        }
    }
    vector<vector<ll>> B(N, vector<ll>(N - 1));
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < N - 1; j++) {
            cin >> B[i][j];
        }
    }
    ll Q;
    cin >> Q;
    vector<ll> R(Q);
    vector<ll> C(Q);
    vector<ll> E(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> R[i] >> C[i] >> E[i];
        R[i]--;
        C[i]--;
    }
    vector<vector<pll>> graph1(N * N + 1, vector<pll>(0));  // 順辺のグラフ
    vector<vector<pll>> graph2(N * N + 1, vector<pll>(0));  // 逆辺のグラフ
    for (ll i = 0; i < N - 1; i++) {
        for (ll j = 0; j < N; j++) {
            ll s = H[i][j] + H[i + 1][j];
            if ((i + j) % 2 == 1) {
                graph1[i * N + j].push_back(
                    pll((i + 1) * N + j, A[i][j] * abs(s) - s));
                graph2[(i + 1) * N + j].push_back(
                    pll(i * N + j, A[i][j] * abs(s) - s));
                graph1[(i + 1) * N + j].push_back(
                    pll(i * N + j, A[i][j] * abs(s) + s));
                graph2[i * N + j].push_back(
                    pll((i + 1) * N + j, A[i][j] * abs(s) + s));
            } else {
                graph2[i * N + j].push_back(
                    pll((i + 1) * N + j, A[i][j] * abs(s) - s));
                graph1[(i + 1) * N + j].push_back(
                    pll(i * N + j, A[i][j] * abs(s) - s));
                graph2[(i + 1) * N + j].push_back(
                    pll(i * N + j, A[i][j] * abs(s) + s));
                graph1[i * N + j].push_back(
                    pll((i + 1) * N + j, A[i][j] * abs(s) + s));
            }
        }
    }
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < N - 1; j++) {
            ll s = H[i][j] + H[i][j + 1];
            if ((i + j) % 2 == 1) {
                graph1[i * N + j].push_back(
                    pll(i * N + j + 1, B[i][j] * abs(s) - s));
                graph2[i * N + j + 1].push_back(
                    pll(i * N + j, B[i][j] * abs(s) - s));
                graph1[i * N + j + 1].push_back(
                    pll(i * N + j, B[i][j] * abs(s) + s));
                graph2[i * N + j].push_back(
                    pll(i * N + j + 1, B[i][j] * abs(s) + s));
            } else {
                graph2[i * N + j].push_back(
                    pll(i * N + j + 1, B[i][j] * abs(s) - s));
                graph1[i * N + j + 1].push_back(
                    pll(i * N + j, B[i][j] * abs(s) - s));
                graph2[i * N + j + 1].push_back(
                    pll(i * N + j, B[i][j] * abs(s) + s));
                graph1[i * N + j].push_back(
                    pll(i * N + j + 1, B[i][j] * abs(s) + s));
            }
        }
    }
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < N; j++) {
            if (S[i][j] == '-') {
                if ((i + j) % 2 == 0) {
                    graph1[N * N].push_back(pll(i * N + j, 0));
                    graph2[i * N + j].push_back(pll(N * N, 0));
                } else {
                    graph2[N * N].push_back(pll(i * N + j, 0));
                    graph1[i * N + j].push_back(pll(N * N, 0));
                }
            } else if (S[i][j] == '+') {
                if ((i + j) % 2 == 1) {
                    graph1[N * N].push_back(pll(i * N + j, 0));
                    graph2[i * N + j].push_back(pll(N * N, 0));
                } else {
                    graph2[N * N].push_back(pll(i * N + j, 0));
                    graph1[i * N + j].push_back(pll(N * N, 0));
                }
            } else if (S[i][j] == '=') {
                graph1[i * N + j].push_back(pll(N * N, 0));
                graph1[N * N].push_back(pll(i * N + j, 0));
                graph2[i * N + j].push_back(pll(N * N, 0));
                graph2[N * N].push_back(pll(i * N + j, 0));
            }
        }
    }
    ll INF = 4000000000000000002;
    vector<ll> dist1(N * N + 1, INF);
    vector<ll> dist2(N * N + 1, INF);
    dist1[N * N] = 0;
    dist2[N * N] = 0;
    dijkstra(graph1, N * N, dist1);
    dijkstra(graph2, N * N, dist2);

    for (ll i = 0; i < Q; i++) {
        if ((R[i] + C[i]) % 2 == 0) {
            if (H[R[i]][C[i]] + dist1[R[i] * N + C[i]] >= E[i]) {
                cout << "Yes" << endl;
            } else {
                cout << "No" << endl;
            }
        } else {
            if (H[R[i]][C[i]] + dist2[R[i] * N + C[i]] >= E[i]) {
                cout << "Yes" << endl;
            } else {
                cout << "No" << endl;
            }
        }
    }
}
0