P1267 - Another String Minimization Problem

内存限制：128 MB 时间限制：1.000 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：5 通过：1 通过率：20%

You have a sequence

a1,a2,…,an 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 <= i <= 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

The first line contains the number of test cases t (1<=t<=2000)。

The first line of each test case contains two integers n and m (1≤n,m≤50) — the length of the sequence a and the length of the string s respectively.

The second line contains n integers a1,a2,…,an (1≤ai≤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.

ABABA
BABBB

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−a2=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.

模拟

1267: Another String Minimization Problem

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

数据范围与提示

分类标签