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 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
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!