// This is free and unencumbered software released into the public domain. // Anyone is free to copy, modify, publish, use, compile, sell, or // distribute this software, either in source code form or as a compiled // binary, for any purpose, commercial or non-commercial, and by any // means. // In jurisdictions that recognize copyright laws, the author or authors // of this software dedicate any and all copyright interest in the // software to the public domain. We make this dedication for the benefit // of the public at large and to the detriment of our heirs and // successors. We intend this dedication to be an overt act of // relinquishment in perpetuity of all present and future rights to this // software under copyright law. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. // IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR // OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, // ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR // OTHER DEALINGS IN THE SOFTWARE. // For more information, please refer to /****************/ /* template.hpp */ /****************/ #include #include #include #include #include #include using std::cerr; using std::cout; using std::endl; using std::max; using std::min; using std::swap; struct BoolName : std::numpunct { std::string t, f; BoolName(std::string t, std::string f) : t(t), f(f) {} std::string do_truename() const { return t; } std::string do_falsename() const { return f; } }; void setBoolName(std::string t, std::string f) { cout.imbue(std::locale(cout.getloc(), new BoolName(t, f))); } struct Initializer { Initializer() { cout << std::fixed << std::setprecision(15) << std::boolalpha; setBoolName("Yes", "No"); } } initializer; struct Input { bool eof; Input() : eof(false) {} operator char() { char v; this->eof = (std::scanf("%c", &v) != 1); return v; } operator int() { int v; this->eof = (std::scanf("%d", &v) != 1); return v; } operator long() { long v; this->eof = (std::scanf("%ld", &v) != 1); return v; } operator long long() { long long v; this->eof = (std::scanf("%lld", &v) != 1); return v; } operator unsigned int() { unsigned int v; this->eof = (std::scanf("%u", &v) != 1); return v; } operator unsigned long() { unsigned long v; this->eof = (std::scanf("%lu", &v) != 1); return v; } operator unsigned long long() { unsigned long long v; this->eof = (std::scanf("%llu", &v) != 1); return v; } operator double() { double v; this->eof = (std::scanf("%lf", &v) != 1); return v; } operator long double() { long double v; this->eof = (std::scanf("%Lf", &v) != 1); return v; } void ignore() const { getchar(); } } in; template T abs(T a) { return a >= 0 ? a : -a; } template bool chmin(T &a, const S &b) { return a > b ? a = b, true : false; } template bool chmax(T &a, const S &b) { return a < b ? a = b, true : false; } template std::function cast() { return [](const T &t) { return static_cast(t); }; } template T copy(const T &a) { return T(a); } class ZeroPadding { public: ZeroPadding(int n) : n(n) {} int n; }; std::ostream &operator<<(std::ostream &os, const ZeroPadding &z) { os << std::setw(z.n) << std::setfill('0'); return os; } template constexpr T inf() { return std::numeric_limits::max() / 2 - 1; } /*************/ /* tuple.hpp */ /*************/ #include template class Tuple : public std::tuple { public: Tuple(Input &in) : std::tuple() { (void)in; } }; template class Tuple : public std::tuple { public: Tuple() : std::tuple() {} Tuple(T t, S... s) : std::tuple(t, s...) {} Tuple(const std::tuple &t) : std::tuple(t) {} Tuple(Input &in) { auto a = std::tuple(in); std::tuple b = Tuple(in); std::tuple c = std::tuple_cat(a, b); *this = c; } template auto &get() { return std::get(*this); } template const auto &get() const { return std::get(*this); } }; template Tuple makeTuple(const T &... args) { return Tuple(args...); } namespace std { template class tuple_size> : public std::integral_constant {}; template class tuple_element> { public: using type = tuple_element_t>; }; } // namespace std /*****************/ /* container.hpp */ /*****************/ #include template class Container : public T { private: using S = typename T::value_type; using Itr = typename T::iterator; public: Container() : T() {} Container(int n) : T(n) {} Container(int n, S s) : T(n, s) {} template Container(Itr first, Itr last) : T(first, last) {} Container(const std::initializer_list &v) : T(v) {} Container(int n, Input &in) { std::vector v(n); for (auto &i : v) { i = in; } *this = Container(v.begin(), v.end()); } S max() const { return *std::max_element(this->begin(), this->end()); } template auto max(Function func) const { std::vector> res; for (const auto &i : *this) { res.emplace_back(func(i), i); } return std::max_element(res.begin(), res.end())->second; } S min() const { return *std::min_element(this->begin(), this->end()); } Tuple minmax() const { auto itrs = std::minmax_element(this->begin(), this->end()); return Tuple(*itrs.first, *itrs.second); } template auto min(Function func) const { std::vector> res; for (const auto &i : *this) { res.emplace_back(func(i), i); } return std::min_element(res.begin(), res.end())->second; } int argmax() const { return std::distance(std::max_element(this->begin(), this->end()), this->begin()); } int argmin() const { return std::distance(std::min_element(this->begin(), this->end()), this->begin()); } int find(const S &a) const { return std::distance(std::find(this->begin(), this->end(), a), this->begin()); } bool contains(const S &a) const { return std::find(this->begin(), this->end(), a) != this->end(); } int size() const { return T::size(); } std::pair equal_range(const S &a) { return std::equal_range(this->begin(), this->end(), a); } template bool all_of(Function func) const { return std::all_of(this->begin(), this->end(), func); } template bool any_of(Function func) const { return std::any_of(this->begin(), this->end(), func); } template bool none_of(Function func) const { return std::none_of(this->begin(), this->end(), func); } int count(const S &s) const { return std::count(this->begin(), this->end(), s); } bool is_sorted() const { return std::is_sorted(this->begin(), this->end()); } void output(std::string sep = "\n", std::string end = "\n") const { bool first = true; for (const auto &i : *this) { if (!first) { cout << sep; } first = false; cout << i; } cout << end; } }; /***********/ /* map.hpp */ /***********/ #include template class Map : public Container> { public: Map() : Container>() {} bool contains(const T &a) const { return this->count(a) != 0; } int count(const T &t) const { return this->count(t); } }; /***************/ /* ordered.hpp */ /***************/ template class Ordered { public: template bool operator==(const V &v) const { return !(static_cast(v) < static_cast(*this) || static_cast(*this) < static_cast(v)); } template bool operator!=(const V &v) const { return static_cast(v) < static_cast(*this) || static_cast(*this) < static_cast(v); } template bool operator>(const V &v) const { return static_cast(v) < static_cast(*this); } template bool operator<=(const V &v) const { return !(static_cast(v) < static_cast(*this)); } template bool operator>=(const V &v) const { return !(static_cast(*this) < static_cast(v)); } }; /**************/ /* vector.hpp */ /**************/ #include template class Vector : public Container>, public Ordered> { public: Vector() = default; Vector(const Vector &v) = default; Vector(int n) : Container>(n) {} Vector(int n, T t) : Container>(n, t) {} template Vector(Itr first, Itr last) : Container>(first, last) {} Vector(const std::initializer_list &v) : Container>(v) {} Vector(int n, Input &in) : Container>(n, in) {} Vector &operator+=(const Vector &v) { if (this->size() < v.size()) { this->resize(v.size()); } for (int i = 0; i < v.size(); ++i) { (*this)[i] += v[i]; } return *this; } Vector &operator+=(const T &v) { for (auto &i : *this) { i += v; } return *this; } Vector &operator-=(const Vector &v) { if (this->size() < v.size()) { this->resize(v.size()); } for (int i = 0; i < v.size(); ++i) { (*this)[i] -= v[i]; } return *this; } Vector &operator-=(const T &v) { for (auto &i : *this) { i -= v; } return *this; } Vector &operator*=(const Vector &v) { for (int i = 0; i < this->size(); ++i) { (*this)[i] *= v[i]; } return *this; } Vector &operator*=(const T &v) { for (auto &i : *this) { i *= v; } return *this; } Vector &operator/=(const Vector &v) { for (int i = 0; i < this->size(); ++i) { (*this)[i] /= v[i]; } return *this; } Vector &operator/=(const T &v) { for (auto &i : *this) { i /= v; } return *this; } Vector &operator%=(const Vector &v) { for (int i = 0; i < this->size(); ++i) { (*this)[i] %= v[i]; } return *this; } Vector &operator%=(const T &v) { for (auto &i : *this) { i %= v; } return *this; } Vector operator+(const Vector &v) const { return Vector(*this) += v; } Vector operator+(const T &v) const { return Vector(*this) += v; } Vector operator-(const Vector &v) const { return Vector(*this) -= v; } Vector operator-(const T &v) const { return Vector(*this) -= v; } Vector operator*(const Vector &v) const { return Vector(*this) *= v; } Vector operator*(const T &v) const { return Vector(*this) *= v; } Vector operator/(const Vector &v) const { return Vector(*this) /= v; } Vector operator/(const T &v) const { return Vector(*this) /= v; } Vector operator%(const Vector &v) const { return Vector(*this) %= v; } Vector operator%(const T &v) const { return Vector(*this) %= v; } bool operator<(const Vector &v) const { if (this->size() != v.size()) { return this->size() < v.size(); } for (int i = 0; i < this->size(); ++i) { if ((*this)[i] != v[i]) { return (*this)[i] < v[i]; } } return false; } Vector operator-() const { return *this * -1; } T inner_product(const Vector &v) const { return std::inner_product(this->begin(), this->end(), v.begin(), T(0)); } Vector &partial_sort(int k, bool reverse = false) { if (!reverse) { std::partial_sort(this->begin(), this->begin() + k, this->end()); } else { std::partial_sort(this->begin(), this->begin() + k, this->end(), std::greater()); } return *this; } Vector &sort() { std::sort(this->begin(), this->end()); return *this; } template Vector &sort(Function func) { std::sort(this->begin(), this->end(), func); return *this; } Vector &rsort() { std::sort(this->rbegin(), this->rend()); return *this; } Vector argsort() const { Vector> v; for (int i = 0; i < this->size(); ++i) { v.emplace_back((*this)[i], i); } v.sort(); auto f = [](const Tuple &t) { return t.template get<1>(); }; return v.transform(f); } Vector &nth_element(int n, bool reverse = false) { if (!reverse) { std::nth_element(this->begin(), this->begin() + n, this->end()); } else { std::nth_element(this->begin(), this->begin() + n, this->end(), std::greater()); } return *this; } Vector subvector(int a) const { return Vector(this->begin(), this->begin() + a); } Vector subvector(int a, int b) const { return Vector(this->begin() + a, this->begin() + b); } template auto transform(Function func) const { Vector res; std::transform(this->begin(), this->end(), std::back_inserter(res), func); return res; } Vector partial_sum() const { Vector res; std::partial_sum(this->begin(), this->end(), std::back_inserter(res)); return res; } template Vector partial_sum(Function func) const { Vector res; std::partial_sum(this->begin(), this->end(), std::back_inserter(res), func); return res; } Vector &reverse() { std::reverse(this->begin(), this->end()); return *this; } template int count_if(Function func) const { return std::count_if(this->begin(), this->end(), func); } Vector adjacent_difference() const { Vector res; std::adjacent_difference(this->begin(), this->end(), std::back_inserter(res)); return res; } T lower_bound(T t) const { return std::lower_bound(this->begin(), this->end(), t) - this->begin(); } T upper_bound(T t) const { return std::upper_bound(this->begin(), this->end(), t) - this->begin(); } T accumulate() const { return std::accumulate(this->begin(), this->end(), T()); } template S accumulate(S n, Function func) const { return std::accumulate(this->begin(), this->end(), n, func); } template static Vector makeVector(Int n) { return Vector(n); } template static Vector makeVector(Input &in, Int n) { return Vector(n, in); } template static auto makeVector(Input &in, Int n, Ints... ints) { Vector res; for (int i = 0; i < n; ++i) { res.emplace_back(makeVector(in, ints...)); } return res; } template static auto makeVector(Int n, Ints... ints) { Vector res; for (int i = 0; i < n; ++i) { res.emplace_back(makeVector(ints...)); } return res; } Vector &unique() { this->erase(std::unique(this->begin(), this->end()), this->end()); return *this; } bool next_permutation() { return std::next_permutation(this->begin(), this->end()); } Vector &rotate(int n) { std::rotate(this->begin(), this->begin() + n, this->end()); return *this; } Map countAll() const { Map res; for (const auto &i : *this) { ++res[i]; } return res; } T matmul(const T &a) const { return this->transform([&](const T &i) { return i.inner_product(a); }); } }; template Vector iota(int n, T m = 0) { Vector v(n); std::iota(v.begin(), v.end(), m); return v; } template void read(Vector &t, Vector &s) { for (int i = 0; i < t.size(); ++i) { t[i] = T(in); s[i] = S(in); } } template void read(Vector &t, Vector &s, Vector &u) { for (int i = 0; i < t.size(); ++i) { t[i] = T(in); s[i] = S(in); u[i] = U(in); } } template Vector operator+(const T &a, const Vector &b) { return b + a; } template Vector operator-(const T &a, const Vector &b) { return -b + a; } template Vector operator*(const T &a, const Vector &b) { return b * a; } /*************************/ /* cumulative_sum_2D.hpp */ /*************************/ template class CumulativeSum2D { private: struct RangeValue { int i, j, y, x; Value v; RangeValue(int i, int j, int y, int x, Value v) : i(i), j(j), y(y), x(x), v(v) {} }; Vector> val; Vector rangeValue; public: CumulativeSum2D() {} CumulativeSum2D(int n, int m) : val(n + 1, Vector(m + 1, Value(0))) {} template CumulativeSum2D(T v) { int n = v.size(); int m = v.front().size(); for (int i = 0; i < n + 1; ++i) { val.emplace_back(m + 1, Value(0)); } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { val[i + 1][j + 1] = val[i][j + 1] + val[i + 1][j] - val[i][j] + v[i][j]; } } } void add(int i, int j, Value v) { add(i, j, i + 1, j + 1, v); } void add(int i, int j, int y, int x, Value v) { rangeValue.emplace_back(i, j, y, x, v); } // [(i,j), (y,x)) Value sum(int i, int j, int y, int x) { if (!rangeValue.empty()) { int n = val.size() - 1; int m = val.front().size() - 1; for (int k = 0; k < 2; ++k) { for (int i = n - 1; i >= 0; --i) { for (int j = m - 1; j >= 0; --j) { val[i + 1][j + 1] -= val[i][j + 1] + val[i + 1][j] - val[i][j]; } } } for (const auto &v : rangeValue) { val[v.i + 1][v.j + 1] += v.v; if (v.y < n) { val[v.y + 1][v.j + 1] -= v.v; } if (v.x < m) { val[v.i + 1][v.x + 1] -= v.v; } if (v.y < n && v.x < m) { val[v.y + 1][v.x + 1] += v.v; } } for (int k = 0; k < 2; ++k) { for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { val[i + 1][j + 1] += val[i][j + 1] + val[i + 1][j] - val[i][j]; } } } rangeValue.clear(); } return val[y][x] - val[i][x] - val[y][j] + val[i][j]; } Value value(int i, int j) { return sum(i, j, i + 1, j + 1); } }; /************/ /* main.cpp */ /************/ int main() { int n(in), k(in); Vector x(n), y(n), hp(n); read(x, y, hp); CumulativeSum2D sum(1501, 1501); for (int i = 0; i < k; ++i) { int ax(in), ay(in), w(in), h(in), d(in); sum.add(ay + 500, ax + 500, ay + h + 501, ax + w + 501, d); } int res = 0; for (int i = 0; i < n; ++i) { res += max(0, hp[i] - sum.value(y[i] + 500, x[i] + 500)); } cout << res << endl; }