2016多校训练Contest8: 1011 Rikka with Parenthesis II hdu5831

Problem Description

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

Correct parentheses sequences can be defined recursively as follows:
1.The empty string "" is a correct sequence.
2.If "X" and "Y" are correct sequences, then "XY" (the concatenation of X and Y) is a correct sequence.
3.If "X" is a correct sequence, then "(X)" is a correct sequence.
Each correct parentheses sequence can be derived using the above rules.
Examples of correct parentheses sequences include "", "()", "()()()", "(()())", and "(((())))".

Now Yuta has a parentheses sequence  S , and he wants Rikka to choose two different position  i,j  and swap  Si,Sj . 

Rikka likes correct parentheses sequence. So she wants to know if she can change S to a correct parentheses sequence after this operation.

It is too difficult for Rikka. Can you help her?

 

Input

The first line contains a number t(1<=t<=1000), the number of the testcases. And there are no more then 10 testcases with n>100

For each testcase, the first line contains an integers n(1<=n<=100000), the length of S. And the second line contains a string of length S which only contains ‘(’ and ‘)’.

 

Output

For each testcase, print "Yes" or "No" in a line.

 

Sample Input

  
  

   
   3
4
())(
4
()()
6
)))(((
  
  

 

Sample Output

  
  

   
   Yes
Yes
No


   
   

    
    

     
     Hint
    
    
For the second sample input, Rikka can choose (1,3) or (2,4) to swap. But do nothing is not allowed.
   
   
  
  

对于所给括号序列，判定交换且仅交换一组(i,j)(i≠j)的情况下，能否形成合法括号序列

我们将(设为1，)设为-1，然后统计前缀和，因为肯定是最后一个(与第一个不合法的)交换，所以如果前缀和出现-3则不行

#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int a[200001];
int main()
{
	int T;
	scanf("%d",&T);
	while(T>0)
	{
		T--;
		int lx;
		scanf("%d",&lx);
		string x;
		cin>>x;
		bool flag=true;
		int i,sum=0;
		for(i=0;i<=lx-1;i++)
		{
			if(x[i]=='(')
				a[i+1]=1;
			else
				a[i+1]=-1;
			sum+=a[i+1];
			if(sum<=-3)
				flag=false;
		}
		if(sum!=0||lx==2&&a[1]==1)
		{
			printf("No\n");
			continue;
		}
		else
		{
			if(flag)
				printf("Yes\n");
			else
				printf("No\n");
		}
	}
	return 0;
}

Problem Description

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

Correct parentheses sequences can be defined recursively as follows:
1.The empty string "" is a correct sequence.
2.If "X" and "Y" are correct sequences, then "XY" (the concatenation of X and Y) is a correct sequence.
3.If "X" is a correct sequence, then "(X)" is a correct sequence.
Each correct parentheses sequence can be derived using the above rules.
Examples of correct parentheses sequences include "", "()", "()()()", "(()())", and "(((())))".

Now Yuta has a parentheses sequence  S , and he wants Rikka to choose two different position  i,j  and swap  Si,Sj . 

Rikka likes correct parentheses sequence. So she wants to know if she can change S to a correct parentheses sequence after this operation.

It is too difficult for Rikka. Can you help her?

 

Input

The first line contains a number t(1<=t<=1000), the number of the testcases. And there are no more then 10 testcases with n>100

For each testcase, the first line contains an integers n(1<=n<=100000), the length of S. And the second line contains a string of length S which only contains ‘(’ and ‘)’.

 

Output

For each testcase, print "Yes" or "No" in a line.

 

Sample Input

   
   

    
    3
4
())(
4
()()
6
)))(((
   
   

 

Sample Output

   
   

    
    Yes
Yes
No


    
    

     
     

      
      Hint
     
     
For the second sample input, Rikka can choose (1,3) or (2,4) to swap. But do nothing is not allowed.