正反两遍扩展KMP,维护公共长度为L时。出如今最左边和最右边的位置。

。。

然后枚举推断。。。

E. Martian Strings
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

During the study of the Martians Petya clearly understood that the Martians are absolutely lazy. They like to sleep and don't like to wake up.

Imagine a Martian who has exactly n eyes located in a row and numbered from the left to the right from 1 to n.
When a Martian sleeps, he puts a patch on each eye (so that the Martian morning doesn't wake him up). The inner side of each patch has an uppercase Latin letter. So, when a Martian wakes up and opens all his eyes he sees a string s consisting
of uppercase Latin letters. The string's length isn.

"Ding dong!" — the alarm goes off. A Martian has already woken up but he hasn't opened any of his eyes. He feels that today is going to be a hard day, so he wants to open his eyes and see something good. The Martian considers only m Martian
words beautiful. Besides, it is hard for him to open all eyes at once so early in the morning. So he opens two non-overlapping segments of consecutive eyes. More formally, the Martian chooses four numbers abcd,
(1 ≤ a ≤ b < c ≤ d ≤ n) and opens all eyes with numbers i such
that a ≤ i ≤ b or c ≤ i ≤ d. After
the Martian opens the eyes he needs, he reads all the visible characters from the left to the right and thus, he sees some word.

Let's consider all different words the Martian can see in the morning. Your task is to find out how many beautiful words are among them.

Input

The first line contains a non-empty string s consisting of uppercase Latin letters. The strings' length is n (2 ≤ n ≤ 105).
The second line contains an integer m (1 ≤ m ≤ 100)
— the number of beautiful words. Next m lines contain the beautiful words pi,
consisting of uppercase Latin letters. Their length is from 1 to 1000.
All beautiful strings are pairwise different.

Output

Print the single integer — the number of different beautiful strings the Martian can see this morning.

Sample test(s)
input
ABCBABA
2
BAAB
ABBA
output
1
Note

Let's consider the sample test. There the Martian can get only the second beautiful string if he opens segments of eyes a = 1, b = 2 and c = 4, d = 5 or
of he opens segments of eyes a = 1, b = 2 and c = 6, d = 7.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm> using namespace std; const int INF=0x3f3f3f3f; const int maxn=101000; char T[maxn],P[maxn/100];
int next[maxn/10],ex[maxn]; char rT[maxn],rP[maxn/100];
int rnext[maxn/100],rex[maxn];
int LEFT[maxn/100],RIGHT[maxn/100]; int n,q,m; void pre_exkmp(int next[],char P[],int m)
{
next[0]=m;
int j=0,k=1;
while(j+1<m&&P[j]==P[j+1]) j++;
next[1]=j;
for(int i=2;i<m;i++)
{
int p=next[k]+k-1;
int L=next[i-k];
if(i+L<p+1) next[i]=L;
else
{
j=max(0,p-i+1);
while(i+j<m&&P[i+j]==P[j]) j++;
next[i]=j; k=i;
}
}
} void get_limit(int kind,int pos,int ex)
{
if(kind==0)
{
if(LEFT[ex]==INF)
{
LEFT[ex]=pos;
}
}
else if(kind==1)
{
if(RIGHT[ex]==-1)
{
RIGHT[ex]=n-1-pos;
}
}
} void gao(int kind,int m)
{
if(kind==1)
{
int last=-1;
for(int i=m;i>=1;i--)
{
if(RIGHT[i]<last)
{
RIGHT[i]=last;
}
else
{
last=RIGHT[i];
}
}
}
else
{
int last=INF;
for(int i=m;i>=1;i--)
{
if(LEFT[i]>last)
{
LEFT[i]=last;
}
else
{
last=LEFT[i];
}
}
}
} ///kind 0...LEFT 1...RIGHT
void exkmp(int kind,int& mx,int ex[],int next[],char P[],char T[],int n,int m)
{
pre_exkmp(next,P,m);
int j=0,k=0;
while(j<n&&j<m&&P[j]==T[j]) j++;
ex[0]=j; mx=max(mx,ex[0]);
get_limit(kind,0,ex[0]); for(int i=1;i<n;i++)
{
int p=ex[k]+k-1;
int L=next[i-k];
if(i+L<p+1) ex[i]=L;
else
{
j=max(0,p-i+1);
while(i+j<n&&j<m&&T[i+j]==P[j]) j++;
ex[i]=j; k=i;
}
mx=max(mx,ex[i]);
get_limit(kind,i,ex[i]);
}
} int main()
{
scanf("%s",T);
n=strlen(T);
for(int i=0;i<n;i++)
rT[i]=T[n-1-i];
int ans=0;
scanf("%d",&q);
while(q--)
{
scanf("%s",P);
int m=strlen(P);
for(int i=0;i<m;i++)
rP[i]=P[m-1-i]; memset(LEFT,63,sizeof(LEFT));
memset(RIGHT,-1,sizeof(RIGHT)); int mx1=0,mx2=0;
exkmp(0,mx1,ex,next,P,T,n,m);
gao(0,m);
exkmp(1,mx2,rex,rnext,rP,rT,n,m);
gao(1,m); if(mx1+mx2<m) continue; bool flag=false; for(int len=1;len<m&&flag==false;len++)
{ if(LEFT[len]==INF||RIGHT[m-len]==-1) continue;
if(LEFT[len]+len-1<RIGHT[m-len]-(m-len)+1)
{
ans++;
flag=true;
}
}
}
printf("%d\n",ans);
return 0;
}

Codeforces 149 E. Martian Strings的更多相关文章

  1. CodeForces 149E Martian Strings exkmp

    Martian Strings 题解: 对于询问串, 我们可以从前往后先跑一遍exkmp. 然后在倒过来,从后往前跑一遍exkmp. 我们就可以记录下 对于每个正向匹配来说,最左边的点在哪里. 对于每 ...

  2. xtu summer individual-4 D - Martian Strings

    Martian Strings Time Limit: 2000ms Memory Limit: 262144KB This problem will be judged on CodeForces. ...

  3. Codeforces 385B Bear and Strings

    题目链接:Codeforces 385B Bear and Strings 记录下每一个bear的起始位置和终止位置,然后扫一遍记录下来的结构体数组,过程中用一个变量记录上一个扫过的位置,用来去重. ...

  4. Codeforces 482C Game with Strings(dp+概率)

    题目链接:Codeforces 482C Game with Strings 题目大意:给定N个字符串,如今从中选定一个字符串为答案串,你不知道答案串是哪个.可是能够通过询问来确定, 每次询问一个位置 ...

  5. codeforces 149E . Martian Strings kmp

    题目链接 给一个字符串s, n个字符串str. 令tmp为s中不重叠的两个连续子串合起来的结果, 顺序不能改变.问tmp能形成n个字符串中的几个. 初始将一个数组dp赋值为-1. 对str做kmp, ...

  6. 【24.34%】【codeforces 560D】Equivalent Strings

    time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...

  7. CodeForces 682D Alyona and Strings (四维DP)

    Alyona and Strings 题目链接: http://acm.hust.edu.cn/vjudge/contest/121333#problem/D Description After re ...

  8. codeforces 518A. Vitaly and Strings

    A. Vitaly and Strings time limit per test 1 second memory limit per test 256 megabytes input standar ...

  9. Codeforces 985 F - Isomorphic Strings

    F - Isomorphic Strings 思路:字符串hash 对于每一个字母单独hash 对于一段区间,求出每个字母的hash值,然后排序,如果能匹配上,就说明在这段区间存在字母间的一一映射 代 ...

随机推荐

  1. ⑨bootstrap组件 按钮式下拉菜单 输入框 使用基础案例

      <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8&q ...

  2. jQuery选择器(属性过滤选择器)第六节

    <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/stri ...

  3. Oracle-4 - :超级适合初学者的入门级笔记:plsql,基本语法,记录类型,循环,游标,异常处理,存储过程,存储函数,触发器

    初学者可以从查询到现在的pl/sql的内容都可以在我这里的笔记中找到,希望能帮到大家,视频资源在 资源, 我自己的全套笔记在  笔记 在pl/sql中可以继续使用的sql关键字有:update del ...

  4. tomcat相关实验

    tomcat相关实验 1.实现LNT 同主机实现 1.安装并启动tomcat 1)OpenJDK的安装 yum install java-1.8.0-openjdk-devel.x86_64 确定JD ...

  5. C#实现倒油算法

    原题如下:12(a桶 满的 有12斤油)斤桶里 取出6斤油 有 另外有8斤(b桶)和5斤(c桶)两个空桶  让程序输出取出这6斤油的步骤 现在实现的算法可以配参数(定义有几个桶,初始有多少油,要得到多 ...

  6. java之JVM学习--基本机构

    JDK,JRE,JVM关系图 JVM物理结构: jvm内存区详解: 程序计数器 程序计数器(Program Counter Register)是一块较小的内存空间,它的作用可以看做是当前线程所执行的字 ...

  7. linux操作系统基础篇(二)

    Linux用户.群组.权限 1.用户也是由一个个文件组成的下列文件都是存放用户信息的文件 useradd user1 /etc/passwd: 存放用户信息  /etc/shadow/ :存放用户密码 ...

  8. tornado的非异步阻塞模式

    [优化tornado阻塞任务的三个选择] 1.优化阻塞的任务,使其执行时间更快.经常由于是一个DB的慢查询,或者复杂的上层模板导致的,这个时候首要的是加速这些任务,而不是优化复杂的webserver. ...

  9. [转]SQL Server 表变量和临时表的区别

    一.表变量 表变量在SQL Server 2000中首次被引入.表变量的具体定义包括列定义,列名,数据类型和约束.而在表变量中可以使用的约束包括主键约束,唯一约束,NULL约束和CHECK约束(外键约 ...

  10. JavaScript中的内存泄漏以及如何处理

    随着现在的编程语言功能越来越成熟.复杂,内存管理也容易被大家忽略.本文将会讨论JavaScript中的内存泄漏以及如何处理,方便大家在使用JavaScript编码时,更好的应对内存泄漏带来的问题. 概 ...