結果

問題 No.1286 Stone Skipping
ユーザー dot_haraai
提出日時 2021-06-20 02:41:04
言語 Nim
(2.2.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,190 bytes
コンパイル時間 3,006 ms
コンパイル使用メモリ 85,888 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-22 22:24:06
合計ジャッジ時間 4,013 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 26) Warning: imported and not used: 'strformat' [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]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [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()=
  var d = scan()

  proc eval(x,k:int):int=
    var x = x
    result = 0
    for i in 0..<k:
      result+=x
      x = x.div(2)

  proc binsearch(left,right,skip:int,search:int):int=
    if left+1==right:
      return right
    var
      mid = (left+right).div(2)
    if eval(mid,skip)>=search:
      return binsearch(left,mid,skip,search)
    else:
      return binsearch(mid,right,skip,search)

    

  var ans = int.high

  for skip in 1..64:
    if eval(1,skip)==d:
      #echo 1,",",skip,",",eval(1,skip)
      ans.min=1
    else:
      var t = binsearch(1,10^18,skip,d)
      if eval(t,skip)==d:
        ans.min=t
  echo ans






solve()
0