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 2335 34.82% 34.82 %     x 408 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 863 58.52% 58.52 %     x 299 GRL_2
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1249 33.23% 33.23 %     x 289 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 937 45.04% 45.04 %     x 260 GRL_1
validator GRL_4_B:   Topological Sort 1 sec 64 MB 622 64.63% 64.63 %     x 231 GRL_4
judge GRL_3_A:   Articulation Points 1 sec 64 MB 846 42.55% 42.55 %     x 211 GRL_3
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 500 56.00% 56.00 %     x 173 GRL_5
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 1018 54.72% 54.72 %     x 169 GRL_6
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 550 59.45% 59.45 %     x 160 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 507 45.76% 45.76 %     x 152 GRL_3
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 743 48.99% 48.99 %     x 133 GRL_5
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 310 61.29% 61.29 %     x 132 GRL_7
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 312 50.96% 50.96 %     x 120 GRL_4
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 190 63.68% 63.68 %     x 69 GRL_6
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 184 48.37% 48.37 %     x 52 GRL_5
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 235 37.45% 37.45 %     x 45 GRL_2