CT32213

Steward's Ledger of letters

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The council of the cliffside roost of Stormrest pays by the answer, and Steward intends to earn it. First: the full register of letters. 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| <= 45902; characters are '(' and ')'.

Example 1:

Input: ))((((((()(())()(()((())()))())((()((()())()())()()()()))((())(()()()()()())))))()()(((())()()()))())()()(()(()((((()(()()(()(()()(()((()))))))(()()))))(((()))()))(()())))())(((())()()((((()()())()()()((()))((()))()))()((()()))))()(()(()()))))(()(()())))(((()()()((((()((((()(())))))())))(()())))())(()(((()(((())(()()))(())(()()(()))()(()))()(()))()))(()(())(())()())))()(((()())()()()()(()))((()())))()()())))()()(()))()(()))(((())()))())())))))()((()(()())())()((())(()((()))())))))()()))()()((()((()(()))(()(((()(()))))())(())(()(((()((((()((())))((()(())))())((()))())(()((()))((()()(()))))(()(()(()()(((())))(((()))(()())()))(((((((()())()())(()(()((((((((()((()()(()())(()))(((()))()((()()(((()(()()(()())((()(()()(())(()))())()(()))(()()((())()())()())))(()))))()))))(((())))()())))())())))()…
Output: 542

Example 2:

Input: )))))(((())((((()()()((((()(())()()(()()(((((()))()())()(()()()())))))()(())()()()())()))()(()()())(()(()()))(((()))))(()))())(()((()(()((())()))))))()))((((()(()))()())(((())))))()(())()())(()(((()()(((()()((()(()(()())())())(((()()(()()()()(()()(())))))))()(()()())()())(()()())())))((()()))((()(()((()())(((()(()(()((()))))(())((())())))(((())())()))))()()(())((()()(())())(())))(()()()())())))))))((((()())(((((())(((((())()(()((()))))))))((())))(()(()(())()))))()))(())((((())()))))()((())(()))()())))))(((((())())))(())(())()))(())))(())((()((((()))()))))()()()((()()(((()))())))))(()()()((((()))()))(((()(()(())()()()))))))(()))((()))()())()((((())))))))))))()(()()))))((())(()))(((()(((())(((((()((())))))))((()(())())((()()(()((())(())()()()(()()(()((()))))))))()))(())))()((()((()((((())))(…
Output: 237

Example 3:

Input: (()())((()))))((())()()()((())(((())()()(())((((()(()())())((()))(()))()))())()))))((())(((((((()()))(()))())((()()()())()((()))()((()(()((()(()(()))(()(()))())()((())()()()((()())))))()(((()()))))(())((()))())()())()())))()))(())(()(()())()()(()))))(()(((((()(((())())()(()))()((()())(())(()))())()(()))())()())(()()(())(())(((((()(())((()(()())((((()))))))((()()())((())()(()())()()))())((()())))(((((()))()((()()()())(())())()(()())(())))()))(()()(((((())()))((((((()((())))))()))))()())()))())())))())))))))())))(()))))(()((()(((()((()((()()()()()(()((()()()(()()(()))))()()(())()()))(((((()()()))())()()(())((()())((()())((()())())())(()()(()(((()))))))()())))((())))(((((()()((()))))(((((())((()()(()()(((())())())(((()(((((()(()())())))()))()))))()()))))())))(()()()(((())())((()()((()()))()((…
Output: 381

Constraints:

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

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