# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
819951 | vjudge1 | Pinball (JOI14_pinball) | C++17 | 441 ms | 63184 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;
class segtree_t {
public:
segtree_t *left, *right;
int l, r, m;
int64_t val;
segtree_t(int l, int r) : l(l), r(r), m(l + r >> 1), val(1e18) {
if (l == r) return;
left = new segtree_t(l, m);
right = new segtree_t(m + 1, r);
}
void Update(int p, int64_t x) {
if (l == r) {
val = min(val, x);
return;
}
if (p <= m) {
left->Update(p, x);
} else {
right->Update(p, x);
}
val = min(left->val, right->val);
}
int64_t Get(int s, int t) {
if (r < s or l > t) return 1e18;
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... |