# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102679 | ihdignite | Cake 3 (JOI19_cake3) | C++14 | 1014 ms | 10592 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 ll long long
const int mxN=2e5;
int n, m, p[mxN];
array<ll, 2> a[mxN], q[mxN], ft[mxN+1];
ll ans=-1e18;
array<ll, 2> operator+(array<ll, 2> a, array<ll, 2> b) {
return {a[0]+b[0], a[1]+b[1]};
}
void upd(int i, array<ll, 2> x) {
for(++i; i<=n; i+=i&-i)
ft[i]=ft[i]+x;
}
ll sk(int k) {
array<ll, 2> r{};
for(int i=17, x=0; ~i; --i) {
if(x+(1<<i)<=n&&(r+ft[x+(1<<i)])[1]<=k) {
x+=1<<i;
r=r+ft[x];
}
}
return r[0];
}
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... |