oj.uz

Submission #1054491

# Submission time Handle Problem Language Result Execution time Memory
1054491 2024-08-12T10:17:17 Z shiomusubi496 Radio Towers (IOI22_towers) C++17
18 / 100
 602 ms 17520 KB 
#include "towers.h"
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

constexpr ll inf = 1e18;

template<class M>
class SegmentTree {
    using T = typename M::T;
    int n;
    vector<T> dat;

public:
    SegmentTree() = default;
    SegmentTree(int n_, T x) {
        n = 1;
        while (n < n_) n *= 2;
        dat.assign(2 * n, x);
    }
    SegmentTree(vector<T> a) {
        n = 1;
        while (n < a.size()) n *= 2;
        dat.assign(2 * n, M::id());
        rep (i, a.size()) dat[i + n] = a[i];
        rrep2 (i, 1, n) dat[i] = M::op(dat[2 * i], dat[2 * i + 1]);
    }
    void set(int k, T x) {
        k += n;
        dat[k] = x;
        while (k > 1) {
            k /= 2;
            dat[k] = M::op(dat[2 * k], dat[2 * k + 1]);
        }
    }
    void apply(int k, T x) { set(k, M::op(dat[k + n], x)); }
    T prod(int l, int r) const {
        l += n; r += n;
        T lsm = M::id(), rsm = M::id();
        while (l < r) {
            if (l & 1) lsm = M::op(lsm, dat[l++]);
            if (r & 1) rsm = M::op(dat[--r], rsm);
            l >>= 1; r >>= 1;
        }
        return M::op(lsm, rsm);
    }
    T all_prod() const { return dat[1]; }
    T get(int k) const { return dat[k + n]; }
};

struct Max {
    using T = ll;
    static T op(T a, T b) { return max(a, b); }
    static T id() { return -inf; }
};

struct Min {
    using T = ll;
    static T op(T a, T b) { return min(a, b); }
    static T id() { return inf; }
};

struct Sum {
    using T = ll;
    static T op(T a, T b) { return a + b; }
    static T id() { return 0; }
};

struct Monoid {
    using T = tuple<ll, ll, ll>;
    static T op(T a, T b) {
        auto [a1, a2, a3] = a;
        auto [b1, b2, b3] = b;
        return {a1 + b1, min(a2, b2), max(a3, b3)};
    }
    static T id() { return {0, inf, -inf}; }
};

int N;
vector<int> H, Hs;

SegmentTree<Monoid> seg1, seg2;
SegmentTree<Min> rmq;

void init(int N_, std::vector<int> H_) {
    N = N_; H = H_;
    Hs = {};
}

