Test results - Codility

Tasks Details

medium

1. MaxCounters

Calculate the values of counters after applying all alternating operations: increase counter by 1; set value of all counters to current maximum.

Task Score

100%

Correctness

100%

Performance

100%

You are given N counters, initially set to 0, and you have two possible operations on them:

increase(X) − counter X is increased by 1,

max counter − all counters are set to the maximum value of any counter.

A non-empty array A of M integers is given. This array represents consecutive operations:

if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X),

if A[K] = N + 1 then operation K is max counter.

For example, given integer N = 5 and array A such that:

A[0] = 3 A[1] = 4 A[2] = 4 A[3] = 6 A[4] = 1 A[5] = 4 A[6] = 4

the values of the counters after each consecutive operation will be:

(0, 0, 1, 0, 0) (0, 0, 1, 1, 0) (0, 0, 1, 2, 0) (2, 2, 2, 2, 2) (3, 2, 2, 2, 2) (3, 2, 2, 3, 2) (3, 2, 2, 4, 2)

The goal is to calculate the value of every counter after all operations.

Write a function:

def solution(N, A)

that, given an integer N and a non-empty array A consisting of M integers, returns a sequence of integers representing the values of the counters.

Result array should be returned as an array of integers.

For example, given:

A[0] = 3 A[1] = 4 A[2] = 4 A[3] = 6 A[4] = 1 A[5] = 4 A[6] = 4

the function should return [3, 2, 2, 4, 2], as explained above.

Write an efficient algorithm for the following assumptions:

N and M are integers within the range [1..100,000];

each element of array A is an integer within the range [1..N + 1].

Solution

Programming language used Python

Time spent on task 10 minutes

Notes

not defined yet

Code: 11:21:49 UTC, java, autosave

show code in pop-up

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 N, int[] A) {
        // write your code in Java SE 8
    }
}

Code: 11:22:10 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):
    # write your code in Python 3.6
    pass

Code: 11:22:16 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            B = [maxx] * N
        else:
            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:24:24 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            B = [maxx] * N
        else:
            result[position] = result[position] > lastUpdate
                                        ? result[position] + 1 : lastUpdate + 1;
            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:24:58 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            B = [maxx] * N
        else:
            result[position] =  B[x-1] > lastUpdate
                                        ? result[position] + 1 : lastUpdate + 1;
            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:25:08 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            B = [maxx] * N
        else:
             B[x-1] =  B[x-1] > lastUpdate
                                        ? r B[x-1] + 1 : lastUpdate + 1;
            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:25:18 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            B = [maxx] * N
        else:
             B[x-1] =  B[x-1] > lastUpdate
                                        ? r B[x-1] + 1 : lastUpdate + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:25:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > lastUpdate
                                        ? r B[x-1] + 1 : lastUpdate + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:26:20 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx

             B[x-1] =  B[x-1] > lastUpdate
                                        ? r B[x-1] + 1 : lastUpdate + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:26:33 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx

        B[x-1] =  B[x-1] > lastUpdate ? r B[x-1] + 1 : lastUpdate + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:26:43 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:26:59 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > lastUpdate
                                        ? r B[x-1] + 1 : lastUpdate + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:27:10 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
        
    return B

Code: 11:27:40 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
    for (int i = 0; i < N; ++i) {
         if(result[i] < lastUpdate) {
             result[i] = lastUpdate;
         }
     }
    return B

Code: 11:27:52 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,x in enumerate(A):
         if(result[i] < lastUpdate) {
             result[i] = lastUpdate;
         }
     }
    return B

Code: 11:28:08 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(V):
         if(b < last) {
             result[i] = lastUpdate;
         }
     }
    return B

Code: 11:28:38 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last;

    return B

Code: 11:28:45 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 145, in <module>
    main()
  File "exec.py", line 86, in main
    sol = __import__('solution')
  File "/tmp/solution.py", line 14
    B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1;
                            ^
SyntaxError: invalid syntax

Code: 11:28:54 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.052 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 145, in <module>
    main()
  File "exec.py", line 86, in main
    sol = __import__('solution')
  File "/tmp/solution.py", line 14
    B[x-1] =  B[x-1] > last ? B[x-1] + 1 : last + 1
                            ^
SyntaxError: invalid syntax

Code: 11:29:36 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  iB[x-1] > last ? B[x-1] + 1 : last + 1
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Code: 11:29:46 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
             B[x-1] =  if B[x-1] > last:
                 ? B[x-1] + 1 : last + 1
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Code: 11:29:58 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
            if B[x-1] > last:
                  B[x-1] = B[x-1] + 1 : last + 1
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Code: 11:30:13 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
            if B[x-1] > last:
                B[x-1] = B[x-1] + 1
            else:
                last + 1
#            B[x-1] = B[x-1] + 1
            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Code: 11:30:21 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
            if B[x-1] > last:
                B[x-1] = B[x-1] + 1
            else:
                B[x-1] = last + 1

            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 11:31:03 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
            if B[x-1] > last:
                B[x-1] = B[x-1] + 1
            else:
                B[x-1] = last + 1

            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 11:31:05 UTC, py, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):

    B = [0] * N

    maxx=0
    last =0
    for k,x in enumerate(A):
        if x == N + 1: 
            last = maxx
        else:
            if B[x-1] > last:
                B[x-1] = B[x-1] + 1
            else:
                B[x-1] = last + 1

            if maxx < B[x-1]: maxx = B[x-1]
            
    for k,b in enumerate(B):
         if b < last: B[k] = last

    return B

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N + M)

expand all Example tests

▶

example
example test

✔

0.036 s

expand all Correctness tests

▶

extreme_small
all max_counter operations

✔

0.036 s

▶

single
only one counter

✔

0.036 s

▶

small_random1
small random test, 6 max_counter operations

✔

0.036 s

▶

small_random2
small random test, 10 max_counter operations

✔

0.036 s

expand all Performance tests

▶

medium_random1
medium random test, 50 max_counter operations

✔

0.056 s

▶

medium_random2
medium random test, 500 max_counter operations

✔

0.040 s

▶

large_random1
large random test, 2120 max_counter operations

✔

0.104 s

▶

large_random2
large random test, 10000 max_counter operations

✔

0.196 s

▶

extreme_large
all max_counter operations

✔

0.220 s

0.256 s