結果

問題 No.859 路線A、路線B、路線C
ユーザー nadeshino
提出日時 2019-08-09 22:17:49
言語 Nim
(2.2.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,412 bytes
コンパイル時間 895 ms
コンパイル使用メモリ 71,812 KB
最終ジャッジ日時 2024-11-14 21:32:39
合計ジャッジ時間 1,406 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
stack trace: (most recent call last)
Main.nim(7, 9)           unpack
/home/judge/data/code/Main.nim(33, 21) template/generic instantiation of `scan` from here
/home/judge/data/code/Main.nim(13, 44) template/generic instantiation of `unpack` from here
/home/judge/data/code/Main.nim(7, 9) Error: index 1 not in 0 .. 0

ソースコード

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

#import algorithm, future, macros, math, sequtils, sets, strutils, tables
import algorithm, sugar, macros, math, sequtils, sets, strutils, tables
macro unpack(rhs: seq, cnt: static[int]): auto =
  let t = genSym(); result = quote do:(let `t` = `rhs`;())
  if NimMinor <= 17:
    for i in 0..<cnt: result[0][1].add(quote do:`t`[`i`])
  else:
    for i in 0..<cnt: result[1].add(quote do:`t`[`i`])
template scan(T: typedesc, cnt: Natural = 1): untyped =
  let line = stdin.readLine.split(" ")
  when T is int:         line.map(parseInt).unpack(cnt)
  elif T is float:       line.map(parseFloat).unpack(cnt)
  elif T is string:      line.unpack(cnt)
  elif T is char:        line.mapIt(it[0]).unpack(cnt)
  elif T is seq[int]:    line.map(parseint)
  elif T is seq[float]:  line.map(parseFloat)
  elif T is seq[string]: line
  elif T is seq[char]:   line.mapIt(it[0])
proc `%=`(n: var int, m: int)  = n = n mod m
proc `//=`(n: var int, m: int) = n = n div m
proc `<<=`(n: var int, m: int) = n = n shl m
proc `>>=`(n: var int, m: int) = n = n shr m
proc `<?=`(n: var int, m: int) = n = min(n, m)
proc `>?=`(n: var int, m: int) = n = max(n, m)
proc newSeq2[T](n1, n2: Natural): seq[seq[T]] = newSeqWith(n1, newSeq[T](n2))
proc newSeq3[T](n1, n2, n3: Natural): seq[seq[seq[T]]] = newSeqWith(n1, newSeqWith(n2, newSeq[T](n3)))
# -------------------------------------------------- #
var (x, y, z) = scan(int, 3)
var data = scan(string, 2)
var S0 = data[0]
var t0 = data[1].parseInt()
var data2 = scan(string, 2)
var S1 = data2[0]
var t1 = data2[1].parseInt()
if S0 == S1:
  var p: int
  var LR: int
  case S0:
    of "A":
      p = x
      LR = min(y, z) - 1
    of "B":
      p = y
      LR = min(z, x) - 1
    of "C":
      p = z
      LR = min(x, y) - 1
    else:
      discard
  if t0 > t1:
    swap(t0, t1)
  var SL = t0 - 1
  var RG = p - t1
  echo min(abs(t0 - t1), SL + LR + RG + 2)
else:
  var p, q: int
  case S0:
    of "A":
      p = x
    of "B":
      p = y
    of "C":
      p = z
    else:
      discard
  case S1:
    of "A":
      q = x
    of "B":
      q = y
    of "C":
      q = z
    else:
      discard
  var r = (x + y + z) - (p + q)
  var SL = t0 - 1
  var SR = p - t0
  var LG = t1 - 1
  var RG = q - t1
  var LR = r - 1
  # echo p
  # echo q
  # echo r
  # echo SL
  # echo SR
  # echo LG
  # echo RG
  # echo LR
  echo min([SL + LG + 1, SR + RG + 1, SL + LR + RG + 2, SR + LR + LG + 2])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0