该博客介绍了C++竞赛题目‘Kefa and Park’，讨论了如何解决在有限次经过猫所在的节点后到达餐厅的问题。通过深度优先搜索策略，计算小明可以去的不受猫限制的餐厅数量。
给您带来优质的代码体验，给您带来欢喜^_^
C. Kefa and Park
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Kefa decided to celebrate his first big salary by going to the restaurant.
He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1. Vertex 1 also contains Kefa's house. Unfortunaely for our hero, the park also contains cats. Kefa has already found out what are the vertices with cats in them.
The leaf vertices of the park contain restaurants. Kefa wants to choose a restaurant where he will go, but unfortunately he is very afraid of cats, so there is no way he will go to the restaurant if the path from the restaurant to his house contains more than m consecutive
最低0.47元/天 解锁文章
扫一扫
206
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
