55892023-08-02 13:05:36TomaSajtUtazásszervezés (75 pont)cpp17Accepted 75/756ms5156 KiB
#include <bits/stdc++.h>
using namespace std;

const int K_MAX = 100000;

int main() {
  int guides, k, m, c;
  cin >> guides >> k >> m >> c;

  vector<int> requests(K_MAX + 1, 0);
  for (int i = 0; i < c; i++) {
    int s;
    cin >> s;
    requests[s] += 1;
  }

  vector<int> guide_ends(K_MAX + 1, 0);
  int total = 0;

  for (int s = 1; s <= k - m + 1; s++) {
    int accepted = min(guides, requests[s]);
    total += accepted;
    guides -= accepted;
    guide_ends[s + m - 1] += accepted;
    guides += guide_ends[s];
  }
  cout << total;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/03ms3164 KiB
2Accepted0/06ms3376 KiB
3Accepted3/33ms3588 KiB
4Accepted4/43ms3792 KiB
5Accepted4/43ms4032 KiB
6Accepted4/43ms4084 KiB
7Accepted4/43ms4296 KiB
8Accepted4/43ms4380 KiB
9Accepted5/53ms4508 KiB
10Accepted5/54ms4716 KiB
11Accepted6/64ms4800 KiB
12Accepted6/66ms4804 KiB
13Accepted6/66ms4804 KiB
14Accepted6/66ms4804 KiB
15Accepted6/66ms4932 KiB
16Accepted6/66ms5068 KiB
17Accepted6/66ms5156 KiB