# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129049 | Plurm | Cake 3 (JOI19_cake3) | C++11 | 1169 ms | 116676 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;
int n,m;
vector<pair<int,int> > pieces;
const int COEFF = 32;
const int MXN = 200005;
int segT[COEFF*MXN];
long long qs[MXN];
long long qsegT[COEFF*MXN];
int lb[COEFF*MXN];
int rb[COEFF*MXN];
int llink[COEFF*MXN];
int rlink[COEFF*MXN];
int nodesz;
inline int newnode(int o = -1){
int c = ++nodesz;
if(o != -1){
qsegT[c] = qsegT[o];
segT[c] = segT[o];
lb[c] = lb[o];
rb[c] = rb[o];
llink[c] = llink[o];
rlink[c] = rlink[o];
}
return c;
}
int build(int l, int r){
int c = newnode();
lb[c] = l;
rb[c] = r;
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... |