# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1142715 | VMaksimoski008 | Cake 3 (JOI19_cake3) | C++20 | 1 ms | 1864 KiB |
#include <bits/stdc++.h>
#define ar array
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 5;
vector<int> comp;
struct node {
int cnt = 0;
ll sum = 0;
node *l, *r;
node(int c=0, ll v=0) : cnt(c), sum(v), l(nullptr), r(nullptr) {}
node(node *l, node *r) : l(l), r(r) {
if(l) sum += l->sum, cnt += l->cnt;
if(r) sum += r->sum, cnt += r->cnt;
}
};
node *build(int l, int r) {
if(l == r) return new node(0, 0);
int tm = (l + r) / 2;
return new node(build(l, tm), build(tm+1, r));
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |