HZNU Training 3—L
来源:互联网 发布:淘宝客的返利管理 编辑:程序博客网 时间:2024/05/16 06:36
L - Coloring Brackets
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 (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 modulo 1000000007 (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.
f[l][r][1][0]=1;
f[l][r][0][2]=1;
f[l][r][2][0]=1;
if(j!=2) f[l][r][0][2]=(f[l][r][0][2]+f[l+1][r-1][i][j])%MOD;
if(i!=1) f[l][r][1][0]=(f[l][r][1][0]+f[l+1][r-1][i][j])%MOD;
if(i!=2) f[l][r][2][0]=(f[l][r][2][0]+f[l+1][r-1][i][j])%MOD;
【代码】
#include <stdio.h>#include <string.h>#include <algorithm>#define MOD 1000000007using namespace std;int go[1000];int zhan[1000];long long f[750][750][3][3];void find(int l,int r){ if(l+1==r) { f[l][r][0][1]=1; f[l][r][1][0]=1; f[l][r][0][2]=1; f[l][r][2][0]=1; return; } if(go[l]==r) { find(l+1,r-1); for(int i=0;i<3;i++) for(int j=0;j<3;j++) { if(j!=1) f[l][r][0][1]=(f[l][r][0][1]+f[l+1][r-1][i][j])%MOD; if(j!=2) f[l][r][0][2]=(f[l][r][0][2]+f[l+1][r-1][i][j])%MOD; if(i!=1) f[l][r][1][0]=(f[l][r][1][0]+f[l+1][r-1][i][j])%MOD; if(i!=2) f[l][r][2][0]=(f[l][r][2][0]+f[l+1][r-1][i][j])%MOD; } } els { int p=go[l]; find(l,p); find(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))) f[l][r][i][j]=(f[l][r][i][j]+(f[l][p][i][k]*f[p+1][r][q][j])%MOD)%MOD; }}int main(){char s[1000]; scanf("%s",s); int len=strlen(s); int top=0; for(int i=0;s[i]!='\0';i++) if(s[i]=='(') zhan[top++]=i; else { top--; go[i]=zhan[top]; go[zhan[top]]=i; } memset(f,0,sizeof(f)); find(0,len-1); long long ans=0; for(int i=0;i<3;i++) for(int j=0;j<3;j++) ans=(ans+f[0][len-1][i][j])%MOD; printf("%lld\n",ans); return 0;}
- HZNU Training 3—L
- HZNU Training 3—E
- HZNU Training 3—H
- HZNU Training 3—M
- UESTC Training for Data Structures——L
- UESTC Training for Search Algorithm——L
- UESTC Training for Graph Theory——L、House Man
- SCUT Training 20170913 Problem L
- SCUT Training 20170920 Problem L
- 2014 UESTC Training for Search Algorithm L
- 2014 UESTC Training for Dynamic Programming L
- 2014 UESTC Training for Graph Theory L
- vjudge 4th personal training L - 壮志难酬
- HZNU-1575 愚蠢的摄影师
- HZNU-能量项链【区间dp】
- zoj3953 贪心 training 3
- Second——Training
- Training
- 如何生产.md类型的文件
- How To Install WordPress with LAMP on Ubuntu 16.04
- HEX2BIN在WIN7下不能用之后
- extjs 6.x 的使用
- htmlunit爬取js异步加载后的页面
- HZNU Training 3—L
- 批处理隐藏自身窗口
- HDFS中的Namenode和Datanode
- udp通信笔记(一)
- bzoj 2956: 模积和 分块+数学
- 仿ios支付宝解锁功能(一)
- YOLO应用化之保存视频
- 深度优先搜索---最短路径
- SPOJ1812 && bzoj2946 [后缀自动机]