I was attempting ques. 580B. My AC solution(http://mirror.codeforces.com/submissions/moiz_hussain#AC) using qsort() and 2D array gives time of 265ms on case 26 where as WA solution(http://mirror.codeforces.com/submissions/moiz_hussain#WA) uses a quicksort function and two arrays gives time of 2000ms.Can someone explain why this is happening?
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 163 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 14.05.2026 11:10:59 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Quicksort has worst case performance O(n2). For simple implementations it happens when array is already sorted. The problem can be partially avoided by using more complex methods of choosing pivot.
Search google for randomised quicksort. qsort seems to use "randomised" quicksort, that is, it selects pivot randomly.