Submission #20,287

20287

2026-01-05 19:40:36

pypy3

Accepted 50/50

85ms

32000 KiB

# UUID: 0e581ad2-6ea8-43e2-8ad6-5cfa303fbedf

N,P = [int(x) for x in input().split()]
F = [int(x) for x in input().split()]+[0]

szamok=1
osszeg=F[0]
min=N
i=0
j=1
if osszeg >= P:
    min=szamok
while j < N+1:
    #print(i,j)
    if osszeg+F[j] < P:
        osszeg+=F[j]
        szamok += 1
        j+=1
    else:
        #print(min,szamok,osszeg,i,j)
        
        if min > szamok:
            min=szamok
        osszeg-=F[i]
        szamok-=1
        i+=1
        
print(min+1)

#7 10
#10 1 1 1 1 1 1
# itt a valasz 1 es Te 2-t irsz ki azaz nem jo a megoldasod, bar lefutott:
"""
szamok=1
osszeg=F[0]
min=N
i=0
j=1
if osszeg >= P:
    min=szamok
while j < N+1:
    #print(i,j)
    if osszeg+F[j] < P:
        osszeg+=F[j]
        szamok += 1
        j+=1
    else:
        #print(min,szamok,osszeg,i,j)
        
        if min > szamok:
            min=szamok
        osszeg-=F[i]
        szamok-=1
        i+=1
        
print(min+1)
"""

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	43ms	19428 KiB
		2	Accepted	0/0	72ms	31952 KiB
		3	Accepted	2/2	43ms	19436 KiB
		4	Accepted	2/2	39ms	19672 KiB
		5	Accepted	2/2	46ms	19432 KiB
		6	Accepted	2/2	54ms	21476 KiB
		7	Accepted	2/2	52ms	21844 KiB
		8	Accepted	2/2	52ms	21712 KiB
		9	Accepted	2/2	50ms	21480 KiB
		10	Accepted	2/2	59ms	21872 KiB
		11	Accepted	2/2	79ms	31924 KiB
		12	Accepted	2/2	74ms	31872 KiB
		13	Accepted	2/2	85ms	31876 KiB
		14	Accepted	2/2	79ms	31980 KiB
		15	Accepted	2/2	71ms	31920 KiB
		16	Accepted	2/2	68ms	31848 KiB
		17	Accepted	2/2	79ms	31984 KiB
		18	Accepted	2/2	71ms	32000 KiB
		19	Accepted	2/2	82ms	31856 KiB
		20	Accepted	2/2	71ms	31880 KiB
		21	Accepted	2/2	79ms	31888 KiB
		22	Accepted	2/2	81ms	31948 KiB
		23	Accepted	2/2	71ms	31820 KiB
		24	Accepted	2/2	68ms	31844 KiB
		25	Accepted	2/2	71ms	31984 KiB
		26	Accepted	2/2	70ms	31980 KiB
		27	Accepted	2/2	78ms	31980 KiB