58982023-10-04 18:56:01mraronUtazásszervezés (75 pont)cpp17Accepted 75/754ms4068 KiB
#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n,k,m,c;
    cin>>n>>k>>m>>c;
    int a[k+1]={0};
    int x;
    int maxi=0;
    if(n>c)
    {
        cout<<c;
        return;
    }
    for(int i=0; i<c; i++)
    {
        cin>>x;
        if(a[x]<n) 
        {
            maxi++;
            for(int j=x; j<min(k+1, x+m); j++)   a[j]++;
        }
    } 
    cout<<maxi<<"\n";
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/03ms1896 KiB
2Accepted0/04ms2304 KiB
3Accepted3/33ms2464 KiB
4Accepted4/42ms2360 KiB
5Accepted4/42ms2440 KiB
6Accepted4/43ms2564 KiB
7Accepted4/42ms2640 KiB
8Accepted4/43ms2932 KiB
9Accepted5/53ms3024 KiB
10Accepted5/53ms3352 KiB
11Accepted6/63ms3700 KiB
12Accepted6/64ms3812 KiB
13Accepted6/63ms3916 KiB
14Accepted6/64ms3768 KiB
15Accepted6/64ms3792 KiB
16Accepted6/64ms4068 KiB
17Accepted6/64ms3928 KiB