Python задание из ЕГЭ (27)

with open('27_1.txt', 'r') as file:
    n = int(file.readline())
    cars = [int(file.readline()) for i in range(n)]
 
 
def calculate_passes(cars):
    num_a = 0
    num_b = 0
    num_c = 0
    prev_car = 0
    total_points = 0
 
    for car in cars:
        if car != prev_car + 1:
            num_b = 0
            num_c = 0
        num_a += 1
        if num_b < 11 and car <= 10:
            num_b += 1
        elif num_c < 21 and car <= 21:
            num_c += 1
        prev_car = car
 
    if num_b > 0:
        total_points += num_b // 11 * 40 + (num_b % 11) * 15
    if num_c > 0:
        total_points += num_c // 21 * 70 + (num_c % 21) * 15
    total_points += num_a * 15
 
    return total_points
 
total_points = calculate_passes(cars)
print(total_points)

from math import inf, isinf
 
# сколько машин начиная с i'ой проедет по пропуску длины gap
def take_by_ticket(data, i, j, gap):
    for k in range(i, min(j, len(data))):
        if data[k] - data[i] >= gap: 
            return k - i
    return j - i
 
# полный перебор с кэшированием на интервале данных [i, j)
def solve_segment(data, i, j, cache):
    tail = j - i - 1
    if i >= j: return 0
    if not isinf(cache[tail]): return cache[tail]
 
    for gap, price in (1, 15), (11, 40), (21, 70):
        t = take_by_ticket(data, i, j, gap)
        p = solve_segment(data, i + t, j, cache)
        cache[tail] = min(p + price, cache[tail])
    
    return cache[tail]
 
def solve(data):
    data.append(data[-1] + 100)
    total, i = 0, 0
    for j in range(1, len(data)):
        if data[j] - data[j-1] >= 21:
            cache = [inf] * (j - i)
            total += solve_segment(data, i, j, cache)
            i = j
 
    return total
 
input = open('27-113b.txt').readline
data = [int(input()) for _ in range(int(input()))]
print(solve(data))

input = open('27-113b.txt').readline
n, m, inf = int(input()), 31, 999999999
data, dp = [-inf] * (m + 1), [0] * (m + 1)
 
for i, j in ((i, i & m) for i in range(n)):
    data[j], dp[j] = int(input()), inf
    for g, p, k in (1, 15, j), (11, 40, j), (21, 70, j):
        while data[j] - data[k] < g: k = (k - 1) & m
        dp[j] = min(dp[j], dp[k] + p)
 
print(dp[(n - 1) & m])