# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104829 | Just_Solve_The_Problem | Cake 3 (JOI19_cake3) | C++11 | 1382 ms | 248732 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 fr first
#define sc second
#define ll long long
#define ok puts("ok");
using namespace std;
const int N = (int)2e5 + 7;
pair < ll, ll > ar[N];
int n, m;
ll pref[N], suf[N];
ll ans;
int siz = 1;
int root[N];
struct node {
int l, r;
ll sum;
int cnt;
node() {
l = r = 0;
sum = 0;
cnt = 0;
}
};
node tree[N * 50];
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... |