# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774776 | vjudge1 | Addk (eJOI21_addk) | C++17 | 81 ms | 5216 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
const int NM = 1e6, KM = 10;
int N, K, Q, a[NM+5];
int bit[NM+5], bit2[NM+5];
int idx[KM+5], b[NM+5];
void update(int bit[NM+5], int p, int v){
while (p <= N){
bit[p] += v;
p += p & (-p);
}
}
int get(int bit[NM+5], int p){
int res = 0;
while (p > 0){
res += bit[p];
p -= p & (-p);
}
return res;
}
void modify(){
for (int i = 1; i < K; i++)
b[idx[i]] = a[idx[i+1]];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |