codeforce-149D——括号匹配染色+区间dp

题目链接：http://codeforces.com/problemset/problem/149/D

Once Petya read a problem about a bracket sequence. He gave it much thought but didn't find a solution. Today you will face it.

You are given string s. It represents a correct bracket sequence. A correct bracket sequence is the sequence of opening ("(") and closing (")") brackets, such that it is possible to obtain a correct mathematical expression from it, inserting numbers and operators between the brackets. For example, such sequences as "(())()" and "()" are correct bracket sequences and such sequences as ")()" and "(()" are not.

In a correct bracket sequence each bracket corresponds to the matching bracket (an opening bracket corresponds to the matching closing bracket and vice versa). For example, in a bracket sequence shown of the figure below, the third bracket corresponds to the matching sixth one and the fifth bracket corresponds to the fourth one.

You are allowed to color some brackets in the bracket sequence so as all three conditions are fulfilled:

• Each bracket is either not colored any color, or is colored red, or is colored blue.
• For any pair of matching brackets exactly one of them is colored. In other words, for any bracket the following is true: either it or the matching bracket that corresponds to it is colored.
• No two neighboring colored brackets have the same color.

Find the number of different ways to color the bracket sequence. The ways should meet the above-given conditions. Two ways of coloring are considered different if they differ in the color of at least one bracket. As the result can be quite large, print it modulo 1000000007 (109 + 7).

Input

The first line contains the single string s (2 ≤ |s| ≤ 700) which represents a correct bracket sequence.

Output

Print the only number — the number of ways to color the bracket sequence that meet the above given conditions modulo 1000000007 (109 + 7).

Examples

Input

(())

Output

12

Input

(()())

Output

40

Input

()

Output

4

Note

Let's consider the first sample test. The bracket sequence from the sample can be colored, for example, as is shown on two figures below.

The two ways of coloring shown below are incorrect.

 

题目翻译：

‎一旦 Petya 读取了有关括号序列的问题。他考虑了很多,但没有找到解决办法。今天,你将面对它。‎

‎您被授予字符串‎‎s‎‎。它表示正确的括号序列。正确的括号序列是打开‎‎("‎‎) 和结束 ("‎‎)‎‎") ") 的括号的顺序,以便可以从它获得正确的数学表达式,在括号之间插入数字和运算符。例如,‎‎诸如"(())()()"‎‎和"()"这样的序列是正确的括号序列,诸如"()"和"()"这样的序列则‎‎不是。‎

‎在正确的括号序列中,每个支架对应于匹配的支架(左括号对应于匹配的右括号,反之亦然)。例如,在下图所示的括号序列中,第三个括号对应于匹配的第六个括号,第五个括号对应于第四个括号。‎

‎您可以给括号序列中的某些括号着色,以便满足所有三个条件:‎

• ‎每个括号不是颜色任何颜色,或者是红色,或者是蓝色。‎
• ‎对于任何匹配括号的一对,它们中只有一个是彩色的。换句话说,对于任何括号,以下都是true:它或与之对应的匹配括号是彩色的。‎
• ‎没有两个相邻的彩色括号具有相同的颜色。‎

‎查找为括号序列着色的不同方法的数量。方法应满足上述条件。如果两种着色方式在至少一个括号的颜色上有所不同,则它们被视为不同。由于结果可能相当大,打印它 modulo ‎‎1000000007‎‎ (‎‎10‎‎9‎‎ + 7‎‎)。‎

‎输入‎

