| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
How can I solve this problem.
Given an array, and there are Q queries of two types.
Type-1 : given l , r , val
Update a[i] = a[i] xor val where i = [l , r]
Type-2 : given l , r
Return sum of a[i] where i = [l , r]
Can it be solved with segment tree with lazy propagation?
ThankYou :)
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
code_hard123 | 2016-08-22 23:01:46 | 6 | Tiny change: 'be solved with segment t' -> 'be solved by segment t' | |
| en1 |
|
code_hard123 | 2016-08-22 22:59:15 | 301 | Initial revision (published) |
