Submission #682004

#	Time	Username	Problem	Language	Result	Execution time	Memory
682004		vjudge1	Mobile (BOI12_mobile)	Cpython 2	0 / 100	12 ms	3064 KiB

mobile

import math

def distance(p1, p2):
    return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)

n, l = map(int, input().split())
stations = [tuple(map(int, input().split())) for _ in range(n)]

max_distance = 0
left, right = 0, 1
for i in range(l + 1):
    highway_point = (i, 0)
    while right < n and distance(stations[right], highway_point) < distance(stations[left], highway_point):
        left += 1
        right += 1
    max_distance = max(max_distance, distance(stations[left], highway_point))

print(max_distance)

• 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