Algorithm Designa57_m3_tile
Tile
5720a4ee-5a75-41fa-8575-4a759fec5f85.cppC++
1// Loading code...Selected Submission
100 / 100
0.018s
1780 KB
DP
Time Comp.
O(n * m * sqrt(m))
Space Comp.
O(n * m)
Readability
7/10
"The code uses dynamic programming to find the minimum cost to cover a given area 'm' using a set of tiles. The `dp` table stores the minimum cost to achieve a certain area using a subset of tiles, and the algorithm iterates through the tiles and possible areas to update the table."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #11 | 100 | 2/25/2025 |
| Try #10 | 100 | 2/25/2025 |
| Try #9 | 0 | 2/25/2025 |
| Try #8 | 0 | 2/25/2025 |
| Try #7 | 0 | 2/25/2025 |
| Try #6 | 20 | 2/25/2025 |
| Try #5 | 5 | 2/25/2025 |
| Try #4 | 100 | 2/25/2025 |
| Try #3 | 100 | 2/25/2025 |
| Try #2 | 80 | 2/25/2025 |
| Try #1 | 10 | 2/25/2025 |