# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796568 | thimote75 | Cake 3 (JOI19_cake3) | C++14 | 930 ms | 230392 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 int long long
#define p_be second
#define p_ta first
using namespace std;
using idata = vector<int>;
using t_perle = pair<int, int>;
using t_perles = vector<t_perle>;
struct WaveletTree {
WaveletTree* left_tree = nullptr;
WaveletTree* right_tree = nullptr;
int size;
idata values;
idata cumul;
idata target_pos_left;
idata target_pos_right;
WaveletTree (idata local_values, idata sorted_values) {
size = local_values.size();
values = local_values;
cumul.resize(local_values.size() + 1);
for (int i = 0; i < size; i ++)
cumul[i + 1] = cumul[i] + local_values[i];
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... |