I have use a O(n^2/31) dynamic programming approach and use bitset optimization and get AC 0.06s..
1873447 09:40:10 Scenery Accepted 0.06 s C++
here is my code:
algorithm correctness have not been proved yet,
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 165 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
world finals 2017 problem H
I have use a O(n^2/31) dynamic programming approach and use bitset optimization and get AC 0.06s..
1873447 09:40:10 Scenery Accepted 0.06 s C++
here is my code:
algorithm correctness have not been proved yet,
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | Los_Angelos_Laycurse | 2017-05-27 10:45:02 | 272 | Initial revision (published) |
Name |
---|