# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
887617 | MinaRagy06 | Team Contest (JOI22_team) | C++17 | 315 ms | 119720 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;
#define ll long long
#define md ((l + r) >> 1)
const int inf = 1e9;
int y = -1, mncnt = 2, mxcnt = 2;
struct nodemn {
int l, r, v;
nodemn() {l = 0, r = 0, v = 1e9;}
} segmn[5'000'005];
struct nodemx {
int l, r, v;
nodemx() {l = 0, r = 0, v = -1e9;}
} segmx[5'000'005];
void updmn(int i, int l, int r, int x, int v) {
if (l == r) {
segmn[i].v = min(segmn[i].v, v);
return;
}
if (x <= md) {
if (!segmn[i].l) {
segmn[i].l = mncnt++;
}
updmn(segmn[i].l, l, md, x, v);
} else {
if (!segmn[i].r) {
segmn[i].r = mncnt++;
}
updmn(segmn[i].r, md + 1, r, x, v);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |