hdu6153(kmp) A Secret
来源:互联网 发布:宁波大学网络注销 编辑:程序博客网 时间:2024/06/05 03:00
A Secret
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 195 Accepted Submission(s): 83
Problem Description
Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS tell:
Suffix(S2,i) = S2[i...len].Ni is the times that Suffix(S2,i) occurs in S1 and Li is the length of Suffix(S2,i).Then the secret is the sum of the product of Ni and Li.
Now SF wants you to help him find the secret.The answer may be very large, so the answer should mod 1000000007.
Suffix(S2,i) = S2[i...len].Ni is the times that Suffix(S2,i) occurs in S1 and Li is the length of Suffix(S2,i).Then the secret is the sum of the product of Ni and Li.
Now SF wants you to help him find the secret.The answer may be very large, so the answer should mod 1000000007.
Input
Input contains multiple cases.
The first line contains an integer T,the number of cases.Then following T cases.
Each test case contains two lines.The first line contains a string S1.The second line contains a string S2.
1<=T<=10.1<=|S1|,|S2|<=1e6.S1 and S2 only consist of lowercase ,uppercase letter.
The first line contains an integer T,the number of cases.Then following T cases.
Each test case contains two lines.The first line contains a string S1.The second line contains a string S2.
1<=T<=10.1<=|S1|,|S2|<=1e6.S1 and S2 only consist of lowercase ,uppercase letter.
Output
For each test case,output a single line containing a integer,the answer of test case.
The answer may be very large, so the answer should mod 1e9+7.
The answer may be very large, so the answer should mod 1e9+7.
Sample Input
2aaaaaaaabababababa
Sample Output
1319Hintcase 2: Suffix(S2,1) = "aba",Suffix(S2,2) = "ba",Suffix(S2,3) = "a".N1 = 3,N2 = 3,N3 = 4.L1 = 3,L2 = 2,L3 = 1.ans = (3*3+3*2+4*1)%1000000007.
#include<cstdio>#include<iostream>#include<cstring>using namespace std;#define ll long longconst int mn=1e6+5;int n,m,nextval[mn];char s[mn],t[mn];ll id[mn];const int mod=1e9+7;void getNextval() { int i=0,j=-1; nextval[0]=-1; while(i<m) { if(j==-1||t[i]==t[j]) nextval[++i]=++j; else j=nextval[j]; }}void KMP() { int i=0,j=0; while(i<n) { if(j==-1||s[i]==t[j]) ++i,++j; else j=nextval[j]; id[j]++; if(j==m) j=nextval[j]; }}int main() { int T; scanf("%d",&T); while(T--) { memset(id,0,sizeof(id)); scanf("%s%s",s,t); n=strlen(s),m=strlen(t); for(int i=0;i<=(n-1)/2;++i) swap(s[i],s[n-1-i]); for(int i=0;i<=(m-1)/2;++i) swap(t[i],t[m-1-i]); getNextval(); KMP(); ll ans=0; for(int i=m;i>0;--i) { id[nextval[i]]+=id[i]; ans=(ans+id[i]*i)%mod;} printf("%lld\n",ans); } return 0;}
阅读全文
2 0
- hdu6153(kmp) A Secret
- hdu6153(kmp) A Secret
- [kmp] hdu6153 A Secret
- hdu6153-A Secret (kmp/扩展kmp)
- hdu6153 A Secret (拓展KMP)
- HDU6153-A Secret ex-kmp
- HDU6153 A Secret 扩展KMP
- 【HDU6153】A Secret(扩展KMP)
- [扩展kmp] hdu6153 A Secret
- HDU6153 A Secret(扩展KMP)2017中国大学生程序设计竞赛
- hdu6153 A Secret CCPC1004 扩展KMP
- HDU6153-A Secret
- HDU6153-A Secret
- hdu6153-exkmp&&脑洞-A Secret
- HDU6153(KMP)
- HDU 6153-A Secret(kmp&&ccpc)
- HDU 6153 A Secret(KMP)
- HDU 6153 A Secret (扩展KMP)
- Linux部署web程序
- nodgd 好路线 noip 2015 模拟赛 T3
- 关于局域网内多人通过IP连接同一个sql数据库的问题
- 原码,反码,补码详解
- 辗转相除法求最大公约数
- hdu6153(kmp) A Secret
- Linux Centos6.8 安装配置MongoDB-3.4.0
- 前端框架汇总
- Java面试题3:try...catch...finally
- HDU 6154 CaoHaha's staff(思维+找规律)
- 人之所以能,是相信能 jzoj 2017.8.19 B组
- OSPF(一)【概述】
- What is meant by 'Bounce' the database
- C++学习笔记系列二