oj.uz

Submission #1006594

# Submission time Handle Problem Language Result Execution time Memory
1006594 2024-06-24T04:45:54 Z farrellw Wall (IOI14_wall) C++17
100 / 100
 419 ms 48972 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define INF 1000000
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

#include "wall.h"

ii combine(ii upd_new, ii upd_old) {    // apply upd_new to upd_old
    ii res = {max(upd_new.fi, upd_old.fi), min(upd_new.se, upd_old.se)};
    if (res.fi > res.se) {
        if (upd_old.se < upd_new.se) // The ranges are disjoint, so suffices to check either
            res = {upd_new.fi, upd_new.fi};
        else
            res = {upd_new.se, upd_new.se};
    }
    return res;
}

struct Segtree {    // Segtree of updates
    int sz;
    vector<ii> upd;    // store (a, b)
    Segtree(int N) {
        sz = 1;
        while (sz < N)
            sz *= 2;
        upd = vii(2 * sz, {0, INF});
    }
    void push(int id, int left, int right) { // O(1), for regular updates
        if (right - left == 1)
            return;
        upd[2 * id + 1] = combine(upd[id], upd[2 * id + 1]);
        upd[2 * id + 2] = combine(upd[id], upd[2 * id + 2]);
        upd[id] = {0, INF};
    }

    void push_recursive(int id, int left, int right) { // O(N), only for answer extraction at the end
        if(right - left == 1)
            return;
        push(id, left, right);
        int mid = (left + right) / 2;
        push_recursive(2 * id + 1, left, mid);
        push_recursive(2 * id + 2, mid, right);
    }

    void range_upd(int qleft, int qright, ii val, int id, int left, int right) {
        if (qleft <= left && right <= qright) {
           upd[id] = combine(val, upd[id]);
            return;
        }
        if (qright <= left || right <= qleft)
            return;
        push(id, left, right);
        int mid = (left + right) / 2;
        range_upd(qleft, qright, val, 2 * id + 1, left, mid);
        range_upd(qleft, qright, val, 2 * id + 2, mid, right);
    }
    void range_upd(int qleft, int qright, ii val) {
        range_upd(qleft, qright, val, 0, 0, sz);
    }
};

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
    Segtree tree(n);
    for(int z = 0; z < k; z++) {
        ii upd_val = (op[z] == 1) ? make_pair(height[z], INF) : make_pair(0, height[z]);
        tree.range_upd(left[z], right[z]+1, upd_val);
    }
    tree.push_recursive(0, 0, tree.sz);
    for(int z = 0; z < n; z++) {
        finalHeight[z] = tree.upd[z+tree.sz-1].fi;
    }
    return;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 77 ms 8192 KB Output is correct
3 Correct 103 ms 4256 KB Output is correct
4 Correct 357 ms 10576 KB Output is correct
5 Correct 179 ms 10484 KB Output is correct
6 Correct 182 ms 10516 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 78 ms 8224 KB Output is correct
9 Correct 103 ms 4256 KB Output is correct
10 Correct 367 ms 10580 KB Output is correct
11 Correct 171 ms 10576 KB Output is correct
12 Correct 180 ms 10580 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 85 ms 8264 KB Output is correct
15 Correct 21 ms 1372 KB Output is correct
16 Correct 338 ms 10532 KB Output is correct
17 Correct 169 ms 10580 KB Output is correct
18 Correct 170 ms 10580 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 5 ms 708 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 71 ms 8100 KB Output is correct
9 Correct 95 ms 4180 KB Output is correct
10 Correct 325 ms 10580 KB Output is correct
11 Correct 168 ms 10580 KB Output is correct
12 Correct 181 ms 10576 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 73 ms 8052 KB Output is correct
15 Correct 19 ms 1368 KB Output is correct
16 Correct 351 ms 10572 KB Output is correct
17 Correct 164 ms 10576 KB Output is correct
18 Correct 190 ms 10576 KB Output is correct
19 Correct 408 ms 48724 KB Output is correct
20 Correct 393 ms 48724 KB Output is correct
21 Correct 401 ms 48720 KB Output is correct
22 Correct 383 ms 48720 KB Output is correct
23 Correct 395 ms 48972 KB Output is correct
24 Correct 373 ms 48872 KB Output is correct
25 Correct 369 ms 48712 KB Output is correct
26 Correct 396 ms 48732 KB Output is correct
27 Correct 406 ms 48920 KB Output is correct
28 Correct 419 ms 48788 KB Output is correct
29 Correct 417 ms 48772 KB Output is correct
30 Correct 353 ms 48724 KB Output is correct