132 2021. 01. 18 18:07:32 Valaki2 Utazásszervezés (75 pont) cpp14 Accepted 75/75 6ms 3976 KiB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, k, m, c;
    cin >> n >> k >> m >> c;
    vector<int> v(c);
    for(int& i : v) cin >> i;
    vector<int> sz(1+n, 0);
    if(k < m) {
        cout << "0\n";
        return 0;
    }
    int vind = 0;
    int db = 0;
    for(int i = 1; i <= k; ++i) {
        while(vind < c) {
            if(v[vind] == i) {
                for(int j = 1; j <= n; ++j) {
                    if(sz[j] <= i) {
                        sz[j] = i + m;
                        ++db;
                        break;
                    }
                }
                ++vind;
            } else break;
        }
    }
    cout << db << "\n";
    return 0;
}
Subtask Sum Test Verdict Time Memory
base 75/75
1 Accepted 0/0 3ms 1816 KiB
2 Accepted 0/0 6ms 2252 KiB
3 Accepted 3/3 3ms 2308 KiB
4 Accepted 4/4 3ms 2516 KiB
5 Accepted 4/4 3ms 2664 KiB
6 Accepted 4/4 3ms 2872 KiB
7 Accepted 4/4 2ms 2992 KiB
8 Accepted 4/4 3ms 3320 KiB
9 Accepted 5/5 3ms 3528 KiB
10 Accepted 5/5 3ms 3528 KiB
11 Accepted 6/6 4ms 3608 KiB
12 Accepted 6/6 4ms 3896 KiB
13 Accepted 6/6 4ms 3744 KiB
14 Accepted 6/6 4ms 3640 KiB
15 Accepted 6/6 6ms 3896 KiB
16 Accepted 6/6 6ms 3976 KiB
17 Accepted 6/6 6ms 3952 KiB