BRCKTS - Brackets

We will call a bracket word any word constructed out of two sorts of characters: the opening bracket "(" and the closing bracket ")". Among these words we will distinguish correct bracket expressions. These are such bracket words in which the brackets can be matched into pairs such that

  • every pair consists of an opening bracket and a closing bracket appearing further in the bracket word
  • for every pair the part of the word between the brackets of this pair has equal number of opening and closing brackets
On a bracket word one can do the following operations:
  • replacement -- changes the i-th bracket into the opposite one
  • check -- if the word is a correct bracket expression


Write a program which

  • reads (from standard input) the bracket word and the sequence of operations performed,
  • for every check operation determines if the current bracket word is a correct bracket expression,
  • writes out the outcome (to standard output).


Ten test cases (given one under another, you have to process all!). Each of the test cases is a series of lines. The first line of a test consists of a single number n (1<=n<=30000) denoting the length of the bracket word. The second line consists of n brackets, not separated by any spaces. The third line consists of a single number m -- the number of operations. Each of the following m lines carries a number k denoting the operation performed. k=0 denotes the check operation, k>0 denotes replacement of k-th bracket by the opposite.


For every test case your program should print a line:
Test i:
where i is replaced by the number of the test and in the following lines, for every check operation in the i-th test your program should print a line with the word YES, if the current bracket word is a correct bracket expression, and a line with a word NO otherwise. (There should be as many lines as check operations in the test.)


[and 9 test cases more]
Test 1:
[and 9 test cases more]

Warning: large Input/Output data, be careful with certain languages

hide comments
arthur: 2015-05-27 07:36:13

Use interval tree here. Solved in first attempt using ideas from matrix

(0,1) + (1,0) = (0,0)

Last edit: 2015-05-28 19:27:49
Anubhav Gupta: 2015-05-21 21:55:54

awesome question. finally AC after 8 attempts :D

Aditya Paliwal: 2014-12-04 16:58:50

@Vaibhav There is an update on the 4th bracket before the first check operation. The word becomes
()() which is clearly a correct expression.

Vaibhav: 2014-11-02 08:15:57

How is the answer YES for query 1, since there are 2 extra opening brackets and hence, the all-pairs must have a closing bracket condition is not satisfied. Someone please explain.

fresh: 2014-10-09 00:10:28

never mind i forgot to comment the part of the code that prints the final shape

Archit Jain: 2014-09-20 20:37:27

very nice q

Shreyansh Gandhi: 2014-06-22 19:44:56

My 50th :)

Julian Waldby: 2014-05-21 05:31:49

I think instead of O(n) it is O(mn).

humble_coder: 2014-04-27 15:05:55

any limit on m???

rd: 2013-11-26 11:41:48

If we get a run time exceeded etc how to find out the issue ? there should be some way to show where testing has failed

Added by:Adam Dzedzej
Time limit:11s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:Internet Contest Pogromcy Algorytmow(Algorithm Tamers) 2003 Round IV