Open In App

Minimum 1s to lend power to make whole array powerful

Improve
Improve
Like Article
Like
Save
Share
Report

Given a binary array and an integer k where every 1 has power and it can lend power to neighbors and itself. A cell with value 1 can lend power within distance <k. Task is to find the minimum number of 1s that need to lend power so that all cells become powerful.
If it is not possible to make whole array powerful, return -1. 

Examples: 

Input  : arr[] = {0, 1, 1, 1, 1, 0}                
             K = 2 
Output : 2
arr[1] and arr[5] need to lend

Input  :  arr[] = {1, 0, 1, 0, 0, 1, 0, 0, 0, 1}        
              K = 3
Output : 3
a[2], a[5] and a[9] lend to their right side zeros.


Input  :  arr[] = {1, 1, 1}        
              K = 2
Output : 1
arr[1] need to lend power to all cells.

A simple solution is to try all possible combinations of 1s, starting with one 1, then two 1s and so on until we find a combination that makes the whole array powerful.

An efficient solution is based on the observation that there should be a 1 within distance k for every cell. We preprocess the array and create an auxiliary array that stores indexes of closest 1 on left side. We traverse through the whole array and find index of the closest left 1 within k distance of current cell. If there is no left 1, we return -1. Else, we increment ans and move to the next cell after k distance.  

Implementation:

C++




// C++ program to minimum of number of lendings
// by 1s.
#include <bits/stdc++.h>
using namespace std;
  
int minLendings(int arr[], int n, int k)
{
    // Create an auxiliary array and fill 
    // indexes of closest 1s on left side. 
    int leftOne[n];
    int oneInd = -1;
    for (int i = 0; i < n; i++) {
        if (arr[i] == 1)
            oneInd = i;
        leftOne[i] = oneInd;
    }
  
    // Traverse the array from left side. If
    // current element has a 1 on
    int ans = 0;
    for (int i = 0; i < n;) {
   
        // Find index of closest 1 after shift of
        // k-1 or end whichever is closer.
        int pos = leftOne[min(i + k - 1, n - 1)];
  
        // If there is no closest 1 within allowed
        // range. 
        if (pos == -1 || pos + k <= i)
            return -1;
  
        // If a closest 1 is found, check after k
        // jumps and increment answer.
        i = pos + k;
        ans++;
    }
    return ans;
}
  
// Driver code
int main()
{
    int arr[] = { 0, 1, 1, 1, 1, 0 };
    int n = sizeof(arr) / sizeof(arr[0]);
    int k = 2;
    cout << minLendings(arr, n, k);
    return 0;
}


Java




// Java program to minimum of number of 
// lendings by 1s.
import java.math.*;
  
class GFG {
  
static int minLendings(int arr[], int n, int k)
{
    // Create an auxiliary array and fill 
    // indexes of closest 1s on left side. 
    int leftOne[] = new int[n];
    int oneInd = -1;
    for (int i = 0; i < n; i++) {
        if (arr[i] == 1)
            oneInd = i;
        leftOne[i] = oneInd;
    }
  
    // Traverse the array from left side. If
    // current element has a 1 on
    int ans = 0;
    for (int i = 0; i < n;) {
  
        // Find index of closest 1 after shift of
        // k-1 or end whichever is closer.
        int pos = leftOne[(Math.min(i + k - 1, n - 1))];
  
        // If there is no closest 1 within 
        // allowed range. 
        if (pos == -1 || pos + k <= i)
            return -1;
  
        // If a closest 1 is found, check after k
        // jumps and increment answer.
        i = pos + k;
        ans++;
    }
    return ans;
}
  
// Driver code
public static void main(String[] args)
{
    int arr[] = { 0, 1, 1, 1, 1, 0 };
    int n = arr.length;
    int k = 2;
    System.out.println(minLendings(arr, n, k));
}
}
  
// This code is contributed by Prerna Saini


Python3




# Python3 program to minimum
# of number of lendings by 1s.
  
def minLendings(arr, n, k):
  
    # Create an auxiliary array and fill 
    # indexes of closest 1s on left side. 
    leftOne = [0 for i in range(n + 1)]
    oneInd = -1
      
    for i in range(n):
        if (arr[i] == 1):
            oneInd = i
        leftOne[i] = oneInd
  
    # Traverse the array from left side.
    # If current element has a 1 on
    ans = 0; i = 0
      
    while(i < n):
  
        # Find index of closest 1 after shift of
        # k-1 or end whichever is closer.
        pos = leftOne[min(i + k - 1, n - 1)]
  
        # If there is no closest 1  
        # within allowed range. 
        if (pos == -1 or pos + k <= i):
            return -1
  
        # If a closest 1 is found, check after k
        # jumps and increment answer.
        i = pos + k
        ans += 1
      
    return ans
  
