Submission

PPTTTTTTTTTTTTTTTTTT

Score: 10

User: njoop

Problemset: ผลบวก (ยาก)

Language: cpp

Time: 0.183 second

Submitted On: 2024-11-30 22:28:33

#include <bits/stdc++.h>
using namespace std;

int n, q, c, id, va;
int seg[3000010];

void update(int l, int r, int idx, int val, int node) {
    if(l == r) {
        seg[node] = val;
        return;
    }
    int mid = (l+r)>>1;
    if(idx <= mid) update(l, mid, idx, val, node*2);
    else update(mid+1, r, idx, val, node*2+1);
    seg[node] = seg[node*2] + seg[node*2+1];
}

int query(int l, int r, int ql, int qr, int node) {
    if(l > qr || r < ql) return 0;
    if(l >= ql && r <= qr) return seg[node];
    int mid = (l+r)>>1;
    return query(l, mid, ql, qr, node*2) + query(mid+1, r, ql, qr, node*2+1);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1; i<=n; i++) {
        cin >> va;
        update(1, n, i, va, 1);
    }
    cin >> q;
    while(q--) {
        int t;
        cin >> t;
        while(t--) {
            cin >> va >> id;
            update(1, n, va+1, id, 1);
        }
        cin >> id >> va;
        cout << query(1, n, id+1, va+1, 1) << "\n";
    }
    return 0;
}