| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Problem: Given an array a1, a2, ..., an (1 <= n <= 1e6) and q queries, for each query has two types.
1 l r x: a[i] = min(a[i], x) (l <= i <= r).
2 i : print value in position i.
I dont know use lazy update to solve operator 1, help me pls (sorry i'm poor E).
hi everyone!
I read a blog write about formula of a^b = a'b + ab' and i dont understand. Someone can explain it for me pls :((
(sorry i'm poor E).
link: https://www.homeworklib.com/qaa/1383353/2prove-that-a-xor-b-a-xor-c-a-xor-b-b-xor
