Tasks Details
medium
Given N rectangular buildings of width 1, find the minimum total area of two rectangular banners that cover all of the buildings.
Task Score
100%
Correctness
100%
Performance
100%
There are N rectangular buildings standing along the road next to each other. The K-th building is of size H[K] × 1.
Because a renovation of all of the buildings is planned, we want to cover them with rectangular banners until the renovations are finished. Of course, to cover a building, the banner has to be at least as high as the building. We can cover more than one building with a banner if it is wider than 1.
For example, to cover buildings of heights 3, 1, 4 we could use a banner of size 4×3 (i.e. of height 4 and width 3), marked here in blue:
We can order at most two banners and we want to cover all of the buildings. Also, we want to minimize the amount of material needed to produce the banners.
What is the minimum total area of at most two banners which cover all of the buildings?
Write a function:
function solution(H);
that, given an array H consisting of N integers, returns the minimum total area of at most two banners that we will have to order.
Examples:
1. Given H = [3, 1, 4], the function should return 10. The result can be achieved by covering the first two buildings with a banner of size 3×2 and the third building with a banner of size 4×1:
2. Given H = [5, 3, 2, 4], the function should return 17. The result can be achieved by covering the first building with a banner of size 5×1 and the other buildings with a banner of size 4×3:
3. Given H = [5, 3, 5, 2, 1], your function should return 19. The result can be achieved by covering the first three buildings with a banner of size 5×3 and the other two with a banner of size 2×2:
4. Given H = [7, 7, 3, 7, 7], your function should return 35. The result can be achieved by using one banner of size 7×5:
5. Given H = [1, 1, 7, 6, 6, 6], your function should return 30. The result can be achieved by using banners of size 1×2 and 7×4:
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array H is an integer within the range [1..10,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 54 minutes
Notes
not defined yet
Code: 17:27:36 UTC,
java,
autosave
Code: 17:57:09 UTC,
js,
autosave
Code: 17:57:21 UTC,
js,
autosave
Code: 17:57:41 UTC,
js,
autosave
Code: 17:58:00 UTC,
js,
autosave
Code: 17:58:20 UTC,
js,
autosave
Code: 17:58:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
return H
}
Code: 17:59:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
return H.length *
}
Code: 17:59:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 17:59:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 17:59:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
for (let i = H.length-1; i > H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 17:59:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
for (let i = H.length-1; i >= 0; i--) {
forward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 17:59:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
for (let i = H.length-2; i >= 0; i--) {
forward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:00:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
for (let i = H.length-2; i >= 0; i--) {
backward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:00:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
}
for (let i = H.length-2; i >= 0; i--) {
backward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:01:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-1-i] =
}
for (let i = H.length-2; i >= 0; i--) {
backward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:01:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-1-i] = H[]
}
for (let i = H.length-2; i >= 0; i--) {
backward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:01:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-1-i] = H[H.length-1]
}
for (let i = H.length-2; i >= 0; i--) {
backward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:01:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-1-i] = H[H.length-1] * (i + 1)
}
for (let i = H.length-2; i >= 0; i--) {
backward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:02:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-2] * (i + 1)
}
for (let i = H.length-2; i >= 0; i--) {
backward[i] = H[i] * (i + 1);
}
return H.length * max;
}
Code: 18:02:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-2] * (i + 1)
}
return H.length * max;
}
Code: 18:02:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1)
}
return H.length * max;
}
Code: 18:02:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1)
}
return H.length * max;
}
Code: 18:03:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1)
}
for (let i = 0; i < forward.length; i++)
return H.length * max;
}
Code: 18:03:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1)
}
for (let i = 0; i < forward.length; i++) {
}
return H.length * max;
}
Code: 18:04:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1)
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
return H.length * max;
}
Code: 18:04:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
return H.length * max;
}
Code: 18:04:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
areas]
}
return H.length * max;
}
Code: 18:05:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
areas[]
}
return H.length * max;
}
Code: 18:05:31 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
areas[]
}
return H.length * max;
}
Code: 18:05:41 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
areas[]
}
return H.length * max;
}
Code: 18:06:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
let minArea =
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
areas[]
}
return H.length * max;
}
Code: 18:06:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
let minArea = 0;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
areas[]
}
return H.length * max;
}
Code: 18:06:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
let minArea;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
areas[i]
}
return H.length * max;
}
Code: 18:06:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
let minArea;
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
for (let i = 0; i < areas.length; i++) {
if (areas[i]
}
return H.length * max;
}
Code: 18:06:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
for (let i = 0; i < areas.length; i++) {
if (areas[i]
}
return H.length * max;
}
Code: 18:07:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea
}
}
return H.length * max;
}
Code: 18:07:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea[])
return H.length * max;
}
Code: 18:07:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < )
return H.length * max;
}
Code: 18:08:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
}
return ;
}
Code: 18:08:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:09:04 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:09:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:09:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:09:40 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 6 expected 10
1.
0.068 s
WRONG ANSWER,
got 10 expected 17
1.
0.068 s
WRONG ANSWER,
got 9 expected 19
1.
0.076 s
WRONG ANSWER,
got 23 expected 35
1.
0.068 s
WRONG ANSWER,
got 26 expected 30
expand all
User tests
1.
0.068 s
OK
function result: 26
function result: 26
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 23
function result: 23
1.
0.068 s
OK
function result: 10
function result: 10
User test case 1:
[1, 1, 7, 6, 6, 6]
User test case 2:
[2]
User test case 3:
[7, 7, 3, 7, 7]
User test case 4:
[5, 3, 2, 4]
Code: 18:10:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:10:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:10:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:10:55 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
if (max < H[i]) {
max = H[i];
}
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 6 expected 10
stdout:
[ 3, 2 ] [ 8, 4 ] [ 11, 6 ]
1.
0.076 s
WRONG ANSWER,
got 10 expected 17
stdout:
[ 5, 6, 6 ] [ 12, 8, 4 ] [ 17, 14, 10 ]
1.
0.076 s
WRONG ANSWER,
got 9 expected 19
stdout:
[ 5, 6, 15, 8 ] [ 4, 3, 2, 1 ] [ 9, 9, 17, 9 ]
1.
0.072 s
WRONG ANSWER,
got 23 expected 35
stdout:
[ 7, 14, 9, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 23, 35 ]
1.
0.072 s
WRONG ANSWER,
got 26 expected 30
stdout:
[ 1, 2, 21, 24, 30 ] [ 30, 24, 18, 12, 6 ] [ 31, 26, 39, 36, 36 ]
expand all
User tests
1.
0.072 s
OK
function result: 26
function result: 26
stdout:
[ 1, 2, 21, 24, 30 ] [ 30, 24, 18, 12, 6 ] [ 31, 26, 39, 36, 36 ]
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
[] [] []
1.
0.076 s
OK
function result: 23
function result: 23
stdout:
[ 7, 14, 9, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 23, 35 ]
1.
0.072 s
OK
function result: 10
function result: 10
stdout:
[ 5, 6, 6 ] [ 12, 8, 4 ] [ 17, 14, 10 ]
User test case 1:
[1, 1, 7, 6, 6, 6]
User test case 2:
[2]
User test case 3:
[7, 7, 3, 7, 7]
User test case 4:
[5, 3, 2, 4]
Code: 18:11:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = 1;
let areas = [];
for (let i = 0; i < H.length-1; i++) {
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:12:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = H[0];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (max < H[i]) {
max = H[i];
}
forward[i] = H[i] * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:12:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = H[0];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (max < H[i]) {
max = H[i];
}
forward[i] = max * (i + 1);
backward[H.length-2-i] = H[H.length-1] * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:12:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let max = H[0];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (max < H[i]) {
max = H[i];
}
forward[i] = max * (i + 1);
backward[H.length-2-i] = max * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:13:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[]
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (max < H[i]) {
max = H[i];
}
forward[i] = max * (i + 1);
backward[H.length-2-i] = max * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:13:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
forward[i] = max * (i + 1);
backward[H.length-2-i] = max * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:13:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxForward < H[i]) {
maxForward = H[i];
}
forward[i] = max * (i + 1);
backward[H.length-2-i] = max * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:13:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[i]) {
maxBackward = H[i];
}
forward[i] = max * (i + 1);
backward[H.length-2-i] = max * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:14:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[i]) {
maxBackward = H[i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:14:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-]) {
maxBackward = H[i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:14:35 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:14:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:14:50 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 3, 6 ] [ 8, 4 ] [ 11, 10 ]
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 5, 10, 15 ] [ 12, 8, 4 ] [ 17, 18, 19 ]
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 5, 10, 15, 20 ] [ 20, 15, 4, 1 ] [ 25, 25, 19, 21 ]
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 7, 14, 21, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 35, 35 ]
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 1, 2, 21, 28, 35 ] [ 35, 28, 18, 12, 6 ] [ 36, 30, 39, 40, 41 ]
expand all
User tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 1, 2, 21, 28, 35 ] [ 35, 28, 18, 12, 6 ] [ 36, 30, 39, 40, 41 ]
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[] [] []
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 7, 14, 21, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 35, 35 ]
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: max is not defined
at solution (solution.js:34:30)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
[ 5, 10, 15 ] [ 12, 8, 4 ] [ 17, 18, 19 ]
User test case 1:
[1, 1, 7, 6, 6, 6]
User test case 2:
[2]
User test case 3:
[7, 7, 3, 7, 7]
User test case 4:
[5, 3, 2, 4]
Code: 18:15:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * maxForw;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:15:21 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * maxForward;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 9 expected 10
stdout:
[ 3, 6 ] [ 8, 4 ] [ 11, 10 ]
1.
0.072 s
OK
stdout:
[ 5, 10, 15 ] [ 12, 8, 4 ] [ 17, 18, 19 ]
1.
0.072 s
OK
stdout:
[ 5, 10, 15, 20 ] [ 20, 15, 4, 1 ] [ 25, 25, 19, 21 ]
1.
0.072 s
OK
stdout:
[ 7, 14, 21, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 35, 35 ]
1.
0.072 s
OK
stdout:
[ 1, 2, 21, 28, 35 ] [ 35, 28, 18, 12, 6 ] [ 36, 30, 39, 40, 41 ]
expand all
User tests
1.
0.076 s
OK
function result: 30
function result: 30
stdout:
[ 1, 2, 21, 28, 35 ] [ 35, 28, 18, 12, 6 ] [ 36, 30, 39, 40, 41 ]
1.
0.072 s
OK
function result: 2
function result: 2
stdout:
[] [] []
1.
0.072 s
OK
function result: 35
function result: 35
stdout:
[ 7, 14, 21, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 35, 35 ]
1.
0.072 s
OK
function result: 17
function result: 17
stdout:
[ 5, 10, 15 ] [ 12, 8, 4 ] [ 17, 18, 19 ]
User test case 1:
[1, 1, 7, 6, 6, 6]
User test case 2:
[2]
User test case 3:
[7, 7, 3, 7, 7]
User test case 4:
[5, 3, 2, 4]
Code: 18:17:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * maxForward;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:17:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * maxForward;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
console.log(minArea)
console.log(maxArea)
console.log(maxForwar)
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:18:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * maxForward;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
console.log(minArea)
console.log(maxArea)
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:18:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let minArea = areas[0];
let maxArea = H.length * maxForward;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:18:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let max = maxForward > maxBackward ? maxForward : maxBackwar
let minArea = areas[0];
let maxArea = H.length * maxForward;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:18:56 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
console.log(forward)
console.log(backward)
console.log(areas)
let max = maxForward > maxBackward ? maxForward : maxBackward;
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis
expand all
Example tests
1.
0.120 s
OK
stdout:
[ 3, 6 ] [ 8, 4 ] [ 11, 10 ]
1.
0.124 s
OK
stdout:
[ 5, 10, 15 ] [ 12, 8, 4 ] [ 17, 18, 19 ]
1.
0.124 s
OK
stdout:
[ 5, 10, 15, 20 ] [ 20, 15, 4, 1 ] [ 25, 25, 19, 21 ]
1.
0.072 s
OK
stdout:
[ 7, 14, 21, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 35, 35 ]
1.
0.072 s
OK
stdout:
[ 1, 2, 21, 28, 35 ] [ 35, 28, 18, 12, 6 ] [ 36, 30, 39, 40, 41 ]
expand all
User tests
1.
0.072 s
OK
function result: 30
function result: 30
stdout:
[ 1, 2, 21, 28, 35 ] [ 35, 28, 18, 12, 6 ] [ 36, 30, 39, 40, 41 ]
1.
0.072 s
OK
function result: 2
function result: 2
stdout:
[] [] []
1.
0.072 s
OK
function result: 35
function result: 35
stdout:
[ 7, 14, 21, 28 ] [ 28, 21, 14, 7 ] [ 35, 35, 35, 35 ]
1.
0.072 s
OK
function result: 17
function result: 17
stdout:
[ 5, 10, 15 ] [ 12, 8, 4 ] [ 17, 18, 19 ]
User test case 1:
[1, 1, 7, 6, 6, 6]
User test case 2:
[2]
User test case 3:
[7, 7, 3, 7, 7]
User test case 4:
[5, 3, 2, 4]
Code: 18:20:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let max = maxForward > maxBackward ? maxForward : maxBackward;
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Code: 18:20:32 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let max = maxForward > maxBackward ? maxForward : maxBackward;
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 30
function result: 30
1.
0.072 s
OK
function result: 2
function result: 2
1.
0.072 s
OK
function result: 35
function result: 35
1.
0.072 s
OK
function result: 17
function result: 17
User test case 1:
[1, 1, 7, 6, 6, 6]
User test case 2:
[2]
User test case 3:
[7, 7, 3, 7, 7]
User test case 4:
[5, 3, 2, 4]
Code: 18:20:41 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let max = maxForward > maxBackward ? maxForward : maxBackward;
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 30
function result: 30
1.
0.076 s
OK
function result: 2
function result: 2
1.
0.080 s
OK
function result: 35
function result: 35
1.
0.072 s
OK
function result: 17
function result: 17
User test case 1:
[1, 1, 7, 6, 6, 6]
User test case 2:
[2]
User test case 3:
[7, 7, 3, 7, 7]
User test case 4:
[5, 3, 2, 4]
Code: 18:20:45 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(H) {
// write your code in JavaScript (Node.js 8.9.4)
let forward = [];
let backward = [];
let maxForward = H[0];
let maxBackward = H[H.length-1];
let areas = [];
for (let i = 0; i < H.length-1; i++) {
if (maxForward < H[i]) {
maxForward = H[i];
}
if (maxBackward < H[H.length-1-i]) {
maxBackward = H[H.length-1-i];
}
forward[i] = maxForward * (i + 1);
backward[H.length-2-i] = maxBackward * (i + 1);
}
for (let i = 0; i < forward.length; i++) {
areas[i] = forward[i] + backward[i];
}
let max = maxForward > maxBackward ? maxForward : maxBackward;
let minArea = areas[0];
let maxArea = H.length * max;
for (let i = 0; i < areas.length; i++) {
if (areas[i] < minArea) {
minArea = areas[i];
}
}
if (minArea < maxArea) {
return minArea;
} else {
return maxArea;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N) or O(N + max(H))
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
5.
0.068 s
OK
1.
0.072 s
OK
2.
0.068 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
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
5.
0.068 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
expand all
Performance tests
1.
0.084 s
OK
2.
0.084 s
OK
3.
0.084 s
OK
4.
0.084 s
OK
1.
0.128 s
OK
2.
0.128 s
OK
3.
0.124 s
OK
4.
0.128 s
OK
1.
0.128 s
OK
2.
0.128 s
OK
3.
0.120 s
OK
4.
0.120 s
OK
5.
0.128 s
OK
6.
0.128 s
OK
max_pyramid
Values in the tests are arranged into ascending or descending pyramids. N=100,000.
Values in the tests are arranged into ascending or descending pyramids. N=100,000.
✔
OK
1.
0.132 s
OK
2.
0.128 s
OK
3.
0.120 s
OK
4.
0.124 s
OK
5.
0.128 s
OK
1.
0.128 s
OK
2.
0.136 s
OK
3.
0.132 s
OK
4.
0.136 s
OK
5.
0.132 s
OK
6.
0.128 s
OK
7.
0.128 s
OK