eolymp
bolt
Попробуйте наш новый интерфейс для отправки задач
Задачи

Hierarchical Democracy

Hierarchical Democracy

The presidential election in Republic of Democratia is carried out through multiple stages as follows. \begin{enumerate} \item There are exactly two presidential candidates. \item At the first stage, eligible voters go to the polls of his/her electoral district. The winner of the district is the candidate who takes a majority of the votes. Voters cast their ballots only at this first stage. \item A district of the \textbf{k}-th stage (\textbf{k} > \textbf{1}) consists of multiple districts of the \textbf{(k−1)}-th stage. In contrast, a district of the\textbf{(k−1)}-th stage is a sub-district of one and only one district of the \textbf{k}-th stage. The winner of a district of the \textbf{k}-th stage is the candidate who wins in a majority of its sub-districts of the \textbf{(k−1)}-th stage. \item The final stage has just one nation-wide district. The winner of the final stage is chosen as the president. \end{enumerate} You can assume the following about the presidential election of this country. \begin{itemize} \item Every eligible voter casts a vote. \item The number of the eligible voters of each electoral district of the first stage is odd. \item The number of the sub-districts of the \textbf{(k−1)}-th stage that constitute a district of the \textbf{k}-th stage (\textbf{k} > \textbf{1}) is also odd. \end{itemize} This means that each district of every stage has its winner (there is no tie). Your mission is to write a program that finds a way to win the presidential election with the minimum number of votes. Suppose, for instance, that the district of the final stage has three sub-districts of the first stage and that the numbers of the eligible voters of the sub-districts are \textbf{123}, \textbf{4567}, and \textbf{89}, respectively. The minimum number of votes required to be the winner is \textbf{107}, that is, \textbf{62} from the first district and \textbf{45} from the third. In this case, even if the other candidate were given all the \textbf{4567} votes in the second district, s/he would inevitably be the loser. Although you might consider this election system unfair, you should accept it as a reality. \InputFile The entire input looks like: \textbf{the number of datasets (=n)} \textbf{1st dataset} \textbf{2nd dataset} \textbf{…} \textbf{n-th dataset} The number of datasets, \textbf{n}, is no more than \textbf{100}. The number of the eligible voters of each district and the part-whole relations among districts are denoted as follows. An electoral district of the first stage is denoted as \textbf{\[c\]}, where c is the number of the eligible voters of the district. A district of the \textbf{k}-th stage (\textbf{k} > \textbf{1}) is denoted as \textbf{\[d_1d_2…d_m\]}, where \textbf{d_1}, \textbf{d_2}, …, \textbf{d_m} denote its sub-districts of the \textbf{(k−1)}-th stage in this notation. For instance, an electoral district of the first stage that has \textbf{123} eligible voters is denoted as \textbf{\[123\]}. A district of the second stage consisting of three sub-districts of the first stage that have \textbf{123}, \textbf{4567}, and \textbf{89} eligible voters, respectively, is denoted as \textbf{\[\[123\]\[4567\]\[89\]\]}. Each dataset is a line that contains the character string denoting the district of the final stage in the aforementioned notation. You can assume the following. The character string in each dataset does not include any characters except digits ('\textbf{0}', '\textbf{1}', …, '\textbf{9}') and square brackets ('\textbf{\[}', '\textbf{\]}'), and its length is between \textbf{11} and \textbf{10000}, inclusive. The number of the eligible voters of each electoral district of the first stage is between \textbf{3} and \textbf{9999}, inclusive. The number of stages is a nation-wide constant. So, for instance, \textbf{\[\[\[9\]\[9\]\[9\]\]\[9\]\[9\]\]} never appears in the input.\textbf{\[\[\[\[9\]\]\]\]} may not appear either since each district of the second or later stage must have multiple sub-districts of the previous stage. \OutputFile For each dataset, print the minimum number of votes required to be the winner of the presidential election in a line. No output line may include any characters except the digits with which the number is written.
Лимит времени 8 секунд
Лимит использования памяти 64 MiB
Входные данные #1
6
[[123][4567][89]]
[[5][3][7][3][9]]
[[[99][59][63][85][51]][[1539][7995][467]][[51][57][79][99][3][91][59]]]
[[[37][95][31][77][15]][[43][5][5][5][85]][[71][3][51][89][29]][[57][95][5][69][31]][[99][59][65][73][31]]]
[[[[9][7][3]][[3][5][7]][[7][9][5]]][[[9][9][3]][[5][9][9]][[7][7][3]]][[[5][9][7]][[3][9][3]][[9][5][5]]]]
[[8231][3721][203][3271][8843]]
Выходные данные #1
107
7
175
95
21
3599
Источник ACM International Collegiate Programming Contest, Japan Domestic Contest, Aizu, Japan, 2013-07-12