#1002435 (Nim) No.2869 yuusaan's Knapsacks

提出ソース

結果

問題	No.2869 yuusaan's Knapsacks
ユーザー	👑 seekworser
提出日時	2024-08-18 18:13:43
言語	Nim (2.0.2)
結果	AC
実行時間	1,020 ms / 4,500 ms
コード長	10,565 bytes
コンパイル時間	4,493 ms
コンパイル使用メモリ	92,884 KB
実行使用メモリ	12,800 KB
最終ジャッジ日時	2024-08-18 18:13:57
合計ジャッジ時間	13,464 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	35 ms 7,040 KB
testcase_04	AC	35 ms 7,040 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	710 ms 12,672 KB
testcase_07	AC	119 ms 7,168 KB
testcase_08	AC	7 ms 6,940 KB
testcase_09	AC	7 ms 6,940 KB
testcase_10	AC	261 ms 8,576 KB
testcase_11	AC	23 ms 6,944 KB
testcase_12	AC	608 ms 11,264 KB
testcase_13	AC	18 ms 6,944 KB
testcase_14	AC	259 ms 7,552 KB
testcase_15	AC	66 ms 7,552 KB
testcase_16	AC	141 ms 8,192 KB
testcase_17	AC	1,020 ms 12,672 KB
testcase_18	AC	646 ms 10,752 KB
testcase_19	AC	411 ms 9,216 KB
testcase_20	AC	7 ms 6,940 KB
testcase_21	AC	395 ms 9,600 KB
testcase_22	AC	564 ms 9,728 KB
testcase_23	AC	18 ms 6,944 KB
testcase_24	AC	764 ms 11,136 KB
testcase_25	AC	15 ms 6,944 KB
testcase_26	AC	796 ms 9,600 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	137 ms 12,800 KB
testcase_29	AC	715 ms 12,800 KB

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

ソースコード

raw source code

import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# source: https://github.com/kemuniku/cplib/tree/main/src/cplib/tmpl/citrus.nim
ImportExpand "cplib/tmpl/citrus" <=== "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    when not declared CPLIB_UTILS_CONSTANTS:\n        const CPLIB_UTILS_CONSTANTS* = 1\n        const INF32*: int32 = 100100111.int32\n        const INF64*: int = int(3300300300300300491)\n    \n    const INFL = INF64\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 = INF64): 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    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    \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"
# source: https://github.com/kemuniku/cplib/tree/main/src/cplib/utils/bititers.nim
ImportExpand "cplib/utils/bititers" <=== "when not declared CPLIB_UTILS_BITITERS:\n    const CPLIB_UTILS_BITITERS* = 1\n    import bitops\n    iterator bitcomb*(n, r: int): int =\n        var x = (1 shl r)-1\n        while true:\n            yield x\n            var t = x or (x-1)\n            x = (t+1) or (((not t and - not t) - 1) shr (x.countTrailingZeroBits() + 1))\n            if x >= (1 shl n):\n                break\n\n    iterator bitsubseteq*(bits: int): int =\n        var i = 0\n        while true:\n            yield i\n            if bits == i:\n                break\n            i = (i-bits) and bits\n    iterator bitsubset*(bits: int): int =\n        var i = 0\n        while true:\n            yield i\n            i = (i-bits) and bits\n            if bits == i:\n                break\n    iterator bitsubseteq_descending*(bits: int): int =\n        var i = bits\n        while true:\n            yield i\n            if i == 0:\n                break\n            i = (i-1) and bits\n    iterator bitsubset_descending*(bits: int): int =\n        var i = bits\n        while true:\n            i = (i-1) and bits\n            yield i\n            if i == 0:\n                break\n\n\n    iterator bitsuperseteq*(bits, n: int): int =\n        var i = bits\n        while true:\n            yield i\n            i = (i+1) or bits\n            if i >= (1 shl n):\n                break\n    iterator bitsuperset*(bits, n: int): int =\n        var i = bits\n        while true:\n            i = (i+1) or bits\n            if i >= (1 shl n):\n                break\n            yield i\n\n\n    iterator bitsingleton*(bits: int): int =\n        var i = bits and (-bits)\n        while true:\n            yield i\n            i = i and (not bits + (i shl 1))\n            if i == 0:\n                break\n\n    iterator standingbits*(bits: int): int =\n        #bits & (1<<i)が0でない値になるようなiを列挙します。\n        var i = bits and (-bits)\n        if i != 0:\n            while true:\n                yield fastLog2(i)\n                i = bits and (not bits + (i shl 1))\n                if i == 0:\n                    break\n"

{.checks: off.}

var n, m = input(int)
var e = input(int, n)
var vw = newSeqWith(m, input(int, int))

var wt = newSeqWith((1 << m), 0)
var vt = newSeqWith((1 << m), 0)
for bit in 0..<(1 << m):
    for i in 0..<m:
        if bit[i]: continue
        vt[bit | (1 << i)] = vt[bit] + vw[i][0]
        wt[bit | (1 << i)] = wt[bit] + vw[i][1]

var dp = newSeqWith(n+1, newSeqWith((1 << m), -INFL))
dp[0][0] = 0
for i in 0..<n:
    for bit in 0..<(1 << m):
        if dp[i][bit] == -INFL: continue
        for bn in bitsuperseteq(bit, m):
            if wt[bn ^ bit] > e[i]: continue
            dp[i+1][bn] = vt[bn]
print(dp[^1].max)

var p = dp[^1].find(dp[^1].max)
var ans = newSeq[seq[int]]()
for i in countdown(n-1, 0):
    ans.add(newSeq[int]())
    for pn in bitsubset(p):
        if dp[i][pn] >= 0 and wt[p ^ pn] <= e[i]:
            for x in standingbits(p ^ pn):
                ans[^1].add(x+1)
            p = pn
            break

ans.reverse
for row in ans:
    if row.len == 0:
        print(0)
    else:
        print(row.len, row)

yukicoder

結果

テストケース

ソースコード