CodeForces 149D Coloring Brackets

D. Coloring Brackets

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 modulo1000000007 (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.

题意：给你一个合法的括号序列，对于每一对括号你要对一边涂色，可以涂红色或者蓝色，相邻的两个括号不能涂相同颜色，问有多少种方案。

思路：首先求出每个左括号对应哪个右括号，然后区间dp，dp[i][j][k][l]，i，j表示区间，k、l分别表示左右括号涂的颜色，有两种状态，一个合法序列外面套括号，dp转移方程为：dp[i][j][k][l]+=dp[i+1][j-1][x][y](x!=k&&y!=l)，还有另一个情况就是合法序列的合并，也就是合并区间，设next为第i个左括号对应的右括号的位置，dp转移方程为：dp[i][j][k][l]+=dp[i][next][k][x]*dp[next+1][j][x][l]，最后再把全部情况加起来就好了，下面给代码：

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<bitset>
#include <utility>
using namespace std;
#define maxn 705
#define inf 0x3f3f3f3f
typedef long long LL;
const int mod = 1e9 + 7;
char s[maxn];
int dp[maxn][maxn][3][3], m[maxn], len;
void getmap(){
	int now = 0;
	int pre[maxn];
	for (int i = 0; i < len; i++){
		if (s[i] == '(')
			pre[now++] = i;
		else{
			now--;
			m[i] = pre[now];
			m[pre[now]] = i;
		}
	}
}
int main(){
	while (~scanf("%s", s)){
		len = strlen(s);
		memset(dp, 0, sizeof(dp));
		getmap();
		for (int i = 0; i < len - 1; i++){
			if (s[i] == '('&&s[i + 1] == ')'){
				dp[i][i + 1][1][0] = dp[i][i + 1][2][0] = dp[i][i + 1][0][1] = dp[i][i + 1][0][2] = 1;
			}
		}
		for (int i = 3; i < len; i += 2){
			for (int j = 0; j + i < len; j++){
				if (m[j + i] == j){
					for (int k = 0; k < 3; k++){
						for (int l = 0; l < 3; l++){
							if (k != 1){
								dp[j][j + i][1][0] += dp[j + 1][j + i - 1][k][l];
								dp[j][j + i][1][0] %= mod;
							}
							if (k != 2){
								dp[j][j + i][2][0] += dp[j + 1][j + i - 1][k][l];
								dp[j][j + i][2][0] %= mod;
							}
							if (l != 1){
								dp[j][j + i][0][1] += dp[j + 1][j + i - 1][k][l];
								dp[j][j + i][0][1] %= mod;
							}
							if (l != 2){
								dp[j][j + i][0][2] += dp[j + 1][j + i - 1][k][l];
								dp[j][j + i][0][2] %= mod;
							}
						}
					}
				}
				else{
					int next = m[j];
					for (int k = 0; k < 3; k++){
						for (int l = 0; l < 3; l++){
							for (int x = 0; x < 3; x++){
								for (int y = 0; y < 3; y++){
									if ((x == 1 && y == 1) || (x == 2 && y == 2))
										continue;
									dp[j][j + i][k][l] += (LL)dp[j][next][k][x] * dp[next + 1][j + i][y][l] % mod;
									dp[j][j + i][k][l] %= mod;
								}
							}
						}
					}
				}
			}
		}
		int ans = 0;
		for (int i = 0; i < 3; i++){
			for (int j = 0; j < 3; j++){
				ans += dp[0][len - 1][i][j];
				ans %= mod;
			}
		}
		printf("%d\n", ans);
	}
}