# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
845819 | Marco_Escandon | Radio Towers (IOI22_towers) | C++17 | 532 ms | 1880 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<bits/stdc++.h>
#pragma once
using namespace std;
#include <vector>
typedef long long ll;
ll p=0;
vector<ll> h;
void init(int N, std::vector<int> H)
{
p=N+2;
h.resize(N);
h[0]=H[0];
h[N-1]=H[N-1];
for(int i=1; i<N-1; i++)
{
if(H[i]>H[i-1]&&H[i]>H[i+1])
{
p=i;
}
h[i]=H[i];
}
}
int max_towers(int L, int R, int D)
{
if(L<p&&R>p&&h[p]-D>=h[R]&&h[p]-D>=h[L])
{
return 2;
}
return 1;
}
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... |