# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796988 | ThMinh_ | Cake 3 (JOI19_cake3) | C++14 | 825 ms | 206280 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 forin(i, a, b) for(int i = a; i <= b; ++i)
#define ll long long
using namespace std;
const int N = 2e5 + 10;
int n, m;
ll ans, inf = 2e18;
ll s[N];
struct it {
int cnt;
ll sum;
it* lf;
it* rt;
it() : cnt(), sum(), lf(), rt() { }
void build(int f = 1, int l = n) {
if(f == l) return;
int mid = f + l >> 1;
lf = new it();
rt = new it();
lf -> build(f, mid);
rt -> build(mid + 1, l);
}
void up(int i, ll val, int f = 1, int l = n) {
if(f == l) {
cnt = 1;
sum = val;
return;
}
int mid = f + l >> 1;
if(i <= mid) {
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... |