Submission #20,203

20203

2026-01-04 22:20:57

pypy3

Accepted 50/50

82ms

32000 KiB

# UUID: 897eacb0-031b-422b-afd5-43f777a14c44
N, P = map(int,input().split())
F = [int(x) for x in input().split()]

res = 10**7
i = j = 0
sum = F[0]
while j < N:
    if sum < P:
        j += 1
        if j < N:
            sum += F[j]
        else:
            break
    else:
        res = min(res, j-i+1)
        sum -= F[i]
        i += 1


print(res)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	39ms	19612 KiB
		2	Accepted	0/0	82ms	32000 KiB
		3	Accepted	2/2	39ms	19428 KiB
		4	Accepted	2/2	43ms	19416 KiB
		5	Accepted	2/2	39ms	19556 KiB
		6	Accepted	2/2	50ms	21736 KiB
		7	Accepted	2/2	57ms	21736 KiB
		8	Accepted	2/2	52ms	21704 KiB
		9	Accepted	2/2	57ms	21712 KiB
		10	Accepted	2/2	52ms	21700 KiB
		11	Accepted	2/2	79ms	32000 KiB
		12	Accepted	2/2	71ms	31796 KiB
		13	Accepted	2/2	79ms	32000 KiB
		14	Accepted	2/2	68ms	31984 KiB
		15	Accepted	2/2	81ms	32000 KiB
		16	Accepted	2/2	68ms	32000 KiB
		17	Accepted	2/2	68ms	32000 KiB
		18	Accepted	2/2	76ms	32000 KiB
		19	Accepted	2/2	81ms	32000 KiB
		20	Accepted	2/2	71ms	31928 KiB
		21	Accepted	2/2	79ms	32000 KiB
		22	Accepted	2/2	68ms	32000 KiB
		23	Accepted	2/2	71ms	32000 KiB
		24	Accepted	2/2	78ms	32000 KiB
		25	Accepted	2/2	82ms	32000 KiB
		26	Accepted	2/2	68ms	32000 KiB
		27	Accepted	2/2	68ms	32000 KiB