Link to the problem I use bottom up DP $$$dp[mask][ending vertex]$$$ and I'm pretty sure my time complexity is $$$O(2^N \cdot N^2)$$$
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Polyn0mial | 2022-07-01 12:23:19 | 0 | Tiny change: '}\n\n~~~~~\n\n\n</sp' -> '}\n\n~~~~~ \n\n\n</sp' | |
| en3 |
|
Polyn0mial | 2022-07-01 10:21:28 | 63 | (published) | |
| en2 |
|
Polyn0mial | 2022-07-01 10:18:47 | 1050 | ||
| en1 |
|
Polyn0mial | 2022-07-01 10:15:25 | 216 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/23/2026 20:16:13 (g2).
Desktop version, switch to mobile version.
Supported by
