Coloring Brackets CodeForces - 149D

1. dp[][][][] 第三第四维分别记录两端点颜色
2. stack记录每个位对应匹配位
3. l,r匹配仅需更新内部
4. 否则更新l,mch[l]和mch[l]+1,r的值，再由他们更新

#include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof a)
#define sci(num) scanf("%d",&num)
#define scl(num) scanf("%lld",&num)
#define scd(num) scanf("%lf",&num)
typedef long long LL;
const int MAX_N = 710;
const LL MOD = 1e9 + 7;
const double EPS = 1e-10;
typedef pair<char,int> pci;
LL DP[MAX_N][MAX_N][3][3];
int mch[MAX_N];
char str[MAX_N];
stack<int> stk;
void dp(int l,int r) {
   if (l >= r) return;
   if (l + 1 == r) {
        DP[l][r][0][1] = DP[l][r][0][2] = 1;
        DP[l][r][1][0] = DP[l][r][2][0] = 1;
        return;
    }
    if (mch[l] == r) {
        dp(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;
                }
            }
        }
    } else {
        int p = mch[l];
        dp(l,p); dp(p+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 t = 0;t < 3;t++) {
                        if (k == t && t != 0) continue;
                        DP[l][r][i][j] += DP[l][p][i][k] * DP[p+1][r][t][j] % MOD;
                        DP[l][r][i][j] %= MOD;
                    }

                }

            }

        }


    }
}
int main()
{
    mem(DP,0);
    scanf("%s",str);
    int len = strlen(str);
    for (int i = 0;i < len;i++) {
        if (str[i] == ')' ) {
            int l = stk.top(); stk.pop();
            mch[l] = i;
            mch[i] = l;
        } else {
            stk.push(i);
        }
    }
    dp(0,len - 1);
    LL 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("%lld\n",ans);
    return 0;
}