Problem ID: 1097
Problem Name: Lucky Number
Problem Link: http://lightoj.com/volume_showproblem.php?problem=1097
My solution link: http://ideone.com/MF0yjB
How do I improve the complexity of my solution? Any help is really appreciated.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Problem ID: 1097
Problem Name: Lucky Number
Problem Link: http://lightoj.com/volume_showproblem.php?problem=1097
My solution link: http://ideone.com/MF0yjB
How do I improve the complexity of my solution? Any help is really appreciated.
Name |
---|
As you are using binary search + bit, so to find the k'th number (in line 33) your complexity is log(N)*log(N). You can do this in just log(N) by using segment tree. Because you don't need any binary search then.