每日一题 五十九期 Codeforces Round 859 (Div. 4)

C. Find and Replace

time limit per test: 1 second

memory limit per test: 256 megabytes

input: standard input

output: standard output

You are given a string $s$ consisting of lowercase Latin characters. In an operation, you can take a character and replace all occurrences of this character with $\text{0}$ or replace all occurrences of this character with $\text{1}$.

Is it possible to perform some number of moves so that the resulting string is an alternating binary string${}^{†}$?

For example, consider the string $\text{abacaba}$. You can perform the following moves:

• Replace $\text{a}$ with $\text{0}$. Now the string is $\text{0}\text{b}\text{0}\text{c}\text{0}\text{b}\text{0}$.
• Replace $\text{b}$ with $\text{1}$. Now the string is $\text{0}\text{1}\text{0}\text{c}\text{0}\text{1}\text{0}$.
• Replace $\text{c}$ with $\text{1}$. Now the string is $\text{0}\text{1}\text{0}\text{1}\text{0}\text{1}\text{0}$. This is an alternating binary string.

${}^{†}$An alternating binary string is a string of $\text{0}$s and $\text{1}$s such that no two adjacent bits are equal. For example, $\text{01010101}$, $\text{101}$, $\text{1}$ are alternating binary strings, but $\text{0110}$, $\text{0a0a0}$, $\text{10100}$ are not.

Input

The input consists of multiple test cases. The first line contains an integer $t$ ($1\le t\le 100$) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer $n$ ($1\le n\le 2000$) — the length of the string $s$.

The second line of each test case contains a string consisting of $n$ lowercase Latin characters — the string $s$.

Output

For each test case, output “YES” (without quotes) if you can make the string into an alternating binary string, and “NO” (without quotes) otherwise.

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

Example
inputCopy
8
7
abacaba
2
aa
1
y
4
bkpt
6
ninfia
6
banana
10
codeforces
8
testcase
outputCopy
YES
NO
YES
YES
NO
YES
NO
NO
Note

The first test case is explained in the statement.

In the second test case, the only possible binary strings you can make are $\text{00}$ and $\text{11}$, neither of which are alternating.

In the third test case, you can make $\text{1}$, which is an alternating binary string.

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<iomanip>
#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=1e9 + 7;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e6 + 10;

int t;
int n, m;
int a[N];
int st[N];
int main()
{
	string s;
	cin >> t;
	while(t --){
		int n, flag = 0;
		memset(st, 0, sizeof st);
		cin >> n;
		cin >> s;
		for(int i = 0; i < s.size(); i ++)
		{
			if(st[i]) continue;
			for(int j = i + 1; j < s.size(); j ++)
			{
				if(s[j] == s[i] && (j - i) % 2 == 1) 
				{
					flag = 1, st[j] = 1;   
                    break;
				}
			}
		}
		if(flag) puts("NO");
		else puts("YES");
	}
	return 0;
}