結果

問題 No.8113 How Many Liars Are There?
ユーザー 👑 seekworser
提出日時 2024-04-01 15:33:12
言語 Nim
(2.2.0)
結果
AC  
実行時間 307 ms / 2,000 ms
コード長 18,825 bytes
コンパイル時間 5,686 ms
コンパイル使用メモリ 95,232 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-01 17:07:50
合計ジャッジ時間 12,140 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 60
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 "cplib/graph/graph.nim" <=== "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[(int, T)]]\n N*: int\n type StaticGraph*[T] = ref
    object 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]\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 DynamicGraphs* = DynamicGraph or WeightedDirectedGraph or WeightedUnDirectedGraph or UnWeightedDirectedGraph or
    UnWeightedUnDirectedGraph\n # type StaticGraphs* = StaticGraph or WeightedDirectedStaticGraph or WeightedUnDirectedStaticGraph or
    UnWeightedDirectedStaticGraph or UnWeightedUnDirectedStaticGraph\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\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 =\n
     result = 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: WeightedGraph[T]): int = G.N\n proc len*(G: UnWeightedGraph): int = G.N\n\n
    iterator `[]`*[T](g: WeightedDirectedGraph[T] or WeightedUnDirectedGraph[T], x: int): (int, T) =\n for e in g.edges[x]: yield e\n
    iterator `[]`*(g: UnWeightedDirectedGraph or UnWeightedUnDirectedGraph, 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:
    WeightedDirectedStaticGraph[T] or WeightedUnDirectedStaticGraph[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\n g.elist[g.start[u]] = (v, g
    .cost[i])\n\n proc build*(g: UnWeightedDirectedStaticGraph or UnWeightedUnDirectedStaticGraph) =\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, int)](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\n proc initWeightedDirectedStaticGraph*(N: int, edgetype: typedesc = int, capacity: int = 0):
    WeightedDirectedStaticGraph[edgetype] =\n result = WeightedDirectedStaticGraph[edgetype](\n src: newSeqOfCap[int](capacity),\n
     dst: newSeqOfCap[int](capacity),\n cost: newSeqOfCap[edgetype](capacity),\n elist: newSeq[(int, edgetype)](0),\n
     start: 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: 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[int](capacity),\n dst: newSeqOfCap[int](capacity),\n cost: newSeqOfCap[int](capacity),\n
     elist: newSeq[(int, int)](0),\n start: newSeq[int](0),\n N: 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[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"
ImportExpand "cplib/collections/unionfind.nim" <=== "when not declared CPLIB_COLLECTIONS_UNIONFIND:\n const CPLIB_COLLECTIONS_UNIONFIND* = 1\n
    import algorithm\n import sequtils\n type UnionFind = ref object\n count*: int\n par_or_siz: seq[int]\n proc initUnionFind
    *(N: int): UnionFind =\n result = UnionFind(count: N, par_or_siz: newSeqwith(N, -1))\n proc root*(self: UnionFind, x: int): int =\n
     if self.par_or_siz[x] < 0:\n return x\n else:\n self.par_or_siz[x] = self.root(self.par_or_siz[x])\n
    return self.par_or_siz[x]\n proc issame*(self: UnionFind, x: int, y: int): bool =\n return self.root(x) == self.root(y)\n proc unite
    *(self: UnionFind, x: int, y: int) =\n var x = self.root(x)\n var y = self.root(y)\n if(x != y):\n if(self
    .par_or_siz[x] > self.par_or_siz[y]):\n swap(x, y)\n self.par_or_siz[x] += self.par_or_siz[y]\n self
    .par_or_siz[y] = x\n self.count -= 1\n proc siz*(self: UnionFind, x: int): int =\n var x = self.root(x)\n return -self
    .par_or_siz[x]\n"
var n, k = input(int)
var g = initWeightedDirectedStaticGraph(n, int)
var gd = initUnWeightedDirectedStaticGraph(n, n)
var p = input(int, n).mapIt(it-1)
var a = input(int, n)
for i in 0..<n:
g.add_edge(p[i], i, a[i])
gd.add_edge(i, p[i])
g.build
gd.build
var t = newSeq[seq[int]]()
proc find_cycle(x: int): (int, int) =
var u, v: int
var seen = newSeqWith(n, false)
proc dfs(x: int): bool =
seen[x] = true
for y in gd[x]:
if seen[y]:
u = x
v = y
return true
if dfs(y): return true
return false
discard dfs(x)
return (u, v)
var seen = newSeqWith(n, false)
for i in 0..<n:
if seen[i]: continue
var (u, v) = find_cycle(i)
proc cnt(u, v: int): HashSet[int] =
var cuv = (if p[u] == v: a[u] else: a[v])
proc dfs(x, par: int): seq[seq[HashSet[int]]] =
seen[x] = true
result = newSeqWith(2, newSeqWith(3, inithashset[int]()))
if x != v:
result[0][0].incl(0)
result[1][0].incl(1)
else:
result[0][1].incl(0)
result[1][2].incl(1)
for (y, cost) in g[x]:
if y == par: continue
if x == v and y == u: continue
var sh = dfs(y, x)
var rn = newSeqWith(2, newSeqWith(3, initHashSet[int]()))
for i in 0..<2:
for j in 0..<2:
for k in 0..<3:
for l in 0..<3:
for s1 in result[i][k]:
for s2 in sh[j][l]:
rn[i][(k ^ l)].incl(s1 + s2 + (i ^ j ^ cost))
swap(result, rn)
for i in 0..<2:
for j in 0..<3:
debug(x, i, j, result[i][j])
debug(u, v)
var dp = dfs(u, -1)
result = initHashSet[int]()
for i in 0..<2:
for j in 1..<3:
if ((j-1) ^ i) != cuv:
for x in dp[i][j]: result.incl(x+1)
else:
for x in dp[i][j]: result.incl(x)
t.add(cnt(u, v).toSeq.sorted)
# print(st)
# print(t[^1])
var dp = newSeqWith(k+1, false)
dp[0] = true
for s in t:
var dpn = newSeqWith(k+1, false)
for x in s:
for i in 0..k-x:
if dp[i]: dpn[i+x] = true
swap(dp, dpn)
Yes(dp[k])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0