I don't understand why my code is giving TLE for this question when my complexity is O(nlogn).. Please somebody look at my code and find the bug.
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
15:29:20
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
15:29:20
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.11.2024 02:05:40 (l1).
Десктопная версия, переключиться на мобильную.
При поддержке
It's possible you ran into an "anti-quicksort" test, since Arrays.sort on primitive types in Java 7 has worst case O(n^2) and on others is an O(n log n) mergesort. Unfair I know, but I don't see anything else that could justify so many people failing on test 46.
Thanx bli0042 . Do you know how to overcome with this problem?
you can use mergesort How to write it
You don't need to write your own mergesort, but if you change "int" to "Integer" it's not a primitive type anymore so Arrays.sort will do a mergesort instead. :)