結果
| 問題 |
No.3207 Digital Font
|
| ユーザー |
 unyon_maru65536
|
| 提出日時 | 2025-07-31 00:01:54 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 19,992 bytes |
| コンパイル時間 | 5,132 ms |
| コンパイル使用メモリ | 296,320 KB |
| 実行使用メモリ | 38,780 KB |
| 最終ジャッジ日時 | 2025-07-31 00:02:44 |
| 合計ジャッジ時間 | 43,704 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 32 WA * 5 RE * 1 |
コンパイルメッセージ
main.cpp: In function ‘void scanner::scan(char*)’:
main.cpp:89:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
89 | void scan(char a[]) { std::scanf("%s", a); }
| ~~~~~~~~~~^~~~~~~~~
ソースコード
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
// #if __has_include(<atcoder/all>)
// #include <atcoder/all>
// using namespace atcoder;
// #endif
#include <atcoder/all>
using namespace atcoder;
#pragma region Macros
// rep macro
#define foa(v, a) for(auto &v : a)
#define REPname(a, b, c, d, e, ...) e
#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define REP0(x) for(int i = 0; i < (x); ++i)
#define REP1(i, x) for(int i = 0; i < (x); ++i)
#define REP2(i, l, r) for(int i = (l); i < (r); ++i)
#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))
#define REPSname(a, b, c, ...) c
#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)
#define REPS0(x) for(int i = 1; i <= (x); ++i)
#define REPS1(i, x) for(int i = 1; i <= (x); ++i)
#define RREPname(a, b, c, d, e, ...) e
#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define RREP0(x) for(int i = (x)-1; i >= 0; --i)
#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)
#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)
#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))
#define RREPSname(a, b, c, ...) c
#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)
#define RREPS0(x) for(int i = (x); i >= 1; --i)
#define RREPS1(i, x) for(int i = (x); i >= 1; --i)
// name macro
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
template <class T = int>
using V = std::vector<T>;
template <class T = int>
using VV = std::vector<std::vector<T>>;
template <class T = int>
using VVV = std::vector<std::vector<std::vector<T>>>;
template <class T>
using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using ll = long long;
using ld = long double;
using int128 = __int128_t;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
// using Tp = tuple<ll,ll,ll>;
// input macro
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for(T &i : v) is >> i;
return is;
}
std::istream &operator>>(std::istream &is, __int128_t &a) {
std::string s;
is >> s;
__int128_t ret = 0;
for(int i = 0; i < s.length(); i++)
if('0' <= s[i] and s[i] <= '9')
ret = 10 * ret + s[i] - '0';
a = ret * (s[0] == '-' ? -1 : 1);
return is;
}
namespace scanner {
void scan(int &a) { std::cin >> a; }
void scan(long long &a) { std::cin >> a; }
void scan(std::string &a) { std::cin >> a; }
void scan(char &a) { std::cin >> a; }
void scan(char a[]) { std::scanf("%s", a); }
void scan(double &a) { std::cin >> a; }
void scan(long double &a) { std::cin >> a; }
template <class T, class U>
void scan(std::pair<T, U> &p) { std::cin >> p; }
template <class T>
void scan(std::vector<T> &a) { std::cin >> a; }
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail) {
scan(head);
INPUT(tail...);
}
} // namespace scanner
#define VEC(type, name, size) \
std::vector<type> name(size); \
scanner::INPUT(name)
#define VVEC(type, name, h, w) \
std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
scanner::INPUT(name)
#define INT(...) \
int __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define LL(...) \
long long __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define STR(...) \
std::string __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define DOUBLE(...) \
double __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define LD(...) \
long double __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
// output-macro
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {
for(int i = 0; i < int(a.size()); ++i) {
if(i) os << " ";
os << a[i];
}
return os;
}
std::ostream &operator<<(std::ostream &dest, __int128_t &value) {
std::ostream::sentry s(dest);
if(s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while(tmp != 0);
if(value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if(dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
template <class T>
void print(const T a) { std::cout << a << '\n'; }
template <class Head, class... Tail>
void print(Head H, Tail... T) {
std::cout << H << ' ';
print(T...);
}
template <class T>
void printel(const T a) { std::cout << a << '\n'; }
template <class T>
void printel(const std::vector<T> &a) {
for(const auto &v : a)
std::cout << v << '\n';
}
template <class Head, class... Tail>
void printel(Head H, Tail... T) {
std::cout << H << '\n';
printel(T...);
}
void Yes(const bool b = true) { std::cout << (b ? "Yes\n" : "No\n"); }
void No() { std::cout << "No\n"; }
void YES(const bool b = true) { std::cout << (b ? "YES\n" : "NO\n"); }
void NO() { std::cout << "No\n"; }
void err(const bool b = true) {
if(b) {
std::cout << "-1\n", exit(0);
}
}
//debug macro
namespace debugger {
template <class T>
void view(const std::vector<T> &a) {
std::cerr << "{ ";
for(const auto &v : a) {
std::cerr << v << ", ";
}
std::cerr << "\b\b }";
}
template <class T>
void view(const std::vector<std::vector<T>> &a) {
std::cerr << "{\n";
for(const auto &v : a) {
std::cerr << "\t";
view(v);
std::cerr << "\n";
}
std::cerr << "}";
}
template <class T, class U>
void view(const std::vector<std::pair<T, U>> &a) {
std::cerr << "{\n";
for(const auto &p : a) std::cerr << "\t(" << p.first << ", " << p.second << ")\n";
std::cerr << "}";
}
template <class T, class U>
void view(const std::map<T, U> &m) {
std::cerr << "{\n";
for(const auto &p : m) std::cerr << "\t[" << p.first << "] : " << p.second << "\n";
std::cerr << "}";
}
template <class T, class U>
void view(const std::pair<T, U> &p) { std::cerr << "(" << p.first << ", " << p.second << ")"; }
template <class T>
void view(const std::set<T> &s) {
std::cerr << "{ ";
for(auto &v : s) {
view(v);
std::cerr << ", ";
}
std::cerr << "\b\b }";
}
template <class T>
void view(const T &e) { std::cerr << e; }
} // namespace debugger
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
debugger::view(H);
std::cerr << ", ";
debug_out(T...);
}
#define debug(...) \
do { \
std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
debug_out(__VA_ARGS__); \
std::cerr << "\b\b]\n"; \
} while(false)
#else
#define debug(...) (void(0))
#endif
// vector macro
template <class T>
int lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }
template <class T>
int ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }
template <class T>
void UNIQUE(std::vector<T> &a) {
std::sort(a.begin(), a.end());
a.erase(std::unique(a.begin(), a.end()), a.end());
}
template <class T>
std::vector<T> press(std::vector<T> &a) {
auto res = a;
UNIQUE(res);
for(auto &v : a)
v = lb(res, v);
return res;
}
#define SORTname(a, b, c, ...) c
#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)
#define SORT0(a) std::sort((a).begin(), (a).end())
#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })
template <class T>
void ADD(std::vector<T> &a, const T x) {
for(auto &v : a) v += x;
}
template <class T>
void SUB(std::vector<T> &a, const T x = 1) {
for(auto &v : a) v -= x;
}
template <class T>
void MUL(std::vector<T> &a, const T x) {
for(auto &v : a) v *= x;
}
template <class T>
void DIV(std::vector<T> &a, const T x) {
for(auto &v : a) v /= x;
}
// math macro
template <class T, class U>
inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <class T, class U>
inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <class T>
T divup(T x, T y) { return (x + y - 1) / y; }
template <class T>
T POW(T a, long long n) {
T ret = 1;
while(n) {
if(n & 1) ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template<typename T>
T ADD(T a, T b){
T res;
return __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
}
template<typename T>
T MUL(T a, T b){
T res;
return __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
}
// modpow
long long POW(long long a, long long n, const int mod) {
long long ret = 1;
while(n) {
if(n & 1) (ret *= a) %= mod;
(a *= a) %= mod;
n >>= 1;
}
return ret;
}
// others
struct fast_io {
fast_io() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
}
} fast_io_;
#pragma endregion
using R = long double;
constexpr R EPS=1E-11;
// r の(誤差付きの)符号に従って, -1, 0, 1 を返す.
int sgn(const R& r){ return (r > EPS) - (r < -EPS); }
// a, b の(誤差付きの)大小比較の結果に従って, -1, 0, 1 を返す.
int sgn(const R& a, const R &b){ return sgn(a-b); }
// a > 0 は sgn(a) > 0
// a < b は sgn(a, b) < 0
// a >= b は sgn(a, b) >= 0
// のように書く.
// return s * 10^n
//https://atcoder.jp/contests/abc191/submissions/20028529
long long x10(const string& s, size_t n) {
if (s.front() == '-') return -x10(s.substr(1), n);
auto pos = s.find('.');
if (pos == string::npos) return stoll(s + string(n, '0'));
return stoll(s.substr(0, pos) + s.substr(pos + 1) + string(n + pos + 1 - s.size(), '0'));
}
long long ceildiv(long long a, long long b) {
if (b < 0) a = -a, b = -b;
if (a >= 0) return (a + b - 1) / b;
else return a / b;
}
long long floordiv(long long a, long long b) {
if (b < 0) a = -a, b = -b;
if (a >= 0) return a / b;
else return (a - b + 1) / b;
}
long long floorsqrt(long long x) {
assert(x >= 0);
long long ok = 0;
long long ng = 1;
while (ng * ng <= x) ng <<= 1;
while (ng - ok > 1) {
long long mid = (ng + ok) >> 1;
if (mid * mid <= x) ok = mid;
else ng = mid;
}
return ok;
}
inline int topbit(unsigned long long x){
return x?63-__builtin_clzll(x):-1;
}
inline int popcount(unsigned long long x){
return __builtin_popcountll(x);
}
inline int parity(unsigned long long x){//popcount%2
return __builtin_parity(x);
}
const int inf = 1e9;
const ll INF = 1e18;
const ll mod = 2147483647;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint val(){
return x;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(ll n):fact(n+1),ifact(n+1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
mint p(ll n, ll k) {
return fact[n]*ifact[n-k];
}
};
// Bit Vector (for 64-bit non-negative integer)
struct BitVector {
// block: bit vector
// count: the number of 1 within each block
unsigned int n, zeros;
vector<unsigned long long> block;
vector<unsigned int> count;
// constructor
BitVector() {}
BitVector(const unsigned int num) {
resize(num);
}
void resize(const unsigned int num) {
n = num;
block.assign(((num + 1) >> 6) + 1, 0);
count.assign(block.size(), 0);
}
// set val(0 or 1) onto i-th bit, get i-th bit of val(0 or 1)
void set(const unsigned int i, const unsigned long long val = 1LL) {
assert((i >> 6) < block.size());
block[i >> 6] |= (val << (i & 63));
}
unsigned int get(const unsigned int i) const {
assert((i >> 6) < block.size());
return (const unsigned int)(block[i >> 6] >> (i & 63)) & 1;
}
void build() {
for (unsigned int i = 1; i < block.size(); i++) {
count[i] = count[i - 1] + __builtin_popcountll(block[i - 1]);
}
zeros = rank0(n);
}
// the number of 1 in [0, i)
unsigned int rank1(const unsigned int i) const {
assert((i >> 6) < count.size());
assert((i >> 6) < block.size());
return count[i >> 6] +
__builtin_popcountll(block[i >> 6] & ((1ULL << (i & 63)) - 1ULL));
}
// the number of 1 in [i, j)
unsigned int rank1(const unsigned int i, const unsigned int j) const {
return rank1(j) - rank1(i);
}
// the number of 0 in [0, i)
unsigned int rank0(const unsigned int i) const {
return i - rank1(i);
}
// the number of 0 in [i, j)
unsigned int rank0(const unsigned int i, const unsigned int j) const {
return rank0(j) - rank0(i);
}
// the number of 0 in [0, n)
unsigned int rank0() const {
return zeros;
}
};
// BIT on Wavelet Matrix
template<class POS, class VAL> struct BITonWaveletMatrix {
// inner data
struct BIT {
VAL UNITY_SUM = 0;
int N;
vector<VAL> dat;
// [0, n)
BIT() {}
BIT(int n, VAL unity = 0) : UNITY_SUM(unity), N(n), dat(n, unity) { }
void init(int n) {
N = n;
dat.assign(n, UNITY_SUM);
}
// a is 0-indexed
void add(int a, VAL x) {
for (int i = a; i < (int)dat.size(); i |= i + 1)
dat[i] = dat[i] + x;
}
// [0, a), a is 0-indexed
VAL sum(int a) {
VAL res = UNITY_SUM;
for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)
res = res + dat[i];
return res;
}
// [a, b), a and b are 0-indexed
VAL sum(int a, int b) {
return sum(b) - sum(a);
}
// debug
void print() {
for (int i = 0; i < (int)dat.size(); ++i)
cout << sum(i, i + 1) << ",";
cout << endl;
}
};
using Point = pair<POS, POS>;
int n, height;
vector<BitVector> bv;
vector<Point> ps;
vector<POS> ys;
vector<BIT> bit;
// constructor (sigma: the number of characters)
// add_point() cannot be used after build()
BITonWaveletMatrix() {}
BITonWaveletMatrix(const vector<Point> &vec) {
for (auto [x, y] : vec) add_point(x, y);
build();
}
void add_point(POS x, POS y) {
ps.emplace_back(x, y);
ys.emplace_back(y);
}
int xid(POS x) const {
return lower_bound(ps.begin(), ps.end(), Point(x, 0)) - ps.begin();
}
int yid(POS y) const {
return lower_bound(ys.begin(), ys.end(), y) - ys.begin();
}
void build() {
sort(ps.begin(), ps.end());
ps.erase(unique(ps.begin(), ps.end()), ps.end());
n = (int)ps.size();
sort(ys.begin(), ys.end());
ys.erase(unique(ys.begin(), ys.end()), ys.end());
vector<int> v(n), left(n), right(n), ord(n);
int mv = 1;
for (int i = 0; i < n; ++i) {
v[i] = yid(ps[i].second);
mv = max(mv, v[i]);
}
for (height = 1; mv != 0; mv >>= 1) ++height;
iota(ord.begin(), ord.end(), 0);
bv.assign(height, BitVector(n));
bit.assign(height + 1, BIT(n));
for (int h = height - 1; h >= 0; --h) {
int l = 0, r = 0;
for (int i = 0; i < n; ++i) {
if ((v[ord[i]] >> h) & 1) {
bv[h].set(i);
right[r++] = ord[i];
} else {
left[l++] = ord[i];
}
}
bv[h].build();
ord.swap(left);
for (int i = 0; i < r; ++i) ord[i + l] = right[i];
}
}
// add
void add(const POS x, const POS y, const VAL val) {
int i = lower_bound(ps.begin(), ps.end(), Point(x, y)) - ps.begin();
int j = yid(y);
for (int h = height - 1; h >= 0; --h) {
int i0 = bv[h].rank0(i);
if ((j >> h) & 1) {
i += bv[h].rank0() - i0;
} else {
i = i0;
}
bit[h].add(i, val);
}
}
// sum
VAL inner_sum(int l, int r, const POS upper) {
assert(0 <= l && r <= n);
VAL res = 0;
for (int h = height - 1; h >= 0; --h) {
int l0 = bv[h].rank0(l), r0 = bv[h].rank0(r);
if ((upper >> h) & 1) {
l += bv[h].rank0() - l0;
r += bv[h].rank0() - r0;
res += bit[h].sum(l0, r0);
} else {
l = l0;
r = r0;
}
}
return res;
}
VAL sum(const POS lx, const POS rx, const POS ly, const POS ry) {
int l = xid(lx), r = xid(rx);
return inner_sum(l, r, yid(ry)) - inner_sum(l, r, yid(ly));
}
};
using Tp = tuple<int,int,mint>;
void main_() {
LL(H,W);
LL(N);
BITonWaveletMatrix<ll,mint> wm1,wm2;
V<Tp> p1, p2;
REP(i,N){
LL(A,B,C);
A--; B--;
if(C == 0)continue;
mint val1 = 2;
val1 = val1.pow(W*A + B);
mint val2 = 2;
ll A_ = H - A - 1;
ll B_ = W - B - 1;
val2 = val2.pow(W*A_ + B_);
val1 *= C;
Tp ele1 = {A,B,val1.x};
int C_ = C;
if(C == 6)C_ = 9;
else if(C == 9)C_ = 6;
val2 *= C_;
Tp ele2 = {A_, B_, val2.x};
// cout << A << " " << B << " " << val1.val() << " " << val2.val() << endl;
p1.push_back(ele1);
p2.push_back(ele2);
wm1.add_point(A,B);
wm2.add_point(A_, B_);
}
wm1.build();
wm2.build();
REP(i,N){
auto [a1,b1,c1] = p1[i];
auto [a2,b2,c2] = p2[i];
wm1.add(a1,b1,c1);
wm2.add(a2,b2,c2);
}
INT(qi);
REP(i,qi){
LL(L,D,R,U);
L--; D--;
ll rR = H - L;
ll rL = H - R;
ll rD = W - U;
ll rU = W - D;
bool same = true;
mint h1 = 2;
h1 = h1.pow(W * L + D);
mint h2 = 2;
h2 = h2.pow(W * rL + rD);
mint v1 = wm1.sum(L,R,D,U);
v1 /= h1;
mint v2 = wm2.sum(rL,rR,rD,rU);
v2 /= h2;
// cout << v1.x << " " << v2.x << endl;
if(v1.x != v2.x)same = false;
if(same)cout << "Yes" << endl;
else cout << "No" << endl;
}
}
int main() {
int t = 1;
// cin >> t;
while(t--) main_();
return 0;
}