标签：hat cut core VID ota ring str1 org soc
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 49378 | Accepted: 19617 |
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.
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:
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
C/C++：
1 #include <map> 2 #include <queue> 3 #include <cmath> 4 #include <vector> 5 #include <string> 6 #include <cstdio> 7 #include <cstring> 8 #include <climits> 9 #include <iostream> 10 #include <algorithm> 11 #define INF 0x3f3f3f3f 12 using namespace std; 13 const int my_max = 1e6 + 10; 14 15 int my_len1, my_len2, my_next[my_max]; 16 char my_str1[my_max], my_str2[my_max]; 17 18 int my_kmp() 19 { 20 int my_cnt = 0; 21 memset(my_next, 0, sizeof(my_next)); 22 for (int i = 1, j = 0; i < my_len1; ++ i) 23 { 24 while (j > 0 && my_str1[i] != my_str1[j]) j = my_next[j]; 25 if (my_str1[i] == my_str1[j]) ++ j; 26 my_next[i + 1] = j; 27 } 28 for (int i = 0, j = 0; i < my_len2; ++ i) 29 { 30 while (j > 0 && my_str1[j] != my_str2[i]) j = my_next[j]; 31 if (my_str1[j] == my_str2[i]) ++ j; 32 if (j == my_len1) my_cnt ++, j = my_next[j]; 33 } 34 return my_cnt; 35 } 36 37 int main() 38 { 39 int t; 40 scanf("%d", &t); 41 while (t --) 42 { 43 scanf("%s", my_str1); 44 my_len1 = strlen(my_str1); 45 scanf("%s", my_str2); 46 my_len2 = strlen(my_str2); 47 48 printf("%d\n", my_kmp()); 49 } 50 return 0; 51 }
标签：hat cut core VID ota ring str1 org soc
原文地址：https://www.cnblogs.com/GetcharZp/p/9510676.html
