Submission #20,384

20384

2026-01-06 17:22:56

cpp17

Wrong answer 46/50

30ms

892 KiB

// UUID: 1eeff17f-de9f-4e82-a6ce-bd432f6a43fa
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, p;
	cin>>n>>p;
	vector<int>v(n);
	cin>>v[0];
	for(int i=1; i<n; i++){
		int a;
		cin>>a;
		v[i]=v[i-1]+a;
	}
	int k=0, min=0;
	while(k<(n-1) && v[k] < p){
		k++;
	}
	if(v[k] > p-1){
		min=k;
	}
	for(int i=1; i<n; i++){
		while(k < (n-1) && (v[k]-v[i]) < p){
			k++;
		}
		if(min > (k-i) && (v[k]-v[i]) > (p-1)){
			min=k-i;
		}
	}
	cout<<min;
}

	Sum	Test	Verdict		Time	Memory
base	46/50
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	30ms	564 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Wrong answer	0/2	1ms	316 KiB
		6	Accepted	2/2	4ms	436 KiB
		7	Accepted	2/2	4ms	316 KiB
		8	Accepted	2/2	4ms	316 KiB
		9	Accepted	2/2	4ms	316 KiB
		10	Accepted	2/2	4ms	316 KiB
		11	Accepted	2/2	30ms	732 KiB
		12	Accepted	2/2	30ms	564 KiB
		13	Accepted	2/2	30ms	800 KiB
		14	Accepted	2/2	30ms	564 KiB
		15	Accepted	2/2	30ms	564 KiB
		16	Accepted	2/2	30ms	564 KiB
		17	Accepted	2/2	30ms	568 KiB
		18	Accepted	2/2	30ms	564 KiB
		19	Accepted	2/2	30ms	760 KiB
		20	Accepted	2/2	30ms	756 KiB
		21	Accepted	2/2	30ms	748 KiB
		22	Accepted	2/2	30ms	564 KiB
		23	Wrong answer	0/2	30ms	892 KiB
		24	Accepted	2/2	30ms	804 KiB
		25	Accepted	2/2	30ms	564 KiB
		26	Accepted	2/2	30ms	564 KiB
		27	Accepted	2/2	30ms	800 KiB