Restricted RPS
Contest: Codeforces Round 597 (Div. 2)
Difficulty rating: 1200
Tags: constructive algorithms, dp, greedy

Let $$$n$$$ be a positive integer. Let $$$a, b, c$$$ be nonnegative integers such that $$$a + b + c = n$$$.

Alice and Bob are gonna play rock-paper-scissors $$$n$$$ times. Alice knows the sequences of hands that Bob will play. However, Alice has to play rock $$$a$$$ times, paper $$$b$$$ times, and scissors $$$c$$$ times.

Alice wins if she beats Bob in at least $$$\lceil \frac{n}{2} \rceil$$$ ($$$\frac{n}{2}$$$ rounded up to the nearest integer) hands, otherwise Alice loses.

Note that in rock-paper-scissors:

- rock beats scissors;
- paper beats rock;
- scissors beat paper.

The task is, given the sequence of hands that Bob will play, and the numbers $$$a, b, c$$$, determine whether or not Alice can win. And if so, find any possible sequence of hands that Alice can use to win.

If there are multiple answers, print any of them.

Input format:
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 100$$$) — the number of test cases.

Then, $$$t$$$ testcases follow, each consisting of three lines:

- The first line contains a single integer $$$n$$$ ($$$1 \le n \le 100$$$).
- The second line contains three integers, $$$a, b, c$$$ ($$$0 \le a, b, c \le n$$$). It is guaranteed that $$$a + b + c = n$$$.
- The third line contains a string $$$s$$$ of length $$$n$$$. $$$s$$$ is made up of only 'R', 'P', and 'S'. The $$$i$$$-th character is 'R' if for his $$$i$$$-th Bob plays rock, 'P' if paper, and 'S' if scissors.

Output format:
For each testcase:

- If Alice cannot win, print "NO" (without the quotes).
- Otherwise, print "YES" (without the quotes). Also, print a string $$$t$$$ of length $$$n$$$ made up of only 'R', 'P', and 'S' — a sequence of hands that Alice can use to win. $$$t$$$ must contain exactly $$$a$$$ 'R's, $$$b$$$ 'P's, and $$$c$$$ 'S's.
- If there are multiple answers, print any of them.

The "YES" / "NO" part of the output is case-insensitive (i.e. "yEs", "no" or "YEs" are all valid answers). Note that 'R', 'P' and 'S' are case-sensitive.

Constraints:
Time limit: 1.0 s
Memory limit: 256.0 MB

Note:
In the first testcase, in the first hand, Alice plays paper and Bob plays rock, so Alice beats Bob. In the second hand, Alice plays scissors and Bob plays paper, so Alice beats Bob. In the third hand, Alice plays rock and Bob plays scissors, so Alice beats Bob. Alice beat Bob 3 times, and $$$3 \ge \lceil \frac{3}{2} \rceil = 2$$$, so Alice wins.

In the second testcase, the only sequence of hands that Alice can play is "RRR". Alice beats Bob only in the last hand, so Alice can't win. $$$1 < \lceil \frac{3}{2} \rceil = 2$$$.

Example input:
2
3
1 1 1
RPS
3
3 0 0
RPS

Example output:
YES
PSR
NO

Editorial:
Let $$$A$$$, $$$B$$$, $$$C$$$ be the number of rocks, papers, and scissors in Bob's sequence, respectively. It is easy to see that Alice can win at most $$$w := \min(A, b) + \min(B, c) + \min(C, a)$$$ hands.
So if $$$2w < n$$$, Alice can't win.
Otherwise, Alice can always win. One way to construct a winning sequence of hands for Alice is as follows:
1. Create a sequence of length $$$n$$$.
2. For Bob's first $$$\min(A, b)$$$ rock hands, put a paper hand in the corresponding position in our sequence.
3. For Bob's first $$$\min(B, c)$$$ paper hands, put a scissors hand in the corresponding position in our sequence.
4. For Bob's first $$$\min(C, a)$$$ scissors hands, put a rock hand in the corresponding position in our sequence.
5. Just fill in the other elements of the sequence by the remaining hands that Alice has.
By construction, Alice uses exactly $$$a$$$ rock hands, $$$b$$$ paper hands, and $$$c$$$ scissors hands. Also, Alice beats Bob exactly $$$w$$$ times. Since $$$2w \ge n$$$, Alice wins.