Can anybody please give me any hints for this Problem?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 157 |
| 6 | Qingyu | 155 |
| 7 | djm03178 | 152 |
| 7 | adamant | 152 |
| 9 | luogu_official | 150 |
| 10 | awoo | 147 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/22/2025 20:53:59 (k2).
Desktop version, switch to mobile version.
Supported by
If you google "Knight distance", there will come a few pages with a general formula that's useful for this problem.
Let f(x, y) be the function that computes the distance in knight moves from point (0, 0) to point (x, y) with x ≥ y (if not, just swap them, the cartesian plane is symmetrical), and let d = x - y. Then the formula is...
Once you know that, you can solve it with min-cost max-flow. Build a bipartite graph. Left nodes are knights and right nodes are points. Join each left node with each right node by setting capacity to 1 and cost equal to that knight distance to that point. Also join the source to every left node and all right nodes to the sink with capacity 1 and cost 0.