Tasks Details
hard
1.
SlalomSkiing
Given a sequence, find the longest subsequence that can be decomposed into at most three monotonic parts.
Task Score
7%
Correctness
12%
Performance
0%
You are a skier participating in a giant slalom. The slalom track is located on a ski slope, goes downhill and is fenced by barriers on both sides. The barriers are perpendicular to the starting line located at the top of the slope. There are N slalom gates on the track. Each gate is placed at a distinct distance from the starting line and from the barrier on the right-hand side (looking downhill).
You start from any place on the starting line, ski down the track passing as many gates as possible, and finish the slalom at the bottom of the slope. Passing a gate means skiing through the position of the gate.
You can ski downhill in either of two directions: to the left or to the right. When you ski to the left, you pass gates of increasing distances from the right barrier, and when you ski to the right, you pass gates of decreasing distances from the right barrier. You want to ski to the left at the beginning.
Unfortunately, changing direction (left to right or vice versa) is exhausting, so you have decided to change direction at most two times during your ride. Because of this, you have allowed yourself to miss some of the gates on the way down the slope. You would like to know the maximum number of gates that you can pass with at most two changes of direction.
The arrangement of the gates is given as an array A consisting of N integers, whose elements specify the positions of the gates: gate K (for 0 ≤ K < N) is at a distance of K+1 from the starting line, and at a distance of A[K] from the right barrier.
For example, consider array A such that:
A[0] = 15 A[1] = 13 A[2] = 5 A[3] = 7 A[4] = 4 A[5] = 10 A[6] = 12 A[7] = 8 A[8] = 2 A[9] = 11 A[10] = 6 A[11] = 9 A[12] = 3
The picture above illustrates the example track with N = 13 gates and a course that passes eight gates. After starting, you ski to the left (from your own perspective). You pass gates 2, 3, 5, 6 and then change direction to the right. After that you pass gates 7, 8 and then change direction to the left. Finally, you pass gates 10, 11 and finish the slalom. There is no possible way of passing more gates using at most two changes of direction.
Write a function:
function solution(A);
that, given an array A consisting of N integers, describing the positions of the gates on the track, returns the maximum number of gates that you can pass during one ski run.
For example, given the above data, the function should return 8, as explained above.
For the following array A consisting of N = 2 elements:
A[0] = 1 A[1] = 5the function should return 2.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..1,000,000,000];
- the elements of A are all distinct.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 21 minutes
Notes
not defined yet
Code: 09:58:34 UTC,
java,
autosave
Code: 09:59:40 UTC,
js,
autosave
Code: 10:00:09 UTC,
js,
autosave
Code: 10:00:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N =))
}
}
Code: 10:00:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
}
}
Code: 10:01:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
}
Code: 10:01:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
}
Code: 10:03:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
}
Code: 10:04:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: M})
}
Code: 10:04:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length }, ())
}
Code: 10:04:31 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length }, () => -1)
}
Code: 10:04:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length }, () => -1);
}
Code: 10:05:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length }, () => -1);
for (let i = 0; i)
}
Code: 10:05:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length }, () => -1);
for (let i = 0; i < multiverse.length)
}
Code: 10:05:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
for (let i = 0; i < multiverse.length)
}
Code: 10:09:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
for (let i = 0; i < multiverse.length;)
}
Code: 10:09:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
for (let i = 0; i < multiverse.length; i++) {
}
}
Code: 10:09:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
}
}
Code: 10:09:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end =
}
}
Code: 10:10:16 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
}
}
}
Code: 10:10:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
}
}
}
Code: 10:11:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < )
}
}
}
Code: 10:11:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
upper = mid - 1;
} else if ()
}
}
}
Code: 10:11:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
upper = mid - 1;
} else {
}
}
}
}
Code: 10:12:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
upper = mid - 1;
} else {
start = mid + 1;
}
}
}
}
Code: 10:12:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
}
}
Code: 10:12:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] =)
}
}
Code: 10:13:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
}
}
}
Code: 10:13:34 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
}
}
}
Code: 10:14:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], )
}
}
}
Code: 10:14:16 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
}
Code: 10:14:28 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multivers.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: multivers is not defined
at solution (solution.js:11:9)
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
Code: 10:14:39 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Analysis
Code: 10:14:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:15:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:16:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:17:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:17:25 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:17:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:17:48 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
User test case 1:
[1]
User test case 2:
[1, 4, 7, 10, 13, 12, 9, 6, 3, 2, 5, 8, 11, 14]
Analysis
Code: 10:17:57 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
User test case 1:
[1]
User test case 2:
[1, 4, 7, 10, 13, 12, 9, 6, 3, 2, 5, 8, 11, 14, 0]
Analysis
Code: 10:18:04 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:18:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:18:23 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
User test case 1:
[1]
User test case 2:
[1, 4, 7, 10, 13, 12, 9, 6, 3, 2, 5, 8, 11, 14, 0]
User test case 3:
[4, 7, 10, 13, 1, 12, 9, 6, 3, 2, 5, 8, 11, 14, 0]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 14
function result: 14
1.
0.068 s
OK
function result: 13
function result: 13
Code: 10:18:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:19:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Code: 10:19:02 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
User test case 1:
[1]
User test case 2:
[1, 4, 7, 10, 13, 12, 9, 6, 3, 2, 5, 8, 11, 14, 0]
User test case 3:
[4, 7, 10, 13, 1, 12, 9, 6, 3, 2, 5, 8, 11, 14, 0]
User test case 4:
[1, 1000000000, 2, 5, 500, 50000, 2]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 14
function result: 14
1.
0.072 s
OK
function result: 13
function result: 13
1.
0.072 s
OK
function result: 6
function result: 6
Code: 10:19:21 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
User test case 1:
[1]
User test case 2:
[1, 4, 7, 10, 13, 12, 9, 6, 3, 2, 5, 8, 11, 14, 0]
User test case 3:
[4, 7, 10, 13, 1, 12, 9, 6, 3, 2, 5, 8, 11, 14, 0]
User test case 4:
[1, 1000000000, 2, 5, 500, 50000, 2]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 14
function result: 14
1.
0.072 s
OK
function result: 13
function result: 13
1.
0.072 s
OK
function result: 6
function result: 6
Code: 10:19:24 UTC,
js,
final,
score:
7
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let multiverse = [];
let N = A.length;
for (let point of A) {
multiverse.push((N + 1) * 2 + point);
multiverse.push((N + 1) * 2 - point);
multiverse.push(point);
}
smallEnd = Array.from({ length: multiverse.length+1 }, () => -1);
let longest = 0;
for (let i = 0; i < multiverse.length; i++) {
let start = 0;
let end = longest;
while (start <= end) {
mid = parseInt((start + end) / 2);
if (multiverse[i] < smallEnd[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
}
if (smallEnd[start] === -1) {
smallEnd[start] = multiverse[i]
longest++
} else {
smallEnd[start] = Math.min(smallEnd[start], multiverse[i])
}
}
return longest;
}
Analysis summary
The following issues have been detected: wrong answers, timeout errors.
For example, for the input [543, 123] the solution returned a wrong answer (got 3 expected 2).
Analysis
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
WRONG ANSWER,
got 4 expected 5
3.
0.072 s
WRONG ANSWER,
got 3 expected 2
4.
0.072 s
WRONG ANSWER,
got 4 expected 3
5.
0.072 s
OK
6.
0.072 s
WRONG ANSWER,
got 4 expected 3
7.
0.072 s
OK
8.
0.072 s
WRONG ANSWER,
got 5 expected 3
9.
0.072 s
WRONG ANSWER,
got 5 expected 4
10.
0.072 s
WRONG ANSWER,
got 5 expected 4
11.
0.080 s
WRONG ANSWER,
got 7 expected 5
12.
0.072 s
WRONG ANSWER,
got 6 expected 4
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
WRONG ANSWER,
got 20 expected 23
2.
0.072 s
WRONG ANSWER,
got 20 expected 19
3.
0.072 s
WRONG ANSWER,
got 21 expected 19
1.
0.072 s
WRONG ANSWER,
got 13 expected 15
2.
0.072 s
WRONG ANSWER,
got 12 expected 9
3.
0.076 s
WRONG ANSWER,
got 16 expected 13
1.
0.072 s
WRONG ANSWER,
got 21 expected 19
2.
0.072 s
WRONG ANSWER,
got 13 expected 16
small_monotonic
small monotonic sequence with additional random elements
small monotonic sequence with additional random elements
✘
WRONG ANSWER
got 50 expected 49
got 50 expected 49
1.
0.072 s
WRONG ANSWER,
got 50 expected 49
2.
0.076 s
WRONG ANSWER,
got 52 expected 50
3.
0.072 s
WRONG ANSWER,
got 39 expected 37
4.
0.072 s
WRONG ANSWER,
got 42 expected 41
5.
0.072 s
OK
6.
0.072 s
WRONG ANSWER,
got 97 expected 96
1.
0.072 s
WRONG ANSWER,
got 25 expected 22
2.
0.072 s
OK
3.
0.072 s
OK
small_concatenated_monotonic
concatenated small monotonic sequences
concatenated small monotonic sequences
✘
WRONG ANSWER
got 30 expected 35
got 30 expected 35
1.
0.072 s
WRONG ANSWER,
got 30 expected 35
2.
0.072 s
OK
expand all
Performance tests
1.
0.076 s
WRONG ANSWER,
got 51 expected 50
2.
0.076 s
WRONG ANSWER,
got 95 expected 142
huge_random
long subsequence hidden in random array, N <= 100,000
long subsequence hidden in random array, N <= 100,000
✘
TIMEOUT ERROR
running time: 3.048 sec., time limit: 2.368 sec.
running time: 3.048 sec., time limit: 2.368 sec.
1.
3.048 s
TIMEOUT ERROR,
running time: 3.048 sec., time limit: 2.368 sec.
2.
4.904 s
TIMEOUT ERROR,
running time: 4.904 sec., time limit: 2.160 sec.
huge_monotonic
huge monotonic sequence with additional random elements, N <= 100,000
huge monotonic sequence with additional random elements, N <= 100,000
✘
TIMEOUT ERROR
running time: 4.764 sec., time limit: 1.952 sec.
running time: 4.764 sec., time limit: 1.952 sec.
1.
4.764 s
TIMEOUT ERROR,
running time: 4.764 sec., time limit: 1.952 sec.
2.
4.448 s
TIMEOUT ERROR,
running time: 4.448 sec., time limit: 2.224 sec.
3.
0.456 s
WRONG ANSWER,
got 10001 expected 10000
4.
0.452 s
OK
huge_shuffled_monotonic
shuffled huge monotonic sequences, N <= 100,000
shuffled huge monotonic sequences, N <= 100,000
✘
TIMEOUT ERROR
running time: 3.016 sec., time limit: 1.648 sec.
running time: 3.016 sec., time limit: 1.648 sec.
1.
3.016 s
TIMEOUT ERROR,
running time: 3.016 sec., time limit: 1.648 sec.
2.
0.260 s
WRONG ANSWER,
got 2752 expected 2759
3.
0.396 s
WRONG ANSWER,
got 2438 expected 2436
4.
0.436 s
WRONG ANSWER,
got 5099 expected 5001
huge_concatenated_monotonic
concatenated huge monotonic sequences, N <= 100,000
concatenated huge monotonic sequences, N <= 100,000
✘
TIMEOUT ERROR
running time: 4.556 sec., time limit: 2.016 sec.
running time: 4.556 sec., time limit: 2.016 sec.
1.
4.556 s
TIMEOUT ERROR,
running time: 4.556 sec., time limit: 2.016 sec.
2.
4.796 s
TIMEOUT ERROR,
running time: 4.796 sec., time limit: 2.000 sec.
3.
0.448 s
WRONG ANSWER,
got 5013 expected 10011
4.
0.332 s
OK