結果

問題 No.1066 #いろいろな色 / Red and Blue and more various colors (Easy)
ユーザー dot_haraai
提出日時 2021-06-02 18:25:09
言語 Nim
(2.2.0)
結果
MLE  
実行時間 -
コード長 1,019 bytes
コンパイル時間 6,125 ms
コンパイル使用メモリ 86,784 KB
実行使用メモリ 291,584 KB
最終ジャッジ日時 2024-11-15 13:14:18
合計ジャッジ時間 8,126 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18 MLE * 6
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()
    q = scan()
    a = @[0] & newseqwith(n,scan())
    b = newseqwith(q,scan())
    md = 998244353
    dp = newseqwith(n+1,newseqwith(n+1,0))
  dp[0][0]=1
  for i in 1..n:
    for j in 0..n:
      if j >= 1:
      #    i個目の箱から 1以外を引く       1を引く
        dp[i][j] = dp[i-1][j]*(a[i]-1) + dp[i-1][j-1]
      else:
         dp[i][j] = dp[i-1][j]*(a[i]-1)
      dp[i][j].mod=md
  for q in b:
    echo dp[n][q]
  
  
  
solve()
0