Advanced Techniques

22/25 Solved

Meet in the Middle

C++

Hamming Distance

C++

Corner Subgrid Check

Corner Subgrid Count

C++

Reachable Nodes

C++

Reachability Queries

C++

Cut and Paste

implicit treap

C++

Substring Reversals

implicit treap

C++

Reversals and Sums

implicit treap

C++

Necessary Roads

bridges

C++

Necessary Cities

articulation points

C++

Eulerian Subgraphs

Monster Game I

dp convex hull optimization

C++

Monster Game II

dp convex hull optimization

C++

Subarray Squares

dp convex hull optimization

C++

Houses and Schools

Knuth Division

dp knuth optimization

C++

Apples and Bananas

fft

C++

One Bit Positions

fft

C++

Signal Processing

fft

C++

New Roads Queries

hld

C++

Dynamic Connectivity

dynamic dsu

C++

Parcel Delivery

max flow min cost fixed flow

C++

Task Assignment

max flow min cost

C++

Distinct Routes II

max flow min cost path reconstruction

C++