Codeforces ITMO Academy: pilot course

• Two Pointers Method: Solution

  • Step 1
    • A - Merging Arrays
    • B - Number of Smaller
    • C - Number of Equal
  • Step 2
    • A - Segment with Small Sum
    • B - Segment with Big Sum
    • C - Number of Segments with Small Sum
    • D - Number of Segments with Big Sum
    • E - Segments with Small Set
    • F - Segments with Small Spread
    • G - Coprime Segment
  • Step 3
    • A - Looped Playlist
    • B - Total Length
    • C - Che city
    • D - Stylish clothes
    • E - Knapsack on a Segment
    • F - Card Substrings
    • G - Not Very Rude Substring
    • H - A-B Knapsack
    • I - Segment with the Required Subset

• Disjoint Sets Union: Solution

  • Step 1
    • A - Disjoint Sets Union
    • B - Disjoint Sets Union 2
    • C - Experience
    • D - Cutting a graph
    • E - Monkeys
  • Step 2
    • A - People are leaving
    • B - Parking
    • C - Restructuring Company
    • D - Bosses
    • E - Spanning Tree
    • F - Dense spanning tree
    • G - No refuel
    • H - Oil business
    • I - Bipartite Graph
    • J - First Non-Bipartite Edge
  • Step 3
    • A - DSU with rollback
    • B - Number of Connected Components on Segments
    • C - Dynamic Connectivity Offline