Algorithm Designa67_q4a_strange_house
Strange House
9c4201da-18b6-46db-971e-ddd9007bf8ca.cppC++
1// Loading code...Selected Submission
70 / 100
0.002s
1860 KB
BFS/DFSGreedy
Time Comp.
O(b^d) where b is the branching factor and d is the depth of the search.
Space Comp.
O(b^d) due to the priority queue and memoization.
Readability
5/10
"The code implements a search algorithm, likely A* search, to find a sequence of swaps that transforms an initial board configuration to a goal state. It uses a priority queue to explore promising states based on a heuristic function. The core logic revolves around state representation, neighbor generation (swaps), and heuristic evaluation."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #72 | 70 | 4/26/2025 |
| Try #71 | 80 | 4/26/2025 |
| Try #70 | 90 | 4/26/2025 |
| Try #69 | 90 | 4/26/2025 |
| Try #68 | 70 | 4/26/2025 |
| Try #67 | 70 | 4/26/2025 |
| Try #66 | 90 | 4/23/2025 |
| Try #65 | 70 | 4/23/2025 |
| Try #64 | 80 | 4/23/2025 |
| Try #63 | 60 | 4/23/2025 |
| Try #62 | 90 | 4/23/2025 |
| Try #61 | 100 | 4/23/2025 |
| Try #60 | 60 | 4/23/2025 |
| Try #59 | 100 | 4/23/2025 |
| Try #58 | 100 | 4/23/2025 |
| Try #57 | 100 | 4/23/2025 |
| Try #56 | 100 | 4/23/2025 |
| Try #55 | 100 | 4/23/2025 |
| Try #54 | 80 | 4/23/2025 |
| Try #53 | 70 | 4/23/2025 |
| Try #52 | 70 | 4/23/2025 |
| Try #51 | 50 | 4/23/2025 |
| Try #50 | 70 | 4/23/2025 |
| Try #49 | 70 | 4/23/2025 |
| Try #48 | 40 | 4/23/2025 |
| Try #47 | 40 | 4/23/2025 |
| Try #46 | 40 | 4/23/2025 |
| Try #45 | 40 | 4/23/2025 |
| Try #44 | 30 | 4/23/2025 |
| Try #43 | 30 | 4/23/2025 |
| Try #42 | 30 | 4/23/2025 |
| Try #41 | 30 | 4/23/2025 |
| Try #40 | 40 | 4/23/2025 |
| Try #39 | 40 | 4/23/2025 |
| Try #38 | 50 | 4/23/2025 |
| Try #37 | 50 | 4/23/2025 |
| Try #36 | 30 | 4/23/2025 |
| Try #35 | 40 | 4/23/2025 |
| Try #34 | 40 | 4/23/2025 |
| Try #33 | 0 | 4/23/2025 |
| Try #32 | 40 | 4/23/2025 |
| Try #31 | 50 | 4/23/2025 |
| Try #30 | 40 | 4/23/2025 |
| Try #29 | 30 | 4/23/2025 |
| Try #28 | 40 | 4/23/2025 |
| Try #27 | 50 | 4/23/2025 |
| Try #26 | 50 | 4/23/2025 |
| Try #25 | 30 | 4/23/2025 |
| Try #24 | 30 | 4/23/2025 |
| Try #23 | 50 | 4/23/2025 |
| Try #22 | 50 | 4/23/2025 |
| Try #21 | 30 | 4/23/2025 |
| Try #20 | 50 | 4/23/2025 |
| Try #19 | 30 | 4/23/2025 |
| Try #18 | 40 | 4/23/2025 |
| Try #17 | 40 | 4/23/2025 |
| Try #16 | 30 | 4/23/2025 |
| Try #15 | 0 | 4/23/2025 |
| Try #14 | 0 | 4/23/2025 |
| Try #13 | 40 | 4/23/2025 |
| Try #12 | 50 | 4/23/2025 |
| Try #11 | 40 | 4/23/2025 |
| Try #10 | 30 | 4/23/2025 |
| Try #9 | 30 | 4/23/2025 |
| Try #8 | 0 | 4/23/2025 |
| Try #7 | 0 | 4/23/2025 |
| Try #6 | 0 | 4/23/2025 |
| Try #5 | 0 | 4/23/2025 |
| Try #4 | 0 | 4/23/2025 |
| Try #3 | 0 | 4/23/2025 |
| Try #2 | 0 | 4/23/2025 |
| Try #1 | 0 | 4/23/2025 |