# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120770 | songc | Cake 3 (JOI19_cake3) | C++14 | 1236 ms | 183812 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 INF (1ll << 60)
using namespace std;
typedef long long LL;
typedef pair<LL, LL> pii;
int N, M;
pii A[202020];
vector<int> comp;
LL ans = -INF;
struct Node{
int cnt;
LL sum;
Node *lc, *rc;
Node();
} *PST[202020], *NIL;
Node :: Node(){
lc = rc = NIL;
cnt = sum = 0;
}
void update(Node *pr, Node *nw, int s, int e, int t){
nw->cnt = pr->cnt+1;
nw->sum = pr->sum+comp[t];
if (s == e) return;
int mid = (s+e)/2;
if (t <= mid){
nw->lc = new Node;
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... |