# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580839 | penguin133 | Addk (eJOI21_addk) | C++14 | 429 ms | 22164 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;
#define int long long
#define fi first
#define se second
#define pi pair<int, int>
#define pii pair<int, pair<int, int> >
int P[200005], P2[200005], A[200005], S[200005];
int n,k;
struct node{
int s,e,m,val,val2,val3;
node *l, *r;
node(int _s, int _e){
val = val2 = val3 = 0;
s = _s, e = _e, m = (s + e)/2;
if(s != e){
l = new node(s, m);
r = new node(m+1, e);
}
}
void update(int p, int v){
if(s == e)val = v, val2 = s*v, val3 = (n-s+1)*v;
else{
if(p <= m)l->update(p,v);
else r->update(p,v);
val = l->val + r->val;
val2 = l->val2 + r->val2;
val3 = l->val3 + r->val3;
}
}
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... |