# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103981 | IOrtroiii | Two Antennas (JOI19_antennas) | C++14 | 1348 ms | 48724 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;
const int N = 200200;
const int inf = 1e9;
int n, q;
int a[N], from[N], to[N];
int L[N], R[N], ans[N];
int mx[N << 2];
int sub[N << 2];
int lz[N << 2];
vector<int> toadd[N];
vector<int> todel[N];
vector<int> toget[N];
#define md ((l + r) >> 1)
void push(int v,int l,int r) {
if (lz[v] < inf) {
sub[v] = max(sub[v], mx[v] - lz[v]);
if (l < r) {
lz[v << 1] = min(lz[v << 1], lz[v]);
lz[v << 1 | 1] = min(lz[v << 1 | 1], lz[v]);
}
lz[v] = inf;
}
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... |