Нужно ускорить/опитимизировать код

def max_distance(trap_x, trap_y, coordinates):
    distance = 0
    for x, y in coordinates:
        distance = max(distance, abs(trap_x - x) + abs(trap_y - y))
    return distance
 
 
def main():
    M = int(input())
    coordinates = [tuple(map(int, input().split())) for _ in range(M)]
 
    x_min, _ = min(coordinates, key=lambda c: (c[0], c[1]))
    x_max, _ = max(coordinates, key=lambda c: (c[0], c[1]))
    _, y_min = min(coordinates, key=lambda c: (c[1], c[0]))
    _, y_max = max(coordinates, key=lambda c: (c[1], c[0]))
 
    min_time = float('inf')
    result_x, result_y = 0, 0
 
    for trap_x in range(x_min, x_max + 1):
        for trap_y in range(y_min, y_max + 1):
            cur_time = max_distance(trap_x, trap_y, coordinates)
            if cur_time < min_time:
                min_time = cur_time
                result_x, result_y = trap_x, trap_y
 
    print(result_x, result_y)
 
 
if __name__ == "__main__":
    main()

def distance(x1, y1, x2, y2):
    return abs(x1 - x2) + abs(y1 - y2)
 
def find_best_section(coordinates):
    min_x, max_x = min(coordinates, key=lambda c: c[0])[0], max(coordinates, key=lambda c: c[0])[0]
    min_y, max_y = min(coordinates, key=lambda c: c[1])[1], max(coordinates, key=lambda c: c[1])[1]
 
    min_max_distance = float('inf')
    best_section = None
 
    for x in range(min_x, max_x + 1):
        for y in range(min_y, max_y + 1):
            max_distance = max(distance(x, y, x_c, y_c) for x_c, y_c in coordinates)
            if max_distance < min_max_distance:
                min_max_distance = max_distance
                best_section = (x, y)
 
    return best_section
 
def main():
    M = int(input())
    coordinates = []
    for _ in range(M):
        x, y = map(int, input().split())
        coordinates.append((x, y))
 
    x_best, y_best = find_best_section(coordinates)
    print(x_best, y_best)
 
if __name__ == "__main__":
    main()

from math import sqrt
arr_x = []
arr_y = []
for _ in range(int(input())):
    x, y = map(int, input().split())
    arr_x.append(x/sqrt(2) - y/sqrt(2))
    arr_y.append(x/sqrt(2) + y/sqrt(2))
 
 
x = (max(arr_x)+min(arr_x))/2
y = (max(arr_y)+min(arr_y))/2
ans_x = x/sqrt(2) + y/sqrt(2)
ans_y = -x/sqrt(2) + y/sqrt(2)
 
print(ans_x, ans_y)

from math import sqrt
 
 
arr_x = []
arr_y = []
for _ in range(int(input())):
    x, y = map(int, input().split())
    arr_x.append(x / sqrt(2) - y / sqrt(2))
    arr_y.append(x / sqrt(2) + y / sqrt(2))
 
x = (max(arr_x) + min(arr_x)) / 2
y = (max(arr_y) + min(arr_y)) / 2
ans_x =\
    round(x / sqrt(2) + y / sqrt(2) - 1 * 10 ** -10*121)
ans_y =\
    round(-x / sqrt(2) + y / sqrt(2) + 1 * 10 ** -5)
 
print(ans_x, ans_y)

from math import sqrt
 
arr_x = []
arr_y = []
for _ in range(int(input())):
    x, y = map(int, input().split())
    arr_x.append(x / sqrt(2) - y / sqrt(2))
    arr_y.append(x / sqrt(2) + y / sqrt(2))
 
x = (max(arr_x) + min(arr_x)) / 2
y = (max(arr_y) + min(arr_y)) / 2
ans_x = \
    round(x / sqrt(2) + y / sqrt(2) - 1 * 10 ** -10 * 121)
if ans_x < 0:
    ans_x = round(1 * 10 ** -10 * 121 + ans_x)
ans_y = \
    round(-x / sqrt(2) + y / sqrt(2) + 1 * 10 ** -5)
 
print(ans_x, ans_y)