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 <iostream>
#include <vector>
using namespace std;
int n,cent;
int h[200005];
void init(int N, vector<int>H)
{
int n=N;
int i;
for(i=1;i<=n;i++)
{
h[i]=H[i-1];
if(h[i]==n)
{
cent=i;
}
}
}
int max_towers(int L,int R,int D)
{
L++;
R++;
if(L<cent && R>cent && max(h[L],h[R])+D<=n)
{
return 2;
}
else
{
return 1;
}
}
# | 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... |