I am unable to get what is wrong with my logic. The question link is here: http://codeforces.me/contest/580/problem/C
My solution is this: https://pastebin.com/DNgpJGnW
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | Dominater069 | 151 |
9 | maroonrk | 151 |
I am unable to get what is wrong with my logic. The question link is here: http://codeforces.me/contest/580/problem/C
My solution is this: https://pastebin.com/DNgpJGnW
Название |
---|
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
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/ws0frPRy
Thanks for your time !
Best Regards, Srivatsa
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.