Tasks Details
medium
From drawers containing both clean and dirty socks, choose socks to launder in order to obtain the maximum number of clean pairs of socks.
Task Score
100%
Correctness
100%
Performance
Not assessed
Bob is about to go on a trip. But first he needs to take care of his supply of socks. Each sock has its own color. Bob wants to take as many pairs of clean socks as possible (both socks in the pair should be of the same color).
Socks are divided into two drawers: clean and dirty socks. Bob has time for only one laundry and his washing machine can clean at most K socks. He wants to pick socks for laundering in such a way that after washing he will have a maximal number of clean, same-colored pairs of socks. It is possible that some socks cannot be paired with any other sock, because Bob may have lost some socks over the years.
Bob has exactly N clean and M dirty socks, which are described in arrays C and D, respectively. The colors of the socks are represented as integers (equal numbers representing identical colors).
For example, given four clean socks and five dirty socks:
If Bob's washing machine can clean at most K = 2 socks, then he can take a maximum of three pairs of clean socks. He can wash one red sock and one green sock, numbered 1 and 2 respectively. Then he will have two pairs of red socks and one pair of green socks.
Write a function:
function solution(K, C, D);
that, given an integer K (the number of socks that the washing machine can clean), two arrays C and D (containing the color representations of N clean and M dirty socks respectively), returns the maximum number of pairs of socks that Bob can take on the trip.
For example, given K = 2, C = [1, 2, 1, 1] and D = [1, 4, 3, 2, 4], the function should return 3, as explained above.
Assume that:
- K is an integer within the range [0..50];
- each element of arrays C and D is an integer within the range [1..50];
- C and D are not empty and each of them contains at most 50 elements.
In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 31 minutes
Notes
not defined yet
Code: 07:51:27 UTC,
java,
autosave
Code: 07:52:54 UTC,
js,
autosave
Code: 07:53:10 UTC,
js,
autosave
Code: 07:53:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let cleanCount = [];
let dirtyCount = [];
let pairs = 0;
for (let i = 0; i < A.length; i++) {
}
for (let i = 0; i < D.le)
}
Code: 07:53:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let cleanCount = [];
let dirtyCount = [];
let pairs = 0;
for (let i = 0; i < C.length; i++) {
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:54:25 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let cleanCount = Array.from({})
let dirtyCount = [];
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:54:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let cleanCount = Array.from({ length: C.length + 1 }, () => 0)
let dirtyCount = [];
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:54:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let cleanCount = Array.from({ length: C.length + 1 }, () => 0);
let dirtyCount = [];
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:55:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let cleanCount = Array.from({ length: C.length + 1 }, () => 0);
let dirtyCount = Array.from({ length: D.length + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:55:16 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let
let cleanCount = Array.from({ length: C.length + 1 }, () => 0);
let dirtyCount = Array.from({ length: D.length + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:55:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: C.length + 1 }, () => 0);
let dirtyCount = Array.from({ length: D.length + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:55:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:56:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < max; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:56:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < max; i++) {
if (C[i]) {
}
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:56:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]] = 0;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:56:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
}
for (let i = 0; i < D.length; i++) {
}
}
Code: 07:56:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
}
Code: 07:57:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0)
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
}
Code: 07:57:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
}
Code: 07:59:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
}
Code: 07:59:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
for (let i = 1)
}
Code: 08:09:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
for (let i = 1; )
}
Code: 08:09:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
for (let i = 1; i < )
}
Code: 08:09:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
for (let i = 1; i < max + 1; i++) {
}
}
Code: 08:10:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
}
}
Code: 08:10:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1) {
}
}
Code: 08:10:59 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1; i++) {
}
}
}
Code: 08:11:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1; i++) {
if
}
}
}
Code: 08:11:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1; i++) {
if (cleanCount % 2)
}
}
}
Code: 08:12:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] % 2 === 0) {
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1; i++) {
if (cleanCount % 2 === 1) {
}
}
}
Code: 08:12:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 0) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1; i++) {
if (cleanCount % 2 === 1) {
}
}
}
Code: 08:12:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1; i++) {
if (cleanCount % 2 === 1) {
}
}
}
Code: 08:13:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 0; i < max + 1; i++) {
if (cleanCount[i] === 1) {
}
}
}
Code: 08:13:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 1; i < max + 1; i++) {
if (cleanCount[i] === 1) {
}
}
}
}
Code: 08:13:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 1; i < max + 1; i++) {
if (cleanCount[i] === 1 && dirtyCount) {
}
}
}
}
Code: 08:14:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
while (K > 0) {
for (let i = 1; i < max + 1; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
}
}
}
}
Code: 08:14:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
while (toWas > 0) {
for (let i = 1; i < max + 1; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
K--
}
}
}
}
Code: 08:14:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
while (toWash < K) {
for (let i = 1; i < max + 1; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
}
}
Code: 08:15:35 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
}
}
Code: 08:15:52 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
Code: 08:16:02 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
return pairs;
}
Analysis
Code: 08:16:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
return pairs;
}
Code: 08:16:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
return pairs;
}
Code: 08:17:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
while (dirtyCount[i] >= 2) {
dirtyCount[i]
pairs++;
toWash++;
}
}
return pairs;
}
Code: 08:17:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
while (dirtyCount[i] >= 2) {
dirtyCount[i] -= 2;
pairs++;
toWash++;
}
}
return pairs;
}
Code: 08:17:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
while (dirtyCount[i] >= 2 && toWash) {
dirtyCount[i] -= 2;
pairs++;
toWash++;
}
}
return pairs;
}
Code: 08:17:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
while (dirtyCount[i] >= 2 && toWash < K) {
dirtyCount[i] -= 2;
pairs++;
toWash += 2;
}
}
return pairs;
}
Code: 08:17:57 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
while (dirtyCount[i] >= 2 && toWash < K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Analysis
Code: 08:18:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K-1; i++) {
while (dirtyCount[i] >= 2 && toWash < K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Code: 08:18:35 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K - 1; i++) {
while (dirtyCount[i] >= 2 && toWash < K - 1) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Analysis
Code: 08:19:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash < K; i++) {
while (dirtyCount[i] >= 2 && toWash < K - 1) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Code: 08:19:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Code: 08:19:52 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Analysis
Code: 08:20:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Code: 08:20:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Code: 08:20:19 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
User test case 1:
[0, [1, 1, 1, 1, 2], [2]]
Analysis
Code: 08:20:37 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
User test case 1:
[0, [1, 1, 1, 1, 2], [2]]
User test case 2:
[1, [1, 1, 1, 1, 2], [2]]
Analysis
Code: 08:20:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Code: 08:20:54 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
User test case 1:
[0, [1, 1, 1, 1, 2], [2]]
User test case 2:
[1, [1, 1, 1, 1, 2], [2]]
User test case 3:
[10, [1, 1, 1, 1, 2], [2]]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 3
function result: 3
Code: 08:21:12 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Code: 08:21:23 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
User test case 1:
[0, [1, 1, 1, 1, 2], [2]]
User test case 2:
[1, [1, 1, 1, 1, 2], [2]]
User test case 3:
[10, [1, 1, 1, 1, 2], [2]]
User test case 4:
[10, [1], [2, 2, 2, 2, 2, 2, 50, 50]]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 2
function result: 2
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.072 s
OK
function result: 4
function result: 4
Code: 08:21:39 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
User test case 1:
[0, [1, 1, 1, 1, 2], [2]]
User test case 2:
[1, [1, 1, 1, 1, 2], [2]]
User test case 3:
[10, [1, 1, 1, 1, 2], [2]]
User test case 4:
[10, [1], [2, 2, 2, 2, 2, 2, 50, 50]]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 4
function result: 4
Code: 08:21:44 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(K, C, D) {
// write your code in JavaScript (Node.js 8.9.4)
let max = Math.max(...C, ...D)
let cleanCount = Array.from({ length: max + 1 }, () => 0);
let dirtyCount = Array.from({ length: max + 1 }, () => 0);
let pairs = 0;
for (let i = 0; i < C.length; i++) {
cleanCount[C[i]]++;
if (cleanCount[C[i]] === 2) {
cleanCount[C[i]] = 0;
pairs++;
}
}
for (let i = 0; i < D.length; i++) {
dirtyCount[D[i]]++;
}
let toWash = 0
for (let i = 1; i < max + 1 && toWash < K; i++) {
if (cleanCount[i] === 1 && dirtyCount[i]) {
dirtyCount[i]--;
pairs++;
toWash++;
}
}
for (let i = 1; i < max + 1 && toWash + 2 <= K; i++) {
while (dirtyCount[i] >= 2 && toWash + 2 <= K) {
dirtyCount[i] -= 2;
toWash += 2;
pairs++;
}
}
return pairs;
}
Analysis summary
The solution obtained perfect score.
Analysis
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
odd_clean_with_odd_dirty
tests causing solution that's only pairing clean socks of odd count with dirty socks of odd count to fail
tests causing solution that's only pairing clean socks of odd count with dirty socks of odd count to fail
✔
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
saving_one_used_dirty_check
tests causing solution that's not saving if dirty sock was used to pair with clean sock to fail
tests causing solution that's not saving if dirty sock was used to pair with clean sock to fail
✔
OK
1.
0.068 s
OK
2.
0.072 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK