Problem | dijkstra |
---|---|
User | ThatOneGuy |
Submission Time | 2025-02-07 15:27:12 |
Score | 0 |
Max Time | N/A |
Max Memory | N/A |
Owl Get a Life
dijkstra.cpp:4:3: error: invalid preprocessing directive #Function
4 | # Function to implement Dijkstra's algorithm
| ^~~~~~~~
dijkstra.cpp:6:7: error: invalid preprocessing directive #Distance
6 | # Distance from vertex 1 to every other vertex, initialized to infinity
| ^~~~~~~~
dijkstra.cpp:8:18: error: stray ‘#’ in program
8 | dist[1] = 0 # Distance from vertex 1 to itself is 0
| ^
dijkstra.cpp:10:7: error: invalid preprocessing directive #Min
10 | # Min-heap priority queue to select the vertex with the smallest distance
| ^~~
dijkstra.cpp:11:20: error: stray ‘#’ in program
11 | pq = [(0, 1)] # (distance, vertex)
| ^
dijkstra.cpp:16:11: error: invalid preprocessing directive #If; did you mean #if?
16 | # If the current vertex's distance is already greater than the recorded distance, continue
|