結果

問題 No.1163 I want to be a high achiever
ユーザー dot_haraai
提出日時 2021-05-29 12:35:07
言語 Nim
(2.2.0)
結果
AC  
実行時間 397 ms / 2,000 ms
コード長 1,416 bytes
コンパイル時間 3,741 ms
コンパイル使用メモリ 87,040 KB
実行使用メモリ 194,048 KB
最終ジャッジ日時 2024-11-07 21:06:05
合計ジャッジ時間 11,288 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [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,heapqueue
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=
  var 
    n = scan()
    x = scan()
    aseq = newseqwith(n,scan()-x)
    bseq = newseqwith(n,scan())
  if aseq.sum()>=0:
    return 0
  else:
    if aseq.filterIt(it>=0).len==0:
      return -1
    var 
      ma = newseq[int]()
      mb = newseq[int]()
      goal = -aseq.sum()
      mx = 500*100
    for i in 0..<n:
      if aseq[i]<0:
        ma.add(-aseq[i])
        mb.add(bseq[i])
    var
      #dp[i][j] := i個目まで見てj点プラスするのに必要な最小コスト
      dp = newseqwith(ma.len+1,newseqwith(mx+1,int.high.div(4)))
    result = int.high.div(4)
    dp[0][0]=0
    for i in 1..ma.len:
      for j in 0..mx:
        if j-ma[i-1]>=0:
          dp[i][j] = min(dp[i-1][j], dp[i-1][j-ma[i-1]]+mb[i-1])
        else:
          dp[i][j].min=dp[i-1][j]
        if j>=goal:
          result.min=dp[i][j]


        

  
  

echo solve()
0