| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3976 |
| 2 | tourist | 3815 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3614 |
| 5 | orzdevinwang | 3526 |
| 6 | ecnerwala | 3514 |
| 7 | Benq | 3482 |
| 8 | hos.lyric | 3382 |
| 9 | gamegame | 3374 |
| 10 | heuristica | 3357 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | -is-this-fft- | 165 |
| 3 | Um_nik | 161 |
| 3 | atcoder_official | 161 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 148 |
I have recently encountered a problem where my solution that used a vector of size n * n * m was giving TLE whereas when i changed the dimension to m * n * n it got accepted.(I kept the remaining logic and the rest of the code same).
Question 2057E1 - Another Exercise on Graphs (Easy Version)
TLE solution 301118680
ACCEPTED solution 301119202
In the second case CPU can better predict memory accesses and thus supply data from memory at a higher rate. You are always better off processing arrays sequentially, e.g. if you process two dimensional array dp[i][j] using nested loops then your inner loop should iterate over j, not i.