結果

問題 No.594 壊れた宝物発見機
ユーザー dot_haraaidot_haraai
提出日時 2021-06-09 23:46:53
言語 Nim
(2.0.2)
結果
AC  
実行時間 104 ms / 2,000 ms
コード長 1,464 bytes
コンパイル時間 4,507 ms
コンパイル使用メモリ 76,172 KB
実行使用メモリ 24,360 KB
平均クエリ数 79.00
最終ジャッジ日時 2023-09-24 10:35:36
合計ジャッジ時間 6,817 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 101 ms
24,060 KB
testcase_01 AC 100 ms
23,688 KB
testcase_02 AC 103 ms
24,060 KB
testcase_03 AC 103 ms
23,388 KB
testcase_04 AC 102 ms
24,060 KB
testcase_05 AC 103 ms
23,232 KB
testcase_06 AC 99 ms
23,544 KB
testcase_07 AC 100 ms
24,060 KB
testcase_08 AC 100 ms
23,688 KB
testcase_09 AC 99 ms
24,360 KB
testcase_10 AC 100 ms
23,652 KB
testcase_11 AC 101 ms
24,348 KB
testcase_12 AC 102 ms
23,412 KB
testcase_13 AC 104 ms
23,412 KB
testcase_14 AC 103 ms
24,264 KB
testcase_15 AC 100 ms
23,412 KB
testcase_16 AC 102 ms
23,616 KB
testcase_17 AC 100 ms
23,424 KB
testcase_18 AC 99 ms
23,676 KB
testcase_19 AC 99 ms
24,324 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



# -100 <= x <= 100
# -100 <= y <= 100
# -100 <= z <= 100

# 軸を分けてフィボナッチサーチをすればいいな



proc solve()=
  var
    cod = @[0,0,0]


  proc eval(idx,x:int):int=
    var t = cod
    t[idx] = x
    echo fmt"? {t[0]} {t[1]} {t[2]}"
    return scan()
      

  proc fibSearch(idx:int,lo:int,hi:int):int=
    var
      fib = newseqwith(2,1)
      hi=hi
      lo=lo
      m = 0
    #echo lo,", ", hi
    fib[0]=0
    while fib[fib.len-1] < hi-lo+1:
      fib.add(fib[fib.len-1]+fib[fib.len-2])
    m = fib.len-1
    #echo "m:",m
    while m>=2:
      var
        x1 = lo+fib[m-2]
        x2 = lo+fib[m-1]
        y1 = eval(idx,x1)
        y2 = eval(idx,x2)
      #echo fmt"{lo}, {x1}({x1-lo}), {x2}({x2-lo}), {fib[m]}"
      if y1>=y2:
        lo=lo+fib[m-2]
      
      m -= 1
    return lo

  for i in 0..<3:
    cod[i] = fibSearch(i,-150,150)
  echo fmt"! {cod[0]} {cod[1]} {cod[2]}"
  return
solve()
0