Tasks Details
medium
Divide array A into K blocks and minimize the largest sum of any block.
Task Score
100%
Correctness
100%
Performance
100%
You are given integers K, M and a non-empty array A consisting of N integers. Every element of the array is not greater than M.
You should divide this array into K blocks of consecutive elements. The size of the block is any integer between 0 and N. Every element of the array should belong to some block.
The sum of the block from X to Y equals A[X] + A[X + 1] + ... + A[Y]. The sum of empty block equals 0.
The large sum is the maximal sum of any block.
For example, you are given integers K = 3, M = 5 and array A such that:
A[0] = 2 A[1] = 1 A[2] = 5 A[3] = 1 A[4] = 2 A[5] = 2 A[6] = 2The array can be divided, for example, into the following blocks:
- [2, 1, 5, 1, 2, 2, 2], [], [] with a large sum of 15;
- [2], [1, 5, 1, 2], [2, 2] with a large sum of 9;
- [2, 1, 5], [], [1, 2, 2, 2] with a large sum of 8;
- [2, 1], [5, 1], [2, 2, 2] with a large sum of 6.
The goal is to minimize the large sum. In the above example, 6 is the minimal large sum.
Write a function:
function solution(K, M, A);
that, given integers K, M and a non-empty array A consisting of N integers, returns the minimal large sum.
For example, given K = 3, M = 5 and array A such that:
A[0] = 2 A[1] = 1 A[2] = 5 A[3] = 1 A[4] = 2 A[5] = 2 A[6] = 2the function should return 6, as explained above.
Write an efficient algorithm for the following assumptions:
- N and K are integers within the range [1..100,000];
- M is an integer within the range [0..10,000];
- each element of array A is an integer within the range [0..M].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 101 minutes
Notes
not defined yet
Task timeline
Code: 15:27:07 UTC,
java,
autosave
Code: 16:37:47 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
Code: 17:06:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
let upperBound = A.reduce((sum, element) => (sum += element));
let lowerBound = Math.max(...A);
if (K === 1) return upperBound;
if (K >= A.length) return lowerBound;
const canBeSegmented = (A, maxBlockCount, maxBlockSum) => {
let blockCount = 1;
let blockSum = 0;
for (const element of A) {
if (blockSum + element <= maxBlockSum) {
blockSum += element;
} else {
blockSum = element;
blockCount++;
}
if (blockCount > maxBlockCount) return false;
}
return true;
};
while (lowerBound <= upperBound) {
let mid = Math.floor((lowerBound + upperBound) / 2);
if (canBeSegmented(A, K, mid)) {
upperBound = mid - 1;
} else lowerBound = mid + 1;
}
return lowerBound;
}
Code: 17:06:59 UTC,
js,
verify,
result: Passed
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
let upperBound = A.reduce((sum, element) => (sum += element));
let lowerBound = Math.max(...A);
if (K === 1) return upperBound;
if (K >= A.length) return lowerBound;
const canBeSegmented = (A, maxBlockCount, maxBlockSum) => {
let blockCount = 1;
let blockSum = 0;
for (const element of A) {
if (blockSum + element <= maxBlockSum) {
blockSum += element;
} else {
blockSum = element;
blockCount++;
}
if (blockCount > maxBlockCount) return false;
}
return true;
};
while (lowerBound <= upperBound) {
let mid = Math.floor((lowerBound + upperBound) / 2);
if (canBeSegmented(A, K, mid)) {
upperBound = mid - 1;
} else lowerBound = mid + 1;
}
return lowerBound;
}
Analysis
Code: 17:07:02 UTC,
js,
verify,
result: Passed
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
let upperBound = A.reduce((sum, element) => (sum += element));
let lowerBound = Math.max(...A);
if (K === 1) return upperBound;
if (K >= A.length) return lowerBound;
const canBeSegmented = (A, maxBlockCount, maxBlockSum) => {
let blockCount = 1;
let blockSum = 0;
for (const element of A) {
if (blockSum + element <= maxBlockSum) {
blockSum += element;
} else {
blockSum = element;
blockCount++;
}
if (blockCount > maxBlockCount) return false;
}
return true;
};
while (lowerBound <= upperBound) {
let mid = Math.floor((lowerBound + upperBound) / 2);
if (canBeSegmented(A, K, mid)) {
upperBound = mid - 1;
} else lowerBound = mid + 1;
}
return lowerBound;
}
Analysis
Code: 17:07:05 UTC,
js,
final,
score:
100
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
let upperBound = A.reduce((sum, element) => (sum += element));
let lowerBound = Math.max(...A);
if (K === 1) return upperBound;
if (K >= A.length) return lowerBound;
const canBeSegmented = (A, maxBlockCount, maxBlockSum) => {
let blockCount = 1;
let blockSum = 0;
for (const element of A) {
if (blockSum + element <= maxBlockSum) {
blockSum += element;
} else {
blockSum = element;
blockCount++;
}
if (blockCount > maxBlockCount) return false;
}
return true;
};
while (lowerBound <= upperBound) {
let mid = Math.floor((lowerBound + upperBound) / 2);
if (canBeSegmented(A, K, mid)) {
upperBound = mid - 1;
} else lowerBound = mid + 1;
}
return lowerBound;
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N+M))
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
expand all
Performance tests
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.092 s
OK
2.
0.116 s
OK
3.
0.104 s
OK
4.
0.100 s
OK
1.
0.120 s
OK
2.
0.124 s
OK
3.
0.124 s
OK
4.
0.116 s
OK
1.
0.200 s
OK
2.
0.196 s
OK
3.
0.192 s
OK
4.
0.184 s
OK
1.
0.116 s
OK
2.
0.164 s
OK
3.
0.164 s
OK
4.
0.152 s
OK
1.
0.124 s
OK
2.
0.200 s
OK
3.
0.196 s
OK
4.
0.124 s
OK