Test results - Codility

Code: 02:00:34 UTC, java, autosave

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A, int[] B) {
        // write your code in Java SE 8
    }
}

Code: 02:01:03 UTC, js, autosave

1 2 3 4 5 6

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A, B) {
    // write your code in JavaScript (Node.js 8.9.4)
}

Code: 02:01:33 UTC, js, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    let progress = true
    let index = 0
    let stack = []
    let error = false
    while (index < S.length) {
        if (stack.length === 0) {
            if (S[index] === ')' || S[index] === ']' || S[index] === '}') {
                 return 0
            } else {
            stack.push(S[index])
            }
        }
        else if (is_properly_nested(stack[stack.length-1],S[index])) {
            stack.pop(stack[stack.length-1])
        } else {
            if (S[index] === ')' || S[index] === ']' || S[index] === '}') {
                return 0
            }
            else {
                stack.push(S[index])
            }
        }
        index ++
    }

    if (stack.length === 0) {
        return 1
    } else {
        return 0
    }
}

function is_properly_nested(a,b){
    if ( (a === '(' && b === ')') || (a === '[' && b === ']') || (a === '{' && b === '}')) {
        return true
    }
    else {
        return false
    }
}

Code: 02:02:29 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    let progress = true
    let index = 0
    let stack = []
    let error = false
    while (index < S.length) {
        if (stack.length === 0) {
            if (S[index] === ')' || S[index] === ']' || S[index] === '}') {
                 return 0
            } else {
            stack.push(S[index])
            }
        }
        else if (is_properly_nested(stack[stack.length-1],S[index])) {
            stack.pop(stack[stack.length-1])
        } else {
            if (S[index] === ')' || S[index] === ']' || S[index] === '}') {
                return 0
            }
            else {
                stack.push(S[index])
            }
        }
        index ++
    }

    if (stack.length === 0) {
        return 1
    } else {
        return 0
    }
}

function is_properly_nested(a,b){
    if ( (a === '(' && b === ')') || (a === '[' && b === ']') || (a === '{' && b === '}')) {
        return true
    }
    else {
        return false
    }
}

Analysis

▶

example
example test

✘

WRONG ANSWER
got 0 expected 2

Code: 02:04:03 UTC, js, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A, B) {
  // write your code in JavaScript (Node.js 8.9.4)
  let C = [];
  let D = [];
  let index = 1;
  let finish = false;
  C[0] = A[0];
  D[0] = B[0];
  //fill the 0s

  while (index < A.length) {
    if (D[D.length - 1] === 0) {
      //if the last pushed element was 0, we will anyway add the new one (they stack or don't meet)
      C.push(A[index]);
      D.push(B[index]);
      index++;
    } else {
      //if the last element is 1, we start to navigate, be careful about reaching the end
      if (B[index] === 1) {
        C.push(A[index]);
        D.push(B[index]);
        index++;
      } else {
        let stop = 0;
        while (D[D.length - 1] === 1 && stop !== 1) {
          if (A[index] > C[C.length - 1]) {
            C.pop();
            D.pop();
            //if we are at the end place the big fish in the stack, to avoid an infinite loop
            if (C.length === 0) {
              index++;
              stop = 1;
              C.push(A[index]);
              D.push(B[index]);
            }
          } else {
            index++;
            stop = 1;
          }
        }
      }
    }
  }
  return C.length;
}

Code: 02:04:04 UTC, js, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A, B) {
  // write your code in JavaScript (Node.js 8.9.4)
  let C = [];
  let D = [];
  let index = 1;
  let finish = false;
  C[0] = A[0];
  D[0] = B[0];
  //fill the 0s

  while (index < A.length) {
    if (D[D.length - 1] === 0) {
      //if the last pushed element was 0, we will anyway add the new one (they stack or don't meet)
      C.push(A[index]);
      D.push(B[index]);
      index++;
    } else {
      //if the last element is 1, we start to navigate, be careful about reaching the end
      if (B[index] === 1) {
        C.push(A[index]);
        D.push(B[index]);
        index++;
      } else {
        let stop = 0;
        while (D[D.length - 1] === 1 && stop !== 1) {
          if (A[index] > C[C.length - 1]) {
            C.pop();
            D.pop();
            //if we are at the end place the big fish in the stack, to avoid an infinite loop
            if (C.length === 0) {
              index++;
              stop = 1;
              C.push(A[index]);
              D.push(B[index]);
            }
          } else {
            index++;
            stop = 1;
          }
        }
      }
    }
  }
  return C.length;
}

Analysis

▶

example
example test

✔

OK

Code: 02:04:09 UTC, js, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A, B) {
  // write your code in JavaScript (Node.js 8.9.4)
  let C = [];
  let D = [];
  let index = 1;
  let finish = false;
  C[0] = A[0];
  D[0] = B[0];
  //fill the 0s

  while (index < A.length) {
    if (D[D.length - 1] === 0) {
      //if the last pushed element was 0, we will anyway add the new one (they stack or don't meet)
      C.push(A[index]);
      D.push(B[index]);
      index++;
    } else {
      //if the last element is 1, we start to navigate, be careful about reaching the end
      if (B[index] === 1) {
        C.push(A[index]);
        D.push(B[index]);
        index++;
      } else {
        let stop = 0;
        while (D[D.length - 1] === 1 && stop !== 1) {
          if (A[index] > C[C.length - 1]) {
            C.pop();
            D.pop();
            //if we are at the end place the big fish in the stack, to avoid an infinite loop
            if (C.length === 0) {
              index++;
              stop = 1;
              C.push(A[index]);
              D.push(B[index]);
            }
          } else {
            index++;
            stop = 1;
          }
        }
      }
    }
  }
  return C.length;
}

Analysis

▶

example
example test

✔

OK

Code: 02:04:12 UTC, js, final, score: 100

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A, B) {
  // write your code in JavaScript (Node.js 8.9.4)
  let C = [];
  let D = [];
  let index = 1;
  let finish = false;
  C[0] = A[0];
  D[0] = B[0];
  //fill the 0s

  while (index < A.length) {
    if (D[D.length - 1] === 0) {
      //if the last pushed element was 0, we will anyway add the new one (they stack or don't meet)
      C.push(A[index]);
      D.push(B[index]);
      index++;
    } else {
      //if the last element is 1, we start to navigate, be careful about reaching the end
      if (B[index] === 1) {
        C.push(A[index]);
        D.push(B[index]);
        index++;
      } else {
        let stop = 0;
        while (D[D.length - 1] === 1 && stop !== 1) {
          if (A[index] > C[C.length - 1]) {
            C.pop();
            D.pop();
            //if we are at the end place the big fish in the stack, to avoid an infinite loop
            if (C.length === 0) {
              index++;
              stop = 1;
              C.push(A[index]);
              D.push(B[index]);
            }
          } else {
            index++;
            stop = 1;
          }
        }
      }
    }
  }
  return C.length;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

▶

example
example test

✔

OK

▶

extreme_small
1 or 2 fishes

✔

OK

1.

0.068 s

OK

2.

0.068 s

OK

3.

0.068 s

OK

4.

0.068 s

OK

5.

0.068 s

OK

6.

0.072 s

OK

7.

0.068 s

OK

▶

simple1
simple test

✔

OK

▶

simple2
simple test

✔

OK

▶

small_random
small random test, N = ~100

✔

OK

▶

medium_random
small medium test, N = ~5,000

✔

OK

▶

large_random
large random test, N = ~100,000

✔

OK

▶

extreme_range1
all except one fish flowing in the same direction

✔

OK

▶

extreme_range2
all fish flowing in the same direction

✔

OK