| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3734 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3581 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3479 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | atcoder_official | 155 |
| 4 | nor | 155 |
| 4 | -is-this-fft- | 155 |
| 7 | maroonrk | 153 |
| 7 | cry | 153 |
| 9 | SecondThread | 147 |
| 10 | Petr | 146 |
There is a vector of intervals (called v) that is initially empty. There are Q queries to process. two types of queries might appear:
Insert an interval (x, y) to an arbitrary place in v. (1 <= x <= y <= 10 ^ 5)
What is the last interval among the first t elements in v, that contains the number x?
the number of queries is at most 10 ^ 5
Auto comment: topic has been updated by MOOONI (previous revision, new revision, compare).
segment tree.
How?
that is unfortunately beyond my area of expertise
First, process all type 1 queries according to their final position. For example, if the queries are of the form:
type=1 x=1000 y=1000 index=1
1 1000 1000 2
1 1000 1000 1
label the first interval as interval 2, the second as interval 3, the third as interval 1. Then, for each type 2 query, you can use a set or something to keep track of the label of the t-th element of v. From there on you can just use a merge-sort tree.