Problem Set from GRL

Source :
Volume :

per-page : 10 20 30 50 100

 
 
Problem Title TL ML   Success Topic
judge GRL_1_A:   Single Source Shortest Path 3 sec 128 MB 2282 34.71% 34.71 %     x 396 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 831 58.60% 58.60 %     x 290 GRL_2
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1214 32.78% 32.78 %     x 277 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 910 44.84% 44.84 %     x 250 GRL_1
validator GRL_4_B:   Topological Sort 1 sec 64 MB 596 64.26% 64.26 %     x 216 GRL_4
judge GRL_3_A:   Articulation Points 1 sec 64 MB 798 42.61% 42.61 %     x 201 GRL_3
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 977 54.15% 54.15 %     x 163 GRL_6
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 477 55.56% 55.56 %     x 162 GRL_5
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 517 59.19% 59.19 %     x 150 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 493 45.03% 45.03 %     x 145 GRL_3
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 727 48.97% 48.97 %     x 126 GRL_5
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 295 60.68% 60.68 %     x 125 GRL_7
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 298 50.67% 50.67 %     x 112 GRL_4
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 159 66.67% 66.67 %     x 63 GRL_6
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 180 48.33% 48.33 %     x 50 GRL_5
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 219 37.44% 37.44 %     x 40 GRL_2