제출 #659364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659364		600Mihnea	The short shank; Redemption (BOI21_prison)	C++17	15 / 100	2076 ms	7312 KiB

prison

#include <bits/stdc++.h>

using namespace std;

const int N = 2000000 + 7;
const int INF = (int) 1e9 + 7;
int n;
int d;
int t;
int trebel[N];
bool block[N];
int gain[N];

int compute() {
  int last = INF, sol = 0;
  for (int i = 1; i <= n; i++) {
    if (block[i - 1]) {
      last = trebel[i];
    } else {
      last = min(last + 1, trebel[i]);
    }
    sol += (last <= t);
  }
  return sol;
}

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

  //freopen ("input.txt", "r", stdin);

  cin >> n >> d >> t;
  for (int i = 1; i <= n; i++) {
    cin >> trebel[i];
  }

  for (int iqd = 1; iqd <= d; iqd++) {
    int init = compute();
    int mx = -1, jj = -1;
    for (int i = 1; i < n; i++) {
      if (!block[i]) {
        block[i] = 1;
        gain[i] = init - compute();
        assert(gain[i] >= 0);
        if (gain[i] >= mx) {
          mx = gain[i];
          jj = i;
        }
        block[i] = 0;
      }
    }
    assert(1 <= jj && jj < n);
    block[jj] = 1;
  }
  cout << compute() << "\n";

  return 0;
}

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