Double or One Thing solution codejam 2022 Round 1A

Double or One Thing solution codejam

 

Problem

You are given a string of uppercase English letters. You can highlight any number of the letters (possibly all or none of them). The highlighted letters do not need to be consecutive. Then, a new string is produced by processing the letters from left to right: non-highlighted letters are appended once to the new string, while highlighted letters are appended twice.

Double or One Thing example.

For example, if the initial string is HELLOWORLD, you could highlight the H, the first and last Ls and the last O to obtain HELLOWORLD  HHELLLOWOORLLD. Similarly, if you highlight nothing, you obtain HELLOWORLD, and if you highlight all of the letters, you obtain HHEELLLLOOWWOORRLLDD. Notice how each occurrence of the same letter can be highlighted independently. Given a string, there are multiple strings that can be obtained as a result of this process, depending on the highlighting choices. Among all of those strings, output the one that appears first in alphabetical (also known as lexicographical) order. Note: A string ss appears before a different string tt in alphabetical order if ss is a prefix of tt or if at the first place ss and tt differ, the letter in ss is earlier in the alphabet than the letter in tt. For example, these strings are in alphabetical order: CODEHELLOHIHIMHOMEJAM.

Input

Double or One Thing solution codejam

  The first line of the input gives the number of test cases, TTTT test cases follow. Each test case is described in a single line containing a single string SS.

Output

For each test case, output one line containing Case #xxyy, where xx is the test case number (starting from 1) and yy is the string that comes first alphabetically from the set of strings that can be produced from SS by the process described above.

Limits

Double or One Thing solution codejam

  Time limit: 2 seconds. Memory limit: 1 GB. 1T1001≤T≤100. Each character of SS is an uppercase letter from the English alphabet.

Test Set 1 (Visible Verdict)

11≤ the length of S10S≤10.

Test Set 2 (Hidden Verdict)

11≤ the length of S100S≤100.

Sample

Double or One Thing solution codejam

 
Sample Input
content_copy
3
PEEL
AAAAAAAAAA
CODEJAMDAY
Sample Output
content_copy
Case #1: PEEEEL
Case #2: AAAAAAAAAA
Case #3: CCODDEEJAAMDAAY
In Sample Case #1, these are all the strings that can be obtained, in alphabetical order: PEEEELPEEEELLPEEELPEEELLPEELPEELLPPEEEELPPEEEELLPPEEELPPEEELLPPEEL, and PPEELL. In Sample Case #2, every string that can be obtained contains only As. The shortest of those is alphabetically first, because it is a prefix of all others. In Sample Case #3, there are 10241024 possible strings which can be generated from CODEJAMDAY out of which CCODDEEJAAMDAAY is the lexicographically smallest one.

Leave a Comment