結果

問題 No.1163 I want to be a high achiever
ユーザー dot_haraaidot_haraai
提出日時 2021-05-29 12:34:05
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 1,415 bytes
コンパイル時間 4,002 ms
コンパイル使用メモリ 87,168 KB
実行使用メモリ 194,048 KB
最終ジャッジ日時 2024-04-25 10:28:02
合計ジャッジ時間 11,173 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
10,112 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 11 ms
8,192 KB
testcase_04 AC 284 ms
148,992 KB
testcase_05 AC 341 ms
177,536 KB
testcase_06 AC 227 ms
114,048 KB
testcase_07 AC 371 ms
191,360 KB
testcase_08 AC 363 ms
194,048 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 288 ms
152,704 KB
testcase_11 AC 336 ms
179,584 KB
testcase_12 AC 293 ms
153,216 KB
testcase_13 AC 235 ms
119,168 KB
testcase_14 AC 245 ms
123,520 KB
testcase_15 AC 351 ms
186,624 KB
testcase_16 AC 264 ms
138,752 KB
testcase_17 AC 300 ms
159,232 KB
testcase_18 AC 364 ms
191,360 KB
testcase_19 AC 234 ms
120,320 KB
testcase_20 AC 210 ms
108,544 KB
testcase_21 AC 1 ms
5,376 KB
testcase_22 AC 322 ms
169,344 KB
testcase_23 AC 306 ms
162,432 KB
testcase_24 AC 361 ms
193,664 KB
testcase_25 AC 276 ms
143,488 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 1 ms
5,376 KB
testcase_29 WA -
testcase_30 AC 3 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 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, 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