# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330966 | 12tqian | Cake 3 (JOI19_cake3) | C++17 | 1149 ms | 150636 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>
using namespace std;
typedef long long ll;
const int M = 5e6;
const int N = 2e5 + 5;
struct Node {
int lc;
int rc;
ll sum = 0;
int num = 0;
} t[M];
int cnt = 0;
int ti[N];
ll v[N];
ll c[N];
ll ans[N];
ll ord[N];
int n, m;
int modify(int p, int l, int r, int x, int v) {
int u = ++cnt;
if (l == r) {
t[u].sum = t[p].sum + v;
t[u].num = t[p].num + 1;
} else {
int m = (l + r) / 2;
if (x <= m) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |