結果
問題 | No.1488 Max Score of the Tree |
ユーザー |
|
提出日時 | 2021-05-31 09:46:34 |
言語 | Nim (2.2.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,805 bytes |
コンパイル時間 | 6,445 ms |
コンパイル使用メモリ | 87,808 KB |
実行使用メモリ | 81,536 KB |
最終ジャッジ日時 | 2024-11-08 21:07:34 |
合計ジャッジ時間 | 7,370 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 8 WA * 21 |
コンパイルメッセージ
/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]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsetsimport critbits, future, strformat, dequestemplate `max=`(x,y) = x = max(x,y)template `min=`(x,y) = x = min(x,y)template `mod=`(x,y) = x = x mod ytemplate 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().parseIntproc scanf(): float = read().parseFloatproc toInt(c:char): int =return int(c) - int('0')proc solve()=varn = scan()k = scan()es = newseqwith(n,newseq[int]())cost = newseqwith(n,newseq[int]())esu = newseqwith(n,newseq[int]())fp = newseqwith(n,false)for i in 0..<n-1:var(a,b,c)=(scan()-1,scan()-1,scan())es[a].add(b)es[b].add(a)cost[a].add(c)cost[b].add(c)esu[a].add(0)esu[b].add(0)proc dfs(par,p:int):int=if es[p].len==1 and es[p][0]==par:return 1for idx, nxt in es[p]:if nxt == par:continuevar t = dfs(p,nxt)esu[p][idx]=tresult+=tdiscard dfs(-1,0)#echo esu.join("\n")# 各辺の使用回数を計算varedge = newseq[int]()score = newseq[int]()base = 0for p in 0..<n:for (c,m) in zip(cost[p],esu[p]):if m!=0:base+=c*medge.add(c)score.add(m*c)#echo edge#echo scorevarm = edge.lendp = newseqwith(m+1,newseqwith(k+1,0))# dp[i][j] := i個目の辺まで見たときに選んだ辺の総和がjであるときのスコアの最大値for i in 1..m:for j in 0..k:if j - edge[i-1]>=0:dp[i][j] = max(dp[i][j-edge[i-1]]+score[i-1],dp[i-1][j])else:dp[i][j] = dp[i-1][j]echo dp[m].max() + basesolve()