Data Structured66_q1a_topsale
Top Sale
bd83d63a-675e-476f-9c8e-d986c3b9e020.cppC++
1// Loading code...Selected Submission
100 / 100
0.312s
20940 KB
HashMapOrdered Map
Time Comp.
O(m * log(n))
Space Comp.
O(n + m)
Readability
6/10
"The code utilizes an unordered set for quick ID lookups, an unordered map to store track records, and a set of pairs to maintain a sorted database of IDs based on their track records. These data structures are central to the algorithm's functionality."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #6 | 100 | 9/6/2024 |
| Try #5 | 100 | 9/6/2024 |
| Try #4 | 0 | 9/6/2024 |
| Try #3 | 100 | 9/5/2024 |
| Try #2 | 100 | 9/5/2024 |
| Try #1 | 30 | 9/5/2024 |