1 人解决，2 人已尝试。
10 份提交通过，共有 13 份提交。
9.5 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
Safety is an important issue when planning flights. First and foremost, one should of course take every possible measure to make sure that the trip is uneventful and that no incidents occur. But even then, one should always be prepared for the worst and try to make sure that if an incident does happen, people’s chances of surviving are as high as possible.
When making an emergency landing over water, the distance to the nearest land is a critical factor. In general, the further out on open waters, the worse are the odds of survival. Thus, one important safety parameter of a flight is how far away from the nearest land any part of the flight will take you. Your job is to write a program which, given a flight route, will determine this distance.
To simplify matters, we model the world as a 2-dimensional plane rather than a sphere. We model continents as polygons, and a flight route as a sequence of key points connected by straight line segments. Flight routes always start and end strictly inside a continent, but intermediate key points may be located over water. Continents do not intersect themselves or touch each other.
Second sample case (furthest point marked with a square).
On the first line one positive number: the number of testcases, at most . After that per testcase:
One line containing two integers () and (), where is the number of continents and is the number of key points in the flight route.
lines each containing two integers giving the coordinates of the key points, from first to last.
The descriptions of the continents. Each continent description starts with a line containing an integer () giving the number of vertices of this continent. It is followed by lines, each containing a pair of integers giving the coordinates of the M vertices, in either clockwise or counter-clockwise order.
Every coordinate in the input is between and .
For each test case:
2 1 2 -9 -6 5 1 3 0 16 -16 -12 17 -6 2 3 12 4 16 17 3 9 4 1 0 4 19 19 14 6 12 3 10 10 5 3 18 2