結果

問題 No.1238 選抜クラス
ユーザー dot_haraaidot_haraai
提出日時 2021-06-02 15:41:02
言語 Nim
(2.0.2)
結果
MLE  
実行時間 -
コード長 1,133 bytes
コンパイル時間 3,450 ms
コンパイル使用メモリ 87,572 KB
実行使用メモリ 813,848 KB
最終ジャッジ日時 2024-04-27 07:52:09
合計ジャッジ時間 9,671 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 4 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 3 ms
6,940 KB
testcase_12 AC 3 ms
6,944 KB
testcase_13 AC 3 ms
6,940 KB
testcase_14 AC 1 ms
6,944 KB
testcase_15 AC 5 ms
6,944 KB
testcase_16 AC 4 ms
6,940 KB
testcase_17 AC 864 ms
411,240 KB
testcase_18 AC 720 ms
387,436 KB
testcase_19 AC 660 ms
395,452 KB
testcase_20 AC 582 ms
335,380 KB
testcase_21 AC 587 ms
349,596 KB
testcase_22 AC 2 ms
6,940 KB
testcase_23 AC 2 ms
6,944 KB
testcase_24 MLE -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()
    need = scan()
    a = @[0] & newseqwith(n,scan())
    md = 10^9+7
    r = a.sum()#100*n
    dp = newseqwith(n+1,newseqwith(n+1,newseqwith(r+1,0)))
  for i in 0..n:
    dp[i][0][0]=1
  for i in 1..n:
    for j in 1..i:
      for k in 0..r:
        if k-a[i]>=0:
          dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-a[i]]
        else:
          dp[i][j][k]=dp[i-1][j][k]
        dp[i][j][k].mod=md
  #echo dp[n].join("\n")
  for j in 1..n:
    for k in 0..r:
      if j*need <= k:
        result+=dp[n][j][k]
        result.mod=md
  
    


echo solve()
0