全部串起来做SA, 在按字典序排序的后缀中, 包含每个询问串必定是1段连续的区间, 对每个询问串s二分+RMQ求出包含s的区间. 然后就是求区间的不同的数的个数(经典问题), sort queries + BIT 就行了.时间复杂度O(N log N). 速度垫底了QAQ 你们都会SAM。。。。

----------------------------------------------------------------------

#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
 
using namespace std;
 

#define b(i) (1 << (i))

 
const int maxL = 540009;
const int maxQ = 60009;
 
char S[maxL], str[maxL];
int N, n, q, Id[maxL], qL[maxQ], qR[maxQ], L[maxQ], R[maxQ];
int Rank[maxL], Height[maxL], Sa[maxL], cnt[maxL];
int RMQ[20][maxL], r[maxQ], ans[maxQ];
 
void Build() {
int m = 'z' + 1, *x = Rank, *y = Height;
for(int i = 0; i < m; i++) cnt[i] = 0;
for(int i = 0; i < N; i++) cnt[x[i] = S[i]]++;
for(int i = 1; i < m; i++) cnt[i] += cnt[i - 1];
for(int i = N; i--; ) Sa[--cnt[x[i]]] = i;
for(int k = 1, p = 0; k <= N; k <<= 1, p = 0) {
for(int i = N - k; i < N; i++) y[p++] = i;
for(int i = 0; i < N; i++)
if(Sa[i] >= k) y[p++] = Sa[i] - k;
for(int i = 0; i < m; i++) cnt[i] = 0;
for(int i = 0; i < N; i++) cnt[x[y[i]]]++;
for(int i = 1; i < m; i++) cnt[i] += cnt[i - 1];
for(int i = N; i--; ) Sa[--cnt[x[y[i]]]] = y[i];
swap(x, y);
x[Sa[0]] = 0;
p = 1;
for(int i = 1; i < N; i++) {
if(y[Sa[i]] != y[Sa[i - 1]] || y[Sa[i] + k] != y[Sa[i - 1] + k]) p++;
x[Sa[i]] = p - 1;
}
if((m = p) >= N) break;
}
for(int i = 0; i < N; i++) Rank[Sa[i]] = i;
Height[0] = Height[N] = 0;
for(int i = 0, h = 0; i < N; i++) if(Rank[i]) {
if(h) h--;
while(S[i + h] == S[Sa[Rank[i] - 1] + h]) h++;
Height[Rank[i]] = h;
}
}
 
void Init_RMQ() {
for(int i = 0; i < N; i++)
RMQ[0][i] = Height[i];
for(int i = 1; b(i) <= N; i++)
for(int j = 0; j + b(i) <= N; j++)
RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + b(i - 1)]);
}
 
inline int LCP(int l, int r) {
int t = log2(r - l + 1);
return min(RMQ[t][l], RMQ[t][r - b(t) + 1]);
}
 
void calc(int &L, int &R, int p, int len) {
int _l, _r;
p = Rank[p];
if(Height[p] >= len) {
_l = 0, _r = p - 1;
while(_l <= _r) {
int m = (_l + _r) >> 1;
if(LCP(m + 1, p) >= len)
L = m, _r = m - 1;
else
_l = m + 1;
}
} else
L = p;
if(Height[p + 1] >= len) {
_l = p + 1, _r = N - 1;
while(_l <= _r) {
int m = (_l + _r) >> 1;
if(LCP(p + 1, m) >= len)
R = m, _l = m + 1;
else
_r = m - 1;
}
} else
R = p;
}
 
struct Link {
int p;
Link* n;
} pool[maxL], *pt = pool, *H[maxL];
 
inline void AddL(int v, int p) {
pt->p = p, pt->n = H[v], H[v] = pt++;
}
 
int B[maxL];
 
inline void Modify(int p, int v) {
if(!p) return;
for(; p <= N; p += p & -p) B[p] += v;
}
 
inline int Sum(int p) {
int ret = 0;
for(; p; p -= p & -p) ret += B[p];
return ret;
}
 
