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;
int Max_place=0;
int Now;
vector<int> S;
void init(int N,vector<int> H){
Now=H[0];
for(int i=1;i<N;i++){
if(H[i]>H[i-1]){
Max_place++;
Now=H[i];
}
}
for(int i=0;i<N;i++){
S.push_back(H[i]);
}
}
int max_towers(int L,int R,int D){
if(L<Max_place && Max_place<R){
if(S[L]+D<=Now && S[R]+D<=Now) return 2;
}
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... |