202552026-01-05 17:51:16algoproLeggyorsabb pénzkeresés (50)pypy3Time limit exceeded 14/50303ms32000 KiB
# UUID: ae2b7bbb-07e0-4b4f-b872-7843a8f87281
INPA, INPB = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]

idoszakok = []
CLepesek = 0
XPO = 0
YPO = 0
Cosszeg = 0
Run = True
while Run:
    try:
        if Cosszeg >= INPB:
            idoszakok.append(CLepesek)
            XPO += 1
            YPO = XPO
            CLepesek = 0
            Cosszeg = 0
        else:
            CLepesek += 1
            YPO += 1
            Cosszeg += A[YPO]
    except:
        Run = False

print(min(idoszakok))

#3 6 4 2 3 7 2 9
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/039ms19428 KiB
2Time limit exceeded0/0284ms31836 KiB
3Accepted2/252ms21448 KiB
4Accepted2/246ms21436 KiB
5Wrong answer0/239ms19424 KiB
6Accepted2/268ms21496 KiB
7Accepted2/2105ms21720 KiB
8Accepted2/2125ms21764 KiB
9Accepted2/270ms21736 KiB
10Accepted2/2114ms21736 KiB
11Runtime error0/285ms32000 KiB
12Time limit exceeded0/2289ms31980 KiB
13Time limit exceeded0/2303ms31976 KiB
14Time limit exceeded0/2211ms32000 KiB
15Time limit exceeded0/2303ms31800 KiB
16Time limit exceeded0/2202ms32000 KiB
17Runtime error0/2182ms32000 KiB
18Time limit exceeded0/2282ms32000 KiB
19Time limit exceeded0/2287ms31980 KiB
20Time limit exceeded0/2286ms31924 KiB
21Time limit exceeded0/2298ms32000 KiB
22Time limit exceeded0/2282ms31976 KiB
23Time limit exceeded0/2287ms31992 KiB
24Time limit exceeded0/2289ms31980 KiB
25Time limit exceeded0/2301ms31920 KiB
26Time limit exceeded0/2287ms32000 KiB
27Time limit exceeded0/2289ms32000 KiB