제출 #894451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894451		d4xn	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	169 ms	180156 KiB

prison

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

#define int long long

const int N = 3e6+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++) {
    b[i] = 0;

    cin >> a[i];
    if (a[i] > t) continue;
    
    add[i].push_back(i);
    rem[min(n, i + t-a[i] + 1)].push_back(i);
  }
  
  set<int> st;
  int ans = 0;
  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) continue;

    if (st.empty()) ans++;
    else b[*prev(st.end())]++;
  }
  sort(b, b+n);

  for (int i = n-1; i >= max(0ll, n-1 - d + 1); i--) {
    ans += b[i];
  }
  cout << n - ans << "\n";
}

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