Submission #733186

#	Time	Username	Problem	Language	Result	Execution time	Memory
733186		puppy	Radio Towers (IOI22_towers)	C++17	0 / 100	1022 ms	1840 KiB

towers

#include "towers.h"

#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
namespace {
    int N, K;
    int H[100005];
    int rH[100005];
}

void init(int N, std::vector<int> H) {
    ::N = N;
    ::K = -1;
    for (int i = 0; i < N; i++) {
        ::H[i] = H[i];
    }
    for (int i = 0; i < N - 1; i++) {
        if (H[i] > H[i+1]) {
            K = i;
            break;
        }
    }
    if (K == -1) K = N - 1;
    for (int i = 0; i < N; i++) rH[i] = H[N-1-i];
}

int max_towers(int L, int R, int D) {
  if (R <= K || K <= L) return 0;
  int it1 = upper_bound(H, H + K + 1, H[K] - D) - H - 1;
  int it2 = upper_bound(rH, rH + (N-1-K) + 1, H[K] - D) - rH - 1;
  return (it1 + 1) * (it2 + 1);
}

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