시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 512 MB | 133 | 102 | 95 | 77.236% |
You have a fence post located at the point (x, y) in the plane, to which a goat is tethered by a rope. You also have a house, which you model as an axis-aligned rectangle with diagonally opposite corners at the points (x1, y1) and (x2, y2). You want to pick a length of rope that guarantees the goat cannot reach the house. Determine the minimum distance from the fence post to the house, so that you can make sure to use a shorter rope.
The input consists of a single line containing six space-separated integers x, y, x1, y1, x2, and y2, each in the range [−999, 999].
It is guaranteed that x1 < x2 and y1 < y2, and that (x, y) is strictly outside the axis-aligned rectangle with corners at (x1, y1) and (x2, y2).
Print the minimum distance from the goat’s post to the house, with a relative or absolute error no more than 0.001.
7 3 0 0 5 4
2.0
6 0 0 2 7 6
2.0
3 -4 -3 -1 -1 2
5.0
7 4 0 0 5 4
2.000
4 8 7 8 9 9
3.000
ICPC > Regionals > North America > Mid-Central Regional > 2018 Mid-Central Regional Programming Contest F번
ICPC > Regionals > North America > Southeast USA Regional > 2018 Southeast USA Regional Programming Contest > Division 2 B번
ICPC > Regionals > North America > Pacific Northwest Regional > 2018 Pacific Northwest Region Programming Contest > Division 1 G번
ICPC > Regionals > North America > Pacific Northwest Regional > 2018 Pacific Northwest Region Programming Contest > Division 2 T번