1140 : Parenthesis
- 时间限制Time Limit
- 1 秒Sec
- 内存限制Memory Limit
- 128 兆MB
- 提交次数Submitted
- 138 次Times
- 通过次数Solved
- 28 次Times
标准评测 Standard
从标准输入读入,结果写到标准输出。评测将输出拆成 token,与标准答案逐项比较,不按整段逐字节比对。
Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
Bobo has a balanced parenthesis sequence P=p1 p2…pn of length n and q questions.
The i-th question is whether P remains balanced after pai and pbi swapped. Note that questions are individual so that they have no affect on others.
Parenthesis sequence S is balanced if and only if:
- S is empty;
- or there exists balanced parenthesis sequence A,B such that S=AB;
- or there exists balanced parenthesis sequence S’ such that S=(S’).
输入格式Input
The input contains at most 30 sets. For each set:
The first line contains two integers n,q (2 ≤ n ≤ 105, 1 ≤ q ≤ 105).
The second line contains n characters p1 p2…pn.
The i-th of the last q lines contains 2 integers ai,bi (1 ≤ ai, bi ≤ n, ai ≠ bi).
输出格式Output
For each question, output “Yes” if P remains balanced, or “No” otherwise.
样例Sample
出题Author
ftiasch
来源Source
湖南省第十二届大学生计算机程序设计竞赛(HNCPC2016)
题目到此结束End of problem