Submission #625464

#	Time	Username	Problem	Language	Result	Execution time	Memory
625464		model_code	Radio Towers (IOI22_towers)	C++17	56 / 100	4103 ms	158580 KiB

towers

// time_limit/solution-constant-d.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;

namespace bit {

vector<unordered_map<int, int>> bit;

void update(int x, int y, int val) {
  for (int i = x; i <= N; i += (i & -i)) {
    for (int j = y; j <= N; j += (j & -j)) {
      bit[i][j] += val;
    }
  }
}

int query(int x, int y) {
  int res = 0;
  for (int i = x; i > 0; i -= (i & -i)) {
    for (int j = y; j > 0; j -= (j & -j)) {
      if (bit[i].count(j)) {
        res += bit[i][j];
      }
    }
  }
  return res;
}

}  // namespace bit

void reset() {
  bit::bit = vector<unordered_map<int, int>>(N + 1);
}

void update(int xl, int yl, int xr, int yr, int val) {
  ++xl; ++yl; ++xr; ++yr;
  bit::update(xl, yl, val);
  bit::update(xl, yr + 1, -val);
  bit::update(xr + 1, yl, -val);
  bit::update(xr + 1, yr + 1, val);
}

int query(int x, int y) {
  ++x; ++y;
  return bit::query(x, y);
}

int lastValD = -1;

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) {
  if (D != lastValD) {
    reset();
    for (int i = 0; i < N; ++i) {
      int lower_height_left = min_st.min_left(
          i, [&] (int h) { return h >= H[i]; }) - 1;
      bool ok_left =
          lower_height_left < 0 ||
          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 >= N ||
          H[i] <= max_st.prod(i + 1, lower_height_right + 1) - D;
      update(ok_left ? 0 : (lower_height_left + 1), i,
            i, ok_right ? N - 1 : (lower_height_right - 1), 1);
    }
    lastValD = D;
  }
  return query(L, R);
}

• Subtask 1: 0 / 4
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 14 / 14
• Subtask 5: 0 / 17
• Subtask 6: 19 / 19
• Subtask 7: 0 / 23