205172026-01-07 16:16:07algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 16/5030ms1000 KiB
// UUID: dbc0136a-0110-4ace-bbe6-b0b5691fbb1b
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, p; cin >> n >> p;
	vector<int> num(n);
	for (int i=0;i<n; i++) cin >> num[i];

	int min_d = INT_MAX;

	int j=0;
	int i=0;
	int sum = num[0];

	while (i < n && j < n){
		if (sum >= p){
			min_d = min(min_d, i-j);
			sum -= num[j];
			j++;
		}
		else{
			sum += num[i];
			i++;
		}
	}

	cout << min_d;

}
SubtaskSumTestVerdictTimeMemory
base16/50
1Accepted0/01ms316 KiB
2Accepted0/029ms756 KiB
3Wrong answer0/21ms316 KiB
4Accepted2/21ms336 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/24ms316 KiB
7Wrong answer0/24ms316 KiB
8Wrong answer0/24ms504 KiB
9Wrong answer0/24ms332 KiB
10Wrong answer0/24ms512 KiB
11Accepted2/229ms564 KiB
12Wrong answer0/230ms564 KiB
13Wrong answer0/230ms796 KiB
14Wrong answer0/230ms564 KiB
15Accepted2/230ms564 KiB
16Wrong answer0/230ms820 KiB
17Accepted2/230ms564 KiB
18Accepted2/229ms564 KiB
19Wrong answer0/230ms564 KiB
20Wrong answer0/229ms564 KiB
21Wrong answer0/230ms796 KiB
22Wrong answer0/230ms564 KiB
23Wrong answer0/230ms564 KiB
24Accepted2/230ms800 KiB
25Accepted2/229ms564 KiB
26Wrong answer0/229ms564 KiB
27Wrong answer0/230ms1000 KiB