# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078850 | mickey080929 | Radio Towers (IOI22_towers) | C++17 | 4065 ms | 1492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9 + 10;
int N;
vector<int> H;
void init(int _N, vector<int> _H) {
N = _N;
H = _H;
}
int max_towers(int L, int R, int D) {
vector<int> id;
for (int i=L; i<=R; i++) {
id.push_back(i);
}
sort(id.begin(), id.end(), [&] (int &u, int &v) { return H[u] > H[v]; });
int ans = 1;
for (int i=1; i<=id.size(); i++) {
vector<int> pos = {L-1, R+1};
for (int j=0; j<i; j++) {
pos.push_back(id[j]);
}
sort(pos.begin(), pos.end());
int cnt = 0;
for (int j=0; j+1<pos.size(); j++) {
int lh, rh;
if (pos[j] == L-1) lh = inf;
else lh = H[pos[j]];
if (pos[j+1] == R+1) rh = inf;
else rh = H[pos[j+1]];
for (int k=pos[j]+1; k<=pos[j+1]-1; k++) {
if (H[k] <= min(lh, rh) - D) {
cnt ++;
break;
}
}
}
ans = max(ans, cnt);
}
return ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |