# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69440 | thebes | Sterilizing Spray (JOI15_sterilizing) | C++14 | 311 ms | 7332 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 <bits/stdc++.h>
using namespace std;
const int MN = 1e5+5;
typedef long long ll;
ll bit[MN], arr[MN], N, M, K, i, x, y;
set<ll> s;
void upd(ll p,ll d){for(;p<=N;p+=p&-p)bit[p]+=d;}
ll qu(ll p){ll s=0;for(;p;p-=p&-p)s+=bit[p]; return s;}
int main(){
scanf("%lld%lld%lld",&N,&M,&K);
for(i=1;i<=N;i++){
scanf("%lld",&arr[i]);
upd(i, arr[i]);
if(arr[i]) s.insert(i);
}
for(;M;M--){
scanf("%lld%lld%lld",&i,&x,&y);
if(i==1){
upd(x, y-arr[x]); arr[x] = y;
s.insert(x);
}
else if(i==2&&K!=1){
auto it = s.lower_bound(x);
for(;it!=s.end()&&*it<=y;){
upd(*it,(arr[*it]/K)-arr[*it]);
arr[*it]=arr[*it]/K;
if(!arr[*it]){
auto it2 = it; it++;
s.erase(it2);
}
else it++;
}
}
else printf("%lld\n",qu(y)-qu(x-1));
}
return 0;
}
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... |