C - Parenthesis

Bobo has a balanced parenthesis sequence P=p ₁ p ₂…p _n of length n and q questions.

The i-th question is whether P remains balanced after p _ai and p _bi  swapped. Note that questions are individual so that they have no affect on others.

Parenthesis sequence S is balanced if and only if:

1. S is empty;

2. or there exists balanced parenthesis sequence A,B such that S=AB;

3. or there exists balanced parenthesis sequence S' such that S=(S').

Input

The input contains at most 30 sets. For each set:

The first line contains two integers n,q (2≤n≤10 ⁵,1≤q≤10 ⁵).

The second line contains n characters p ₁ p ₂…p _n.

The i-th of the last q lines contains 2 integers a _i,b _i (1≤a _i,b _i≤n,a _i≠b _i).

Output

For each question, output " Yes" if P remains balanced, or " No" otherwise.

Sample Input

4 2
(())
1 3
2 3
2 1
()
1 2

Sample Output

No
Yes
No

暴力的话，优化一下可以过，在这里给的时间很长，但是有个比较巧妙的方法。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
	long n,q;
	while(cin>>n>>q)
	{
		char a[100005];
		int b[100005],c[100005];
		b[0]=0,c[0]=0;
		for(int i=1;i<=n;i++)
		{
			cin>>a[i];
			if(a[i]=='(')
				b[i]=b[i-1]+1;
			else
				b[i]=b[i-1]-1;
			if(b[i]<=1)
				c[i]=c[i-1]+1;
			else
				c[i]=c[i-1];
		}
		while(q--)
		{
			long x1,y1,x,y;
			cin>>x1>>y1;
			x=min(x1,y1);
			y=max(x1,y1);
			if(n==0)
			{
				cout<<"Yes"<<endl;
				continue;
			}
			if(a[x]==a[y])
			{
				cout<<"Yes"<<endl;
				continue;
			}
			else
				if(a[x]=='(')
				{
					if(c[y-1]-c[x-1]>0)
						cout<<"No"<<endl;
					else
						cout<<"Yes"<<endl;
				} 
				else
					cout<<"Yes"<<endl;
		}
	}
	return 0;
}