Submission #20,511

20511

2026-01-07 14:36:49

pypy3

Accepted 50/50

82ms

31980 KiB

# UUID: b6d946ec-6756-49ef-8386-5eb879cc30a4
N, P = [int(x) for x in input().split()]
F = [int(x) for x in input().split()]+[0]
N+=1
res = 10**7
i = j = 0
sum = 0
while j < N:
    if sum < P:
        sum += F[j]
        j += 1
    else:
        res = min(res, j-i)
        sum -= F[i]
        i += 1


print(res)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	45ms	19544 KiB
		2	Accepted	0/0	71ms	31956 KiB
		3	Accepted	2/2	43ms	19608 KiB
		4	Accepted	2/2	39ms	19368 KiB
		5	Accepted	2/2	39ms	19576 KiB
		6	Accepted	2/2	57ms	21468 KiB
		7	Accepted	2/2	59ms	21504 KiB
		8	Accepted	2/2	50ms	21640 KiB
		9	Accepted	2/2	50ms	21480 KiB
		10	Accepted	2/2	52ms	21732 KiB
		11	Accepted	2/2	68ms	31940 KiB
		12	Accepted	2/2	82ms	31980 KiB
		13	Accepted	2/2	71ms	31792 KiB
		14	Accepted	2/2	70ms	31840 KiB
		15	Accepted	2/2	82ms	31932 KiB
		16	Accepted	2/2	81ms	31980 KiB
		17	Accepted	2/2	70ms	31980 KiB
		18	Accepted	2/2	68ms	31828 KiB
		19	Accepted	2/2	82ms	31976 KiB
		20	Accepted	2/2	82ms	31820 KiB
		21	Accepted	2/2	70ms	31804 KiB
		22	Accepted	2/2	70ms	31904 KiB
		23	Accepted	2/2	81ms	31972 KiB
		24	Accepted	2/2	81ms	31848 KiB
		25	Accepted	2/2	72ms	31900 KiB
		26	Accepted	2/2	71ms	31980 KiB
		27	Accepted	2/2	79ms	31980 KiB