why I got Time Limit in this problem?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
why I got Time Limit in this problem?
Название |
---|
Probably anti-quicksort test? Arrays.sort for primitive types is O(n2) in worst case. Use Long instead of long or shuffle before sorting.
thank you!
got AC by using Integer[] instead of int[]
but what's the difference?
For primitives types java uses "dual pivot" Quick Sort (please google it, it's something like modernized Quick Sort), and for object java uses Tim Sort.
Take a look at Collections.sort which use Merge Sort (O(nlogn))
thank you very much for useful information