Data Structureex00m2
Auction
ce9d4de4-15ed-45b4-bd23-75a2e1f1096d.cppC++
1// Loading code...Selected Submission
80 / 100
0.062s
3596 KB
ArrayVectorImplementation
Time Comp.
O(N * M * log M), where N is the number of actions and M is the maximum number of bids for an item.
Space Comp.
O(I * B + B), where I is the number of items and B is the number of bidders.
Readability
5/10
"The code uses vectors to store bids for each item and a vector of vectors to store the items each bidder has won. It also utilizes `std::lower_bound` for efficient insertion and deletion in the sorted bid lists. The comparator class is used for custom sorting of bids."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #15 | 80 | 9/8/2024 |
| Try #14 | 80 | 9/8/2024 |
| Try #13 | 80 | 9/7/2024 |
| Try #12 | 100 | 9/7/2024 |
| Try #11 | 100 | 9/7/2024 |
| Try #10 | 100 | 9/7/2024 |
| Try #9 | 80 | 9/7/2024 |
| Try #8 | 80 | 9/7/2024 |
| Try #7 | 80 | 9/7/2024 |
| Try #6 | 10 | 9/7/2024 |
| Try #5 | 10 | 9/7/2024 |
| Try #4 | 0 | 9/7/2024 |
| Try #3 | 0 | 9/7/2024 |
| Try #2 | 10 | 9/7/2024 |
| Try #1 | 0 | 9/7/2024 |