BZOJ 1055 玩具取名(区间DP)

很显然的区间DP，定义dp[i][j][k]， 如果dp[i][j][k]=1表示字符串[i,j]可以组成k字符。

# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <set>
# include <cmath>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi acos(-1.0)
# define eps 1e-
# define MOD
# define INF
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
# define lch p<<,l,mid
# define rch p<<|,mid+,r
# define mp make_pair
# define pb push_back
typedef pair<int,int> PII;
typedef vector<int> VI;
# pragma comment(linker, "/STACK:1024000000,1024000000")
typedef long long LL;
int Scan() {
    int res=, flag=;
    char ch;
    if((ch=getchar())=='-') flag=;
    else if(ch>=''&&ch<='') res=ch-'';
    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');
    return flag?-res:res;
}
void Out(int a) {
    if(a<) {putchar('-'); a=-a;}
    if(a>=) Out(a/);
    putchar(a%+'');
}
const int N=;
//Code begin...

struct To{int a[][];}to[];
int dp[][][], p[], len, a[];
char wing[];

void init(){p['W'-'A']=; p['I'-'A']=; p['N'-'A']=; p['G'-'A']=; mem(dp,-);}
void dfs(int l, int r)
{
    if (~dp[l][r][]) return ;
    if (l==r) {dp[l][r][]=; dp[l][r][p[wing[l]-'A']]=; return ;}
    FO(i,l,r) {
        dfs(l,i); dfs(i+,r);
        FOR(j,,) FOR(k,,a[j]) {
            int tmp1=to[j].a[k][], tmp2=to[j].a[k][];
            if (dp[l][i][tmp1]==&&dp[i+][r][tmp2]==) {dp[l][r][j]=; break;}
        }
    }
    dp[l][r][]=;
    return ;
}
int main ()
{
    char s[];
    init();
    scanf("%d%d%d%d",a+,a+,a+,a+);
    FOR(i,,a[]) scanf("%s",s), to[].a[i][]=p[s[]-'A'], to[].a[i][]=p[s[]-'A'];
    FOR(i,,a[]) scanf("%s",s), to[].a[i][]=p[s[]-'A'], to[].a[i][]=p[s[]-'A'];
    FOR(i,,a[]) scanf("%s",s), to[].a[i][]=p[s[]-'A'], to[].a[i][]=p[s[]-'A'];
    FOR(i,,a[]) scanf("%s",s), to[].a[i][]=p[s[]-'A'], to[].a[i][]=p[s[]-'A'];
    scanf("%s",wing+);
    len=strlen(wing+);
    dfs(,len);
    int flag=;
    if (dp[][len][]==) flag=, putchar('W');
    if (dp[][len][]==) flag=, putchar('I');
    if (dp[][len][]==) flag=, putchar('N');
    if (dp[][len][]==) flag=, putchar('G');
    if (!flag) {puts("The name is wrong!"); return ;}
    putchar('\n');
    return ;
}