제출 #659383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659383		600Mihnea	The short shank; Redemption (BOI21_prison)	C++17	35 / 100	2086 ms	2448 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 ant[N];
bool valid[N];


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 i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      if (trebel[j] + i - j <= t) {
        ant[i] = j;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    valid[i] = (ant[i] > 0);
  }
  for (int iqd = 1; iqd <= d; iqd++) {
    for (int i = 1; i < n; i++) {
      gain[i] = 0;
    }
    for (int j = 1; j <= n; j++) {
      if (valid[j]) {
        gain[ant[j]]++;
        gain[j]--;
      }
    }
    for (int i = 1; i <= n; i++) {
      gain[i] += gain[i - 1];
    }
    int mx = -1, jj = -1;
    for (int i = 1; i < n; i++) {
      if (!block[i]) {
        if (gain[i] >= mx) {
          mx = gain[i];
          jj = i;
        }
      }
    }
    assert(1 <= jj && jj < n);
    block[jj] = 1;
    for (int j = 1; j <= n; j++) {
      if (ant[j] <= jj && jj < j) {
        valid[j] = 0;
      }
    }
  }
  int sol = 0;
  for (int i = 1; i <= n; i++) {
    sol += valid[i];
  }
  cout << sol << "\n";

  return 0;
}

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