#include <iostream>

#include "wall.h"

struct range{
	int min, max, active;
	void pushup(int h){
		if(h > min) min = h;
		if(h > max) max = h;
	}
	void pushdown(int h){
		if(h < min) min = h;
		if(h < max) max = h;
	}
	void constrain(range r){
		pushup(r.min);
		pushdown(r.max);
	}
};

const int bsz = 256;

range a[100000];
range b[512];

void push(int i){
	if(b[i].active){
		for(int j=0; j<bsz; ++j) a[j+i*bsz].constrain(b[i]);
		b[i].active = 0;
	}
}

void set_min(int h, int l, int r){
	//std::cout << "pushup " << h << " (" << l << ' ' << r << ")\n";
	if(l/bsz == r/bsz){
		push(l/bsz);
		for(int i=l; i<=r; ++i) a[i].pushup(h);
		b[l/bsz].pushup(h);
	}else{
		push(l/bsz), push(r/bsz);
		for(int i=l; i/bsz==l/bsz; ++i) a[i].pushup(h);
		for(int i=l/bsz; i<=r/bsz; ++i) b[i].pushup(h);
		for(int i=1+(l/bsz); i<r/bsz; ++i) b[i].active = 1;
		for(int i=r; i/bsz==r/bsz; --i) a[i].pushup(h);
	}
}

void set_max(int h, int l, int r){
	//std::cout << "pushdown " << h << " (" << l << ' ' << r << ")\n";
	if(l/bsz == r/bsz){
		push(l/bsz);
		for(int i=l; i<=r; ++i) a[i].pushdown(h);
		b[l/bsz].pushdown(h);
	}else{
		push(l/bsz), push(r/bsz);
		for(int i=l; i/bsz==l/bsz; ++i) a[i].pushdown(h);
		for(int i=l/bsz; i<=r/bsz; ++i) b[i].pushdown(h);
		for(int i=1+(l/bsz); i<r/bsz; ++i) b[i].active = 1;
		for(int i=r; i/bsz==r/bsz; --i) a[i].pushdown(h);
	}
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	for(int i=0; i<k; ++i){
		if(op[i]&1){
			set_min(height[i], left[i], right[i]);
		}else{
			set_max(height[i], left[i], right[i]);
		}

//for(int i=0; i<n; ++i) std::cout << '[' << a[i].min  << ']' << " \n"[i==n-1];
//for(int i=0; i*bsz<n; ++i) std::cout << " [" << b[i].active << ' ' << b[i].min  << "] " << " \n"[i==4];
//std::cout << '\n';
	}

	for(int i=0; i*bsz<n; ++i) push(i);
//for(int i=0; i<n; ++i) std::cout << '[' << a[i].min <<  ']' << " \n"[i==n-1];
//for(int i=0; i*bsz<n; ++i) std::cout << " [" << b[i].active << ' ' << b[i].min << "] " << " \n"[i==4];
//std::cout << '\n';
	for(int i=0; i<n; ++i) finalHeight[i] = a[i].min;
}