# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223426 | shenxy | Matching (COCI20_matching) | C++11 | 1790 ms | 524292 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 <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
const int INF = 10000000;
struct minseg {
int s, e, m;
ii v;
minseg *l, *r;
minseg(int _s, int _e) {
s = _s, e = _e, m = (s + e) / 2;
v = ii(INF, -1);
l = r = NULL;
}
void update(int i, ii nv) {
if (s != e) {
if (i > m) {
if (r == NULL) r = new minseg(m + 1, e);
r -> update(i, nv);
} else {
if (l == NULL) l = new minseg(s, m);
l -> update(i, nv);
}
v = min(l == NULL ? ii(INF, -1) : l -> v, r == NULL ? ii(INF, -1) : r -> v);
} else v = nv;
}
ii query(int a, int b) {
if (s == a && e == b) return v;
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... |