Submission #4,160

2023-03-15 16:53:18

python3

Accepted 50/50

150ms

36788 KiB

n, p = map(int, input().split())
arr = list(map(int, input().split()))

shortest=n+1

mostaniOsszeg = 0
bal = 0
jobb = 0

while jobb < n+1:
    if mostaniOsszeg < p:
        try:
            mostaniOsszeg += arr[jobb]
        except:
            break
        jobb+=1
    if mostaniOsszeg >= p:
        shortest = min(jobb-bal, shortest)
        mostaniOsszeg -= arr[bal]
        bal += 1






print(shortest)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	17ms	11096 KiB
		2	Accepted	0/0	145ms	33752 KiB
		3	Accepted	2/2	17ms	11016 KiB
		4	Accepted	2/2	17ms	11536 KiB
		5	Accepted	2/2	17ms	11672 KiB
		6	Accepted	2/2	29ms	14056 KiB
		7	Accepted	2/2	29ms	14144 KiB
		8	Accepted	2/2	29ms	14200 KiB
		9	Accepted	2/2	29ms	14348 KiB
		10	Accepted	2/2	28ms	14080 KiB
		11	Accepted	2/2	145ms	34980 KiB
		12	Accepted	2/2	143ms	34884 KiB
		13	Accepted	2/2	146ms	35208 KiB
		14	Accepted	2/2	144ms	35228 KiB
		15	Accepted	2/2	143ms	35420 KiB
		16	Accepted	2/2	143ms	35736 KiB
		17	Accepted	2/2	142ms	35872 KiB
		18	Accepted	2/2	144ms	35764 KiB
		19	Accepted	2/2	142ms	35944 KiB
		20	Accepted	2/2	141ms	36104 KiB
		21	Accepted	2/2	146ms	35852 KiB
		22	Accepted	2/2	150ms	36144 KiB
		23	Accepted	2/2	142ms	36212 KiB
		24	Accepted	2/2	148ms	36232 KiB
		25	Accepted	2/2	143ms	36568 KiB
		26	Accepted	2/2	150ms	36408 KiB
		27	Accepted	2/2	143ms	36788 KiB