#313226 (Nim) No.594 壊れた宝物発見機

• 問題: No.594 壊れた宝物発見機
• ユーザー: むらため
• 提出日時: 2019-01-27 17:21:46
• 言語: Nim (2.0.2)
• 結果: AC
• 実行時間: 117 ms / 2,000 ms
• コード長: 1,458 bytes
• コンパイル時間: 3,295 ms
• コンパイル使用メモリ: 62,512 KB
• 実行使用メモリ: 25,232 KB
• 平均クエリ数: 71.25
• 最終ジャッジ日時: 2024-07-16 16:37:54
• 合計ジャッジ時間: 7,046 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	116 ms; 24,836 KB
testcase_01	AC	116 ms; 25,220 KB
testcase_02	AC	113 ms; 24,836 KB
testcase_03	AC	112 ms; 24,836 KB
testcase_04	AC	114 ms; 25,220 KB
testcase_05	AC	114 ms; 25,220 KB
testcase_06	AC	114 ms; 24,580 KB
testcase_07	AC	117 ms; 25,220 KB
testcase_08	AC	114 ms; 24,580 KB
testcase_09	AC	113 ms; 25,232 KB
testcase_10	AC	116 ms; 24,848 KB
testcase_11	AC	112 ms; 24,848 KB
testcase_12	AC	116 ms; 24,592 KB
testcase_13	AC	113 ms; 25,232 KB
testcase_14	AC	112 ms; 25,232 KB
testcase_15	AC	114 ms; 24,592 KB
testcase_16	AC	114 ms; 24,976 KB
testcase_17	AC	114 ms; 25,232 KB
testcase_18	AC	113 ms; 24,848 KB
testcase_19	AC	114 ms; 24,848 KB

コンパイルメッセージ

/home/judge/data/code/Main.nim(1, 27) Warning: imported and not used: 'math' [UnusedImport]
/home/judge/data/code/Main.nim(1, 17) Warning: imported and not used: 'algorithm' [UnusedImport]

ソースコード

import sequtils,algorithm,math,tables,sugar
template times*(n:int,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)

proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': break
    result = 10 * result + k.ord - '0'.ord


proc request(x,y,z:int):int =
  echo "? ",x," ",y," ",z
  # let a = (x:37,y: -150,z:40)
  # return (a.x-x)*(a.x-x)+(a.y-y)*(a.y-y)+(a.z-z)*(a.z-z) * 5 + 10
  return scan()
proc decide(x,y,z:int) =
  echo "! ",x," ",y," ",z
  quit(0)

proc decideVal(request:proc(x:int):int) : int =
  var ax = -150
  var bx = 150
  var answers = newTable[int,int]()
  proc req(x:int) :int =
    if x in answers : return answers[x]
    answers[x] = request(x)
    return answers[x]
  while true:
    let mx = (ax + bx) div 2
    var ad = req(ax)
    var bd = req(bx)
    let md = req(mx)
    if md < ad :
      ax = (mx + ax) div 2
    if md < bd :
      bx = (mx + bx) div 2
    if bx - ax == 0 : return ax
    if bx - ax == 1:
      if req(ax) < req(bx) : return ax
      return bx
    if bx - ax <= 3:
      let A = toSeq(ax..bx).mapIt((it,req(it)))
      let dMin = A.mapIt(it[1]).min()
      for a in A:
        if a[1] == dMin: return a[0]

var (x,y,z) = (0,0,0)
x = decideVal( x => request(x,y,z))
y = decideVal( y => request(x,y,z))
z = decideVal( z => request(x,y,z))
decide(x,y,z)