Rubber Band

All submissions for this problem are available.
Read problems statements in Mandarin chinese, Russian and Vietnamese as well.
James has a board (a twodimensional plane) with $N$ nails sticking out of it and a rubber band tangled up between these nails. The rubber band can be viewed as a closed curve made up of $M$ line segments (a closed polyline with $M$ vertices). None of the nails intersect the rubber band, but the rubber band may intersect itself. James wants to move the rubber band away from the nails. Specifically, the rubber band is *removed* if there is a line which does not intersect the rubber band or any of the nails and splits the board into two halfplanes such that one halfplane contains all nails and the other halfplane contains the whole rubber band. James can deform, stretch and shrink the rubber band in any way he wants, as long as it does not intersect with any nail (no point of the rubber band coincides with any nail) at any time during performing the deformations. However, he is not allowed to pick up the rubber band from the board (all deformations must occur in the given 2D plane). Given the positions of the nails and the shape of the rubber band, determine if James will be able to remove the rubber band. ### Input  The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.  The first line of each test case contains a single integer $N$.  Each of the following $N$ lines contains two spaceseparated real numbers $x$ and $y$ denoting the coordinates of one nail.  The next line contains a single integer $M$.  Each of the following $M$ lines contains two spaceseparated real numbers $x$ and $y$ denoting the coordinates of one vertex of the polyline. The rubber band is formed by connecting each pair of consecutive vertices by a line segment and connecting the first and last vertex by a line segment. All real numbers on the input are given with up to 6 decimal digits. ### Output For each test case, print a single line containing the string `"YES"` if James can remove the rubber band or `"NO"` if he can not (without quotes). ### Constraints  $1 \le T \le 100$  $1 \le N \le 1,000$  $3 \le M \le 3,000$  $x, y \le 100$  it is guaranteed that the distance of any point on the rubber band from any nail is at least $10^{4}$ ### Subtasks **Subtask #1 (10 points):** time limit 1 second  $N \le 10$  $M \le 20$ **Subtask #2 (90 points):** time limit 5 seconds, original constraints ### Example Input ``` 2 1 90 90 3 0 0 10 0 5 5 1 0.6 0 6 2 2 2 1 1 1 1 1 2 1 2 2 ``` ### Example Output ``` YES NO ``` ### Explanation **Example case 1:** The rubber band is already separated from the only nail at position $(90, 90)$. **Example case 2:** The input corresponds to the image below. ![](https://codechef_shared.s3.amazonaws.com/download/upload/jineon/RUBBER.png)Author:  jcpaik 
Editorial  https://discuss.codechef.com/problems/RUBBER 
Tags  jcpaik 
Date Added:  1052018 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.5, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, CLOJ, COB, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 