A15197 | Another String Minimization Problem
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You have a sequence $a_1, a_2, \ldots, a_n$ of length $n$ , consisting of integers between $1$ and $m$ . You also have a string $s$ , consisting of $m$ characters B.
You are going to perform the following $n$ operations.
- At the $i$ -th ( $1 \le i \le n$ ) operation, you replace either the $a_i$ -th or the $(m + 1 - a_i)$ -th character of $s$ with A. You can replace the character at any position multiple times through the operations.
Find the lexicographically smallest string you can get after these operations.
A string $x$ is lexicographically smaller than a string $y$ of the same length if and only if in the first position where $x$ and $y$ differ, the string $x$ has a letter that appears earlier in the alphabet than the corresponding letter in $y$ .
You are going to perform the following $n$ operations.
- At the $i$ -th ( $1 \le i \le n$ ) operation, you replace either the $a_i$ -th or the $(m + 1 - a_i)$ -th character of $s$ with A. You can replace the character at any position multiple times through the operations.
Find the lexicographically smallest string you can get after these operations.
A string $x$ is lexicographically smaller than a string $y$ of the same length if and only if in the first position where $x$ and $y$ differ, the string $x$ has a letter that appears earlier in the alphabet than the corresponding letter in $y$ .
输入格式
The first line contains the number of test cases $t$ ( $1 \le t \le 2000$ ).
The first line of each test case contains two integers $n$ and $m$ ( $1 \le n, m \le 50$ ) — the length of the sequence $a$ and the length of the string $s$ respectively.
The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \le a_i \le m$ ) — the sequence $a$ .
The first line of each test case contains two integers $n$ and $m$ ( $1 \le n, m \le 50$ ) — the length of the sequence $a$ and the length of the string $s$ respectively.
The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \le a_i \le m$ ) — the sequence $a$ .
输出格式
For each test case, print a string of length $m$ — the lexicographically smallest string you can get. Each character of the string should be either capital English letter A or capital English letter B.
输入输出样例
输入 #1
6 4 5 1 1 3 1 1 5 2 4 1 1 1 1 1 2 4 1 3 2 7 7 5 4 5 5 5 3 5
输出 #1
ABABA BABBB A AABB ABABBBB ABABA
In the first test case, the sequence $a = [1, 1, 3, 1]$ . One of the possible solutions is the following.
- At the $1$ -st operation, you can replace the $1$ -st character of $s$ with A. After it, $s$ becomes ABBBB.
- At the $2$ -nd operation, you can replace the $5$ -th character of $s$ with A (since $m+1-a_2=5$ ). After it, $s$ becomes ABBBA.
- At the $3$ -rd operation, you can replace the $3$ -rd character of $s$ with A. After it, $s$ becomes ABABA.
- At the $4$ -th operation, you can replace the $1$ -st character of $s$ with A. After it, $s$ remains equal to ABABA.
The resulting string is ABABA. It is impossible to produce a lexicographically smaller string.In the second test case, you are going to perform only one operation. You can replace either the $2$ -nd character or $4$ -th character of $s$ with A. You can get strings BABBB and BBBAB after the operation. The string BABBB is the lexicographically smallest among these strings.
In the third test case, the only string you can get is A.
In the fourth test case, you can replace the $1$ -st and $2$ -nd characters of $s$ with A to get AABB.
In the fifth test case, you can replace the $1$ -st and $3$ -rd characters of $s$ with A to get ABABBBB.
- At the $1$ -st operation, you can replace the $1$ -st character of $s$ with A. After it, $s$ becomes ABBBB.
- At the $2$ -nd operation, you can replace the $5$ -th character of $s$ with A (since $m+1-a_2=5$ ). After it, $s$ becomes ABBBA.
- At the $3$ -rd operation, you can replace the $3$ -rd character of $s$ with A. After it, $s$ becomes ABABA.
- At the $4$ -th operation, you can replace the $1$ -st character of $s$ with A. After it, $s$ remains equal to ABABA.
The resulting string is ABABA. It is impossible to produce a lexicographically smaller string.In the second test case, you are going to perform only one operation. You can replace either the $2$ -nd character or $4$ -th character of $s$ with A. You can get strings BABBB and BBBAB after the operation. The string BABBB is the lexicographically smallest among these strings.
In the third test case, the only string you can get is A.
In the fourth test case, you can replace the $1$ -st and $2$ -nd characters of $s$ with A to get AABB.
In the fifth test case, you can replace the $1$ -st and $3$ -rd characters of $s$ with A to get ABABBBB.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted