devil_60's blog

By devil_60, history, 3 years ago,

I am unable to get what is wrong with my logic. The question link is here: http://codeforces.com/contest/580/problem/C

My solution is this: https://pastebin.com/DNgpJGnW

• 0

 » 3 years ago, # |   0 Your code gives WA as it does not stop on the path to one of the leaf nodes even after having greater than m consecutive vertices with cats,it refreshes the value of variable val to 0 on the same path and counts those leaf nodes as well.Example test case would be: Input : 4 1 1 1 0 0 1 2 2 3 3 4 Output : 0 (but your code gives output as 1) You can use a return statement to return from the path where greater than m consecutive vertices have cats. Here is a link to my submission:39347359
•  » » 3 years ago, # ^ |   0 you are right! thanks a lot.
•  » » 2 years ago, # ^ |   0 Hey I couldn't understand why the answer is 2 in the second example shown in that problem.The way I see it he can only go restaurant at vertex 5 through the path 1 -> 2 -> 5 which has only 1 cat. The path to 4, 6, 7 have 2 cats which exceeds the threshold.Here is my code — https://pastebin.com/ws0frPRyThanks for your time !Best Regards, Srivatsa
•  » » » 2 years ago, # ^ |   0 The question asks for consecutive vertices so the path to 4 is fine since the vertices with cats are not next to each other on the path.
•  » » » » 2 years ago, # ^ |   0 Thanks, I missed that part. Now it makes sense. I will try to update my logic.
 » 9 months ago, # |   0 i am unable to understand why my logic is incorrect here is my code https://pastebin.com/XeECnx5W