結果

問題 No.1490 スライムと爆弾
ユーザー maspy
提出日時 2022-05-20 02:42:21
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 21,999 bytes
コンパイル時間 2,996 ms
コンパイル使用メモリ 239,632 KB
最終ジャッジ日時 2025-01-29 09:34:37
ジャッジサーバーID
（参考情報） 		judge1 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 13 WA * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#line 1 "/home/maspy/compro/library/my_template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
  overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
template <typename T>
T SUM(vector<T> &A) {
  T sum = T(0);
  for (auto &&a: A) sum += a;
  return sum;
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T, typename U>
T ceil(T x, U y) {
  return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
  return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
  T q = floor(x, y);
  return {q, x - q * y};
}
ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
  assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    if (check(x))
      ok = x;
    else
      ng = x;
  }
  return ok;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}
vi s_to_vi(const string &S, char first_char) {
  vi A(S.size());
  FOR(i, S.size()) { A[i] = S[i] - first_char; }
  return A;
}
template <typename T>
vector<T> cumsum(vector<T> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}
template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
  vc<CNT> C(size);
  for (auto &&x: A) { ++C[x]; }
  return C;
}
template <typename T>
vector<int> argsort(const vector<T> &A) {
  // stable
  vector<int> ids(A.size());
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
  return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  int n = len(A);
  assert(len(I) == n);
  vc<T> B(n);
  FOR(i, n) B[i] = A[I[i]];
  return B;
}
#line 1 "/home/maspy/compro/library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>
namespace detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail
template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<T>::value>;
struct Scanner {
  FILE *fp;
  char line[(1 << 15) + 1];
  size_t st = 0, ed = 0;
  void reread() {
    memmove(line, line + st, ed - st);
    ed -= st;
    st = 0;
    ed += fread(line + ed, 1, (1 << 15) - ed, fp);
    line[ed] = '\0';
  }
  bool succ() {
    while (true) {
      if (st == ed) {
        reread();
        if (st == ed) return false;
      }
      while (st != ed && isspace(line[st])) st++;
      if (st != ed) break;
    }
    if (ed - st <= 50) {
      bool sep = false;
      for (size_t i = st; i < ed; i++) {
        if (isspace(line[i])) {
          sep = true;
          break;
        }
      }
      if (!sep) reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    while (true) {
      size_t sz = 0;
      while (st + sz < ed && !isspace(line[st + sz])) sz++;
      ref.append(line + st, sz);
      st += sz;
      if (!sz || st != ed) break;
      reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    bool neg = false;
    if (line[st] == '-') {
      neg = true;
      st++;
    }
    ref = T(0);
    while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
    if (neg) ref = -ref;
    return true;
  }
  template <class T, is_modint_t<T> * = nullptr>
  bool read_single(T &ref) {
    long long val = 0;
    bool f = read_single(val);
    ref = T(val);
    return f;
  }
  bool read_single(double &ref) {
    string s;
    if (!read_single(s)) return false;
    ref = std::stod(s);
    return true;
  }
  bool read_single(char &ref) {
    string s;
    if (!read_single(s) || s.size() != 1) return false;
    ref = s[0];
    return true;
  }
  template <class T>
  bool read_single(vector<T> &ref) {
    for (auto &d: ref) {
      if (!read_single(d)) return false;
    }
    return true;
  }
  template <class T, class U>
  bool read_single(pair<T, U> &p) {
    return (read_single(p.first) && read_single(p.second));
  }
  template <class A, class B, class C>
  bool read_single(tuple<A, B, C> &p) {
    return (read_single(get<0>(p)) && read_single(get<1>(p))
            && read_single(get<2>(p)));
  }
  template <class A, class B, class C, class D>
  bool read_single(tuple<A, B, C, D> &p) {
    return (read_single(get<0>(p)) && read_single(get<1>(p))
            && read_single(get<2>(p)) && read_single(get<3>(p)));
  }
  void read() {}
  template <class H, class... T>
  void read(H &h, T &... t) {
    bool f = read_single(h);
    assert(f);
    read(t...);
  }
  Scanner(FILE *fp) : fp(fp) {}
};
struct Printer {
  Printer(FILE *_fp) : fp(_fp) {}
  ~Printer() { flush(); }
  static constexpr size_t SIZE = 1 << 15;
  FILE *fp;
  char line[SIZE], small[50];
  size_t pos = 0;
  void flush() {
    fwrite(line, 1, pos, fp);
    pos = 0;
  }
  void write(const char &val) {
    if (pos == SIZE) flush();
    line[pos++] = val;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  void write(T val) {
    if (pos > (1 << 15) - 50) flush();
    if (val == 0) {
      write('0');
      return;
    }
    if (val < 0) {
      write('-');
      val = -val; // todo min
    }
    size_t len = 0;
    while (val) {
      small[len++] = char(0x30 | (val % 10));
      val /= 10;
    }
    for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
    pos += len;
  }
  void write(const string &s) {
    for (char c: s) write(c);
  }
  void write(const char *s) {
    size_t len = strlen(s);
    for (size_t i = 0; i < len; i++) write(s[i]);
  }
  void write(const double &x) {
    ostringstream oss;
    oss << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  void write(const long double &x) {
    ostringstream oss;
    oss << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  template <class T, is_modint_t<T> * = nullptr>
  void write(T &ref) {
    write(ref.val);
  }
  template <class T>
  void write(const vector<T> &val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  template <class T, class U>
  void write(const pair<T, U> &val) {
    write(val.first);
    write(' ');
    write(val.second);
  }
  template <class A, class B, class C>
  void write(const tuple<A, B, C> &val) {
    auto &[a, b, c] = val;
    write(a), write(' '), write(b), write(' '), write(c);
  }
  template <class A, class B, class C, class D>
  void write(const tuple<A, B, C, D> &val) {
    auto &[a, b, c, d] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
  }
  template <class A, class B, class C, class D, class E>
  void write(const tuple<A, B, C, D, E> &val) {
    auto &[a, b, c, d, e] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
  }
  template <class A, class B, class C, class D, class E, class F>
  void write(const tuple<A, B, C, D, E, F> &val) {
    auto &[a, b, c, d, e, f] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);
  }
  template <class T, size_t S>
  void write(const array<T, S> &val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  void write(i128 val) {
    string s;
    bool negative = 0;
    if(val < 0){
      negative = 1;
      val = -val;
    }
    while (val) {
      s += '0' + int(val % 10);
      val /= 10;
    }
    if(negative) s += "-";
    reverse(all(s));
    if (len(s) == 0) s = "0";
    write(s);
  }
};
Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);
void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
  printer.write(head);
  if (sizeof...(Tail)) printer.write(' ');
  print(forward<Tail>(tail)...);
}
void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
  scanner.read(head);
  read(tail...);
}
#define INT(...)   \
  int __VA_ARGS__; \
  read(__VA_ARGS__)
#define LL(...)   \
  ll __VA_ARGS__; \
  read(__VA_ARGS__)
#define STR(...)      \
  string __VA_ARGS__; \
  read(__VA_ARGS__)
#define CHAR(...)      \
  char __VA_ARGS__; \
  read(__VA_ARGS__)
#define DBL(...)      \
  double __VA_ARGS__; \
  read(__VA_ARGS__)
#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 2 "/home/maspy/compro/library/ds/rectangle_add_ractangle_sum.hpp"
#line 2 "/home/maspy/compro/library/alg/group_add.hpp"
template <class X>
struct Group_Add {
  using value_type = X;
  static constexpr X op(const X &x, const X &y) noexcept { return x + y; }
  static constexpr X inverse(const X &x) noexcept { return -x; }
  static constexpr X power(const X &x, ll n) noexcept { return n * x; }
  static constexpr X unit() { return X(0); }
  static constexpr bool commute = true;
};
#line 3 "/home/maspy/compro/library/ds/fenwick.hpp"
template <typename AbelGroup>
struct FenwickTree {
  using E = typename AbelGroup::value_type;
  int n;
  vector<E> dat;
  E total;
  FenwickTree() : FenwickTree(0) {}
  FenwickTree(int n) : n(n), total(AbelGroup::unit()) {
    assert(AbelGroup::commute);
    dat.assign(n, AbelGroup::unit());
  }
  FenwickTree(vc<E> v) : n(len(v)), total(AbelGroup::unit()) {
    assert(AbelGroup::commute);
    FOR(i, n) total = AbelGroup::op(total, v[i]);
    dat = v;
    FOR3(i, 1, n + 1) {
      int j = i + (i & -i);
      if (j <= n) dat[j - 1] = AbelGroup::op(dat[i - 1], dat[j - 1]);
    }
  }
  void reset(){
    total = AbelGroup::unit();
    dat.assign(n, AbelGroup::unit());
  }
  E sum(int k) {
    E ret = AbelGroup::unit();
    for (; k > 0; k -= k & -k) ret = AbelGroup::op(ret, dat[k - 1]);
    return ret;
  }
  E sum(int L, int R) {
    E pos = AbelGroup::unit();
    while (L < R) {
      pos = AbelGroup::op(pos, dat[R - 1]);
      R -= R & -R;
    }
    E neg = AbelGroup::unit();
    while (R < L) {
      neg = AbelGroup::op(neg, dat[L - 1]);
      L -= L & -L;
    }
    return AbelGroup::op(pos, AbelGroup::inverse(neg));
  }
  E sum_all() { return total; }
  void add(int k, E x) {
    total = AbelGroup::op(total, x);
    for (++k; k <= n; k += k & -k) dat[k - 1] = AbelGroup::op(dat[k - 1], x);
  }
  template <class F>
  int max_right(F& check) {
    assert(check(E(0)));
    ll i = 0;
    E s = AbelGroup::unit();
    int k = 1;
    int N = len(dat) + 1;
    while (2 * k < N) k *= 2;
    while (k) {
      if (i + k < N && check(AbelGroup::op(s, dat[i + k - 1]))) {
        i += k;
        s = AbelGroup::op(s, dat[i - 1]);
      }
      k >>= 1;
    }
    return i;
  }
  int find_kth(E k) {
    auto check = [&](E x) -> bool { return x <= k; };
    return max_right(check);
  }
  void debug() { print("fenwick", dat); }
};
#line 2 "/home/maspy/compro/library/ds/point_add_rectangle_sum.hpp"
// 点群はクエリより前に全部入力すること (add_pt)。
// 同じ点群に対してクエリをやり直せる。
// SMALL=true にすると、座圧をしないため少し高速
template <typename AbelGroup, bool SMALL = false>
struct Point_Add_Rectangle_Sum {
  using WT = typename AbelGroup::value_type;
  bool compressed;
  int Q;
  vi X, Y;
  vi keyX, keyY;
  ll min_x, max_x, min_y, max_y;
  vc<WT> wt;
  vc<vc<pair<int, WT>>> add;
  vc<vc<tuple<int, int, int>>> query_l;
  vc<vc<tuple<int, int, int>>> query_r;
  Point_Add_Rectangle_Sum() : compressed(0), Q(0) {}
  void add_query(ll x, ll y, WT w = 1) {
    assert(!compressed);
    X.eb(x), Y.eb(y), wt.eb(w);
    keyX.eb(x), keyY.eb(y);
  }
  void compress() {
    compressed = 1;
    int N = len(X);
    if (!SMALL) {
      UNIQUE(keyX), UNIQUE(keyY);
      add.resize(len(keyX) + 1);
      FOR(i, N) {
        ll x = X[i], y = Y[i];
        WT w = wt[i];
        x = LB(keyX, x), y = LB(keyY, y);
        add[x].eb(y, w);
      }
    } else {
      min_x = (N == 0 ? 0 : MIN(X));
      max_x = (N == 0 ? 0 : MAX(X));
      min_y = (N == 0 ? 0 : MIN(Y));
      max_y = (N == 0 ? 0 : MAX(Y));
      add.resize(max_x - min_x + 2);
      FOR(i, N) {
        ll x = X[i], y = Y[i];
        WT w = wt[i];
        x -= min_x, y -= min_y;
        add[x].eb(y, w);
      }
    }
    query_l.resize(len(add));
    query_r.resize(len(add));
  }
  void sum_query(ll xl, ll yl, ll xr, ll yr) {
    if (!compressed) compress();
    if (!SMALL) {
      xl = LB(keyX, xl), xr = LB(keyX, xr);
      yl = LB(keyY, yl), yr = LB(keyY, yr);
    } else {
      xl -= min_x, xr -= min_x;
      yl -= min_y, yr -= min_y;
      xl = clamp(xl, 0LL, max_x - min_x + 1);
      xr = clamp(xr, 0LL, max_x - min_x + 1);
      yl = clamp(yl, 0LL, max_y - min_y + 1);
      yr = clamp(yr, 0LL, max_y - min_y + 1);
    }
    query_l[xl].eb(Q, yl, yr);
    query_r[xr].eb(Q, yl, yr);
    ++Q;
  }
  vc<WT> calc() {
    assert(compressed);
    vc<WT> ANS(Q, AbelGroup::unit());
    int k = (SMALL ? max_y - min_y + 2 : len(keyY) + 1);
    FenwickTree<AbelGroup> bit(k);
    FOR(x, len(add)) {
      for (auto&& t: query_l[x]) {
        auto [q, yl, yr] = t;
        ANS[q] = AbelGroup::op(ANS[q] , AbelGroup::inverse(bit.sum(yl, yr)));
      }
      for (auto&& t: query_r[x]) {
        auto [q, yl, yr] = t;
        ANS[q] = AbelGroup::op(ANS[q] , bit.sum(yl, yr));
      }
      for (auto&& t: add[x]) {
        auto [y, w] = t;
        bit.add(y, w);
      }
      query_l[x].clear();
      query_r[x].clear();
    }
    Q = 0;
    return ANS;
  }
};
#line 4 "/home/maspy/compro/library/ds/rectangle_add_ractangle_sum.hpp"
// 何も verify してない！
template <typename AbelGroup, bool SMALL = false>
struct Rectangle_Add_Rectangle_Sum {
  using WT = typename AbelGroup::value_type;
  using WT4 = tuple<WT, WT, WT, WT>;
  struct G {
    using X = WT4;
    using value_type = X;
    static X op(const X &x, const X &y) {
      auto &[ax, bx, cx, dx] = x;
      auto &[ay, by, cy, dy] = y;
      return {AbelGroup::op(ax, ay), AbelGroup::op(bx, by),
              AbelGroup::op(cx, cy), AbelGroup::op(dx, dy)};
    }
    static X inverse(const X &x) {
      auto &[ax, bx, cx, dx] = x;
      return {AbelGroup::inverse(ax), AbelGroup::inverse(bx),
              AbelGroup::inverse(cx), AbelGroup::inverse(dx)};
    }
    static X power(const X &x, ll n) {
      auto &[ax, bx, cx, dx] = x;
      return {AbelGroup::power(ax, n), AbelGroup::power(bx, n),
              AbelGroup::power(cx, n), AbelGroup::power(dx, n)};
    }
    static constexpr X unit() {
      auto u = AbelGroup::unit();
      return {u, u, u, u};
    }
    static constexpr bool commute = true;
  };
  vc<tuple<ll, ll, ll, ll>> query;
  Point_Add_Rectangle_Sum<G, SMALL> PARS;
  void add_query(ll xl, ll yl, ll xr, ll yr, WT w) {
    // (xl,yl) に (x-xl)(y-yl) を加算
    PARS.add_query(xl, yl,
                   {w, AbelGroup::power(w, -yl), AbelGroup::power(w, -xl),
                    AbelGroup::power(w, +xl * yl)});
    // (xl,yr) に (x-xl)(y-yr) を減算
    PARS.add_query(xl, yr,
                   {AbelGroup::inverse(w), AbelGroup::power(w, +yr),
                    AbelGroup::power(w, +xl), AbelGroup::power(w, -xl * yr)});
    // (xr,yl) に (x-xr)(y-yl) を減算
    PARS.add_query(xr, yl,
                   {AbelGroup::inverse(w), AbelGroup::power(w, +yl),
                    AbelGroup::power(w, +xr), AbelGroup::power(w, -xr * yl)});
    // (xr,yr) に (x-xr)(y-yr) を加算
    PARS.add_query(xr, yl,
                   {w, AbelGroup::power(w, -yr), AbelGroup::power(w, -xr),
                    AbelGroup::power(w, +xr * yr)});
  }
  void sum_query(ll xl, ll yl, ll xr, ll yr) {
    query.eb(xl, yl, xr, yr);
    PARS.sum_query(0, 0, xl, yl);
    PARS.sum_query(0, 0, xl, yr);
    PARS.sum_query(0, 0, xr, yl);
    PARS.sum_query(0, 0, xr, yr);
  }
  vc<WT> calc() {
    ll Q = len(query);
    vc<WT> ANS(Q);
    auto tmp = PARS.calc();
    assert(len(tmp) == 4 * Q);
    FOR(q, Q) {
      auto [xl, yl, xr, yr] = query[q];
      WT p = AbelGroup::unit(), m = AbelGroup::unit();
      {
        auto [a, b, c, d] = tmp[4 * q + 0];
        p = AbelGroup::op(p, AbelGroup::power(a, xl * yl));
        p = AbelGroup::op(p, AbelGroup::power(b, xl));
        p = AbelGroup::op(p, AbelGroup::power(c, yl));
        p = AbelGroup::op(p, d);
      }
      {
        auto [a, b, c, d] = tmp[4 * q + 1];
        m = AbelGroup::op(m, AbelGroup::power(a, xl * yr));
        m = AbelGroup::op(m, AbelGroup::power(b, xl));
        m = AbelGroup::op(m, AbelGroup::power(c, yr));
        m = AbelGroup::op(m, d);
      }
      {
        auto [a, b, c, d] = tmp[4 * q + 2];
        m = AbelGroup::op(m, AbelGroup::power(a, xr * yl));
        m = AbelGroup::op(m, AbelGroup::power(b, xr));
        m = AbelGroup::op(m, AbelGroup::power(c, yl));
        m = AbelGroup::op(m, d);
      }
      {
        auto [a, b, c, d] = tmp[4 * q + 3];
        p = AbelGroup::op(p, AbelGroup::power(a, xr * yr));
        p = AbelGroup::op(p, AbelGroup::power(b, xr));
        p = AbelGroup::op(p, AbelGroup::power(c, yr));
        p = AbelGroup::op(p, d);
      }
      ANS[q] = AbelGroup::op(p, AbelGroup::inverse(m));
    }
    return ANS;
  }
};
#line 4 "main.cpp"
void solve() {
  LL(H, W, N, M);
  using T = tuple<ll, ll, ll, ll, ll>;
  vc<T> dat;
  FOR(i, N) {
    LL(xl, xr, yl, yr, a);
    --xl, --yl;
    dat.eb(xl, yl, xr, yr, a);
  }
  Rectangle_Add_Rectangle_Sum<Group_Add<ll>, 1> X;
  FOR(M) {
    LL(x, y, b, c);
    ll xl = x - b, xr = x + b + 1;
    ll yl = y - b, yr = y + b + 1;
    chmax(xl, 0);
    chmax(yl, 0);
    chmin(xr, H);
    chmin(yr, W);
    X.add_query(xl, yl, xr, yr, c);
  }
  FOR(i, N) {
    auto [xl, yl, xr, yr, a] = dat[i];
    X.sum_query(xl, yl, xr, yr);
  }
  auto res = X.calc();
  ll ANS = 0;
  FOR(i, N) {
    auto [xl, yl, xr, yr, a] = dat[i];
    ll x = res[i];
    if (a > x) ++ANS;
  }
  print(ANS);
}
signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << setprecision(15);
  ll T = 1;
  // LL(T);
  FOR(T) solve();
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0