# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530315 | fhvirus | Cake 3 (JOI19_cake3) | C++17 | 2249 ms | 17076 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;
struct Lisan: vector<int> {
void done() { sort(begin(), end()); erase(unique(begin(), end()), end()); }
const int operator () (const int& v) const { return lower_bound(begin(), end(), v) - begin(); }
};
struct DS {
int N, M, lp, rp;
vector<int> val;
Lisan lisan;
vector<int64_t> sum;
vector<int> cnt;
DS (int _M): M(_M), val(1, 0) {}
void add(const int& v) { lisan.emplace_back(v); val.emplace_back(v); }
void build() {
lisan.done();
N = lisan.size();
lp = 1; rp = 0;
sum.assign(N * 4, 0ll);
cnt.assign(N * 4, 0);
}
void modify(int i, int l, int r, int p, int v) {
if (l + 1 == r) {
sum[i] += lisan[p] * v;
cnt[i] += v;
return;
}
int m = (l + r) / 2;
if (p < m) modify(i * 2, l, m, p, v);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |