|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||1||1||1||100.000%|
Consider an infinite two-dimensional grid. A white chip is placed in the cell (0, 0). There are also n black chips, the i-th of which is initially in the cell (xi, yi). Some chips may occupy the same cells.
Two player play a game, taking turns starting with the first player. On his turn, the first player must move the white chip from its current cell (x, y) to (x + 1, y) or (x, y + 1). The second player must move each black chip from its current position (x, y) to (x − 1, y) or (x, y − 1), choosing directions for each chip independently. If at any moment (after first or second player’s turn) the white chip shares its cell with any black chip, the first player immediately loses the game. If the first player manages to make 10100 turns without losing, he wins. Determine if the first player can win regardless of the strategy of the second player.
The first line contains an integer t: the number of test cases.
Each test case starts with a line with a positive integer n denoting the number of black chips. It is followed by n lines, each containing two integers xi and yi (0 ≤ xi, yi ≤ 100, xi + yi > 0).
It is guaranteed that the total amount of black chips over all test cases does not exceed 104.
For each test case, print a separate line with a single word: “Yes” if the first player can win, or “No” otherwise.
3 1 3 3 2 2 0 1 2 4 2 0 2 3 1 6 5 2
No Yes Yes