Submission #20,533

20533

2026-01-07 17:35:44

cpp17

Accepted 50/50

32ms

992 KiB

// UUID: 6ffa8385-e79b-474f-83bb-f13047a1ff90
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, P; cin>>N>>P;
	vector<int> V(N+1);
	for(int i=1; i<=N; i++) cin>>V[i];
	int bal=1, jobb=1;
	int osszeg=V[1];
	//V[0]=0;
	int M=N+1;
	while(bal<=N)
	{
		osszeg-=V[bal-1];
		while(osszeg<P)
		{
			jobb++;
			
			if(jobb>N)
			{
				cout<<M;
				return 0;
			}
			osszeg+=V[jobb];
			//cout<<bal<<" "<<jobb<<" "<<osszeg<<endl;
		}
		if(M>jobb-bal+1) M=jobb-bal+1;
		
		bal++;
	}
	cout<<M;
}

	Sum	Test	Verdict		Time	Memory
base	50/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	Accepted	2/2	1ms	400 KiB
		6	Accepted	2/2	4ms	316 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	564 KiB
		12	Accepted	2/2	30ms	992 KiB
		13	Accepted	2/2	30ms	760 KiB
		14	Accepted	2/2	30ms	564 KiB
		15	Accepted	2/2	32ms	568 KiB
		16	Accepted	2/2	32ms	756 KiB
		17	Accepted	2/2	30ms	800 KiB
		18	Accepted	2/2	30ms	564 KiB
		19	Accepted	2/2	30ms	816 KiB
		20	Accepted	2/2	30ms	580 KiB
		21	Accepted	2/2	30ms	824 KiB
		22	Accepted	2/2	30ms	800 KiB
		23	Accepted	2/2	30ms	564 KiB
		24	Accepted	2/2	32ms	564 KiB
		25	Accepted	2/2	30ms	824 KiB
		26	Accepted	2/2	30ms	564 KiB
		27	Accepted	2/2	32ms	564 KiB