Test results - Codility

Tasks Details

medium

1. MinMaxDivision

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] = 2

The 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] = 2

the 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].

Solution

Programming language used JavaScript

Time spent on task 27 minutes

Notes

not defined yet

Code: 13:04:57 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int K, int M, int[] A) {
        // write your code in Java SE 8
    }
}

Code: 13:05:02 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

// 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)
}

Code: 13:14:35 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    
}

Code: 13:14:46 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const 
}

Code: 13:15:16 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const minLargestSum = Math.max(...A);
    const maxLargestSum = Math.
}

Code: 13:15:44 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const minLargestSum = Math.max(...A);
    const maxLargestSum = A.reduce((acc, value) => acc + value, 0);

    console.log(minLargestSum);
    console.log(maxLargestSum);
    
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 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'?

stdout:

5
15

Code: 13:15:56 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const minLargestSum = Math.max(...A);
    const maxLargestSum = A.reduce((acc, value) => acc + value, 0);


}

Code: 13:17:05 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const minLargestSum = Math.max(...A);
    const maxLargestSum = A.reduce((acc, value) => acc + value, 0);

    wh
}

Code: 13:17:15 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    let minLargestSum = Math.max(...A);
    let maxLargestSum = A.reduce((acc, value) => acc + value, 0);

    while ()
}

Code: 13:17:28 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        
    }
}

Code: 13:17:42 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;
    }
}

Code: 13:18:58 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        
    }
}

Code: 13:19:14 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let block = 1;

        for (let i = 0; i < )
    }
}

Code: 13:19:31 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let block = 1;

        for (let i = 0; i < N; i++) {
            
        }
    }
}

Code: 13:19:50 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let block = 1;

        for (let i = 0; i < N; i++) {
            currentSum += A[i];

            if 
        }
    }
}

Code: 13:20:20 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let block = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                
            }
        }
    }
}

Code: 13:20:36 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let block = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                block++;
                currentSum = A[i];
            } else {
                currentSum += A[i];
            }
        }
    }
}

Code: 13:20:53 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let block = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                block++;
                currentSum = A[i];

                if (block >= )
            } else {
                currentSum += A[i];
            }
        }
    }
}

Code: 13:21:59 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (block >= )
            } else {
                currentSum += A[i];
            }
        }
    }
}

Code: 13:22:10 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }
    }
}

Code: 13:22:30 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

                if (block > numberOfBlocks) {
            begin = midpoint + 1;
        // else, it's smaller
        } else {
            result = midpoint;
            end = midpoint - 1;
        }
    }
}

Code: 13:22:44 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
 
        } else {
            result = midpoint;
            end = midpoint - 1;
        }
    }
}

Code: 13:23:01 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;
    
    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }
}

Code: 13:23:12 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    return result;
}

Code: 13:23:31 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

Code: 13:24:32 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;
    

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    return result;
}

Code: 13:24:46 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = (begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

stdout:

5
15
5.5

Code: 13:25:22 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.(begin + end) / 2;

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Code: 13:25:28 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.round((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 6

0.072 s

WRONG ANSWER, got 5 expected 6

stdout:

5
15
5

Code: 13:25:39 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 6

0.076 s

WRONG ANSWER, got 5 expected 6

stdout:

5
15
5

Code: 13:25:45 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.ceil((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 6

0.076 s

WRONG ANSWER, got 5 expected 6

stdout:

5
15
5

Code: 13:26:25 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.f((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Code: 13:26:30 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 6

0.076 s

WRONG ANSWER, got 5 expected 6

stdout:

5
15
5

Code: 13:26:52 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            console.log(currentSum);
            
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Code: 13:27:59 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            console.log(currentSum);
            console

            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Code: 13:28:03 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            console.log(currentSum);
            console.log(blocks);

            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 6

0.076 s

WRONG ANSWER, got 5 expected 6

stdout:

Code: 13:28:27 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        console.log('here')
        console.log(begin);
        console.log(mid);
        console.log(end);
        for (let i = 0; i < N; i++) {
            console.log(currentSum);
            console.log(blocks);

            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks >= K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 6

0.076 s

WRONG ANSWER, got 5 expected 6

stdout:

Code: 13:31:07 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        console.log('here')
        console.log(begin);
        console.log(mid);
        console.log(end);
        for (let i = 0; i < N; i++) {
            console.log(currentSum);
            console.log(blocks);

            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks > K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Code: 13:31:08 UTC, js, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    console.log(begin);
    console.log(end);

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        console.log('here')
        console.log(begin);
        console.log(mid);
        console.log(end);
        for (let i = 0; i < N; i++) {
            console.log(currentSum);
            console.log(blocks);

            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks > K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    console.log(result);

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

Code: 13:31:24 UTC, js, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks > K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

Code: 13:31:35 UTC, js, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks > K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    return result;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 13:31:37 UTC, js, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(K, M, A) {
    const N = A.length;

    let begin = Math.max(...A);
    let end = A.reduce((acc, value) => acc + value, 0);
    let result = 0;

    while (begin <= end) {
        const mid = Math.floor((begin + end) / 2);

        let currentSum = 0;
        let blocks = 1;

        for (let i = 0; i < N; i++) {
            if (currentSum + A[i] > mid) {
                blocks++;
                currentSum = A[i];

                if (blocks > K) {
                    break;
                }
            } else {
                currentSum += A[i];
            }
        }

        if (blocks > K) {
            begin = mid + 1;
        } else {
            result = mid;
            end = mid - 1;
        }
    }

    return result;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N*log(N+M))

expand all Example tests

▶

example
example test

✔

0.068 s

expand all Correctness tests

▶

extreme_single
single elements

✔

0.084 s

0.068 s

▶

extreme_double
single and double elements

✔

0.068 s

▶

extreme_min_max
maximal / minimal values

✔

0.072 s

0.068 s

▶

simple1
simple tests

✔

0.068 s

▶

simple2
simple tests

✔

0.068 s

▶

tiny_random_ones
random values {0, 1}, N = 100

✔

0.068 s

expand all Performance tests

▶

small_random_ones
random values {0, 1}, N = 100

✔

0.068 s

▶

medium_zeros
many zeros and 99 in the middle, length = 15,000

✔

0.088 s

0.092 s

0.088 s

▶

medium_random
random values {1, 100}, N = 20,000

✔

0.096 s

▶

large_random
random values {0, ..., MAX_INT}, N = 100,000

✔

0.140 s

0.144 s

▶

large_random_ones
random values {0, 1}, N = 100,000

✔

0.124 s

▶

all_the_same
all the same values, N = 100,000

✔

0.136 s

0.140 s

0.144 s