Submission

PPPPPPPPPPPPPPPPPPPP

Score: 100

User: sleepntsheep

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

Language: c

Time: 0.082 second

Submitted On: 2024-09-30 21:36:32

#pragma GCC optimize("O3,unroll-loops,inline")

#include<stdio.h>
#define N (1<<20)

int t[N*2],n,q,tt,o,p;
int qr(int l,int r){int z=0;for(l+=n,r+=n;l<r;l/=2,r/=2){if(l&1)z+=t[l++];if(r&1)z+=t[--r];}return z;}
void st(int p,int k){for(t[p+=n]=k;p/=2;)t[p]=t[p*2]+t[p*2+1];}

int main(){
    scanf("%d",&n);
    for(int i=0;i<n;++i)scanf("%d",t+i+n);
    for(int i=n;--i;)t[i]=t[i*2]+t[i*2+1];
    scanf("%d",&q);
    while(q--){
	scanf("%d",&tt);
	while(tt--)
	    scanf("%d%d",&o,&p),st(o,p);
	scanf("%d%d",&o,&p),printf("%d\n",qr(o,++p));
    }
}