# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502579 | uncripted | Addk (eJOI21_addk) | C++11 | 313 ms | 7744 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;
long long pre[100005];
long long n,k;
long long b1[100005],b2[100005];
void update(long long bit[], long long v, long long x){
while(v<=n){
bit[v]+=x;
v+=v&(-v);
}
}
void up(long long l, long long r, long long x){
update(b1, l, x);
update(b1, r+1, -x);
update(b2, l, (l-1)*x);
update(b2, r+1, -r*x);
}
long long presum(long long bit[], long long v){
long long s=0;
while(v>0){
s+=bit[v];
v-=v&(-v);
}
return s;
}
long long sum(long long l,long long r){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |