Submission #798451

#	Time	Username	Problem	Language	Result	Execution time	Memory
798451		jakobrs	Radio Towers (IOI22_towers)	C++17	14 / 100	803 ms	1836 KiB

towers

#include <vector>

int n;
std::vector<int> h;

std::vector<int> minima_sums;

void init(int N, std::vector<int> H) {
  n = N;
  h = H;

  minima_sums.reserve(N + 1);
  minima_sums.push_back(0);

  for (int i = 0; i < N; i++) {
    bool left_ok = i == 0 || H[i - 1] > H[i];
    bool right_ok = i + 1 == N || H[i + 1] > H[i];
    minima_sums.push_back(minima_sums.back() + (left_ok && right_ok));
  }
}

int max_towers(int L, int R, int D) {
  if (L == R) return 1;
  R += 1;

  int total = minima_sums[R - 1] - minima_sums[L + 1];
  if (h[L + 1] > h[L]) {
    total += 1;
  }
  if (h[R - 2] > h[R - 1]) {
    total += 1;
  }

  return total;
}

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