# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
749841 | keta_tsimakuridze | Cake 3 (JOI19_cake3) | C++14 | 746 ms | 129236 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 f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int t, val[N],m;
pii a[N];
int ans = -1e18;
vector<int> x;
vector<int> c[4 * N], sum[4 * N];
void build(int u, int l, int r, vector<int> v) {
if(l == r) return;
int mid = (l + r) / 2;
vector<int> vl, vr;
c[u].resize((int)v.size());
sum[u].resize((int)v.size());
for(int i = 0; i < v.size(); i++) {
if(i) c[u][i] = c[u][i - 1], sum[u][i] = sum[u][i - 1];
if(v[i] <= mid) vl.push_back(v[i]), ++c[u][i], sum[u][i] += val[v[i]];
else vr.push_back(v[i]);
}
build(2 * u, l, mid, vl);
build(2 * u + 1, mid + 1, r, vr);
}
int get(int u, int l, int r, int L, int R, int k) {
if(l == r) return k * val[l];
int mid = (l + r) / 2;
if(c[u][R] - (L > 0) * c[u][L - 1] >= k) return get(2 * u, l, mid, (L > 0 ? c[u][L - 1] : 0), c[u][R] - 1, k);
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... |