제출 #785240

#제출 시각아이디문제언어결과실행 시간메모리
785240vjudge1Radio Towers (IOI22_towers)C++17
0 / 100
458 ms1360 KiB
#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); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...