Usaco 2024 Open Silver P3

Usaco 2024 Open Silver P3. 给出一棵 个节点的树，定义一次遍历为从根节点 出发走最短路径到任意节点，每次遍历以前树上会在某个节点生成一个药水，若在此次遍历中经过这个节点就可以拿到药水，否则药水消失。 要求最小化遍历次数使得每个节点至少被经过 次，并在保证这个的同时使得拿到的药水最多，输出最大的药水数量。 闲话 第一次打 usaco ，真是太刺激太好玩了，会弄就多弄点. Can anyone look at my code and give me some insight?

I wanted to get some advice on how to manage my preparation time properly to prepare for usaco bronze and be able to pass to silver in the december contest later this year. All competitors who scored 650 or higher on this contest are automatically promoted to the silver division.