제출 #1029286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029286		MDario	The short shank; Redemption (BOI21_prison)	C++17	10 / 100	59 ms	20212 KiB

prison

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

#define F first
#define S second
typedef long long ll;

const string noyes[2] = {"NO", "YES"};
const ll INFLL = (1ll << 62);
const int INF = (1 << 30);
const int MAXN = 300'000;
const ll MOD = 1'000'000'007;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  ll n, D, T;
  cin >> n >> D >> T;

  ll a[n];
  for (int i = 0; i < n; i++)
    cin >> a[i];

  ll pref[n];
  {
    ll c = 0;
    ll last = INF;
    for (int i = 0; i < n; i++) {
      last = min(last + 1, a[i]);
      if (last <= T) {
        c++;
      }
      pref[i] = c;
      // cout << c << " ";
    }
    // cout << "\n";
  }

  ll suf[n];
  {
    stack<ll> slow;
    ll c = 0;
    ll last = INF;
    for (int i = n - 1; i >= 0; i--) {
      last = a[i];
      slow.push(i);
      while (!slow.empty() && abs(i - slow.top()) + last <= T) {
        c++;
        slow.pop();
      }
      suf[i] = c;
    }
    // for (int i = 0; i < n; i++)
    //   cout << suf[i] << " ";
    // cout << "\n";
  }

  ll ans = n;
  for (int i = 0; i + 1 < n; i++)
    ans = min(ans, pref[i] + suf[i + 1]);
  cout << ans << "\n";

  return 0;
}

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