結果
| 問題 | No.3078 Difference Sum Query |
| コンテスト | |
| ユーザー |
 rin204
|
| 提出日時 | 2025-03-28 21:20:08 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 19,708 bytes |
| コンパイル時間 | 4,547 ms |
| コンパイル使用メモリ | 299,920 KB |
| 実行使用メモリ | 72,800 KB |
| 最終ジャッジ日時 | 2025-03-28 21:20:29 |
| 合計ジャッジ時間 | 20,019 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 9 WA * 5 RE * 12 |
ソースコード
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE
#include <bits/stdc++.h>
using namespace std;
namespace templates {
// type
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on
// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)
// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on
// const value
const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;
const double PI = acos(-1);
// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)
// function
vector<char> stoc(string &S) {
int n = S.size();
vector<char> ret(n);
for (int i = 0; i < n; i++) ret[i] = S[i];
return ret;
}
string ctos(vector<char> &S) {
int n = S.size();
string ret = "";
for (int i = 0; i < n; i++) ret += S[i];
return ret;
}
template <class T>
auto min(const T &a) {
return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
return (a > r ? r : a < l ? l : a);
}
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);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
auto b = clamp(a, l, r);
return (a != b ? a = b, 1 : 0);
}
template <typename T>
T sum(vector<T> &A) {
T tot = 0;
for (auto a : A) tot += a;
return tot;
}
template <typename T>
vector<T> compression(vector<T> X) {
sort(all(X));
X.erase(unique(all(X)), X.end());
return X;
}
// input and output
namespace io {
// __int128_t
std::istream &operator>>(std::istream &is, __int128_t &value) {
std::string str;
is >> str;
value = 0;
int sign = 1;
for (size_t i = 0; i < str.size(); i++) {
if (i == 0 && str[i] == '-') {
sign = -1;
continue;
}
value = value * 10 + str[i] - '0';
}
value *= sign;
return is;
}
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;
}
// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
for (auto &a : A) is >> a;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << ' ';
}
return os;
}
// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
for (auto &a : A) is >> a;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << endl;
}
return os;
}
// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
is >> A.first >> A.second;
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
os << A.first << ' ' << A.second;
return os;
}
// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
is >> A[i];
}
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << endl;
}
return os;
}
// tuple
template <typename T, size_t N>
struct TuplePrint {
static ostream &print(ostream &os, const T &t) {
TuplePrint<T, N - 1>::print(os, t);
os << ' ' << get<N - 1>(t);
return os;
}
};
template <typename T>
struct TuplePrint<T, 1> {
static ostream &print(ostream &os, const T &t) {
os << get<0>(t);
return os;
}
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
return os;
}
// io functions
void FLUSH() {
cout << flush;
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(Tail)) cout << spa;
print(std::forward<Tail>(tail)...);
}
template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
int n = A.size();
for (int i = 0; i < n; i++) {
cout << A[i];
if (i != n - 1) cout << sep;
}
cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
cout << A << end;
}
template <typename T>
void prispa(T A) {
priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
if (f)
print(A);
else
print(B);
return f;
}
template <class... T>
void inp(T &...a) {
(cin >> ... >> a);
}
} // namespace io
using namespace io;
// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<int>> edges(n, vector<int>());
for (int i = 0; i < m; i++) {
INT(u, v);
u -= indexed;
v -= indexed;
edges[u].push_back(v);
if (!direct) edges[v].push_back(u);
}
return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
return read_edges(n, n - 1, false, indexed);
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
for (int i = 0; i < m; i++) {
INT(u, v);
T w;
inp(w);
u -= indexed;
v -= indexed;
edges[u].push_back({v, w});
if (!direct) edges[v].push_back({u, w});
}
return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
return read_wedges<T>(n, n - 1, false, indexed);
}
// yes / no
namespace yesno {
// yes
inline bool yes(bool f = true) {
cout << (f ? "yes" : "no") << endl;
return f;
}
inline bool Yes(bool f = true) {
cout << (f ? "Yes" : "No") << endl;
return f;
}
inline bool YES(bool f = true) {
cout << (f ? "YES" : "NO") << endl;
return f;
}
// no
inline bool no(bool f = true) {
cout << (!f ? "yes" : "no") << endl;
return f;
}
inline bool No(bool f = true) {
cout << (!f ? "Yes" : "No") << endl;
return f;
}
inline bool NO(bool f = true) {
cout << (!f ? "YES" : "NO") << endl;
return f;
}
// possible
inline bool possible(bool f = true) {
cout << (f ? "possible" : "impossible") << endl;
return f;
}
inline bool Possible(bool f = true) {
cout << (f ? "Possible" : "Impossible") << endl;
return f;
}
inline bool POSSIBLE(bool f = true) {
cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return f;
}
// impossible
inline bool impossible(bool f = true) {
cout << (!f ? "possible" : "impossible") << endl;
return f;
}
inline bool Impossible(bool f = true) {
cout << (!f ? "Possible" : "Impossible") << endl;
return f;
}
inline bool IMPOSSIBLE(bool f = true) {
cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return f;
}
// Alice Bob
inline bool Alice(bool f = true) {
cout << (f ? "Alice" : "Bob") << endl;
return f;
}
inline bool Bob(bool f = true) {
cout << (f ? "Bob" : "Alice") << endl;
return f;
}
// Takahashi Aoki
inline bool Takahashi(bool f = true) {
cout << (f ? "Takahashi" : "Aoki") << endl;
return f;
}
inline bool Aoki(bool f = true) {
cout << (f ? "Aoki" : "Takahashi") << endl;
return f;
}
} // namespace yesno
using namespace yesno;
} // namespace templates
using namespace templates;
//////// https://ei1333.github.io/library/structure/wavelet/wavelet-matrix-rectangle-sum.hpp
#line 1 "structure/wavelet/succinct-indexable-dictionary.hpp"
/**
* @brief Succinct Indexable Dictionary(完備辞書)
*/
struct SuccinctIndexableDictionary {
size_t length;
size_t blocks;
vector<unsigned> bit, sum;
SuccinctIndexableDictionary() = default;
SuccinctIndexableDictionary(size_t length) : length(length), blocks((length + 31) >> 5) {
bit.assign(blocks, 0U);
sum.assign(blocks, 0U);
}
void set(int k) {
bit[k >> 5] |= 1U << (k & 31);
}
void build() {
sum[0] = 0U;
for (int i = 1; i < blocks; i++) {
sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);
}
}
bool operator[](int k) {
return (bool((bit[k >> 5] >> (k & 31)) & 1));
}
int rank(int k) {
return (sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));
}
int rank(bool val, int k) {
return (val ? rank(k) : k - rank(k));
}
};
#line 2 "structure/wavelet/wavelet-matrix-rectangle-sum.hpp"
/*
* @brief Wavelet Matrix Rectangle Sum
*
*/
template <typename T, int MAXLOG, typename D>
struct WaveletMatrixRectangleSum {
size_t length;
SuccinctIndexableDictionary matrix[MAXLOG];
vector<D> ds[MAXLOG];
int mid[MAXLOG];
WaveletMatrixRectangleSum() = default;
WaveletMatrixRectangleSum(const vector<T> &v, const vector<D> &d) : length(v.size()) {
assert(v.size() == d.size());
vector<int> l(length), r(length), ord(length);
iota(begin(ord), end(ord), 0);
for (int level = MAXLOG - 1; level >= 0; level--) {
matrix[level] = SuccinctIndexableDictionary(length + 1);
int left = 0, right = 0;
for (int i = 0; i < length; i++) {
if (((v[ord[i]] >> level) & 1)) {
matrix[level].set(i);
r[right++] = ord[i];
} else {
l[left++] = ord[i];
}
}
mid[level] = left;
matrix[level].build();
ord.swap(l);
for (int i = 0; i < right; i++) {
ord[left + i] = r[i];
}
ds[level].resize(length + 1);
ds[level][0] = D();
for (int i = 0; i < length; i++) {
ds[level][i + 1] = ds[level][i] + d[ord[i]];
}
}
}
pair<int, int> succ(bool f, int l, int r, int level) {
return {matrix[level].rank(f, l) + mid[level] * f, matrix[level].rank(f, r) + mid[level] * f};
}
// count d[i] s.t. (l <= i < r) && (v[i] < upper)
D rect_sum(int l, int r, T upper) {
D ret = 0;
for (int level = MAXLOG - 1; level >= 0; level--) {
bool f = ((upper >> level) & 1);
if (f) ret += ds[level][matrix[level].rank(false, r)] - ds[level][matrix[level].rank(false, l)];
tie(l, r) = succ(f, l, r, level);
}
return ret;
}
D rect_sum(int l, int r, T lower, T upper) {
return rect_sum(l, r, upper) - rect_sum(l, r, lower);
}
};
template <typename T, int MAXLOG, typename D>
struct CompressedWaveletMatrixRectangleSum {
WaveletMatrixRectangleSum<int, MAXLOG, D> mat;
vector<T> ys;
CompressedWaveletMatrixRectangleSum(const vector<T> &v, const vector<D> &d) : ys(v) {
sort(begin(ys), end(ys));
ys.erase(unique(begin(ys), end(ys)), end(ys));
vector<int> t(v.size());
for (int i = 0; i < v.size(); i++) t[i] = get(v[i]);
mat = WaveletMatrixRectangleSum<int, MAXLOG, D>(t, d);
}
inline int get(const T &x) {
return lower_bound(begin(ys), end(ys), x) - begin(ys);
}
D rect_sum(int l, int r, T upper) {
return mat.rect_sum(l, r, get(upper));
}
D rect_sum(int l, int r, T lower, T upper) {
return mat.rect_sum(l, r, get(lower), get(upper));
}
};
void solve() {
LL(n, Q);
VEC(ll, A, n);
CompressedWaveletMatrixRectangleSum<ll, 40, ll> wm(A, A);
vec(ll, B, n, 1);
CompressedWaveletMatrixRectangleSum<ll, 40, ll> wm2(A, B);
ll ma = max(A) + 1;
fori(Q) {
INT(l, r, x);
l--;
ll ans = 0;
ans += wm2.rect_sum(l, r, x) * x - wm.rect_sum(l, r, x);
ans += wm.rect_sum(l, r, x, ma + 1) - wm2.rect_sum(l, r, x, ma + 1) * x;
print(ans);
}
}
int main() {
#ifndef INTERACTIVE
std::cin.tie(0)->sync_with_stdio(0);
#endif
// std::cout << std::fixed << std::setprecision(12);
int t;
t = 1;
// std::cin >> t;
while (t--) solve();
return 0;
}
// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// //////// https://ei1333.github.io/library/structure/wavelet/wavelet-matrix-rectangle-sum.hpp
//
// #line 1 "structure/wavelet/succinct-indexable-dictionary.hpp"
// /**
// * @brief Succinct Indexable Dictionary(完備辞書)
// */
// struct SuccinctIndexableDictionary {
// size_t length;
// size_t blocks;
// vector<unsigned> bit, sum;
//
// SuccinctIndexableDictionary() = default;
//
// SuccinctIndexableDictionary(size_t length) : length(length), blocks((length + 31) >> 5) {
// bit.assign(blocks, 0U);
// sum.assign(blocks, 0U);
// }
//
// void set(int k) {
// bit[k >> 5] |= 1U << (k & 31);
// }
//
// void build() {
// sum[0] = 0U;
// for (int i = 1; i < blocks; i++) {
// sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);
// }
// }
//
// bool operator[](int k) {
// return (bool((bit[k >> 5] >> (k & 31)) & 1));
// }
//
// int rank(int k) {
// return (sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));
// }
//
// int rank(bool val, int k) {
// return (val ? rank(k) : k - rank(k));
// }
// };
// #line 2 "structure/wavelet/wavelet-matrix-rectangle-sum.hpp"
//
// /*
// * @brief Wavelet Matrix Rectangle Sum
// *
// */
// template <typename T, int MAXLOG, typename D>
// struct WaveletMatrixRectangleSum {
// size_t length;
// SuccinctIndexableDictionary matrix[MAXLOG];
// vector<D> ds[MAXLOG];
// int mid[MAXLOG];
//
// WaveletMatrixRectangleSum() = default;
//
// WaveletMatrixRectangleSum(const vector<T> &v, const vector<D> &d) : length(v.size()) {
// assert(v.size() == d.size());
// vector<int> l(length), r(length), ord(length);
// iota(begin(ord), end(ord), 0);
// for (int level = MAXLOG - 1; level >= 0; level--) {
// matrix[level] = SuccinctIndexableDictionary(length + 1);
// int left = 0, right = 0;
// for (int i = 0; i < length; i++) {
// if (((v[ord[i]] >> level) & 1)) {
// matrix[level].set(i);
// r[right++] = ord[i];
// } else {
// l[left++] = ord[i];
// }
// }
// mid[level] = left;
// matrix[level].build();
// ord.swap(l);
// for (int i = 0; i < right; i++) {
// ord[left + i] = r[i];
// }
// ds[level].resize(length + 1);
// ds[level][0] = D();
// for (int i = 0; i < length; i++) {
// ds[level][i + 1] = ds[level][i] + d[ord[i]];
// }
// }
// }
//
// pair<int, int> succ(bool f, int l, int r, int level) {
// return {matrix[level].rank(f, l) + mid[level] * f, matrix[level].rank(f, r) + mid[level] * f};
// }
//
// // count d[i] s.t. (l <= i < r) && (v[i] < upper)
// D rect_sum(int l, int r, T upper) {
// D ret = 0;
// for (int level = MAXLOG - 1; level >= 0; level--) {
// bool f = ((upper >> level) & 1);
// if (f) ret += ds[level][matrix[level].rank(false, r)] - ds[level][matrix[level].rank(false, l)];
// tie(l, r) = succ(f, l, r, level);
// }
// return ret;
// }
//
// D rect_sum(int l, int r, T lower, T upper) {
// return rect_sum(l, r, upper) - rect_sum(l, r, lower);
// }
// };
//
// template <typename T, int MAXLOG, typename D>
// struct CompressedWaveletMatrixRectangleSum {
// WaveletMatrixRectangleSum<int, MAXLOG, D> mat;
// vector<T> ys;
//
// CompressedWaveletMatrixRectangleSum(const vector<T> &v, const vector<D> &d) : ys(v) {
// sort(begin(ys), end(ys));
// ys.erase(unique(begin(ys), end(ys)), end(ys));
// vector<int> t(v.size());
// for (int i = 0; i < v.size(); i++) t[i] = get(v[i]);
// mat = WaveletMatrixRectangleSum<int, MAXLOG, D>(t, d);
// }
//
// inline int get(const T &x) {
// return lower_bound(begin(ys), end(ys), x) - begin(ys);
// }
//
// D rect_sum(int l, int r, T upper) {
// return mat.rect_sum(l, r, get(upper));
// }
//
// D rect_sum(int l, int r, T lower, T upper) {
// return mat.rect_sum(l, r, get(lower), get(upper));
// }
// };
//
// void solve() {
// LL(n, Q);
// VEC(ll, A, n);
// CompressedWaveletMatrixRectangleSum<ll, 40, ll> wm(A, A);
// vec(ll, B, n, 1);
// CompressedWaveletMatrixRectangleSum<ll, 40, ll> wm2(A, B);
// ll ma = max(A) + 1;
// fori(Q) {
// INT(l, r, x);
// l--;
// ll ans = 0;
// ans += wm2.rect_sum(l, r, x) * x - wm.rect_sum(l, r, x);
// ans += wm.rect_sum(l, r, x, ma + 1) - wm2.rect_sum(l, r, x, ma + 1) * x;
// print(ans);
// }
// }
//
// int main() {
// #ifndef INTERACTIVE
// std::cin.tie(0)->sync_with_stdio(0);
// #endif
// // std::cout << std::fixed << std::setprecision(12);
// int t;
// t = 1;
// // std::cin >> t;
// while (t--) solve();
// return 0;
// }