Algorithm Designa58_q3_p3_PandG
Pacman and Ghost
502d0f87-91f4-4abc-ac13-59ee82e9f58b.cppC++
1// Loading code...Selected Submission
100 / 100
0.169s
1672 KB
BFS/DFSImplementation
Time Comp.
O(R * C * G * T)
Space Comp.
O(R * C)
Readability
6/10
"The code simulates a game where a player needs to reach a destination within a time limit while avoiding ghosts. It uses BFS to determine the reachable areas by ghosts and the player, making BFS the core algorithmic concept. The problem also involves grid traversal and time management, which are handled through implementation details."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #9 | 100 | 4/1/2025 |
| Try #8 | 100 | 4/1/2025 |
| Try #7 | 0 | 4/1/2025 |
| Try #6 | 50 | 4/1/2025 |
| Try #5 | 100 | 4/1/2025 |
| Try #4 | 50 | 4/1/2025 |
| Try #3 | 100 | 4/1/2025 |
| Try #2 | 100 | 4/1/2025 |
| Try #1 | 80 | 4/1/2025 |