Is it wise and feasible to implement an interval tree in a Codeforces round (two hours long)? What about in a 5 hour long contest (ioi)?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 162 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | nor | 155 |
7 | adamant | 155 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
Название |
---|
Segment tree with point update and interval query is very simple data structure. It can be implemented in 5-10 minutes during the round. You can take a look at problem C from rounds 223 and 225 for examples of the solution.
In my opinion, if you want to get a high score on the IOI, you must implement it easily within 15-20 minutes(basic operatios: adding on the interval/sum/max/min and etc.). I'm sure you won't have problems with that if you practise coding it.