結果
問題 | No.2638 Initial fare |
ユーザー |
👑 |
提出日時 | 2024-02-20 00:16:50 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 201 ms / 2,000 ms |
コード長 | 15,053 bytes |
コンパイル時間 | 5,804 ms |
コンパイル使用メモリ | 91,392 KB |
実行使用メモリ | 46,336 KB |
最終ジャッジ日時 | 2024-10-01 17:06:47 |
合計ジャッジ時間 | 9,234 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])# {.checks: off.}ImportExpand "cplib/tmpl/citrus.nim" <=== "when not declared CPLIB_TMPL_CITRUS:\n const CPLIB_TMPL_CITRUS* = 1\n {.warning[UnusedImport]: off.}\n {.hint[XDeclaredButNotUsed]: off.}\n import os\n import algorithm\n import sequtils\n import tables\n import macros\nimport std/math\n import sets\n import strutils\n import strformat\n import sugar\n import streams\n import deques\n importbitops\n import heapqueue\n import options\n import hashes\n const MODINT998244353* = 998244353\n const MODINT1000000007* =1000000007\n const INF* = 100100111\n const INFL* = int(3300300300300300491)\n type double* = float64\n let readNext = iterator(getsChar: bool = false): string {.closure.} =\n while true:\n var si: string\n try: si = stdin.readLine\nexcept EOFError: yield \"\"\n for s in si.split:\n if getsChar:\n for i in 0..<s.len():\nyield s[i..i]\n else:\n if s.isEmptyOrWhitespace: continue\n yield s\n procinput*(t: typedesc[string]): string = readNext()\n proc input*(t: typedesc[char]): char = readNext(true)[0]\n proc input*(t: typedesc[int]):int = readNext().parseInt\n proc input*(t: typedesc[float]): float = readNext().parseFloat\n macro input*(t: typedesc, n: varargs[int]):untyped =\n var repStr = \"\"\n for arg in n:\n repStr &= &\"({arg.repr}).newSeqWith \"\n parseExpr(&\"{repStr}input({t})\")\n macro input*(ts: varargs[auto]): untyped =\n var tupStr = \"\"\n for t in ts:\n tupStr &=&\"input({t.repr}),\"\n parseExpr(&\"({tupStr})\")\n macro input*(n: int, ts: varargs[auto]): untyped =\n for typ in ts:\nif typ.typeKind != ntyAnything:\n error(\"Expected typedesc, got \" & typ.repr, typ)\n parseExpr(&\"({n.repr}).newSeqWith input({ts.repr})\")\n proc `fmtprint`*(x: int or string or char or bool): string = return $x\n proc `fmtprint`*(x: float orfloat32 or float64): string = return &\"{x:.16f}\"\n proc `fmtprint`*[T](x: seq[T] or Deque[T] or HashSet[T] or set[T]): string = return x.toSeq.join(\" \")\n proc `fmtprint`*[T, N](x: array[T, N]): string = return x.toSeq.join(\" \")\n proc `fmtprint`*[T](x: HeapQueue[T]):string =\n var q = x\n while q.len != 0:\n result &= &\"{q.pop()}\"\n if q.len != 0: result &= \" \"\n proc`fmtprint`*[T](x: CountTable[T]): string =\n result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n proc `fmtprint`*[K, V](x:Table[K, V]): string =\n result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n proc print*(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: varargs[string, `fmtprint`]) =\n for i in 0..<len(args):\n prop.f.write(&\"{args[i]}\")\nif i != len(args) - 1: prop.f.write(prop.sepc) else: prop.f.write(prop.endc)\n if prop.flush: prop.f.flushFile()\n proc print*(args: varargs[string, `fmtprint`]) = print((f: stdout, sepc: \" \", endc: \"\\n\", flush: false), args)\n const LOCAL_DEBUG{.booldefine.} =false\n macro getSymbolName(x: typed): string = x.toStrLit\n macro debug*(args: varargs[untyped]): untyped =\n when LOCAL_DEBUG:\nresult = 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`)))\nresult.add(quote do: print(prop(), `arg`))\n if i != args.len - 1: result.add(quote do: print(prop(), \", \"))\nelse: result.add(quote do: print(prop(), \"\\n\"))\n else:\n return (quote do: discard)\n proc `%`*(x: SomeInteger, y:SomeInteger): int =\n result = x mod y\n if y > 0 and result < 0: result += y\n if y < 0 and result > 0: result += y\nproc `//`*(x: SomeInteger, y: SomeInteger): int =\n result = x div y\n if y > 0 and result * y > x: result -= 1\n if y < 0and result * y < x: result -= 1\n proc `^`*(x: SomeInteger, y: SomeInteger): int = x xor y\n proc `&`*(x: SomeInteger, y: SomeInteger): int= x and y\n proc `|`*(x: SomeInteger, y: SomeInteger): int = x or y\n proc `>>`*(x: SomeInteger, y: SomeInteger): int = x shr y\n proc `<<`*(x: SomeInteger, y: SomeInteger): int = x shl y\n proc `%=`*(x: var SomeInteger, y: SomeInteger): void = x = x % y\n proc `//=`*(x: varSomeInteger, y: SomeInteger): void = x = x // y\n proc `^=`*(x: var SomeInteger, y: SomeInteger): void = x = x ^ y\n proc `&=`*(x: varSomeInteger, y: SomeInteger): void = x = x & y\n proc `|=`*(x: var SomeInteger, y: SomeInteger): void = x = x | y\n proc `>>=`*(x: varSomeInteger, y: SomeInteger): void = x = x >> y\n proc `<<=`*(x: var SomeInteger, y: SomeInteger): void = x = x << y\n proc `[]`*(x, n: int): bool = (x and (1 shl n)) != 0\n proc `[]=`*(x: var int, n: int, i: bool) =\n if i: x = x or (1 << n)\n else: (if x[n]: x = xxor (1 << n))\n proc pow*(a, n: int, m = INFL): int =\n var\n rev = 1\n a = a\n n = n\n while n> 0:\n if n % 2 != 0: rev = (rev * a) mod m\n if n > 1: a = (a * a) mod m\n n >>= 1\n return rev\n #[include cplib/math/isqrt ]#\n when not declared CPLIB_MATH_ISQRT:\n const CPLIB_MATH_ISQRT* = 1\n proc isqrt*(n: int): int =\nvar x = n\n var y = (x + 1) shr 1\n while y < x:\n x = y\n y = (x + n div x) shr 1\nreturn x\n proc chmax*[T](x: var T, y: T): bool {.discardable.} = (if x < y: (x = y; return true; ) return false)\n proc chmin*[T](x: var T, y: T): bool {.discardable.} = (if x > y: (x = y; return true; ) return false)\n proc `max=`*[T](x: var T, y: T) = x = max(x, y)\n proc `min=`*[T](x: var T, y: T) = x = min(x, y)\n proc at*(x: char, a = '0'): int = int(x) - int(a)\n converter tofloat*(n: int):float = float(n)\n proc Yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n proc No*(b: bool = true): void = Yes(not b)\nproc YES_upper*(b: bool = true): void = print(if b: \"YES\" else: \"NO\")\n proc NO_upper*(b: bool = true): void = Yes_upper(not b)\n constDXY* = [(0, -1), (0, 1), (-1, 0), (1, 0)]\n const DDXY* = [(1, -1), (1, 0), (1, 1), (0, -1), (0, 1), (-1, -1), (-1, 0), (-1, 1)]\n macroexit*(statement: untyped): untyped = (quote do: (`statement`; quit()))\n"ImportExpand "cplib/tmpl/citrus.nim" <=== ""ImportExpand "cplib/graph/graph.nim" <=== "when not declared CPLIB_GRAPH_GRAPH:\n const CPLIB_GRAPH_GRAPH* = 1\n\n import sequtils\n importmath\n type DynamicGraph*[T] = ref object of RootObj\n edges*: seq[seq[(int, T)]]\n N*: int\n type StaticGraph*[T] = refobject of RootObj\n src*, dst*: seq[int]\n cost*: seq[T]\n elist*: seq[(int, T)]\n start*: seq[int]\n N*:int\n\n type WeightedDirectedGraph*[T] = ref object of DynamicGraph[T]\n type WeightedUnDirectedGraph*[T] = ref object of DynamicGraph[T]\ntype UnWeightedDirectedGraph* = ref object of DynamicGraph[int]\n type UnWeightedUnDirectedGraph* = ref object of DynamicGraph[int]\ntype WeightedDirectedStaticGraph*[T] = ref object of StaticGraph[T]\n type WeightedUnDirectedStaticGraph*[T] = ref object of StaticGraph[T]\ntype UnWeightedDirectedStaticGraph* = ref object of StaticGraph[int]\n type UnWeightedUnDirectedStaticGraph* = ref object ofStaticGraph[int]\n\n # type DynamicGraphs* = DynamicGraph or WeightedDirectedGraph or WeightedUnDirectedGraph or UnWeightedDirectedGraph orUnWeightedUnDirectedGraph\n # type StaticGraphs* = StaticGraph or WeightedDirectedStaticGraph or WeightedUnDirectedStaticGraph orUnWeightedDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\n type GraphTypes*[T] = DynamicGraph[T] or StaticGraph[T]\n typeDirectedGraph* = WeightedDirectedGraph or UnWeightedDirectedGraph or WeightedDirectedStaticGraph or UnWeightedDirectedStaticGraph\n typeUnDirectedGraph* = WeightedUnDirectedGraph or UnWeightedUnDirectedGraph or WeightedUnDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\ntype WeightedGraph*[T] = WeightedDirectedGraph[T] or WeightedUnDirectedGraph[T] or WeightedDirectedStaticGraph[T] orWeightedUnDirectedStaticGraph[T]\n type UnWeightedGraph* = UnWeightedDirectedGraph or UnWeightedUnDirectedGraph orUnWeightedDirectedStaticGraph 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, cost))\n if not directed: g.edges[v].add((u, cost))\n\n proc initWeightedDirectedGraph*(N:int, edgetype: typedesc = int): WeightedDirectedGraph[edgetype] =\n result = WeightedDirectedGraph[edgetype](edges: newSeq[seq[(int,edgetype)]](N), N: 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[(int, edgetype)]](N), N: 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 =\nresult = UnWeightedDirectedGraph(edges: newSeq[seq[(int, int)]](N), N: 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[(int, int)]](N), N: 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: GraphTypes[T]): int = G.N\n\n iterator `[]`*[T](g: WeightedDirectedGraph[T] orWeightedUnDirectedGraph[T], x: int): (int, T) =\n for e in g.edges[x]: yield e\n iterator `[]`*(g: UnWeightedDirectedGraph orUnWeightedUnDirectedGraph, x: int): int =\n for e in g.edges[x]: yield e[0]\n\n proc add_edge_static_impl[T](g: StaticGraph[T], u, v:int, cost: T, directed: bool) =\n g.src.add(u)\n g.dst.add(v)\n g.cost.add(cost)\n if not directed:\n g.src.add(v)\n g.dst.add(u)\n g.cost.add(cost)\n\n proc build*[T](g: StaticGraph[T]) =\n g.start = newSeqWith(g.len + 1, 0)\n for i in 0..<g.src.len:\n g.start[g.src[i]] += 1\n g.start.cumsum\n g.elist = newSeq[(int, 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\ng.elist[g.start[u]] = (v, g.cost[i])\n\n proc initWeightedDirectedStaticGraph*(N: int, edgetype: typedesc = int, capacity: int = 0):WeightedDirectedStaticGraph[edgetype] =\n result = WeightedDirectedStaticGraph[edgetype](\n src: newSeqOfCap[int](capacity),\ndst: newSeqOfCap[int](capacity),\n cost: newSeqOfCap[edgetype](capacity),\n elist: newSeq[(int, edgetype)](0),\nstart: newSeq[int](0),\n N: 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[int](capacity*2),\n dst: newSeqOfCap[int](capacity*2),\n cost: newSeqOfCap[edgetype](capacity*2),\n elist: newSeq[(int, edgetype)](0),\n start: newSeq[int](0),\n N: N\n )\n proc add_edge*[T](g: varWeightedUnDirectedStaticGraph[T], u, v: int, cost: T) =\n g.add_edge_static_impl(u, v, cost, false)\n\n procinitUnWeightedDirectedStaticGraph*(N: int, capacity: int = 0): UnWeightedDirectedStaticGraph =\n result = UnWeightedDirectedStaticGraph(\nsrc: newSeqOfCap[int](capacity),\n dst: newSeqOfCap[int](capacity),\n cost: newSeqOfCap[int](capacity),\nelist: newSeq[(int, int)](0),\n start: newSeq[int](0),\n N: N\n )\n proc add_edge*(g: varUnWeightedDirectedStaticGraph, 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[int](capacity*2),\n dst: newSeqOfCap[int](capacity*2),\n cost: newSeqOfCap[int](capacity*2),\n elist: newSeq[(int,int)](0),\n start: newSeq[int](0),\n N: 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]\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]\n\n iterator to_and_cost*[T](g: DynamicGraph[T], x: int): (int, T) =\n for e in g.edges[x]: yield e\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]\n"var n = input(int)var g = initunweightedundirectedStaticgraph(n)var cnt = newSeqWith(n, 0)for i in 0..<n-1:var u, v = input(int)-1g.add_edge(u, v)cnt[u] += 1cnt[v] += 1g.buildvar ans = n-1proc dfs(x, par: int) =ans += cnt[x] * (cnt[x] - 1) // 2for y in g[x]:if y == par: continueans += (cnt[x] - 1) * (cnt[y] - 1)dfs(y, x)dfs(0, -1)print(ans)