TAP2016F - Congratulations, Fidel!
Fidel has finished a fruitful stage of his academic formation by achieving his PhD in Physics. This was mainly the result of his firm attitude towards the formalization of the fabulous results in his fantastic investigation.
Fidel has always spread happiness among his friends and family, and that is why we have all agreed to sign a congratulation letter addressed to our favourite doctor. Having finished writing the letter, the only remaining task is to include the fervent signature of the F signers. For that purpose, we have bought two markers, one of which is French blue and the other fuchsia. Each of the signers will write their name using these markers.
It is our intention to emphasize the doctor title that Fidel has just achieved, and so we want that the abbreviation of such title ("DR") can be seen many times disguised within our signatures. To that end, we will sign using both colors, and write some letters in blue and others in fuchsia, in such a way that by reading only the fuchsia letters, Fidel may read the "DR" abbreviation.
More precisely, our goal is that by reading only those letters written in fuchsia, Fidel only reads 'D' and 'R' letters, in an alternating fashion. Consequently, the first fuchsia letter must be a 'D', and for every 'D' written in fuchsia, the next letter written in that same colour will have to be an 'R'. Similarly, for each 'R' written in fuchsia, the next letter written in that same colour will have to be a 'D', and the very last letter written in fuchsia will have to be an 'R'.
We want to write the fuchsia letters in such a way that Fidel reads the letters 'D' and 'R' written in that colour as many times as possible. In order to accomplish our goal, we can choose in which order we will write our names, and which letters we will write using each colour. Since there are many different ways to do so, we need your help to find out what is the maximum number of times that we can write the "DR" abbreviation in fuchsia, by following the rules that were explained in the previous paragraph.
Input
There are multiple test cases in the input file. For each test case, the first line contains an integer F, representing the number of signers (1 ≤ F ≤ 1000). Each of the next F lines will contain the name of one of Fidel's friends. The name of each friend is formed by no more than 100 characters from 'A' to 'Z'.
Output
For each test case, you must write a single line containing an integer, indicating the maximum number of times that the "DR" abbreviation can appear in fuchsia once we sign our letter, if we follow the rules explained in this problem statement.
Example
Input: 10 RAMIRO AUGUSTO JOAQUIN JACINTO NICOLAS ALEJANDRO DIJKSTRA KAJITA MCDONALD SCHRODINGE 4 DDD RRR DRDR RDRD 12 MELANIE DAMIAN RAMIRO AUGUSTO JOAQUIN JACINTO NICOLAS ALEJANDRO DIJKSTRA KAJITA MCDONALD SCHRODINGER 4 ABCEFG HIJKLM NOPQST UVWXYZ Output: 4 5 5 0
hide comments
joshuarl:
2022-12-29 00:20:38
How do we know to stop receiving input? I have an algo that passes all of the test input, but have no idea how to get it to work with the automatic test cases. Last edit: 2022-12-29 00:21:27 |
Added by: | Fidel Schaposnik |
Date: | 2016-09-21 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 GOSU |
Resource: | Argentinian Programming Tournament 2016 |