結果

問題 No.1238 選抜クラス
ユーザー dot_haraai
提出日時 2021-06-02 15:48:21
言語 Nim
(2.2.0)
結果
AC  
実行時間 1,188 ms / 2,000 ms
コード長 1,292 bytes
コンパイル時間 4,299 ms
コンパイル使用メモリ 88,780 KB
実行使用メモリ 18,840 KB
最終ジャッジ日時 2024-11-15 08:36:19
合計ジャッジ時間 14,163 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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')



var dp:array[2,array[100+1,array[100*100+1,int]]]


proc solve():int=
  var 
    n = scan()
    need = scan()
    a = @[0] & newseqwith(n,scan())
    md = 10^9+7
    r = a.sum()#100*n
    
  dp[0][0][0]=1
  for i in 1..n:
    var
      now = i.mod(2)
      prev = (i+1).mod(2)
    for j in 0..n:
      for k in 0..r:
        dp[now][j][k]=0
    dp[now][0][0]=1
    for j in 1..i:
      for k in 0..r:
        #dp[now][j][k]=0
        if k-a[i]>=0:
          dp[now][j][k]=dp[prev][j][k]+dp[prev][j-1][k-a[i]]
        else:
          dp[now][j][k]=dp[prev][j][k]
        dp[now][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.mod(2)][j][k]
        result.mod=md
  
    


echo solve()
0