Algorithm Designa65_q4_collector
Collector
187cb2d5-fabd-4763-b9eb-9adae0659df3.cppC++
1// Loading code...Selected Submission
100 / 100
0.009s
1576 KB
BacktrackGreedy
Time Comp.
O(2^seller)
Space Comp.
O(seller)
Readability
6/10
"The code uses a depth-first search (DFS) to explore different combinations of sellers to acquire a complete set of books at the minimum cost. The bitset representation and the optimization with `mss` suggest a focus on efficiently representing and combining book collections."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #17 | 100 | 5/1/2025 |
| Try #16 | 90 | 5/1/2025 |
| Try #15 | 50 | 5/1/2025 |
| Try #14 | 100 | 5/1/2025 |
| Try #13 | 0 | 5/1/2025 |
| Try #12 | 0 | 5/1/2025 |
| Try #11 | 100 | 4/21/2025 |
| Try #10 | 80 | 4/21/2025 |
| Try #9 | 80 | 4/21/2025 |
| Try #8 | 100 | 4/21/2025 |
| Try #7 | 100 | 4/21/2025 |
| Try #6 | 100 | 4/21/2025 |
| Try #5 | 100 | 4/21/2025 |
| Try #4 | 80 | 4/21/2025 |
| Try #3 | 100 | 4/21/2025 |
| Try #2 | 100 | 4/21/2025 |
| Try #1 | 60 | 4/21/2025 |