H. Mirrored String I

Codeforces

IDCF10135H

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themselves. So, the next thing for them to discover is mirrored strings. A mirrored string is a palindrome string that will not change if you view it on a mirror. Examples of mirrored strings are "MOM", "IOI" or "HUH". Therefore, mirrored strings must contain only mirrored letters {A, H, I, M, O, T, U, V, W, X, Y} and be a palindrome. e.g. IWWI, MHHM are mirrored strings, while IWIW, TFC are not. A palindrome is a string that is read the same forwards and backwards. Can you tell if string S is a mirrored string? The first line of input is T – the number of test cases. Each test case contains a non-empty string S of maximum length 1000. The string contains only uppercase English letters. For each test case, output "yes" (without quotes) if the string S is a mirrored string, otherwise output "no". ## Input The first line of input is T – the number of test cases.Each test case contains a non-empty string S of maximum length 1000. The string contains only uppercase English letters. ## Output For each test case, output "yes" (without quotes) if the string S is a mirrored string, otherwise output "no". [samples]

**Definitions** Let $ T \in \mathbb{Z} $ be the number of test cases. Let $ S_k \in \Sigma^* $ be the input string for test case $ k \in \{1, \dots, T\} $, where $ \Sigma = \{A, B, \dots, Z\} $. Let $ M = \{A, H, I, M, O, T, U, V, W, X, Y\} $ be the set of mirrored letters. **Constraints** 1. $ 1 \leq T \leq \text{unspecified} $ 2. For each $ k $: - $ 1 \leq |S_k| \leq 1000 $ - $ S_k \in \Sigma^* $, consisting only of uppercase English letters. **Objective** For each test case $ k $, determine whether: 1. $ S_k $ is a palindrome: $ S_k[i] = S_k[|S_k| + 1 - i] $ for all $ i \in \{1, \dots, \lfloor |S_k|/2 \rfloor\} $, and 2. Every character in $ S_k $ belongs to $ M $. Output "yes" if both conditions hold; otherwise, output "no".

API Response (JSON)

{
  "problem": {
    "name": "H. Mirrored String I",
    "description": {
      "content": "The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themselves. So, the next thing for them to discover is mirrored strings. A mirrored string",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10135H"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themselves. So, the next thing for them to discover is mirrored strings.\n\nA mirrored string...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ T \\in \\mathbb{Z} $ be the number of test cases.  \nLet $ S_k \\in \\Sigma^* $ be the input string for test case $ k \\in \\{1, \\dots, T\\} $, where $ \\Sigma = \\{A, B, \\dots, Z\\} $.  ...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments