Problem Set from DSL

Source :
Volume :

per-page : 10 20 30 50 100

 
 
Problem Title TL ML   Success Topic
judge DSL_1_A:   Disjoint Set: Union Find Tree 3 sec 64 MB 1620 67.35% 67.35 %     x 638 DSL_1
judge DSL_2_A:   Range Minimum Query (RMQ) 2 sec 64 MB 2369 43.39% 43.39 %     x 436 DSL_2
judge DSL_2_B:   Range Sum Query (RSQ) 1 sec 64 MB 1257 54.65% 54.65 %     x 378 DSL_2
judge DSL_2_C:   Range Search (kD Tree) 1 sec 256 MB 1475 22.71% 22.71 %     x 150 DSL_2
judge DSL_2_D:   Range Update Query (RUQ) 1 sec 256 MB 235 57.02% 57.02 %     x 90 DSL_2
judge DSL_2_E:   Range Add Query (RAQ) 1 sec 256 MB 209 62.68% 62.68 %     x 89 DSL_2
judge DSL_2_F:   RMQ and RUQ 1 sec 256 MB 255 53.73% 53.73 %     x 83 DSL_2
judge DSL_2_G:   RSQ and RAQ 1 sec 256 MB 310 49.35% 49.35 %     x 88 DSL_2
judge DSL_3_A:   The Smallest Window I 1 sec 128 MB 231 52.81% 52.81 %     x 76 DSL_3
judge DSL_3_B:   The Smallest Window II 1 sec 256 MB 14 35.71% 35.71 %     x 5 DSL_3
judge DSL_3_C:   The Number of Windows 3 sec 128 MB 151 53.64% 53.64 %     x 54 DSL_3
judge DSL_3_D:   Sliding Minimum Elements 2 sec 256 MB 97 09.28% 09.28 %     x 7 DSL_3
judge DSL_4_A:   Union of Rectangles 6 sec 256 MB 195 36.41% 36.41 %     x 48 DSL_4
judge DSL_5_A:   The Maximum Number of Customers 1 sec 128 MB 157 53.50% 53.50 %     x 74 DSL_5
judge DSL_5_B:   The Maximum Number of Overlaps 1 sec 128 MB 25 48.00% 48.00 %     x 11 DSL_5