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
harry_shit:
20191123 14:01:08
simple segtree just don't give up!! 

Bác Ba Phì:
20190604 12:51:05
Turned out that the constraint of m is 1e6 

pranto_84:
20190401 17:46:44
what is the value of m?


hardik98:
20181221 10:50:10
solved without segment tree 

elmer_fudd:
20180921 21:43:37
using fast input output sf,pf ...not go for cin, cout 

rianradeck:
20180614 15:46:04
#ACINONEGO 

aman_sachin200:
20180604 23:37:08
Nice one!!Just be careful while merging the children nodes!!:) 

aliosm:
20180604 21:47:24
AC in one go @@! 

cyberlord:
20180603 15:01:27
can anyone explain the output format, I am getting WA and I am sure my logic is correct since I am failing on the first test case. For one test case, I am inputting all the queries and then showing the answers for all queries collectively at the end of that test case with "Test i:" Last edit: 20180603 15:01:48 

rihards123:
20180519 16:26:09
nepatik

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 