# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104896 | antimirage | Cake 3 (JOI19_cake3) | C++14 | 2221 ms | 148440 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 mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 2e5 + 5;
int n, m, sz = 1, root[N];
pair <int, int> a[N];
struct tree{
int l, r, cnt;
long long sum;
};
tree t[N * 32];
long long ans = -1e18;
void update (int ov, int nv, int pos, int tl = 1, int tr = 1e9){
if (tl == tr)
t[nv].cnt = t[ov].cnt + 1,
t[nv].sum = t[ov].sum + tl;
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... |