Submission #733190

#TimeUsernameProblemLanguageResultExecution timeMemory
733190puppyRadio Towers (IOI22_towers)C++17
4 / 100
940 ms1568 KiB
#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 1; return (H[L] <= H[K] - D && H[R] <= H[K] - D) ? 2 : 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...