結果
| 問題 | No.3667 Prefix Count Queries |
| ユーザー |
 kemuniku
|
| 提出日時 | 2026-09-01 06:57:34 |
| 言語 | Nim (2.2.10) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 31,348 bytes |
| 記録 | |
| コンパイル時間 | 2,441 ms |
| コンパイル使用メモリ | 80,920 KB |
| 実行使用メモリ | 1,298,168 KB |
| 最終ジャッジ日時 | 2026-09-01 06:57:41 |
| 合計ジャッジ時間 | 7,381 ms |
|
ジャッジサーバーID （参考情報） |
judge1_0 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | WA * 5 |
| other | WA * 6 MLE * 2 -- * 27 |
ソースコード
import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# source: src/cplib/tmpl/sheep.nim
ImportExpand "cplib/tmpl/sheep" <=== "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 {.emit: \"\"\"\n #include <cstdio>\n #include <cstdint>\n #include <cstring>\n #include <sys/mman.h>\n #include <sys/stat.h>\n\n namespace cplib_sheep_input {\n constexpr std::size_t buffer_size = 1U << 20;\n char buffer[buffer_size];\n std::size_t cursor = 0;\n std::size_t length = 0;\n const char* mapped = nullptr;\n bool initialized = false;\n\n inline void initialize() {\n if (initialized) return;\n initialized = true;\n\n struct stat st;\n const int fd = fileno(stdin);\n if (fstat(fd, &st) == 0 && S_ISREG(st.st_mode) && st.st_size > 0) {\n void* p = mmap(nullptr, static_cast<std::size_t>(st.st_size),\n PROT_READ, MAP_PRIVATE, fd, 0);\n if (p != MAP_FAILED) {\n mapped = static_cast<const char*>(p);\n length = static_cast<std::size_t>(st.st_size);\n madvise(const_cast<char*>(mapped), length, MADV_SEQUENTIAL);\n }\n }\n }\n\n inline int get_char() {\n initialize();\n if (mapped != nullptr) {\n if (cursor == length) return -1;\n return static_cast<unsigned char>(mapped[cursor++]);\n }\n\n if (cursor == length) {\n length = fread_unlocked(buffer, 1, buffer_size, stdin);\n cursor = 0;\n if (length == 0) return -1;\n }\n return static_cast<unsigned char>(buffer[cursor++]);\n }\n\n inline bool refill() {\n length = fread_unlocked(buffer, 1, buffer_size, stdin);\n cursor = 0;\n return length != 0;\n }\n\n inline bool has_eight_digits(const char* source) {\n std::uint64_t bytes;\n std::memcpy(&bytes, source, sizeof(bytes));\n constexpr std::uint64_t high_nibbles = 0xf0f0f0f0f0f0f0f0ULL;\n return (bytes & high_nibbles) == 0x3030303030303030ULL &&\n ((bytes + 0x0606060606060606ULL) & high_nibbles) ==\n 0x3030303030303030ULL;\n }\n\n inline unsigned parse_eight_digits(const char* source) {\n#if defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__\n std::uint64_t digits;\n std::memcpy(&digits, source, sizeof(digits));\n digits -= 0x3030303030303030ULL;\n digits = (digits * 10 + (digits >> 8)) & 0x00ff00ff00ff00ffULL;\n digits = (digits * 100 + (digits >> 16)) & 0x0000ffff0000ffffULL;\n return static_cast<unsigned>(\n (digits * 10000 + (digits >> 32)) & 0xffffffffULL);\n#else\n unsigned result = 0;\n for (int i = 0; i < 8; ++i) {\n result = result * 10U + static_cast<unsigned>(source[i] - '0');\n }\n return result;\n#endif\n }\n\n inline long long read_int() {\n initialize();\n\n if (mapped != nullptr) {\n while (cursor < length && mapped[cursor] <= ' ') ++cursor;\n if (cursor == length) return 0;\n\n const bool negative = mapped[cursor] == '-';\n if (negative) {\n ++cursor;\n if (cursor == length) return 0;\n }\n\n if (!negative && length - cursor >= 9 &&\n has_eight_digits(mapped + cursor)) {\n const unsigned value = parse_eight_digits(mapped + cursor);\n const unsigned ninth = static_cast<unsigned>(mapped[cursor + 8] - '0');\n if (ninth >= 10U) {\n cursor += 8;\n return static_cast<long long>(value);\n }\n if (length - cursor >= 10 &&\n static_cast<unsigned>(mapped[cursor + 9] - '0') >= 10U) {\n cursor += 9;\n return static_cast<long long>(value * 10U + ninth);\n }\n }\n\n long long value = 0;\n if (negative) {\n while (length - cursor >= 2) {\n const unsigned first = static_cast<unsigned>(mapped[cursor] - '0');\n const unsigned second = static_cast<unsigned>(mapped[cursor + 1] - '0');\n if (first >= 10U || second >= 10U) break;\n value = value * 100 - static_cast<long long>(first * 10U + second);\n cursor += 2;\n }\n if (cursor < length) {\n const unsigned digit = static_cast<unsigned>(mapped[cursor] - '0');\n if (digit < 10U) {\n value = value * 10 - static_cast<long long>(digit);\n ++cursor;\n }\n }\n } else {\n while (length - cursor >= 2) {\n const unsigned first = static_cast<unsigned>(mapped[cursor] - '0');\n const unsigned second = static_cast<unsigned>(mapped[cursor + 1] - '0');\n if (first >= 10U || second >= 10U) break;\n value = value * 100 + static_cast<long long>(first * 10U + second);\n cursor += 2;\n }\n if (cursor < length) {\n const unsigned digit = static_cast<unsigned>(mapped[cursor] - '0');\n if (digit < 10U) {\n value = value * 10 + static_cast<long long>(digit);\n ++cursor;\n }\n }\n }\n return value;\n }\n\n for (;;) {\n if (cursor == length && !refill()) return 0;\n while (cursor < length && buffer[cursor] <= ' ') ++cursor;\n if (cursor < length) break;\n }\n\n const bool negative = buffer[cursor] == '-';\n if (negative) ++cursor;\n long long value = 0;\n\n for (;;) {\n if (!negative && length - cursor >= 9 &&\n has_eight_digits(buffer + cursor)) {\n const unsigned first_eight = parse_eight_digits(buffer + cursor);\n const unsigned ninth = static_cast<unsigned>(buffer[cursor + 8] - '0');\n if (ninth >= 10U) {\n cursor += 8;\n return static_cast<long long>(first_eight);\n }\n if (length - cursor >= 10 &&\n static_cast<unsigned>(buffer[cursor + 9] - '0') >= 10U) {\n cursor += 9;\n return static_cast<long long>(first_eight * 10U + ninth);\n }\n }\n\n while (length - cursor >= 2) {\n const unsigned first = static_cast<unsigned>(buffer[cursor] - '0');\n const unsigned second = static_cast<unsigned>(buffer[cursor + 1] - '0');\n if (first >= 10U) return value;\n if (second >= 10U) {\n value = negative\n ? value * 10 - static_cast<long long>(first)\n : value * 10 + static_cast<long long>(first);\n ++cursor;\n return value;\n }\n value = negative\n ? value * 100 - static_cast<long long>(first * 10U + second)\n : value * 100 + static_cast<long long>(first * 10U + second);\n cursor += 2;\n }\n\n if (cursor < length) {\n const unsigned digit = static_cast<unsigned>(buffer[cursor] - '0');\n if (digit >= 10U) return value;\n value = negative\n ? value * 10 - static_cast<long long>(digit)\n : value * 10 + static_cast<long long>(digit);\n ++cursor;\n }\n if (!refill()) return value;\n }\n }\n\n template <class T>\n inline void read_int_array(T* output, std::size_t count) {\n for (std::size_t i = 0; i < count; ++i) {\n output[i] = static_cast<T>(read_int());\n }\n }\n } // namespace cplib_sheep_input\n \"\"\".}\n\n proc sheepGetChar(): cint {.importcpp: \"cplib_sheep_input::get_char()\", nodecl, inline.}\n proc sheepReadInt(): clonglong {.importcpp: \"cplib_sheep_input::read_int()\", nodecl, inline.}\n proc sheepReadIntArray(values: ptr int, count: csize_t) {.importcpp: \"cplib_sheep_input::read_int_array(@)\", nodecl, inline.}\n\n proc ii(): int {.inline.} = sheepReadInt().int\n proc lii(N: int): seq[int] {.inline.} =\n result = newSeq[int](N)\n if N > 0:\n sheepReadIntArray(addr result[0], N.csize_t)\n\n proc si(): string {.inline.} =\n var c = sheepGetChar()\n while c >= 0 and c <= ord(' '):\n c = sheepGetChar()\n while c > ord(' '):\n result.add(char(c))\n c = sheepGetChar()\n \n # 出力系\n # 1. 実際の処理を行う proc (openArray を受け取る)\n proc print_internal(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: openArray[string]) =\n for i in 0 ..< args.len:\n prop.f.write(args[i])\n if i != args.len - 1:\n prop.f.write(prop.sepc)\n else:\n prop.f.write(prop.endc)\n if prop.flush:\n prop.f.flushFile()\n\n # 2. ユーザーが呼び出すためのインターフェース (varargs を受け取る)\n proc print*(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: varargs[string, `$`]) =\n # varargs は内部では openArray として扱えるので、そのまま渡せる\n print_internal(prop, args)\n\n proc print*(args: varargs[string, `$`]) =\n # こちらも内部用の proc を呼ぶ\n print_internal((f: stdout, sepc: \" \", endc: \"\\n\", flush: false), args)\n macro getSymbolName(x: typed): string = x.toStrLit\n macro debug*(args: varargs[untyped]): untyped =\n when defined(debug):\n result = newNimNode(nnkStmtList, args)\n template prop(e: string = \"\"): untyped = (f: stderr, sepc: \"\", endc: e, flush: true)\n for i, arg in args:\n if arg.kind == nnkStrLit:\n result.add(quote do: print(prop(), \"\\\"\", `arg`, \"\\\"\"))\n else:\n result.add(quote do: print(prop(\": \"), getSymbolName(`arg`)))\n result.add(quote do: print(prop(), `arg`))\n if i != args.len - 1: result.add(quote do: print(prop(), \", \"))\n else: result.add(quote do: print(prop(), \"\\n\"))\n else:\n return (quote do: discard)\n #chmin,chmax\n template `max=`(x, y) =\n let yVal = y # yが計算式の場合に評価を1回にするため\n if x < yVal:\n x = yVal\n\n template `min=`(x, y) =\n let yVal = y\n if x > yVal:\n x = yVal\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 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 \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 # 各要素の一時 string を作らず、最終バッファへ直接追記する。\n proc join*[T: not string](a: openArray[T], sep: string = \"\"): string =\n if a.len == 0:\n return \"\"\n result = newStringOfCap(a.len * 10 + (a.len - 1) * sep.len)\n for i, value in a:\n if i != 0:\n result.add(sep)\n when T is SomeInteger:\n result.addInt(value)\n elif compiles(value.umod) and compiles(value.val):\n # Barrett/Montgomery modint は表示用の正規値へ戻す。\n result.addInt(value.val)\n else:\n result.add($value)\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 \n # Yes/No\n proc yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n proc no*(b: bool = true): void = yes(not b)\n\n proc takahashi(b:bool = true) : void = print(if b: \"Takahashi\" else: \"Aoki\")\n proc aoki(b:bool = true) : void = takahashi(not b)\n\n template dblock(body: untyped) =\n when defined(debug):\n block:\n body\n"
# source: src/cplib/graph/graph.nim
ImportExpand "cplib/graph/graph" <=== "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:openArray[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:openArray[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:openArray[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:openArray[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:T)=\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:T,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"
# source: src/cplib/graph/warshall_floyd.nim
ImportExpand "cplib/graph/warshall_floyd" <=== "when not declared CPLIB_GRAPH_WARSHALLFLOYD:\n const CPLIB_GRAPH_WARSHALLFLOYD* = 1\n import sequtils\n proc warshall_floyd_impl[T](g: DynamicGraph[T] or StaticGraph[T], zero, inf: T): tuple[negative_cycle: bool, d: seq[seq[T]]] =\n var d = newSeqWith(g.len, newSeqWith(g.len, inf))\n for i in 0..<g.len: d[i][i] = zero\n for i in 0..<g.len:\n for (j, cost) in g.to_and_cost(i):\n d[i][j] = cost\n for k in 0..<g.len:\n for i in 0..<g.len:\n for j in 0..<g.len:\n if d[i][k] != inf and d[k][j] != inf:\n d[i][j] = min(d[i][j], d[i][k] + d[k][j])\n for i in 0..<g.len:\n if d[i][i] < zero: return (negative_cycle: true, d: d)\n return (negative_cycle: false, d: d)\n\n proc warshall_floyd*(g: DynamicGraph[int] or StaticGraph[int], zero: int = 0, inf: int = INF64): tuple[negative_cycle: bool, d: seq[seq[int]]] = warshall_floyd_impl(g, zero, inf)\n proc warshall_floyd*(g: DynamicGraph[int32] or StaticGraph[int32], zero: int32 = 0.int32, inf: int32 = INF32): tuple[negative_cycle: bool, d: seq[seq[int32]]] = warshall_floyd_impl(g, zero, inf)\n proc warshall_floyd*(g: DynamicGraph[float] or StaticGraph[float], zero: float = 0.0, inf: float = 1e100): tuple[negative_cycle: bool, d: seq[seq[float]]] = warshall_floyd_impl(g, zero, inf)\n proc warshall_floyd*(g: DynamicGraph[float32] or StaticGraph[float32], zero: float32 = 0.0'f32, inf: float32 = 1e30'f32): tuple[negative_cycle: bool, d: seq[seq[float32]]] = warshall_floyd_impl(g, zero, inf)\n proc warshall_floyd*[T](g: DynamicGraph[T] or StaticGraph[T], zero, inf: T): tuple[negative_cycle: bool, d: seq[seq[T]]] = warshall_floyd_impl(g, zero, inf)\n"
# source: src/cplib/graph/graph_debug.nim
ImportExpand "cplib/graph/graph_debug" <=== "when not declared CPLIB_GRAPH_GRAPHDEBUG:\n const CPLIB_GRAPH_GRAPHDEBUG* = 1\n import streams\n import strformat\n proc dump_graph*(G: WeightedDirectedGraph or WeightedDirectedStaticGraph,output:File=stdout)=\n var M = 0\n for x in 0..<len(G):\n for (y,c) in G[x]:\n M += 1\n output.writeLine($len(G)&\" \" & $M)\n for x in 0..<len(G):\n for (y,c) in G[x]:\n output.writeLine($x & \" \" & $y & \" \" & $c)\n \n proc dump_graph*(G: WeightedUnDirectedGraph or WeightedUnDirectedStaticGraph,output:File=stdout)=\n var M = 0\n for x in 0..<len(G):\n for (y,c) in G[x]:\n if y >= x:\n M += 1\n output.writeLine($len(G)&\" \" & $M)\n for x in 0..<len(G):\n for (y,c) in G[x]:\n if y >= x:\n output.writeLine($x & \" \" & $y &\" \" & $c)\n \n proc dump_graph*(G: UnWeightedDirectedGraph or UnWeightedDirectedStaticGraph,output:File=stdout)=\n var M = 0\n for x in 0..<len(G):\n for y in G[x]:\n M += 1\n output.writeLine($len(G)&\" \" & $M)\n for x in 0..<len(G):\n for y in G[x]:\n output.writeLine($x & \" \" & $y)\n \n proc dump_graph*(G: UnWeightedUnDirectedGraph or UnWeightedUnDirectedStaticGraph,output:File=stdout)=\n var M = 0\n for x in 0..<len(G):\n for y in G[x]:\n if y >= x:\n M += 1\n output.writeLine($len(G)&\" \" & $M)\n for x in 0..<len(G):\n for y in G[x]:\n if y >= x:\n output.writeLine($x & \" \" & $y)\n \n proc to_graph_graph*(G: WeightedDirectedGraph or WeightedDirectedStaticGraph,indexed:bool=false):string=\n var M = 0\n for x in 0..<len(G):\n for (y,c) in G[x]:\n M += 1\n result = fmt\"https://hello-world-494ec.firebaseapp.com/?format=normal&indexed={indexed}&weighted=true&directed=true&data={len(G)}+{M}\"\n var add = 0\n if indexed:\n add += 1\n for x in 0..<len(G):\n for (y,c) in G[x]:\n result &= fmt\"%0A{x+add}+{y+add}+{c}\"\n\n proc to_graph_graph*(G: WeightedUnDirectedGraph or WeightedUnDirectedStaticGraph,indexed:bool=false):string=\n var M = 0\n for x in 0..<len(G):\n for (y,c) in G[x]:\n if y >= x:\n M += 1\n result = fmt\"https://hello-world-494ec.firebaseapp.com/?format=normal&indexed={indexed}&weighted=true&directed=false&data={len(G)}+{M}\"\n var add = 0\n if indexed:\n add += 1\n for x in 0..<len(G):\n for (y,c) in G[x]:\n if y >= x:\n result &= fmt\"%0A{x+add}+{y+add}+{c}\"\n\n proc to_graph_graph*(G: UnWeightedDirectedGraph or UnWeightedDirectedStaticGraph,indexed:bool=false):string=\n var M = 0\n for x in 0..<len(G):\n for y in G[x]:\n M += 1\n result = fmt\"https://hello-world-494ec.firebaseapp.com/?format=normal&indexed={indexed}&weighted=false&directed=true&data={len(G)}+{M}\"\n var add = 0\n if indexed:\n add += 1\n for x in 0..<len(G):\n for y in G[x]:\n result &= fmt\"%0A{x+add}+{y+add}\"\n\n proc to_graph_graph*(G: UnWeightedUnDirectedGraph or UnWeightedUnDirectedStaticGraph,indexed:bool=false):string=\n var M = 0\n for x in 0..<len(G):\n for y in G[x]:\n if y >= x:\n M += 1\n result = fmt\"https://hello-world-494ec.firebaseapp.com/?format=normal&indexed={indexed}&weighted=false&directed=false&data={len(G)}+{M}\"\n var add = 0\n if indexed:\n add += 1\n for x in 0..<len(G):\n for y in G[x]:\n if y >= x:\n result &= fmt\"%0A{x+add}+{y+add}\"\n"
var N,M = ii()
var P = lii(N)
var G = initWeightedDirectedGraph(N)
for _ in range(M):
var u,v,t = ii()
u-=1
v-=1
G.add_edge(u,v,t)
var (f,res) = G.warshall_floyd()
assert not f
var mn = INF
for i in range(N):
for j in range(N):
if i != j:
mn.min = res[i][j] + P[i] + P[j]
var cnt = 0
# echo G.to_graph_graph()
for i in range(N):
for j in range(N):
if i != j:
if res[i][j] + P[i] + P[j] == mn:
cnt += 1
# print(i,j)
echo mn," ",cnt