213592026-01-12 20:25:49ProgramozoRokaLeggyorsabb pénzkeresés (50)cpp17Wrong answer 48/5013ms1384 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, p;
	cin >> n >> p;
	vector<int> f(n);
	for (int i = 0; i < n; ++i) cin >> f[i];
	int penz = 0;
	int keret=0, minkeret = 100000;
	int j = 0;
	for (int i = 0, j = 0; i < n and j < n; ++i)
	{
		while (penz < p and j < n)
		{
			penz += f[j];
			++j;
			++keret;
		}
		if (keret < minkeret and j <= n and penz>=p) minkeret = keret;
		penz -= f[i];
		--keret;

	}
	if (keret < minkeret and j < n and penz >= p ) minkeret = keret;
	cout << minkeret;
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base48/50
1Accepted0/01ms500 KiB
2Accepted0/013ms820 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms508 KiB
5Accepted2/21ms332 KiB
6Accepted2/22ms500 KiB
7Accepted2/22ms508 KiB
8Accepted2/22ms508 KiB
9Accepted2/22ms316 KiB
10Accepted2/22ms508 KiB
11Accepted2/213ms820 KiB
12Accepted2/212ms820 KiB
13Accepted2/213ms828 KiB
14Accepted2/212ms824 KiB
15Accepted2/213ms1200 KiB
16Accepted2/213ms820 KiB
17Accepted2/213ms1080 KiB
18Accepted2/213ms840 KiB
19Accepted2/212ms820 KiB
20Accepted2/212ms820 KiB
21Accepted2/212ms820 KiB
22Accepted2/213ms1384 KiB
23Accepted2/212ms820 KiB
24Wrong answer0/212ms624 KiB
25Accepted2/212ms1020 KiB
26Accepted2/212ms1012 KiB
27Accepted2/212ms820 KiB