Codeforces 149D Coloring Brackets（区间dp）

题目链接

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).

Sample test(s)

Input

(())

Output

12

Input

(()())

Output

40

Input

()

Output

4

题意：给一个合法的括号匹配串。对于每一对括号，有且只有一个要涂色。而且涂色只能涂红色或者蓝色。求涂色的方案有多少种？

题解：对于1到n的括号串，假设我们给一对括号下标为i，j上色以后，与他们相邻的括号要受到影响。但是区间[1,i-1],[i-1,j-1],[j+1,n] 之间是没有相互影响的，所以原问题被分成了几个子问题，我们可以用动态规划解决。

用dp[l][r][0,1,2][0,1,2]表示，将区间[l,r] 的括号串涂色，第一个0,1,2分别表示下标为l的括号（0：可以涂两种颜色，1：不能涂红色，2：不能涂蓝色），第二个0,1,2分别表示下标为r的括号（0：可以涂两种颜色，1：不能涂红色，2：不能涂蓝色）。该区间在该状态下的涂色方案有多少种？

转移的时候，我们给下标为l和其对应括号x涂色，我们的策略有个l涂色或者给x涂色。

详情见代码：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<string>
#include<stack>
#include<math.h>
#define nn 710
#define inff 0x3fffffff
#define eps 1e-8
#define mod 1000000007
typedef long long LL;
const LL inf64=LL(inff)*inff;
using namespace std;
char s[nn];
int kh[nn];
stack<int>sta;
LL dp[nn][nn][3][3];
LL dfs(int l,int r,int x,int y)
{
    if(l>r)
        return 1;
    if(dp[l][r][x][y]!=-1)
        return dp[l][r][x][y];
    if(l==r+1)
    {
        dp[l][r][x][y]=0;
        if(x==0)
            dp[l][r][x][y]+=2;
        else
            dp[l][r][x][y]+=1;
        if(y==0)
            dp[l][r][x][y]+=2;
        else
            dp[l][r][x][y]+=1;
        return dp[l][r][x][y];
    }
    dp[l][r][x][y]=0;
    if(x!=1)
        dp[l][r][x][y]=(dp[l][r][x][y]+(dfs(l+1,kh[l]-1,1,0)*dfs(kh[l]+1,r,0,y))%mod)%mod;
    if(x!=2)
        dp[l][r][x][y]=(dp[l][r][x][y]+(dfs(l+1,kh[l]-1,2,0)*dfs(kh[l]+1,r,0,y))%mod)%mod;
    if(kh[l]==r)
    {
        if(y!=1)
            dp[l][r][x][y]=(dp[l][r][x][y]+dfs(l+1,r-1,0,1))%mod;
        if(y!=2)
            dp[l][r][x][y]=(dp[l][r][x][y]+dfs(l+1,r-1,0,2))%mod;
    }
    else
    {
        dp[l][r][x][y]=(dp[l][r][x][y]+(dfs(l+1,kh[l]-1,0,1)*dfs(kh[l]+1,r,1,y))%mod)%mod;
        dp[l][r][x][y]=(dp[l][r][x][y]+(dfs(l+1,kh[l]-1,0,2)*dfs(kh[l]+1,r,2,y))%mod)%mod;
    }
    return dp[l][r][x][y];
}
int main()
{
    int i;
    while(scanf("%s",s)!=EOF)
    {
        int len=strlen(s);
        sta.push(0);
        int ix;
        for(i=1;i<len;i++)
        {
            if(s[i]==')')
            {
               ix=sta.top();
               sta.pop();
               kh[ix]=i;
               kh[i]=ix;
            }
            else
                sta.push(i);
        }
        memset(dp,-1,sizeof(dp));
        printf("%lld\n",dfs(0,len-1,0,0));
    }
    return 0;
}