# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36042 | cheater2k | Bulldozer (JOI17_bulldozer) | C++14 | 1074 ms | 32536 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;
const int N = 2005;
const long long inf = 1e18;
struct SegmentTree {
struct Node {
long long val; long long pre; long long suf; long long sum;
Node() { val = -inf; sum = pre = suf = 0; }
} it[N << 2];
#define mid ((l + r) >> 1)
Node merge(Node le, Node ri) {
Node cur = Node();
cur.sum = le.sum + ri.sum;
cur.val = max({le.val, ri.val, le.suf + ri.pre});
cur.pre = max(le.pre, le.sum + ri.pre);
cur.suf = max(ri.suf, ri.sum + le.suf);
return cur;
}
void upd(int v, int l, int r, int pos, int val) {
if (l > r || l > pos || r < pos) return;
if (l == r) { it[v].val = it[v].pre = it[v].suf = it[v].sum = val; return; }
upd(v << 1, l, mid, pos, val); upd(v << 1 | 1, mid + 1, r, pos, val);
it[v] = merge(it[v << 1], it[v << 1 | 1]);
}
long long get() { return it[1].val; }
#undef mid
} seg;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |