A16104 | Evaluate RBS

You are given $2n$ tuples of values $(a, b, c)$ , where $a$ and $b$ are positive integers and $c$ is a bracket '(' or ')'. Exactly $n$ tuples have $c = $ '(' and the other $n$ tuples have $c =$ ')'.

You are asked to choose two positive values $x$ and $y$ ( $x > 0$ and $y > 0$ ; not necessarily integers) and sort the tuples in the increasing value of $a \cdot x + b \cdot y$ . If several tuples have the same value, you can place them in any order among themselves.

Is it possible to choose such $x$ and $y$ that taking brackets $c$ from the tuples in the resulting order produces a regular bracket sequence?

A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence.

The first line contains a single integer $t$ ( $1 \le t \le 1500$ ) — the number of testcases.

The first line of each testcase contains a single integer $n$ ( $1 \le n \le 1500$ ).

The $i$ -th of the next $2n$ lines contains two integers $a_i$ and $b_i$ ( $1 \le a_i, b_i \le 10^6$ ) and a character $c_i$ ( $c_i = $ '(' or $c_i = $ ')'). Exactly $n$ tuples have $c_i = $ '(' and the other $n$ tuples have $c_i =$ ')'.

The sum of $n$ over all testcases doesn't exceed $1500$ .

For each testcase, print "YES" if it's possible to choose such $x$ and $y$ that taking brackets $c$ from the tuples in the resulting order produces a regular bracket sequence. Otherwise, print "NO".