Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

Cobaltum 2018

Start date: Feb. 24, 2018, 5 p.m. UTC
Given two sequences of integers, count the minimum number of swaps (A[k], B[k]) needed to make both sequences increasing.

Stats:

2751 started 3 silver awards 79 golden awards

Hall of fame:

1
Peng Cao
Time: 7 minutes
2
Xiaojun Liu
Time: 19 minutes
3
Grzegorz Owsiany
Time: 46 minutes