308014: CF1452C. Two Brackets
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Two Brackets
题意翻译
### 题目翻译 给定多个字符串,长度总和不超过 $2e5$ ,只包含 $[$ , $]$ , $($ , $)$,左中括号可以和右中括号匹配,左小括号可以和右小括号匹配 左右中括号间可以有未匹配的左右小括号,左右小括号间可以有未匹配的左右中括号 问最大匹配括号对数 ### 提示: 第四组都不能匹配,第五组小括号不能匹配题目描述
You are given a string $ s $ , consisting of brackets of two types: '(', ')', '\[' and '\]'. A string is called a regular bracket sequence (RBS) if it's of one of the following types: - empty string; - '(' + RBS + ')'; - '\[' + RBS + '\]'; - RBS + RBS. where plus is a concatenation of two strings. In one move you can choose a non-empty subsequence of the string $ s $ (not necessarily consecutive) that is an RBS, remove it from the string and concatenate the remaining parts without changing the order. What is the maximum number of moves you can perform?输入输出格式
输入格式
The first line contains a single integer $ t $ ( $ 1 \le t \le 1000 $ ) — the number of testcases. Each of the next $ t $ lines contains a non-empty string, consisting only of characters '(', ')', '\[' and '\]'. The total length of the strings over all testcases doesn't exceed $ 2 \cdot 10^5 $ .
输出格式
For each testcase print a single integer — the maximum number of moves you can perform on a given string $ s $ .
输入输出样例
输入样例 #1
5
()
[]()
([)]
)]([
)[(]
输出样例 #1
1
2
2
0
1