# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340285 | Kerim | Wall (IOI14_wall) | C++17 | 1237 ms | 73716 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>
#include "wall.h"
using namespace std;
const int INF = 1e9;
const int N = 2e6 + 10;
int ka[4 * N], ki[4 * N];
bool ish[4 * N];
int n;
void minim(int, int, int, int, int, int);
void maxim(int, int, int, int, int, int);
void init() {
for (int i = 0; i < N; i++) {
ka[i] = 0;
ki[i] = INF;
}
}
void minim(int v, int l, int r, int tl, int tr, int h) {
if (tr < l || r < tl) return;
if (tl <= l && r <= tr) {
ki[v] = min(ki[v], h);
ka[v] = min(ka[v], ki[v]);
ish[v] = 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... |