Submission #20,252

20252

2026-01-05 17:48:26

pypy3

Accepted 50/50

86ms

31992 KiB

# UUID: 32fe765c-6403-4fbb-83f0-d2502e20ab7a
n, p = [int(x) for x in input().split()]
napok = [int(x) for x in input().split()]

l = 0
cur_sum = 0
min_len = n + 1

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

    while cur_sum >= p:
        min_len = min(min_len, i - l + 1)
        cur_sum -= napok[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	19632 KiB
		2	Accepted	0/0	85ms	31896 KiB
		3	Accepted	2/2	39ms	19620 KiB
		4	Accepted	2/2	43ms	19600 KiB
		5	Accepted	2/2	46ms	19436 KiB
		6	Accepted	2/2	52ms	21732 KiB
		7	Accepted	2/2	56ms	22232 KiB
		8	Accepted	2/2	59ms	21808 KiB
		9	Accepted	2/2	61ms	22248 KiB
		10	Accepted	2/2	52ms	21732 KiB
		11	Accepted	2/2	72ms	31992 KiB
		12	Accepted	2/2	86ms	31980 KiB
		13	Accepted	2/2	71ms	31980 KiB
		14	Accepted	2/2	82ms	31812 KiB
		15	Accepted	2/2	71ms	31792 KiB
		16	Accepted	2/2	81ms	31980 KiB
		17	Accepted	2/2	81ms	31980 KiB
		18	Accepted	2/2	72ms	31980 KiB
		19	Accepted	2/2	71ms	31792 KiB
		20	Accepted	2/2	85ms	31980 KiB
		21	Accepted	2/2	70ms	31792 KiB
		22	Accepted	2/2	74ms	31984 KiB
		23	Accepted	2/2	85ms	31912 KiB
		24	Accepted	2/2	85ms	31796 KiB
		25	Accepted	2/2	71ms	31944 KiB
		26	Accepted	2/2	71ms	31912 KiB
		27	Accepted	2/2	81ms	31980 KiB