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
Ashwani Gautam:
20160723 13:43:54
for those who are wondering why O(M*N) is getting TLE, segment tree solution is O(N+M (logN)) , which is almost linear in terms of N+M, O(N*M) might seem faster but only for small M, for large M seg tree solution will overrule, dont know why some N*M solutions passed. 

liuxueyang:
20160719 16:29:03
I am confused the meaning of the "correct bracket expressions", anyone explain the following two sentences more detail?


amr_maghraby1:
20160710 03:08:26
@Prashant Kumar no it is not valid because at i =1 && i=2 (( two opening brackets not one opening and one closing 

buttman:
20160709 17:02:46
Constraint on N is probably wrong. My solution with an array size of 6005, showed RTE but increasing that to 10^8 got AC. 

kiwi1995:
20160703 18:12:50
compilation error :/ 

kshubham02:
20160612 23:58:25
Isn't there any upper bound on 'm'? My m*n solution gives TLE. I didn't think it would happen after seeing the limit as 11sec. 

nonushikhar:
20160601 13:00:09
easy one :)


Aditya:
20160323 22:15:23
Nice problem :) 

Rudra Nil Basu:
20160321 15:38:12
Century ! :D 

raghav12345:
20160116 10:43:36
really want to learn segment tree then hacker earth segment tree

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 