Universal Cup Judging System

Universal Cup

Límite de tiempo: 2.0 s Límite de memoria: 1024 MB Puntuación total: 100 Hackeable ✓
Estadísticas

Those who have solved Conference* may naturally come up with this problem.

You are given a string $S$ of length $N$. Each character of $S$ is one of A, B, C, or ?. In particular, the first and the last characters of $S$ are A.

For a string of length $N$ consisting only of A, B, and C, define its score as the number of integers $i$ ($1 \le i \le N - 1$) such that the $i$-th character and the $(i + 1)$-th character are different.

You are given $Q$ queries. The $i$-th query is as follows:

Non-negative integers $X_i, Y_i, Z_i$ are given, where $X_i + Y_i + Z_i$ is equal to the number of ? characters in $S$. Among all strings obtained by replacing $X_i$ of the ? characters in $S$ with A, $Y_i$ of them with B, and $Z_i$ of them with C, output the maximum possible score.

Input

The input is given in the following format:

N
S
Q
X_1 Y_1 Z_1
X_2 Y_2 Z_2
:
X_Q Y_Q Z_Q

Output

Output $Q$ lines. On the $i$-th line, output the answer to the $i$-th query.

Constraints

  • $N, Q, X_i, Y_i, Z_i$ are integers.
  • $2 \le N \le 3 \times 10^5$
  • $S$ is a string of length $N$ consisting of A, B, C, and ?.
  • The first and the last characters of $S$ are A.
  • $1 \le Q \le 2 \times 10^5$
  • $0 \le X_i$
  • $0 \le Y_i$
  • $0 \le Z_i$
  • $X_i + Y_i + Z_i$ is equal to the number of ? characters in $S$.

Examples

Input 1

9
A??B??C?A
3
1 3 1
4 1 0
0 0 5

Output 1

8
6
4

Input 2

12
A???A?B????A
4
0 8 0
2 6 0
7 1 0
3 5 0

Output 2

4
8
4
10

Input 3

28
ACB??B???BCB??B????B?AAA?BBA
26
6 1 6
4 5 4
2 3 8
9 2 2
11 0 2
8 4 1
11 0 2
2 0 11
0 1 12
12 1 0
10 3 0
1 4 8
3 7 3
2 8 3
1 3 9
11 1 1
7 0 6
6 4 3
8 4 1
0 10 3
13 0 0
11 1 1
0 6 7
2 8 3
9 0 4
0 0 13

Output 3

24
21
23
21
19
20
19
21
19
17
19
22
19
17
22
19
23
22
20
13
15
19
20
17
21
17

Note

In the first example:

  • For the first query, replacing the characters as ABCBABCBA yields a score of $8$, which is the maximum possible.
  • For the second query, replacing the characters as ABABAACAA yields a score of $6$.
  • For the third query, replacing the characters as ACCBCCCCA yields a score of $4$.

* https://www2.ioi-jp.org/camp/2025/2025-sp-tasks/contest3/conference-en.pdf

Editorials

IDTypeStatusTitlePosted ByLast UpdatedActions
#1417EditorialOpen题解jianglyView

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.