# Driver program
arr = [ 0, 1, 1, 1, 1, 0 ]
n = len(arr)
k = 2
print(minLendings(arr, n, k))
  
# This code is contributed by Anant Agarwal.


C#




// C# program to minimum of number of 
// lendings by 1s.
using System;
  
class GFG {
  
    static int minLendings(int []arr, int n, int k)
    {
          
        // Create an auxiliary array and fill 
        // indexes of closest 1s on left side. 
        int []leftOne = new int[n];
        int oneInd = -1;
        for (int i = 0; i < n; i++)
        {
            if (arr[i] == 1)
                oneInd = i;
            leftOne[i] = oneInd;
        }
      
        // Traverse the array from left side.
        // If current element has a 1 on
        int ans = 0;
        for (int i = 0; i < n;)
        {
      
            // Find index of closest 1 after
            // shift of k-1 or end whichever
            // is closer.
            int pos = leftOne[(Math.Min(i + k - 1,
                                          n - 1))];
      
            // If there is no closest 1 within 
            // allowed range. 
            if (pos == -1 || pos + k <= i)
                return -1;
      
            // If a closest 1 is found, check 
            // after k jumps and increment answer.
            i = pos + k;
            ans++;
        }
          
        return ans;
    }
      
    // Driver code
    public static void Main()
    {
        int []arr = { 0, 1, 1, 1, 1, 0 };
        int n = arr.Length;
        int k = 2;
          
        Console.WriteLine(minLendings(arr, n, k));
    }
}
  
// This code is contributed by vt_m.


PHP




<?php
// PHP program to minimum of 
// number of lendings by 1s. 
function minLendings($arr, $n, $k
    // Create an auxiliary array  
    // and fill indexes of closest 
    // 1s on left side. 
    $leftOne[$n] = array(0); 
        $oneInd = -1; 
    for ($i = 0; $i < $n; $i++) 
    
        if ($arr[$i] == 1) 
            $oneInd = $i
        $leftOne[$i] = $oneInd
    
  
    // Traverse the array from 
    // left side. If current 
    // element has a 1 on 
    $ans = 0; 
    for ($i = 0; $i < $n😉 
    
  
        // Find index of closest 1 after 
        // shift of k-1 or end whichever
        // is closer. 
        $pos = $leftOne[min($i + $k - 1, $n - 1)]; 
  
        // If there is no closest 1 
        // within allowed range. 
        if ($pos == -1 || $pos + $k <= $i
            return -1; 
  
        // If a closest 1 is found, check 
        // after k jumps and increment answer. 
        $i = $pos + $k
        $ans++; 
    
    return $ans
  
// Driver code 
$arr = array(0, 1, 1, 1, 1, 0 ); 
$n = sizeof($arr); 
$k = 2; 
echo minLendings($arr, $n, $k); 
  
// This code is contributed by jit_t
?>


Javascript




<script>
    // Javascript program to minimum of number of lendings by 1s.
      
    function minLendings(arr, n, k)
    {
            
        // Create an auxiliary array and fill 
        // indexes of closest 1s on left side. 
        let leftOne = new Array(n);
        let oneInd = -1;
        for (let i = 0; i < n; i++)
        {
            if (arr[i] == 1)
                oneInd = i;
            leftOne[i] = oneInd;
        }
        
        // Traverse the array from left side.
        // If current element has a 1 on
        let ans = 0;
        for (let i = 0; i < n;)
        {
        
            // Find index of closest 1 after
            // shift of k-1 or end whichever
            // is closer.
            let pos = leftOne[(Math.min(i + k - 1, n - 1))];
        
            // If there is no closest 1 within 
            // allowed range. 
            if (pos == -1 || pos + k <= i)
                return -1;
        
            // If a closest 1 is found, check 
            // after k jumps and increment answer.
            i = pos + k;
            ans++;
        }
            
        return ans;
    }
      
    let arr = [ 0, 1, 1, 1, 1, 0 ];
    let n = arr.length;
    let k = 2;
  
    document.write(minLendings(arr, n, k));
          
</script>


Output

2

The time complexity for this algorithm is O(n) .

 



Last Updated : 24 Mar, 2023
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads