#965410 (Nim) No.3113 How Many Liars Are There?

提出ソース

結果

問題	No.3113 How Many Liars Are There?
ユーザー	👑 seekworser
提出日時	2024-03-29 20:25:04
言語	Nim (2.0.2)
結果	WA (最新) AC (最初)
実行時間	-
コード長	8,615 bytes
コンパイル時間	5,859 ms
コンパイル使用メモリ	93,568 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-09-30 21:55:00
合計ジャッジ時間	7,798 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,820 KB
testcase_02	AC	1 ms 6,820 KB
testcase_03	AC	1 ms 6,816 KB
testcase_04	AC	10 ms 6,816 KB
testcase_05	WA	-
testcase_06	AC	9 ms 6,820 KB
testcase_07	WA	-
testcase_08	AC	7 ms 6,820 KB
testcase_09	AC	5 ms 6,816 KB
testcase_10	AC	8 ms 6,816 KB
testcase_11	AC	3 ms 6,816 KB
testcase_12	AC	9 ms 6,816 KB
testcase_13	AC	4 ms 6,816 KB
testcase_14	AC	27 ms 6,816 KB
testcase_15	AC	37 ms 6,820 KB
testcase_16	AC	12 ms 6,816 KB
testcase_17	WA	-
testcase_18	AC	13 ms 6,816 KB
testcase_19	WA	-
testcase_20	AC	2 ms 6,816 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	3 ms 6,816 KB
testcase_24	WA	-
testcase_25	AC	2 ms 6,816 KB
testcase_26	AC	1 ms 6,820 KB
testcase_27	AC	2 ms 6,816 KB
testcase_28	AC	2 ms 6,820 KB
testcase_29	AC	2 ms 6,816 KB
testcase_30	AC	8 ms 6,816 KB
testcase_31	AC	2 ms 6,820 KB
testcase_32	AC	3 ms 6,820 KB
testcase_33	WA	-
testcase_34	AC	2 ms 6,816 KB
testcase_35	WA	-
testcase_36	AC	4 ms 6,816 KB
testcase_37	AC	2 ms 6,816 KB
testcase_38	AC	6 ms 6,816 KB
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	AC	4 ms 6,816 KB
testcase_43	AC	6 ms 6,816 KB
testcase_44	AC	1 ms 6,816 KB
testcase_45	WA	-
testcase_46	AC	1 ms 6,816 KB
testcase_47	AC	1 ms 6,816 KB
testcase_48	WA	-
testcase_49	AC	2 ms 6,816 KB
testcase_50	AC	2 ms 6,816 KB
testcase_51	AC	1 ms 6,820 KB
testcase_52	AC	1 ms 6,820 KB
testcase_53	AC	1 ms 6,820 KB
testcase_54	AC	1 ms 6,820 KB
testcase_55	AC	2 ms 6,820 KB
testcase_56	WA	-
testcase_57	AC	2 ms 6,816 KB
testcase_58	AC	1 ms 6,816 KB
testcase_59	AC	1 ms 6,820 KB
testcase_60	AC	2 ms 6,816 KB
testcase_61	AC	2 ms 6,816 KB
testcase_62	AC	2 ms 6,820 KB
testcase_63	AC	1 ms 6,816 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"

var n, k = input(int)
var p = input(int, n).mapit(it-1)
var a = input(int, n)

proc solve(a: seq[int]): seq[int] =
    var n = a.len
    var dp = newSeqWith(2, newSeqWith(2, newSeqWith(2*n+1, false)))
    dp[0][0][0] = true
    dp[1][1][1] = true
    for i in 0..<n-1:
        var dpn = newSeqWith(2, newSeqWith(2, newSeqWith(2*n+1, false)))
        for j in 0..<2:
            for k in 0..<2:
                for x in 0..2*n:
                    if dp[j][k][x] == false: continue
                    # debug(i, j, k, x)
                    if (a[i] ^ k) == 0:
                        dpn[j][0][x] = true
                        dpn[j][1][x+2] = true
                    else:
                        dpn[j][0][x+1] = true
                        dpn[j][1][x+1] = true
        swap(dp, dpn)
    for i in 0..2*n:
        for j in 0..<2:
            for k in 0..<2:
                if not dp[j][k][i]: continue
                # debug(i, j, k)
                result.add(i + (j ^ k ^ a[^1]))
    result = result.sorted.deduplicate(true)

var seen = newSeqWith(n, false)
var b = newSeq[seq[int]]()
for i in 0..<n:
    if seen[i]: continue
    var x = i
    var an = newSeq[int]()
    while not seen[x]:
        an.add(a[x])
        seen[x] = true
        x = p[x]
    debug(i, an)
    b.add(solve(an))
    debug(b[^1])

var dp = newSeqWith(k+1, false)
dp[0] = true
for i in 0..<b.len:
    var dpn = newSeqWith(k+1, false)
    for x in b[i]:
        for j in 0..k-x:
            if dp[j]: dpn[j+x] = true
    swap(dp, dpn)
Yes(dp[^1])

yukicoder

結果

テストケース

ソースコード