# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153380 | fedoseevtimofey | Cake 3 (JOI19_cake3) | C++14 | 1267 ms | 107664 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;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 7;
const ll Inf = 5e18;
struct Node {
ll sum;
int cnt, L, R;
Node(int val) {
sum = val;
cnt = 1;
L = R = -1;
}
Node(ll sum, int cnt) : sum(sum), cnt(cnt), L(-1), R(-1) {}
Node(ll sum, int cnt, int L, int R) : sum(sum), cnt(cnt), L(L), R(R) {}
Node() : sum(0), cnt(0), L(-1), R(-1) {}
};
vector <Node> t;
int build(int l, int r) {
if (l == r) {
t.push_back(Node());
return (int)t.size() - 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |