Submission #101863

#	Time	Username	Problem	Language	Result	Execution time	Memory
101863		eriksuenderhauf	Wall (IOI14_wall)	C++11	100 / 100	1955 ms	102476 KiB

wall

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "wall.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 2e6 + 5;
const double eps = 1e-9;
int seg[MAXN*4][2], lazy[MAXN*4][2];

void build(int l, int r, int k) {
    lazy[k][0] = lazy[k][1] = -1;
    if (l == r) {
        seg[k][0] = seg[k][1] = 0;
        return;
    }
    int m = (l + r) / 2;
    build(l, m, k*2);
    build(m+1, r, k*2+1);
    seg[k][0] = min(seg[k*2][0], seg[k*2+1][0]);
    seg[k][1] = max(seg[k*2][1], seg[k*2+1][1]);
}

void prop(int l, int r, int k) {
    if (lazy[k][0] != -1) {
        seg[k][0] = max(seg[k][0],lazy[k][0]);
        seg[k][1] = max(seg[k][1],lazy[k][0]);
    }
    if (lazy[k][1] != -1) {
        seg[k][0] = min(seg[k][0],lazy[k][1]);
        seg[k][1] = min(seg[k][1],lazy[k][1]);
    }
    if (l != r && lazy[k][0] != -1) {
        if (lazy[k*2][0] == -1 || lazy[k][0] > lazy[k*2][0])
            lazy[k*2][0] = lazy[k][0];
        if (lazy[k*2][1] != -1 && lazy[k*2][1] < lazy[k][0])
            lazy[k*2][1] = lazy[k][0];
        if (lazy[k*2+1][0] == -1 || lazy[k][0] > lazy[k*2+1][0])
            lazy[k*2+1][0] = lazy[k][0];
        if (lazy[k*2+1][1] != -1 && lazy[k*2+1][1] < lazy[k][0])
            lazy[k*2+1][1] = lazy[k][0];
    }
    if (l != r && lazy[k][1] != -1) {
        if (lazy[k*2][1] == -1 || lazy[k][1] < lazy[k*2][1])
            lazy[k*2][1] = lazy[k][1];
        if (lazy[k*2][0] != -1 && lazy[k*2][0] > lazy[k][1])
            lazy[k*2][0] = lazy[k][1];
        if (lazy[k*2+1][1] == -1 || lazy[k][1] < lazy[k*2+1][1])
            lazy[k*2+1][1] = lazy[k][1];
        if (lazy[k*2+1][0] != -1 && lazy[k*2+1][0] > lazy[k][1])
            lazy[k*2+1][0] = lazy[k][1];
    }
    lazy[k][0] = -1;
    lazy[k][1] = -1;
}

void upd(int l, int r, int k, int a, int b, int v, int t) {
    if (r < a || b < l) return;
    prop(l, r, k);
    if (a <= l && r <= b) {
        lazy[k][t] = v;
        prop(l, r, k);
        return;
    }
    int m = (l+r) / 2;
    upd(l, m, k*2, a, b, v, t);
    upd(m+1, r, k*2+1, a, b, v, t);
    seg[k][0] = min(seg[k*2][0], seg[k*2+1][0]);
    seg[k][1] = max(seg[k*2][1], seg[k*2+1][1]);
}

int qry(int l, int r, int k, int a) {
    prop(l, r, k);
    if (a <= l && r <= a) {
        return seg[k][0];
    }
    int m = (l+r) / 2;
    int ret = -1;
    if (a <= m)
        ret = qry(l, m, k*2, a);
    else
        ret = qry(m+1, r, k*2+1, a);
    seg[k][0] = min(min(seg[k*2][0], seg[k*2+1][0]),min(seg[k*2][1], seg[k*2+1][1]));
    seg[k][1] = max(max(seg[k*2][0], seg[k*2+1][0]),max(seg[k*2][1], seg[k*2+1][1]));
    return ret;
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
    // adding phase: set minimum to a given value
    // removing phase: set maximum to a given value
    build(0, n - 1, 1);
    for (int i = 0; i < k; i++) {
        upd(0, n - 1, 1, left[i], right[i], height[i], op[i]-1);
    }
    for (int i = 0; i < n; i++) {
        finalHeight[i] = qry(0, n - 1, 1, i);
    }
}

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