| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | 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 | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Was solving Matrix chain multiplication on GFG using memoization and got this weird error.
Code works fine when I use a 2D array to store the states, But Gives TLE when vectors are used. Is there any specific reason for this?
Accepted submission: https://pastebin.com/3ZdC61Vc
TLE submission: https://pastebin.com/VbdFrzDJ
Getting this error when submitting the solution: https://mirror.codeforces.com/contest/1713/submission/189032860
VScode gives the correct answer without any errors. Is there any way I can fix this?
Link for the code:
Used min heap priority queue to store the missing numbers from the given array and a map to store the numbers which are repeated more than once.
