# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828859 | MohamedAliSaidane | Two Antennas (JOI19_antennas) | C++14 | 453 ms | 36132 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 pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
const int nax= 2e5 + 5;
int n, q, k = 1;
vector<int> A, B, H, L1, R1, L2, R2;
vector<pair<int,pair<int,int>>> events;
int ans[nax], lquery[nax], rquery[nax];
const int MOD = 1e9 + 7;
struct node
{
int maxi = -1, mini = MOD, umax = -1, umin = MOD, ans = -1;
};
vector<node> st;
vector<int> lazymx, lazymn;
node BASE;
void propagate(int p)
{
if(lazymx[p] != -1)
{
if(p < k)
{
lazymx[2 * p] = max(lazymx[p], lazymx[2 * 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... |