CustomCC0-1.0#cptp0072100
Bipartite Path Color Switches
Summary
- •Phase 5 / bfs, multi-state_shortest
- •Reasoning-first competitive programming drill
Problem Description
Given a bipartite graph with n nodes and m edges, each edge colored either red or blue, for q queries of the form (u, v), find the minimal number of color switches needed to travel from u to v.
How to read this problem in plain language:
- This is a Phase 5 reasoning drill focused on bfs, multi-stat.
- Typical lenses to test first: bfs, coloring, graph.
- Constraints reminder: 2 ≤ , 1 ≤ , 1 ≤
Mini examples for mental simulation:
1) Boundary example: Describe why this case is tricky. Explain expected behavior and why naive logic may fail.
2) Adversarial example: Adversarial case where naive greedy/local decision looks correct but fails globally.
Lite-mode writing target:
- Write 1~2 observations that shrink the search space.
- Name one final algorithm and state target complexity explicitly.
- Validate with at least 2 edge cases and one hand simulation.
Constraints
- •2 ≤ , 1 ≤ , 1 ≤
Analysis
Key Insight
The goal is to force explicit intermediate reasoning before revealing more.
bfscoloringgraphqueries