→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 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 | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.04.2026 19:46:19 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
I am not familiar with Java but what you are using Hash table. A Hash table in worst case takes O(n) operation for search, delete and insertion(See Blowing Up Hash Tables). This happens when there are multiple chains(collisions) in the hash table(See Hash table chaining). I'd suggest to use Arrays and Vectors instead! Give me feedback if this helped or not!
https://mirror.codeforces.com/contest/1283/submission/69194098 — I replaced HashMap with TreeMap and got it Accepted
Wow that is great to hear that you fixed the issue!
But in Java,
HashMap<>could be treeified so the worst case won't happen. FYIThe root cause, I guess, maybe
TreeMap<>leads to an earlier break in the iteration?Anyway, to solve this problem,
Mapis not necessary. Just shuffle and check the array some times.