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 | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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!