結果

問題 No.1492 01文字列と転倒
コンテスト
ユーザー dot_haraai
提出日時 2021-05-09 12:55:50
言語 Nim
(2.2.0)
結果
AC  
実行時間 1,959 ms / 4,000 ms
コード長 1,758 bytes
コンパイル時間 3,934 ms
コンパイル使用メモリ 87,296 KB
実行使用メモリ 19,456 KB
最終ジャッジ日時 2024-10-04 06:09:07
合計ジャッジ時間 20,433 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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 isGood(s:string):bool=
  if s.len==0:
    return true
  else:
    for i in 0..<s.len-1:
      if s[i..i+1]=="01":
        return isGood(s[0..<i]&s[i+2..<s.len])
    return false

proc tentou(s:string):int=
  var oneC = 0
  for c in s:
    if c=='1':
      oneC+=1
    else:
      result+=oneC


#var n = 4
#var s = newseqwith(n*2,1)
#var cnt = 0
#var cases = 1
#for i in 0..<n:
##  s[i]=0
#cnt+=s.join("").isGood().int
#echo s.join("")," : " , s.join("").isGood(), " : ", s.join("").tentou
#while s.nextPermutation:
  #echo s.join("")," : " , s.join("").isGood(), " : ", s.join("").tentou
  #cases+=1
  #cnt+=s.join("").isGood().int
#echo "==="
#echo cnt , " / ", cases


proc solve()=
  var
    n = scan()
    m = scan()
    dp = newseqwith(2,newseqwith(n+1,newseqwith(n^2+1,0)))
  dp[0][0][0]=1
  for i in 1..n*2:
    var now = i mod 2
    var prev = (i+1) mod 2
    for k in 0..i.div(2)^2:
      var j = 0
      while j <= n and (k-j>=0 or i-j >= j):
        dp[now][j][k] = 0
        if k-j>=0:
          dp[now][j][k]+=dp[prev][j][k-j]
        if i-j >= j and j-1>=0:
          dp[now][j][k]+=dp[prev][j-1][k]
        dp[now][j][k].mod=m
        j+=1

    #echo dp[now]
  for t in 0..n^2:
    echo dp[0][n][t]

solve()
0