search

OkazakiYumemi / okazakiyumemi.github.io

Maybe just a blog
https://okazakiyumemi.github.io/
0 stars 0 forks source link

「GYM101741H」Compressed Spanning Subtrees | Okazaki Yumemi's blog #121

Open OkazakiYumemi opened 3 years ago

OkazakiYumemi commented 3 years ago

https://okazakiyumemi.github.io/blog/GYM101741H/

题意简述GYM101741H 交互题。有一棵 $n$ 个点的无根树，你至多询问 $2550$ 次点集 $X$，交互器会告诉你 $X$ 的虚树大小。求这棵树。$n\le 100$，虚树是也是无根的，没有二度点。