Codeforces Round 1099 (Div. 2)

• A. Construct an Array
  • Hints: Construct an Array
  • Code: Construct an Array
• B. Another Sorting Problem
  • Hints: Another Sorting Problem
  • Code: Another Sorting Problem
• C. Chipmunk Theo and Equality
  • Hints: Chipmunk Theo and Equality
  • Code: Chipmunk Theo and Equality
• D. Maximum Prefix Sums
  • Hints: Maximum Prefix Sums
  • Code: Maximum Prefix Sums
• F. Quadratic Jumps
  • Hints: Quadratic Jumps
  • Code: Quadratic Jumps
• E0. Graph Cutting (Two Vertices, Any Size)
  • Hints: Graph Cutting (Two Vertices, Any Size)
  • Editorial: Graph Cutting (Two Vertices, Any Size)
  • Code: Graph Cutting (Two Vertices, Any Size)
• E1. Graph Cutting (Two Vertices, Fixed Size)
  • Hints: Graph Cutting (Two Vertices, Fixed Size)
  • Editorial: Graph Cutting (Two Vertices, Fixed Size)
  • Code: Graph Cutting (Two Vertices, Fixed Size)
• E2. Graph Cutting (Two Vertices, All Pairs)
  • Hints: Graph Cutting (Two Vertices, All Pairs)
  • Editorial: Graph Cutting (Two Vertices, All Pairs)
  • Code: Graph Cutting (Two Vertices, All Pairs)
• E3. Graph Cutting (Three Vertices, Any Size)
  • Hints: Graph Cutting (Three Vertices, Any Size)
  • Editorial: Graph Cutting (Three Vertices, Any Size)
  • Code: Graph Cutting (Three Vertices, Any Size)
• E4. Graph Cutting (Three Vertices, Fixed Size)
  • Hints: Graph Cutting (Three Vertices, Fixed Size)
  • Editorial: Graph Cutting (Three Vertices, Fixed Size)
  • Code: Graph Cutting (Three Vertices, Fixed Size)
• E. Graph Cutting
  • Hints: Graph Cutting
  • Editorial: Graph Cutting
  • Code: Graph Cutting