結果
問題 | No.1251 絶対に間違ってはいけない最小化問題 |
ユーザー | dot_haraai |
提出日時 | 2021-03-21 14:32:10 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 116 ms / 2,000 ms |
コード長 | 1,361 bytes |
コンパイル時間 | 4,900 ms |
コンパイル使用メモリ | 86,476 KB |
実行使用メモリ | 11,776 KB |
最終ジャッジ日時 | 2024-11-22 07:14:08 |
合計ジャッジ時間 | 17,950 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 1 ms
5,248 KB |
testcase_10 | AC | 1 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 1 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 109 ms
11,520 KB |
testcase_19 | AC | 105 ms
11,520 KB |
testcase_20 | AC | 61 ms
7,808 KB |
testcase_21 | AC | 10 ms
5,248 KB |
testcase_22 | AC | 66 ms
8,064 KB |
testcase_23 | AC | 8 ms
5,248 KB |
testcase_24 | AC | 86 ms
9,216 KB |
testcase_25 | AC | 64 ms
7,936 KB |
testcase_26 | AC | 24 ms
5,248 KB |
testcase_27 | AC | 8 ms
5,248 KB |
testcase_28 | AC | 114 ms
11,648 KB |
testcase_29 | AC | 115 ms
11,648 KB |
testcase_30 | AC | 114 ms
11,520 KB |
testcase_31 | AC | 115 ms
11,648 KB |
testcase_32 | AC | 114 ms
11,648 KB |
testcase_33 | AC | 114 ms
11,520 KB |
testcase_34 | AC | 114 ms
11,648 KB |
testcase_35 | AC | 115 ms
11,776 KB |
testcase_36 | AC | 115 ms
11,520 KB |
testcase_37 | AC | 115 ms
11,520 KB |
testcase_38 | AC | 114 ms
11,520 KB |
testcase_39 | AC | 116 ms
11,648 KB |
testcase_40 | AC | 115 ms
11,648 KB |
testcase_41 | AC | 114 ms
11,648 KB |
testcase_42 | AC | 114 ms
11,648 KB |
testcase_43 | AC | 2 ms
5,248 KB |
testcase_44 | AC | 1 ms
5,248 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]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets import critbits, future, strformat, deques#,bigints 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#initBigint(0) for i in 0..<n: result+=(b[i]*abs(a[i]-x))#.initBigInt() proc fibSearch(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(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^6),10^6) echo t, " ", eval(t) return solve()