Submission #593738

#	Time	Username	Problem	Language	Result	Execution time	Memory
593738		Vanilla	Wall (IOI14_wall)	C++17	100 / 100	609 ms	69608 KiB

wall

#include <bits/stdc++.h>
#include "wall.h"
using namespace std;const int maxn = 2e6 + 1;pair <int, int> sgt[maxn * 4];void merge (int x, int mn2, int mx2) {sgt[x].first = min(sgt[x].first, mn2);sgt[x].second = max(min(mn2, sgt[x].second), mx2);}void propagate (int x) {merge(x * 2, sgt[x].first, sgt[x].second);merge(x * 2 + 1, sgt[x].first, sgt[x].second);sgt[x] = {1e6, 0};}int a,b;void upd (int x, int l, int r, int il, int ir, int h, int op) {if (l > ir || r < il) return;if (il <= l && r <= ir) {if (op == 1) merge(x, 1e6, h);else merge(x, h, 0);return;}propagate(x);int mid = (l + r) / 2;upd(x * 2, l, mid, il, ir, h, op);upd(x * 2 + 1, mid + 1, r, il, ir, h, op);}void get (int x, int l, int r, int a[]){if (l > r) return;if (l == r) {a[l] = sgt[x].second;return;}propagate(x);int mid = (l + r) / 2;get(x * 2, l, mid, a);get(x * 2 + 1, mid + 1, r, a);}void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){swap(a,b);for (int i = 0; i < k; i++){upd(1, 0, n-1, left[i], right[i], height[i], op[i]);}get(1, 0, n-1, finalHeight);return;}

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