622C - Not Equal on a Segment 15943480 It gives TLE on test case number 14!
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 21.05.2026 10:38:05 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
A long code without any explanation. Don't be surprised that you don't get help.
EDIT — The next paragraph is bullshit, don't read it.
I have read your code and I think its complexity is O(n·m) because of line:
p=lower_bound(h[x].begin(),h[x].end(),l);Note that
lower_bound()is linear for vectors. Write your own binary search there.http://www.cplusplus.com/reference/algorithm/lower_bound/
Lower bound is O(LogN) for random access containers is what is mentioned here..Is lower_bound really linear for vectors?
No.
Damn. I messed it up with
lower_boundinset. Sorry everyone!Of course it is logarithmic for vectors as they are random-access containers. Did you mean anything else?
lower_bound(x.begin(),x.end(),a)->x.lower_bound(a)That syntax is only true in case the container has lower_bound as a member function. So it's valid for something like sets, but not valid for vectors.
No its not linear. The same got AC with fast I/O and using iterative binary search.
Replace endl with "\n".
And pass vectors by reference in functions
flr()andsr().