→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 145 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/17/2026 14:20:13 (g1).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by _asmah98 (previous revision, new revision, compare).
There is no need of map and all those fancy stuff . Things will be faster and easier with bitmasking and bitwise operators . U can refer my code https://mirror.codeforces.com/contest/1341/submission/77843630
Thank you! Tried removing maps but still TLE ! What's wrong with this approach ?
Donot carry the string in the function parameter. Try to backtrack once you have written your dp. Taking strings in the parameter and doing so many addition of characters to strings are costly.
Thanks ! got it !
or you could just do it in o(n) with greedy