58832023-10-04 18:01:30horkaUtazásszervezés (75 pont)cpp11Accepted 75/756ms4008 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int vez,k,m,c; cin>>vez>>k>>m>>c;
	vector<int> igeny(c+1),napok(k+100);
	for(int i=1; i<=c; i++)
		{
			cin>>igeny[i];
			napok[igeny[i]]++;
		}
	vector<int> novel(k+100);
	int mo=0;
	for(int i=1; i<=k-m+3; i++)
	{
		vez+=novel[i];
		if(napok[i]==0 || vez==0) continue;
		if(napok[i]>=vez)
		{
			novel[i+m]+=vez;
			mo+=vez;
			vez=0;
		}
		else
		{
			novel[i+m]+=napok[i];
			mo+=napok[i];
			vez-=napok[i];
		}
	}
	cout<<mo<<endl;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/03ms1816 KiB
2Accepted0/06ms2504 KiB
3Accepted3/33ms2264 KiB
4Accepted4/43ms2428 KiB
5Accepted4/43ms2512 KiB
6Accepted4/43ms2752 KiB
7Accepted4/43ms2840 KiB
8Accepted4/43ms3064 KiB
9Accepted5/53ms3288 KiB
10Accepted5/53ms3400 KiB
11Accepted6/64ms3512 KiB
12Accepted6/64ms3584 KiB
13Accepted6/64ms3732 KiB
14Accepted6/66ms3796 KiB
15Accepted6/66ms3740 KiB
16Accepted6/66ms4000 KiB
17Accepted6/66ms4008 KiB