| # | 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 | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Help in optimizing this cs academy problem .
The problem asks to toggle bits in a given range that after certain operations all bits becomes 0 .
My O(N2) solution is for a given light bulb if it is on the switch it off and update all the given ranges , but this will be N^2 complexity . How can we reduce it to O(n) . The last lines of the editorial i couldn't understood , how the author is updating the ranges .
how to do it . ?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
atlasworld | 2019-03-07 00:15:38 | 308 | ||
| en4 |
|
atlasworld | 2019-03-07 00:14:57 | 458 | ||
| en3 |
|
atlasworld | 2019-03-06 23:48:42 | 8 | Tiny change: 'bits in a certain range th' -> 'bits in a given range th' | |
| en2 |
|
atlasworld | 2019-03-06 23:46:44 | 21 | Tiny change: 'ges . \n\n\n\n' -> 'ges . \n\nhow to do it . ? \n\n\n\n' | |
| en1 |
|
atlasworld | 2019-03-06 23:46:02 | 578 | Initial revision (published) |
