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

33%

Correctness

50%

Performance

20%

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 23 minutes

Notes

not defined yet

Code: 01:23:18 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: 01:23:44 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: 01:30:48 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
    p

Code: 01:31:04 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# 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
    
    for a in A:

Code: 01:31:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# 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
    counter = [0]*len(A)
    
    for a in A:

Code: 01:31:46 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# 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
    counter = [0]*len(A)
    curmax = 
    for a in A:

Code: 01:32:03 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# 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
    counter = [0]*len(A)
    curmax = 0
    for a in A:
        if a <= N:

Code: 01:32:33 UTC, py, autosave

show code in pop-up

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

# 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
    counter = [0]*len(A)
    curmax = 0
    for a in A:
        if a <= N:
            counter[a-1] += 1
            
        else:

Code: 01:32:54 UTC, py, autosave

show code in pop-up

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

# 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
    counter = [0]*len(A)
    curmax = 0
    for a in A:
        if a <= N:
            counter[a-1] += 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:

Code: 01:35:43 UTC, py, autosave

show code in pop-up

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

# 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
    counter = [0]*len(A)
    pcurmax = 0
    for a in A:
        if a <= N:
            counter[a-1] += 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:

Code: 01:35:53 UTC, py, autosave

show code in pop-up

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

# 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
    counter = [0]*len(A)
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            counter[a-1] += 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:

Code: 01:39:12 UTC, py, autosave

show code in pop-up

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

# 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
    counter = [0]*len(A)
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            counter[a-1] += pre1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:

Code: 01:39:24 UTC, py, autosave

show code in pop-up

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

# 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
    counter = [0]*len(A)
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:

Code: 01:39:46 UTC, py, autosave

show code in pop-up

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

# 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
    counter = [0]*len(A)
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

Code: 01:40: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 18

# 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
    counter = [0]*len(A)
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax

Code: 01:40:27 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

# 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
    counter = [0]*len(A)
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [3, 0, 1, 8, 0, 0, 0] expected [3, 2, 2, 4, 2]

0.036 s

WRONG ANSWER, got [3, 0, 1, 8, 0, 0, 0] expected [3, 2, 2, 4, 2]

Code: 01:40: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

# 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
    counter = [0]*len(N)
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Code: 01:41:08 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):
    # write your code in Python 3.6
    counter = [0]*len(N)
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

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 107, in main
    result = solution( N, A )
  File "/tmp/solution.py", line 6, in solution
    counter = [0]*len(N)
TypeError: object of type 'int' has no len()

Code: 01:41: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 19 20 21

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Code: 01:41:28 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):
    # write your code in Python 3.6
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [3, 0, 1, 8, 0] expected [3, 2, 2, 4, 2]

0.036 s

WRONG ANSWER, got [3, 0, 1, 8, 0] expected [3, 2, 2, 4, 2]

stdout:

3 0 0 [0, 0, 0, 0, 0]
4 1 0 [0, 0, 1, 0, 0]
4 1 0 [0, 0, 1, 1, 0]
6 2 0 [0, 0, 1, 2, 0]
1 2 2 [0, 0, 1, 2, 0]
4 3 2 [3, 0, 1, 2, 0]
4 5 2 [3, 0, 1, 5, 0]

Code: 01:42:07 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):
    # write your code in Python 3.6
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Code: 01:42: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 22 23

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            c = counter[a-1]
            if c 
            counter[a-1] += prevmax + 1
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Code: 01:43:06 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Code: 01:43:09 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 22 23 24 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in counter:
        if c < prevmax:
            c = prevmax
    
    return counter

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [3, 0, 1, 4, 0] expected [3, 2, 2, 4, 2]

0.036 s

WRONG ANSWER, got [3, 0, 1, 4, 0] expected [3, 2, 2, 4, 2]

stdout:

3 0 0 [0, 0, 0, 0, 0]
4 1 0 [0, 0, 1, 0, 0]
4 1 0 [0, 0, 1, 1, 0]
6 2 0 [0, 0, 1, 2, 0]
1 2 2 [0, 0, 1, 2, 0]
4 3 2 [3, 0, 1, 2, 0]
4 3 2 [3, 0, 1, 3, 0]

Code: 01:43:53 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1

            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in (counter):
        if c < prevmax:
            c = prevmax
    
    return counter

Code: 01:44:12 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for c in range(N):
        if c < prevmax:
            c = prevmax
    
    return counter

