# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175789 | bahaktl | Addk (eJOI21_addk) | C++20 | 1352 ms | 4788 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int inf=1e16;
const int N=2e5+10;
const int mod=1e9+7;
int t[N*4],a[N];
void update(int v,int tl,int tr,int pos) {
if(tl==tr) {
t[v]=a[tl];
return;
}
int m=(tl+tr)/2;
if(pos<=m) update(v*2,tl,m,pos);
else update(v*2+1,m+1,tr,pos);
t[v]=t[v*2]+t[v*2+1];
}
int get(int v,int tl,int tr,int l,int r) {
if(tl>=l && tr<=r) return t[v];
if(l>tr || r<tl) return 0;
int m=(tl+tr)/2;
return get(v*2,tl,m,l,r)+get(v*2+1,m+1,tr,l,r);
}
signed main () {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |