Algorithm Designex04h1_montblanc
Mont Blanc
3fc80d97-eea1-41f4-973f-6b5e746dd982.pyPython
1// Loading code...Selected Submission
100 / 100
0.028s
19244 KB
Binary SearchImplementation
Time Comp.
O(N log M)
Space Comp.
O(N)
Readability
6/10
"The code uses binary search to find the minimum step length that allows reaching the end of the mountain range, and a recursive function `reachedEnd` to simulate the traversal. The `bisect` module is used for efficient searching within the `heights` list, indicating a search-related algorithm."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #37 | 100 | 4/13/2025 |
| Try #36 | 100 | 4/12/2025 |
| Try #35 | 100 | 4/12/2025 |
| Try #34 | 100 | 4/12/2025 |
| Try #33 | 100 | 4/12/2025 |
| Try #32 | 100 | 4/12/2025 |
| Try #31 | 100 | 4/12/2025 |
| Try #30 | 100 | 4/12/2025 |
| Try #29 | 100 | 4/12/2025 |
| Try #28 | 0 | 4/12/2025 |
| Try #27 | 20 | 4/12/2025 |
| Try #26 | 100 | 4/12/2025 |
| Try #25 | 100 | 4/12/2025 |
| Try #24 | 90 | 4/12/2025 |
| Try #23 | 90 | 4/12/2025 |
| Try #22 | 100 | 4/12/2025 |
| Try #21 | 100 | 4/12/2025 |
| Try #20 | 100 | 4/12/2025 |
| Try #19 | 100 | 4/12/2025 |
| Try #18 | 100 | 4/12/2025 |
| Try #17 | 100 | 4/11/2025 |
| Try #16 | 90 | 4/11/2025 |
| Try #15 | 100 | 4/11/2025 |
| Try #14 | 100 | 4/11/2025 |
| Try #13 | 100 | 4/11/2025 |
| Try #12 | 100 | 4/11/2025 |
| Try #11 | 90 | 4/11/2025 |
| Try #10 | 100 | 4/11/2025 |
| Try #9 | 100 | 4/11/2025 |
| Try #8 | 70 | 4/11/2025 |
| Try #7 | 40 | 4/11/2025 |
| Try #6 | 70 | 4/11/2025 |
| Try #5 | 70 | 4/11/2025 |
| Try #4 | 0 | 4/11/2025 |
| Try #3 | 0 | 4/11/2025 |
| Try #2 | 30 | 4/11/2025 |
| Try #1 | 30 | 4/11/2025 |