Submission

Score: 10

User: qweqwe

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

Language: cpp

Time: 0.116 second

Submitted On: 2025-10-21 20:32:04

#include <bits/stdc++.h>
#define speed cin.tie(0)->sync_with_stdio(0)
#define ll long long
#define pii pair<int,int>
using namespace std;

int main(){
	speed;
	int n;cin >> n;
	vector<ll> num(n),qs(n+1);
	for (int i=1;i<=n;i++){
		cin >> num[i-1];
		qs[i]=qs[i-1]+num[i-1];
	}int q;cin >> q;
	vector<int> temp(n,0);
	unordered_set<int> idx;
	for (int i=0;i<q;i++){
		int t;cin >> t;
		for (int j=0;j<t;j++){
			int a,b;cin >> a >> b;
			temp[a]=b-num[a];
			idx.insert(a);
		}
		ll add=0;
		int x,y;cin >> x >> y;
		for (int j:idx){
			if (j>=x && j<=y)add+=temp[j];
		}
		cout << qs[y+1]-qs[x]+add << "\n";
	}
	return 0;
}