F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Balanced Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8965    Accepted Submission(s): 2315


Problem Description
Chiaki has $n$ strings $s_1,s_2,\dots,s_n$ consisting of '(' and ')'. A string of this type is said to be balanced:

+ if it is the empty string
+ if $A$ and $B$ are balanced, $AB$ is balanced,
+ if $A$ is balanced, $(A)$ is balanced.

Chiaki can reorder the strings and then concatenate them get a new string $t$. Let $f(t)$ be the length of the longest balanced subsequence (not necessary continuous) of $t$. Chiaki would like to know the maximum value of $f(t)$ for all possible $t$.
 

Input
There are multiple test cases. The first line of input contains an integer $T$, indicating the number of test cases. For each test case:
The first line contains an integer $n$ ($1 \le n \le 10^5$) -- the number of strings.
Each of the next $n$ lines contains a string $s_i$ ($1 \le |s_i| \le 10^5$) consisting of `(' and `)'.
It is guaranteed that the sum of all $|s_i|$ does not exceeds $5 \times 10^6$.
 

Output
For each test case, output an integer denoting the answer.
 

Sample Input
2 1 )()(()( 2 ) )(
 

Sample Output
4 2
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-03-29 08:44:47, Gzip enabled