# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931080 | Art_ogo | Wall (IOI14_wall) | C++17 | 597 ms | 90976 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 <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <algorithm>
#include <utility>
#include "wall.h"
using namespace std;
const int MAXN = 3e6+10;
int t[4*MAXN];
int modmn[4*MAXN], modmx[4*MAXN];
void build(int v, int tl, int tr){
modmn[v] = 1e9;
modmx[v] = -1e9;
if(tl == tr){
t[v] = 0;
return;
}
int tm = (tl + tr) >> 1;
build(v * 2, tl, tm);
build(v * 2 + 1, tm + 1, tr);
}
void push(int v){
if(v * 2 + 1 > 4*MAXN) return;
if(modmn[v] != 1e9){
t[v * 2] = min(t[v * 2], modmn[v]);
modmn[v * 2] = min(modmn[v], modmn[v * 2]);
# | 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... |