| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3312 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
| Name |
|---|



Could Someone take a look at it. I've been stuck here for more than 4 hours. Please
I'm guessing cache.
Thanks for giving me the problem name. I'll read about it.
Thanks. You are right. Its a cache.
Cache friendliness is one possible reason.
Another reason would be that in Java, memory of a multidimensional array are not allocated in a contiguous block, so
new int[a][2]would createasmall blocks of memory each contains aint[2]. In comparison withnew int[2][a], that's a lot slower.new int[2*a]should be faster (but also harder to read)Thanks for the link. You're a savior. :)