結果

問題 No.527 ナップサック容量問題
ユーザー dot_haraai
提出日時 2021-06-02 20:46:59
言語 Nim
(2.2.0)
結果
AC  
実行時間 87 ms / 2,000 ms
コード長 1,119 bytes
コンパイル時間 4,959 ms
コンパイル使用メモリ 86,792 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-15 16:16:05
合計ジャッジ時間 8,199 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()
    vw = newseqwith(n,(scan(),scan()))
    v = scan()
    m = 100000
    dp = newseqwith(2,newseqwith(m+1,0))
  for i in 1..n:
    var
      now = i.mod(2)
      prev = (i+1).mod(2)
    for w in 0..100000:
      if w-vw[i-1][1]>=0:
        dp[now][w].max=max(dp[prev][w],dp[prev][w-vw[i-1][1]]+vw[i-1][0])
      else:
        dp[now][w].max=dp[prev][w]
  var
    minw = int.high
    maxw = 0
  for w in 1..m:
    if dp[n.mod(2)][w] == v:
      minw.min=w
      maxw.max=w
  echo minw
  if maxw==m:
    echo "inf"
  else:
    echo maxw




  
  
solve()
0