# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729011 | MilosMilutinovic | Advertisement 2 (JOI23_ho_t2) | C++14 | 717 ms | 25028 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.
/**
* author: wxhtzdy
* created: 12.02.2023 12:07:23
**/
#include <bits/stdc++.h>
using namespace std;
const int N = 500500;
const int M = 8 * N;
int st[2][M];
void build(int x, int p, int l, int r, int v) {
st[x][p] = v;
if (l == r) {
return;
}
int mid = l + r >> 1;
build(x, p * 2, l, mid, v);
build(x, p * 2 + 1, mid + 1, r, v);
}
int query(int x, int p, int l, int r, int ll, int rr) {
if (l > r || l > rr || r < ll) {
return -2e9;
}
if (ll <= l && r <= rr) {
return st[x][p];
}
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... |