→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 23:42:27 (g2).
Desktop version, switch to mobile version.
Supported by
Say you've found places for the first $$$i$$$ knights and are looking for spots for the $$$i + 1$$$-th knight. How many of the previous knights do you actually care about in terms of where the $$$i + 1$$$-th knight can go?
The dimensions:
dp[rows][3][5][5][7]If you think you know what to do, good luck, and I recommend recursion. Create the states in a way that will make it convenient to "shift" each knight when you place another one.
Thank you galen_colin! I tried to implement the idea again with the optimization you mentioned but unfortunately I got
TLE!Here is my implementation including both top-down and bottom-up approaches
I appreciate your help.