Submission #894519

#	Time	Username	Problem	Language	Result	Execution time	Memory
894519		d4xn	The short shank; Redemption (BOI21_prison)	C++17	10 / 100	167 ms	132284 KiB

prison

#include <bits/stdc++.h>
using namespace std;

const int N = 2e6+6;

int n, d, t, a[N], b[N];
vector<int> add[N], rem[N];

signed main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n >> d >> t;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] > t) continue;
    
    add[i].push_back(i);
    rem[min(n, i + t-a[i] + 1)].push_back(i);
  }
  
  int ans = 0;
  multiset<int> st;
  for (int i = 0; i < n; i++) {
    for (int& j : add[i]) st.insert(j);
    for (int& j : rem[i]) st.erase(j);

    if (a[i] <= t) {
      b[i] = -1;
      continue;
    }

    if (st.empty()) {
      b[i] = -1;
      ans++;
    }
    else b[i] = *prev(st.end());
  }

  int mx = 0;
  st.clear();
  for (int i = n-1; i >= 0; i--) {
    while (!st.empty() && *prev(st.end()) > i) {
      st.erase(prev(st.end()));
    }

    int sz = st.size();
    mx = max(mx, sz);

    if (b[i] != -1) st.insert(b[i]);
  }

  cout << n - ans - mx << "\n";
}

• Subtask 1: 0 / 15
• Subtask 2: 10 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20