Code: 01:44:23 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for i in range(N):
        if counter[i] < prevmax:
            c = prevmax
    
    return counter

Code: 01:44:32 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        print(a, curmax, prevmax, counter)
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for i in range(N):
        if counter[i] < prevmax:
            counter[i] = prevmax
    
    return counter

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

stdout:

3 0 0 [0, 0, 0, 0, 0]
4 1 0 [0, 0, 1, 0, 0]
4 1 0 [0, 0, 1, 1, 0]
6 2 0 [0, 0, 1, 2, 0]
1 2 2 [0, 0, 1, 2, 0]
4 3 2 [3, 0, 1, 2, 0]
4 3 2 [3, 0, 1, 3, 0]

Code: 01:44:54 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 25

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax

    for i in range(N):
        if counter[i] < prevmax:
            counter[i] = prevmax
    
    return counter

Code: 01:45:00 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax
        print(a, curmax, prevmax, counter)

    for i in range(N):
        if counter[i] < prevmax:
            counter[i] = prevmax
    
    return counter

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

stdout:

3 1 0 [0, 0, 1, 0, 0]
4 1 0 [0, 0, 1, 1, 0]
4 2 0 [0, 0, 1, 2, 0]
6 2 2 [0, 0, 1, 2, 0]
1 3 2 [3, 0, 1, 2, 0]
4 3 2 [3, 0, 1, 3, 0]
4 4 2 [3, 0, 1, 4, 0]

Code: 01:45:11 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax
        # print(a, curmax, prevmax, counter)

    for i in range(N):
        if counter[i] < prevmax:
            counter[i] = prevmax
    
    return counter

Code: 01:45:13 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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax
        # print(a, curmax, prevmax, counter)

    for i in range(N):
        if counter[i] < prevmax:
            counter[i] = prevmax
    
    return counter

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 01:45:15 UTC, py, final, score: 33

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 25 26

# 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
    counter = [0]*N
    prevmax, curmax = 0, 0
    for a in A:
        if a <= N:
            c = counter[a-1]
            if c < prevmax:
                counter[a-1] += prevmax + 1
            else:
                counter[a-1] += 1
                
            if counter[a-1] > curmax:
                curmax = counter[a-1]
        else:
            prevmax = curmax
        # print(a, curmax, prevmax, counter)

    for i in range(N):
        if counter[i] < prevmax:
            counter[i] = prevmax
    
    return counter

Analysis summary

The following issues have been detected: wrong answers, runtime errors.

Analysis

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

✘

WRONG ANSWER
got [13, 13, 13, 13, 13, .. expected [9, 9, 9, 9, 9, 9, 9,..

0.036 s

WRONG ANSWER, got [13, 13, 13, 13, 13, .. expected [9, 9, 9, 9, 9, 9, 9,..

▶

small_random2
small random test, 10 max_counter operations

✘

WRONG ANSWER
got [27, 27, 27, 27, 27, .. expected [10, 10, 10, 10, 10, ..

0.036 s

WRONG ANSWER, got [27, 27, 27, 27, 27, .. expected [10, 10, 10, 10, 10, ..

expand all Performance tests

▶

medium_random1
medium random test, 50 max_counter operations

✘

WRONG ANSWER
got [2192038, 2192038, 21.. expected [53, 53, 53, 53, 53, ..

0.040 s

WRONG ANSWER, got [2192038, 2192038, 21.. expected [53, 53, 53, 53, 53, ..

▶

medium_random2
medium random test, 500 max_counter operations

✘

WRONG ANSWER
got [193252050941, 193252.. expected [325, 325, 325, 325, ..

0.040 s

WRONG ANSWER, got [193252050941, 193252.. expected [325, 325, 325, 325, ..

▶

large_random1
large random test, 2120 max_counter operations

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.092 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 108, in main
    writer(args[2], result)
  File "exec.py", line 71, in writer
    _c_write_int(_c_f, _c_elem0)
  File "exec.py", line 25, in <lambda>
    _c_write_int = lambda f,x: f.write("%d\n" % x)
OSError: [Errno 27] File too large

▶

large_random2
large random test, 10000 max_counter operations

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.184 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 108, in main
    writer(args[2], result)
  File "exec.py", line 71, in writer
    _c_write_int(_c_f, _c_elem0)
  File "exec.py", line 25, in <lambda>
    _c_write_int = lambda f,x: f.write("%d\n" % x)
OSError: [Errno 27] File too large

▶

extreme_large
all max_counter operations

✔

0.228 s

0.236 s