Submission #627325

#TimeUsernameProblemLanguageResultExecution timeMemory
627325coloboxxRadio Towers (IOI22_towers)C++17
0 / 100
3846 ms1440 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 64; int n; vector<int> h; void init(int N, vector<int> H) { n = N, h = H; } int max_towers(int L, int R, int D) { int ans = 0, cur = INT_MAX, flag = true; for (int i = L; i <= R; ++i) if (!flag) { if (h[i] < cur) cur = h[i]; else if (h[i] - D >= cur) flag = true, cur = h[i]; } else { if (h[i] > cur) cur = h[i]; else if (h[i] - D >= cur) { flag = false, ++ans, cur = h[i]; } } return ans; }
#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...