oj.uz

Submission #625465

# Submission time Handle Problem Language Result Execution time Memory
625465 2022-08-10T12:05:52 Z model_code Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 3548 KB 
// time_limit/solution-linear.cpp
#ifndef ATCODER_INTERNAL_BITOP_HPP
#define ATCODER_INTERNAL_BITOP_HPP 1

#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
constexpr int bsf_constexpr(unsigned int n) {
    int x = 0;
    while (!(n & (1 << x))) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder

#endif  // ATCODER_INTERNAL_BITOP_HPP

#ifndef ATCODER_SEGTREE_HPP
#define ATCODER_SEGTREE_HPP 1

#include <algorithm>
#include <cassert>
#include <vector>

namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}
    explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) const {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() const { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) const {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) const {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) const {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) const {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder

#endif  // ATCODER_SEGTREE_HPP

#include "towers.h"

#include <bits/stdc++.h>
using namespace std;

int Max(int a, int b) {
  return max(a, b);
}

int Min(int a, int b) {
  return min(a, b);
}

int Large() {
  return INT_MAX >> 1;
}

int Small() {
  return -Large();
}

typedef atcoder::segtree<int, Max, Small> MaxSegtree;
typedef atcoder::segtree<int, Min, Large> MinSegtree;

int N;
vector<int> H;
MaxSegtree max_st;
MinSegtree min_st;

void init(int _N, std::vector<int> _H) {
  N = _N;
  H = _H;
  max_st = MaxSegtree(H);
  min_st = MinSegtree(H);
}

int max_towers(int L, int R, int D) {
  int answer = 0;
  
  for (int i = L; i <= R; ++i) {
    int lower_height_left = min_st.min_left(
        i, [&] (int h) { return h >= H[i]; }) - 1;
    bool ok_left =
        lower_height_left < L ||
        H[i] <= max_st.prod(lower_height_left, i) - D;
    int lower_height_right = min_st.max_right(
        i + 1, [&] (int h) { return h >= H[i]; });
    bool ok_right =
        lower_height_right > R ||
        H[i] <= max_st.prod(i + 1, lower_height_right + 1) - D;
    if (ok_left && ok_right) {
      ++answer;
    }
  }
  return answer;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4083 ms 1920 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 360 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 376 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 360 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 376 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 2032 KB Output is correct
37 Correct 27 ms 3496 KB Output is correct
38 Correct 24 ms 3504 KB Output is correct
39 Correct 17 ms 3480 KB Output is correct
40 Correct 19 ms 3484 KB Output is correct
41 Correct 21 ms 3484 KB Output is correct
42 Correct 23 ms 3488 KB Output is correct
43 Correct 36 ms 3492 KB Output is correct
44 Correct 36 ms 3492 KB Output is correct
45 Correct 16 ms 3504 KB Output is correct
46 Correct 20 ms 3488 KB Output is correct
47 Correct 25 ms 3484 KB Output is correct
48 Correct 22 ms 3472 KB Output is correct
49 Correct 24 ms 3536 KB Output is correct
50 Correct 20 ms 3484 KB Output is correct
51 Correct 23 ms 3484 KB Output is correct
52 Correct 34 ms 3512 KB Output is correct
53 Correct 28 ms 3488 KB Output is correct
54 Correct 28 ms 3504 KB Output is correct
55 Correct 31 ms 3500 KB Output is correct
56 Correct 27 ms 3548 KB Output is correct
57 Correct 23 ms 3516 KB Output is correct
58 Correct 33 ms 3496 KB Output is correct
59 Correct 40 ms 3512 KB Output is correct
60 Correct 21 ms 3548 KB Output is correct
61 Correct 29 ms 3496 KB Output is correct
62 Correct 27 ms 3480 KB Output is correct
63 Correct 25 ms 3528 KB Output is correct
64 Correct 22 ms 3520 KB Output is correct
65 Correct 31 ms 3400 KB Output is correct
66 Correct 36 ms 3528 KB Output is correct
67 Correct 23 ms 3484 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4091 ms 3484 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4085 ms 1020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 360 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 376 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 2032 KB Output is correct
37 Correct 27 ms 3496 KB Output is correct
38 Correct 24 ms 3504 KB Output is correct
39 Correct 17 ms 3480 KB Output is correct
40 Correct 19 ms 3484 KB Output is correct
41 Correct 21 ms 3484 KB Output is correct
42 Correct 23 ms 3488 KB Output is correct
43 Correct 36 ms 3492 KB Output is correct
44 Correct 36 ms 3492 KB Output is correct
45 Correct 16 ms 3504 KB Output is correct
46 Correct 20 ms 3488 KB Output is correct
47 Correct 25 ms 3484 KB Output is correct
48 Correct 22 ms 3472 KB Output is correct
49 Correct 24 ms 3536 KB Output is correct
50 Correct 20 ms 3484 KB Output is correct
51 Correct 23 ms 3484 KB Output is correct
52 Correct 34 ms 3512 KB Output is correct
53 Correct 28 ms 3488 KB Output is correct
54 Correct 28 ms 3504 KB Output is correct
55 Correct 31 ms 3500 KB Output is correct
56 Correct 27 ms 3548 KB Output is correct
57 Correct 23 ms 3516 KB Output is correct
58 Correct 33 ms 3496 KB Output is correct
59 Correct 40 ms 3512 KB Output is correct
60 Correct 21 ms 3548 KB Output is correct
61 Correct 29 ms 3496 KB Output is correct
62 Correct 27 ms 3480 KB Output is correct
63 Correct 25 ms 3528 KB Output is correct
64 Correct 22 ms 3520 KB Output is correct
65 Correct 31 ms 3400 KB Output is correct
66 Correct 36 ms 3528 KB Output is correct
67 Correct 23 ms 3484 KB Output is correct
68 Execution timed out 4091 ms 3484 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4083 ms 1920 KB Time limit exceeded
2 Halted 0 ms 0 KB -