Submission #74962610

---

Source Code Expand

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

struct pair_hash {
    size_t operator()(const pair<int,int>& p) const {
        return hash<int>()(p.first) ^ (hash<int>()(p.second) << 1);
    }
};

int main(){
    int n, q;
    cin>>n>>q;

    vector<long long int> a(n);
    for(int i=0; i<n; i++){
        cin>>a[i];
    }

    unordered_map<pair<int, int>, vector<int>, pair_hash> mp;

    for(int i=0; i<q; i++){
        int type;
        cin>>type;

        if(type == 2){
            int p;
            cin>>p;
            long long t = 0;
            for(auto it: mp){
                int l = it.first.first;
                int r = it.first.second;

                if(p >= l && p <= r){
                    for(auto idx: it.second){
                        t += idx;
                    }
                }
            }

            cout<<a[p-1] + t<<endl;
        }
        else{
            int l, r, x;
            cin>>l>>r>>x;
            mp[{l, r}].push_back(x);
        }

    }


}

Submission Info

Judge Result