inline bool Cmp(const int &l, const int &r) {
return qL[l] < qL[r];
}
 
void Work() {
Build();
Init_RMQ();
memset(B, 0, sizeof B);
for(int i = N; i--; )
if(Id[Sa[i]] >= 0) AddL(Id[Sa[i]], i);
for(int i = 0; i < n; i++)
Modify(H[i]->p + 1, 1);
for(int i = 0; i < q; i++)
calc(qL[r[i] = i], qR[i], L[i], R[i] - L[i]);
sort(r, r + q, Cmp);
int c = 0;
for(int i = 0; i < N; i++) {
while(qL[r[c]] == i) {
ans[r[c]] = Sum(qR[r[c]] + 1) - Sum(qL[r[c]]);
if(++c >= q) break;
}
if(c >= q) break;
Modify(i + 1, -1);
if(H[Id[Sa[i]]]) {
H[Id[Sa[i]]] = H[Id[Sa[i]]]->n;
if(H[Id[Sa[i]]])
Modify(H[Id[Sa[i]]]->p + 1, 1);
}
}
for(int i = 0; i < q; i++)
printf("%d\n", ans[i]);
}
 
inline int getstr() {
char c = getchar();
for(; !islower(c); c = getchar());
int len = 0;
for(; islower(c); c = getchar())
str[len++] = c;
return len;
}
 
void Init() {
scanf("%d%d", &n, &q);
N = 0;
int len;
for(int i = 0; i < n; i++) {
len = getstr();
for(int j = 0; j < len; j++) {
Id[N] = i;
S[N++] = str[j];
}
Id[N] = -1;
S[N++] = '$';
}
for(int i = 0; i < q; i++) {
len = getstr();
L[i] = N;
for(int j = 0; j < len; j++) {
Id[N] = -1;
S[N++] = str[j];
}
R[i] = N;
Id[N] = -1;
S[N++] = '$';
}
S[N - 1] = 0;
}
 
int main() {
Init();
Work();
return 0;
}

----------------------------------------------------------------------

2780: [Spoj]8093 Sevenk Love Oimaster

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 581  Solved: 188
[Submit][Status][Discuss]

Description

Oimaster and sevenk love each other.

    But recently,sevenk heard that a girl named ChuYuXun was dating with oimaster.As a woman's nature, sevenk felt angry and began to check oimaster's online talk with ChuYuXun.    Oimaster talked with ChuYuXun n times, and each online talk actually is a string.Sevenk asks q questions like this,    "how many strings in oimaster's online talk contain this string as their substrings?"

Input

There are two integers in the first line, 
the number of strings n and the number of questions q.
And n lines follow, each of them is a string describing oimaster's online talk. 
And q lines follow, each of them is a question.
n<=10000, q<=60000 
the total length of n strings<=100000, 
the total length of q question strings<=360000

Output

For each question, output the answer in one line.

Sample Input

3 3
abcabcabc
aaa
aafe
abc
a
ca

Sample Output

1
3
1

HINT

Source

