# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | 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 | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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 createa
small 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. :)