Description
给定一个串 和若干个串 ，给定很多个询问 ，表示询问 在 到 中的哪个串中出现次数最多，输出串的编号和次数。（如果有次数相同的输出编号小的）
Solution
对于
建出广义SAM。
把询问离线掉，排序，求出每个询问的串对应SAM中的哪个节点（注意特判不存在的情况）
每个节点建一棵线段树表示该子串在各个
中出现了多少次，这个用线段树合并即可。
然后就结束了。
思维难度感觉不大吧，码量稍微会大一点，开始看到网上的代码觉得都太长了，结果自己一码出来发现已经200+了都是头文件和宏定义的锅，而且还调了差不多一天，感觉自己码力还是太菜了qwq
Code
/************************************************
* Au: Hany01
* Date: May 12th, 2018
* Prob: [CF666E] Forensic Examination
* Email: [email protected]
************************************************/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia
template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }
inline int read()
{
register int _, __; register char c_;
for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
return _ * __;
}
const int maxl = 5e4 + 5, maxno = 1e7, maxq = 5e5 + 5;
int rt[maxl << 1], n, m, lens, lenp;
vector<int> vct[maxl << 1];
PII Ans[maxq];
char s[maxq], p[maxl];
struct Question
{
int l, r, pl, pr, id;
Question(int l = 0, int r = 0, int pl = 0, int pr = 0, int id = 0):
l(l), r(r), pl(pl), pr(pr), id(id) {}
bool operator < (const Question& A) const { return pr < A.pr; }
}Q[maxq];
struct SegmentTree
{
int tot, ch[maxno][2], mx[maxno], pos[maxno];
#define mid ((l + r) >> 1)
inline void maintain(int t)
{
pos[t] = mx[ch[t][0]] >= mx[ch[t][1]] ? pos[ch[t][0]] : pos[ch[t][1]];
mx[t] = max(mx[ch[t][0]], mx[ch[t][1]]);
}
inline void update(int& t, int l, int r, int x)
{
if (!t) t = ++ tot;
if (l == r) {
pos[t] = l, ++ mx[t];
return ;
}
if (x <= mid) update(ch[t][0], l, mid, x);
else update(ch[t][1], mid + 1, r, x);
maintain(t);
}
inline int merge(int t1, int t2, int l, int r)
{
if (!t1 || !t2) return t1 ^ t2;
if (l == r) {
mx[t1] += mx[t2];
return t1;
}
ch[t1][0] = merge(ch[t1][0], ch[t2][0], l, mid), ch[t1][1] = merge(ch[t1][1], ch[t2][1], mid + 1, r);
maintain(t1);
return t1;
}
inline PII query(int t, int l, int r, int x, int y)
{
if (!t || r < x || y < l) return mp(0, -x);
if (x <= l && r <= y) return mp(mx[t], -pos[t]);
return max(query(ch[t][0], l, mid, x, y), query(ch[t][1], mid + 1, r, x, y));
}
}ST;
struct SAM
{
int ch[maxl << 1][26], len[maxl << 1], fa[maxl << 1][22], las, tot = 1, beg[maxl << 1], nex[maxl << 1], v[maxl << 1], e;
inline void extend(int c, int i)
{
int np = ++ tot, p = las;
las = np, len[np] = len[p] + 1;
while (p && !ch[p][c]) ch[p][c] = np, p = fa[p][0];
if (!p) fa[np][0] = 1;
else {
int q = ch[p][c];
if (len[q] == len[p] + 1) fa[np][0] = q;
else {
int nq = ++ tot;
Cpy(ch[nq], ch[q]), fa[nq][0] = fa[q][0], len[nq] = len[p] + 1, fa[np][0] = fa[q][0] = nq;
while (p && ch[p][c] == q) ch[p][c] = nq, p = fa[p][0];
}
}
ST.update(rt[np], 1, n, i);
}
inline void init() {
For(j, 1, 21) For(i, 1, tot)
fa[i][j] = fa[fa[i][j - 1]][j - 1];
}
inline void add(int uu, int vv) { v[++ e] = vv, nex[e] = beg[uu], beg[uu] = e; }
void dfs(int u)
{
for (register int i = beg[u]; i; i = nex[i])
dfs(v[i]), rt[u] = ST.merge(rt[u], rt[v[i]], 1, n);
rep(j, SZ(vct[u]))
Ans[Q[vct[u][j]].id] = ST.query(rt[u], 1, n, Q[vct[u][j]].l, Q[vct[u][j]].r);
}
inline void calc()
{
For(i, 2, tot) add(fa[i][0], i);
dfs(1);
}
}sam;
int main()
{
#ifdef hany01
File("cf666e");
#endif
//Init
scanf("%s", s + 1), lens = strlen(s + 1), n = read();
For(i, 1, n) {
scanf("%s", p + 1), sam.las = 1;
For(j, 1, strlen(p + 1)) sam.extend(p[j] - 97, i);
}
sam.init();
//Sort questions
m = read();
For(i, 1, m) {
register int l = read(), r = read(), pl = read(), pr = read();
Q[i] = Question(l, r, pl, pr, i);
}
sort(Q + 1, Q + 1 + m);
//Put questions on the nodes
int cur = 1, u = 1, now = 0;
For(i, 1, lens) {
while (u && !sam.ch[u][s[i] - 97]) u = sam.fa[u][0], now = sam.len[u];
if (!u) u = 1, now = 0;
else u = sam.ch[u][s[i] - 97], ++ now;
int tmpu = u;
while (cur <= m && Q[cur].pr == i)
{
int L = Q[cur].pr - Q[cur].pl + 1;
if (now < L) {
Ans[Q[cur].id] = mp(0, -Q[cur].l), ++ cur; continue;
}
for (int t = 21; t >= 0; -- t)
if (L <= sam.len[sam.fa[u][t]] && sam.fa[u][t])
u = sam.fa[u][t];
vct[u].pb(cur);
++ cur, u = tmpu;
}
}
//Get the answer
sam.calc();
For(i, 1, m) printf("%d %d\n", -Ans[i].y, Ans[i].x);
return 0;
}