I passed the pretest but got fst with the pretest again 148588961 and got ac with the exactly that code in practice mode 148606321. Those codes are exactly same. Please, MikeMirzayanov can you rejudge the submission. Thanks.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 8 | nik_exists | 131 |
| 10 | Proof_by_QED | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 03.09.2026 17:59:16 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
bad luck bro :v
tamthegod after the system test :
Did anyone face with this trouble before ? This is kinda weird :v
This happened several times already actually (fortunately, not with me). And it's not weird, as you can see his accepted submission ran in 1902ms, pretty close to the 2s TL. Anyway hope that his submission will be rejudged.
What is the time complexity of your solution? I think the upper bound of your solution is O(n*log(n)*log(c)) and because of that, it is on the border of the time limit.
I've had similar experiences with you twice
I experienced something weird today. My code got FST (Pretest 13 and 27) twice in the System test today and, in the end, got accepted in the System test itself!