結果

問題 No.1187 皇帝ペンギン
ユーザー dot_haraai
提出日時 2021-03-22 21:39:43
言語 Nim
(2.2.0)
結果
AC  
実行時間 24 ms / 1,000 ms
コード長 1,078 bytes
コンパイル時間 5,835 ms
コンパイル使用メモリ 87,008 KB
実行使用メモリ 25,580 KB
平均クエリ数 16.44
最終ジャッジ日時 2024-07-17 11:04:44
合計ジャッジ時間 9,438 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 54
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(1, 25) Warning: imported and not used: 'sequtils' [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]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [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')



proc solve():int=
  proc ask(x:int):bool=
    echo fmt"? {x}"
    var v = read()
    if v=="out":
      return false
    else:
      return true

  proc binsearch(left,right:int):int=
    if left+1==right:
      return left
    else:
      var mid = (left+right).div(2)
      if not ask(mid):
        mid+=1
        if not ask(mid):
          return binsearch(left,mid-1)
        else:
          return binsearch(mid,right)
      else:
        return binsearch(mid,right)
  return binsearch(0,10^3+1)



      


    

  

  
echo fmt"! {solve()}"
0