제출 #623030

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
623030		54skyxenon	Mobile (BOI12_mobile)	Cpython 3	0 / 100	1095 ms	79508 KiB

mobile

# https://oj.uz/problem/view/BOI12_mobile

EPS = 0.00001

n, l = map(int, input().split())

def dist(c1, c2):
    return ((c1[0] - c2[0]) ** 2 + (c1[1] - c2[1]) ** 2) ** 0.5

coordinates = []
for _ in range(n):
    x, y = map(int, input().split())
    coordinates.append((x, y))

def min_val(origin):
    return min(dist((origin, 0), coord) for coord in coordinates)

def bs(lo, hi):
    while lo + EPS < hi:
        mid = (lo + hi) / 2

        left = min_val(mid - EPS)
        right = min_val(mid + EPS)

        if left > right:
            hi = mid
        else:
            lo = mid

    return min_val(lo)

print(bs(0, l))

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5