| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 7 | Petr | 147 |
| 7 | atcoder_official | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
I was solving a segment tree problem in witch you are given:
Update L, R. — updates [L;R] with the value of the current operation (1, 2, ... M)
Query. — count different elements in [0; N]
N <= 10^7
M <= 4 * 10^4
I couldn't come with an aproach. I will be really happy if someone helps me with it. Thankd in advance! :)
this problem can be solved with set
imagine we have a set with pairs of two ints
in this set we have pairs of l and r's of segments and the segments are disjoint and every time we are asked to update a segment with an l — r query we will find the segments that intersect with it and are inside it and segments which include this segment with lowerbound on the set and remove the segments which are inside it and split the segments which include it and intesect with it the segments which we split are O(1) and every segment is removed with O(lgm) so it has an amortized order of O(mlgm) but how to answer the queries? in a map called cnt in cnt[x] we save the number of segments which have number x and whenever we remove a query we will decrease cnt[x] by 1 and if it hits zero we decrease the current answer by one every time they want the query we will just say the current answer
Problem link please?