I wants to do this question with segment tree
i know i can change element in logn time but how i can check there at least on segment available or not according to the que
que link link
plz help
→ Обратите внимание
До соревнования
Codeforces Round при поддержке NEAR (Div. 1 + Div. 2)
36:23:03
Зарегистрироваться »
Codeforces Round при поддержке NEAR (Div. 1 + Div. 2)
36:23:03
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 149 |
| 6 | Petr | 148 |
| 6 | SecondThread | 148 |
| 8 | atcoder_official | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 17.07.2024 05:11:57 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
In the contest, I tried implementing the Segment tree and thought the prefix array won't pass the time constraints, but I was wrong, here is my segment tree AC solution although it can be further optimized.
https://mirror.codeforces.com/contest/1843/submission/210506220
Also I didn't quite get wym by " check there at least on segment available " ??
thanks man got it :)
you don't need segment trees for this... its just a basic binary search
Why learning segment trees when you haven't even solved 1300-Rated problems ?
Yeah, In last maybe 20 rounds i dont see a problem(with rating <= 2000), which have solution like "segment tree" or simething more harder. But learning it when you are 1000...
If you're curious, this is a working solution with binary search and prefix sums — no segtree needed, and takes only ~60ms and 1.5MB: 210537397
Why do you learn Segment Tree? Go learn Binary Search.
In fact Binary Search was the expected solution, stop overcomplicating your solutions using hard algorirthms.
If you are interested in the range update method of solving the problem but you need an easy way to do this, I recommend the square root algorithm. It's more suited for beginners, and it is what I used in the contest.