結果
問題 | No.8113 How Many Liars Are There? |
ユーザー |
👑 |
提出日時 | 2024-04-01 16:56:09 |
言語 | Nim (2.2.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 11,237 bytes |
コンパイル時間 | 4,152 ms |
コンパイル使用メモリ | 92,820 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-30 21:55:26 |
合計ジャッジ時間 | 5,491 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 43 WA * 17 |
ソースコード
import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])# lower and upper only, must be WA# {.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 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 constDDXY* = [(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/collections/unionfind.nim" <=== "when not declared CPLIB_COLLECTIONS_UNIONFIND:\n const CPLIB_COLLECTIONS_UNIONFIND* = 1\nimport 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 =\nif self.par_or_siz[x] < 0:\n return x\n else:\n self.par_or_siz[x] = self.root(self.par_or_siz[x])\nreturn 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"ImportExpand "cplib/collections/defaultdict.nim" <=== "when not declared CPLIB_COLLECTIONS_DEFAULTDICT:\n const CPLIB_COLLECTIONS_DEFAULTDICT* =1\n import tables\n import hashes\n type DefaultDict*[K, V] = object\n table: Table[K, V]\n default: V\n procinitDefaultDict*[K, V](default: V): DefaultDict[K, V] = DefaultDict[K, V](table: initTable[K, V](), default: default)\n proc `==`*[K, V](src,dst: DefaultDict[K, V]): bool = src.table == dst.table\n proc `[]=`*[K, V](d: var DefaultDict[K, V], key: K, val: V) = d.table[key] = val\nproc `[]`*[K, V](d: DefaultDict[K, V], key: K): V =\n if key notin d.table: return d.default()\n return d.table[key]\n proc `[]`*[K, V](d: var DefaultDict[K, V], key: K): var V =\n if key notin d.table: d.table[key] = d.default\n return d.table[key]\n procclear*[K, V](d: var DefaultDict[K, V]) = d.table = initTable[K, V](0)\n proc contains*[K, V](d: var DefaultDict[K, V], key: K): bool = d.table.contains(key)\n proc del*[K, V](d: var DefaultDict[K, V], key: K) = d.table.del(key)\n proc hash*[K, V](d: DefaultDict[K, V]): Hash = d.table.hash\n proc hasKey*[K, V](d: DefaultDict[K, V], key: K): bool = d.table.hasKey(key)\n proc len*[K, V](d: DefaultDict[K, V]): int = d.table.len\n proc pop*[K, V](d: var DefaultDict, key: K, val: var V): bool = d.table.pop(key, val)\n proc take*[K, V](d: var DefaultDict,key: K, val: var V): bool = d.table.pop(key, val)\n proc toDefaultDict*[K, V](pairs: openArray[(K, V)], default: V): DefaultDict[K, V] =\nresult = initDefaultDict[K, V](default)\n result.table = pairs.toTable\n proc toDefaultDict*[K, V](table: Table[K, V], default: V):DefaultDict[K, V] =\n result = initDefaultDict[K, V](default)\n result.table = table\n iterator pairs*[K, V](d: DefaultDict[K, V]): (K, V) =\n for k, v in d.table: yield (k, v)\n proc `$`*[K, V](d: DefaultDict[K, V]): string = $(d.table)\n"proc solve1(n, k: int, p, a: seq[int]) =var uf = initUnionFind(n)for i in 0..<n: uf.unite(i, p[i])var d = initDefaultDict[int, seq[int]](newSeq[int]())for i in 0..<n:d[uf.root(i)].add(i)var mn = 0var mx = 0for k, v in d:var x = v.mapIt(a[it]).count(1)var y = v.len * 2 - (v.mapIt(a[it]).count(0) + 3) // 4debug(k, v, x, y)mn += xmx += y# for item in v:# debug(k, v)debug(mn, mx)Yes(k in mn..mx)proc solve2(n, k: int, p, a: seq[int]) =for bit in 0..<(1 << n):var cnt = bit.popcountfor i in 0..<n:if (bit[i] xor bit[p[i]] xor (a[i] == 1)): cnt += 1if cnt == k:Yes()returnNo()proc solve() =var n, k = input(int)var p = input(int, n).mapIt(it-1)var a = input(int, n)if n <= 20: solve2(n, k, p, a)else: solve1(n, k, p, a)solve()