Codeforces Round 459 (Div. 2)
C
The Monster
Codeforces
未评级
原题
← BD →
翻译中…

As Will is stuck in the Upside Down, he can still communicate with his mom, Joyce, through the Christmas lights (he can turn them on and off with his mind). He can't directly tell his mom where he is, because the monster that took him to the Upside Down will know and relocate him.

翻译中…

image

翻译中…

Thus, he came up with a puzzle to tell his mom his coordinates. His coordinates are the answer to the following problem.

翻译中…

A string consisting only of parentheses ('(' and ')') is called a bracket sequence. Some bracket sequence are called correct bracket sequences. More formally:

翻译中…
  • Empty string is a correct bracket sequence.
  • if $*s*$ is a correct bracket sequence, then $(*s*)$ is also a correct bracket sequence.
  • if $*s*$ and $*t*$ are correct bracket sequences, then $*st*$ (concatenation of $*s*$ and $*t*$) is also a correct bracket sequence.
翻译中…

A string consisting of parentheses and question marks ('?') is called pretty if and only if there's a way to replace each question mark with either '(' or ')' such that the resulting string is a non-empty correct bracket sequence.

翻译中…

Will gave his mom a string $*s*$ consisting of parentheses and question marks (using Morse code through the lights) and his coordinates are the number of pairs of integers $(*l*, *r*)$ such that $1 ≤ *l* ≤ *r* ≤ |*s*|$ and the string $*s*_{*l*}*s*_{*l* + 1}... *s*_{*r*}$ is pretty, where $*s*_{*i*}$ is $*i*$-th character of $*s*$.

翻译中…

Joyce doesn't know anything about bracket sequences, so she asked for your help.

翻译中…

Input

翻译中…

The first and only line of input contains string $*s*$, consisting only of characters '(', ')' and '?' ($2 ≤ |*s*| ≤ 5000$).

翻译中…

Output

翻译中…

Print the answer to Will's puzzle in the first and only line of output.

翻译中…

Note

翻译中…

For the first sample testcase, the pretty substrings of $*s*$ are:

翻译中…
  1. "(?" which can be transformed to "()".
  2. "?)" which can be transformed to "()".
  3. "((?)" which can be transformed to "(())".
  4. "(?))" which can be transformed to "(())".
翻译中…

For the second sample testcase, the pretty substrings of $*s*$ are:

翻译中…
  1. "??" which can be transformed to "()".
  2. "()".
  3. "??()" which can be transformed to "()()".
  4. "?()?" which can be transformed to "(())".
  5. "??" which can be transformed to "()".
  6. "()??" which can be transformed to "()()".
  7. "??()??" which can be transformed to "()()()".
翻译中…

样例

Input #1
((?))
Output #1
4
InputCopy OutputCopy
Input #2
??()??
Output #2
7
InputCopy OutputCopy
题目信息
题号
918C
时间限制
1 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。