codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1466C.md (2652B)


      1 Source: https://codeforces.com/problemset/problem/1466/C
      2 
      3 C. Canine poetry
      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 After his wife's tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reaching its gates was uneasy, but passing through them proved to be even more challenging. Mostly because of Cerberus, the three-headed hound of Hades.
     22 
     23 Orpheus, a famous poet, and musician plans to calm Cerberus with his poetry and safely walk past him. He created a very peculiar poem for Cerberus. It consists only of lowercase English letters.
     24 
     25 We call a poem's substring a palindrome if and only if it reads the same backwards and forwards. A string $a$ is a substring of a string $b$ if $a$ can be obtained from $b$ by deleting several (possibly zero or all) characters from the beginning and several (possibly zero or all) characters from the end.
     26 
     27 Unfortunately, Cerberus dislikes palindromes of length greater than $1$. For example in the poem abaa the hound of Hades wouldn't like substrings aba and aa.
     28 
     29 Orpheus can only calm Cerberus if the hound likes his poetry. That's why he wants to change his poem so that it does not contain any palindrome substrings of length greater than $1$.
     30 
     31 Orpheus can modify the poem by replacing a letter at any position with any lowercase English letter. He can use this operation arbitrarily many times (possibly zero). Since there can be many palindromes in his poem, he may have to make some corrections. But how many, exactly? Given the poem, determine the minimal number of letters that have to be changed so that the poem does not contain any palindromes of length greater than $1$.
     32 
     33 Input
     34 
     35 The first line of the input contains a single integer $t$ ($1 \leq t \leq 10^5$) denoting the number of test cases, then $t$ test cases follow.
     36 
     37 The first and only line of each test case contains a non-empty string of lowercase English letters, Orpheus' poem.
     38 
     39 The sum of the length of Orpheus' poems in all test cases will not exceed $10^5$.
     40 
     41 Output
     42 
     43 You should output $t$ lines, $i$-th line should contain a single integer, answer to the $i$-th test case.
     44 
     45 Example
     46 
     47 Input
     48 
     49 ```
     50 7
     51 babba
     52 abaac
     53 codeforces
     54 zeroorez
     55 abcdcba
     56 bbbbbbb
     57 a
     58 ```
     59 
     60 Output
     61 
     62 ```
     63 1
     64 1
     65 0
     66 1
     67 1
     68 4
     69 0
     70 ```
     71 
     72 Note
     73 
     74 In the first test case, we can replace the third character with c and obtain a palindrome-less poem bacba.
     75 
     76 In the second test case, we can replace the third character with d and obtain a palindrome-less poem abdac.
     77 
     78 In the third test case, the initial poem already doesn't contain any palindromes, so Orpheus doesn't need to change anything there.