1303C.md (2080B)
1 Source: https://codeforces.com/problemset/problem/1303/C 2 3 C. Perfect Keyboard 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Polycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him — his keyboard will consist of only one row, where all $26$ lowercase Latin letters will be arranged in some order. 22 23 Polycarp uses the same password $s$ on all websites where he is registered (it is bad, but he doesn't care). He wants to assemble a keyboard that will allow to type this password very easily. He doesn't like to move his fingers while typing the password, so, for each pair of adjacent characters in $s$, they should be adjacent on the keyboard. For example, if the password is abacaba, then the layout cabdefghi... is perfect, since characters a and c are adjacent on the keyboard, and a and b are adjacent on the keyboard. It is guaranteed that there are no two adjacent equal characters in $s$, so, for example, the password cannot be password (two characters s are adjacent). 24 25 Can you help Polycarp with choosing the perfect layout of the keyboard, if it is possible? 26 27 Input 28 29 The first line contains one integer $T$ ($1 \le T \le 1000$) — the number of test cases. 30 31 Then $T$ lines follow, each containing one string $s$ ($1 \le |s| \le 200$) representing the test case. $s$ consists of lowercase Latin letters only. There are no two adjacent equal characters in $s$. 32 33 Output 34 35 For each test case, do the following: 36 37 * if it is impossible to assemble a perfect keyboard, print NO (in upper case, it matters in this problem); 38 * otherwise, print YES (in upper case), and then a string consisting of $26$ lowercase Latin letters — the perfect layout. Each Latin letter should appear in this string exactly once. If there are multiple answers, print any of them. 39 40 Example 41 42 Input 43 44 ``` 45 5 46 ababa 47 codedoca 48 abcda 49 zxzytyz 50 abcdefghijklmnopqrstuvwxyza 51 ``` 52 53 Output 54 55 ``` 56 YES 57 bacdefghijklmnopqrstuvwxyz 58 YES 59 edocabfghijklmnpqrstuvwxyz 60 NO 61 YES 62 xzytabcdefghijklmnopqrsuvw 63 NO 64 ```