CODEFORCES: 580C - Kefa and Park

[dev-onejun]

https://codeforces.com/problemset/problem/580/C

[dev-onejun]

Idea

using dfs and count the consecutive vertices which has cat, and pop if the path were out of conditions so that don’t search that path anymore.

[dev-onejun]

https://codeforces.com/contest/580/submission/195526550 -> Wrong answer on test 8

[dev-onejun]

https://codeforces.com/contest/580/submission/195758389 -> Accepted

• make tree as undirected graph and count if the arrived node is leaf.