# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
591858 | Shreyan_Paliwal | Wall (IOI14_wall) | C++17 | 760 ms | 69468 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 "wall.h"
#include <bits/stdc++.h>
using namespace std;
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
const int INF = 2000000000;
const int maxn = 2000000;
const int segn = (1 << 22);
int seg[segn][2];
void addlower(int p, int l, int r, int k) {
MAX(seg[p][0], k);
MAX(seg[p][1], k);
}
void addupper(int p, int l, int r, int k) {
MIN(seg[p][1], k);
MIN(seg[p][0], seg[p][1]);
}
void push(int p, int l, int r) {
if (seg[p][0] == seg[p][1] && seg[p][1] == INF) return;
if (l == r) return;
int mid = (l + r) >> 1;
addlower((p << 1), l, mid, seg[p][0]);
addlower((p << 1) | 1, mid + 1, r, seg[p][0]);
addupper((p << 1), l, mid, seg[p][1]);
# | 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... |