| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 7 | cnnfls_csy | 3569 |
| 9 | ecnerwala | 3494 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | awoo | 158 |
| 4 | cry | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 151 |
| 9 | maroonrk | 151 |
Minimum flips
Given two arrays X and Y both with size N and consisting of only 0's and 1's.We need to find the minimum number of bit flips to get from X to Y, but at any point we cant have 3 of the same bits next to each other(ex. 010001 and 101110 are forbidden).
Can someone help me with this problem it was on a macedonian olympiad.
Constraints: N <= 6000
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
ZeroCoolCorp | 2023-07-15 23:09:51 | 6 | ||
| en1 |
|
ZeroCoolCorp | 2023-07-15 23:08:26 | 364 | Initial revision (published) |
