Submission #836961

#	Time	Username	Problem	Language	Result	Execution time	Memory
836961		Abrar_Al_Samit	Radio Towers (IOI22_towers)	C++17	4 / 100	696 ms	1360 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>

using namespace std;

//subtask 1

const int nax = 100005;
int n;
int h[nax];
int tp;
void init(int N, vector<int> H) {
  n = N;
  for(int i=0; i<n; ++i) h[i] = H[i];
  if(n==1) return;

  if(H[0]>H[1]) tp = -1;
  if(H[n-2]<H[n-1]) tp = -1;

  for(int i=1; i<n-1; ++i) {
    if(H[i]>max(H[i-1], H[i+1])) {
      tp = i;
      return;
    }
  }
}

int max_towers(int L, int R, int D) {
  if(n==1 || tp==-1 || R-L+1<3) return 1;

  if(tp>L && tp<R) {
    if(min(h[tp]-h[L], h[tp]-h[R])>=D) return 2;
  }
  return 1;
}

• Subtask 1: 4 / 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