제출 #299146

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299146		vitkishloh228	벽 (IOI14_wall)	C++14	100 / 100	1287 ms	123772 KiB

wall

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<pair<int, int>> t;//min,max
vector<int> mod;
void push(int v, int l, int r) {
	if (l == r) mod[v] = -1;
	else {
		if (mod[v] != -1) {
			mod[2 * v] = mod[v];
			mod[2 * v + 1] = mod[v];
			t[2 * v] = { mod[v],mod[v] };
			t[2 * v + 1] = t[2 * v];
			mod[v] = -1;
		}
	}
}
void upd1(int v, int tl, int tr, int l, int r, int x) {//if a[i]< h a[i]=h;
	push(v, tl, tr);
	if (tl > tr || l > r) return;
	if (tl == l && tr == r) {
		if (t[v].first > x) {
			return;
		}
		if (t[v].second <= x) {
			t[v] = { x,x };
			mod[v] = x;
			return;
		}
	}
	int tm = (tl + tr) / 2;
	upd1(2 * v, tl, tm, l, min(r, tm), x);
	upd1(2 * v + 1, tm + 1, tr, max(l, tm + 1), r, x);
	t[v].first = min(t[2 * v].first, t[2 * v + 1].first);
	t[v].second = max(t[2 * v].second, t[2 * v + 1].second);
}
void upd0(int v, int tl, int tr, int l, int r, int x) {//if a[i]>h a[i]=h
	push(v, tl, tr);
	if (tl > tr || l > r) return;
	if (tl == l && tr == r) {
		if (t[v].second < x) {
			return;
		}
		if (t[v].first >= x) {
			t[v] = { x,x };
			mod[v] = x;
			return;
		}
	}
	int tm = (tl + tr) / 2;
	upd0(2 * v, tl, tm, l, min(r, tm), x);
	upd0(2 * v + 1, tm + 1, tr, max(l, tm + 1), r, x);
	t[v].first = min(t[2 * v].first, t[2 * v + 1].first);
	t[v].second = max(t[2 * v].second, t[2 * v + 1].second);
}
int get(int v, int tl, int tr, int pos) {
	push(v, tl, tr);
	if (tl == tr) return t[v].first;
	else {
		int tm = (tl + tr) / 2;
		if (pos <= tm) return get(2 * v, tl, tm, pos);
		else return get(2 * v + 1, tm + 1, tr, pos);
	}
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
	/*
	int i, mn, mx;
	for (i = 0; i < k; i++) {
		if (op[i] == 1) mn = height[i], mx = 1e9;
		else mn = 0, mx = height[i];
		update(1, 0, n - 1, left[i], right[i], mn, mx);
	}
	for (i = 0; i < n; i++) {
		finalHeight[i] = query(1, 0, n - 1, i);
	}
	*/
	int q = k;
	//cin >> n >> q;
	t.resize(4 * n);
	mod = vector<int>(4 * n, -1);
	for (int i=0;i<q;++i) {
		int tt, l, r, h;
		//cin >> tt >> l >> r >> h;
		tt = op[i];
		l = left[i];
		 r = right[i];
		 h = height[i];
		//--l, --r;
		if (tt == 1) {
			upd1(1, 0, n - 1, l, r, h);
		}
		else {
			upd0(1, 0, n - 1, l, r, h);
		}
	}
	for (int i = 0; i < n; ++i) {
		finalHeight[i] = get(1, 0, n - 1, i);
	}
}

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