Submission #625461

#	Time	Username	Problem	Language	Result	Execution time	Memory
625461		model_code	Radio Towers (IOI22_towers)	C++17	23 / 100	4064 ms	1576 KiB

towers

// time_limit/solution-amnu-linear.cpp
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

int N;
vector <int> H;

void init(int _N,vector<int> _H) {
  N = _N;
  H = _H;
}

int max_towers(int L,int R,int D) {
  int last = L, ans = 1;
  bool up = true;
  for (int i = L; i <= R; i++) {
    if (up) {
      if (H[i] >= H[last] + D) {
        up = false;
        last = i;
      }
      if (H[i] < H[last]) {
        last = i;
      }
    }
    else {
      if (H[i] <= H[last] - D) {
        up = true;
        last = i;
        ans++;
      }
      if (H[i] > H[last]) {
        last = i;
      }
    }
  }
  return ans;
}

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