Submission #785240

#	Time	Username	Problem	Language	Result	Execution time	Memory
785240		vjudge1	송신탑 (IOI22_towers)	C++17	0 / 100	458 ms	1360 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
int N, p;
vector<int> H;
void init(int n, vector<int> h) {
    N = n, H = h;
    for (int i = 0; i < N; i++) {
        if ((i == 0 || H[i] > H[i - 1]) && (i == N - 1 || H[i] > H[i + 1])) {
            p = i;
        }
    }
}
int max_towers(int L, int R, int D) {
    int l = upper_bound(H.begin(), H.end(), H[p] - D) - H.begin() - 1;
    int r = lower_bound(H.begin(), H.end(), H[p] - D, [&](int x, int y) {return x >= y;}) - H.begin() - 1;
    return max(0, l - L + 1) + max(0, R - r + 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