Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4384 Accepted Submission(s): 2054
Problem Description
It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example:
s: "abab"
The prefixes are: "a", "ab", "aba", "abab"
For each prefix, we can count the times it matches in s. So we can see that prefix "a" matches twice, "ab" matches twice too, "aba" matches once, and "abab" matches once. Now you are asked to calculate the sum of the match times for all the prefixes. For "abab", it is 2 + 2 + 1 + 1 = 6.
The answer may be very large, so output the answer mod 10007.
s: "abab"
The prefixes are: "a", "ab", "aba", "abab"
For each prefix, we can count the times it matches in s. So we can see that prefix "a" matches twice, "ab" matches twice too, "aba" matches once, and "abab" matches once. Now you are asked to calculate the sum of the match times for all the prefixes. For "abab", it is 2 + 2 + 1 + 1 = 6.
The answer may be very large, so output the answer mod 10007.
Input
The first line is a single integer T, indicating the number of test cases.
For each case, the first line is an integer n (1 <= n <= 200000), which is the length of string s. A line follows giving the string s. The characters in the strings are all lower-case letters.
For each case, the first line is an integer n (1 <= n <= 200000), which is the length of string s. A line follows giving the string s. The characters in the strings are all lower-case letters.
Output
For each case, output only one number: the sum of the match times for all the prefixes of s mod 10007.
Sample Input
1 4 abab
Sample Output
6
Author
foreverlin@HNU
Source
#define DeBUG
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <sstream>
#include <map>
#include <list>
#include <bitset>
using namespace std ;
#define zero {0}
#define INF 0x3f3f3f3f
#define EPS 1e-6
typedef long long LL;
const double PI = acos(-1.0);
//#pragma comment(linker, "/STACK:102400000,102400000")
inline int sgn(double x)
{
return fabs(x) < EPS ? 0 : (x < 0 ? -1 : 1);
}
#define N 1000002
const int mod = 10007;
int next[N];
int n;
char a[N];
int ans[N];
void GetNext(int len)
{
int i = 1, j = 0;
next[0] = -1;
while (i < len)
{
if (j == -1 || a[i] == a[j])
{
j++;
i++; next[i] = j;
}
else
{
j = next[j];
}
}
}
int cnt = 1;
int main()
{
#ifdef DeBUGs
freopen("C:\\Users\\Sky\\Desktop\\1.in", "r", stdin);
#endif
int T;
scanf("%d", &T);
while (T--)
{
memset(next, 0, sizeof(next));
scanf("%d", &n);
scanf("%s", a);
GetNext(n);//next[i]表示前缀等于后缀的最大长度
// for (int i = 1; i <= n; i++)
// {
// printf("%d ", next[i]);
// }
// printf("\n");
memset(ans, 0, sizeof(ans));
int sum = 0;
for (int i = 1; i <= n; i++)
{
ans[i] = (ans[next[i]] + 1) % mod;
sum = (sum + ans[i]) % mod;
// printf("%d,", ans[i]);
}
printf("%d\n", sum);
}
return 0;
}
0 0 0 1 2 1 2
状态转移~
ans[i] = (ans[next[i]] + 1)