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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
9 | awoo | 152 |
9 | luogu_official | 152 |
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 |
---|