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 2440 35.29% 35.29 %     x 431 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 993 45.02% 45.02 %     x 278 GRL_1
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1311 33.33% 33.33 %     x 305 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 918 58.39% 58.39 %     x 320 GRL_2
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 259 34.75% 34.75 %     x 46 GRL_2
judge GRL_3_A:   Articulation Points 1 sec 64 MB 900 41.44% 41.44 %     x 221 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 542 45.39% 45.39 %     x 163 GRL_3
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 602 60.96% 60.96 %     x 175 GRL_3
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 330 49.70% 49.70 %     x 125 GRL_4
validator GRL_4_B:   Topological Sort 1 sec 64 MB 642 65.11% 65.11 %     x 243 GRL_4
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 535 56.64% 56.64 %     x 187 GRL_5
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 204 46.57% 46.57 %     x 58 GRL_5
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 772 48.83% 48.83 %     x 139 GRL_5
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 1080 55.83% 55.83 %     x 186 GRL_6
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 213 63.38% 63.38 %     x 79 GRL_6
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 329 60.49% 60.49 %     x 136 GRL_7