‎第一行包含单个字符串 s ‎‎ ‎‎ ‎‎ ( 2‎‎= | |‎‎s‎‎|[ 700‎‎),表示正确的括号序列。‎

‎输出‎

‎打印唯一的数字 - 为符合上述条件(modulo ‎‎1000000007‎‎ ) (‎‎10‎‎9‎‎ + 7‎‎) 的支架序列着色的方法数。‎

 

括号匹配的变形题，不过要给括号染色，并且要求相连括号颜色不相同，匹配括号一个有颜色，一个没有。

详细解析和过程请参考代码。

#include <iostream>
#include<algorithm>
#include<stack>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int maxn=705;
string s;
stack<int> q;
int match[maxn];//匹配数组，存储对应括号的下标 
ll dp[maxn][maxn][3][3];//dp[i][j][l][r]表示从i到j区间中两端的颜色分别为l,r的方案个数
//0表示没有颜色，1表示蓝,2表示红色
//状态转移方程为：
/*	if(l与r是配对的)
		递归（l+1，r-1）
		状态转移方程：
		if(j!=1)	dp[l][r][0][1]=(dp[l][r][0][1]+dp[l+1][r-1][i][j])%mod;
		if(i!=1)	dp[l][r][1][0]=(dp[l][r][1][0]+dp[l+1][r-1][i][j])%mod;
		if(j!=2)	dp[l][r][0][2]=(dp[l][r][0][2]+dp[l+1][r-1][i][j])%mod; 
		if(i!=2)	dp[l][r][2][0]=(dp[l][r][2][0]+dp[l+1][r-1][i][j])%mod;
		很容易理解，因为l+1和l以及r-1和r不能同色 
	if(l与r不配对) 
		递归(l,mid)和(mid+1,r) 
		if(k与q的数字不相同)——因为相邻不同色
		dp[l][r][i][j]=(dp[l][r][i][j]+(dp[l][mid][i][k]*dp[mid+1][r][q][j])%mod)%mod;
		其中 mid为与 l 匹配的括号的下标 ,k为mid的颜色，q为mid+1的颜色
		也很好理解，区间dp的经典做法，大区间拆成小区间，mid就是区间dp中的最优分割点 
	边界条件：如果区间长度为 1 ，那么左端点和右端点不能同色，满足
	dp[l][r][0][1]=dp[l][r][0][2]=dp[l][r][1][0]=dp[l][r][2][0]=1
*/ 
void getmatch(){//利用栈的性质得到匹配数组 
	int len=s.size();
	for(int i = 0;i<len;++i){
		if(s[i]=='(') q.push(i);
		else{
			match[i]=q.top();
			match[q.top()]=i;
			q.pop();
		}
	}
}
void dfs(int l,int r){
	if(l+1==r){
		dp[l][r][0][1]=dp[l][r][1][0]=dp[l][r][2][0]=dp[l][r][0][2]=1;
		return ;
	}
	if(match[l]==r){
		dfs(l+1,r-1);
		for(int i = 0;i<3;++i){
			for(int j = 0;j<3;++j){
				if(j!=1)	dp[l][r][0][1]=(dp[l+1][r-1][i][j]+dp[l][r][0][1])%mod;
				if(j!=2)	dp[l][r][0][2]=(dp[l+1][r-1][i][j]+dp[l][r][0][2])%mod;
				if(i!=1)	dp[l][r][1][0]=(dp[l+1][r-1][i][j]+dp[l][r][1][0])%mod;
				if(i!=2)	dp[l][r][2][0]=(dp[l+1][r-1][i][j]+dp[l][r][2][0])%mod;
			}
		} 
		return ;
	}
	else{
		int mid=match[l];
		dfs(l,mid);
		dfs(mid+1,r);
		for(int i = 0;i<3;++i)
			for(int j = 0;j<3;++j)
				for(int k = 0;k<3;++k)
					for(int m=0;m<3;++m)
						if(!(k==1&&m==1)&&!(k==2&&m==2))
							dp[l][r][i][j]=(dp[l][r][i][j]+(dp[l][mid][i][k]*dp[mid+1][r][m][j])%mod)%mod;
		return ;
	}
}
int main(int argc, char** argv) {
	cin>>s;
	getmatch();//得到匹配数组
	memset(dp,0,sizeof(dp));
	int len=s.size();
	dfs(0,len-1);
	ll ans=0;
	for(int i = 0;i<3;++i)
		for(int j = 0;j<3;++j)
			ans=(ans+dp[0][len-1][i][j])%mod;
	printf("%lld\n",ans);
	return 0;
}