Data Structured65_q1c_min_of_max
Min of Max
a0eac138-f412-4a9b-ab4c-e4e4e7c74e88.cppC++
1// Loading code...Selected Submission
100 / 100
0.247s
4936 KB
P-QueueArray
Time Comp.
O(N log K)
Space Comp.
O(K)
Readability
5/10
"The code utilizes a priority queue (min-heap) to maintain the minimum of maximum values for different card types. It also uses a vector to track the maximum power seen for each card type so far, effectively managing data related to card types and their powers."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #43 | 100 | 9/9/2024 |
| Try #42 | 100 | 9/9/2024 |
| Try #41 | 100 | 9/9/2024 |
| Try #40 | 0 | 9/9/2024 |
| Try #39 | 100 | 9/9/2024 |
| Try #38 | 100 | 9/9/2024 |
| Try #37 | 100 | 9/9/2024 |
| Try #36 | 0 | 9/9/2024 |
| Try #35 | 100 | 9/9/2024 |
| Try #34 | 100 | 9/9/2024 |
| Try #33 | 0 | 9/9/2024 |
| Try #32 | 100 | 9/8/2024 |
| Try #31 | 100 | 9/8/2024 |
| Try #30 | 100 | 9/8/2024 |
| Try #29 | 100 | 9/8/2024 |
| Try #28 | 100 | 9/8/2024 |
| Try #27 | 100 | 9/8/2024 |
| Try #26 | 40 | 9/8/2024 |
| Try #25 | 40 | 9/8/2024 |
| Try #24 | 40 | 9/8/2024 |
| Try #23 | 0 | 9/8/2024 |
| Try #22 | 100 | 9/8/2024 |
| Try #21 | 40 | 9/8/2024 |
| Try #20 | 30 | 9/8/2024 |
| Try #19 | 0 | 9/8/2024 |
| Try #18 | 50 | 9/8/2024 |
| Try #17 | 50 | 9/8/2024 |
| Try #16 | 50 | 9/8/2024 |
| Try #15 | 50 | 9/8/2024 |
| Try #14 | 0 | 9/8/2024 |
| Try #13 | 0 | 9/8/2024 |
| Try #12 | 50 | 9/8/2024 |
| Try #11 | 0 | 9/8/2024 |
| Try #10 | 0 | 9/8/2024 |
| Try #9 | 0 | 9/8/2024 |
| Try #8 | 50 | 9/8/2024 |
| Try #7 | 50 | 9/8/2024 |
| Try #6 | 50 | 9/8/2024 |
| Try #5 | 10 | 9/8/2024 |
| Try #4 | 50 | 9/8/2024 |
| Try #3 | 50 | 9/8/2024 |
| Try #2 | 0 | 9/8/2024 |
| Try #1 | 50 | 9/8/2024 |