結果

問題 No.1251 絶対に間違ってはいけない最小化問題
ユーザー dot_haraaidot_haraai
提出日時 2021-03-21 14:09:18
言語 Nim
(2.0.2)
結果
RE  
実行時間 -
コード長 1,281 bytes
コンパイル時間 4,666 ms
コンパイル使用メモリ 86,844 KB
実行使用メモリ 11,904 KB
最終ジャッジ日時 2024-05-01 23:03:40
合計ジャッジ時間 17,330 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 1 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 1 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 AC 12 ms
5,376 KB
testcase_22 RE -
testcase_23 AC 9 ms
5,376 KB
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 AC 9 ms
5,376 KB
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 AC 1 ms
5,376 KB
testcase_44 AC 1 ms
5,376 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, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [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()=
  var
    n = scan()
    a = newseqwith(n,scan())
    b = newseqwith(n,scan())

  proc eval(x:int):int=
    result = 0
    for i in 0..<n:
      result+=b[i]*abs(a[i]-x)
  
  
  proc fibSearch(lo:int,hi:int):int=
    var
      fib = newseqwith(2,1)
      hi=hi
      lo=lo
      m = 0
    
    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
    while m>=2:
      var
        x1 = lo+fib[m-2]
        x2 = lo+fib[m-1]
        y1 = eval(x1)
        y2 = eval(x2)
      #echo fmt"{lo}, {x1}({x1-lo}), {x2}({x2-lo}), {fib[m]}"
      if y1>=y2:
        lo=lo+fib[m-2]
      
      m -= 1
    return lo

  var t= fibSearch(-10^9,10^9)
  echo t, " ", eval(t)

  return 


  
solve()
0