Title Solved Submit
GRL_2_A : Minimum Spanning Tree
4
4
GRL_2_B : Minimum-Cost Arborescence
1
1
GRL_3_A : Articulation Points
1
1
GRL_3_B : Bridges
1
1
GRL_3_C : Strongly Connected Components
1
1
GRL_4_A : Cycle Detection for a Directed Graph
1
2
GRL_4_B : Topological Sort
0
2
GRL_5_A : Diameter of a Tree
1
1
GRL_5_B : Height of a Tree
1
1
GRL_5_C : Lowest Common Ancestor
1
1
GRL_5_D : Range Query on a Tree
1
1
GRL_5_E : Range Query on a Tree II
1
1
GRL_6_A : Maximum Flow
2
2
GRL_6_B : Minimum Cost Flow
1
1
GRL_7_A : Bipartite Matching
1
2
ALDS1_8_A : Binary Search Tree I
2
3
ALDS1_8_B : Binary Search Tree II
1
2
ALDS1_8_C : Binary Search Tree III
2
2
ALDS1_8_D : Treap
1
1
ALDS1_9_D : Heap Sort
1
1
ALDS1_10_B : Matrix-chain Multiplication
1
1
ALDS1_10_C : Longest Common Subsequence
1
1
ALDS1_10_D : Optimal Binary Search Tree
0
1
ALDS1_13_C : 15 Puzzle
1
1
ALDS1_14_A : Naive String Search
1
1
ALDS1_14_B : String Search
1
1
ALDS1_14_C : Pattern Search
1
1
ALDS1_14_D : String Search
1
2
ALDS1_15_A : Change-Making Problem
1
1
ALDS1_15_B : Fractional Knapsack Problem
0
1
ALDS1_15_C : Activity Selection Problem
1
1
ALDS1_15_D : Huffman Coding
1
1
DSL_1_A : Disjoint Set
1
2
DSL_1_B : Weighted Union Find Trees
1
1
DSL_2_A : Range Minimum Query (RMQ)
1
1
DSL_2_B : Range Sum Query
1
1
DSL_2_C : Range Search (kD Tree)
1
1
DSL_2_D : Range Update Query (RUQ)
1
1
DSL_2_E : Range Add Query (RAQ)
1
1
DSL_2_F : RMQ and RUQ
1
1
DSL_2_G : RSQ and RAQ
1
1
DSL_2_H : RMQ and RAQ
1
3
DSL_2_I : RSQ and RUQ
1
1
DSL_3_A : The Smallest Window I
1
1
DSL_3_B : The Smallest Window II
1
2
DSL_3_C : The Number of Windows
1
1
DSL_3_D : Sliding Minimum Element
1
1
DSL_4_A : Union of Rectangles
1
1
DSL_5_A : The Maximum Number of Customers
1
1
DSL_5_B : The Maximum Number of Overlaps
1
1