CT33882

The Bracket Repair of Glowfen

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The harbor bell rings at the lantern district of Glowfen; Pia weighs the day's riddles manifests and starts the calculations. 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| <= 50169; characters are '(' and ')'.

Example 1:

Input: ))(())(((())(()))())((())())((())())(()))()(())(((()((((()(((())()((())(()()(()(())))(())()((()())))(())(())))(())())(((())))()()))))))(((())(()()()()())(())())))()()(()))())())(()()()()()))))()))()((())))()())))))()()()((()))()()))()())()((()()((((()())))((())(((()()()(())))))())))))))(((()))(((())()(()(()(()())()(()))()((()()()))()))((((())())))((((((())(()())(()()()(()((((((()()()((()(())()))))))(()()(())))(()()))()((()(()()(()()((())(()()(((())(())))))))()(()))()((()((((((()((())))()))))(()))())())()))())()(())())))))()()((((()))((()))(()(())))(((((((()()((((())((()()((()((()((()()(())))))))))))()()))(())()(()))(()((((()()))(((()()()()(())(())()())(())(()())((()((())()()(((()()))))))())(()(()))(((((((()))())(())(()(()))((()))((()(()))))))())))()))()(()())())()))())(()))(((())((()))()((…
Output: 75

Example 2:

Input: (()(())()(((())))(((())())()(()())())(()()))))((()))()))((())))((((()(((()(((((()(()()(((()((()())))()(()((()(((((((())))))()(((()())))())()())(((()))((()(()()))))))))()(()))()((((()(()())))()))()())()((()(((()))()()()((())(((()(())(((()))((())(()(((((())((((()((((()(()())()()(((((()))()(()()))())()())()((())(())()())()((((()())(())(()))()())(()(()(((((((()())))()()(()))(()((()()))()()((((()())((((()(()(()))(())()(())())(()()()(()()(())())(())))(()())()))()((()(((())())())(())(()))(())))())))())())()(()(((()())(()(())))()(())())()((((()())))((()(()))())(((()()))((((())))())(((()(()))(()(()((())))((())(()())(())()())))((()((()()()(((((((((()))))()((())(()(())()()(())((()))()()((((()(()((()())()))))()())()(())))((())()(()()))))))(()))(()()(())(((()))(()(((()((()()(((()))))()(((()())()))()())…
Output: 178

Example 3:

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

Constraints:

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

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