CT30111

The riddles at Chessfield

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Legend says the vault under the rook towers of Chessfield opens only for a perfect tally of riddles. Kael means to find out. 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| <= 26709; characters are '(' and ')'.

Example 1:

Input: )((((((()()()())()(()))))()()()((((())()()()()(()()((((()()()(()()))((())()()))))(((())(((()((())()))))(()()(()())(((()((((()()))()))(()))(()())((((()())())()))))())((())))()))))()((())(())(())()))((()(((((())()))()))()()()(())())))((())())(())()))(()))))((())(()()()(((()))((()((((()()))()())())(((((((())(())()(((()))(())(()())(()()((()(((())(())(()()((((())(()))(((()())(()(((())((()()()))((()(((()(()())()))()))()))))()()()()()))()((()))()()(((()())))()())))()))((((()()(()))()(()))(()(()((((()))())()()(((((((((()((((((())(((())))()()(()()((())(()()(()(()()()))())(((())))()()))()()))))(())())()))(((())()))(())))((())()(()))))(((()))))())(()(())(())())(()((((()(((()((()))))(()(()))))))))(()()))))())(()))(()(()()()()(()))()))()((()(()))))((())(()))((()((()(())(((((((((())))))())())))()))(()((…
Output: 443

Example 2:

Input: ))))(()())))))(((((()))))))))())()()))))())()))())(()()()))(())))))(())((((()(()))(()))(((((()()))(()(())()(()(((())((())(((()(()(((()))((((()())))(((()))(())())()()()(((()(((())))()))(((()()())))(())))))))()))()((((()((((()()())(())())())())))()))(()()(()())(((((((()())()()()))())())(()))()))))((()(()(())()))))()()((((((()(()())()))())()(()()))(()))(()))))()(())(()())()()()))))()()(()(()())())(()))()((())(((((()))()()()()(())(())))())))(())()(())((()()())))))()))(()(())((()(()(((()))()()(())()())(()())((()()()))((())(((())((()())((((((()(())()())())))(()(())(()))((())))()()((((((()())((())(()()()))((()((()((()((()))()))))))())(()()((()(())))())()(()(()))((()()(()()()(()))(())())()()()(())))(())()))())))(()))())()))((()((((())()((()(()(((()(()(()()))))()))())())())())())))((()))(()(((((()(…
Output: 206

Example 3:

Input: ))())))(()(()())))()()()(())))())()(()((()(((((())(((((((((())()))))))))((((()(()()())))))((()())(())((((())(((()())((()(()))()()())(()((((()))())((((())(())()()))(()((()())(()))))()()((()((((((((()())(())))(()(())())))))))())())(()))())()))()()(()()))(()()((())))()(())((((()()())(()(((()))())())()())((()())))()()(()))()((((())))())))()((((()))()()(((((((())))))))()((())))()(()()()))()()())())))(((())((()(()((()(()()((((((()))))(()(()())()())())()()()(((()((((()(()(()(())())()()(()()()((()(()()))))(()(()()(())())))())(((())(()()())())((()()()))())(()((()((((((())))()()))(()()))))))(()()((((()())(()(()(()()()()()(())(((((()))(())))))()())))))(((())())()()(())((())())))())()))())(())()()(()))))()(()(((()))())))()()((()())))((()(()(()(((()(()())(((((())()(())))(((((()(())))))))(())()))))(((((…
Output: 148

Constraints:

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

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