Tasks Details
medium
Count the minimum number of nails that allow a series of planks to be nailed.
Task Score
100%
Correctness
100%
Performance
100%
You are given two non-empty arrays A and B consisting of N integers. These arrays represent N planks. More precisely, A[K] is the start and B[K] the end of the K−th plank.
Next, you are given a non-empty array C consisting of M integers. This array represents M nails. More precisely, C[I] is the position where you can hammer in the I−th nail.
We say that a plank (A[K], B[K]) is nailed if there exists a nail C[I] such that A[K] ≤ C[I] ≤ B[K].
The goal is to find the minimum number of nails that must be used until all the planks are nailed. In other words, you should find a value J such that all planks will be nailed after using only the first J nails. More precisely, for every plank (A[K], B[K]) such that 0 ≤ K < N, there should exist a nail C[I] such that I < J and A[K] ≤ C[I] ≤ B[K].
For example, given arrays A, B such that:
A[0] = 1 B[0] = 4 A[1] = 4 B[1] = 5 A[2] = 5 B[2] = 9 A[3] = 8 B[3] = 10four planks are represented: [1, 4], [4, 5], [5, 9] and [8, 10].
Given array C such that:
C[0] = 4 C[1] = 6 C[2] = 7 C[3] = 10 C[4] = 2if we use the following nails:
- 0, then planks [1, 4] and [4, 5] will both be nailed.
- 0, 1, then planks [1, 4], [4, 5] and [5, 9] will be nailed.
- 0, 1, 2, then planks [1, 4], [4, 5] and [5, 9] will be nailed.
- 0, 1, 2, 3, then all the planks will be nailed.
Thus, four is the minimum number of nails that, used sequentially, allow all the planks to be nailed.
Write a function:
function solution(A, B, C);
that, given two non-empty arrays A and B consisting of N integers and a non-empty array C consisting of M integers, returns the minimum number of nails that, used sequentially, allow all the planks to be nailed.
If it is not possible to nail all the planks, the function should return −1.
For example, given arrays A, B, C such that:
A[0] = 1 B[0] = 4 A[1] = 4 B[1] = 5 A[2] = 5 B[2] = 9 A[3] = 8 B[3] = 10 C[0] = 4 C[1] = 6 C[2] = 7 C[3] = 10 C[4] = 2the function should return 4, as explained above.
Write an efficient algorithm for the following assumptions:
- N and M are integers within the range [1..30,000];
- each element of arrays A, B and C is an integer within the range [1..2*M];
- A[K] ≤ B[K].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 55 minutes
Notes
not defined yet
Code: 13:48:23 UTC,
java,
autosave
Code: 13:49:16 UTC,
js,
autosave
Code: 13:49:26 UTC,
js,
autosave
Code: 13:49:56 UTC,
js,
autosave
Code: 13:50:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
}
}
}
Code: 13:50:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
}
Code: 13:51:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
for (let)
}
Code: 13:51:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
}
Code: 13:51:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length = maxB})
}
Code: 13:51:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length: maxB})
}
Code: 13:52:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length: maxB+1}, () => 0)
}
Code: 13:52:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid =
}
}
Code: 13:53:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
for (let i = 0; )
}
}
Code: 13:53:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
for (let i = 0; )
}
}
Code: 13:53:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
}
}
Code: 13:55:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
f
}
}
Code: 13:56:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
}
}
}
Code: 13:57:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
t
}
}
}
Code: 13:57:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
}
}
}
Code: 13:58:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, (v,i) => 0);
for (let i = 0; i < mid; i++) {
}
}
}
Code: 13:58:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, (v,i) => i < mid ? 0 : 1);
for (let i = 0; i < mid; i++) {
}
}
}
Code: 13:58:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, (v,i) => i < mid ? 0 : 1);
for (let i = 0; i < totalNails.length; i++) {
}
}
}
Code: 13:59:12 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, (v,i) => i < mid ? 0 : 1);
for (let i = 1; i < totalNails.length; i++) {
totalNails[]
}
}
}
Code: 13:59:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
}
}
}
Code: 14:00:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < )
}
}
Code: 14:00:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
}
}
}
Code: 14:01:04 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
Code: 14:02:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
Code: 14:02:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
function
Code: 14:03:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
le
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
function
Code: 14:03:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
function
Code: 14:03:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
function
Code: 14: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, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, )
}
Code: 14:04:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails)
}
}
Code: 14:05:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:05:25 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result =
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:05:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
}
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:06:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible =
}
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:06:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
}
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:06:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:07:13 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length, i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:50
for (let i = 0; i < A.length, i++) {
^
SyntaxError: Unexpected token )
at createScript (vm.js:80:10)
at Object.runInNewContext (vm.js:135:10)
at getSolution (/tmp/exec.js:412:29)
at Promise.resolve.then (/tmp/exec.js:446:34)
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: 14:07:27 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:07:28 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = Array.from({ length: maxB+1}, () => 0);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
Code: 14:07:57 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:08:07 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:08:20 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:08:30 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
let totalNails = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:09:00 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
let totalNails = totalNailsInitial
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:09:09 UTC,
js,
verify,
result: Failed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
Code: 14:09:35 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:09:53 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:')
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:10:08 UTC,
js,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
0.572 s
RUNTIME ERROR,
tested program terminated with exit code 153
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg, end, mid: 0 5 3 -> beg,
Code: 14:10:25 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
co
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:10:47 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
console.log(result)
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:11:02 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
console.log(result)
if (result) {
possible = true;
if (end === mid) {
break;
}
max = mid;
} else {
min = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
0.584 s
RUNTIME ERROR,
tested program terminated with exit code 153
stdout:
-> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] false -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 2, 3, 4, 7, 10, 13 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 3, 4, 5, 12, 22, 35 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 4, 5, 6, 18, 40, 75 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 5, 6, 7, 25, 65, 140 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 6, 7, 8, 33, 98, 238 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 7, 8, 9, 42, 140, 378 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 8, 9, 10, 52, 192, 570 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 9, 10, 11, 63, 255, 825 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 10, 11, 12, 75, 330, 1155 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 11, 12, 13, 88, 418, 1573 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 12, 13, 14, 102, 520, 2093 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 13, 14, 15, 117, 637, 2730 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 14, 15, 16, 133, 770, 3500 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 15, 16, 17, 150, 920, 4420 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 16, 17, 18, 168, 1088, 5508 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 17, 18, 19, 187, 1275, 6783 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 18, 19, 20, 207, 1482, 8265 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 19, 20, 21, 228, 1710, 9975 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 20, 21, 22, 250, 1960, 11935 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 21, 22, 23, 273, 2233, 14168 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 22, 23, 24, 297, 2530, 16698 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 23, 24, 25, 322, 2852, 19550 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 24, 25, 26, 348, 3200, 22750 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 25, 26, 27, 375, 3575, 26325 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 26, 27, 28, 403, 3978, 30303 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 27, 28, 29, 432, 4410, 34713 ] true -> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 28, 29, 30, 462, 48
Code: 14:11:13 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
console.log(result)
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return min;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: min is not defined
at solution (solution.js:49:9)
at solutionWrapper (/tmp/exec.js:422:28)
at Promise.resolve.then (/tmp/exec.js:448: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:
-> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] false -> beg, end, mid: 4 5 5 [ 0, 0, 1, 1, 2, 3, 4, 5, 8, 11, 12 ] true
Code: 14:11:24 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
console.log(result)
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:11:25 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
console.log(result)
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] false -> beg, end, mid: 4 5 5 [ 0, 0, 1, 1, 2, 3, 4, 5, 8, 11, 12 ] true
Code: 14:15:09 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
console.log(totalNails)
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
console.log(result)
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:15:12 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
console.log(totalNails);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
console.log(result)
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
0.084 s
OK
stdout:
-> beg, end, mid: 0 5 3 [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] false -> beg, end, mid: 4 5 5 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] [ 0, 0, 1, 1, 2, 3, 4, 5, 8, 11, 12 ] true
Code: 14:16:52 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
console.log(totalNails);
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:17:02 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:17:03 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 4 5 5
Code: 14:17:19 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:17:28 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
User test case 1:
[[1], [2], [3]]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 4 5 5
Code: 14:17:44 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid + 1;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 4 5 5
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 0
function result: 0
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
Code: 14:18:17 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:18:22 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 3 5 4 -> beg, end, mid: 3 4 4
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
Code: 14:19:00 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 3 5 4 -> beg, end, mid: 3 4 4
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
Code: 14:19:08 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:19:18 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:19:26 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 3 5 4 -> beg, end, mid: 3 4 4
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
1.
0.072 s
OK
function result: 10
function result: 10
stdout:
-> beg, end, mid: 0 10 5 -> beg, end, mid: 5 10 8 -> beg, end, mid: 8 10 9 -> beg, end, mid: 9 10 10
Code: 14:19:36 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:19:46 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:20:02 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:20:05 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return beg+1;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 30000], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 3 5 4 -> beg, end, mid: 3 4 4
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
1.
0.072 s
OK
function result: 10
function result: 10
stdout:
-> beg, end, mid: 0 10 5 -> beg, end, mid: 5 10 8 -> beg, end, mid: 8 10 9 -> beg, end, mid: 9 10 10
1.
0.088 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
Code: 14:21:42 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return end;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
Code: 14:21:43 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return end;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 30000], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 3 5 4 -> beg, end, mid: 3 4 4
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
1.
0.076 s
OK
function result: 10
function result: 10
stdout:
-> beg, end, mid: 0 10 5 -> beg, end, mid: 5 10 8 -> beg, end, mid: 8 10 9 -> beg, end, mid: 9 10 10
1.
0.092 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
Code: 14:24:31 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return end;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:25:01 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
let lastPossible = 0;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return end;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:25:15 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let possible = false;
let lastPossible = 0;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
possible = true;
lastPossible =
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return end;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:25:43 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid + 1;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
if (possible) {
return end;
} else {
return -1;
}
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:25:52 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid + 1;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 30000], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 5 expected 4
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 3 5 4 -> beg, end, mid: 3 4 4
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 2
function result: 2
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
1.
0.072 s
OK
function result: 11
function result: 11
stdout:
-> beg, end, mid: 0 10 5 -> beg, end, mid: 5 10 8 -> beg, end, mid: 8 10 9 -> beg, end, mid: 9 10 10
1.
0.088 s
OK
function result: 2
function result: 2
stdout:
-> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
Code: 14:26:12 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 30000], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> beg, end, mid: 0 5 3 -> beg, end, mid: 3 5 4 -> beg, end, mid: 3 4 4
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 12 6 -> beg, end, mid: 0 6 3 -> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
1.
0.072 s
OK
function result: 10
function result: 10
stdout:
-> beg, end, mid: 0 10 5 -> beg, end, mid: 5 10 8 -> beg, end, mid: 8 10 9 -> beg, end, mid: 9 10 10
1.
0.088 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid: 0 3 2 -> beg, end, mid: 0 2 1 -> beg, end, mid: 0 1 1
Code: 14:27:24 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
cosn
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:27:34 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
console.log()
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:27:50 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:28:05 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
console.log('-> beg, end, mid:', beg, end, mid)
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:28:15 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log(totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:28:28 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 30000], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> beg, end, mid, nails: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] !res -> beg, end, mid, nails: 3 5 4 [ 0, 0, 0, 0, 1, 2, 3, 4, 7, 10, 11 ] res -> beg, end, mid, nails: 3 4 4 [ 0, 0, 0, 0, 1, 3, 4, 5, 12, 22, 23 ] res
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid, nails: 0 12 6 [ 0, 1, 1 ] res -> beg, end, mid, nails: 0 6 3 [ 0, 1, 2 ] res -> beg, end, mid, nails: 0 3 2 [ 0, 1, 3 ] res -> beg, end, mid, nails: 0 2 1 [ 0, 1, 4 ] res -> beg, end, mid, nails: 0 1 1 [ 0, 1, 5 ] res
1.
0.072 s
OK
function result: 10
function result: 10
stdout:
-> beg, end, mid, nails: 0 10 5 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 5 10 8 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 8 10 9 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 9 10 10 [ 0, 0, 1, 1 ] res
1.
0.100 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid, nails: 0 3 2 [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ... 29901 more items ] res -> beg, end, mid, nails: 0 2 1 [ 0, 1, 2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, ... 29901 more items ] res -> beg, end, mid, nails: 0 1 1 [ 0, 1, 3, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1024, 1089, 1156, 1225, 1296, 1369, 1444, 1521, 1600, 1681, 1764, 1849, 1936, 2025, 2116, 2209, 2304, 2401, 2500, 2601, 2704, 2809, 2916, 3025, 3136, 3249, 3364, 3481, 3600, 3721, 3844, 3969, 4096, 4225, 4356, 4489, 4624, 4761, 4900, 5041, 5184, 5329, 5476, 5625, 5776, 5929, 6084, 6241, 6400, 6561, 6724, 6889, 7056, 7225, 7396, 7569, 7744, 7921, 8100, 8281, 8464, 8649, 8836, 9025, 9216, 9409, 9604, ...
Code: 14:30:05 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:30:07 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial;
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 10], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> beg, end, mid, nails: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] !res -> beg, end, mid, nails: 3 5 4 [ 0, 0, 0, 0, 1, 2, 3, 4, 7, 10, 11 ] res -> beg, end, mid, nails: 3 4 4 [ 0, 0, 0, 0, 1, 3, 4, 5, 12, 22, 23 ] res
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid, nails: 0 12 6 [ 0, 1, 1 ] res -> beg, end, mid, nails: 0 6 3 [ 0, 1, 2 ] res -> beg, end, mid, nails: 0 3 2 [ 0, 1, 3 ] res -> beg, end, mid, nails: 0 2 1 [ 0, 1, 4 ] res -> beg, end, mid, nails: 0 1 1 [ 0, 1, 5 ] res
1.
0.072 s
OK
function result: 10
function result: 10
stdout:
-> beg, end, mid, nails: 0 10 5 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 5 10 8 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 8 10 9 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 9 10 10 [ 0, 0, 1, 1 ] res
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid, nails: 0 3 2 [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2 ] res -> beg, end, mid, nails: 0 2 1 [ 0, 1, 2, 3, 5, 7, 9, 11, 13, 15, 17 ] res -> beg, end, mid, nails: 0 1 1 [ 0, 1, 3, 4, 9, 16, 25, 36, 49, 64, 81 ] res
Code: 14:38:00 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial;
co
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:38:11 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial;
console.log(totalNails)
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 10], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] !res [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] -> beg, end, mid, nails: 3 5 4 [ 0, 0, 0, 0, 1, 2, 3, 4, 7, 10, 11 ] res [ 0, 0, 0, 0, 1, 2, 3, 4, 7, 10, 11 ] -> beg, end, mid, nails: 3 4 4 [ 0, 0, 0, 0, 1, 3, 4, 5, 12, 22, 23 ] res
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.084 s
OK
function result: 1
function result: 1
stdout:
[ 0, 0, 0 ] -> beg, end, mid, nails: 0 12 6 [ 0, 1, 1 ] res [ 0, 1, 1 ] -> beg, end, mid, nails: 0 6 3 [ 0, 1, 2 ] res [ 0, 1, 2 ] -> beg, end, mid, nails: 0 3 2 [ 0, 1, 3 ] res [ 0, 1, 3 ] -> beg, end, mid, nails: 0 2 1 [ 0, 1, 4 ] res [ 0, 1, 4 ] -> beg, end, mid, nails: 0 1 1 [ 0, 1, 5 ] res
1.
0.076 s
OK
function result: 10
function result: 10
stdout:
[ 0, 0, 0 ] -> beg, end, mid, nails: 0 10 5 [ 0, 0, 0, 1 ] !res [ 0, 0, 0, 1 ] -> beg, end, mid, nails: 5 10 8 [ 0, 0, 0, 1 ] !res [ 0, 0, 0, 1 ] -> beg, end, mid, nails: 8 10 9 [ 0, 0, 0, 1 ] !res [ 0, 0, 0, 1 ] -> beg, end, mid, nails: 9 10 10 [ 0, 0, 1, 1 ] res
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 0 3 2 [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2 ] res [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2 ] -> beg, end, mid, nails: 0 2 1 [ 0, 1, 2, 3, 5, 7, 9, 11, 13, 15, 17 ] res [ 0, 1, 2, 3, 5, 7, 9, 11, 13, 15, 17 ] -> beg, end, mid, nails: 0 1 1 [ 0, 1, 3, 4, 9, 16, 25, 36, 49, 64, 81 ] res
Code: 14:38:55 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slic;
console.log(totalNails)
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:38:58 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
console.log(totalNails)
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 10], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] !res [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 3 5 4 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 4 ] res [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 3 4 4 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 4 ] res
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
[ 0, 0, 0 ] -> beg, end, mid, nails: 0 12 6 [ 0, 1, 1 ] res [ 0, 0, 0 ] -> beg, end, mid, nails: 0 6 3 [ 0, 1, 1 ] res [ 0, 0, 0 ] -> beg, end, mid, nails: 0 3 2 [ 0, 1, 1 ] res [ 0, 0, 0 ] -> beg, end, mid, nails: 0 2 1 [ 0, 1, 1 ] res [ 0, 0, 0 ] -> beg, end, mid, nails: 0 1 1 [ 0, 1, 1 ] res
1.
0.076 s
OK
function result: 10
function result: 10
stdout:
[ 0, 0, 0 ] -> beg, end, mid, nails: 0 10 5 [ 0, 0, 0, 1 ] !res [ 0, 0, 0 ] -> beg, end, mid, nails: 5 10 8 [ 0, 0, 0, 1 ] !res [ 0, 0, 0 ] -> beg, end, mid, nails: 8 10 9 [ 0, 0, 0, 1 ] !res [ 0, 0, 0 ] -> beg, end, mid, nails: 9 10 10 [ 0, 0, 1, 1 ] res
1.
0.076 s
OK
function result: 2
function result: 2
stdout:
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 0 3 2 [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2 ] res [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 0 2 1 [ 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1 ] !res [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> beg, end, mid, nails: 1 2 2 [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2 ] res
Code: 14:39:17 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:40:39 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
console.log('!res')
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 10], [3, 1, 2]]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> beg, end, mid, nails: 0 5 3 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 3 ] !res -> beg, end, mid, nails: 3 5 4 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 4 ] res -> beg, end, mid, nails: 3 4 4 [ 0, 0, 0, 0, 1, 1, 2, 3, 3, 3, 4 ] res
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
-> beg, end, mid, nails: 0 12 6 [ 0, 1, 1 ] res -> beg, end, mid, nails: 0 6 3 [ 0, 1, 1 ] res -> beg, end, mid, nails: 0 3 2 [ 0, 1, 1 ] res -> beg, end, mid, nails: 0 2 1 [ 0, 1, 1 ] res -> beg, end, mid, nails: 0 1 1 [ 0, 1, 1 ] res
1.
0.076 s
OK
function result: 10
function result: 10
stdout:
-> beg, end, mid, nails: 0 10 5 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 5 10 8 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 8 10 9 [ 0, 0, 0, 1 ] !res -> beg, end, mid, nails: 9 10 10 [ 0, 0, 1, 1 ] res
1.
0.076 s
OK
function result: 2
function result: 2
stdout:
-> beg, end, mid, nails: 0 3 2 [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2 ] res -> beg, end, mid, nails: 0 2 1 [ 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1 ] !res -> beg, end, mid, nails: 1 2 2 [ 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2 ] res
Code: 14:40:45 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
console.log('res')
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:40:57 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 10], [3, 1, 2]]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 10
function result: 10
1.
0.072 s
OK
function result: 2
function result: 2
Code: 14:41:42 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:41:52 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:41:54 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 1], [2, 3, 30000], [3, 1, 2]]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 10
function result: 10
1.
0.088 s
OK
function result: 2
function result: 2
Code: 14:42:12 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 3], [2, 3, 30000], [3, 1, 2]]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 10
function result: 10
1.
0.084 s
OK
function result: 2
function result: 2
Code: 14:42:22 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Code: 14:42:25 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 4], [2, 3, 30000], [3, 1, 2, 30000]]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 10
function result: 10
1.
0.088 s
OK
function result: 4
function result: 4
Code: 14:42:33 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
User test case 1:
[[1], [2], [3]]
User test case 2:
[[1], [2], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3]]
User test case 3:
[[1], [2], [3, 3, 3, 3, 3, 3, 3, 3, 3, 2]]
User test case 4:
[[1, 2, 4], [2, 3, 30000], [3, 1, 2, 30000]]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 10
function result: 10
1.
0.092 s
OK
function result: 4
function result: 4
Code: 14:42:36 UTC,
js,
final,
score:
100
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B, C) {
// write your code in JavaScript (Node.js 8.9.4)
let maxB = Math.max(...B);
let beg = 0;
let end = C.length;
let lastPossible = -1;
if (end === 1) {
if(A[0] <= C[0] && B[0] >= C[0]) {
return 1;
} else {
return -1;
}
}
const totalNailsInitial = Array.from({ length: maxB+1}, () => 0);
while (beg <= end) {
let mid = Math.round((beg + end) / 2);
let totalNails = totalNailsInitial.slice();
for (let i = 0; i < mid; i++) {
totalNails[C[i]] = 1;
}
for (let i = 1; i < maxB + 1; i++) {
totalNails[i] += totalNails[i-1];
}
// console.log('-> beg, end, mid, nails:', beg, end, mid, totalNails)
let result = checkNailed(A, B, totalNails);
if (result) {
lastPossible = mid;
if (end === mid) {
break;
}
end = mid;
} else {
beg = mid;
}
}
return lastPossible;
}
function checkNailed(A, B, totalNails) {
for (let i = 0; i < A.length; i++) {
if (totalNails[A[i] - 1] === totalNails[B[i]]) {
return false;
}
}
return true;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O((N + M) * log(M))
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK