codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1332A.md (2654B)


      1 Source: https://codeforces.com/problemset/problem/1332/A
      2 
      3 A. Exercising Walk
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 512 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Alice has a cute cat. To keep her cat fit, Alice wants to design an exercising walk for her cat!
     22 
     23 Initially, Alice's cat is located in a cell $(x,y)$ of an infinite grid. According to Alice's theory, cat needs to move:
     24 
     25 * exactly $a$ steps left: from $(u,v)$ to $(u-1,v)$;
     26 * exactly $b$ steps right: from $(u,v)$ to $(u+1,v)$;
     27 * exactly $c$ steps down: from $(u,v)$ to $(u,v-1)$;
     28 * exactly $d$ steps up: from $(u,v)$ to $(u,v+1)$.
     29 
     30 Note that the moves can be performed in an arbitrary order. For example, if the cat has to move $1$ step left, $3$ steps right and $2$ steps down, then the walk right, down, left, right, right, down is valid.
     31 
     32 Alice, however, is worrying that her cat might get lost if it moves far away from her. So she hopes that her cat is always in the area $[x_1,x_2]\times [y_1,y_2]$, i.e. for every cat's position $(u,v)$ of a walk $x_1 \le u \le x_2$ and $y_1 \le v \le y_2$ holds.
     33 
     34 Also, note that the cat can visit the same cell multiple times.
     35 
     36 Can you help Alice find out if there exists a walk satisfying her wishes?
     37 
     38 Formally, the walk should contain exactly $a+b+c+d$ unit moves ($a$ to the left, $b$ to the right, $c$ to the down, $d$ to the up). Alice can do the moves in any order. Her current position $(u, v)$ should always satisfy the constraints: $x_1 \le u \le x_2$, $y_1 \le v \le y_2$. The staring point is $(x, y)$.
     39 
     40 You are required to answer $t$ test cases independently.
     41 
     42 Input
     43 
     44 The first line contains a single integer $t$ ($1 \le t \le 10^3$) — the number of testcases.
     45 
     46 The first line of each test case contains four integers $a$, $b$, $c$, $d$ ($0 \le a,b,c,d \le 10^8$, $a+b+c+d \ge 1$).
     47 
     48 The second line of the test case contains six integers $x$, $y$, $x_1$, $y_1$, $x_2$, $y_2$ ($-10^8 \le x_1\le x \le x_2 \le 10^8$, $-10^8 \le y_1 \le y \le y_2 \le 10^8$).
     49 
     50 Output
     51 
     52 For each test case, output "YES" in a separate line, if there exists a walk satisfying her wishes. Otherwise, output "NO" in a separate line.
     53 
     54 You can print each letter in any case (upper or lower).
     55 
     56 Example
     57 
     58 Input
     59 
     60 ```
     61 6
     62 3 2 2 2
     63 0 0 -2 -2 2 2
     64 3 1 4 1
     65 0 0 -1 -1 1 1
     66 1 1 1 1
     67 1 1 1 1 1 1
     68 0 0 0 1
     69 0 0 0 0 0 1
     70 5 1 1 1
     71 0 0 -100 -100 0 100
     72 1 1 5 1
     73 0 0 -100 -100 100 0
     74 ```
     75 
     76 Output
     77 
     78 ```
     79 Yes
     80 No
     81 No
     82 Yes
     83 Yes
     84 Yes
     85 ```
     86 
     87 Note
     88 
     89 In the first test case, one valid exercising walk is $$(0,0)\rightarrow (-1,0) \rightarrow (-2,0)\rightarrow (-2,1) \rightarrow (-2,2)\rightarrow (-1,2)\rightarrow(0,2)\rightarrow (0,1)\rightarrow (0,0) \rightarrow (-1,0)$$