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 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ 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-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/23/2024 22:27:57 (i1).
Desktop version, switch to mobile version.
Supported by
