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 2614 35.39% 35.39 %     x 461 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 1023 57.87% 57.87 %     x 343 GRL_2
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1452 33.26% 33.26 %     x 329 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 1076 45.26% 45.26 %     x 300 GRL_1
validator GRL_4_B:   Topological Sort 1 sec 64 MB 708 65.40% 65.40 %     x 268 GRL_4
judge GRL_3_A:   Articulation Points 1 sec 64 MB 979 41.27% 41.27 %     x 242 GRL_3
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 1174 57.24% 57.24 %     x 218 GRL_6
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 581 56.63% 56.63 %     x 203 GRL_5
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 661 60.21% 60.21 %     x 196 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 584 45.89% 45.89 %     x 179 GRL_3
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 841 48.87% 48.87 %     x 157 GRL_5
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 382 61.52% 61.52 %     x 157 GRL_7
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 360 51.94% 51.94 %     x 143 GRL_4
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 255 64.31% 64.31 %     x 97 GRL_6
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 231 47.62% 47.62 %     x 70 GRL_5
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 290 33.45% 33.45 %     x 51 GRL_2