Submission #20,253

20253

2026-01-05 17:49:31

pypy3

Accepted 50/50

86ms

32000 KiB

# UUID: 97267ff7-4870-4731-9391-e49ed8ca64f7
n, p = [int(x) for x in input().split()]
f = [int(x) for x in input().split()]

bal = 0
osszeg = 0
min_nap = n + 1

for jobb in range(n):
    osszeg += f[jobb]

    while osszeg >= p:
        min_nap = min(min_nap, jobb - bal + 1)
        osszeg -= f[bal]
        bal += 1

if min_nap == n + 1:
    print(0)
else:
    print(min_nap)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	43ms	19552 KiB
		2	Accepted	0/0	75ms	31892 KiB
		3	Accepted	2/2	39ms	19616 KiB
		4	Accepted	2/2	39ms	19384 KiB
		5	Accepted	2/2	45ms	19432 KiB
		6	Accepted	2/2	52ms	21692 KiB
		7	Accepted	2/2	57ms	22248 KiB
		8	Accepted	2/2	52ms	21816 KiB
		9	Accepted	2/2	54ms	22448 KiB
		10	Accepted	2/2	52ms	21744 KiB
		11	Accepted	2/2	82ms	31800 KiB
		12	Accepted	2/2	75ms	31888 KiB
		13	Accepted	2/2	72ms	31980 KiB
		14	Accepted	2/2	83ms	31996 KiB
		15	Accepted	2/2	71ms	31788 KiB
		16	Accepted	2/2	71ms	31956 KiB
		17	Accepted	2/2	82ms	31976 KiB
		18	Accepted	2/2	72ms	31956 KiB
		19	Accepted	2/2	71ms	31920 KiB
		20	Accepted	2/2	85ms	31800 KiB
		21	Accepted	2/2	71ms	31980 KiB
		22	Accepted	2/2	85ms	31828 KiB
		23	Accepted	2/2	75ms	31900 KiB
		24	Accepted	2/2	86ms	31980 KiB
		25	Accepted	2/2	71ms	31980 KiB
		26	Accepted	2/2	81ms	31976 KiB
		27	Accepted	2/2	71ms	32000 KiB