結果

問題 No.3078 Difference Sum Query
ユーザー ooaiu
提出日時 2025-09-09 05:47:11
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,153 bytes
コンパイル時間 4,090 ms
コンパイル使用メモリ 302,628 KB
実行使用メモリ 11,684 KB
最終ジャッジ日時 2025-09-09 05:47:21
合計ジャッジ時間 9,855 ms
ジャッジサーバーID
（参考情報） 		judge / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 14 WA * 12
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
using u64 = uint64_t;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
inline constexpr int popcnt(u64 x) noexcept { return __builtin_popcountll(x); }
inline ll floor_div(ll a, ll b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
inline ll ceil_div(ll a, ll b) noexcept { return floor_div(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
template <class T> void dedup(std::vector<T>& v) { std::sort(std::begin(v), std::end(v)), v.erase(std::unique(std::begin(v), std::end(v)), std::end(v)); }
template <class F> ll bisect(ll ok, ll ng, const F& f) { while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; (f(mid) ? ok : ng) = mid; } return ok; }
template <class F> ld bisect_real(ld ok, ld ng, const F& f, int iter = 80) { while (iter--) { ld mid = (ok + ng) / 2.; (f(mid) ? ok : ng) = mid; } return ok; }
inline void SCAN() {}
template <class H, class... T> inline void SCAN(H& h, T&... t) { std::cin >> h, SCAN(t...); }
#define INT(...) int __VA_ARGS__; SCAN(__VA_ARGS__)
#define LL(...) long long __VA_ARGS__; SCAN(__VA_ARGS__)
#define LD(...) long double __VA_ARGS__; SCAN(__VA_ARGS__)
#define STR(...) std::string __VA_ARGS__; SCAN(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; SCAN(__VA_ARGS__)
#define VEC(type, name, size) std::vector<type> name(size); for (int i = 0; i < (int)size; i++) SCAN(name[i]);
#define VV(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w)); for (int i = 0; i < (int)h; i++) for (int j = 0; j < (int)w; j++) SCAN(name[i][j]);
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define len(x) (long long)(size(x))
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

#include <atcoder/modint>
using mint = atcoder::modint998244353;
#include <atcoder/fenwicktree>
struct Mo {
    int B;
    std::vector<int> left, right, order;
    Mo(int N, int Q) : order(Q) {
        B = std::max<int>(1, 1.0 * N / std::max<double>(1.0, std::sqrt(Q * 2.0 / 3.0)));
        left.reserve(Q), right.reserve(Q);
        for (int i = 0; i < Q; i++) order[i] = i;
    }
    void insert(int l, int r) {
        left.push_back(l);
        right.push_back(r);
    }
    template <class AL, class AR, class DL, class DR, class REM>
    void run(const AL& add_left, const AR& add_right, const DL& delete_left, const DR& delete_right, const REM& rem) {
        sort(begin(order), end(order), [&](int i, int j) -> bool {
            int iblock = left[i] / B, jblock = left[j] / B;
            if (iblock != jblock) return iblock < jblock;
            if (iblock & 1) return right[i] < right[j];
            return right[i] > right[j];
        });
        int nl = 0, nr = 0;
        for (int qi : order) {
            while (nl > left[qi]) add_left(--nl);
            while (nr < right[qi]) add_right(nr++);
            while (nl < left[qi]) delete_left(nl++);
            while (nr > right[qi]) delete_right(--nr);
            rem(qi);
        }
    }
};

void run_case() {
    INT(N, Q);
    VEC(int, A, N);
    vl L(Q), R(Q), X(Q);
    vl cc{all(A)};
    Mo mo(N, Q);
    rep(i, Q) {
        cin >> L[i] >> R[i] >> X[i], cc.pb(X[i]), L[i]--;
        mo.insert(L[i], R[i]);
    }
    dedup(cc);
    atcoder::fenwick_tree<ll> fw(len(cc)), cnt(len(cc));
    vector<int> ItoJ(N), QtoJ(Q);
    rep(i, N) ItoJ[i] = lower_bound(all(cc), A[i]) - cc.begin();
    rep(i, Q) QtoJ[i] = lower_bound(all(cc), X[i]) - cc.begin();
    auto add = [&](int i) {
        int j = ItoJ[i];
        fw.add(j, A[i]);
        cnt.add(j, 1);
    };
    auto erase = [&](int i) {
        int j = ItoJ[i];
        fw.add(j, -A[i]);
        cnt.add(j, -1);
    };
    vl ans(Q);
    auto f = [&](int i) {
        int j = QtoJ[i];
        ll Lc = cnt.sum(0, j), Rc = cnt.sum(j, len(cc));
        ans[i] = Lc * X[i] - fw.sum(0, j) + fw.sum(j, len(cc)) - Rc * X[i];
    };
    mo.run(add, add, erase, erase, f);
    rep(i, Q) cout << ans[i] << "\n";
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}
0