given a double string s of length n. Develop two adjusted section successions an and b of length n to such an extent that for all 1≤i≤n: on the off chance that si=1, ai=bi on the off chance that si=0, ai≠bi In case it is inconceivable, you should report about it.
Correct answer will be upvoted else downvoted. Computer science.
You are given a double string s of length n. Develop two adjusted section successions an and b of length n to such an extent that for all 1≤i≤n:
on the off chance that si=1,
on the off chance that si=0, ai≠bi
In case it is inconceivable, you should report about it.
Input
The principal line contains a solitary integer t (1≤t≤104) — the number of experiments.
The primary line of each experiment contains a solitary integer n (2≤n≤2⋅105, n is even).
The following line contains a string s of length n, comprising of characters 0 and 1.
The amount of n across all experiments doesn't surpass 2⋅105.
Output
If such two adjusted bracked arrangements exist, output "YES" on the primary line, in any case output "NO". You can print each letter regardless (upper or lower).
If the appropriate response is "YES", output the fair section groupings an and b fulfilling the conditions on the following two lines.
Step by step
Solved in 4 steps with 1 images
