# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
576231 | mircea_007 | Addk (eJOI21_addk) | C++17 | 157 ms | 9064 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.
// This program was written on 12.06.2022
// for problem addk
// by Mircea Rebengiuc
#include <stdio.h>
#include <ctype.h>
#define ll long long
#define MAXN 131072
#define MAXK 10
int n;
int v[MAXN];
class AINT {
private:
struct Node {
ll progresion;// sum{ i * v[i] }
ll sum;// sum{ v[i] }
} aint[MAXN * 2];
int aintn;
void _update( int root, int rl, int rr, int index, int delta ){
int mij;
while( rl != index || rr != index ){
aint[root].sum += delta;
aint[root].progresion += ((long long)delta) * (index - rl);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |