NBUT 1222 English Game 2010辽宁省赛
2017-03-29 20:45
239 查看
Time limit 1000 msMemory limit 131072 kBThis English game is a simple English words connection game.The rules are as follows: there are N English words in a dictionary, and every word has its own weight v. There is a weight if the corresponding word is used. Now there is a target string X. You have to pick some words in the dictionary, and then connect them to form X. At the same time, the sum weight of the words you picked must be the biggest.InputThere are several test cases. For each test, N (1<=n<=1000) and X (the length of x is not bigger than 10000) are given at first. Then N rows follow. Each row contains a word wi (the length is not bigger than 30) and the weight of it. Every word is composed of lowercases. No two words in the dictionary are the same.
OutputFor each test case, output the biggest sum weight, if you could not form the string X, output -1.
Sample Input
Sample Output
OutputFor each test case, output the biggest sum weight, if you could not form the string X, output -1.
Sample Input
1 aaaa a 2 3 aaa a 2 aa 5 aaa 6 4 abc a 1 bc 2 ab 4 c 1 3 abcd ab 10 bc 20 cd 30 3 abcd cd 100 abc 1000 bcd 10000
Sample Output
8 7 5 40 -1 用给的每个小字符串的价值拼出给的大字符串的最大价值 我自己还不会,先记一下同校大牛的代码,再研究
#include<iostream> #include<stdio.h> #include<string> #include<string.h> #include<algorithm> #include<map> #include<cmath> using namespace std; const int N = 10005; struct node { int l,r,v; int nt; }p[1000000]; int h[10005],cnt; void add(int l,int r,int v) { p[++cnt].l = l; p[cnt].r = r; p[cnt].v = v; p[cnt].nt = h[l]; h[l]=cnt; } char s[10005]; char c[1005][35]; int dp[10005]; int l[1005],v[1005],n,len; int next[50]; int slen; void getNext(int x) { int j, k; j = 0; k = -1; next[0] = -1; while(j < l[x]) if(k == -1 || c[x][j] == c[x][k]) next[++j] = ++k; else k = next[k]; } void KMP_Count(int x) { int ans = 0; int i, j = 0; if(slen == 1 && l[x] == 1) { if(s[0] == c[x][0]) add(0,1,v[x]); else return; } getNext(x); for(i = 0; i < slen; i++) { while(j > 0 && s[i] != c[x][j]) j = next[j]; if(s[i] == c[x][j]) j++; if(j == l[x]) { add(i-l[x]+1,i+1,v[x]); j = next[j]; } } } int main() { while(scanf("%d%s",&n,s)!=EOF) { cnt = 0; memset(h,0,sizeof(h)); slen = len = strlen(s); memset(dp,-1,sizeof(dp)); dp[0]=0; for(int i=1;i<=n;i++) { scanf("%s%d",c[i],&v[i]); l[i] = strlen(c[i]); KMP_Count(i); } for(int i=0;i<len;i++) { if(dp[i]==-1) continue; for(int j=h[i];j>0;j=p[j].nt) { dp[p[j].r] = max(dp[p[j].r], dp[i]+p[j].v); } } printf("%d\n",dp[len]); } return 0; }
相关文章推荐
- NBUT 1222 English Game(trie树+DP)
- NBUT 1217 Dinner 2010辽宁省赛
- NBUT 1224 Happiness Hotel 2010辽宁省赛
- NBUT 1222 English Game(trie树+DP)
- NBUT 1221 Intermediary 2010辽宁省赛
- NBUT 1219 Time 2010辽宁省赛
- NBUT 1220 SPY 2010辽宁省赛
- 2010辽宁省赛 NBUT 1222 English Game【字典树+DP】
- NBUT 1225 NEW RDSP MODE I 2010辽宁省赛
- 2010 ACM/ICPC 辽宁省赛 Dinner
- ZOJ 1985 Largest Rectangle in a Histogram(刷广告)2010辽宁省赛
- SharePoint 2010 PowerShell base function abut list
- 辽宁省赛2010 G题 Friends Number
- 2010年辽宁省赛 NBUT 1218【DFS实现树的遍历与更新】
- NBUT 1223 Friends number 2010辽宁省赛
- Friends number 2010辽宁省赛
- 【9018p1316】SPY(辽宁省赛2010)
- 辽宁省赛2010-time[水题]
- Solution Configuration but not Platform in VS2010 Toolbar
- 辽宁省赛2010 G - NEW RDSP MODE I【思路题】(省赛选拔赛之个人赛9)