Submission #20,562

20562

2026-01-07 18:09:58

pypy3

Accepted 50/50

86ms

31984 KiB

# UUID: 9e4d4ed1-2b56-4d5b-9844-07c239265edb
N, P = [int(x) for x in input().split()]
F = [int(x) for x in input().split()]

mini = N
penz = 0
j = 0 # bal vegpont
for i in range(N): # i a jobb vegpont
    penz += F[i]
    while penz >= P:
        mini=min(mini,i-j+1)
        penz-=F[j]
        j+=1
print(mini)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	39ms	19572 KiB
		2	Accepted	0/0	83ms	31892 KiB
		3	Accepted	2/2	39ms	19564 KiB
		4	Accepted	2/2	46ms	19428 KiB
		5	Accepted	2/2	39ms	19404 KiB
		6	Accepted	2/2	52ms	21724 KiB
		7	Accepted	2/2	64ms	22252 KiB
		8	Accepted	2/2	59ms	21736 KiB
		9	Accepted	2/2	54ms	22248 KiB
		10	Accepted	2/2	52ms	21764 KiB
		11	Accepted	2/2	83ms	31980 KiB
		12	Accepted	2/2	86ms	31788 KiB
		13	Accepted	2/2	71ms	31984 KiB
		14	Accepted	2/2	74ms	31980 KiB
		15	Accepted	2/2	85ms	31980 KiB
		16	Accepted	2/2	79ms	31924 KiB
		17	Accepted	2/2	71ms	31972 KiB
		18	Accepted	2/2	71ms	31972 KiB
		19	Accepted	2/2	82ms	31876 KiB
		20	Accepted	2/2	86ms	31972 KiB
		21	Accepted	2/2	70ms	31820 KiB
		22	Accepted	2/2	75ms	31972 KiB
		23	Accepted	2/2	75ms	31984 KiB
		24	Accepted	2/2	85ms	31980 KiB
		25	Accepted	2/2	71ms	31980 KiB
		26	Accepted	2/2	83ms	31832 KiB
		27	Accepted	2/2	79ms	31980 KiB