Chef And His Characters
Chef was reading a book. He decided to highlight all the lovely sentences of the book. He calls a sentence a lovely sentence if, after removing all the non-alphabetical characters (like punctuation and spaces) from it and converting all uppercase letters to lowercase, it is possible to choose four contiguous characters from the sentence and reorder them to create the string “chef”.
Chef has almost completed the highlighting work, only a few sentences are left to be checked and highlighted. Now, he wants your help in checking the remaining sentences, as he has to help his mother in the kitchen.
Each sentence s has already been preprocessed — all non-alphabetical characters have been erased and all remaining uppercase characters converted to lowercase. You should determine whether s is a lovely sentence or not. If it is a lovely sentence, then Chef is also interested in the number of possible ways to select 4 contiguous characters that can be reordered to give his name (the string “chef”).
- The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
- The first and only line of each test case contains a single string s, denoting a preprocessed sentence.
- For each test case, print a single line.
- If the string s is not a lovely string, this line should contain a single string “normal”(without quotes).
- Otherwise, it should contain the string ”lovely” (without quotes) followed by one integer — the number of ways to select the four contiguous characters.
- 1 ≤ T ≤ 200,000
- 1 ≤ |s| ≤ 500,000
- sum of |s| for all test cases ≤ 2,000,000
- s contains only lowercase English letters
Subtask #1 (20 points): 1 ≤ |s| ≤ 2000
Subtask #2 (80 points): original constraints
Input: 5 ifchefisgoodforchess fehcaskchefechohisvoice hecfisaniceperson letscallchefthefch chooseaprogrammer Output: lovely 2 lovely 3 lovely 1 lovely 3 normal
Getting tle for subtask #1.