Codeforces 235C. Cyclical Quest 后缀自动机

将S建后缀自动机,对于每个串复制两倍的长度(2L)在自动机上跑,

统计长度为L时,对应节点的出现次数

C. Cyclical Quest

time limit per test

3 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Some days ago, WJMZBMR learned how to answer the query "how many times does a string x occur in a string s" quickly by preprocessing the string s. But now he wants to make it harder.

So he wants to ask "how many consecutive substrings of s are cyclical isomorphic to a given string x". You are given string s and n stringsxi, for each string xi find, how many consecutive substrings of s are cyclical isomorphic to xi.

Two strings are called cyclical isomorphic if one can rotate one string to get the other one. 'Rotate' here means 'to take some consecutive chars (maybe none) from the beginning of a string and put them back at the end of the string in the same order'. For example, string "abcde" can be rotated to string "deabc". We can take characters "abc" from the beginning and put them at the end of "de".

Input

The first line contains a non-empty string s. The length of string s is not greater than 106 characters.

The second line contains an integer n (1 ≤ n ≤ 105) — the number of queries. Then n lines follow: the i-th line contains the string xi — the string for the i-th query. The total length of xi is less than or equal to 106 characters.

In this problem, strings only consist of lowercase English letters.

Output

For each query xi print a single integer that shows how many consecutive substrings of s are cyclical isomorphic to xi. Print the answers to the queries in the order they are given in the input.

Sample test(s)

input

baabaabaaa
5
a
ba
baa
aabaa
aaba

output

input

aabbaa
3
aa
aabb
abba

output

2
3
3

/* ***********************************************
Author        :CKboss
Created Time  :2015年06月16日 星期二 19时37分19秒
File Name     :CF235C.cpp
************************************************ */#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <set>
#include <map>using namespace std;/************SAM****************/const int CHAR=27,maxn=2000200;struct SAM_Node
{SAM_Node *fa,*next[CHAR];int len,id,pos;SAM_Node(){}SAM_Node(int _len){fa=0; len=_len;memset(next,0,sizeof(next));}
};SAM_Node SAM_node[maxn],*SAM_root,*SAM_last;
int SAM_size;SAM_Node *newSAM_Node(int len)
{SAM_node[SAM_size]=SAM_Node(len);SAM_node[SAM_size].id=SAM_size;return &SAM_node[SAM_size++];
}SAM_Node *newSAM_Node(SAM_Node *p)
{SAM_node[SAM_size]=*p;SAM_node[SAM_size].id=SAM_size;return &SAM_node[SAM_size++];
}void SAM_init()
{SAM_size=0;SAM_root=SAM_last=newSAM_Node(0);SAM_node[0].pos=0;
}void SAM_add(int x,int len)
{SAM_Node *p=SAM_last,*np=newSAM_Node(p->len+1);np->pos=len; SAM_last=np;for(;p&&!p->next[x];p=p->fa) p->next[x]=np;if(!p) { np->fa=SAM_root; return ; }SAM_Node *q=p->next[x];if(q->len==p->len+1) { np->fa=q; return ; }SAM_Node *nq=newSAM_Node(q);nq->len=p->len+1;q->fa=nq; np->fa=nq;for(;p&&p->next[x]==q;p=p->fa) p->next[x]=nq;
}/// !!!!!!!!!!!!! 统计每个节点出现的次数int c[maxn],num[maxn];
SAM_Node* top[maxn];void Count(char str[],int len)
{for(int i=0;i<SAM_size;i++) c[SAM_node[i].len]++;for(int i=1;i<=len;i++) c[i]+=c[i-1];for(int i=0;i<SAM_size;i++) top[--c[SAM_node[i].len]]=&SAM_node[i];SAM_Node *p=SAM_root;for(;p->len!=len;p=p->next[str[p->len]-'a']) num[p->id]=1; num[p->id]=1;for(int i=SAM_size-1;i>=0;i--){p=top[i];if(p->fa){SAM_Node *q=p->fa; num[q->id]+=num[p->id];}}
}/************SAM****************/char stmain[maxn],str[maxn];
int tn;
int vis[maxn];int READ_STR(char *str)
{int i=0;char ch;while(true){ch=getchar();if(ch=='\n') break;str[i++]=ch;}str[i]=0;return i;
}int main()
{//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);int len=READ_STR(stmain);SAM_init();for(int i=0;i<len;i++) SAM_add(stmain[i]-'a',i+1);Count(stmain,len);scanf("%d",&tn);getchar();int cas=0;while(tn--){int ans=0;cas++;int n=READ_STR(str);SAM_Node* cur=SAM_root;int nowlen=0;for(int i=0;i<2*n-1;i++){if(nowlen==n){nowlen--;if(nowlen<=cur->fa->len)cur=cur->fa;}int id=i;if(id>=n) id-=n;int to = str[id]-'a';while(cur!=0&&cur->next[to]==0){cur=cur->fa;if(cur!=0) nowlen=cur->len;}if(cur!=0&&cur->next[to]!=0){cur=cur->next[to];nowlen++;}else{cur=SAM_root;nowlen=0;}if(nowlen==n){if(vis[cur->id]!=cas){vis[cur->id]=cas;ans+=num[cur->id];}}}printf("%d\n",ans);}return 0;
}

