devil_60's blog

By devil_60, history, 3 months ago, In English,

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

 
 
 
 

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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