{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e设$$$\\text{LCP}(s, t)$$$为字符串$$$s$$$和$$$t$$$的最长公共前缀的长度。同时,设$$$s[x \\dots y]$$$为字符串$$$s$$$从索引$$$x$$$到索引$$$y$$$(包括两端)的子串。例如,如果$$$s \u003d $$$为\"\u003cspan class\u003d\"tex-font-style-tt\"\u003eabcde\u003c/span\u003e\",那么$$$s[1 \\dots 3] \u003d$$$为\"\u003cspan class\u003d\"tex-font-style-tt\"\u003eabc\u003c/span\u003e\",$$$s[2 \\dots 5] \u003d$$$为\"\u003cspan class\u003d\"tex-font-style-tt\"\u003ebcde\u003c/span\u003e\"。\u003c/p\u003e\u003cp\u003e给定长度为$$$n$$$的字符串$$$s$$$和$$$q$$$个查询。每个查询包含一对整数集合$$$a_1, a_2, \\dots, a_k$$$和$$$b_1, b_2, \\dots, b_l$$$。计算每个查询的$$$\\sum\\limits_{i \u003d 1}^{i \u003d k} \\sum\\limits_{j \u003d 1}^{j \u003d l}{\\text{LCP}(s[a_i \\dots n], s[b_j \\dots n])}$$$。\u003c/p\u003e"}},{"title":"输入","value":{"format":"HTML","content":"\u003cp\u003e第一行包含两个整数$$$n$$$和$$$q$$$($$$1 \\le n, q \\le 2 \\cdot 10^5$$$)— 字符串$$$s$$$的长度和查询的数量。\u003c/p\u003e\u003cp\u003e第二行包含一个由小写拉丁字母组成的字符串$$$s$$$($$$|s| \u003d n$$$)。\u003c/p\u003e\u003cp\u003e接下来$$$3q$$$行包含查询的描述 — 每个查询三行。每个查询的第一行包含两个整数$$$k_i$$$和$$$l_i$$$($$$1 \\le k_i, l_i \\le n$$$)— 集合$$$a$$$和$$$b$$$的大小。\u003c/p\u003e\u003cp\u003e每个查询的第二行包含$$$k_i$$$个整数$$$a_1, a_2, \\dots a_{k_i}$$$($$$1 \\le a_1 \u0026lt; a_2 \u0026lt; \\dots \u0026lt; a_{k_i} \\le n$$$)— 集合$$$a$$$。\u003c/p\u003e\u003cp\u003e每个查询的第三行包含$$$l_i$$$个整数$$$b_1, b_2, \\dots b_{l_i}$$$($$$1 \\le b_1 \u0026lt; b_2 \u0026lt; \\dots \u0026lt; b_{l_i} \\le n$$$)— 集合$$$b$$$。\u003c/p\u003e\u003cp\u003e保证$$$\\sum\\limits_{i \u003d 1}^{i \u003d q}{k_i} \\le 2 \\cdot 10^5$$$和$$$\\sum\\limits_{i \u003d 1}^{i \u003d q}{l_i} \\le 2 \\cdot 10^5$$$。\u003c/p\u003e"}},{"title":"输出","value":{"format":"HTML","content":"\u003cp\u003e输出$$$q$$$个整数 — 按照输入中给出查询的顺序回答每个查询。\u003c/p\u003e"}},{"title":"示例","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e7 4\nabacaba\n2 2\n1 2\n1 2\n3 1\n1 2 3\n7\n1 7\n1\n1 2 3 4 5 6 7\n2 2\n1 5\n1 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e13\n2\n12\n16\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"注意","value":{"format":"HTML","content":"\u003cp\u003e查询描述:\u003c/p\u003e\u003col\u003e \u003cli\u003e 在第一个查询中考虑$$$s[1 \\dots 7] \u003d \\text{abacaba}$$$和$$$s[2 \\dots 7] \u003d \\text{bacaba}$$$。查询的答案为$$$\\text{LCP}(\\text{abacaba}, \\text{abacaba}) + \\text{LCP}(\\text{abacaba}, \\text{bacaba}) + \\text{LCP}(\\text{bacaba}, \\text{abacaba}) + \\text{LCP}(\\text{bacaba}, \\text{bacaba}) \u003d 7 + 0 + 0 + 6 \u003d 13$$$。\u003c/li\u003e\u003cli\u003e 在第二个查询中考虑$$$s[1 \\dots 7] \u003d \\text{abacaba}$$$、$$$s[2 \\dots 7] \u003d \\text{bacaba}$$$、$$$s[3 \\dots 7] \u003d \\text{acaba}$$$和$$$s[7 \\dots 7] \u003d \\text{a}$$$。查询的答案为$$$\\text{LCP}(\\text{abacaba}, \\text{a}) + \\text{LCP}(\\text{bacaba}, \\text{a}) + \\text{LCP}(\\text{acaba}, \\text{a}) \u003d 1 + 0 + 1 \u003d 2$$$。\u003c/li\u003e\u003cli\u003e 在第三个查询中将$$$s[1 \\dots 7] \u003d \\text{abacaba}$$$与所有后缀进行比较。答案是非零值的总和:$$$\\text{LCP}(\\text{abacaba}, \\text{abacaba}) + \\text{LCP}(\\text{abacaba}, \\text{acaba}) + \\text{LCP}(\\text{abacaba}, \\text{aba}) + \\text{LCP}(\\text{abacaba}, \\text{a}) \u003d 7 + 1 + 3 + 1 \u003d 12$$$。\u003c/li\u003e\u003cli\u003e 在第四个查询中考虑$$$s[1 \\dots 7] \u003d \\text{abacaba}$$$和$$$s[5 \\dots 7] \u003d \\text{aba}$$$。查询的答案为$$$\\text{LCP}(\\text{abacaba}, \\text{abacaba}) + \\text{LCP}(\\text{abacaba}, \\text{aba}) + \\text{LCP}(\\text{aba}, \\text{abacaba}) + \\text{LCP}(\\text{aba}, \\text{aba}) \u003d 7 + 3 + 3 + 3 \u003d 16$$$。\u003c/li\u003e\u003c/ol\u003e"}}]}