Data Structured67_q1b_wall_paint

Wall Paint

15d22ed4-44d7-4611-947f-f2b7d9cb3d81.cppC++
1// Loading code...

Selected Submission

30 / 100
0.33s
36760 KB
P-QueueStackOrdered Map
Time Comp.
O(n log n)
Space Comp.
O(n)
Readability
5/10

"The code utilizes a priority queue (implemented as a vector and sorted), sets for maintaining wall boundaries, and a stack to find the maximum continuous segment. The sets are ordered to efficiently find the next available position. Therefore, the core data structures are Priority Queue, Set, and Stack."

History

AttemptPoints Time
Try #603010/9/2024
Try #59510/9/2024
Try #586010/8/2024
Try #579010/8/2024
Try #568010/8/2024
Try #55010/8/2024
Try #544510/8/2024
Try #539010/8/2024
Try #52010/8/2024
Try #519010/8/2024
Try #504510/8/2024
Try #494510/8/2024
Try #481510/8/2024
Try #4710010/8/2024
Try #4610010/8/2024
Try #4510010/8/2024
Try #4410010/8/2024
Try #4310010/8/2024
Try #425010/8/2024
Try #413510/8/2024
Try #403510/8/2024
Try #3910010/8/2024
Try #3810010/8/2024
Try #37010/8/2024
Try #3610010/8/2024
Try #3510010/8/2024
Try #3410010/8/2024
Try #33010/8/2024
Try #32010/8/2024
Try #3110010/8/2024
Try #3010010/8/2024
Try #2910010/8/2024
Try #2810010/8/2024
Try #2710010/8/2024
Try #2610010/8/2024
Try #251010/8/2024
Try #2410010/8/2024
Try #2310010/8/2024
Try #2210010/8/2024
Try #218010/8/2024
Try #208010/8/2024
Try #198010/8/2024
Try #188010/8/2024
Try #178010/8/2024
Try #168010/8/2024
Try #158010/8/2024
Try #148010/8/2024
Try #134010/8/2024
Try #128010/8/2024
Try #118010/8/2024
Try #108010/8/2024
Try #94010/8/2024
Try #87510/8/2024
Try #71510/8/2024
Try #62510/8/2024
Try #5010/8/2024
Try #42510/8/2024
Try #32010/8/2024
Try #22010/8/2024
Try #1010/7/2024