| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 169 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 150 |
| 7 | atcoder_official | 147 |
| 7 | SecondThread | 147 |
| 9 | TheScrasse | 146 |
| 10 | Petr | 145 |
I am getting MLE in test case 45 for C Question. I am not able to figure out the reason for it. Time Complexity and Space Complexity of my code are O(n^2) for each. Here's my submission. Can someone figure out my issue with my code ?
https://mirror.codeforces.com/contest/1678/submission/156387534
Don't save the inversions in a vector, that just uses extra time and memory. Try instead to apply the increments to the dp array directly, and in the end just loop over the array again and find the inversions instead of using the vector (a)
https://mirror.codeforces.com/contest/1678/submission/156390171
Thank you so much!! Was doing this silly thing
I observed that using one array of size 5000*5000 will be fine (takes about 195900 KB) but as soon as you u use two array of size 5000*5000 you will get MLE. This problem was tricky we get tle and mle check these two submission acc code mle code
Ok I see !!!!!!!