A13901 | Two Brackets
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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?
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$ .
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
In the first example you can just erase the whole string.
In the second example you can first erase the brackets on positions $1$ and $2$ : "\[\]()", then "()" is left. After that you can erase it whole. You could erase the whole string from the beginning but you would get one move instead of two.
In the third example you can first erase the brackets on positions $1$ and $3$ : "(\[)\]". They form an RBS "()". Then "\[\]" is left, so you can erase it whole.
In the fourth example there is no subsequence that is an RBS, so you can't perform a move at all.
In the fifth example you can erase the brackets on positions $2$ and $4$ : ")\[(\]" and get ")(" as a result. You can erase nothing from it.
In the second example you can first erase the brackets on positions $1$ and $2$ : "\[\]()", then "()" is left. After that you can erase it whole. You could erase the whole string from the beginning but you would get one move instead of two.
In the third example you can first erase the brackets on positions $1$ and $3$ : "(\[)\]". They form an RBS "()". Then "\[\]" is left, so you can erase it whole.
In the fourth example there is no subsequence that is an RBS, so you can't perform a move at all.
In the fifth example you can erase the brackets on positions $2$ and $4$ : ")\[(\]" and get ")(" as a result. You can erase nothing from it.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted