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 2255 34.59% 34.59 %     x 391 GRL_1
judge GRL_2_A:   Minimum Spanning Tree 1 sec 64 MB 813 58.18% 58.18 %     x 283 GRL_2
judge GRL_1_C:   All Pairs Shortest Path 1 sec 64 MB 1178 33.02% 33.02 %     x 273 GRL_1
judge GRL_1_B:   Single Source Shortest Path (Negative Ed... 1 sec 64 MB 900 44.78% 44.78 %     x 246 GRL_1
validator GRL_4_B:   Topological Sort 1 sec 64 MB 560 65.00% 65.00 %     x 206 GRL_4
judge GRL_3_A:   Articulation Points 1 sec 64 MB 771 42.80% 42.80 %     x 195 GRL_3
judge GRL_6_A:   Maximum Flow 1 sec 64 MB 969 53.87% 53.87 %     x 161 GRL_6
judge GRL_5_A:   Diameter of a Tree 1 sec 64 MB 465 55.27% 55.27 %     x 155 GRL_5
judge GRL_3_C:   Strongly Connected Components 1 sec 64 MB 493 59.43% 59.43 %     x 143 GRL_3
judge GRL_3_B:   Bridges 1 sec 64 MB 476 45.17% 45.17 %     x 141 GRL_3
judge GRL_7_A:   Bipartite Matching 1 sec 64 MB 292 60.62% 60.62 %     x 123 GRL_7
judge GRL_5_C:   Lowest Common Ancestor 1 sec 64 MB 706 48.87% 48.87 %     x 121 GRL_5
judge GRL_4_A:   Cycle Detection for a Directed Graph 1 sec 64 MB 283 51.94% 51.94 %     x 109 GRL_4
judge GRL_6_B:   Minimum Cost Flow 1 sec 64 MB 159 66.67% 66.67 %     x 63 GRL_6
judge GRL_5_B:   Height of a Tree 1 sec 64 MB 176 48.30% 48.30 %     x 48 GRL_5
judge GRL_2_B:   Minimum-Cost Arborescence 1 sec 64 MB 207 37.68% 37.68 %     x 38 GRL_2