void init2(int D) {
    Hs = H;
    sort(all(Hs));
    Hs.erase(unique(all(Hs)), Hs.end());
    rep (i, N) H[i] = lower_bound(all(Hs), H[i]) - Hs.begin();

    rmq = SegmentTree<Min>(N, inf);
    rep (i, N) rmq.set(i, H[i]);

    seg1 = seg2 = SegmentTree<Monoid>(N, {0, inf, -inf});
    rep (i, N) {
        if ((i == 0 || H[i - 1] > H[i]) && (i == N - 1 || H[i] < H[i + 1])) seg1.set(i, {1, i, i});
    }
    rep (i, N) {
        if ((i == 0 || H[i - 1] < H[i]) && (i == N - 1 || H[i] > H[i + 1])) seg2.set(i, {1, i, i});
    }
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> que;
    rep (i, N) {
        if (get<0>(seg2.get(i)) == 1) {
            auto [s1, l1, r1] = seg1.prod(0, i);
            auto [s2, l2, r2] = seg1.prod(i + 1, N);
            ll t = -inf;
            if (s1 != 0) chmax(t, Hs[H[r1]]);
            if (s2 != 0) chmax(t, Hs[H[l2]]);
            que.emplace(Hs[H[i]] - t, i);
        }
    }
    while (!que.empty()) {
        auto [d, k] = que.top(); que.pop();
        if (d >= D) break;
        if (get<0>(seg2.get(k)) == 0) continue;
        auto [s1, l1, r1] = seg1.prod(0, k);
        auto [s2, l2, r2] = seg1.prod(k + 1, N);
        {
            ll t = -inf;
            if (s1 != 0) chmax(t, Hs[H[r1]]);
            if (s2 != 0) chmax(t, Hs[H[l2]]);
            if (d != Hs[H[k]] - t) continue;
        }
        if (s1 == 0 || H[r1] < H[l2]) {
            seg1.set(l2, {0, inf, -inf});
            seg2.set(k, {0, inf, -inf});
            auto [s, l, r] = seg2.prod(k + 1, N);
            if (s == 0) continue;
            auto [s3, l3, r3] = seg1.prod(l + 1, N);
            ll t = -inf;
            if (s1 != 0) chmax(t, Hs[H[r1]]);
            if (s3 != 0) chmax(t, Hs[H[l3]]);
            que.emplace(Hs[H[l]] - t, l);
        }
        else {
            seg1.set(r1, {0, inf, -inf});
            seg2.set(k, {0, inf, -inf});
            auto [s, l, r] = seg2.prod(0, k);
            if (s == 0) continue;
            auto [s3, l3, r3] = seg1.prod(0, r);
            ll t = -inf;
            if (s2 != 0) chmax(t, Hs[H[l2]]);
            if (s3 != 0) chmax(t, Hs[H[r3]]);
            que.emplace(Hs[H[r]] - t, r);
        }
    }
}

int max_towers(int L, int R, int D) {
    if (Hs.empty()) init2(D);
    ++R;
    auto [s, l, r] = seg2.prod(L, R);
    if (s == 0) return 1;
    int res = s - 1;
    if (l != L && Hs[rmq.prod(L, l)] + D <= Hs[H[l]]) ++res;
    if (r != R - 1 && Hs[rmq.prod(r + 1, R)] + D <= Hs[H[r]]) ++res;
    return max(res, 1);
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 8300 KB Output is correct
2 Correct 557 ms 15816 KB Output is correct
3 Correct 536 ms 15824 KB Output is correct
4 Correct 544 ms 15824 KB Output is correct
5 Correct 525 ms 15824 KB Output is correct
6 Correct 538 ms 15824 KB Output is correct
7 Correct 539 ms 15824 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 600 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Runtime error 1 ms 856 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Runtime error 1 ms 856 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 468 ms 17356 KB Output is correct
2 Correct 528 ms 17428 KB Output is correct
3 Correct 602 ms 17492 KB Output is correct
4 Correct 590 ms 17332 KB Output is correct
5 Correct 555 ms 17352 KB Output is correct
6 Correct 557 ms 17352 KB Output is correct
7 Correct 499 ms 17352 KB Output is correct
8 Correct 458 ms 15800 KB Output is correct
9 Correct 538 ms 15824 KB Output is correct
10 Correct 479 ms 15952 KB Output is correct
11 Correct 566 ms 15960 KB Output is correct
12 Correct 537 ms 15824 KB Output is correct
13 Correct 488 ms 15824 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 32 ms 17520 KB Output is correct
18 Correct 39 ms 17356 KB Output is correct
19 Correct 39 ms 17352 KB Output is correct
20 Correct 23 ms 15824 KB Output is correct
21 Correct 17 ms 15824 KB Output is correct
22 Correct 40 ms 17352 KB Output is correct
23 Correct 36 ms 17488 KB Output is correct
24 Correct 39 ms 17360 KB Output is correct
25 Correct 16 ms 15952 KB Output is correct
26 Correct 19 ms 15824 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 0 ms 600 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 0 ms 600 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 138 ms 4440 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Runtime error 1 ms 856 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 8300 KB Output is correct
2 Correct 557 ms 15816 KB Output is correct
3 Correct 536 ms 15824 KB Output is correct
4 Correct 544 ms 15824 KB Output is correct
5 Correct 525 ms 15824 KB Output is correct
6 Correct 538 ms 15824 KB Output is correct
7 Correct 539 ms 15824 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Runtime error 1 ms 856 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -