# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77969 | nxteru | Sterilizing Spray (JOI15_sterilizing) | C++14 | 139 ms | 30560 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll n,q,k,seg[1<<18];
void up(int a,ll x){
a+=(1<<17)-1;
seg[a]=x;
while(a>0){
a=(a-1)/2;
seg[a]=seg[a*2+1]+seg[a*2+2];
}
}
ll sum(int a,int b,int l,int r,int o){
if(r<a||b<l)return 0;
if(a<=l&&r<=b)return seg[o];
return sum(a,b,l,(l+r-1)/2,o*2+1)+sum(a,b,(l+r+1)/2,r,o*2+2);
}
int main(void){
scanf("%lld%lld%lld",&n,&q,&k);
for(int i=0;i<n;i++){
ll a;
scanf("%lld",&a);
up(i,a);
}
while(q){
ll s,a,b;
scanf("%lld%lld%lld",&s,&a,&b);
if(s==1){
up(a-1,b);
}
if(s==3){
printf("%lld\n",sum(a-1,b-1,0,(1<<17)-1,0));
}
q--;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |