oj.uz

답안 #1007633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007633 2024-06-25T09:33:27 Z farrellw 벽 (IOI14_wall) C++14
100 / 100
 387 ms 54352 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 (id+1 >= sz)
            return;
        upd[(id<<1)|1] = combine(upd[id], upd[(id<<1)|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)>>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 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 892 KB Output is correct
5 Correct 6 ms 864 KB Output is correct
6 Correct 3 ms 860 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 81 ms 11348 KB Output is correct
3 Correct 109 ms 6492 KB Output is correct
4 Correct 345 ms 15916 KB Output is correct
5 Correct 162 ms 15960 KB Output is correct
6 Correct 173 ms 15188 KB Output is correct

Subtask #3
29.0 / 29.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 856 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 81 ms 11316 KB Output is correct
9 Correct 108 ms 6224 KB Output is correct
10 Correct 330 ms 15832 KB Output is correct
11 Correct 157 ms 15956 KB Output is correct
12 Correct 171 ms 15188 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 83 ms 11088 KB Output is correct
15 Correct 21 ms 1880 KB Output is correct
16 Correct 369 ms 15696 KB Output is correct
17 Correct 173 ms 15440 KB Output is correct
18 Correct 179 ms 15492 KB Output is correct

Subtask #4
39.0 / 39.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 4 ms 856 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 80 ms 11092 KB Output is correct
9 Correct 107 ms 6228 KB Output is correct
10 Correct 365 ms 15756 KB Output is correct
11 Correct 169 ms 15956 KB Output is correct
12 Correct 175 ms 15184 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 83 ms 11156 KB Output is correct
15 Correct 21 ms 1884 KB Output is correct
16 Correct 369 ms 15780 KB Output is correct
17 Correct 176 ms 15444 KB Output is correct
18 Correct 167 ms 15392 KB Output is correct
19 Correct 380 ms 54076 KB Output is correct
20 Correct 387 ms 54352 KB Output is correct
21 Correct 358 ms 54220 KB Output is correct
22 Correct 338 ms 54072 KB Output is correct
23 Correct 358 ms 54100 KB Output is correct
24 Correct 385 ms 54320 KB Output is correct
25 Correct 352 ms 54100 KB Output is correct
26 Correct 366 ms 54096 KB Output is correct
27 Correct 355 ms 54100 KB Output is correct
28 Correct 361 ms 54084 KB Output is correct
29 Correct 348 ms 54276 KB Output is correct
30 Correct 328 ms 54104 KB Output is correct