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 2620 35.38% 35.38 %     x 463 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 1077 45.31% 45.31 %     x 301 GRL_1
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1452 33.26% 33.26 %     x 329 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 1024 57.91% 57.91 %     x 344 GRL_2
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 290 33.45% 33.45 %     x 51 GRL_2
judge GRL_3_A:   Articulation Points 1 sec 64 MB 979 41.27% 41.27 %     x 242 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 585 45.81% 45.81 %     x 179 GRL_3
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 664 60.24% 60.24 %     x 197 GRL_3
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 362 51.66% 51.66 %     x 143 GRL_4
validator GRL_4_B:   Topological Sort 1 sec 64 MB 708 65.40% 65.40 %     x 268 GRL_4
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 581 56.63% 56.63 %     x 203 GRL_5
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 243 45.68% 45.68 %     x 71 GRL_5
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 849 48.76% 48.76 %     x 159 GRL_5
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 1179 57.25% 57.25 %     x 219 GRL_6
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 256 64.45% 64.45 %     x 98 GRL_6
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 382 61.52% 61.52 %     x 157 GRL_7