2018 Multi-University Training Contest 9

Rank	Solved	A	B	C	D	E	F	G	H	I	J	K
120/730	3/11	O	Ø	.	O	.	.	Ø	.	.	Ø	O

O: 当场通过

Ø: 赛后通过

.: 尚未通过

A Rikka with Nash Equilibrium

solved by chelly

---

chelly's solution

B Rikka with Seam

upsolved by chelly

---

chelly's solution

C Rikka with APSP

unsolved

---

D Rikka with Stone-Paper-Scissors

solved by chelly

---

chelly's solution

E Rikka with Rain

unsolved

---

F Rikka with Spanning Tree

unsolved

---

G Rikka with Treasure

upsolved by chelly

---

chelly's solution

线头DP
dp[k][i][j]表示以k为根的子树，里面有i条完整路径，有j个线头从k伸出去的最优收益
注意到易得第三维<=2，第二维<=size[k]，所以这是个\(O(n^2)\)的dp
接下来主要就是线头DP的实现细节了，细节很恶心
在做线头DP的时候，先不考虑根节点k本身，先把它孩子子树合上来，然后再考虑从k点加线头进行转移，然后再考虑从k点封线头进行转移（可能会形成孤立点），然后给那些经过k点的方案加上k点的权值
在这个题里你还需要多开一个维度的状态表示是否经过了k点

H Rikka with Line Graph

unsolved

---

I Rikka with Bubble Sort

unsolved

---

J Rikka with Time Complexity

upsolved by chelly

---

chelly's solution

K Rikka with Badminton

solved by chelly

---

chelly's solution

签到

Replay

本场chelly单挑

转载于:https://www.cnblogs.com/Amadeus/p/9912209.html