Codeforces 235C. Cyclical Quest 后缀自动机相关推荐

Codeforces 235C Cyclical Quest (后缀自动机)
题目链接: https://codeforces.com/contest/235/problem/C 题解: 对大串建后缀自动机对询问串复制拆环.这里一定要注意是复制一个循环节不是复制整个串!循环节 ...
CodeForces 235C Cyclical Quest （后缀自动机）
题意:给一个主串,再给出多个模式串,分别求主串中有多少个连续子串,与模式串循环同构. 题解:后缀自动机因为要求循环同构,所以将模式串复制放到后面.(要么加终止符,要么传入长度) 先对主串建sam,然 ...
Codeforces #235 C.Cyclical Quest(后缀自动机)
传送门题意:给定一个模式串和nnn个匹配串,询问原串有多少个子串和匹配串循环同构考虑要求循环同构,于是先对SSS建出后缀自动机把每次询问的XXX倍长在自动机上跑如果当前匹配的长度已经超过原串长 ...
Codeforces.700E.Cool Slogans(后缀自动机线段树合并 DP)
题目链接 $Description$ 给定一个字符串$s[1]$.一个字符串序列$s[\ ]$满足$s[i]$至少在$s[i-1]$中出现过两次($i\geq 2$).求最大的 ...
后缀自动机（探索）Codeforces 427D
想学后缀自动机的弱鸡表示真自闭啊开局一道题,内容全靠水 :Codeforces 427D 有题目才能更好地学算法题意很简单 :给两个字符串,求最短公共子串的长度后缀自动机模板很多 ,给 ...
CodeForces - 427D Match Catch(后缀数组/广义后缀自动机)
题目链接:点击查看题目大意:给出两个字符串,求出两个字符串中的最短公共子串,且在每个字符串中只出现过一次题目分析:因为这个公共子串只能在字符串中出现一次,考虑到用后缀数组,我们先将两个字符串通过特 ...
Codeforces Round #364 (Div. 1) (差一个后缀自动机)
B. Connecting Universities 大意: 给定树, 给定2*k个点, 求将2*k个点两两匹配, 每个匹配的贡献为两点的距离, 求贡献最大值单独考虑每条边$(u,v)$的贡献即可, ...
Codeforces 235C
Codeforces 235C 题目:给定一主串$S$,$n$次询问,每次询问串$t$的所有循环移位串的出现的次数和做法:建$SAM$,对于询问串$t$,将他复制一份放在后边,在 ...
CF 316G3 Good Substrings——广义后缀自动机
题目:http://codeforces.com/contest/316/problem/G3 对询问串和模式串一起建一个后缀自动机,做出在每个串上的 right 集合大小之后枚举自动机上的每个点看看 ...
【POJ1509】Glass Beads 【后缀自动机】
题意给出一个字符串,求它的最小表示法. 分析这个题当然可以用最小表示法做啦!但是我是为了学后缀自动机鸭! 我们把这个字符串长度乘二,然后建SAM,然后在SAM上每次跑最小的那个字母,找出长度为n的 ...

Codeforces 235C. Cyclical Quest 后缀自动机

Codeforces 235C. Cyclical Quest 后缀自动机相关推荐

最新文章

热门文章