Sort elements of an array A[] placed on a number line by shifting i-th element to (i + B[i])th positions minimum number of times

Last Updated : 22 Feb, 2023

Given two arrays A[] and B[] consisting of N positive integers such that each array element A[i] is placed at the i^th position on the number line, the task is to find the minimum number of operations required to sort the array elements arranged in the number line. In each operation any array element A[i] can move to the position (i + B[i])^th on the number line. Two or more elements can come to the same number line.

Examples:

Input: A[] = {2, 1, 4, 3}, B[] = {4, 1, 2, 4}
Output: 5
Explanation:

Initially array 2, 1, 4, 3 are placed on the number line at 0, 1, 2, 3 positions respectively.
Operation 1: Move arr[0](= 2) by move[0](= 4). Now the element are arranged as {1, 4, 3, 2} at indices on the number line is {1, 2, 3, 4} respectively.
Operation 2: Move arr[3](= 3) by move[3](= 4). Now the element are arranged as {1, 4, 2, 3} at indices on the number line is {1, 2, 4, 7} respectively.
Operation 3: Move arr[2](= 4) move[2](= 2). Now the element are arranged as {1, 2, 4, 3} at indices on the number line is {1, 4, 4, 7} respectively.
Operation 4: Move arr[3](= 4) move[2](= 2). Now the element are arranged as {1, 2, 3, 4} at indices on the number line is {1, 4, 6, 7} respectively.
Operation 5: In first operation move arr[0](= 2) i.e., 2 by move[0](= 4). Now the element are arranged as {1, 4, 3, 2} at indices on the number line is {1, 4, 7, 8} respectively.

Input: A[] = {1, 2, 3, 4}, B[] = {4, 1, 2, 4}
Output: 0

Approach: The given problem can be solved using the Greedy Approach by moving the greater element one by one to its next possible index and then find the minimum of all the operations required. Follow the steps below to solve the given problem:

Initialize a 2D vectors, say arr[] such that each i^thelement represents the element, corresponding moves, and the current position as {arr[i], A[i], current_position}.
Sort the array arr[] in ascending order.
Initialize two variables, say cnt and f, and Mark count as 0 and flag as 1 to store the number of required operations.
Iterate until F is not equal to 1 and perform the following steps:
- Update the value of F equals 0.
- For each element in vector arr[] and If the value of arr[i][2] is at least arr[i + 1][2], then increment the count by 1, f = 1 and the current position of the (i + 1)^th element i.e., (arr[i + 1][2]) by arr[i + 1][1].
After completing the above steps, print the value of count as the result.

Below is the implementation of the above approach:

C++

// C++ program for the above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to find minimum number of
// operations required to sort N array
// elements placed on a number line
int minHits(int arr[], int move[],
            int n)
{
    // Stores the value of
    // {A[i], B[i], current position}
    vector<vector<int> > V(n, vector<int>(3));
 
    // Populate the current position
    // every elements
    for (int i = 0; i < n; i++) {
        V[i] = { arr[i], move[i], i };
    }
 
    // Sort the vector V
    sort(V.begin(), V.end());
 
    // Stores the total number of
    // operations required
    int cnt = 0;
    int f = 1;
 
    // Iterate until f equals 1
    while (f == 1) {
 
        // Update f equals zero
        f = 0;
 
        // Traverse through vector
        // and check for i and i+1
        for (int i = 0; i < n - 1; i++) {
 
            // If current position of
            // i is at least current
            // position of i+1
            if (V[i][2] >= V[i + 1][2]) {
 
                // Increase the current
                // position of V[i+1][2]
                // by V[i+1][1]
                V[i + 1][2] += V[i + 1][1];
 
                // Increment the count
                // of operations
                cnt++;
 
                // Update the flag equals
                // to 1
                f = 1;
 
                // Break the for loop
                break;
            }
        }
    }
 
    // Return the total operations
    // required
    return cnt;
}
 
// Driver Code
int main()
{
    int A[] = { 2, 1, 4, 3 };
    int B[] = { 4, 1, 2, 4 };
    int N = sizeof(A) / sizeof(A[0]);
 
    cout << minHits(A, B, N);
 
    return 0;
}

Java

// Java program for the above approach
import java.util.Arrays;   
 
class GFG {
 
  // Function to find minimum number of
  // operations required to sort N array
  // elements placed on a number line
  public static int minHits(int arr[], int move[],
                            int n)
  {
    // Stores the value of
    // {A[i], B[i], current position}
    int[][] V = new int[n][3];
 
    // Populate the current position
    // every elements
    for (int i = 0; i < n; i++) {
      V[i][0] = arr[i];
      V[i][1] = move[i];
      V[i][2] = i;
    }
 
    // Sort the vector V
    Arrays.sort(V, (a, b) -> a[0] - b[0]);
 
    // Stores the total number of
    // operations required
    int cnt = 0;
    int f = 1;
 
    // Iterate until f equals 1
    while (f == 1) {
 
      // Update f equals zero
      f = 0;
 
      // Traverse through vector
      // and check for i and i+1
      for (int i = 0; i < n - 1; i++) {
 
        // If current position of
        // i is at least current
        // position of i+1
        if (V[i][2] >= V[i + 1][2]) {
 
          // Increase the current
          // position of V[i+1][2]
          // by V[i+1][1]
          V[i + 1][2] += V[i + 1][1];
 
          // Increment the count
          // of operations
          cnt++;
 
          // Update the flag equals
          // to 1
          f = 1;
 
          // Break the for loop
          break;
        }
      }
    }
 
    // Return the total operations
    // required
    return cnt;
  }
 
