205292026-01-07 17:30:51algoproLeggyorsabb pénzkeresés (50)pypy3Wrong answer 0/50303ms31992 KiB
# UUID: b1dafe12-d49d-4753-9ec0-021a5ae10e66
n,p=[int(x) for x in input().split()]
f=[int(x) for x in input().split()]
i=0
j=0
nap=n
while j<n:
    if p>=sum(f[i:(j+1)]):
        j+=1
    else:
        i+=1
    nap=min(nap,j-i+1)
print(nap)
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/039ms19404 KiB
2Time limit exceeded0/0293ms31868 KiB
3Wrong answer0/246ms21456 KiB
4Wrong answer0/250ms21420 KiB
5Wrong answer0/254ms21528 KiB
6Wrong answer0/271ms22328 KiB
7Wrong answer0/2123ms22544 KiB
8Wrong answer0/2164ms22924 KiB
9Wrong answer0/270ms22504 KiB
10Wrong answer0/2134ms22788 KiB
11Wrong answer0/296ms31940 KiB
12Time limit exceeded0/2289ms31980 KiB
13Time limit exceeded0/2303ms31864 KiB
14Time limit exceeded0/2248ms31980 KiB
15Time limit exceeded0/2303ms31976 KiB
16Time limit exceeded0/2268ms31980 KiB
17Time limit exceeded0/2246ms31976 KiB
18Time limit exceeded0/2303ms31980 KiB
19Time limit exceeded0/2287ms31980 KiB
20Time limit exceeded0/2287ms31984 KiB
21Time limit exceeded0/2303ms31808 KiB
22Time limit exceeded0/2286ms31992 KiB
23Time limit exceeded0/2284ms31976 KiB
24Time limit exceeded0/2287ms31980 KiB
25Time limit exceeded0/2303ms31816 KiB
26Time limit exceeded0/2287ms31980 KiB
27Time limit exceeded0/2293ms31980 KiB