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.
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.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
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.