Submission #235992

#	Time	Username	Problem	Language	Result	Execution time	Memory
235992		crossing0ver	Wall (IOI14_wall)	C++17	0 / 100	222 ms	70880 KiB

wall

#include<bits/stdc++.h>
#include "wall.h"
using namespace std;
const int N = 2E6;
int t[4*N],lazy[4*N][2],l,r,val;// min h, max h
bool type;

void push(int v,int tl,int tr) {
	if (lazy[v][0]) {
		if (lazy[v*2][0] < lazy[v][0]){
			lazy[v*2][0]  = lazy[v][0];
			if (t[v*2] < lazy[v][0]) t[v*2] = lazy[v][0];
		}
		if (lazy[v*2|1][0] < lazy[v][0]) {
			lazy[v*2|1][0] = lazy[v][0];
			if (t[v*2|1] < lazy[v][0]) t[v*2|1] = lazy[v][0];
		}
		if (lazy[v*2][0] > lazy[v*2][1]) {
		lazy[v*2][1] = lazy[v*2][0];
		}
		if (lazy[v*2|1][0] > lazy[v*2|1][1] ) {
		lazy[v*2|1][1] = lazy[v*2|1][0]; 
		}
	}
	if (lazy[v][1] != 1e9) {
		if (lazy[v*2][1] > lazy[v][1]) {
			lazy[v*2][1] = lazy[v][1];
			lazy[v*2][0] = min (lazy[v*2][0],lazy[v*2][1]);
			if (t[v*2] > lazy[v][1]) t[v*2] = lazy[v][1];
		}
		if (lazy[v*2|1][1] > lazy[v][1]) {
			lazy[v*2|1][1]  = lazy[v*2][1];
			lazy[v*2|1][0] = min (lazy[v*1|1][0],lazy[v*2|1][1]);
			if (t[v*2|1] > lazy[v][1]) t[v*2|1] = lazy[v][1];
		}
  		lazy[v][1] = 1e9;
	}
}
void upd (int v,int tl,int tr) {
	if (l > tr || r < tl) return;
	if (tl >= l && tr <= r) {
		if (type == 0) {
			if (t[v] >= val) return;
			t[v] = max (t[v],val);
			lazy[v][0] = max (lazy[v][0],val);
			if (lazy[v][1] < lazy[v][0]) {
				lazy[v][1] = val;
			}
		}
		else {
			if (lazy[v][1] <= val) return;
			lazy[v][1] = val;
			if (lazy[v][0] > lazy[v][1]) {
				lazy[v][0] = lazy[v][1];
			}
			t[v] = min(t[v],lazy[v][1]);
		}
		return;
	}
	push (v,tl,tr);
	int tm = (tl + tr)/2;
	upd (v*2,tl,tm);
	upd (v*2|1,tm+1,tr);
	t[v] = max(t[v*2],t[v*2|1]);
}
int A[N];
void get (int v,int tl,int tr) {
	if (tl == tr) A[tl] = t[v];
	else {
		int tm = (tl + tr)/2;
		push(v,tl,tr);
		get(v*2,tl,tm);
		get(v*2+1,tm+1,tr);
	} 
}
void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]) {
	for (int i = 0; i < 4*N; i++) lazy[i][1] = 1e9;
	for (int i = 0; i < k; i++) {
		type = op[i] - 1;
		l = left[i];
		r = right[i];
		val = height[i] + 1;
		upd (1,0,n-1);
	}
	get(1,0,n-1);
	for (int i = 0;i < n; i++)
		finalHeight[i] = max (A[i] - 1,0);
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 24
• Subtask 3: 0 / 29
• Subtask 4: 0 / 39