题目链接:点这里!!!
题意:中文题
题解:
区间dp。设dp[i][j][k]为区间[i,j]能否合成k这个字母。
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<vector>
#include<bitset>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<cstdlib>
#include<cmath>
#define LL long long
#define pb push_back
#define pa pair<int,int>
#define clr(a,b) memset(a,b,sizeof(a))
#define lson lr<<1,l,mid
#define rson lr<<1|1,mid+1,r
#define bug(x) printf("%d++++++++++++++++++++%d\n",x,x)
#define key_value ch[ch[root][1]][0]
#pragma comment(linker, "/STACK:102400000000,102400000000")
const LL MOD = 1000000007;
const int N = 200+15;
const int maxn = 1e5+15;
const int letter = 130;
const LL INF = 1e7;
const double pi=acos(-1.0);
const double eps=1e-10;
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int a[5];
int vis[5][5][5];
int dp[N][N][5];
///vis[i][j][k] 表示ij是否能合成k
///dp[i][j][k]表示[i,j]区间能否合成k
char s[N];
int ok(char c){
if(c=='W') return 0;
if(c=='I') return 1;
if(c=='N') return 2;
if(c=='G') return 3;
}
int main(){
for(int i=0;i<4;i++) scanf("%d",a+i);
for(int y=0;y<4;y++){
int x=a[y];
while(x--){
scanf("%s",s);
int u=ok(s[0]),v=ok(s[1]);
vis[u][v][y]=1;
}
}
scanf("%s",s+1);
int n=strlen(s+1);
for(int i=1;i<=n;i++){
dp[i][i][ok(s[i])]=1;
}
for(int len=2;len<=n;len++){
for(int i=1;i<=n;i++){
int j=i+len-1;
if(j>n) break;
for(int u=0;u<4;u++)
for(int k=i;k<j;k++)
for(int v=0;v<4;v++)
for(int w=0;w<4;w++){
if(dp[i][k][v]&&dp[k+1][j][w]&&vis[v][w][u])
dp[i][j][u]=1;
}
}
}
int flag=0;
for(int i=0;i<4;i++){
if(dp[1][n][i]){
flag=1;
if(i==0) putchar('W');
else if(i==1) putchar('I');
else if(i==2) putchar('N');
else if(i==3) putchar('G');
}
}
if(!flag) puts("The name is wrong!");
else puts("");
return 0;
}