結果

問題 No.1251 絶対に間違ってはいけない最小化問題
ユーザー dot_haraaidot_haraai
提出日時 2021-03-21 13:11:51
言語 Nim
(2.2.0)
結果
WA  
実行時間 -
コード長 1,458 bytes
コンパイル時間 6,032 ms
コンパイル使用メモリ 86,400 KB
実行使用メモリ 11,776 KB
最終ジャッジ日時 2024-11-22 05:20:19
合計ジャッジ時間 20,817 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20 WA * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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,scanf())
    b = newseqwith(n,scanf())

  proc eval(x:float):float=
    result = 0
    for i in 0..<n:
      result+=b[i]*abs(a[i]-x)
  
  proc goldSearch(lo,hi:float):float=
    var
      lo = lo
      hi = hi
      phi = (1.0+sqrt(5.0))/2
      e:float = pow(10.0,(-8))
      x1:float
      x2:float
      y1:float
      y2:float
    

    while lo+e<hi:
      #echo fmt"{lo} ~ {hi}"
      x1 = (lo*phi+hi)/(1.0+phi)
      x2 = (lo+hi*phi)/(1.0+phi)
      y1 = eval(x1)
      y2 = eval(x2)

      if y1<y2:
        hi=x2
        x2=x1
        x1 =(lo*phi+hi)/(1.0+phi)
      else:
        lo=x1
        x1=x2
        x2=(lo+hi*phi)/(1.0+phi)

    return lo
  var t = goldSearch(-1E6,1E6)
  #echo t.int
  var m = int.high
  var mi = 0
  for i in t.int-2..t.int+2:
    if m>eval(i.float).int:
      m=eval(i.float).int
      mi=i

  echo mi," ", m

  return 


  
solve()
0