| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | jiangly | 3578 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | tourist | 3565 |
| 8 | maroonrk | 3531 |
| 9 | Radewoosh | 3521 |
| 10 | Um_nik | 3482 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 8 | SecondThread | 146 |
| 10 | pajenegod | 145 |
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) |
