Submission #866503

#TimeUsernameProblemLanguageResultExecution timeMemory
866503vjudge1Radio Towers (IOI22_towers)C++17
0 / 100
418 ms1600 KiB
#include "towers.h" #include<bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 3; int p = 0; int a[MAXN]; int n; void init(int N, vector<int> H) { n = N; int mx = 0; for (int i = 0; i < N; i++){ if (H[i] > mx) mx = H[i], p = i; a[i] = H[i]; } return; } int max_towers(int L, int R, int D) { if (p != 0 && p != n-1 && a[p-1] <= a[p]-D && a[p+1] <= a[p]-D){ if (L <= p-1 && p+1 <= R) return 2; } 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...