Does Arrays.parallelSort() gives better performance than Arrays.sort() on codeforces?
Since parallelSort optimizes performance on multicore processors, does that work here?
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
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 |
10 | nor | 152 |
Does Arrays.parallelSort() gives better performance than Arrays.sort() on codeforces?
Since parallelSort optimizes performance on multicore processors, does that work here?
Название |
---|
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!