Minimum Swaps To Make Sequences Increasing

Given two equal-length arrays where you may swap elements only at the same indices, find the minimum number of index-wise swaps to make both arrays strictly increasing. This is a two-state dynamic programming problem (swap vs no-swap at each index) that scans once to choose valid transitions efficiently for n up to 1e5.