# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223438 | shenxy | Matching (COCI20_matching) | C++11 | 2591 ms | 1860 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>
#define m (s + e) / 2
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
const int INF = 10000000;
struct seg {
int s, e;
ii vmin, vmax;
seg *l, *r;
seg(int _s, int _e) {
s = _s, e = _e;
vmin = ii(INF, -1), vmax = ii(0, -1);
l = r = NULL;
}
void upmin(int i, ii nv) {
if (s != e) {
if (i > m) {
if (r == NULL) r = new seg(m + 1, e);
r -> upmin(i, nv);
} else {
if (l == NULL) l = new seg(s, m);
l -> upmin(i, nv);
}
vmin = min(l == NULL ? ii(INF, -1) : l -> vmin, r == NULL ? ii(INF, -1) : r -> vmin);
} else vmin = nv;
}
void upmax(int i, ii nv) {
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... |