1335E2 - Three Blocks Palindrome (hard version)
In this problem, the solution outlined by the editorial is $$$O(n*200*200)$$$, here $$$N$$$ <= $$$200000$$$.
How is the solution able to pass with that time complexity on a constraint like this?
Need help with Time Complexity of this problem
1335E2 - Three Blocks Palindrome (hard version)
In this problem, the solution outlined by the editorial is $$$O(n*200*200)$$$, here $$$N$$$ <= $$$200000$$$.
How is the solution able to pass with that time complexity on a constraint like this?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
--oOoOoOoOoOoOo-- | 2020-09-18 13:01:16 | 257 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 164 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
