codeforces 149D Coloring Brackets(区间dp)

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 modulo 1000000007 (10⁹ + 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 (10⁹ + 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.

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

题意：给你一串完全匹配的括号，有两个要求：
1.相对应的匹配括号必须选一边进行染色，可以染红绿两色。
2.相邻的括号不能染相同的色。

思路：

由题目的限制条件易知我们必须记录对应括号的染色方式，才能递推出相应的其他括号的染色数。

1.首先，必须处理出对应匹配括号的位置，这很简单。

2.对应的括号有两种递推
1) 如形式（（）） 的括号匹配
2) 如形式（）（） 的括号匹配
所有的完全匹配括号都是这两种形式组合出来的。

代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn=1010;
const int mod=1000000007;
typedef long long ll;
ll dp[maxn][maxn][3][3];
char s[maxn];
int num[maxn],p[maxn];
int main()
{
    scanf("%s",s+1);
    int n=strlen(s+1);
    int len=0;
    for(int i=1;i<=n;i++)
    {
        if(s[i]=='(')
        {
           num[++len]=i;
        }
        else
        {
            p[i]=num[len];
            p[num[len]]=i;
            len--;
        }
    }
    memset(dp,0,sizeof(dp));
    for(len=2;len<=n;len++)
    {
        for(int l=1;l+len-1<=n;l++)
        {
            int r=l+len-1;
            if(p[r]==l)
            {
                if(len==2)
                    dp[l][r][1][0]=dp[l][r][0][1]=dp[l][r][2][0]=dp[l][r][0][2]=1;
                else
                {
                   for(int i=0;i<3;i++)
                   {
                       int m=l+1,k=r-1;
                       dp[l][r][1][0]+=dp[m][k][0][i]+dp[m][k][2][i];
                       dp[l][r][1][0]%=mod;
                       dp[l][r][2][0]+=dp[m][k][0][i]+dp[m][k][1][i];
                       dp[l][r][2][0]%=mod;
                       dp[l][r][0][1]+=dp[m][k][i][0]+dp[m][k][i][2];
                       dp[l][r][0][1]%=mod;
                       dp[l][r][0][2]+=dp[m][k][i][0]+dp[m][k][i][1];
                       dp[l][r][0][2]%=mod;
                   }
                }
            }
            else if(p[l]<r)
            {
                for(int x=0;x<=2;x++)
                for(int y=0;y<=2;y++)
                for(int xx=0;xx<=2;xx++)
                for(int yy=0;yy<=2;yy++)
                if(xx==0||yy==0||xx!=yy)
                {
                    dp[l][r][x][y]+=(dp[l][p[l]][x][xx]*dp[p[l]+1][r][yy][y])%mod;
                    dp[l][r][x][y]%=mod;
                }
            }
        }
    }
    ll ans=0;
    for(int i=0;i<3;i++)
    for(int j=0;j<3;j++)
      ans+=dp[1][n][i][j];
    ans%=mod;
    printf("%I64d\n",ans);
    return 0;
}