# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
813707 | LIF | Radio Towers (IOI22_towers) | C++17 | 4050 ms | 1840 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 <vector>
#include<bits/stdc++.h>
using namespace std;
int n;
pair <int,int> aa[300005];
void init(int N, std::vector<int> H) {
n = N;
for(int i=0;i<H.size();i++)
{
aa[i+1].first = H[i];
aa[i+1].second = i;
}
sort(aa+1,aa+n+1);
return;
}
bool choose[300005];
int max_towers(int L, int R, int D)
{
int ans = 0;
for(int i=1;i<=n;i++)choose[i] = false;
for(int i=1;i<=n;i++)
{
int xx = aa[i].second;
int leftmax = -1;
bool flag = true;
for(int j=xx-1;j>=1;j--)
{
if(choose[j] == false)leftmax = max(leftmax,aa[j].first);
else
{
if(aa[j].first <= leftmax - D && aa[xx].first <= leftmax - D)continue;
else flag = false;
break;
}
}
int rightmax = -1;
for(int j=xx+1;j<=n;j++)
{
if(choose[j] == false)rightmax = max(rightmax,aa[j].first);
else
{
if(aa[j].first <= rightmax - D && aa[xx].first <= rightmax - D)continue;
else flag = false;
break;
}
}
if(flag == true)
{
ans++;
choose[xx] = true;
}
}
return ans;
}
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... |