# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475550 | NachoLibre | Addk (eJOI21_addk) | C++17 | 138 ms | 4968 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>
#define ll long long
#define sz(x) ((int)x.size())
using namespace std;
struct order {
order(int _n) {
f[0].resize(_n + 1);
f[1].resize(_n + 1);
x[0].resize(_n + 1);
x[1].resize(_n + 1);
}
private:
vector<long long> x[2], f[2];
void add(int i, long long y, int z) {
x[z][i] += y;
while(i < sz(f[z])) {
f[z][i] += y;
i += i & -i;
}
}
long long psum(int r, int z) {
long long x = 0;
while(r > 0) {
x += f[z][r];
r -= r & -r;
}
return x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |