#PU1232. USACO 2022 US Open Contest, Silver — Problem 3. COW Operations
USACO 2022 US Open Contest, Silver — Problem 3. COW Operations
USACO 2022 US Open Contest, Silver — Problem 3. COW Operations
题目描述
Bessie finds a string of length at most containing only the three characters 'C', 'O', and 'W'. She wants to know if it's possible to turn this string into a single 'C' (her favorite letter) using the following operations:
- Choose two adjacent equal letters and delete them.
- Choose one letter and replace it with the other two letters in either order. Finding the answer on the string itself isn't enough for Bessie, so she wants to know the answer for () substrings of .
输入格式
The first line contains . The next line contains . The next lines each contain two integers and (, where denotes the length of ).
输出格式
A string of length , with the -th character being 'Y' if the -th substring can be reduced and 'N' otherwise.
数据范围
Test cases 2-4 satisfy and . Test cases 5-11 satisfy no additional constraints. Problem credits: Ray Bai
样例
样例 1
COW
6
1 1
1 2
1 3
2 2
2 3
3 3
YNNNYN
The answer to the first query is yes because the first character of $s$
is already equal to 'C'.
The answer to the fifth query is yes because the substring OW from
the second to the third character of $s$ can be
converted into 'C' in two operations:
OW
-> CWW
-> C
No other substring of this example string COW can be reduced to 'C'