oj.uz

답안 #1007623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007623 2024-06-25T09:27:34 Z farrellw 벽 (IOI14_wall) C++14
100 / 100
 385 ms 48972 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define INF 1000000
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) { // The ranges are disjoint, so suffices to check either
        res = (upd_old.se < upd_new.se) ? make_pair(upd_new.fi, upd_new.fi) : make_pair(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[(id<<1)|1] = combine(upd[id], upd[(id<<1)|1]);
        upd[(id<<1) + 2] = combine(upd[id], upd[(id<<1) + 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)>>1;
        push_recursive((id<<1)|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)>>1;
        range_upd(qleft, qright, val, (id<<1)|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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 74 ms 8260 KB Output is correct
3 Correct 99 ms 4252 KB Output is correct
4 Correct 383 ms 10500 KB Output is correct
5 Correct 158 ms 10580 KB Output is correct
6 Correct 147 ms 10676 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 2 ms 604 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 68 ms 8228 KB Output is correct
9 Correct 98 ms 4256 KB Output is correct
10 Correct 310 ms 10644 KB Output is correct
11 Correct 148 ms 10576 KB Output is correct
12 Correct 155 ms 10576 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 79 ms 8264 KB Output is correct
15 Correct 21 ms 1440 KB Output is correct
16 Correct 325 ms 10580 KB Output is correct
17 Correct 160 ms 10576 KB Output is correct
18 Correct 165 ms 10804 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 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 800 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 73 ms 8064 KB Output is correct
9 Correct 107 ms 4184 KB Output is correct
10 Correct 320 ms 10576 KB Output is correct
11 Correct 152 ms 10576 KB Output is correct
12 Correct 160 ms 10656 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 77 ms 8096 KB Output is correct
15 Correct 19 ms 1372 KB Output is correct
16 Correct 348 ms 10608 KB Output is correct
17 Correct 166 ms 10456 KB Output is correct
18 Correct 155 ms 10472 KB Output is correct
19 Correct 342 ms 48724 KB Output is correct
20 Correct 372 ms 48724 KB Output is correct
21 Correct 350 ms 48720 KB Output is correct
22 Correct 385 ms 48972 KB Output is correct
23 Correct 355 ms 48720 KB Output is correct
24 Correct 345 ms 48724 KB Output is correct
25 Correct 348 ms 48720 KB Output is correct
26 Correct 369 ms 48724 KB Output is correct
27 Correct 379 ms 48724 KB Output is correct
28 Correct 335 ms 48724 KB Output is correct
29 Correct 336 ms 48724 KB Output is correct
30 Correct 363 ms 48724 KB Output is correct