Link to my source code https://ideone.com/q83VDg. I am getting TLE in test case 14 but my complexity if O(N*200). Please take a look and tell me if I am wrong.Link to the problem http://mirror.codeforces.com/contest/1335/problem/E2
Link to my source code https://ideone.com/q83VDg. I am getting TLE in test case 14 but my complexity if O(N*200). Please take a look and tell me if I am wrong.Link to the problem http://mirror.codeforces.com/contest/1335/problem/E2
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | Kevin114514 | 3678 |
| 3 | VivaciousAubergine | 3647 |
| 4 | jiangly | 3582 |
| 5 | strapple | 3515 |
| 6 | tourist | 3473 |
| 7 | Radewoosh | 3418 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | turmax | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Map operations are not constant, they are logarithmic. It may not seem as significant, but N*200*lgN will surely get TLE.
I replaced map with 2d array but now I am getting MLE code https://mirror.codeforces.com/contest/1335/submission/77007251
The size of array is too big (200002 * 200). You can try unodered_map with run in O(1) complexity or you can change the algorithm you using