Logo
(追記) (追記ここまで)

29995번 - Jumping to Victory 스페셜 저지다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
8 초 (추가 시간 없음) 1024 MB98787.500%

문제

The stage is set for the Olympic Games super volleyball finals, and tensions are high! Ricard˜ao, the coach of a competing team, is meticulously positioning his players for a strategic advantage. However, a lingering concern plagues him: the possibility that some areas of the court might be inadequately covered by his players. This could lead to exhausting lateral jumps to reach the ball.

In this high-stakes match, your task is to assist Coach Ricard˜ao by analyzing the court layout and the positions of the players. Calculate the maximum jump distance required by any player to intercept the ball, ensuring that no point on the court remains vulnerable. Professional super volleyball teams are very good, and can easily determine which is the closest player to where the ball will fall; only this player will try to reach it, all other will remain still.

The court is defined by an axis-aligned rectangle R defined by its four vertices and the players modelled as a set of N points inside this rectangle. Your task is to determine the smallest distance d such that any point on the court can be reached by at least one player, if a player can jump a distance of up to d in any direction. Remember: the border of the court is also part of the court and must be covered by the players!

입력

The first four lines contains the four vertices of R; that is, the i-th line contains two integers xi and yi (−105 ≤ xi, yi ≤ 105), representing the coordinates of the i-th vertex of R. The fifth line contains a single integer N (1 ≤ N ≤ 105), representing the number of players. Each of the following N lines contains the players coordinates, where the i-th line contains two integers xi and yi (−105 ≤ xi, yi ≤ 105), representing the coordinates of the i-th player. It’s guaranteed that every player is inside the court.

출력

Output a single line with the least d that is enough to guard the whole court. The output will be considered correct if it is within an absolute or relative error of 10−5 of the correct answer.

제한

예제 입력 1

-1 -1
1 -1
1 1
-1 1
1
0 0

예제 출력 1

1.41421356237

예제 입력 2

1 -1
-1 3
1 3
-1 -1
3
0 0
1 3
-1 3

예제 출력 2

1.666666666667

힌트

출처

ICPC > Regionals > Latin America > Sub-Regional Brasil do ACM ICPC > Maratona de Programação da SBC 2023 J번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /