1200C.md (1887B)
1 Source: https://codeforces.com/problemset/problem/1200/C 2 3 C. Round Corridor 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Amugae is in a very large round corridor. The corridor consists of two areas. The inner area is equally divided by $n$ sectors, and the outer area is equally divided by $m$ sectors. A wall exists between each pair of sectors of same area (inner or outer), but there is no wall between the inner area and the outer area. A wall always exists at the 12 o'clock position. 22 23  24 25 The inner area's sectors are denoted as $(1,1), (1,2), \dots, (1,n)$ in clockwise direction. The outer area's sectors are denoted as $(2,1), (2,2), \dots, (2,m)$ in the same manner. For a clear understanding, see the example image above. 26 27 Amugae wants to know if he can move from one sector to another sector. He has $q$ questions. 28 29 For each question, check if he can move between two given sectors. 30 31 Input 32 33 The first line contains three integers $n$, $m$ and $q$ ($1 \le n, m \le 10^{18}$, $1 \le q \le 10^4$) — the number of sectors in the inner area, the number of sectors in the outer area and the number of questions. 34 35 Each of the next $q$ lines contains four integers $s_x$, $s_y$, $e_x$, $e_y$ ($1 \le s_x, e_x \le 2$; if $s_x = 1$, then $1 \le s_y \le n$, otherwise $1 \le s_y \le m$; constraints on $e_y$ are similar). Amague wants to know if it is possible to move from sector $(s_x, s_y)$ to sector $(e_x, e_y)$. 36 37 Output 38 39 For each question, print "YES" if Amugae can move from $(s_x, s_y)$ to $(e_x, e_y)$, and "NO" otherwise. 40 41 You can print each letter in any case (upper or lower). 42 43 Example 44 45 Input 46 47 ``` 48 4 6 3 49 1 1 2 3 50 2 6 1 2 51 2 6 2 4 52 ``` 53 54 Output 55 56 ``` 57 YES 58 NO 59 YES 60 ``` 61 62 Note 63 64 Example is shown on the picture in the statement.