  // Driver Code
  public static void main(String[] args)
  {
    int A[] = { 2, 1, 4, 3 };
    int B[] = { 4, 1, 2, 4 };
    int N = A.length;
 
    System.out.println(minHits(A, B, N));
  }
 
}
 
// This code is contributed by Pushpesh Raj.

Python3

# python 3 program for the above approach
 
# Function to find minimum number of
# operations required to sort N array
# elements placed on a number line
def minHits(arr, move, n):
    # Stores the value of
    # {A[i], B[i], current position}
    temp = [0 for i in range(3)]
    V = [temp for i in range(n)] 
 
    # Populate the current position
    # every elements
    for i in range(n):
        V[i] = [arr[i], move[i], i]
 
    # Sort the vector V
    V.sort()
 
    # Stores the total number of
    # operations required
    cnt = 0
    f = 1
 
    # Iterate until f equals 1
    while(f == 1):
        # Update f equals zero
        f = 0
 
        # Traverse through vector
        # and check for i and i+1
        for i in range(n - 1):
            # If current position of
            # i is at least current
            # position of i+1
            if (V[i][2] >= V[i + 1][2]):
                # Increase the current
                # position of V[i+1][2]
                # by V[i+1][1]
                V[i + 1][2] += V[i + 1][1]
 
                # Increment the count
                # of operations
                cnt += 1
 
                # Update the flag equals
                # to 1
                f = 1
 
                # Break the for loop
                break
 
    # Return the total operations
    # required
    return cnt
 
# Driver Code
if __name__ == '__main__':
    A = [2, 1, 4, 3]
    B = [4, 1, 2, 4]
    N = len(A)
    print(minHits(A, B, N))
     
    # This code is contributed by bgangwar59.

C#

// C# program for the above approach
using System;
using System.Linq;
 
class GFG
{
   
  // Function to find minimum number of
  // operations required to sort N array
  // elements placed on a number line
  public static int minHits(int[] arr, int[] move, int n)
  {
     
    // Stores the value of
    // {A[i], B[i], current position}
    int[][] V = new int[n][];
 
    // Populate the current position
    // every elements
    for (int i = 0; i < n; i++)
    {
      V[i] = new int[] { arr[i], move[i], i };
    }
 
    // Sort the vector V
    Array.Sort(V, (a, b) => a[0] - b[0]);
 
    // Stores the total number of
    // operations required
    int cnt = 0;
    int f = 1;
 
    // Iterate until f equals 1
    while (f == 1)
    {
      // Update f equals zero
      f = 0;
 
      // Traverse through vector
      // and check for i and i+1
      for (int i = 0; i < n - 1; i++)
      {
        // If current position of
        // i is at least current
        // position of i+1
        if (V[i][2] >= V[i + 1][2])
        {
          // Increase the current
          // position of V[i+1][2]
          // by V[i+1][1]
          V[i + 1][2] += V[i + 1][1];
 
          // Increment the count
          // of operations
          cnt++;
 
          // Update the flag equals
          // to 1
          f = 1;
 
          // Break the for loop
          break;
        }
      }
    }
 
    // Return the total operations
    // required
    return cnt;
  }
 
  // Driver Code
  public static void Main(string[] args)
  {
    int[] A = new int[] { 2, 1, 4, 3 };
    int[] B = new int[] { 4, 1, 2, 4 };
    int N = A.Length;
 
    Console.WriteLine(minHits(A, B, N));
  }
}
 
// This code is contributed by Aman Kumar.

Javascript

<script>
 
// JavaScript program for the above approach
 
// Function to find minimum number of
// operations required to sort N array
// elements placed on a number line
function minHits(arr, move, n) {
    // Stores the value of
    // {A[i], B[i], current position}
    let V = new Array(n).fill(0).map(() => new Array(3));
 
    // Populate the current position
    // every elements
    for (let i = 0; i < n; i++) {
        V[i] = [arr[i], move[i], i];
    }
 
    // Sort the vector V
    V.sort((a, b) => a[0] - b[0]);
 
    // Stores the total number of
    // operations required
    let cnt = 0;
    let f = 1;
 
    // Iterate until f equals 1
    while (f == 1) {
 
        // Update f equals zero
        f = 0;
 
        // Traverse through vector
        // and check for i and i+1
        for (let i = 0; i < n - 1; i++) {
 
            // If current position of
            // i is at least current
            // position of i+1
            if (V[i][2] >= V[i + 1][2]) {
 
                // Increase the current
                // position of V[i+1][2]
                // by V[i+1][1]
                V[i + 1][2] += V[i + 1][1];
 
                // Increment the count
                // of operations
                cnt++;
 
                // Update the flag equals
                // to 1
                f = 1;
 
                // Break the for loop
                break;
            }
        }
    }
 
    // Return the total operations
    // required
    return cnt;
}
 
// Driver Code
 
let A = [2, 1, 4, 3];
let B = [4, 1, 2, 4];
let N = A.length;
 
document.write(minHits(A, B, N));
 
</script>

Output:

Time Complexity: O(N*log(N))
Auxiliary Space: O(N)

Rearrange array to make Bitwise XOR of similar indexed elements of two arrays is same

vedant_1

Improve

Article Tags :

Practice Tags :

Sort elements of an array A[] placed on a number line by shifting i-th element to (i + B[i])th positions minimum number of times

C++

Java

Python3

C#

Javascript

Similar Reads

Thank You!

What kind of Experience do you want to share?