Algorithm Designa57_f4_journey
Journey
eb058312-7ace-4ce5-9062-ec9a1bd3ed20.cppC++
1// Loading code...Selected Submission
40 / 100
0.537s
1460 KB
BFS/DFSGreedy
Time Comp.
O(n!)
Space Comp.
O(n)
Readability
5/10
"The code implements a Depth-First Search (DFS) algorithm with a heuristic to find the maximum cost path visiting all stations exactly once, starting from station 0 and ending at station 'station-1'. The heuristic function attempts to estimate the remaining cost, and the code uses branch and bound to prune the search space."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #39 | 40 | 4/22/2025 |
| Try #38 | 100 | 4/22/2025 |
| Try #37 | 100 | 4/22/2025 |
| Try #36 | 0 | 4/22/2025 |
| Try #35 | 70 | 4/22/2025 |
| Try #34 | 80 | 4/22/2025 |
| Try #33 | 80 | 4/22/2025 |
| Try #32 | 40 | 4/22/2025 |
| Try #31 | 10 | 4/22/2025 |
| Try #30 | 100 | 4/22/2025 |
| Try #29 | 100 | 4/19/2025 |
| Try #28 | 100 | 4/19/2025 |
| Try #27 | 100 | 4/19/2025 |
| Try #26 | 0 | 4/16/2025 |
| Try #25 | 100 | 4/16/2025 |
| Try #24 | 100 | 4/16/2025 |
| Try #23 | 0 | 4/16/2025 |
| Try #22 | 0 | 4/16/2025 |
| Try #21 | 60 | 4/16/2025 |
| Try #20 | 20 | 4/16/2025 |
| Try #19 | 80 | 4/16/2025 |
| Try #18 | 80 | 4/16/2025 |
| Try #17 | 80 | 4/16/2025 |
| Try #16 | 0 | 4/16/2025 |
| Try #15 | 0 | 4/16/2025 |
| Try #14 | 50 | 4/16/2025 |
| Try #13 | 50 | 4/16/2025 |
| Try #12 | 40 | 4/16/2025 |
| Try #11 | 50 | 4/16/2025 |
| Try #10 | 50 | 4/16/2025 |
| Try #9 | 100 | 4/16/2025 |
| Try #8 | 80 | 4/16/2025 |
| Try #7 | 50 | 4/16/2025 |
| Try #6 | 0 | 4/16/2025 |
| Try #5 | 20 | 4/16/2025 |
| Try #4 | 30 | 4/16/2025 |
| Try #3 | 30 | 4/16/2025 |
| Try #2 | 30 | 4/16/2025 |
| Try #1 | 30 | 4/16/2025 |