CT30878

The Bracket Repair Beneath Starfall

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

In the observatory of Starfall, Bhanu the reckoner keeps careful count of the inscriptions. optimize the storeroom layout, every figure matters. 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| <= 40356; characters are '(' and ')'.

Example 1:

Input: (()())))((()((())))(((()())(())()(()()()())))(())((())))()(())()(((())())())))()((())())())))()(())))()))((())))(()(()())(((()((()()())(()())))((((())(()))(()()()(()((()()(())))))(()()((()))())()())(()(((()((()((()()))(()())))())(()))((())((()(()))()))))((()()(((())()(((()())()())()))())())))())(())()))))((()))))()(()()(())())))))())))(())))()((())((())())))))()))(()((())(()()(()()(())())))())(())(())()(((()()()))(())()))(())))(())(((())))))))))((()))((()()()(()(()()))(()()(()()))())))()))))))(()))()())((()))(((((()())()))(()()())())())((())(())()()()(()())))(()(())()()()())((())()()))))(((((()))()(()(())(()()))()())(())(((((())(()()))((())))(((()(())()(()((()())))))())(()(()))())))(())())))()((((())())))))()(()()(()))()((()()(())(()(()()()()(()((())(()))(((())(())()))(()()))(())((((()))()…
Output: 250

Example 2:

Input: )()())()(())))())()()))()))(()((())())((((())(())(()(((())()((()))()())())(()(((()))(())))((((((()(()()))))()()))))())))(((()))())))())(()()()((()))()(()()(((((()))(()())()()(((())))(()((((((()))()((()((())()())()((())((()(()))))))))())())()()))())(()((((()))())))))))()()()()((((()())((()()((())())))((()(((()(())())))()()((((()))())))(()(()(()()())((()))()(())()((()()))()(())))((())())))()))))())()()(((((()())))()()(())(())())()()))(((()())(((()))((((())())))(())(((())))(()(((())())))))((())(()((())()()())())()(()))(()()((()()()()))(((())))())())))))())((()((()())()))(())()())()((((()))))((()((())()))()()()))((()()(()(()((((((())())(()(()()))()())(()(((()))(()()((((()())((())))()()()))()(((())()))()((((()((((()())))(())()))())))()))))())((())()((())))(()())()(())(()())))((()))))()))())))()…
Output: 54

Example 3:

Input: ))))(()()(()()())(())))(()))))())(()())(()))))))))((()))))))()))))()()(()))(()))((()(((((()(()))))()))()((())(()()(()))))(()()()))))(())()(()(()(()((()))(((()())))(()(()))(()))((()())()))(()(())(())()(((((())())()))(()))))())))(((())))))((()(((()()(((((((()(()(())())()))()(()(()()())))(((()())(()))())())(()))()()(((((()((()())(()()))))))()(((((()((())))(()())))()(()(()))))))()()()(())(()())))(()()()((((())))())(((()))(((()((())()()()))()())(()))()))()())))(((()))()((()(()))())))())))))(()))()())))(()))))())))))((())())))())))))))))())((()(())()((())()()((()(())))()))(()))(())((((())()))())))))()())(((()(())()())))(())(()())(()()))())))))(()))))))(()))))(()))()()))()((((()((()(())(()))))((()(()((()))()))))((()())((()(()))))()()(())()()())(())))(()))())))(()(()()()()(((())()))())((())((())()…
Output: 221

Constraints:

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

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