# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1127940 | zNatsumi | Two Antennas (JOI19_antennas) | C++20 | 777 ms | 52592 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ii = pair<int, int>;
const int N = 2e5 + 5;
const long long INF = 1e16;
int n, q, H[N], A[N], B[N], L[N], R[N], res[N];
vector<ii> query[N], quest[N];
struct node{
int v, a, b;
node() {}
node(int v, int a, int b): v(v), a(a), b(b) {}
friend node operator + (node l, node r){
return node(max(l.v, r.v), max(l.a, r.a), max(l.b, r.b));
}
};
struct IT{
node st[N << 2];
int lz[N << 2];
void build(int tl, int tr, int i){
lz[i] = -INF;
st[i] = {-2*INF, -INF, -INF};
# | 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... |