Algorithm Designa58_q3_p4_columbia2
Columbia with Elizabeth
6ec20418-0c97-4d2d-9d1a-8e4df28e6b72.cppC++
1// Loading code...Selected Submission
100 / 100
0.08s
5204 KB
BFS/DFSShortest Path
Time Comp.
O(R * C * log(R * C))
Space Comp.
O(R * C)
Readability
5/10
"The code implements a shortest path algorithm using Dijkstra's algorithm with a priority queue to find the minimum cost to reach each cell in a grid, considering different 'abilities' (levels) that affect movement. The core logic revolves around exploring possible paths and updating costs, making it a shortest path problem."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #11 | 100 | 4/21/2025 |
| Try #10 | 100 | 4/21/2025 |
| Try #9 | 10 | 4/21/2025 |
| Try #8 | 40 | 4/21/2025 |
| Try #7 | 0 | 4/21/2025 |
| Try #6 | 0 | 4/21/2025 |
| Try #5 | 0 | 4/21/2025 |
| Try #4 | 30 | 4/21/2025 |
| Try #3 | 40 | 4/21/2025 |
| Try #2 | 30 | 4/21/2025 |
| Try #1 | 20 | 4/21/2025 |