The Painter's Partition Problem using Binary Search
Last Updated :
29 Apr, 2025
Given an array arr[] and k, where the array represents the boards and each element of the given array represents the length of each board. k numbers of painters are available to paint these boards. Consider that each unit of a board takes 1 unit of time to paint.
The task is to find the minimum time to get this job done by painting all the boards under the constraint that any painter will only paint the continuous sections of boards. say board [2, 3, 4] or only board [1] or nothing but not board [2, 4, 5].
Examples:
Input: arr[] = [5, 10, 30, 20, 15], k = 3
Output: 35
Explanation: The most optimal way will be:
Painter 1 allocation : [5,10]
Painter 2 allocation : [30]
Painter 3 allocation : [20, 15]
Job will be done when all painters finish i.e. at time = max(5 + 10, 30, 20 + 15) = 35
Input: arr[] = [10, 20, 30, 40], k = 2
Output: 60
Explanation: The most optimal way to paint:
Painter 1 allocation : [10, 20, 30]
Painter 2 allocation : [40]
Job will be complete at time = 60
Input: arr[] = [100, 200, 300, 400], k = 1
Output: 1000
In the Painter's Partition Problem, we've previously explored a dynamic programming based approach with a time complexity of O(k*(n^2)) and an extra space of O(k*n). In this article, we present a more optimized solution using Binary Search, significantly improving the overall efficiency.
Approach:
The idea is based on the observation that if we fix a time limit (say mid), we can check whether it's possible to divide the boards among k painters such that no one paints for more than this time. We apply Binary Search on the answer space to minimize the maximum time taken by any painter.
- The highest possible value in this range is the sum of all elements in the array - this represents the case when one painter paints all the boards.
- The lowest possible value is the maximum element of the array - this ensures at least one painter paints the largest board, and others are assigned workloads not exceeding this value.
- For each mid value, we simulate the partitioning and check if it's feasible using the given number of painters.
- As the time limit increases, the number of painters required decreases, and vice versa. This monotonic property ensures the search space is ordered, making it ideal for binary search.
C++
// C++ program to find the minimum time for
// painter's partition problem using Binary Search.
#include <bits/stdc++.h>
using namespace std;
// Function to check if it is possible to
// paint all boards by k painters such that no
// painter paints more than maxTime
bool isPossible(int maxTime, vector<int> &arr, int k) {
int painters = 1;
int currSum = 0;
for (int i = 0; i < arr.size(); i++) {
// If a single board exceeds maxTime,
// return false
if (arr[i] > maxTime) {
return false;
}
// If adding current board exceeds
// limit, assign to next painter
if (currSum + arr[i] > maxTime) {
painters++;
currSum = arr[i];
} else {
currSum += arr[i];
}
}
// Return true if total painters used is <= k
return painters <= k;
}
int minTime(vector<int> &arr, int k) {
int n = arr.size();
// Find the maximum board length manually
int maxBoard = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] > maxBoard) {
maxBoard = arr[i];
}
}
// Find the sum of all board lengths manually
int totalSum = 0;
for (int i = 0; i < n; i++) {
totalSum += arr[i];
}
// Apply Binary Search between
// maxBoard and totalSum
int low = maxBoard;
int high = totalSum;
int res = totalSum;
while (low <= high) {
int mid = (low + high) / 2;
// If it is possible with max workload as mid
if (isPossible(mid, arr, k)) {
res = mid;
// try to minimize further
high = mid - 1;
} else {
// need more time
low = mid + 1;
}
}
return res;
}
int main() {
vector<int> arr = {5, 10, 30, 20, 15};
int k = 3;
int res = minTime(arr, k);
cout << res << endl;
return 0;
}
// Java program to find the minimum time for
// painter's partition problem using Binary Search.
class GfG {
// Function to check if it is possible to
// paint all boards by k painters such that no
// painter paints more than maxTime
static boolean isPossible(int maxTime, int[] arr, int k) {
int painters = 1;
int currSum = 0;
for (int i = 0; i < arr.length; i++) {
// If a single board exceeds maxTime,
// return false
if (arr[i] > maxTime) {
return false;
}
// If adding current board exceeds
// limit, assign to next painter
if (currSum + arr[i] > maxTime) {
painters++;
currSum = arr[i];
} else {
currSum += arr[i];
}
}
// Return true if total painters used is <= k
return painters <= k;
}
static int minTime(int[] arr, int k) {
int n = arr.length;
// Find the maximum board length manually
int maxBoard = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] > maxBoard) {
maxBoard = arr[i];
}
}
// Find the sum of all board lengths manually
int totalSum = 0;
for (int i = 0; i < n; i++) {
totalSum += arr[i];
}
// Apply Binary Search between
// maxBoard and totalSum
int low = maxBoard;
int high = totalSum;
int res = totalSum;
while (low <= high) {
int mid = (low + high) / 2;
// If it is possible with max workload as mid
if (isPossible(mid, arr, k)) {
res = mid;
// try to minimize further
high = mid - 1;
} else {
// need more time
low = mid + 1;
}
}
return res;
}
public static void main(String[] args) {
int[] arr = {5, 10, 30, 20, 15};
int k = 3;
int res = minTime(arr, k);
System.out.println(res);
}
}
# Python program to find the minimum time for
# painter's partition problem using Binary Search.
def isPossible(maxTime, arr, k):
painters = 1
currSum = 0
for i in range(len(arr)):
# If a single board exceeds maxTime,
# return false
if arr[i] > maxTime:
return False
# If adding current board exceeds
# limit, assign to next painter
if currSum + arr[i] > maxTime:
painters += 1
currSum = arr[i]
else:
currSum += arr[i]
# Return true if total painters used is <= k
return painters <= k
def minTime(arr, k):
n = len(arr)
# Find the maximum board length manually
maxBoard = arr[0]
for i in range(1, n):
if arr[i] > maxBoard:
maxBoard = arr[i]
# Find the sum of all board lengths manually
totalSum = 0
for i in range(n):
totalSum += arr[i]
# Apply Binary Search between
# maxBoard and totalSum
low = maxBoard
high = totalSum
res = totalSum
while low <= high:
mid = (low + high) // 2
# If it is possible with max workload as mid
if isPossible(mid, arr, k):
res = mid
# try to minimize further
high = mid - 1
else:
# need more time
low = mid + 1
return res
if __name__ == "__main__":
arr = [5, 10, 30, 20, 15]
k = 3
res = minTime(arr, k)
print(res)
// C# program to find the minimum time for
// painter's partition problem using Binary Search.
using System;
class GfG {
// Function to check if it is possible to
// paint all boards by k painters such that no
// painter paints more than maxTime
static bool isPossible(int maxTime, int[] arr, int k) {
int painters = 1;
int currSum = 0;
for (int i = 0; i < arr.Length; i++) {
// If a single board exceeds maxTime,
// return false
if (arr[i] > maxTime) {
return false;
}
// If adding current board exceeds
// limit, assign to next painter
if (currSum + arr[i] > maxTime) {
painters++;
currSum = arr[i];
} else {
currSum += arr[i];
}
}
// Return true if total painters used is <= k
return painters <= k;
}
static int minTime(int[] arr, int k) {
int n = arr.Length;
// Find the maximum board length manually
int maxBoard = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] > maxBoard) {
maxBoard = arr[i];
}
}
// Find the sum of all board lengths manually
int totalSum = 0;
for (int i = 0; i < n; i++) {
totalSum += arr[i];
}
// Apply Binary Search between
// maxBoard and totalSum
int low = maxBoard;
int high = totalSum;
int res = totalSum;
while (low <= high) {
int mid = (low + high) / 2;
// If it is possible with max workload as mid
if (isPossible(mid, arr, k)) {
res = mid;
// try to minimize further
high = mid - 1;
} else {
// need more time
low = mid + 1;
}
}
return res;
}
static void Main() {
int[] arr = {5, 10, 30, 20, 15};
int k = 3;
int res = minTime(arr, k);
Console.WriteLine(res);
}
}
// JavaScript program to find the minimum time for
// painter's partition problem using Binary Search.
function isPossible(maxTime, arr, k) {
let painters = 1;
let currSum = 0;
for (let i = 0; i < arr.length; i++) {
// If a single board exceeds maxTime,
// return false
if (arr[i] > maxTime) {
return false;
}
// If adding current board exceeds
// limit, assign to next painter
if (currSum + arr[i] > maxTime) {
painters++;
currSum = arr[i];
} else {
currSum += arr[i];
}
}
// Return true if total painters used is <= k
return painters <= k;
}
function minTime(arr, k) {
let n = arr.length;
// Find the maximum board length manually
let maxBoard = arr[0];
for (let i = 1; i < n; i++) {
if (arr[i] > maxBoard) {
maxBoard = arr[i];
}
}
// Find the sum of all board lengths manually
let totalSum = 0;
for (let i = 0; i < n; i++) {
totalSum += arr[i];
}
// Apply Binary Search between
// maxBoard and totalSum
let low = maxBoard;
let high = totalSum;
let res = totalSum;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
// If it is possible with max workload as mid
if (isPossible(mid, arr, k)) {
res = mid;
// try to minimize further
high = mid - 1;
} else {
// need more time
low = mid + 1;
}
}
return res;
}
// Driver Code
let arr = [5, 10, 30, 20, 15];
let k = 3;
let res = minTime(arr, k);
console.log(res);
Time Complexity: O(n*log(sum(arr) - MAX)), as we perform Binary Search on the answer space from maximum board length to total sum, and for each mid value, we iterate over all n boards to check feasibility.
Space Complexity: O(1), as the approach uses constant space.
Similar Reads
Basics & Prerequisites
Data Structures
Getting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr
14 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem