Algorithm Designa58_q3_p3a_hacking
Hacking
dfb2c877-4b2f-49fa-b8cd-4913f81485a1.cppC++
1// Loading code...Selected Submission
100 / 100
0.056s
5072 KB
Shortest PathBFS/DFS
Time Comp.
O(E log V)
Space Comp.
O(V)
Readability
6/10
"The code implements Dijkstra's algorithm to find the minimum time to reach all nodes in a graph, starting from a set of initial nodes. It uses a priority queue to efficiently explore nodes with the lowest reach time, making it a shortest path problem."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #12 | 100 | 5/1/2025 |
| Try #11 | 100 | 5/1/2025 |
| Try #10 | 100 | 4/1/2025 |
| Try #9 | 100 | 4/1/2025 |
| Try #8 | 100 | 4/1/2025 |
| Try #7 | 100 | 4/1/2025 |
| Try #6 | 0 | 4/1/2025 |
| Try #5 | 100 | 4/1/2025 |
| Try #4 | 100 | 4/1/2025 |
| Try #3 | 50 | 4/1/2025 |
| Try #2 | 90 | 4/1/2025 |
| Try #1 | 90 | 4/1/2025 |