結果

問題 No.3207 Digital Font
ユーザー AngrySadEight
提出日時 2025-07-20 02:19:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,137 ms / 3,000 ms
コード長 7,528 bytes
コンパイル時間 4,255 ms
コンパイル使用メモリ 200,772 KB
実行使用メモリ 29,644 KB
最終ジャッジ日時 2025-07-20 02:19:39
合計ジャッジ時間 33,813 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }

ll op(ll a, ll b) { return (a + b) % mod2; }

ll e() { return 0LL; }

int main() {
    ll H, W;
    cin >> H >> W;
    ll N;
    cin >> N;
    vector<ll> x(N);
    vector<ll> y(N);
    vector<ll> w(N);
    for (ll i = 0; i < N; i++) {
        cin >> x[i] >> y[i] >> w[i];
    }
    ll Q;
    cin >> Q;
    vector<ll> l(Q);
    vector<ll> d(Q);
    vector<ll> r(Q);
    vector<ll> u(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> l[i] >> d[i] >> r[i] >> u[i];
    }
    // 正、逆　それぞれに対してハッシュの値を求めたい
    vector for_q(H + 1, vector<ll>(0));
    vector rev_q(H + 1, vector<ll>(0));
    for (ll i = 0; i < N; i++) {
        for_q[x[i]].push_back(i);
        rev_q[H + 1 - x[i]].push_back(i);
    }
    for (ll i = 0; i < Q; i++) {
        for_q[l[i] - 1].push_back(i + N);
        for_q[r[i]].push_back(i + N + Q);
        rev_q[H - r[i]].push_back(i + N);
        rev_q[H - l[i] + 1].push_back(i + N + Q);
    }
    for (ll i = 0; i <= H; i++) {
        sort(all(for_q[i]));
        sort(all(rev_q[i]));
    }

    ll h = 1007;

    vector<ll> for_hval(Q, 0);
    vector<ll> rev_hval(Q, 0);

    // まずは for_hval の計算
    segtree<ll, op, e> seg_for(W + 1);
    for (ll i = 0; i <= H; i++) {
        for (ll j = 0; j < for_q[i].size(); j++) {
            ll idx = for_q[i][j];
            if (idx < N) {
                ll y_val = y[idx];
                ll w_val = w[idx];
                ll times = i * W + (y_val - 1);
                seg_for.set(y_val, (seg_for.get(y_val) +
                                    (w_val * my_pow(h, times, mod2))) %
                                       mod2);
            } else if (idx < N + Q) {
                idx -= N;
                ll d_val = d[idx];
                ll u_val = u[idx];

                for_hval[idx] += seg_for.prod(0, d_val);
                for_hval[idx] -= seg_for.prod(0, u_val + 1);
                for_hval[idx] = (for_hval[idx] + mod2) % mod2;
            } else {
                idx -= (N + Q);
                ll d_val = d[idx];
                ll u_val = u[idx];

                for_hval[idx] -= seg_for.prod(0, d_val);
                for_hval[idx] += seg_for.prod(0, u_val + 1);
                for_hval[idx] = (for_hval[idx] + mod2) % mod2;
            }
        }
    }

    for (ll i = 0; i < Q; i++) {
        ll times = l[i] * W + (d[i] - 1);
        for_hval[i] *= inv(my_pow(h, times, mod2) % mod2, mod2);
        for_hval[i] %= mod2;
    }
    // debug(for_hval);
    // つづいて rev_hval の計算
    segtree<ll, op, e> seg_rev(W + 1);
    for (ll i = 0; i <= H; i++) {
        for (ll j = 0; j < rev_q[i].size(); j++) {
            ll idx = rev_q[i][j];
            if (idx < N) {
                ll y_val = W + 1 - y[idx];
                ll w_val = w[idx];
                if (w_val == 6) {
                    w_val = 9;
                } else if (w_val == 9) {
                    w_val = 6;
                }
                ll times = i * W + (y_val - 1);
                seg_rev.set(y_val, (seg_rev.get(y_val) +
                                    (w_val * my_pow(h, times, mod2))) %
                                       mod2);
            } else if (idx < N + Q) {
                idx -= N;
                ll d_val = W + 1 - d[idx];
                ll u_val = W + 1 - u[idx];

                rev_hval[idx] -= seg_rev.prod(0, d_val + 1);
                rev_hval[idx] += seg_rev.prod(0, u_val);
                rev_hval[idx] = (rev_hval[idx] + mod2) % mod2;
            } else {
                idx -= (N + Q);
                ll d_val = W + 1 - d[idx];
                ll u_val = W + 1 - u[idx];

                rev_hval[idx] += seg_rev.prod(0, d_val + 1);
                rev_hval[idx] -= seg_rev.prod(0, u_val);
                rev_hval[idx] = (rev_hval[idx] + mod2) % mod2;
            }
        }
    }
    for (ll i = 0; i < Q; i++) {
        ll times = (H + 1 - r[i]) * W + (W - u[i]);
        // debug_out(i, times);
        rev_hval[i] *= inv(my_pow(h, times, mod2), mod2);
        rev_hval[i] %= mod2;
    }
    for (ll i = 0; i < Q; i++) {
        if (for_hval[i] == rev_hval[i]) {
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
        }
    }
}
0