| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | atcoder_official | 163 |
| 3 | Um_nik | 162 |
| 3 | maomao90 | 162 |
| 5 | adamant | 157 |
| 5 | djm03178 | 157 |
| 5 | -is-this-fft- | 157 |
| 8 | awoo | 155 |
| 9 | TheScrasse | 154 |
| 9 | Dominater069 | 154 |
I tried attempting CSES Prefix Sum Queries using lazy segment tree.
Can someone explain to me exactly why my logic fails??
*Edit -> I realized that I was not changing the values in the original array and so I included that in the solution and it still fails -> Solution
Auto comment: topic has been updated by KIMJONGOOF (previous revision, new revision, compare).
I didn't get your seg tree implementation, but here's my code if it helps. Even I used segment tree.
The Second solution given here is what I am trying to implement. I get what you have done, I just dont understand why my code fails! I have done everything exactly as done in the USACO solution..