結果
問題 | No.1488 Max Score of the Tree |
ユーザー | dot_haraai |
提出日時 | 2021-05-31 10:45:06 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 125 ms / 2,000 ms |
コード長 | 1,745 bytes |
コンパイル時間 | 3,635 ms |
コンパイル使用メモリ | 88,000 KB |
実行使用メモリ | 83,124 KB |
最終ジャッジ日時 | 2024-04-26 08:00:45 |
合計ジャッジ時間 | 6,482 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 112 ms
78,804 KB |
testcase_01 | AC | 112 ms
75,472 KB |
testcase_02 | AC | 117 ms
79,264 KB |
testcase_03 | AC | 125 ms
83,056 KB |
testcase_04 | AC | 124 ms
82,808 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 35 ms
22,724 KB |
testcase_07 | AC | 73 ms
49,648 KB |
testcase_08 | AC | 50 ms
36,120 KB |
testcase_09 | AC | 41 ms
25,292 KB |
testcase_10 | AC | 74 ms
50,408 KB |
testcase_11 | AC | 125 ms
82,584 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 24 ms
14,464 KB |
testcase_14 | AC | 63 ms
40,748 KB |
testcase_15 | AC | 43 ms
26,932 KB |
testcase_16 | AC | 8 ms
7,040 KB |
testcase_17 | AC | 28 ms
17,408 KB |
testcase_18 | AC | 86 ms
56,248 KB |
testcase_19 | AC | 53 ms
32,728 KB |
testcase_20 | AC | 24 ms
14,592 KB |
testcase_21 | AC | 12 ms
8,576 KB |
testcase_22 | AC | 40 ms
25,604 KB |
testcase_23 | AC | 1 ms
6,944 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 2 ms
6,940 KB |
testcase_26 | AC | 32 ms
20,584 KB |
testcase_27 | AC | 6 ms
6,940 KB |
testcase_28 | AC | 15 ms
11,264 KB |
testcase_29 | AC | 21 ms
14,080 KB |
testcase_30 | AC | 99 ms
67,532 KB |
testcase_31 | AC | 124 ms
83,124 KB |
コンパイルメッセージ
/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, 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() k = scan() es = newseqwith(n,newseq[int]()) cost = newseqwith(n,newseq[int]()) esu = newseqwith(n,newseq[int]()) 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 1 for idx, nxt in es[p]: if nxt == par:continue var t = dfs(p,nxt) esu[p][idx]=t result+=t discard dfs(-1,0) # 各辺の使用回数を計算 var edge = newseq[int]() score = newseq[int]() base = 0 for p in 0..<n: for (c,m) in zip(cost[p],esu[p]): if m!=0: base+=c*m edge.add(c) score.add(m*c) var m = edge.len dp = 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-1][j-edge[i-1]]+score[i-1],dp[i-1][j]) else: dp[i][j].max= dp[i-1][j] echo dp[m].max() + base solve()