Data Structured64_q1b_moving_median
Moving Median
0df928ab-ad70-43ea-8cf8-53dd39de161c.cppC++
1// Loading code...Selected Submission
100 / 100
0.268s
1480 KB
DequeOrdered Map
Time Comp.
O(N log N)
Space Comp.
O(N)
Readability
4/10
"The code utilizes a queue for sliding window functionality and vectors to store the lower and higher bounds of the window. The use of `std::lower_bound` and `std::sort` indicates an attempt to maintain ordered data, making 'Ordered Map / Ordered Set' and 'Queue / Deque' relevant tags."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #41 | 100 | 9/11/2024 |
| Try #40 | 100 | 9/11/2024 |
| Try #39 | 100 | 9/11/2024 |
| Try #38 | 100 | 9/11/2024 |
| Try #37 | 0 | 9/9/2024 |
| Try #36 | 30 | 9/9/2024 |
| Try #35 | 100 | 9/6/2024 |
| Try #34 | 100 | 9/6/2024 |
| Try #33 | 100 | 9/6/2024 |
| Try #32 | 100 | 9/6/2024 |
| Try #31 | 100 | 9/6/2024 |
| Try #30 | 100 | 9/6/2024 |
| Try #29 | 100 | 9/6/2024 |
| Try #28 | 100 | 9/4/2024 |
| Try #27 | 100 | 9/4/2024 |
| Try #26 | 100 | 8/31/2024 |
| Try #25 | 100 | 8/31/2024 |
| Try #24 | 100 | 8/31/2024 |
| Try #23 | 100 | 8/31/2024 |
| Try #22 | 100 | 8/31/2024 |
| Try #21 | 50 | 8/31/2024 |
| Try #20 | 100 | 8/31/2024 |
| Try #19 | 60 | 8/31/2024 |
| Try #18 | 0 | 8/31/2024 |
| Try #17 | 100 | 8/31/2024 |
| Try #16 | 50 | 8/31/2024 |
| Try #15 | 100 | 8/31/2024 |
| Try #14 | 10 | 8/31/2024 |
| Try #13 | 100 | 8/31/2024 |
| Try #12 | 0 | 8/31/2024 |
| Try #11 | 100 | 8/31/2024 |
| Try #10 | 100 | 8/31/2024 |
| Try #9 | 100 | 8/31/2024 |
| Try #8 | 0 | 8/31/2024 |
| Try #7 | 60 | 8/31/2024 |
| Try #6 | 10 | 8/31/2024 |
| Try #5 | 60 | 8/31/2024 |
| Try #4 | 60 | 8/31/2024 |
| Try #3 | 50 | 8/31/2024 |
| Try #2 | 50 | 8/31/2024 |
| Try #1 | 40 | 8/31/2024 |