# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120797 | imyujin | Cake 3 (JOI19_cake3) | C++14 | 1104 ms | 188720 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<stdio.h>
#include<algorithm>
using namespace std;
#define MAXN 200005
typedef long long lint;
typedef pair<lint, lint> pll;
typedef pair<lint, int> pli;
struct NOD{
NOD *lef, *rig;
int cnt;
lint sum;
NOD();
} *nil, *pst[MAXN];
NOD::NOD(){
lef=rig=nil;
cnt=0;
sum=0ll;
}
const lint LINF=1ll<<50;
int N, M;
pll CV[MAXN];
pli vs[MAXN];
int vidx[MAXN];
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... |