A14752 | Blue-Red Permutation

You are given an array of integers $a$ of length $n$ . The elements of the array can be either different or the same.

Each element of the array is colored either blue or red. There are no unpainted elements in the array. One of the two operations described below can be applied to an array in a single step:

- either you can select any blue element and decrease its value by $1$ ;
- or you can select any red element and increase its value by $1$ .

Situations in which there are no elements of some color at all are also possible. For example, if the whole array is colored blue or red, one of the operations becomes unavailable.

Determine whether it is possible to make $0$ or more steps such that the resulting array is a permutation of numbers from $1$ to $n$ ?

In other words, check whether there exists a sequence of steps (possibly empty) such that after applying it, the array $a$ contains in some order all numbers from $1$ to $n$ (inclusive), each exactly once.

The first line contains an integer $t$ ( $1 \leq t \leq 10^4$ ) — the number of input data sets in the test.

The description of each set of input data consists of three lines. The first line contains an integer $n$ ( $1 \leq n \leq 2 \cdot 10^5$ ) — the length of the original array $a$ . The second line contains $n$ integers $a_1$ , $a_2$ , ..., $a_n$ ( $-10^9 \leq a_i \leq 10^9$ ) — the array elements themselves.

The third line has length $n$ and consists exclusively of the letters 'B' and/or 'R': $i$ th character is 'B' if $a_i$ is colored blue, and is 'R' if colored red.

It is guaranteed that the sum of $n$ over all input sets does not exceed $2 \cdot 10^5$ .

Print $t$ lines, each of which contains the answer to the corresponding test case of the input. Print YES as an answer if the corresponding array can be transformed into a permutation, and NO otherwise.

You can print the answer in any case (for example, the strings yEs, yes, Yes, and YES will be recognized as a positive answer).