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
 replacement  changes the ith bracket into the opposite one
 check  if the word is a correct bracket expression
Task
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).
Input
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 kth bracket by the opposite.
Output
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 ith 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.)
Example
Input: 4 ()(( 4 4 0 2 0 [and 9 test cases more] Output: Test 1: YES NO [and 9 test cases more]Warning: large Input/Output data, be careful with certain languages
hide comments
raw_input():
20120608 16:48:35
o(n) is enough but still getting TLE. 

Rahul Dubey:
20120604 09:06:37
getting tle please help ??? 

sandeep pandey:
20120505 11:05:38
Nice One:)


Julian Leyh:
20120130 13:58:42
Ada's Text_IO seems to be very slow for big Strings. 

e@spoj:
20111020 22:07:01
For C++ don't use cin/cout on any place 

suyy:
20110906 13:54:02
how can java get AC????


Piotr Kozakowski:
20110201 20:26:56
What is the range of m?? I tested my prog with n=30000 and m=1000000 and it took 10 sec. I submitted it here and got TLE :( 

Pulkit Bansal:
20110125 10:06:33
What is the range of m? 

:D:
20091028 17:31:31
The first is wrong and second ok. Read the two conditions for the correct bracket expression more carefully. 

Seshadri R:
20091024 10:32:19
Suppose the expression are like ))(( or (()) would these two be YES or NO? The matching bracket should be immediate or is it sufficient if there are equal number of opening and closing brackets? 
Added by:  Adam Dzedzej 
Date:  20040615 
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 