Does Arrays.parallelSort() gives better performance than Arrays.sort() on codeforces?
Since parallelSort optimizes performance on multicore processors, does that work here?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Does Arrays.parallelSort() gives better performance than Arrays.sort() on codeforces?
Since parallelSort optimizes performance on multicore processors, does that work here?
Name |
---|
You will try
Yes I WILL :P
As I remember, one of the rules of IOI that if you used multi-threading, the timelimit would be divided on the number of threads. For example, if the timelimit is 1 second and you used 4 threads, the timelimit will be 250ms. I am pretty sure that this also applies to ICPC and online judges. So, I'd say Arrays.sort() would be better as for such, but try yourself C:
Ah I see, I ll try in a virtual comp., thanks.
You're welcome!