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 2118 34.32% 34.32 %     x 369 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 849 44.29% 44.29 %     x 230 GRL_1
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1106 32.82% 32.82 %     x 256 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 762 58.53% 58.53 %     x 266 GRL_2
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 178 38.20% 38.20 %     x 32 GRL_2
judge GRL_3_A:   Articulation Points 1 sec 64 MB 737 42.20% 42.20 %     x 185 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 465 44.30% 44.30 %     x 134 GRL_3
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 470 58.94% 58.94 %     x 133 GRL_3
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 258 51.55% 51.55 %     x 98 GRL_4
validator GRL_4_B:   Topological Sort 1 sec 64 MB 514 64.20% 64.20 %     x 189 GRL_4
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 438 54.79% 54.79 %     x 142 GRL_5
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 165 45.45% 45.45 %     x 43 GRL_5
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 672 48.21% 48.21 %     x 111 GRL_5
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 905 53.15% 53.15 %     x 149 GRL_6
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 132 68.94% 68.94 %     x 53 GRL_6
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 263 62.36% 62.36 %     x 114 GRL_7