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 2460 35.16% 35.16 %     x 433 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 937 57.95% 57.95 %     x 322 GRL_2
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1327 33.16% 33.16 %     x 308 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 995 45.13% 45.13 %     x 279 GRL_1
validator GRL_4_B:   Topological Sort 1 sec 64 MB 651 64.82% 64.82 %     x 247 GRL_4
judge GRL_3_A:   Articulation Points 1 sec 64 MB 907 41.57% 41.57 %     x 225 GRL_3
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 1082 55.91% 55.91 %     x 188 GRL_6
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 535 56.64% 56.64 %     x 187 GRL_5
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 607 61.29% 61.29 %     x 179 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 550 45.09% 45.09 %     x 165 GRL_3
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 775 48.90% 48.90 %     x 140 GRL_5
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 336 61.01% 61.01 %     x 140 GRL_7
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 331 49.85% 49.85 %     x 126 GRL_4
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 215 63.72% 63.72 %     x 81 GRL_6
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 205 46.83% 46.83 %     x 59 GRL_5
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 262 35.11% 35.11 %     x 47 GRL_2