Submission #762290

#TimeUsernameProblemLanguageResultExecution timeMemory
762290raysh07Radio Towers (IOI22_towers)C++17
4 / 100
741 ms1444 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; int k; vector <int> a; void init(int N, vector<int> H) { k = -1; for (int i = 0; i < N; i++){ bool good = true; if (i != 0) good &= H[i] > H[i - 1]; if (i != N - 1) good &= H[i] > H[i + 1]; if (good) k = i; } a = H; assert(k != -1); } int max_towers(int L, int R, int D) { if (L < k && R > k) { if (a[L] <= a[k] - D && a[R] <= a[k] - D) return 2; else return 1; } else return 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...