結果

問題 No.196 典型DP (1)
ユーザー nadeshinonadeshino
提出日時 2019-09-09 20:27:36
言語 Nim
(2.2.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,020 bytes
コンパイル時間 1,220 ms
コンパイル使用メモリ 72,196 KB
最終ジャッジ日時 2024-11-14 21:38:32
合計ジャッジ時間 2,067 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 19) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
stack trace: (most recent call last)
Main.nim(6, 9)           unpack
/home/judge/data/code/Main.nim(35, 19) template/generic instantiation of `input` from here
/home/judge/data/code/Main.nim(12, 44) template/generic instantiation of `unpack` from here
/home/judge/data/code/Main.nim(6, 9) Error: index 1 not in 0 .. 0

ソースコード

diff #
プレゼンテーションモードにする

import algorithm, future, macros, math, sequtils, sets, strutils, tables
macro unpack(rhs: seq, cnt: static[int]): auto =
let t = genSym(); result = quote do:(let `t` = `rhs`;())
if NimMinor <= 17:
for i in 0..<cnt: result[0][1].add(quote do:`t`[`i`])
else:
for i in 0..<cnt: result[1].add(quote do:`t`[`i`])
template input(T: typedesc, cnt: Natural = 1): untyped =
let line = stdin.readLine.split(" ")
when T is int: line.map(parseInt).unpack(cnt)
elif T is float: line.map(parseFloat).unpack(cnt)
elif T is string: line.unpack(cnt)
elif T is char: line.mapIt(it[0]).unpack(cnt)
elif T is seq[int]: line.map(parseint)
elif T is seq[float]: line.map(parseFloat)
elif T is seq[string]: line
elif T is seq[char]: line.mapIt(it[0])
proc `&=`(n: var int, m: int) = n = n and m
proc `|=`(n: var int, m: int) = n = n or m
proc `%=`(n: var int, m: int) = n = n mod m
proc `//=`(n: var int, m: int) = n = n div m
proc `<<=`(n: var int, m: int) = n = n shl m
proc `>>=`(n: var int, m: int) = n = n shr m
proc `<?=`(n: var SomeNumber, m: SomeNumber) = n = min(n, m)
proc `>?=`(n: var SomeNumber, m: SomeNumber) = n = max(n, m)
proc newSeq2[T](n1, n2: Natural): seq[seq[T]] = newSeqWith(n1, newSeq[T](n2))
proc newSeq3[T](n1, n2, n3: Natural): seq[seq[seq[T]]] = newSeqWith(n1, newSeqWith(n2, newSeq[T](n3)))
# -------------------------------------------------- #
const P = 10 ^ 9 + 7
var (N, K) = input(int, 2)
var edge = newseq2[int](N + 1, 0)
for i in 1 .. N - 1:
var (a, b) = input(int, 2)
inc a; inc b;
edge[a].add(b)
edge[b].add(a)
proc dfs(v: int, p: int): seq[int] =
result = @[1]
for u in edge[v]:
if u == p: continue
var subtree = dfs(u, v)
var A = result.len()
var B = subtree.len()
var newResult = newseq[int](A + B - 1)
for i in 0 .. A - 1:
for j in 0 .. B - 1:
newResult[i + j] += (result[i] * subtree[j]) mod P
newResult[i + j] %= P
result = newResult
result.add(1)
echo dfs(1, 0)[K]
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0