CT34798

Draper's labels Reckoning

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Draper runs the bakery at the rookery of Crowhaven. Today the books show a list of labels, and the numbers must be worked out before sundown. Task: Print the minimum number of parentheses (either kind) that must be inserted to make the sequence balanced. Input format: One line with a string of parentheses. Output format: Print the minimum insertion count. Constraints: 1 <= |s| <= 44681; characters are '(' and ')'.

Example 1:

Input: ))(()())()))))()()))()(()()(()()())(()(()))))()(()()))()))))))((()()())((()((((())(((())())()(((())))(()((((()(())()()((()()(((())(())(((()()(()()(()))((())()(()())))))(())()())()())((((()()((()())((((()((()))()(())))()(())()())(((())))))()))()()(()()()()((()())(())))))()()((()))()))())((((()((()))((()()())()((()(((((((((())((()()()))((()()))))()))))(()()()))))))(()()))())()(()())(()()(()(((((())()(()()())())()((()()())((((())((())()()((())))(())))))()))))(()()()(()(()()()))()))()))()())())(()(()))(((()))(())))))))))(((((((())((((((())))))))()))())(()(())(()(())(((()((()()()()))()(((()(()()(()()))())(()((())))()((()))()())))((()(()(()((())))()))(()(()()))(()))((()()))()()()(())()((()(()())()())((()(((((()(((((()))()()()()(())(())((()(()()(((()((()(((()())))())))))()()()())())(((()))()()))(…
Output: 116

Example 2:

Input: (()())((((()(())())()(()((())))))(())()(()(()()))((()(()((((()))((()))((()))))()))(())))())))(()))())()(())((()))(()()()))()())((()))())())()()())())())(()))()(()()))()())((())))())((())))()()(()((())(())(((()(()))()))))())(((()(((()()())())((((())()()((()()())()()()()))()))(()))(())))))))(()())())()()))(((((((())(())))))()(((((((())))())()()))))()))()(()))))))(()())(()())(()())(()())))()))((())()()(()(())())))())((()))()))()((((((()(())))()()()()))(()())()((()))((()()))(()((((())(()())((())))()()((())())))(((()(((()()))()))))(()))()()(()())))))(())))()))))(()((()(()(((()((((()((())((()((())))(())((())(())((()))(()(((())))(()))(()((())())((()))())((((()(())))()))))))()))))()))())))(()()(())()())()))(()())()()(()((()(((())))())(((((()(()))))()()))(((()()()((()()()(()(()(((((()((()))())))())…
Output: 104

Example 3:

Input: )(((()()(()(())())()())())))(()))))))(()())((()((((())())(()((()()(((()))())(())()((()))())()(()())(()((()(())(()()(()()(()))()()()))(()(())((()))))(())))((((()()())))()))((()())((()))(())()))((()()))(()()())))(((((()))()()))))))())((()))))())()()))((()))((())((()((()(((())()()())))))()()(())()))()()(()(()((())()())))())))((()))()))((((())))(((((())))))))))(((()()(()))))))((((()(((()))())())()()))(((())(()(())(((())))))(()())))))()())(((()()))(()((((())()()()()())()(()((()())(())()()((()(())((())((((())()((()())))())()())((((()(())))())(())(())()(()())((((())())())(((((())()(()))(((()(()()))))()))(((())(((()(())(()((()())))))()(()(()())(())(()())()()))()))())()()())()(()()())))()(()())()(()))()()()))()))(((()(())()))))()())())))(()(())()()()()())()(())))))((()))()()(()()()()))(())()()(()((…
Output: 249

Constraints:

1 <= |s| <= 44681; characters are '(' and ')'.

Loading...
Test Cases:No test cases
No test cases available.