oj.uz

답안 #763555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
763555 2023-06-22T12:50:24 Z drdilyor 송신탑 (IOI22_towers) C++17
17 / 100
 1981 ms 32320 KB 
#include <bits/stdc++.h>
#include "towers.h"
using namespace std;
using ll = long long;
constexpr int inf = 1e9;

template<typename T, typename Op>
struct SparseTable {
    vector<vector<T>> sparse;
    Op accum_func;

    SparseTable() = default;

    SparseTable(const vector<T>& arr, const Op func) : accum_func(func) {
        int n = arr.size();
        int logn = 32 - __builtin_clz(n);
        sparse.resize(logn, vector<T>(n));
        sparse[0] = arr;
        for (int lg = 1; lg < logn; lg++) {
            for (int i = 0; i + (1 << lg) <= n; i++) {
                sparse[lg][i] = accum_func(sparse[lg - 1][i], sparse[lg - 1][i + (1 << (lg - 1))]);
            }
        }
    }

    T find(int l, int r) { // [l, r]
        r++;
        int cur_log = 31 - __builtin_clz(r - l);
        return accum_func(sparse[cur_log][l], sparse[cur_log][r - (1 << cur_log)]);
    }
};

struct SegmentTree {
    using T = vector<int>;
    using S = int;
    const T id = {};
    inline T single(S v) { return {v}; }

    T merge(const T& l, const T& r) {
        T res(l.size() + r.size());
        std::merge(l.cbegin(), l.cend(),
              r.cbegin(), r.cend(),
              res.begin());
        return res;
    }

    int n;
    vector<T> tree;

    SegmentTree() = default;
    void init(vector<S> arr) {
        n = arr.size();
        tree.resize(n * 2, id);
        for (int i = 0; i < n; i++) {
            tree[i + n] = single(arr[i]);
        }
        build();
    }

    void build() {
        for (int i = n-1; i >= 1; i--) {
            tree[i] = merge(tree[i*2], tree[i*2 + 1]);
        }
    }

    void update(int i, S v) {
        tree[i+=n] = single(v);
        for (i /= 2; i >= 1; i/= 2)
            tree[i] = merge(tree[i*2], tree[i*2+1]);
    }

    int query(int l, int r, int x) {
        int cnt = 0;
        l += n; r += n;
        while (l <= r) {
            if (l % 2 == 1) cnt += count_ge(tree[l++], x);
            if (r % 2 == 0) cnt += count_ge(tree[r--], x);
            l /= 2; r /= 2;
        }
        return cnt;
    }

    int count_ge(T& v, int x) {
        return v.end() - lower_bound(v.begin(), v.end(), x);
    }
};


int st_min(int a, int b) { return min(a, b); }
int st_max(int a, int b) { return max(a, b); }

int n;
vector<int> h, ix;
SparseTable<int, decltype(&st_min)> hmax;
SparseTable<int, decltype(&st_max)> hmin;

vector<int> start;
SegmentTree ans;

void init(int N, std::vector<int> H) {
    n = N, h = H;
    ix.resize(n);
    start.resize(n);
    iota(ix.begin(), ix.end(), 0);
    sort(ix.begin(), ix.end(), [&](int i, int j) {
            return h[i] < h[j];
            });
    hmax = SparseTable(h, st_max);
    hmin = SparseTable(h, st_min);
    const int L = 0, R = n-1;

    for (int i = 0; i < n;i++) {
        int lD = 0, rD = inf+1;
        while (lD < rD-1) {
            int D = (lD + rD) / 2;
            bool ok = 1;
            {
                int l = L-1, r = i;
                while (l < r-1) {
                    int mid = (l+r) / 2;
                    if (hmax.find(mid, i) - h[i] >= D)
                        l = mid;
                    else r = mid;
                }
                if (hmin.find(l+1, i) < h[i]) ok = 0;
            }
            {
                int l = i, r = R+1;
                while (l < r-1) {
                    int mid = (l+r) / 2;
                    if (hmax.find(i, mid) - h[i] >= D)
                        r = mid;
                    else l = mid;
                }
                if (hmin.find(i, r-1) < h[i]) ok = 0;
            }
            if (ok) lD = D;
            else rD = D;
        }
        start[i] = lD;
    }
    ans.init(start);
}

int max_towers(int L, int R, int D) {
    return ans.query(0, n-1, D);
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 885 ms 18656 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '131'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '131'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1617 ms 31988 KB 1st lines differ - on the 1st token, expected: '11903', found: '33010'
2 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 420 ms 7348 KB Output is correct
2 Correct 1771 ms 32320 KB Output is correct
3 Correct 1775 ms 32228 KB Output is correct
4 Correct 1815 ms 32232 KB Output is correct
5 Correct 1685 ms 32220 KB Output is correct
6 Correct 1981 ms 32224 KB Output is correct
7 Correct 1850 ms 32220 KB Output is correct
8 Correct 1546 ms 32256 KB Output is correct
9 Correct 1585 ms 32224 KB Output is correct
10 Correct 1814 ms 32224 KB Output is correct
11 Correct 1767 ms 32228 KB Output is correct
12 Correct 1086 ms 32228 KB Output is correct
13 Correct 1091 ms 32228 KB Output is correct
14 Correct 1077 ms 32260 KB Output is correct
15 Correct 988 ms 32224 KB Output is correct
16 Correct 1014 ms 32228 KB Output is correct
17 Correct 1039 ms 31244 KB Output is correct
18 Correct 1107 ms 32236 KB Output is correct
19 Correct 1105 ms 32228 KB Output is correct
20 Correct 1097 ms 32228 KB Output is correct
21 Correct 1092 ms 32224 KB Output is correct
22 Correct 1094 ms 32256 KB Output is correct
23 Correct 1094 ms 32224 KB Output is correct
24 Correct 980 ms 32228 KB Output is correct
25 Correct 981 ms 32168 KB Output is correct
26 Correct 1006 ms 32228 KB Output is correct
27 Correct 980 ms 32200 KB Output is correct
28 Correct 14 ms 768 KB Output is correct
29 Correct 14 ms 720 KB Output is correct
30 Correct 14 ms 816 KB Output is correct
31 Correct 14 ms 768 KB Output is correct
32 Correct 13 ms 720 KB Output is correct
33 Correct 5 ms 464 KB Output is correct
34 Correct 12 ms 720 KB Output is correct
35 Correct 12 ms 720 KB Output is correct
36 Correct 13 ms 808 KB Output is correct
37 Correct 13 ms 776 KB Output is correct
38 Correct 12 ms 764 KB Output is correct
39 Correct 15 ms 720 KB Output is correct
40 Correct 11 ms 764 KB Output is correct
41 Correct 12 ms 768 KB Output is correct
42 Correct 11 ms 772 KB Output is correct
43 Correct 12 ms 720 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '131'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 885 ms 18656 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -