結果

問題 No.1457 ツブ消ししとるなHard
ユーザー dot_haraaidot_haraai
提出日時 2021-04-05 18:43:39
言語 Nim
(2.0.2)
結果
RE  
実行時間 -
コード長 1,325 bytes
コンパイル時間 3,523 ms
コンパイル使用メモリ 87,976 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-10 03:41:09
合計ジャッジ時間 4,416 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 RE -
testcase_10 RE -
testcase_11 AC 1 ms
6,944 KB
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 2 ms
6,944 KB
testcase_19 RE -
testcase_20 AC 2 ms
6,940 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]

ソースコード

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')


const v = 11
var
  
  dp:array[-2..v+5,array[-2..v+5,array[-50..v*v+50,int]]]

proc solve():auto=
  var
    n = scan()
    m = scan()
    x = scan()
    y = scan()
    z = scan()
    a = newseqwith(n,scan())

    count = 0
  if a.filterIt(it>=x).len>m:
    return "Handicapped"
  dp[-1][0][0]=1
  for i in 0..<n:
    for j in 0..i+1:
      for d in 0..v*v:
        if a[i]>=x:# 必ず使う
          dp[i][j][d] = dp[i-1][j-1][d-a[i]]
        elif a[i]<=y: # 必ず使わない
          dp[i][j][d] = dp[i-1][j][d]
        else:
          dp[i][j][d] = dp[i-1][j-1][d-a[i]]+dp[i-1][j][d]
        #echo fmt"dp[{i}][{j}][{d}] = {dp[i][j][d]}"
  #echo dp[0].join("\n")
  #echo ""
  #echo dp[n-1].join("\n")
  for j in 1..m:
    count+=dp[n-1][j][j*z]
  return $count

  
        

  
echo solve()
0