250562026-02-17 16:08:18Samiko4321Leggyorsabb pénzkeresés (50)python3Time limit exceeded 6/50293ms15376 KiB
N,P = map(int,input().split())
F = list(map(int,input().split()))
nap = N
eleje = 0
vege = 0
osszeg = 0
kesz = False
while not kesz:
    while eleje < N and osszeg < P:
        osszeg += F[eleje]
        eleje += 1
    if eleje == N:
        kesz = True
    if eleje - vege < nap:
        nap = eleje - vege
    while vege < eleje and osszeg > P:
        osszeg -= F[vege]
        vege += 1
    if osszeg == P:
        if eleje - vege < nap:
            nap = eleje - vege

print(nap)
SubtaskSumTestVerdictTimeMemory
base6/50
1Time limit exceeded0/0284ms2868 KiB
2Time limit exceeded0/0284ms15180 KiB
3Accepted2/216ms3124 KiB
4Time limit exceeded0/2284ms2868 KiB
5Accepted2/216ms2984 KiB
6Wrong answer0/228ms4148 KiB
7Time limit exceeded0/2289ms4148 KiB
8Time limit exceeded0/2282ms4220 KiB
9Time limit exceeded0/2284ms4148 KiB
10Accepted2/228ms4100 KiB
11Time limit exceeded0/2289ms15188 KiB
12Time limit exceeded0/2291ms15188 KiB
13Time limit exceeded0/2291ms15376 KiB
14Time limit exceeded0/2293ms15188 KiB
15Time limit exceeded0/2284ms15188 KiB
16Time limit exceeded0/2287ms15188 KiB
17Time limit exceeded0/2289ms15188 KiB
18Time limit exceeded0/2289ms15188 KiB
19Time limit exceeded0/2289ms15076 KiB
20Time limit exceeded0/2284ms15188 KiB
21Time limit exceeded0/2277ms15088 KiB
22Time limit exceeded0/2279ms14972 KiB
23Time limit exceeded0/2277ms15184 KiB
24Time limit exceeded0/2291ms15188 KiB
25Time limit exceeded0/2282ms15188 KiB
26Time limit exceeded0/2284ms14932 KiB
27Time limit exceeded0/2287ms15188 KiB