2019牛客暑期多校训练营（第六场）

Rank	Solved	A	B	C	D	E	F	G	H	I	J
332/820	3/10	O	Ø	Ø	O	Ø	Ø	Ø	Ø	Ø	O

O: 当场通过

Ø: 赛后通过

.: 尚未通过

A Garbage classification

solved by viscaria

---

viscaria’s solution

B Shorten ipv6 address

upsolved by Feynman1999

---

Feynman1999’s solution

C Plaindrome Mouse

upsolved by chelly

---

chelly’s solution

考虑回文树上一个点$u$，其包含的回文子串就是其next树上的所有子孙的$fail$路径上的点的并集。
考虑对回文树进行$dfs$，计算$u$的答案，只需要在$fa[u]$的基础上把$u$的$fail$路径上的点并进去就行了，实际上只需要并入$u$和$fail[u]$即可，因为$fail[fail[u]]$一定已经被标记过。
时间复杂度$O(n)$。

D Move

solved by viscaria

---

viscaria’s solution

E Androgynos

upsolved by Feynman1999

---

Feynman1999’s solution

F K-ary-Heap

upsolved by Feynman1999&chelly

---

chelly’s solution

G Is Today Friday？

upsolved by Feynman1999

---

Feynman1999’s solution

H Trian Driver

upsolved by chelly

---

chelly’s soution

I Can they Go to Galar？

upsolved by chelly

---

chelly’s solution

J Upgrading Technology

solved by viscaria

---

viscaria’s solution

Dirty Replay

• I题又在dfs里开了全局数组WA了😀