Submission #830677

#TimeUsernameProblemLanguageResultExecution timeMemory
830677NeroZeinRadio Towers (IOI22_towers)C++17
4 / 100
700 ms1464 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; int id; vector<int> a; void init(int N, std::vector<int> H) { a = H; id = N - 1; for (int i = 0; i < N - 1; ++i) { if (H[i] > H[i + 1] && (i == 0 || H[i] > H[i - 1])) id = i; } } int max_towers(int L, int R, int D) { if (L < id && R > id) { int mn1 = a[L], mn2 = a[R]; return (mn1 <= a[id] - D && mn2 <= a[id] - D ? 2 : 1); } 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...