BZOJ 2780: [Spoj]8093 Sevenk Love Oimaster( 后缀数组 + 二分 + RMQ + 树状数组 )的更多相关文章

  1. 三种做法:BZOJ 2780: [Spoj]8093 Sevenk Love Oimaster

    目录 题意 思路 AC_Code1 AC_Code2 AC_Code3 参考 @(bzoj 2780: [Spoj]8093 Sevenk Love Oimaster) 题意 链接:here 有\(n ...

  2. BZOJ 2780: [Spoj]8093 Sevenk Love Oimaster [广义后缀自动机]

    JZPGYZ - Sevenk Love Oimaster     Oimaster and sevenk love each other.       But recently,sevenk hea ...

  3. bzoj 2780 [Spoj]8093 Sevenk Love Oimaster

    LINK:Sevenk Love Oimaster 询问一个模式串在多少个文本串中出现过. 考虑广义SAM 统计这种数量问题一般有三种做法. 一种 暴力bitset 这道题可能可以过? 一种 暴力跳p ...

  4. bzoj 3277 串 && bzoj 3473 字符串 && bzoj 2780 [Spoj]8093 Sevenk Love Oimaster——广义后缀自动机

    题目:https://www.lydsy.com/JudgeOnline/problem.php?id=3277 https://www.lydsy.com/JudgeOnline/problem.p ...

  5. BZOJ 2780 [Spoj]8093 Sevenk Love Oimaster ——广义后缀自动机

    给定n个串m个询问,问每个串在n个串多少个串中出现了. 构建广义后缀自动机,(就是把所有字符串的后缀自动机合并起来)其实只需要add的时候注意一下就可以了. 然后对于每一个串,跑一边匹配,到达了now ...

  6. 【刷题】BZOJ 2780 [Spoj]8093 Sevenk Love Oimaster

    Description Oimaster and sevenk love each other. But recently,sevenk heard that a girl named ChuYuXu ...

  7. bzoj 2780: [Spoj]8093 Sevenk Love Oimaster(广义SAM)

    题目大意:给出n个原串,再给出m个查询串.求每个查询串出现在了多少原串中. 题解 直接对原串建一个广义SAM,然后把每一个原串放到SAM上跑一跑,记录一下每一个状态属于多少个原串,用$size$表示. ...

  8. bzoj 2780: [Spoj]8093 Sevenk Love Oimaster【广义SAM】

    AC自动机比较简单,把询问串做成AC自动机然后模板串边跑变更新即可 SAM是把模板串做成广义SAM,然后每个节点存有几个模板串经过,具体方法是每次更新暴力向上跳直到有时间戳我不会证为什么时间复杂度是对 ...

  9. 【BZOJ2780】[Spoj]8093 Sevenk Love Oimaster 广义后缀自动机

    [BZOJ2780][Spoj]8093 Sevenk Love Oimaster Description Oimaster and sevenk love each other.     But r ...

随机推荐

  1. Android 打开系统相册和系统视

    1.打开系统相册 Intent intent = new Intent(Intent.ACTION_VIEW); intent.setType("vnd.android.cursor.dir ...

  2. Sql Server 2012启动存储过程

    可以通过如下步骤创建 1.打开show advanced options reconfigure 2.打开scan for startup procs,使得sql server在启动时扫描需要运行的p ...

  3. MySQL server has gone away报错

    1.最近做插入数据库,然后一直报一个错.mysql server has gone away.(如下图) 查了好多资料,终于解决了.. 1.可能是连接超时..进入php.ini,修改wait_time ...

  4. IE6、7 a链接内图片加滤镜后导致a标签链接失效问题解决

    今天在项目中遇到一个ie6.7浏览器下a链接失效的问题,查询大量资料,最终找到完美的解决方案,如下: 解决方法: 为a标签加样式{*background:url(#);*zoom:1;} 为img外部 ...

  5. psycopg2关于undefined symbol: lo_truncate64解决方法

    今天,在centos6.5下安装psycopg2,利用Python连接PostgreSQL数据库的时候,出现了一个undefined symbol: lo_truncate6的错误: django.c ...

  6. 恶补ASP.NET基础【1】枚举和结构

    有时我们希望变量提取的是一个固定集合中的值,此时就可以用枚举类型, 例: enum OpenMode : byte { 新增=, 编辑=, 查看= } class Program { static v ...

  7. 以Qemu模拟Linux,学习Linux内核

    文章名称:以Qemu模拟Linux,学习Linux内核作      者:five_cent文章地址:http://www.cnblogs.com/senix/archive/2013/02/21/29 ...

  8. QT 小票打印

    原地址: http://www.cppblog.com/biao/archive/2009/09/08/95603.html QString htmlString = QString("&l ...

  9. Mysql explain 查看分区表

    mysql> explain select * from ClientActionTrack where startTime>'2016-08-25 00:00:00' and start ...

  10. mysqlbinlog 读取多个文件

    [root@zjzc01 binlog]# mysqlbinlog --start-datetime='2016-02-25 00:00:00' --stop-datetime='2016-03-15 ...