結果
| 問題 | No.3378 Go Board |
| コンテスト | |
| ユーザー |
 seekworser
|
| 提出日時 | 2026-03-19 02:28:59 |
| 言語 | Nim (2.2.6) |
| 結果 |
AC
|
| 実行時間 | 101 ms / 2,000 ms |
| コード長 | 10,908 bytes |
| 記録 | |
| コンパイル時間 | 4,008 ms |
| コンパイル使用メモリ | 94,652 KB |
| 実行使用メモリ | 14,592 KB |
| 最終ジャッジ日時 | 2026-03-19 02:29:10 |
| 合計ジャッジ時間 | 9,338 ms |
|
ジャッジサーバーID （参考情報） |
judge1_0 / judge2_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 22 |
ソースコード
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 = 1001000027.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"
# {.checks: off.}
proc solve() =
var n,k = input(int)
if k < min(n, 3) or 2*k > n*n:
No()
return
Yes()
proc check(ans: seq[string]): bool =
var seen = newseqwith(n, newseqwith(n, false))
var total = 0
for i in 0..<n:
for j in 0..<n:
if seen[i][j] or ans[i][j] != '#': continue
proc dfs(x, y: int): int =
if seen[x][y]: return 0
seen[x][y] = true
var m = 1
for (dx, dy) in DXY:
if x+dx notin 0..<n or y+dy notin 0..<n or ans[x+dx][y+dy] != '#': continue
m += dfs(x+dx, y+dy)
return m
total += dfs(i, j)
debug(total)
if total != k: return false
var w = 0
for i in 0..<n:
for j in 0..<n:
if ans[i][j] != '.': continue
proc check(): bool =
for (dx, dy) in DXY:
if i+dx notin 0..<n or j+dy notin 0..<n: continue
if ans[i+dx][j+dy] == '#': return true
return false
if check():
w += 1
debug(w)
return w == k
if k < n:
var ans = newseqwith(n, newseqwith(n, ".").join(""))
for j in 0..<k-1:
ans[0][j] = '#'
ans[1][0] = '#'
assert(check(ans))
for row in ans:
print(row)
return
var a = newSeqWith(n+1, newSeqWith(n, -1))
var s = n * (n+1) - 2 * k
for i in 0..n:
for j in 0..<n:
if s > 0:
a[i][j] = 2
s -= 1
for i in 0..n:
for j in 0..<n:
if a[i][j] != -1: continue
for (dx, dy) in DXY:
if i+dx in 0..n and j+dy in 0..<n and a[i+dx][j+dy] == 2:
a[i][j] = 1
var cnt = 0
for i in 0..n:
for j in 0..<n:
if a[i][j] != -1: continue
for (dx, dy) in DXY:
if i+dx in 0..n and j+dy in 0..<n and a[i+dx][j+dy] == 1:
a[i][j] = 0
cnt += 1
break
debug(cnt)
for i in 0..n:
for j in 0..<n:
if a[i][j] != -1: continue
var total = 0
for (dx, dy) in DXY:
if i+dx in 0..n and j+dy in 0..<n and a[i+dx][j+dy] == 0:
total += 1
debug(i, j, total)
if total >= 2:
a[i][j] = 0
cnt += 1
break
debug(cnt)
if k >= 2*n:
for j in countup(1, n-1, 3):
var found = false
for i in 0..n:
if a[i][j] == 0: found = true
if a[i][j] == -1 and found:
a[i][j] = 0
cnt += 1
if n % 3 == 1:
var found = false
for i in 0..n:
if a[i][^1] == 0: found = true
if a[i][^1] == -1 and found and cnt < k:
a[i][^1] = 0
cnt += 1
for row in a: debug(row)
debug("---")
debug(cnt)
for i in countdown(n, 0):
for j in countdown(n-1, 0):
if a[i][j] == -1 and cnt < k:
cnt += 1
a[i][j] = 0
var ans = newseqwith(n, "")
for i in 1..n:
for j in 0..<n:
if a[i][j] == 0: ans[i-1] &= "#"
else: ans[i-1] &= "."
for row in ans:
print(row)
assert(check(ans))
var t = input(int)
for _ in 0..<t: solve()