#1170564 (C++17) No.877 Range ReLU Query

• 問題: No.877 Range ReLU Query
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-07-08 02:26:17
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 187 ms / 2,000 ms
• コード長: 3,933 bytes
• コンパイル時間: 2,483 ms
• コンパイル使用メモリ: 225,052 KB
• 実行使用メモリ: 12,024 KB
• 最終ジャッジ日時: 2026-07-08 02:26:28
• 合計ジャッジ時間: 7,118 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge3_0

ファイルパターン	結果
sample	AC * 1
other	AC * 20

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> a(N);
    rep(i, N) cin >> a[i];
    vector<ll> l(Q);
    vector<ll> r(Q);
    vector<ll> x(Q);
    for (ll i = 0; i < Q; i++){
        ll t;
        cin >> t >> l[i] >> r[i] >> x[i];
        l[i]--;
        r[i]--;
    }
    vector<pll> event;
    for (ll i = 0; i < N; i++){
        event.push_back(make_pair(a[i], i));
    }
    for (ll i = 0; i < Q; i++){
        event.push_back(make_pair(x[i], i + N));
    }

    sort(all(event));
    reverse(all(event));

    fenwick_tree<ll> bit1(N);
    fenwick_tree<ll> bit2(N);

    vector<ll> ans(Q);

    for (ll i = 0; i < N + Q; i++){
        ll id = event[i].second;
        // debug_out(event[i].first, id);
        if (id < N){
            bit1.add(id, 1);
            bit2.add(id, a[id]);
        }
        else{
            id -= N;
            ll ax = bit2.sum(l[id], r[id] + 1);
            ll bx = bit1.sum(l[id], r[id] + 1);
            ans[id] = ax - bx * x[id];
        }
    }
    for (ll i = 0; i < Q; i++){
        cout << ans[i] << endl;
    }
}