# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160434 | Perl32 | Cake 3 (JOI19_cake3) | C++20 | 177 ms | 327680 KiB |
//I wrote this code 4 u <3
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
constexpr ll inf = 0x3f3f3f3f3f3f3f3f;
struct ST {
vector<ll> t;
int sz;
void pull(int i) {
t[i] = max(t[i << 1], t[i << 1 | 1]);
}
ST(int n) {
sz = 1;
while (sz < n) sz <<= 1;
t.resize(sz << 1, -inf);
}
void init(vector<ll>& a) {
for (int i = 0; i < (int) a.size(); ++i) t[i + sz] = a[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |