POJ3461[Oulipo]KMP裸题
来源:互联网 发布:淘宝卖家开花呗条件 编辑:程序博客网 时间:2024/06/05 16:14
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.
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.
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
3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN
Sample Output
1
3
0
solution: KMP
#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>using namespace std;#define N 1000007#define M 10007char t[M], s[N];int nxt[M];int lent, lens, tot;void get_next(){ int i=0, j=-1; nxt[0]=-1; while( i<lent ){ if ( j==-1||t[i]==t[j] ) i++, j++, nxt[i]=j; else j=nxt[j]; }}void Kmp(){ int i=0, j=0; while( i<lens ){ if( j==-1||s[i]==t[j] ){ i++, j++; if( j==lent ) tot++, j=nxt[j]; }else j=nxt[j]; }}int main(){ int T; scanf( "%d", &T); while( T-- ){ tot=0; scanf( "%s%s", t, s); lent=strlen(t); lens=strlen(s); get_next(); Kmp(); printf( "%d\n", tot); } return 0;}
- POJ3461 Oulipo KMP裸题
- POJ3461[Oulipo]KMP裸题
- POJ3461:Oulipo(MP,KMP裸题)
- 【KMP】 poj3461 Oulipo
- 【KMP】Oulipo POJ3461
- poj3461 Oulipo (kmp)
- [POJ3461] Oulipo[KMP基础]
- poj3461 Oulipo,Kmp
- POJ3461 Oulipo 【KMP】
- POJ3461 Oulipo KMP
- poj3461-Oulipo(KMP)
- poj3461 Oulipo【KMP】
- 【KMP】【POJ3461】Oulipo
- POJ3461 Oulipo(kmp)
- poj3461 Oulipo(KMP)
- 【poj3461】Oulipo(KMP)
- poj3461 Oulipo(KMP)
- POJ3461 Oulipo KMP基础
- 【Android】AndroidStudio自动生成带系统签名的apk
- Java入门基础之【分支结构】9
- createElement和createDocumentFragment区别
- Android 7.0adb无法连接问题
- ConcurrentHashMap源码解析——JDK1.7
- POJ3461[Oulipo]KMP裸题
- oss endpoint
- takephoto图片选择器
- swing入门Helloword
- hpuoj 【1144】n的合成 【数学】&&【思维】
- TypeError:__init__() got an unexpected keyword argument 'xxx'
- 数据结构--串
- 输入两个链表,找出它们的第一个公共结点。
- bootstrap日历控件