# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134723 | someone_aa | Divide and conquer (IZhO14_divide) | C++17 | 360 ms | 73976 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 ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 100100;
ll gold[maxn], energy[maxn], x[maxn], n;
ll prefix_g[maxn], prefix_e[maxn];
class node {
public:
ll lb, rb;
ll value;
node *lchild, *rchild;
node(ll _lb, ll _rb) {
lb = _lb;
rb = _rb;
value = LLONG_MAX;
lchild = rchild = NULL;
}
ll get_val(node *x) {
if(x == NULL) return LLONG_MAX;
else return x->value;
}
void update(ll x, ll val) {
if(lb == rb) {
value = min(value, val);
}
else {
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... |