# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
743841 | nguyentunglam | Two Antennas (JOI19_antennas) | C++17 | 318 ms | 24024 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>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 2e5 + 10;
int h[N], a[N], b[N], T[N], mx[N], mn[N], ans[N];
vector<ii> query[N], event[N];
int n;
void push(int s, int l, int r) {
T[s] = max(T[s], mx[s] - mn[s]);
if (l != r) {
mx[s << 1] = max(mx[s << 1], mx[s]);
mx[s << 1 | 1] = max(mx[s << 1 | 1], mx[s]);
}
mx[s] = 0;
}
void upval (int s, int l, int r, int pos, int val) {
push(s, l, r);
if (l == r) {
mn[s] = val;
return;
}
int mid = l + r >> 1;
if (pos <= mid) upval(s << 1, l, mid, pos, val);
else upval(s << 1 | 1, mid + 1, r, pos, val);
mn[s] = min(mn[s << 1], mn[s << 1 | 1]);
}
void upans (int s, int l, int r, int from, int to, int val) {
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... |