Submission #1223554

#TimeUsernameProblemLanguageResultExecution timeMemory
1223554trimkusRadio Towers (IOI22_towers)C++20
4 / 100
262 ms2200 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; vector<int> a; vector<int> R, L; int idx; int N; void init(int _N, std::vector<int> _H) { N = _N; a = _H; for (int i = 1; i < N; ++i) { if (a[i] > a[i - 1]) { idx = i; } } for (int i = 0; i < idx; ++i) { L.push_back(a[i]); } for (int i = idx + 1; i < N; ++i) { R.push_back(a[i]); } reverse(begin(R), end(R)); } int max_towers(int l, int r, int D) { int res = 0; if (l < idx && idx < r) { if (a[l] + D <= a[idx]) res += 1; if (a[r] + D <= a[idx]) res += 1; } else { if (idx < r) { if (a[r] + D <= a[idx]) res += 1; } else if (l < idx) { if (a[l] + D <= a[idx]) res += 1; } } res = max(res, 1); return res; }
#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...