58732023-10-04 17:39:22mmatedUtazásszervezés (75 pont)cpp17Accepted 75/754ms3988 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+m]={0};
    int x;
    int maxi=0;

    f(i,0,c)
    {
        cin>>x;
        if(a[x]<n) 
        {
            maxi++;
            f(j,x,x+m)    a[j]++;
        }
    } 
    //f(i,1,k+m)    cout<<a[i];
    //f(i,0,k+m)  if(maxi<a[i])   maxi=a[i];
    cout<<maxi;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/03ms1892 KiB
2Accepted0/04ms2324 KiB
3Accepted3/32ms2336 KiB
4Accepted4/42ms2548 KiB
5Accepted4/42ms2604 KiB
6Accepted4/43ms2884 KiB
7Accepted4/43ms3092 KiB
8Accepted4/43ms3488 KiB
9Accepted5/53ms3540 KiB
10Accepted5/53ms3808 KiB
11Accepted6/63ms3852 KiB
12Accepted6/63ms3636 KiB
13Accepted6/63ms3892 KiB
14Accepted6/64ms3840 KiB
15Accepted6/64ms3836 KiB
16Accepted6/64ms3988 KiB
17Accepted6/64ms3840 KiB