# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32623 | aome | Bulldozer (JOI17_bulldozer) | C++14 | 996 ms | 32352 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 fi first
#define se second
using namespace std;
const int N = 2005;
const int INF = 1e9;
struct Point {
int x, y, w;
} a[N];
struct Node {
long long s, sl, sr, mx;
Node () { s = sl = sr = 0, mx = -INF; }
};
typedef pair<int, int> ii;
int n, pos[N];
long long res;
Node it[4 * N];
vector<ii> go;
Node Merge(Node x, Node y) {
Node z;
z.s = x.s + y.s;
z.sl = max(x.sl, x.s + y.sl);
z.sr = max(x.sr + y.s, y.sr);
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... |