HDOJ 1686 Oulipo(KMP)
来源:互联网 发布:辽宁快乐12选5遗漏数据 编辑:程序博客网 时间:2024/05/05 09:24
Oulipo
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7429 Accepted Submission(s): 2990
Problem Description
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:
Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…
Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive 'T's is not unusual. And they never use spaces.
So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {'A', 'B', 'C', …, 'Z'} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.
Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…
Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive 'T's is not unusual. And they never use spaces.
So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {'A', 'B', 'C', …, 'Z'} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.
Input
The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:
One line with the word W, a string over {'A', 'B', 'C', …, 'Z'}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).
One line with the text T, a string over {'A', 'B', 'C', …, 'Z'}, with |W| ≤ |T| ≤ 1,000,000.
One line with the word W, a string over {'A', 'B', 'C', …, 'Z'}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).
One line with the text T, a string over {'A', 'B', 'C', …, 'Z'}, with |W| ≤ |T| ≤ 1,000,000.
Output
For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word W in the text T.
Sample Input
3BAPCBAPCAZAAZAZAZAVERDIAVERDXIVYERDIAN
Sample Output
130
一直看到kmp的题就跳过,直接导致周赛跪了,两道kmp模板题都不会。QAQ,补救一下。不能理解也要记住模板。
这题是kmp的模板题,求短字符串在长字符串中出现的次数,代码如下:
<span style="font-size:12px;">#include<cstdio>#include<cstring>#define maxn 1000010char str[10010],s[maxn];int next[10010],lena,lenb,ans;void getnext(){int i=0,j=-1;next[0]=-1;while(i<lena){if(j==-1||str[i]==str[j]) next[++i]=++j;else j=next[j];}}void kmp(){int i=0,j=0;while(i<lenb){if(j==-1||s[i]==str[j]){i++;j++;if(j==lena) ans++;}else j=next[j];}}int main(){int t;scanf("%d",&t);while(t--){scanf("%s%s",str,s);ans=0;lena=strlen(str);lenb=strlen(s);getnext();kmp();printf("%d\n",ans);}return 0;}</span>
0 0
- HDOJ 1686 Oulipo KMP
- HDOJ-1686 Oulipo ---KMP
- HDOJ Oulipo 1686【KMP】
- hdoj 1686 Oulipo【kmp】
- HDOJ 1686 Oulipo(KMP)
- hdoj 1686 Oulipo【kmp】
- hdoj 1686 Oulipo【KMP】
- hdoj-1686Oulipo(Kmp)
- hdoj 1686 Oulipo(KMP算法)
- HDOJ 1686 Oulipo (KMP)
- hdoj 1686 Oulipo 【kmp(模板)】
- hdoj 1686Oulipo (简单KMP匹配)
- HDOJ 题目1686 Oulipo(KMP)
- HDOJ 1686 POJ 3461 Oulipo kmp
- HDOJ Oulipo (基础KMP)
- HDU 1686 Oulipo (kmp)
- hdu 1686 kmp Oulipo
- KMP hdu-1686-Oulipo
- Java文件拆分与合并
- poj 3070 斐波那契数列
- 几天做NOIP原题比赛下来的心得体会
- NSMutableArray等容器类的Copy注意事项
- jQuery 克隆对象
- HDOJ 1686 Oulipo(KMP)
- 【采集层】Kafka 与 Flume 如何选择
- Function插入HUB的过程
- Red and Black (BFS)
- Android 第三方应用广告拦截实现
- SYN 攻击原理以及防范技术
- iOS开发 应用iOS特性实现在应用内打电话,发短信,打开网页等。实现应用间授权以后再整理
- RunLoop 学习
- HDOJ-2523-矩形A+B