Submission #20,271

20271

2026-01-05 18:31:03

pypy3

Accepted 50/50

86ms

31992 KiB

# UUID: 72d7b624-f3e6-444a-aa52-fb3d58cf6544
n, p = [int(x) for x in input().split()]
f = [int(x) for x in input().split()]

l = 0
cur_sum = 0
min_len = n + 1

for i in range(n):
    cur_sum += f[i]

    while cur_sum >= p:
        min_len = min(min_len, i - l + 1)
        cur_sum -= f[l]
        l += 1

if min_len <= n:
    print(min_len)
else:
    print(0)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	39ms	19436 KiB
		2	Accepted	0/0	83ms	31828 KiB
		3	Accepted	2/2	43ms	19584 KiB
		4	Accepted	2/2	39ms	19420 KiB
		5	Accepted	2/2	39ms	19436 KiB
		6	Accepted	2/2	52ms	21700 KiB
		7	Accepted	2/2	64ms	22252 KiB
		8	Accepted	2/2	54ms	21844 KiB
		9	Accepted	2/2	63ms	22248 KiB
		10	Accepted	2/2	52ms	21736 KiB
		11	Accepted	2/2	83ms	31920 KiB
		12	Accepted	2/2	75ms	31976 KiB
		13	Accepted	2/2	81ms	31852 KiB
		14	Accepted	2/2	72ms	31944 KiB
		15	Accepted	2/2	82ms	31980 KiB
		16	Accepted	2/2	71ms	31992 KiB
		17	Accepted	2/2	70ms	31984 KiB
		18	Accepted	2/2	82ms	31980 KiB
		19	Accepted	2/2	82ms	31980 KiB
		20	Accepted	2/2	75ms	31796 KiB
		21	Accepted	2/2	70ms	31912 KiB
		22	Accepted	2/2	85ms	31796 KiB
		23	Accepted	2/2	86ms	31936 KiB
		24	Accepted	2/2	74ms	31908 KiB
		25	Accepted	2/2	71ms	31840 KiB
		26	Accepted	2/2	82ms	31884 KiB
		27	Accepted	2/2	71ms	31980 KiB