# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775246 | burythelightdeepwithin | Addk (eJOI21_addk) | C++14 | 1607 ms | 8400 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>
typedef long long ll;
using namespace std;
const ll maxn=200005;
ll n,m,k;
ll a[maxn];
ll tree[4*maxn];
void make_tree(ll pos, ll low, ll high)
{
if(low==high)
{
tree[pos]=a[low];
return;
}
ll mid=(low+high)/2;
make_tree(2*pos+1,low,mid);
make_tree(2*pos+2,mid+1,high);
tree[pos]=(tree[2*pos+1]+tree[2*pos+2]);
}
void update(ll pos, ll low, ll high, ll query, ll up)
{
if (query>high || query<low)
{
return;
}
if (low==high)
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... |