#967038 (Nim) No.2713 Just Solitaire

提出ソース

結果

問題	No.2713 Just Solitaire
ユーザー	👑 seekworser
提出日時	2024-03-31 14:21:57
言語	Nim (2.0.2)
結果	AC
実行時間	4 ms / 2,000 ms
コード長	12,326 bytes
コンパイル時間	4,799 ms
コンパイル使用メモリ	93,696 KB
実行使用メモリ	6,676 KB
最終ジャッジ日時	2024-03-31 14:22:12
合計ジャッジ時間	5,613 ms
ジャッジサーバーID （参考情報）	judge10 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	1 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	3 ms 6,676 KB
testcase_05	AC	2 ms 6,676 KB
testcase_06	AC	3 ms 6,676 KB
testcase_07	AC	2 ms 6,676 KB
testcase_08	AC	2 ms 6,676 KB
testcase_09	AC	2 ms 6,676 KB
testcase_10	AC	2 ms 6,676 KB
testcase_11	AC	2 ms 6,676 KB
testcase_12	AC	1 ms 6,676 KB
testcase_13	AC	2 ms 6,676 KB
testcase_14	AC	2 ms 6,676 KB
testcase_15	AC	1 ms 6,676 KB
testcase_16	AC	2 ms 6,676 KB
testcase_17	AC	2 ms 6,676 KB
testcase_18	AC	2 ms 6,676 KB
testcase_19	AC	3 ms 6,676 KB
testcase_20	AC	2 ms 6,676 KB
testcase_21	AC	2 ms 6,676 KB
testcase_22	AC	2 ms 6,676 KB
testcase_23	AC	2 ms 6,676 KB
testcase_24	AC	3 ms 6,676 KB
testcase_25	AC	3 ms 6,676 KB
testcase_26	AC	3 ms 6,676 KB
testcase_27	AC	4 ms 6,676 KB
testcase_28	AC	3 ms 6,676 KB
testcase_29	AC	3 ms 6,676 KB
testcase_30	AC	3 ms 6,676 KB
testcase_31	AC	3 ms 6,676 KB
testcase_32	AC	3 ms 6,676 KB
testcase_33	AC	3 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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\n    import std/math\n    import sets\n    import strutils\n    import strformat\n    import sugar\n    import streams\n    import deques\n    import bitops\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\n            except EOFError: yield \"\"\n            for s in si.split:\n                if getsChar:\n                    for i in 0..<s.len():\n                        yield s[i..i]\n                else:\n                    if s.isEmptyOrWhitespace: continue\n                    yield s\n    proc input*(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:\n            if 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 or float32 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]}\")\n            if 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:\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    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\n    proc `//`*(x: SomeInteger, y: SomeInteger): int =\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: 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: var SomeInteger, y: SomeInteger): void = x = x // y\n    proc `^=`*(x: var SomeInteger, y: SomeInteger): void = x = x ^ y\n    proc `&=`*(x: var SomeInteger, y: SomeInteger): void = x = x & y\n    proc `|=`*(x: var SomeInteger, y: SomeInteger): void = x = x | y\n    proc `>>=`*(x: var SomeInteger, 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 = x xor (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 =\n            var x = n\n            var y = (x + 1) shr 1\n            while y < x:\n                x = y\n                y = (x + n div x) shr 1\n            return 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    proc Yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n    proc No*(b: bool = true): void = Yes(not b)\n    proc 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    const DXY* = [(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    macro exit*(statement: untyped): untyped = (quote do: (`statement`; quit()))\n    proc initHashSet[T](): Hashset[T] = initHashSet[T](0)\n"
ImportExpand "atcoder/maxflow.nim" <=== "when not declared ATCODER_MAXFLOW_HPP:\n  const ATCODER_MAXFLOW_HPP* = 1\n  \n  #[ import atcoder/internal_queue ]#\n  when not declared ATCODER_INTERNAL_QUEUE_HPP:\n    const ATCODER_INTERNAL_QUEUE_HPP* = 1\n  \n    type simple_queue[T] = object\n      payload:seq[T]\n      pos:int\n    proc init_simple_queue*[T]():auto = simple_queue[T](payload:newSeq[T](), pos:0)\n  # TODO\n  #      void reserve(int n) { payload.reserve(n); }\n    proc len*[T](self:simple_queue[T]):int = self.payload.len - self.pos\n    proc empty*[T](self:simple_queue[T]):bool = self.pos == self.payload.len\n    proc push*[T](self:var simple_queue[T], t:T) = self.payload.add(t)\n    proc front*[T](self:simple_queue[T]):T = self.payload[self.pos]\n    proc clear*[T](self:var simple_queue[T]) =\n      self.payload.setLen(0)\n      self.pos = 0;\n    proc pop*[T](self:var simple_queue[T]) = self.pos.inc\n  import std/algorithm\n\n  type MFInternalEdge[Cap] = object\n    dst, rev:int\n    cap:Cap\n  \n  type MFGraph*[Cap] = object\n    len*:int\n    pos:seq[(int,int)]\n    g:seq[seq[MFInternalEdge[Cap]]]\n  \n  proc init_mf_graph*[Cap](n:int):auto = MFGraph[Cap](len:n, g:newSeq[seq[MFInternalEdge[Cap]]](n))\n  proc initMaxFlow*[Cap](n:int):auto = MFGraph[Cap](len:n, g:newSeq[seq[MFInternalEdge[Cap]]](n))\n  \n  proc add_edge*[Cap](self: var MFGraph[Cap], src, dst:int, cap:Cap):int {.discardable.}=\n    assert src in 0..<self.len\n    assert dst in 0..<self.len\n    assert 0.Cap <= cap\n    let m = self.pos.len\n    self.pos.add((src, self.g[src].len))\n    var src_id = self.g[src].len\n    var dst_id = self.g[dst].len\n    if src == dst: dst_id.inc\n    self.g[src].add(MFInternalEdge[Cap](dst:dst, rev:dst_id, cap:cap))\n    self.g[dst].add(MFInternalEdge[Cap](dst:src, rev:src_id, cap:0))\n    return m\n  \n  type MFEdge*[Cap] = object\n    src*, dst*:int\n    cap*, flow*:Cap\n  \n  proc get_edge*[Cap](self: MFGraph[Cap], i:int):MFEdge[Cap] =\n    let m = self.pos.len\n    assert i in 0..<m\n    let e = self.g[self.pos[i][0]][self.pos[i][1]]\n    let re = self.g[e.dst][e.rev]\n    return MFEdge[Cap](src:self.pos[i][0], dst:e.dst, cap:e.cap + re.cap, flow:re.cap)\n\n  proc edges*[Cap](self: MFGraph[Cap]):seq[MFEdge[Cap]] =\n    let m = self.pos.len\n    result = newSeqOfCap[MFEdge[Cap]](m)\n    for i in 0..<m:\n      result.add(self.get_edge(i))\n\n  proc change_edge*[Cap](self: var MFGraph[Cap], i:int, new_cap, new_flow:Cap) =\n    let m = self.pos.len\n    assert i in 0..<m\n    assert new_flow in 0..new_cap\n    var e = self.g[self.pos[i][0]][self.pos[i][1]].addr\n    var re = self.g[e[].dst][e[].rev].addr\n    e[].cap = new_cap - new_flow\n    re[].cap = new_flow\n\n  proc flow*[Cap](self: var MFGraph[Cap], s, t:int, flow_limit:Cap):Cap =\n    assert s in 0..<self.len\n    assert t in 0..<self.len\n    assert s != t\n  \n    var level, iter = newSeq[int](self.len)\n    var que = init_simple_queue[int]()\n#    internal::simple_queue<int> que;\n  \n    proc bfs(self: MFGraph[Cap]) =\n      level.fill(-1)\n      level[s] = 0\n      que.clear()\n      que.push(s)\n      while not que.empty():\n        let v = que.front()\n        que.pop()\n        for e in self.g[v]:\n          if e.cap == 0 or level[e.dst] >= 0: continue\n          level[e.dst] = level[v] + 1\n          if e.dst == t: return\n          que.push(e.dst)\n    proc dfs(self: var MFGraph[Cap], v:int, up:Cap):Cap =\n      if v == s: return up\n      result = Cap(0)\n      let level_v = level[v]\n      var i = iter[v].addr\n      while i[] < self.g[v].len:\n        let e = self.g[v][i[]].addr\n        if level_v <= level[e[].dst] or self.g[e[].dst][e[].rev].cap == 0:\n          i[].inc\n          continue\n        let d = self.dfs(e.dst, min(up - result, self.g[e[].dst][e[].rev].cap))\n        if d <= 0:\n          i[].inc\n          continue\n        self.g[v][i[]].cap += d\n        self.g[e[].dst][e[].rev].cap -= d\n        result += d\n        if result == up: return\n        i[].inc\n      level[v] = self.len\n\n    var flow = Cap(0)\n    while flow < flow_limit:\n      self.bfs()\n      if level[t] == -1: break\n      iter.fill(0)\n      let f = self.dfs(t, flow_limit - flow)\n      if f == Cap(0): break\n      flow += f\n    return flow\n\n  proc flow*[Cap](self: var MFGraph[Cap], s,t:int):auto = self.flow(s, t, Cap.high)\n\n  proc min_cut*[Cap](self:MFGraph[Cap], s:int):seq[bool] =\n    var visited = newSeq[bool](self.len)\n    var que = init_simple_queue[int]()\n    que.push(s)\n    while not que.empty():\n      let p = que.front()\n      que.pop()\n      visited[p] = true\n      for e in self.g[p]:\n        if e.cap != Cap(0) and not visited[e.dst]:\n          visited[e.dst] = true\n          que.push(e.dst)\n    return visited\n"

var n, m = input(int)
var a = input(int, n)
var b = input(int, m)

var g = init_mf_graph[int](n+m+2)
var s = n+m
var t = s+1
for i in 0..<n:
    g.add_edge(i, t, a[i])
for i in 0..<m:
    g.add_edge(s, n+i, b[i])

for i in 0..<m:
    var k = input(int)
    for j in 0..<k:
        var c = input(int)-1
        g.add_edge(n+i, c, INFL)

var fc = g.flow(s, t)
for e in g.edges:
    debug(e.src, e.dst, e.cap, e.flow)
# debug(fc)
print(b.sum - fc)

yukicoder

結果

テストケース

ソースコード