Submission #1056599

#	Time	Username	Problem	Language	Result	Execution time	Memory
1056599		mychecksedad	Radio Towers (IOI22_towers)	C++17	0 / 100	445 ms	2004 KiB

towers

#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

vector<int> A, B;
int n;
void init(int nn, std::vector<int> a) { n=nn;
  if(n == 1) return;
  A.pb(a[0]);
  A.pb(a[1]);
  B.pb(0);
  B.pb(1);
  for(int i = 2; i < n; ++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 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);
  if(A[L] > A[L + 1]) return max(min(2,r-l+1),(R-L+1)/2);
  return max(min(2,r-l+1), (R-L+2)/2);
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23