# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056644 | mychecksedad | Radio Towers (IOI22_towers) | C++17 | 0 ms | 0 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;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long int
#define en cout << '\n'
#define pi pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
void op(vector<int> &a, vector<int> &A, vector<int> &B){
if(a.size() <= 1){
A = a;
B.pb(0);
return;
}
A.pb(a[0]);
A.pb(a[1]);
B.pb(0);
B.pb(1);
for(int i = 2; i < a.size(); ++i){
if(a[i] > A.back() && A.back() > A[int(A.size()) - 2]){
A.pop_back();
B.pop_back();
A.pb(a[i]);
B.pb(i);
}else if(a[i] < A.back() && A.back() < A[int(A.size()) - 2]){
A.pop_back();
B.pop_back();
A.pb(a[i]);
B.pb(i);
}else{
A.pb(a[i]);
B.pb(i);
}
}
}
int n;
vector<int> A, B, A2, A1, B1, B2;
void init(int nn, std::vector<int> a) { n=nn;
if(n == 1) return;
op(a, A, B);
vector<int> x, y;
for(int i = 0; i < A.size(); i += 2){
x.pb(A[i]);
}
for(int i = 1; i < A.size(); i += 2){
y.pb(A[i]);
}
// op(y, A2, B2);
// op(x, A1, B1);
}
int max_towers(int L, int R, int D) {
if(n == 1) return 1;
int l = L, r = R;
L = lower_bound(all(B), L) - B.begin();
R = upper_bound(all(B), R) - B.begin(); --R;
// cout << "f";
if(R < L) return min(r-l+1, 2);
if(L == R) return min(r-l+1, 2);
int add = (A[L] > A[L+1] && l<L && a[l] < A[L]) + (r>R && a[r] < A[R] && A[R] > A[R - 1]);
return max(min(2,r-l+1), (R-L+2)/2);
}