Submission #830670

#TimeUsernameProblemLanguageResultExecution timeMemory
830670NeroZeinRadio Towers (IOI22_towers)C++17
0 / 100
366 ms1328 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; int id; int mx, mx2; vector<int> a; void init(int N, std::vector<int> H) { id = N - 1; a = H; for (int i = 0; i < N - 1; ++i) { if (H[i] > H[i + 1]) id = i; } for (int i = 0; i < id; ++i) { mx = min(mx, H[i]); } for (int i = id + 1; i < N; ++i) { mx2 = min(mx, H[i]); } } int max_towers(int L, int R, int D) { return (L < id && R > id && max(a[id] - mx, a[id] - mx2) >= 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...