【CF149D】【Coloring Brackets】
来源:互联网 发布:python八数码算法 编辑:程序博客网 时间:2024/06/04 19:44
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).
The first line contains the single string s (2 ≤ |s| ≤ 700) which represents a correct bracket sequence.
Print the only number — the number of ways to color the bracket sequence that meet the above given conditions modulo1000000007 (109 + 7).
(())
12
(()())
40
()
4
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[i][j][k][q] 是从位置i到j并且color[i] = k && color[j] = q的情形
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std;string str;typedef long long ll;int len;stack<int> s;int to[710];const int MOD = 1000000007 ;ll dp[710][710][3][3];void dfs(int l,int r){if(l + 1 == r){dp[l][r][0][1] = 1;dp[l][r][0][2] = 1;dp[l][r][1][0] = 1;dp[l][r][2][0] = 1;return;}if(to[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][r][0][1] + 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 != 1)dp[l][r][1][0] = (dp[l][r][1][0] + 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;}}return;}else{int p = to[l];dfs(l,p);dfs(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 q=0;q<3;q++){ if(!((k==1 && q==1) || (k==2 && q==2))) dp[l][r][i][j] = (dp[l][r][i][j] + (dp[l][p][i][k] * dp[p+1][r][q][j]) % MOD) % MOD;}}}int main(){ while(cin >> str){len = str.length();while(!s.empty())s.pop();memset(to,-1,sizeof(to));memset(dp,0,sizeof(dp));for(int i=0;i<len;i++){if(s.empty()) s.push(i);else{if(str[s.top()] == '(' && str[i] == ')'){to[s.top()] = i;s.pop();}else{s.push(i);}}}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("%I64d\n",ans);} return 0;}
- 【CF149D】【Coloring Brackets】
- codeforces Coloring Brackets
- Coloring Brackets CodeForces
- CodeForces149D-Coloring Brackets
- Coloring Brackets CodeForces
- Coloring Brackets CodeForces
- Codeforces 149D Coloring Brackets
- CodeForces 149 D. Coloring Brackets
- codeforces 149d Coloring Brackets
- CodeForces 149D Coloring Brackets
- CodeForces 149D Coloring Brackets
- codeforces 149D Coloring Brackets
- CodeForces 149D Coloring Brackets
- CodeForces - 149D Coloring Brackets[区间dp]
- CF 149D - Coloring Brackets(区间Dp)
- CodeForces 149D Coloring Brackets(JAVA版)
- codeforces 149D - Coloring Brackets (区间dp)
- CodeForces 149D Coloring Brackets(区间DP)
- MZL's simple problem(STL multiset的应用)
- My split function in Java
- 17、C语言和设计模式(中介者模式)
- 在醒着的时间里,追求你认为最有意义的
- 黑客步骤
- 【CF149D】【Coloring Brackets】
- C语言字符串,字符转数字,数字转字符(转)
- Linux磁盘管理
- POJ3740
- hdu 1061 Rightmost Digit(快速幂)
- "Accordian" Patience
- JavaScript知识点总结-1
- php var_export()
- UVA673 Parentheses Balance