結果

問題 No.3207 Digital Font
コンテスト
ユーザー 横山緑
提出日時 2025-07-19 18:27:38
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,339 ms / 3,000 ms
コード長 10,507 bytes
コンパイル時間 5,624 ms
コンパイル使用メモリ 337,248 KB
実行使用メモリ 163,728 KB
最終ジャッジ日時 2025-07-19 18:28:33
合計ジャッジ時間 54,609 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#else
template <class T>
concept Streamable = requires(ostream os, T &x) { os << x; };
template <class mint>
concept is_modint = requires(mint &x) {
    { x.val() } -> std::convertible_to<int>;
};
#define debug(...)
#endif
template <Streamable T> void print_one(const T &value) { cout << value; }
template <is_modint T> void print_one(const T &value) { cout << value.val(); }
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    print_one(a);
    ((cout << ' ', print_one(b)), ...);
    cout << '\n';
}
template <ranges::range Iterable>
    requires(!Streamable<Iterable>)
void print(const Iterable &v) {
    for(auto it = v.begin(); it != v.end(); ++it) {
        if(it != v.begin())
            cout << " ";
        print_one(*it);
    }
    cout << '\n';
}
using vi = vector<int>;
using vii = vector<vector<int>>;
using pii = pair<int, int>;
using ll = long long;
using vl = vector<ll>;
using vll = vector<vl>;
using pll = pair<ll, ll>;
#define all(v) begin(v), end(v)
template <class T> void UNIQUE(T &v) {
    ranges::sort(v);
    v.erase(unique(all(v)), end(v));
}
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1_0(n, c) REP1_1(n, c)
#define REP1_1(n, c)                                                           \
    for(ll REP_COUNTER_##c = 0; REP_COUNTER_##c < (ll)(n); REP_COUNTER_##c++)
#define REP1(n) REP1_0(n, __COUNTER__)
#define REP2(i, a) for(ll i = 0; i < (ll)(a); i++)
#define REP3(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define REP4(i, a, b, c) for(ll i = (ll)(a); i < (ll)(b); i += (ll)(c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)
ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
template <class T> constexpr T floor(T x, T y) noexcept {
    return x / y - ((x ^ y) < 0 and x % y);
}
template <class T> constexpr T ceil(T x, T y) noexcept {
    return x / y + ((x ^ y) >= 0 and x % y);
}
// yの符号に関わらず非負で定義 \bmod:texコマンド
template <class T> constexpr T bmod(T x, T y) noexcept {
    T m = x % y;
    return (m < 0) ? m + (y > 0 ? y : -y) : m;
}
template <std::signed_integral T> constexpr int bit_width(T x) noexcept {
    return std::bit_width((uint64_t)x);
}
template <std::signed_integral T> constexpr int popcount(T x) noexcept {
    return std::popcount((uint64_t)x);
}
constexpr bool kth_bit(auto n, auto k) { return (n >> k) & 1; }
#line 3 "data-structure/persistent-segtree.hpp"
// https://ei1333.github.io/library/structure/segment-tree/persistent-segment-tree.hpp.html
// https://37zigen.com/persistent-segment-tree/
template <class S, auto op, auto e> struct persistent_segtree {
  private:
    int n;
    struct Node {
        S s;
        Node *l, *r;
    };
    vector<unique_ptr<Node>> pool;
    Node *make_node_ptr(Node node) {
        pool.emplace_back(make_unique<Node>(node));
        return pool.back().get();
    }
    // 区間[l,r)がノードに対応する
    // [0,v.size())が根
    Node *build(int l, int r, const vector<S> &v) {
        // debug(l,r,v);
        if(l + 1 == r) {
            return make_node_ptr(Node(v[l]));
        }
        int m = (l + r) >> 1;
        Node *lp = build(l, m, v), *rp = build(m, r, v);
        return make_node_ptr(Node(op(lp->s, rp->s), lp, rp));
    }
    // [a,b) 積を取る区間
    // [l,r) pが対応する区間
    S prod(int a, int b, Node *p, int l, int r) {
        if(r <= a or b <= l)
            return e();
        if(a <= l and r <= b)
            return p->s;
        int m = (l + r) >> 1;
        return op(prod(a, b, p->l, l, m), prod(a, b, p->r, m, r));
    }
    Node *merge(Node *lp, Node *rp) {
        return make_node_ptr(Node(op(lp->s, rp->s), lp, rp));
    }
    Node *set(int k, const S &s, Node *p, int l, int r) {
        assert(p);
        if(k < l or r <= k)
            return p;
        if(l == k and k + 1 == r) {
            return make_node_ptr(Node(s));
        }
        int m = (l + r) >> 1;
        Node *lp = set(k, s, p->l, l, m), *rp = set(k, s, p->r, m, r);
        return merge(lp, rp);
    }

  public:
    using node_type = Node;
    persistent_segtree(int n) : n(n) {}
    Node *build(const vector<S> &v) { return build(0, v.size(), v); }
    // [a,b) の総積を計算
    S prod(Node *p, int a, int b) { return prod(a, b, p, 0, n); }
    Node *set(Node *p, int k, const S &s) { return set(k, s, p, 0, n); }
    void dump(Node *p, vector<S> &res) {
        assert((p->l == nullptr) == (p->r == nullptr));
        if(p->l) {
            dump(p->l, res);
            dump(p->r, res);
        } else {
            res.emplace_back(p->s);
        }
    }
};
#line 4 "data-structure/rectangle-sum.hpp"
// https://nyaannyaan.github.io/library/data-structure-2d/rectangle-sum.hpp
// T 座標の型, (S, op, e) モノイド
template <class T, class S, auto op, auto e> struct rectangle_sum {
    persistent_segtree<S, op, e> seg;
    using pointer = decltype(seg)::node_type *;
    vector<T> xs, ys;
    vector<S> ws;
    vector<pointer> ps;
    rectangle_sum(const vector<T> &xs_, const vector<T> &ys_,
                  const vector<S> &ws_)
        : seg(xs_.size()) {
        assert(xs_.size() == ys_.size() and xs_.size() == ws_.size());
        const int n = xs_.size();
        xs.reserve(n);
        ys.reserve(n);
        ws.reserve(n);
        vector<int> ord(n);
        iota(begin(ord), end(ord), 0);
        ranges::sort(ord, {}, [&xs_](int i) { return xs_[i]; });
        for(auto i : ord) {
            xs.emplace_back(xs_[i]);
            ys.emplace_back(ys_[i]);
            ws.emplace_back(ws_[i]);
        }
        ranges::sort(ord, {}, [&](int i) { return ys[i]; });
        ps.reserve(n + 1);
        ps.emplace_back(seg.build(vector<S>(n, e())));
        for(auto i : ord) {
            ps.emplace_back(seg.set(ps.back(), i, ws[i]));
        }
        ranges::sort(ys);
    };
    // op([l,r)×[0,u))
    S sum(T l, T r, T u) {
        l = lower_bound(begin(xs), end(xs), l) - begin(xs);
        r = lower_bound(begin(xs), end(xs), r) - begin(xs);
        u = lower_bound(begin(ys), end(ys), u) - begin(ys);
        return seg.prod(ps[u], l, r);
    }
    // op([l,r)×[0,u)) - op([l,r)×[0,d))
    // opが足し算じゃない場合は引数3つのsum2回取って勝手にやって
    S sum(T l, T d, T r, T u) {
        l = lower_bound(begin(xs), end(xs), l) - begin(xs);
        r = lower_bound(begin(xs), end(xs), r) - begin(xs);
        d = lower_bound(begin(ys), end(ys), d) - begin(ys);
        u = lower_bound(begin(ys), end(ys), u) - begin(ys);
        return seg.prod(ps[u], l, r) - seg.prod(ps[d], l, r);
    }
};
#line 3 "/home/y_midori/cp/b.cpp"
#include <atcoder/modint>
using mint = atcoder::modint998244353;
#line 3 "rng.hpp"
/**
 * @brief 乱数
 * @see https://maspypy.github.io/library/random/base.hpp
 */
namespace rng_internal {
unsigned long long x_ =
    (unsigned long long)(chrono::duration_cast<chrono::nanoseconds>(
                             chrono::high_resolution_clock::now()
                                 .time_since_epoch())
                             .count()) *
    10150724397891781847ULL;
}

unsigned long long RNG_64() {
    using namespace rng_internal;
    x_ ^= x_ << 7;
    return x_ ^= x_ >> 9;
}
void init_rng(unsigned long long seed = 10'000'000'000'000'000'000ULL) {
    rng_internal::x_ = seed;
}

unsigned long long RNG(unsigned long long lim) { return RNG_64() % lim; }

/*
1e18くらいの素数
1000000000000000003
1000000000000000009
1000000000000000031
*/
// [l,r)
ll rng(ll l, ll r) { return l + RNG_64() % (r - l); }
// [0,1]
double rnd() { return RNG_64() * 5.42101086242752217e-20; }
#line 6 "/home/y_midori/cp/b.cpp"
int main() {
    INT(h, w, n);
    int f[10];
    f[0] = 0, f[1] = 1, f[2] = 2, f[5] = 5, f[9] = 6, f[8] = 8, f[6] = 9;
    mint rd[10];
    rep(i, 10) rd[i] = rng(0, mint::mod());
    vi xs(n), ys(n), v(n);
    vector<mint> ws(n);
    mint rx = rng(0, mint::mod()), ry = rng(0, mint::mod());
    // rep(i, 10) rd[i] = i;
    // rx = ry = 1;
    rep(i, n) {
        cin >> xs[i] >> ys[i] >> v[i];
        --xs[i], --ys[i];
        ws[i] = rd[v[i]] * rx.pow(xs[i]) * ry.pow(ys[i]);
        if(v[i] == 0)
            ws[i] = 0;
    }
    if(n == 0) {
        INT(q);
        rep(q) print("Yes");
        return 0;
    }
    rectangle_sum<int, mint, [](mint a, mint b) { return a + b; },
                  [] { return mint(0); }>
        rec(xs, ys, ws);
    rep(i, n) {
        xs[i] = h - 1 - xs[i], ys[i] = w - 1 - ys[i];
        ws[i] = rd[f[v[i]]] * rx.pow(xs[i]) * ry.pow(ys[i]);
        if(v[i] == 0)
            ws[i] = 0;
    }
    rectangle_sum<int, mint, [](mint a, mint b) { return a + b; },
                  [] { return mint(0); }>
        rec2(xs, ys, ws);
    INT(q);
    rep(q) {
        INT(l, d, r, u);
        --l, --d, --r, --u;
        mint val = rec.sum(l, d, r + 1, u + 1) / (rx.pow(l) * ry.pow(d));
        tie(l, r, d, u) =
            make_tuple(h - 1 - r, h - 1 - l, w - 1 - u, w - 1 - d);
        mint val2 = rec2.sum(l, d, r + 1, u + 1) / (rx.pow(l) * ry.pow(d));
        print((val == val2) ? "Yes" : "No");
    }
}
0