Tasks Details
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
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–2026 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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}
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;
}