結果
| 問題 |
No.2020 Sum of Common Prefix Length
|
| ユーザー |
 kemuniku
|
| 提出日時 | 2025-05-01 12:13:20 |
| 言語 | Nim (2.2.0) |
| 結果 |
AC
|
| 実行時間 | 478 ms / 2,000 ms |
| コード長 | 30,811 bytes |
| コンパイル時間 | 6,275 ms |
| コンパイル使用メモリ | 85,764 KB |
| 実行使用メモリ | 73,484 KB |
| 最終ジャッジ日時 | 2025-05-01 12:13:39 |
| 合計ジャッジ時間 | 18,376 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 38 |
ソースコード
import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
ImportExpand "cplib/tmpl/sheep.nim" <=== "when not declared CPLIB_TMPL_SHEEP:\n const CPLIB_TMPL_SHEEP* = 1\n {.warning[UnusedImport]: off.}\n {.hint[XDeclaredButNotUsed]: off.}\n import algorithm\n import sequtils\n import tables\n import macros\n import math\n import sets\n import strutils\n import strformat\n import sugar\n import heapqueue\n import streams\n import deques\n import bitops\n import std/lenientops\n import options\n #入力系\n proc scanf(formatstr: cstring){.header: \"<stdio.h>\", varargs.}\n proc getchar(): char {.importc: \"getchar_unlocked\", header: \"<stdio.h>\", discardable.}\n proc ii(): int {.inline.} = scanf(\"%lld\\n\", addr result)\n proc lii(N: int): seq[int] {.inline.} = newSeqWith(N, ii())\n proc si(): string {.inline.} =\n result = \"\"\n var c: char\n while true:\n c = getchar()\n if c == ' ' or c == '\\n' or c == '\\255':\n break\n result &= c\n #chmin,chmax\n template `max=`(x, y) = x = max(x, y)\n template `min=`(x, y) = x = min(x, y)\n proc chmin[T](x: var T, y: T):bool=\n if x > y:\n x = y\n return true\n return false\n proc chmax[T](x: var T, y: T):bool=\n if x < y:\n x = y\n return true\n return false\n #bit演算\n proc `%`*(x: int, y: int): int =\n result = x mod y\n if y > 0 and result < 0: result += y\n if y < 0 and result > 0: result += y\n proc `//`*(x: int, y: int): int{.inline.} =\n result = x div y\n if y > 0 and result * y > x: result -= 1\n if y < 0 and result * y < x: result -= 1\n proc `%=`(x: var int, y: int): void = x = x%y\n proc `//=`(x: var int, y: int): void = x = x//y\n proc `**`(x: int, y: int): int = x^y\n proc `**=`(x: var int, y: int): void = x = x^y\n proc `^`(x: int, y: int): int = x xor y\n proc `|`(x: int, y: int): int = x or y\n proc `&`(x: int, y: int): int = x and y\n proc `>>`(x: int, y: int): int = x shr y\n proc `<<`(x: int, y: int): int = x shl y\n proc `~`(x: int): int = not x\n proc `^=`(x: var int, y: int): void = x = x ^ y\n proc `&=`(x: var int, y: int): void = x = x & y\n proc `|=`(x: var int, y: int): void = x = x | y\n proc `>>=`(x: var int, y: int): void = x = x >> y\n proc `<<=`(x: var int, y: int): void = x = x << y\n proc `[]`(x: int, n: int): bool = (x and (1 shl n)) != 0\n #便利な変換\n proc `!`(x: char, a = '0'): int = int(x)-int(a)\n #定数\n #[ include cplib/utils/constants ]#\n when not declared CPLIB_UTILS_CONSTANTS:\n const CPLIB_UTILS_CONSTANTS* = 1\n const INF32*: int32 = 1001000027.int32\n const INF64*: int = int(3300300300300300491)\n const INF = INF64\n #converter\n\n #range\n iterator range(start: int, ends: int, step: int): int =\n var i = start\n if step < 0:\n while i > ends:\n yield i\n i += step\n elif step > 0:\n while i < ends:\n yield i\n i += step\n iterator range(ends: int): int = (for i in 0..<ends: yield i)\n iterator range(start: int, ends: int): int = (for i in\n start..<ends: yield i)\n\n #joinが非stringでめちゃくちゃ遅いやつのパッチ\n proc join*[T: not string](a: openArray[T], sep: string = \"\"): string = a.mapit($it).join(sep)\n\n proc dump[T](arr:seq[seq[T]])=\n for i in 0..<len(arr):\n echo arr[i]\n\n proc sum(slice:HSlice[int,int]):int=\n return (slice.a+slice.b)*len(slice)//2\n \n proc `<`[T](l,r:seq[T]):bool=\n for i in 0..<min(len(l),len(r)):\n if l[i] > r[i]:\n return false\n elif l[i] < r[i]:\n return true\n return len(l) < len(r)\n"
ImportExpand "cplib/graph/graph.nim" <=== "when not declared CPLIB_GRAPH_GRAPH:\n const CPLIB_GRAPH_GRAPH* = 1\n\n import sequtils\n import math\n type DynamicGraph*[T] = ref object of RootObj\n edges*: seq[seq[(int32, T)]]\n len*: int\n type StaticGraph*[T] = ref object of RootObj\n src*, dst*: seq[int32]\n cost*: seq[T]\n elist*: seq[(int32, T)]\n start*: seq[int32]\n len*: int\n\n type WeightedDirectedGraph*[T] = ref object of DynamicGraph[T]\n type WeightedUnDirectedGraph*[T] = ref object of DynamicGraph[T]\n type UnWeightedDirectedGraph* = ref object of DynamicGraph[int]\n type UnWeightedUnDirectedGraph* = ref object of DynamicGraph[int]\n type WeightedDirectedStaticGraph*[T] = ref object of StaticGraph[T]\n type WeightedUnDirectedStaticGraph*[T] = ref object of StaticGraph[T]\n type UnWeightedDirectedStaticGraph* = ref object of StaticGraph[int]\n type UnWeightedUnDirectedStaticGraph* = ref object of StaticGraph[int]\n\n type GraphTypes*[T] = DynamicGraph[T] or StaticGraph[T]\n type DirectedGraph* = WeightedDirectedGraph or UnWeightedDirectedGraph or WeightedDirectedStaticGraph or UnWeightedDirectedStaticGraph\n type UnDirectedGraph* = WeightedUnDirectedGraph or UnWeightedUnDirectedGraph or WeightedUnDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\n type WeightedGraph*[T] = WeightedDirectedGraph[T] or WeightedUnDirectedGraph[T] or WeightedDirectedStaticGraph[T] or WeightedUnDirectedStaticGraph[T]\n type UnWeightedGraph* = UnWeightedDirectedGraph or UnWeightedUnDirectedGraph or UnWeightedDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\n type DynamicGraphTypes* = WeightedDirectedGraph or UnWeightedDirectedGraph or WeightedUnDirectedGraph or UnWeightedUnDirectedGraph\n type StaticGraphTypes* = WeightedDirectedStaticGraph or UnWeightedDirectedStaticGraph or WeightedUnDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\n\n proc add_edge_dynamic_impl*[T](g: DynamicGraph[T], u, v: int, cost: T, directed: bool) =\n g.edges[u].add((v.int32, cost))\n if not directed: g.edges[v].add((u.int32, cost))\n\n proc initWeightedDirectedGraph*(N: int, edgetype: typedesc = int): WeightedDirectedGraph[edgetype] =\n result = WeightedDirectedGraph[edgetype](edges: newSeq[seq[(int32, edgetype)]](N), len: N)\n proc add_edge*[T](g: var WeightedDirectedGraph[T], u, v: int, cost: T) =\n g.add_edge_dynamic_impl(u, v, cost, true)\n\n proc initWeightedUnDirectedGraph*(N: int, edgetype: typedesc = int): WeightedUnDirectedGraph[edgetype] =\n result = WeightedUnDirectedGraph[edgetype](edges: newSeq[seq[(int32, edgetype)]](N), len: N)\n proc add_edge*[T](g: var WeightedUnDirectedGraph[T], u, v: int, cost: T) =\n g.add_edge_dynamic_impl(u, v, cost, false)\n\n proc initUnWeightedDirectedGraph*(N: int): UnWeightedDirectedGraph =\n result = UnWeightedDirectedGraph(edges: newSeq[seq[(int32, int)]](N), len: N)\n proc add_edge*(g: var UnWeightedDirectedGraph, u, v: int) =\n g.add_edge_dynamic_impl(u, v, 1, true)\n\n proc initUnWeightedUnDirectedGraph*(N: int): UnWeightedUnDirectedGraph =\n result = UnWeightedUnDirectedGraph(edges: newSeq[seq[(int32, int)]](N), len: N)\n proc add_edge*(g: var UnWeightedUnDirectedGraph, u, v: int) =\n g.add_edge_dynamic_impl(u, v, 1, false)\n\n proc len*[T](G: WeightedGraph[T]): int = G.len\n proc len*(G: UnWeightedGraph): int = G.len\n\n iterator `[]`*[T](g: WeightedDirectedGraph[T] or WeightedUnDirectedGraph[T], x: int): (int, T) =\n for e in g.edges[x]: yield (e[0].int, e[1])\n iterator `[]`*(g: UnWeightedDirectedGraph or UnWeightedUnDirectedGraph, x: int): int =\n for e in g.edges[x]: yield e[0].int\n\n proc add_edge_static_impl*[T](g: StaticGraph[T], u, v: int, cost: T, directed: bool) =\n g.src.add(u.int32)\n g.dst.add(v.int32)\n g.cost.add(cost)\n if not directed:\n g.src.add(v.int32)\n g.dst.add(u.int32)\n g.cost.add(cost)\n\n proc build_impl*[T](g: StaticGraph[T]) =\n g.start = newSeqWith(g.len + 1, 0.int32)\n for i in 0..<g.src.len:\n g.start[g.src[i]] += 1\n g.start.cumsum\n g.elist = newSeq[(int32, T)](g.start[^1])\n for i in countdown(g.src.len - 1, 0):\n var u = g.src[i]\n var v = g.dst[i]\n g.start[u] -= 1\n g.elist[g.start[u]] = (v, g.cost[i])\n proc build*(g: StaticGraphTypes) = g.build_impl()\n\n proc initWeightedDirectedStaticGraph*(N: int, edgetype: typedesc = int, capacity: int = 0): WeightedDirectedStaticGraph[edgetype] =\n result = WeightedDirectedStaticGraph[edgetype](\n src: newSeqOfCap[int32](capacity),\n dst: newSeqOfCap[int32](capacity),\n cost: newSeqOfCap[edgetype](capacity),\n elist: newSeq[(int32, edgetype)](0),\n start: newSeq[int32](0),\n len: N\n )\n proc add_edge*[T](g: var WeightedDirectedStaticGraph[T], u, v: int, cost: T) =\n g.add_edge_static_impl(u, v, cost, true)\n\n proc initWeightedUnDirectedStaticGraph*(N: int, edgetype: typedesc = int, capacity: int = 0): WeightedUnDirectedStaticGraph[edgetype] =\n result = WeightedUnDirectedStaticGraph[edgetype](\n src: newSeqOfCap[int32](capacity*2),\n dst: newSeqOfCap[int32](capacity*2),\n cost: newSeqOfCap[edgetype](capacity*2),\n elist: newSeq[(int32, edgetype)](0),\n start: newSeq[int32](0),\n len: N\n )\n proc add_edge*[T](g: var WeightedUnDirectedStaticGraph[T], u, v: int, cost: T) =\n g.add_edge_static_impl(u, v, cost, false)\n\n proc initUnWeightedDirectedStaticGraph*(N: int, capacity: int = 0): UnWeightedDirectedStaticGraph =\n result = UnWeightedDirectedStaticGraph(\n src: newSeqOfCap[int32](capacity),\n dst: newSeqOfCap[int32](capacity),\n cost: newSeqOfCap[int](capacity),\n elist: newSeq[(int32, int)](0),\n start: newSeq[int32](0),\n len: N\n )\n proc add_edge*(g: var UnWeightedDirectedStaticGraph, u, v: int) =\n g.add_edge_static_impl(u, v, 1, true)\n\n proc initUnWeightedUnDirectedStaticGraph*(N: int, capacity: int = 0): UnWeightedUnDirectedStaticGraph =\n result = UnWeightedUnDirectedStaticGraph(\n src: newSeqOfCap[int32](capacity*2),\n dst: newSeqOfCap[int32](capacity*2),\n cost: newSeqOfCap[int](capacity*2),\n elist: newSeq[(int32, int)](0),\n start: newSeq[int32](0),\n len: N\n )\n proc add_edge*(g: var UnWeightedUnDirectedStaticGraph, u, v: int) =\n g.add_edge_static_impl(u, v, 1, false)\n\n proc static_graph_initialized_check*[T](g: StaticGraph[T]) = assert g.start.len > 0, \"Static Graph must be initialized before use.\"\n\n iterator `[]`*[T](g: WeightedDirectedStaticGraph[T] or WeightedUnDirectedStaticGraph[T], x: int): (int, T) =\n g.static_graph_initialized_check()\n for i in g.start[x]..<g.start[x+1]: yield (g.elist[i][0].int, g.elist[i][1])\n iterator `[]`*(g: UnWeightedDirectedStaticGraph or UnWeightedUnDirectedStaticGraph, x: int): int =\n g.static_graph_initialized_check()\n for i in g.start[x]..<g.start[x+1]: yield g.elist[i][0].int\n\n iterator to_and_cost*[T](g: DynamicGraph[T], x: int): (int, T) =\n for e in g.edges[x]: yield (e[0].int, e[1])\n iterator to_and_cost*[T](g: StaticGraph[T], x: int): (int, T) =\n g.static_graph_initialized_check()\n for i in g.start[x]..<g.start[x+1]: yield (g.elist[i][0].int, g.elist[i][1])\n \n import tables\n\n type UnWeightedUnDirectedTableGraph*[T] = object \n toi* : Table[T,int]\n v* : seq[T]\n graph* : UnWeightedUnDirectedGraph\n\n type UnWeightedDirectedTableGraph*[T] = object \n toi* : Table[T,int]\n v* : seq[T]\n graph* : UnWeightedDirectedGraph\n\n type WeightedUnDirectedTableGraph*[T,S] = object \n toi* : Table[T,int]\n v* : seq[T]\n graph* : WeightedUnDirectedGraph[S]\n\n type WeightedDirectedTableGraph*[T,S] = object \n toi* : Table[T,int]\n v* : seq[T]\n graph* : WeightedDirectedGraph[S]\n\n type UnWeightedTableGraph*[T] = UnWeightedUnDirectedTableGraph[T] or UnWeightedDirectedTableGraph[T]\n type WeightedTableGraph*[T,S] = WeightedUnDirectedTableGraph[T,S] or WeightedDirectedTableGraph[T,S]\n\n proc initUnWeightedUnDirectedTableGraph*[T](V:seq[T]):UnWeightedUnDirectedTableGraph[T]=\n for i in 0..<len(V):\n result.toi[V[i]] = i\n result.graph = initUnWeightedUnDirectedGraph(len(V))\n result.v = V\n\n proc initUnWeightedDirectedTableGraph*[T](V:seq[T]):UnWeightedDirectedTableGraph[T]=\n for i in 0..<len(V):\n result.toi[V[i]] = i\n result.graph = initUnWeightedDirectedGraph(len(V))\n result.v = V\n\n proc initWeightedUnDirectedTableGraph*[T](V:seq[T],S:typedesc = int):WeightedUnDirectedTableGraph[T,S]=\n for i in 0..<len(V):\n result.toi[V[i]] = i\n result.graph = initWeightedUnDirectedGraph(len(V),S)\n result.v = V\n\n proc initWeightedDirectedTableGraph*[T](V:seq[T],S:typedesc = int):WeightedDirectedTableGraph[T,S]=\n for i in 0..<len(V):\n result.toi[V[i]] = i\n result.graph = initWeightedDirectedGraph(len(V),S)\n result.v = V\n\n proc add_edge*[T](g: var UnWeightedTableGraph[T],u,v:int)=\n g.graph.add_edge(g.toi[u],g.toi[v])\n\n proc add_edge*[T,S](g: var WeightedTableGraph[T,S],u,v:int,cost:S)=\n g.graph.add_edge(g.toi[u],g.toi[v],cost)\n\n iterator `[]`*[T,S](g: WeightedDirectedTableGraph[T,S] or WeightedUnDirectedTableGraph[T,S], x: T): (T, S) = \n for (x,y) in g.graph[g.toi[x]]:\n yield (g.v[x],y)\n iterator `[]`*[T](g: UnWeightedDirectedTableGraph[T] or UnWeightedUnDirectedTableGraph[T], x: T): T = \n for x in g.graph[g.toi[x]]:\n yield g.v[x]\n\n"
ImportExpand "cplib/tree/heavylightdecomposition.nim" <=== "when not declared CPLIB_TREE_HLD:\n const CPLIB_TREE_HLD* = 1\n import sequtils\n import algorithm\n import sets\n #[ import cplib/graph/graph ]#\n # https://atcoder.jp/contests/abc337/submissions/50216964\n # ↑上記の提出より引用\n type HeavyLightDecomposition* = ref object \n N*: int\n P*, PP*, PD*, D*, I*, rangeL*, rangeR*: seq[int]\n proc initHld*(g: UnDirectedGraph, root: int): HeavyLightDecomposition =\n var hld = HeavyLightDecomposition()\n var n: int = g.len\n hld.N = n\n hld.P = newSeqWith(n, -1)\n hld.I = newSeqWith(n, 0)\n hld.I[0] = root\n var iI = 1\n for i in 0..<n:\n var p = hld.I[i]\n for e in g[p]:\n if hld.P[p] != e:\n hld.I[iI] = e\n hld.P[e] = p\n iI += 1\n var Z = newSeqWith(n, 1)\n var nx = newSeqWith(n, -1)\n hld.PP = newSeqWith(n, 0)\n for i in 0..<n:\n hld.PP[i] = i\n for i in 1..<n:\n var p = hld.I[n-i]\n Z[hld.P[p]] += Z[p]\n if nx[hld.P[p]] == -1 or Z[nx[hld.P[p]]] < Z[p]:\n nx[hld.P[p]] = p\n for p in hld.I:\n if nx[p] != -1:\n hld.PP[nx[p]] = p\n hld.PD = newSeqWith(n, n)\n hld.PD[root] = 0\n hld.D = newSeqWith(n, 0)\n for p in hld.I:\n if p != root:\n hld.PP[p] = hld.PP[hld.PP[p]]\n hld.PD[p] = min(hld.PD[hld.PP[p]], hld.PD[hld.P[p]]+1)\n hld.D[p] = hld.D[hld.P[p]]+1\n hld.rangeL = newSeqWith(n, 0)\n hld.rangeR = newSeqWith(n, 0)\n for p in hld.I:\n hld.rangeR[p] = hld.rangeL[p] + Z[p]\n var ir = hld.rangeR[p]\n for e in g[p]:\n if hld.P[p] != e and e != nx[p]:\n ir -= Z[e]\n hld.rangeL[e] = ir\n if nx[p] != -1:\n hld.rangeL[nx[p]] = hld.rangeL[p] + 1\n for i in 0..<n:\n hld.I[hld.rangeL[i]] = i\n return hld\n proc initHld*(g: DirectedGraph, root: int): HeavyLightDecomposition =\n var n = g.len\n var gn = initUnWeightedUnDirectedStaticGraph(n)\n var seen = initHashSet[(int, int)]()\n for i in 0..<n:\n for (j, _) in g[i]:\n if (i, j) notin seen:\n gn.add_edge(i, j)\n seen.incl((i, j))\n seen.incl((j, i))\n gn.build\n return initHld(gn, root)\n proc initHld*(adj: seq[seq[int]], root: int): HeavyLightDecomposition =\n var n = adj.len\n var gn = initUnWeightedUnDirectedStaticGraph(n)\n var seen = initHashSet[(int, int)]()\n for i in 0..<n:\n for j in adj[i]:\n if (i, j) notin seen:\n gn.add_edge(i, j)\n seen.incl((i, j))\n seen.incl((j, i))\n gn.build\n return initHld(gn, root)\n proc numVertices*(hld: HeavyLightDecomposition): int = hld.N\n proc depth*(hld: HeavyLightDecomposition, p: int): int = hld.D[p]\n proc toSeq*(hld: HeavyLightDecomposition, vtx: int): int = hld.rangeL[vtx]\n proc toVtx*(hld: HeavyLightDecomposition, seqidx: int): int = hld.I[seqidx]\n proc toSeq2In*(hld: HeavyLightDecomposition, vtx: int): int = hld.rangeL[vtx] * 2 - hld.D[vtx]\n proc toSeq2Out*(hld: HeavyLightDecomposition, vtx: int): int = hld.rangeR[vtx] * 2 - hld.D[vtx] - 1\n proc parentOf*(hld: HeavyLightDecomposition, v: int): int = hld.P[v]\n proc heavyRootOf*(hld: HeavyLightDecomposition, v: int): int = hld.PP[v]\n proc heavyChildOf*(hld: HeavyLightDecomposition, v: int): int =\n if hld.toSeq(v) == hld.N-1:\n return -1\n var cand = hld.toVtx(hld.toSeq(v) + 1)\n if hld.PP[v] == hld.PP[cand]:\n return cand\n -1\n proc lca*(hld: HeavyLightDecomposition, u: int, v: int): int =\n var (u, v) = (u, v)\n if hld.PD[u] < hld.PD[v]:\n swap(u, v)\n while hld.PD[u] > hld.PD[v]:\n u = hld.P[hld.PP[u]]\n while hld.PP[u] != hld.PP[v]:\n u = hld.P[hld.PP[u]]\n v = hld.P[hld.PP[v]]\n if hld.D[u] > hld.D[v]:\n return v\n u\n proc dist*(hld: HeavyLightDecomposition, u: int, v: int): int =\n hld.depth(u) + hld.depth(v) - hld.depth(hld.lca(u, v)) * 2\n proc path*(hld: HeavyLightDecomposition, r: int, c: int, include_root: bool, reverse_path: bool): seq[(int, int)] =\n var (r, c) = (r, c)\n var k = hld.PD[c] - hld.PD[r] + 1\n if k <= 0:\n return @[]\n var res = newSeqWith(k, (0, 0))\n for i in 0..<k-1:\n res[i] = (hld.rangeL[hld.PP[c]], hld.rangeL[c] + 1)\n c = hld.P[hld.PP[c]]\n if hld.PP[r] != hld.PP[c] or hld.D[r] > hld.D[c]:\n return @[]\n var root_off = int(not include_root)\n res[^1] = (hld.rangeL[r]+root_off, hld.rangeL[c]+1)\n if res[^1][0] == res[^1][1]:\n discard res.pop()\n k -= 1\n if reverse_path:\n for i in 0..<k:\n res[i] = (hld.N - res[i][1], hld.N - res[i][0])\n else:\n res.reverse()\n res\n proc subtree*(hld: HeavyLightDecomposition, p: int): (int, int) = (hld.rangeL[p], hld.rangeR[p])\n iterator subtreeV*(hld: HeavyLightDecomposition, p: int):int=\n ## 部分木について、その頂点番号のイテレータ\n for i in hld.rangeL[p]..<hld.rangeR[p]:\n yield hld.toVtx(i)\n proc median*(hld: HeavyLightDecomposition, x: int, y: int, z: int): int =\n hld.lca(x, y) xor hld.lca(y, z) xor hld.lca(x, z)\n proc la*(hld: HeavyLightDecomposition, starting: int, goal: int, d: int): int =\n var (u, v, d) = (starting, goal, d)\n if d < 0:\n return -1\n var g = hld.lca(u, v)\n var dist0 = hld.D[u] - hld.D[g] * 2 + hld.D[v]\n if dist0 < d:\n return -1\n var p = u\n if hld.D[u] - hld.D[g] < d:\n p = v\n d = dist0 - d\n while hld.D[p] - hld.D[hld.PP[p]] < d:\n d -= hld.D[p] - hld.D[hld.PP[p]] + 1\n p = hld.P[hld.PP[p]]\n hld.I[hld.rangeL[p] - d]\n iterator children*(hld: HeavyLightDecomposition, v: int): int =\n var s = hld.rangeL[v] + 1\n while s < hld.rangeR[v]:\n var w = hld.toVtx(s)\n yield w\n s += hld.rangeR[w] - hld.rangeL[w]\n \n\n proc initAuxiliaryTree*(hld:HeavyLightDecomposition,v:seq[int]):UnWeightedUnDirectedTableGraph[int]=\n ## 根が欲しかったらG.v[0]を使ってください けむにく\n var v = v.sortedByit(hld.toseq(it))\n for i in 0..<(len(v)-1):\n v.add(hld.lca(v[i],v[i+1]))\n v = v.sortedByIt(hld.toseq(it)).deduplicate(true)\n var stack :seq[int]\n result = initUnWeightedUnDirectedTableGraph[int](v)\n stack.add(v[0])\n \n for i in 1..<len(v):\n while len(stack) > 0 and hld.toSeq2Out(stack[^1]) < hld.toseq2In(v[i]):\n discard stack.pop()\n if len(stack) != 0:\n result.add_edge(stack[^1],v[i])\n stack.add(v[i])\n \n proc initAuxiliaryWeightedTree*(hld:HeavyLightDecomposition,v:seq[int]):WeightedUnDirectedTableGraph[int,int]=\n ## 根が欲しかったらG.v[0]を使ってください けむにく\n var v = v.sortedByit(hld.toseq(it))\n for i in 0..<(len(v)-1):\n v.add(hld.lca(v[i],v[i+1]))\n v = v.sortedByIt(hld.toseq(it)).deduplicate(true)\n var stack :seq[int]\n result = initWeightedUnDirectedTableGraph(v,int)\n stack.add(v[0])\n for i in 1..<len(v):\n while len(stack) > 0 and hld.toSeq2Out(stack[^1]) < hld.toseq2In(v[i]):\n discard stack.pop()\n if len(stack) != 0:\n result.add_edge(stack[^1],v[i],hld.depth(v[i])-hld.depth(stack[^1]))\n stack.add(v[i])\n\n"
ImportExpand "cplib/collections/segtree.nim" <=== "when not declared CPLIB_COLLECTIONS_SEGTREE:\n const CPLIB_COLLECTIONS_SEGTREE* = 1\n import algorithm\n import strutils\n import sequtils\n type SegmentTree*[T] = ref object\n default: T\n merge: proc(x: T, y: T): T\n arr*: seq[T]\n lastnode: int\n length: int\n proc initSegmentTree*[T](v: seq[T], merge: proc(x: T, y: T): T, default: T): SegmentTree[T] =\n ## セグメントツリーを生成します。\n ## vに元となるリスト、mergeに二つの区間をマージする関数、デフォルトに単位元を与えてください。\n var lastnode = 1\n while lastnode < len(v):\n lastnode*=2\n var arr = newSeq[T](2*lastnode)\n arr.fill(default)\n var self = SegmentTree[T](default: default, merge: merge, arr: arr, lastnode: lastnode, length: len(v))\n #1-indexedで作成する\n for i in 0..<len(v):\n self.arr[self.lastnode+i] = v[i]\n for i in countdown(lastnode-1, 1):\n self.arr[i] = self.merge(self.arr[2*i], self.arr[2*i+1])\n return self\n proc initSegmentTree*[T](n: int, merge: proc(x: T, y: T): T, default: T): SegmentTree[T] =\n ## セグメントツリーを生成します。\n ## nにサイズ、mergeに二つの区間をマージする関数、デフォルトに単位元を与えてください。（全て単位元で構築されます）\n initSegmentTree(newSeqWith(n, default), merge, default)\n\n proc update*[T](self: SegmentTree[T], x: Natural, val: T) =\n ## xの要素をvalに変更します。\n assert x < self.length\n var x = x\n x += self.lastnode\n self.arr[x] = val\n while x > 1:\n x = x shr 1\n self.arr[x] = self.merge(self.arr[2*x], self.arr[2*x+1])\n proc get*[T](self: SegmentTree[T], q_left: Natural, q_right: Natural): T =\n ## 半解区間[q_left,q_right)についての演算結果を返します。\n assert q_left <= q_right and 0 <= q_left and q_right <= self.length\n var q_left = q_left\n var q_right = q_right\n q_left += self.lastnode\n q_right += self.lastnode\n var (lres, rres) = (self.default, self.default)\n while q_left < q_right:\n if (q_left and 1) > 0:\n lres = self.merge(lres, self.arr[q_left])\n q_left += 1\n if (q_right and 1) > 0:\n q_right -= 1\n rres = self.merge(self.arr[q_right], rres)\n q_left = q_left shr 1\n q_right = q_right shr 1\n return self.merge(lres, rres)\n proc get*[T](self: SegmentTree[T], segment: HSlice[int, int]): T =\n assert segment.a <= segment.b + 1 and 0 <= segment.a and segment.b+1 <= self.length\n return self.get(segment.a, segment.b+1)\n proc `[]`*[T](self: SegmentTree[T], segment: HSlice[int, int]): T = self.get(segment)\n proc `[]`*[T](self: SegmentTree[T], index: Natural): T =\n assert index < self.length\n return self.arr[index+self.lastnode]\n proc `[]=`*[T](self: SegmentTree[T], index: Natural, val: T) =\n assert index < self.length\n self.update(index, val)\n proc get_all*[T](self: SegmentTree[T]): T =\n ## [0,len(self))区間の演算結果をO(1)で返す\n return self.arr[1]\n proc len*[T](self: SegmentTree[T]): int =\n return self.length\n proc `$`*[T](self: SegmentTree[T]): string =\n var s = self.arr.len div 2\n return self.arr[s..<s+self.len].join(\" \")\n template newSegWith*(V, merge, default: untyped): untyped =\n initSegmentTree[typeof(default)](V, proc (l{.inject.}, r{.inject.}: typeof(default)): typeof(default) = merge, default)\n proc max_right*[T](self: SegmentTree[T], l: int, f: proc(l: T): bool): int =\n assert 0 <= l and l <= self.len\n assert f(self.default)\n if l == self.len: return self.len\n var l = l + self.lastnode\n var sm = self.default\n while true:\n while l mod 2 == 0: l = (l shr 1)\n if not f(self.merge(sm, self.arr[l])):\n while l < self.lastnode:\n l *= 2\n if f(self.merge(sm, self.arr[l])):\n sm = self.merge(sm, self.arr[l])\n l += 1\n return l - self.lastnode\n sm = self.merge(sm, self.arr[l])\n l += 1\n if (l and -l) == l: break\n return self.len\n proc min_left*[T](self: SegmentTree[T], r: int, f: proc(l: T): bool): int =\n assert 0 <= r and r <= self.len\n assert f(self.default)\n if r == 0: return 0\n var r = r + self.lastnode\n var sm = self.default\n while true:\n r -= 1\n while ((r > 1) and (r mod 2 != 0)): r = (r shr 1)\n if not f(self.merge(self.arr[r], sm)):\n while r < self.lastnode:\n r = 2 * r + 1\n if f(self.merge(self.arr[r], sm)):\n sm = self.merge(self.arr[r], sm)\n r -= 1\n return r + 1 - self.lastnode\n sm = self.merge(self.arr[r], sm)\n if (r and -r) == r: break\n return 0\n"
const start_alphabet = 'a'
type Trie = ref object
children : seq[seq[int32]]
parent : seq[int32]
exist : seq[int32]
proc get_child(trie:Trie,node:int32,c:int8):int32 =
if trie.exist[node] & (1 shl c) == 0:
raise newException(ValueError, "not found")
return trie.children[node][(trie.exist[node] & ((1 shl c)-1)).popcount()]
proc get_child(trie:Trie,node:int32,c:char):int32 =
return trie.get_child(node,int8(c)-int8(start_alphabet))
proc LCP(a,b:string):int=
for i in 0..<min(a.len,b.len):
if a[i] != b[i]:
return i
return min(a.len,b.len)
proc buildTrie(S:seq[string]):Trie=
let S = S.sorted()
var bef = ""
result = Trie(children: @[@[]],parent: @[-1],exist: @[0])
var now = 0i32
for i in 0..<S.len:
var lcp = LCP(bef,S[i])
for _ in 0..<(len(bef)-lcp):
now = result.parent[now]
for idx in lcp..<len(S[i]):
var c = S[i][idx]
var child = len(result.children).int32()
result.exist[now] = result.exist[now] or (1i32 shl (int8(c) - int8(start_alphabet)))
result.children[now].add(child)
result.exist.add(0i32)
result.children.add(@[])
result.parent.add(now)
now = child
bef = S[i]
proc get_node_idx(t:Trie,s:string):int32=
var node = 0i32
for c in s:
node = t.get_child(node,c)
return node
iterator goto_string(t:Trie,s:string):int32=
var node = 0i32
for c in s:
yield node
node = t.get_child(node,c)
yield node
proc toUnWeightedUndirectedGraph(t:Trie):UnWeightedUndirectedGraph =
var deque = initDeque[int32]()
deque.addLast(0)
var g = initUnWeightedUndirectedGraph(len(t.children))
while len(deque) > 0:
var now = deque.popFirst()
for child in t.children[now]:
g.add_edge(now,child)
deque.addLast(child)
return g
var N = ii()
var S = newseqwith(N,si())
var memo = S
var Q = ii()
var querys : seq[(int,int,char)]
for i in range(Q):
var T = ii()
if T == 1:
var x = ii()-1
var c = si()[0]
memo[x] &= c
querys.add((T,x,c))
else:
var x = ii()-1
querys.add((T,x,'*'))
var trie = memo.buildTrie()
var now = (0..<N).toseq().mapit(get_node_idx(trie,S[it]))
var HLD = trie.toUnWeightedUndirectedGraph().initHld(0)
var st = newsegwith(len(trie.children),l+r,0)
for i in range(N):
for node in goto_string(trie,S[i]):
st[HLD.toseq(node)] = st[HLD.toseq(node)] + 1
for i in range(Q):
var (T,x,c) = querys[i]
if T == 1:
now[x] = trie.get_child(now[x],c)
st[HLD.toseq(now[x])] = st[HLD.toseq(now[x])] + 1
else:
var ans = 0
for (l,r) in HLD.path(0,now[x],false,false):
ans += st[l..<r]
echo ans