# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243836 | mhy908 | Cake 3 (JOI19_cake3) | C++14 | 1098 ms | 205672 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 eb emplace_back
#define mp make_pair
#define F first
#define S second
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
#define lb(x, v) lower_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<LL, LL> pll;
typedef pair<LL, int> pli;
const LL llinf=4e18;
int n, m;
pll arr[200010];
vector<int> id;
LL ans=-llinf;
struct PST{
struct NODE{
LL qu; int qu2;
NODE *l, *r;
NODE(){qu=0, qu2=0, l=r=nullptr;}
};
NODE* root[200010];
void init(NODE* here, int s, int e){
if(s==e)return;
here->l=new NODE;
here->r=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... |