205302026-01-07 17:32:19algoproLeggyorsabb pénzkeresés (50)pypy3Wrong answer 4/5078ms31696 KiB
# UUID: 5e3e817d-3c2c-4fce-899a-8746e43595da
import sys

n, p = map(int, sys.stdin.readline().split())

min_hossz = n + 1
osszeg = 0
bal = 0
jobb = 0

for sor in sys.stdin:
    for s in sor.split():
        s = int(s)
        jobb += 1
        osszeg += s

        while osszeg >= p:
            min_hossz = min(min_hossz, jobb - bal)
            osszeg -= int(s)
            bal += 1


if min_hossz > n:
    print(0)
else:
    print(min_hossz)
SubtaskSumTestVerdictTimeMemory
base4/50
1Wrong answer0/043ms19556 KiB
2Wrong answer0/068ms31692 KiB
3Wrong answer0/239ms19400 KiB
4Wrong answer0/243ms19792 KiB
5Accepted2/245ms19440 KiB
6Wrong answer0/254ms21480 KiB
7Wrong answer0/252ms21728 KiB
8Wrong answer0/250ms21576 KiB
9Wrong answer0/257ms21496 KiB
10Wrong answer0/252ms21540 KiB
11Wrong answer0/272ms31440 KiB
12Wrong answer0/268ms31464 KiB
13Wrong answer0/278ms31468 KiB
14Wrong answer0/274ms31456 KiB
15Wrong answer0/267ms31584 KiB
16Wrong answer0/264ms31540 KiB
17Wrong answer0/264ms31660 KiB
18Wrong answer0/272ms31392 KiB
19Wrong answer0/268ms31460 KiB
20Wrong answer0/275ms31464 KiB
21Wrong answer0/272ms31496 KiB
22Wrong answer0/264ms31464 KiB
23Accepted2/275ms31696 KiB
24Wrong answer0/263ms31624 KiB
25Wrong answer0/267ms31460 KiB
26Wrong answer0/271ms31456 KiB
27Wrong answer0/271ms31396 KiB