# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172238 | jill | Cake 3 (JOI19_cake3) | C++20 | 124 ms | 219684 KiB |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
using ll = long long;
using pii = pair<ll, ll>;
const ll maxn = 4e6 + 5, inf = 1e9, oo = 1e18;
ll n, m, dp[2][maxn];
pii a[maxn];
struct WT
{
struct node
{
int l, r;
vector<ll> x;
vector<ll> s;
} t[maxn];
int build(vector<ll> &seq, ll a = 0, ll b = inf)
{
static int idxNode = 0;
if (seq.empty())
return -1;
int cur = idxNode++;
if (a == b)
return cur;
t[cur].x.resize(seq.size());
t[cur].s.resize(seq.size());
ll mid = (a + b) / 2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |