Submission #775840

#TimeUsernameProblemLanguageResultExecution timeMemory
775840SanguineChameleonRadio Towers (IOI22_towers)C++17
0 / 100
366 ms1848 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; const int maxN = 1e5 + 20; int cnt_min[maxN]; int H[maxN]; int N; void init(int _N, vector<int> _H) { N = _N; for (int i = 0; i < N; i++) { H[i] = _H[i]; } for (int i = 1; i < N - 1; i++) { cnt_min[i] = cnt_min[i - 1] + (cnt_min[i] < cnt_min[i - 1] && cnt_min[i] < cnt_min[i + 1]); } } int max_towers(int L, int R, int D) { if (L == R) { return 1; } if (D == 1) { return cnt_min[R - 1] - cnt_min[L] + (H[L] < H[L + 1]) + (H[R] > H[R - 1]); } return 0; }
#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...