oj.uz

답안 #1007648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007648 2024-06-25T09:44:45 Z farrellw 벽 (IOI14_wall) C++14
100 / 100
 376 ms 48872 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)
    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 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 3 ms 600 KB Output is correct
6 Correct 3 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 73 ms 8020 KB Output is correct
3 Correct 104 ms 4208 KB Output is correct
4 Correct 313 ms 10580 KB Output is correct
5 Correct 146 ms 10576 KB Output is correct
6 Correct 169 ms 10580 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 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 73 ms 8184 KB Output is correct
9 Correct 97 ms 4188 KB Output is correct
10 Correct 317 ms 10576 KB Output is correct
11 Correct 142 ms 10596 KB Output is correct
12 Correct 150 ms 10576 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 72 ms 8240 KB Output is correct
15 Correct 21 ms 1456 KB Output is correct
16 Correct 376 ms 10552 KB Output is correct
17 Correct 181 ms 10576 KB Output is correct
18 Correct 169 ms 10588 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 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 70 ms 8112 KB Output is correct
9 Correct 109 ms 4248 KB Output is correct
10 Correct 310 ms 10832 KB Output is correct
11 Correct 143 ms 10580 KB Output is correct
12 Correct 146 ms 10580 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 74 ms 8144 KB Output is correct
15 Correct 21 ms 1372 KB Output is correct
16 Correct 357 ms 10612 KB Output is correct
17 Correct 165 ms 10664 KB Output is correct
18 Correct 162 ms 10580 KB Output is correct
19 Correct 347 ms 48720 KB Output is correct
20 Correct 345 ms 48724 KB Output is correct
21 Correct 364 ms 48692 KB Output is correct
22 Correct 343 ms 48724 KB Output is correct
23 Correct 344 ms 48720 KB Output is correct
24 Correct 347 ms 48724 KB Output is correct
25 Correct 337 ms 48724 KB Output is correct
26 Correct 336 ms 48724 KB Output is correct
27 Correct 357 ms 48720 KB Output is correct
28 Correct 363 ms 48720 KB Output is correct
29 Correct 359 ms 48720 KB Output is correct
30 Correct 356 ms 48872 KB Output is correct