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 2812 35.60% 35.60 %     x 496 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 1130 45.84% 45.84 %     x 319 GRL_1
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1636 33.56% 33.56 %     x 369 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 1094 58.41% 58.41 %     x 371 GRL_2
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 313 33.55% 33.55 %     x 56 GRL_2
judge GRL_3_A:   Articulation Points 1 sec 64 MB 1031 41.22% 41.22 %     x 254 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 606 45.87% 45.87 %     x 185 GRL_3
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 720 60.56% 60.56 %     x 209 GRL_3
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 394 50.76% 50.76 %     x 154 GRL_4
validator GRL_4_B:   Topological Sort 1 sec 64 MB 769 64.89% 64.89 %     x 289 GRL_4
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 610 56.89% 56.89 %     x 214 GRL_5
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 258 43.80% 43.80 %     x 72 GRL_5
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 901 50.06% 50.06 %     x 171 GRL_5
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 1295 58.07% 58.07 %     x 241 GRL_6
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 296 63.18% 63.18 %     x 111 GRL_6
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 425 60.00% 60.00 %     x 168 GRL_7