oj.uz

답안 #1007666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007666 2024-06-25T09:58:07 Z farrellw 벽 (IOI14_wall) C++14
100 / 100
 387 ms 98136 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define INF 100005
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
        return (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)
    vi left;
    vi right;
    vi mid;
    Segtree(int N) {
        sz = 1;
        while (sz < N)
            sz *= 2;
        upd = vii(2 * sz, {0, INF});
        left = vi(2 * sz, 0);
        right = vi(2 * sz, 0);
        mid = vi(2 * sz, 0);
        for(int id = sz-1; id < 2*sz-1; id++) {
            left[id] = id-sz+1;
            right[id] = id-sz+2;
        }
        for(int id = sz-2; id >= 0; id--) {
            left[id] = left[(id<<1)|1];
            right[id] = right[2 * id + 2];
            mid[id] = (left[id] + right[id])>>1;
        }
    }
    void push(int id, int left, int right) { // O(1), for regular updates
        if (this->mid[id]) {
            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 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 5 ms 1216 KB Output is correct
5 Correct 3 ms 1116 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 78 ms 8024 KB Output is correct
3 Correct 102 ms 4948 KB Output is correct
4 Correct 346 ms 13712 KB Output is correct
5 Correct 172 ms 13648 KB Output is correct
6 Correct 156 ms 13644 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 1112 KB Output is correct
5 Correct 3 ms 1116 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 79 ms 8016 KB Output is correct
9 Correct 107 ms 4952 KB Output is correct
10 Correct 335 ms 13648 KB Output is correct
11 Correct 176 ms 13652 KB Output is correct
12 Correct 163 ms 13760 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 98 ms 8048 KB Output is correct
15 Correct 23 ms 2140 KB Output is correct
16 Correct 377 ms 13688 KB Output is correct
17 Correct 170 ms 13748 KB Output is correct
18 Correct 159 ms 13664 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 2 ms 348 KB Output is correct
4 Correct 4 ms 1216 KB Output is correct
5 Correct 3 ms 1116 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 97 ms 8172 KB Output is correct
9 Correct 92 ms 4956 KB Output is correct
10 Correct 356 ms 13648 KB Output is correct
11 Correct 151 ms 13652 KB Output is correct
12 Correct 147 ms 13648 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 76 ms 8172 KB Output is correct
15 Correct 21 ms 2136 KB Output is correct
16 Correct 367 ms 13652 KB Output is correct
17 Correct 167 ms 13768 KB Output is correct
18 Correct 171 ms 13544 KB Output is correct
19 Correct 363 ms 98132 KB Output is correct
20 Correct 374 ms 98136 KB Output is correct
21 Correct 351 ms 97992 KB Output is correct
22 Correct 387 ms 98128 KB Output is correct
23 Correct 372 ms 98128 KB Output is correct
24 Correct 364 ms 98136 KB Output is correct
25 Correct 363 ms 98028 KB Output is correct
26 Correct 362 ms 98128 KB Output is correct
27 Correct 370 ms 98088 KB Output is correct
28 Correct 367 ms 98132 KB Output is correct
29 Correct 341 ms 98128 KB Output is correct
30 Correct 351 ms 98128 KB Output is correct