|
0
Hello everyone, I've been working on Problem D from ABC404 and devised a strategy where I compute the minimum cost to visit each animal at least once and then double that cost, under the assumption that this would ensure each animal is visited at least twice. However, I've noticed that this approach doesn't always yield the optimal solution. I've spent several hours trying to identify a counterexample but haven't been successful. I would appreciate it if someone could explain why this method might not always produce the optimal result. Here's my submission for reference: https://atcoder.jp/contests/abc404/submissions/65602415 |
|
0
Because every animal in that Zoo will be visited twice already. Thus any new visit to the same Zoo will be redundant. |