結果

問題 No.367 ナイトの転身
ユーザー むらためむらため
提出日時 2019-02-04 23:29:24
言語 Nim
(2.0.2)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 3,044 bytes
コンパイル時間 3,324 ms
コンパイル使用メモリ 70,488 KB
実行使用メモリ 8,516 KB
最終ジャッジ日時 2023-09-14 03:29:40
合計ジャッジ時間 3,895 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,396 KB
testcase_01 AC 1 ms
5,380 KB
testcase_02 AC 2 ms
5,404 KB
testcase_03 AC 2 ms
5,380 KB
testcase_04 AC 2 ms
5,444 KB
testcase_05 AC 1 ms
5,360 KB
testcase_06 AC 2 ms
5,392 KB
testcase_07 AC 1 ms
5,396 KB
testcase_08 AC 2 ms
5,372 KB
testcase_09 AC 1 ms
5,372 KB
testcase_10 AC 17 ms
8,464 KB
testcase_11 AC 24 ms
8,516 KB
testcase_12 AC 5 ms
6,008 KB
testcase_13 AC 6 ms
6,200 KB
testcase_14 AC 16 ms
6,984 KB
testcase_15 AC 2 ms
5,380 KB
testcase_16 AC 17 ms
6,940 KB
testcase_17 AC 4 ms
5,672 KB
testcase_18 AC 5 ms
5,868 KB
testcase_19 AC 5 ms
5,864 KB
testcase_20 AC 2 ms
5,588 KB
testcase_21 AC 5 ms
5,900 KB
testcase_22 AC 2 ms
5,400 KB
testcase_23 AC 2 ms
5,436 KB
testcase_24 AC 2 ms
5,520 KB
testcase_25 AC 2 ms
5,472 KB
testcase_26 AC 2 ms
5,444 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sequtils,times#,nimprof
type Pos = tuple[x,y:int16]
template stopwatch(body) = (let t1 = cpuTime();body;stderr.writeline "TIME:",(cpuTime() - t1) * 1000,"ms")
proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': return
    result = 10 * result + k.ord - '0'.ord
let h = scan()
let w = scan()
var M : array[500,array[500,bool]]
const INF = int16.high
var DP : array[500,array[500,array[2,int16]]]
var s : Pos
var g : Pos
for y in 0..<h:
  for x in 0..<w:
    let k = getchar_unlocked()
    if k == 'S' : s = (x.int16,y.int16)
    elif k == 'G' : g = (x.int16,y.int16)
    M[x][y] = k == 'R'
  discard getchar_unlocked()
DP[s.x][s.y][0] = -INF
type Queue[CNT:static[int],T] = object
  data : array[CNT,T]
  l,r:int
template enqueue[CNT,T](q:var Queue[CNT,T],val:T) =
  q.data[q.r] = val
  q.r += 1
proc dequeue[CNT,T](q:var Queue[CNT,T]) : T =
  q.l += 1
  return q.data[q.l - 1]
template size[CNT,T](q:var Queue[CNT,T]) : int = q.r - q.l

var Q : Queue[500*500*2+100,uint64] # tuple[x,y,isKnight,d:int16]
template en(a,b,c,d:int16):uint64 = (cast[uint64](a) shl 48) or (cast[uint64](b) shl 32) or (cast[uint32](c) shl 16) or cast[uint16](d)
Q.enqueue(en(s.x,s.y,1.int16,-INF))
let D : seq[seq[Pos]] = @[
  @[(1,1),(-1,-1),(1,-1),(-1,1)],
  @[(1,2),(2,1),(-1,-2),(-2,-1),(-1,2),(-2,1),(1,-2),(2,-1)],
].mapIt(it.mapIt((it[0].int16,it[1].int16)))
proc sign(n:int):int = (if n < 0 : -1 else: 1)
let D2  : seq[seq[Pos]] = @[
  @[(1,1)],
  @[(1,2),(2,1)],
].mapIt(it.mapIt(((it[0] * sign(g.x - s.x)).int16,(it[1] * sign(g.y - s.y)).int16)))
stopwatch:
  proc solve() : bool  =
    while Q.size() > 0:
      let qe = Q.dequeue()
      let x = cast[int16](qe shr 48)
      let y = cast[int16](qe shr 32)
      let isKnight = cast[int16](qe shr 16)
      let diff = cast[int16](qe)
      let nextDiff = diff + 1
      if w > 400 and h > 400 and abs(x - w) > 50 and abs(y - h) > 50 and 3 < x and x < w - 4 and 3 < y and y < h - 4:
        for i in 0..<(1 + isKnight):
          let nx = x + D2[isKnight][i].x
          let ny = y + D2[isKnight][i].y
          if nx == g.x and ny == g.y :
            echo nextDiff + INF
            return true
          let nextIsKnight = if M[nx][ny]: 1 - isKnight else: isKnight
          if DP[nx][ny][nextIsKnight] <= nextDiff: continue
          DP[nx][ny][nextIsKnight] = nextDiff
          Q.enqueue(en(nx,ny,nextIsKnight,nextDiff))
      else:
        for i in 0..<(4 + isKnight * 4):
          let nx = x + D[isKnight][i].x
          let ny = y + D[isKnight][i].y
          if nx < 0 or ny < 0 or nx >= w or ny >= h : continue
          if nx == g.x and ny == g.y :
            echo nextDiff + INF
            return true
          let nextIsKnight = if M[nx][ny]: 1 - isKnight else: isKnight
          if DP[nx][ny][nextIsKnight] <= nextDiff: continue
          DP[nx][ny][nextIsKnight] = nextDiff
          Q.enqueue(en(nx,ny,nextIsKnight,nextDiff))
    return false
  if not solve(): echo -1
0