|
||||||||||
Mission ImpossibleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 603 Accepted Submission(s): 292 Problem Description Flabby is an agent of CIA. At present, he has received a top-secret mission which is theft of military intelligence. After careful investigation, there is only one question to consider. In original plan, Flabby has to go through a room. In this room, there are three video cameras on the ceiling. Every video camera can photograph in any perspective, but it cannot move. It brings great difficulties to Flabby. Fortunately, there is a big machine on the ground in the room, which can be used by Flabby. Flabby has known the information about three cameras and the big machine. As his partner, your mission is to help him find the size of security zone in order to help Flabby implements the mission successfully. The size of security zone is the area of ground where cannot be photographed by cameras. The ground is represented as by z = 0. The ceiling is represented as z = 100. The machine is described as a convex polyhedron. You can always assume that the machine is placed on the ground and don¡¯t contact with ceiling. Input There are several test cases in the input files. For each test case, the first line is an integer N (N <= 100) which represents the number of points of convex polyhedron which represents the machine. Each of the following N lines contains three real numbers xi, yi, zi, which are the points¡¯ coordinate of convex polyhedron. The last three lines describe the cameras position. Each line contains two real number x, y which represents the camera¡¯s coordinate on the ceiling. Output For each test case, output the size of the security zone. The result should be printed with two digits to the right of the decimal point. Sample Input
Sample Output
Author TJU Source | ||||||||||
|