CT35088

Squire's ribbons Bracket Repair

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The harbor bell rings at the spice bazaar of Saffronia; Squire weighs the day's ribbons 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| <= 39302; characters are '(' and ')'.

Example 1:

Input: ()(((()(()((((()))()()())))())(((()())((()(())(((()))())))((()((()(())))((((()()()()((()((()((()(())))())()())()((()()()(((()(()(((()((()()))((())())(())(()())(())(())()()))()(((()()(()())())))(())(()(()))))()((())()(((()()((((())(())))(()))))))())()))()))))))()(()))(())()()(((())()((()())())(())()(()(((()(((())()(())))))(()((()))()(()))(((())(())())()()))(()()()()()((()(())))()))()(()))()(((())()(((()))()))((()))(((())(())))())(()))())(()()))()())())((()((()()())(()(()(()(((())((((())(())((())())(((((((()(((()()())())(((()))((())))())))(())((()())()(()))(((()(((())))()))))(())))((())(((()(((()((()(((((()(()(())()))(()))()()()))))(((()(((()(()))(((())(()))())())))((((((((((())))()(()()(())()))())(((()(((((()((()))))()(((()(((()))())(()))())(())(((((((()((((())((()()())))())))()((())())()((…
Output: 320

Example 2:

Input: ))((()))))())))())))))))(())((((())(((((()(()()(()((()))((())()()))()))))))())((()((())(()(()(((((((()(((()()(((((()()()(()(())))(()(((()((()()()()())))())())((()((())))()(((()((()))))())()((()(()()((())((()()((()((()((()))))((((()()()()))()(((())))(())()(())((((()()((()))))())()()))(()()()(()()))()((()((())))())((())())(()(()))(()))))()()()()())))(())(()))()(())))()))(())()(())((()(((()()))()(())(((())(((()(()(())()(()()((())))))))()))())(()())))(())))((())))()))()(())())()()((()())))((())(()))())))))(()(())((()(()(())()))())(())))())))()((((((()()()(())((((((())()(()))())))(()))((())()))()())(()(((()(())()()((()())())((()()(()(()((()(()(()(())()((((()(())(((())()()))((())))(())))()()))(((()))))))(()))(()())(())))())())()()))()()(())((()((()()(()()()()))(()(()())(()(()())))))())((()))))()…
Output: 209

Example 3:

Input: )()))))((()(()))(((()))))(()()()))))()())))()()()((((()))))()))(()()))((())((()())))()())())(()(()((((())((())()(())()()((()(()))))))(())))((())(())())(()(())((((((((())()))(()()))()))(((()()((())))))((()(())())())(()())()(())(())()((()((((((((()(())())()(()))((()))))))))()()(()()(()))))())((())()()(()))))()(()()(())((((()))()())))(()((()(()(((()((((()()()())()(())())()(((()))))))))()(())((())(((())))((())))(((()))))())(((())))))()((())))()))(((()()(((()()())()()()(())(()())()))(()((((()(((()))()(()()()()()))))(())(()(()((((((())(()()))))()())))((((()))))()())((((())(()()()))((()())))(()(())))(()((()))()()((())()())()))()((()((())()((((())())(())()(()(()((()))))((()()))())()(()(())(()))())()())()))(((())(()())((((()(()))(())(((()((())()())())))((())((((())())()(())(((())()))()(()(((((()(()…
Output: 78

Constraints:

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

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