| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 239005 | T0p_ | Wall (IOI14_wall) | C++14 | 0 ms | 0 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 N 2000002
int mx[N<<2], mn[N<<2];
pair<int, int> laz[N<<2];
void push_lazy(int idx, int l, int r)
{
if(laz[idx].first)
{
mx[idx] = mn[idx] = laz[idx].second;
if(l != r) laz[idx<<1] = laz[idx<<1|1] = laz[idx];
laz[idx] = {0, 0};
}
}
void upd_mx(int idx, int l, int r, int a, int b, int h)
{
push_lazy(idx, l, r);
if(r < a || b < l || mn[idx] >= h) return ;
if(a <= l && r <= b && mx[idx] <= h)
{
laz[idx] = {1, h};
push_lazy(idx, l, r);
return ;
}
int mid = (l+r)>>1;
upd_mx(idx<<1, l, mid, a, b, h), upd_mx(idx<<1|1, mid+1, r, a, b, h);
mx[idx] = max(mx[idx<<1], mx[idx<<1|1]);
}
void upd_mn(int idx, int l, int r, int a, int b, int h)
{
push_lazy(idx, l, r);
if(r < a || b < l || mx[idx] <= h) return ;
if(a <= l && r <= b && mn[idx] >= h)
{
laz[idx] = {2, h};
push_lazy(idx, l, r);
return ;
}
int mid = (l+r)>>1;
upd_mn(idx<<1, l, mid, a, b, h), upd_mn(idx<<1|1, mid+1, r, a, b, h);
mn[idx] = min(mn[idx<<1], mn[idx<<1|1]);
}
void print(int idx, int l, int r, int finalHeight[])
{
push_lazy(idx, l, r);
if(l == r) return void(finalHeight[l] = mx[idx]);
int mid = (l+r)>>1;
print(idx<<1, l, mid, &finalHeight), print(idx<<1|1, mid+1, r, &finalHeight);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
for(int i=0 ; i<k ; i++)
{
switch(op[i])
{
case 1: upd_mx(1, 0, n-1, left[i], right[i], height[i]); break;
case 2: upd_mn(1, 0, n-1, left[i], right[i], height[i]); break;
}
}
print(1, 0, n-1, &finalHeight);
return;
}