多校联赛第八场

Rikka with Parenthesis II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2571    Accepted Submission(s): 913


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 S_i,S_j

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.
 

简单栈,注意特殊情况:)(     和      ))((

#include<stdio.h>
#include <map>
#include<cmath>
#include<string.h>
#include<string>
#include<algorithm>
#include<conio.h>
using namespace std;
long long   n;
char zhan[1000005];
long long  top;
char s[1000005];
int main()
{
	int t;
	scanf("%d",&t);
	for(int k=0;k<t;k++)
	{
		top = 0;
		memset(s,0,sizeof(s));
		memset(zhan,0,sizeof(zhan));
		scanf("%lld",&n);
		scanf("%s",s);
		if(n%2 == 1)
		{
			printf("No\n");
			continue; 
		}
		
		 
		for(int i=0;i<n;i++) 
		{
			zhan[top++] = s[i];
			if(top >=2 )
			{
				if(zhan[top-1] == ')' && zhan[top-2] == '(')
				{
					top -= 2;
				}
			}
		}
		
		if(top == 0 && n!=2)
			printf("Yes\n");
		else if( top == 2&&zhan[0] ==')'&& zhan[1] == '(')
			printf("Yes\n");
		else if(top == 4 && zhan[0] == zhan[1]&&zhan[2] == zhan[3] && zhan[1] != zhan[2])
			printf("Yes\n");
		else
			printf("No\n"); 
	} 
	return 0; 
} 




阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/chudongfang2015/article/details/52370586
文章标签: 多校联赛
个人分类: ACM_比赛题目
上一篇刷题算法小技巧
下一篇自写聊天室_LinuxC实现(1)——项目部署遇到问题及解决方法
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