Submission #474136

#	Time	Username	Problem	Language	Result	Execution time	Memory
474136		jalsol	Wall (IOI14_wall)	C++17	100 / 100	859 ms	99396 KiB

wall

// looking to shine brighter in this world...

#define TASK "wall"
#include "wall.h"

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 2e6 + 5;

struct Node {
    int mn, mx;
    Node() : mn(inf), mx(0) {}
    Node(int lo, int hi) : mn(lo), mx(hi) {}

    void update(int lo, int hi) {
        chmin(mn, lo);
        mx = max(min(mx, lo), hi);
    }
};

int n, k;
Node tree[maxn << 2];

void push(int i) {
    tree[i << 1].update(tree[i].mn, tree[i].mx);
    tree[i << 1 | 1].update(tree[i].mn, tree[i].mx);
    tree[i] = { inf, 0 };
}

void update(int u, int v, int op, int val, int i = 1, int l = 0, int r = n - 1) {
    if (v < l || r < u) return;

    if (u <= l && r <= v) {
        if (op == 1) {
            tree[i].update(inf, val);
        }
        else {
            tree[i].update(val, 0);
        }

        return;
    }

    push(i);
    int m = (l + r) / 2;
    update(u, v, op, val, i << 1, l, m);
    update(u, v, op, val, i << 1 | 1, m + 1, r);
}

void build(int ans[], int i = 1, int l = 0, int r = n - 1) {
    if (l == r) {
        ans[l] = tree[i].mx;
        return;
    }

    push(i);
    int m = (l + r) / 2;
    build(ans, i << 1, l, m);
    build(ans, i << 1 | 1, m + 1, r);
}

void buildWall(int N, int K, int op[], int l[], int r[], int h[], int ans[]) {
    { n = N; k = K; }

    Rep (i, k) {
        update(l[i], r[i], op[i], h[i]);
    }

    build(ans);
}

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