全部串起来做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. Model注解的后台原理

    Asp.net MVC的验证特性是由模型绑定器.模型元数据.模型验证器和模型状态组成的协调系统的一部分. 1.验证和模型绑定 默认情况下,Asp.net MVC框架在模型绑定石执行验证逻辑,在操作方法 ...

  2. 使用API查询天气

    服务端代码 [HttpPost] public ActionResult GetWeather() { HttpWebRequest request = (HttpWebRequest)HttpWeb ...

  3. iOS之极光推送

    注册JPush账号 JPush官网 下载SDK 下载地址:https://www.jpush.cn 根据文档进行集成 文档:http://docs.jpush.io/guideline/ios_gui ...

  4. Nginx反向代理匹配部分二级域名或二级目录配置

    server { charset utf-; client_max_body_size 128M; # Add index.php to the list if you are using PHP i ...

  5. java菜鸟篇<四> ZTree入门篇

    今天准备入手ZTree,于是在百度上搜了搜,找到了开源网址和一些大神们的教程,于是乎下午开始了组织树(ZTree)的练习 初步完整的作品是这个样子的: 1.咱们要去这个工具的开源网里找下载的东西: ( ...

  6. C#与SQLite数据库

    1.添加引用 System.Data.SQLite.dll 2.using System.Data.SQLite; 3.原理步骤: string path = "c:\\mydb.db&qu ...

  7. DECLARE CONTINUE HANDLER FOR NOT FOUND

    1.解释: 在mysql的存储过程中经常会看到这句话:DECLARE CONTINUE HANDLER FOR NOT FOUND. 它的含义是:若没有数据返回,程序继续,并将变量IS_FOUND设为 ...

  8. Putty使用公钥认证时,报错:Disconnected: No supported authentication methods available(server sent:public key) 问题的解决

    Putty使用公钥认证时,按照常规方法设置,一直报错:Disconnected: No supported authentication methods available (server sent: ...

  9. python用法——Mixin

    在读werkzeug和flask的源码中,经常能遇到类名中有mixin这个东西.这个东西的用法让我想到了java中的接口名有able的用法.今天我就来看了看这个mixin是什么东西. 学习了pytho ...

  10. Linux下Nginx+PHP 简单安装配置

    测试环境 Linux 2.6.18nginx-1.0.4 http://www.nginx.org/php-5.3.6 http://www.php.net/ 一,安装Nginxwget http:/ ...