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

UPCOMING CHALLENGES:

Germanium 2018

CURRENT CHALLENGES:

Gallium 2018

PAST CHALLENGES

Zinc 2018

Cuprum 2018

Cutting Complexity

Nickel 2018

Cobaltum 2018

Ferrum 2018

Manganum 2017

Chromium 2017

Vanadium 2016

Titanium 2016

Scandium 2016

Calcium 2015

Kalium 2015

Argon 2015

Chlorum 2014

Sulphur 2014

Phosphorus 2014

Silicium 2014

Aluminium 2014

Magnesium 2014

Natrium 2014

Neon 2014

Fluorum 2014

Oxygenium 2014

Nitrogenium 2013

Carbo 2013

Boron 2013

Beryllium 2013

Lithium 2013

Helium 2013

Hydrogenium 2013

Omega 2013

Psi 2012

Chi 2012

Phi 2012

Upsilon 2012

Tau 2012

Sigma 2012

Rho 2012

Pi 2012

Omicron 2012

Xi 2012

Nu 2011

Mu 2011

Lambda 2011

Kappa 2011

Iota 2011

Theta 2011

Eta 2011

Zeta 2011

Epsilon 2011

Delta 2011

Gamma 2011

Beta 2010

Alpha 2010

respectable

Given two sequences of integers, count the minimum number of swaps (A[k], B[k]) needed to make both sequences increasing.

Programming language:
Spoken language:

You have two sequences A and B consisting of integers, both of length N, and you would like them to be (strictly) increasing, i.e. for each K (0 ≤ K < N − 1), A[K] < A[K + 1] and B[K] < B[K + 1]. Thus, you need to modify the sequences, but the only manipulation you can perform is to swap an arbitrary element in sequence A with the corresponding element in sequence B. That is, both elements to be exchanged must occupy the same index position within each sequence.

For example, given A = [5, 3, 7, 7, 10] and B = [1, 6, 6, 9, 9], you can swap elements at positions 1 and 3, obtaining A = [5, 6, 7, 9, 10], B = [1, 3, 6, 7, 9].

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

int solution(int A[], int B[], int N);

that, given two arrays A, B of length N, containing integers, returns the minimum number of swapping operations required to make the given arrays increasing. If it is impossible to achieve the goal, return −1.

For example, given:

your function should return 2, as explained above.

Given:

your function should return −1, since you cannot perform operations that would make the sequences become increasing.

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

You have two sequences A and B consisting of integers, both of length N, and you would like them to be (strictly) increasing, i.e. for each K (0 ≤ K < N − 1), A[K] < A[K + 1] and B[K] < B[K + 1]. Thus, you need to modify the sequences, but the only manipulation you can perform is to swap an arbitrary element in sequence A with the corresponding element in sequence B. That is, both elements to be exchanged must occupy the same index position within each sequence.

For example, given A = [5, 3, 7, 7, 10] and B = [1, 6, 6, 9, 9], you can swap elements at positions 1 and 3, obtaining A = [5, 6, 7, 9, 10], B = [1, 3, 6, 7, 9].

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

int solution(vector<int> &A, vector<int> &B);

that, given two arrays A, B of length N, containing integers, returns the minimum number of swapping operations required to make the given arrays increasing. If it is impossible to achieve the goal, return −1.

For example, given:

your function should return 2, as explained above.

Given:

your function should return −1, since you cannot perform operations that would make the sequences become increasing.

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

You have two sequences A and B consisting of integers, both of length N, and you would like them to be (strictly) increasing, i.e. for each K (0 ≤ K < N − 1), A[K] < A[K + 1] and B[K] < B[K + 1]. Thus, you need to modify the sequences, but the only manipulation you can perform is to swap an arbitrary element in sequence A with the corresponding element in sequence B. That is, both elements to be exchanged must occupy the same index position within each sequence.

For example, given A = [5, 3, 7, 7, 10] and B = [1, 6, 6, 9, 9], you can swap elements at positions 1 and 3, obtaining A = [5, 6, 7, 9, 10], B = [1, 3, 6, 7, 9].

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

class Solution { public int solution(int[] A, int[] B); }

that, given two arrays A, B of length N, containing integers, returns the minimum number of swapping operations required to make the given arrays increasing. If it is impossible to achieve the goal, return −1.

For example, given:

your function should return 2, as explained above.

Given:

your function should return −1, since you cannot perform operations that would make the sequences become increasing.

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

func Solution(A []int, B []int) int

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

class Solution { public int solution(int[] A, int[] B); }

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

function solution(A, B);

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

function solution(A, B)

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Note: All arrays in this task are zero-indexed, unlike the common Lua convention. You can use `#A` to get the length of the array A.

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

int solution(NSMutableArray *A, NSMutableArray *B);

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

function solution(A: array of longint; B: array of longint; N: longint): longint;

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

function solution($A, $B);

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

sub solution { my ($A, $B)=@_; my @A=@$A; my @B=@$B; ... }

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

def solution(A, B)

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

def solution(a, b)

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

object Solution { def solution(a: Array[Int], b: Array[Int]): Int }

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

public func solution(inout A : [Int], inout _ B : [Int]) -> Int

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

public func solution(_ A : inout [Int], _ B : inout [Int]) -> Int

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Your goal is make both sequences increasing, using the smallest number of moves.

Write a function:

Private Function solution(A As Integer(), B As Integer()) As Integer

For example, given:

your function should return 2, as explained above.

Given:

Given:

your function should return 0, since the sequences are already increasing.

Assume that:

- N is an integer within the range [2..100,000];
- each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
- A and B have equal lengths.

Complexity:

- expected worst-case time complexity is O(N);

Information about upcoming challenges, solutions and lessons directly in your inbox.

© 2009–2018 Codility Ltd., registered in England and Wales (No. 7048726). VAT ID GB981191408. Registered office: 107 Cheapside, London EC2V 6DN