# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
220610 | atoiz | Cake 3 (JOI19_cake3) | C++14 | 474 ms | 9720 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.
/*input
8 4
112103441 501365808
659752417 137957977
86280801 257419447
902409188 565237611
965602301 689654312
104535476 646977261
945132881 114821749
198700181 915994879
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
const int MAXN = 200007, LOG = __lg(MAXN) + 1;
const int64_t INF = 1e17;
int64_t bit_sum[MAXN];
int bit_cnt[MAXN];
void add(int i, int64_t x)
{
for (; i < MAXN; i += i & (-i)) bit_sum[i] += x, ++bit_cnt[i];
}
void rem(int i, int64_t x)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |