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

Not assessed

Performance

Not assessed

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

Notes

not defined yet

Task timeline

Code: 12:53: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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

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

Code: 12:53:35 UTC, py, verify, result: Failed

show code in pop-up

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res1[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

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

Code: 12:54:06 UTC, py, verify, result: Failed

show code in pop-up

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

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

Code: 12:54:58 UTC, py, verify, result: Failed

show code in pop-up

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            #print tmp_res
            #print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            #print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

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

Code: 12:55:58 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

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

Code: 12:56:49 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
            print tmp_res
            print res
            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

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

Code: 12:57:14 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
#            print tmp_res
#            print res
#            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if res[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

[1, 0, 0, 2, 0]
[3, 2, 2, 2, 2]

Code: 12:58:04 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
#            print tmp_res
#            print res
#            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if tmp_res1[x] < max_counter:
                    tmp_res1[x] = max_counter + tmp_res[x]
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

[1, 0, 0, 2, 0]
[3, 2, 2, 2, 2]

Code: 12:59:17 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
#            print tmp_res
#            print res
#            print max_counter
            for x in xrange(len(res)):
                tmp_res1[x] = res[x] - tmp_res[x]
                if tmp_res[x] < max_counter:
                    tmp_res[x] = max_counter
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

[2, 2, 2, 2, 2]
[0, 0, 1, 2, 0]

Code: 13:00: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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
#            print tmp_res
#            print res
#            print max_counter
            tmp_res1 = tmp_res
            for x in xrange(len(res)):
                if tmp_res[x] < max_counter:
                    tmp_res[x] = max_counter
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

[2, 2, 2, 2, 2]
[2, 2, 2, 2, 2]

Code: 13:00:24 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
#            print tmp_res
#            print res
#            print max_counter
            tmp_res1 = tmp_res[:]
            for x in xrange(len(res)):
                if tmp_res[x] < max_counter:
                    tmp_res[x] = max_counter
                #print tmp_res
                #res[x] = res[x] + tmp_res[x]
            print tmp_res
            print tmp_res1
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

[2, 2, 2, 2, 2]
[1, 0, 0, 2, 0]

Code: 13:05:57 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
#            print tmp_res
#            print res
#            print max_counter
            tmp_res1 = tmp_res[:]
            for x in xrange(len(res)):
                if tmp_res[x] < max_counter:
                    tmp_res[x] = max_counter

                res[x] = tmp_res[x] + tmp_res1[x]
                print res
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

stdout:

WARNING: producing output may seriously slow down your code!
[3, 0, 1, 4, 0]
[3, 2, 1, 4, 0]
[3, 2, 2, 4, 0]
[3, 2, 2, 4, 0]
[3, 2, 2, 4, 2]

Code: 13:06:09 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            max_counter = max_val

    for y in xrange(lenA-1, 0, -1):
        if A[y] == n1:
#            print tmp_res
#            print res
#            print max_counter
            tmp_res1 = tmp_res[:]
            for x in xrange(len(res)):
                if tmp_res[x] < max_counter:
                    tmp_res[x] = max_counter

                res[x] = tmp_res[x] + tmp_res1[x]
            break
        else:
            tmp_res, tmp_max_val = increase(A[y], tmp_res, tmp_max_val)
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

Code: 13:08:40 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 27 28 29 30

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    tmp_res = [0] * N
    tmp_res1 = [0] * N
    tmp_max_val = 0
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            res = max_counter(max_val, N)

    return res

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

0.050 s

RUNTIME ERROR, tested program terminated unexpectedly

stdout:

Traceback (most recent call last):
  File "user.py", line 117, in <module>
    result = solution ( N, A ) 
  File "user.py", line 28, in solution
    res = max_counter(max_val, N)
TypeError: 'int' object is not callable

Code: 13:08:58 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 27

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    max_counter = 0
    lenA = len(A)
    n1 = N+1
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            res = max_counter(max_val, N)

    return res

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

0.050 s

RUNTIME ERROR, tested program terminated unexpectedly

stdout:

Traceback (most recent call last):
  File "user.py", line 114, in <module>
    result = solution ( N, A ) 
  File "user.py", line 25, in solution
    res = max_counter(max_val, N)
TypeError: 'int' object is not callable

Code: 13:09:26 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

def increase(x, array, max_value):
    current_val = array[x-1]
    #if current_val < max_value:
    #    array[x-1] = max_value
        
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    lenA = len(A)
    n1 = N+1
    for z in xrange(lenA):
        if A[z] != n1:
            res, max_val = increase(A[z], res, max_val)
        else:
            res = max_counter(max_val, N)

    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

Code: 13:24:23 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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    lenA = len(A)
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            res = max_counter(max_val, N)

    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

Code: 13:24:31 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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    lenA = len(A)
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            res = max_counter(max_val, N)

    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 13:42:36 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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            max_val = max_val+1

    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [1, 0, 1, 4, 0]

Code: 13:43:01 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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            max_val = max_val+1
    print max_val
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [1, 0, 1, 4, 0]

stdout:

Code: 13:47:25 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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            last_update = max_val
    print max_val
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [1, 0, 1, 4, 0]

stdout:

Code: 13:47:37 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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            last_update = max_val
    print max_val
    print last_update
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

4
2

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [1, 0, 1, 4, 0]

stdout:

4
2

Code: 13:49: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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            last_update = max_val

    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] +=last_update
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 3, 4, 2]

Code: 13:49:24 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

def increase(x, array, max_value):
    val = array[x-1] +1
    array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val)
        else:
            last_update = max_val
    
    print res
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] +=last_update
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

[1, 0, 1, 4, 0]

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 3, 4, 2]

stdout:

[1, 0, 1, 4, 0]

Code: 13:51:41 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 27 28 29 30

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    print res
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] =last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

[2, 0, 1, 4, 0]

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

stdout:

[2, 0, 1, 4, 0]

Code: 13:51:59 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 27 28 29 30

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    print res
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] =last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

stdout:

WARNING: producing output may seriously slow down your code!
[3, 0, 1, 4, 0]

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

stdout:

[3, 0, 1, 4, 0]

Code: 13:52:30 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 27 28 29

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] =last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 13:56: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 27 28 29 30

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
        last_update +=1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value, last_update

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val, last_update = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 3, 3, 4, 3]

Code: 13:56:25 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 27 28 29

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value, last_update

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val, last_update = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 13:56:44 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 27 28 29

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value, last_update

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val, last_update = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

Code: 13:57:04 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 27 28 29

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value, last_update

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val, last_update = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 13:57:19 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 27 28 29

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value, last_update

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val, last_update = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 13:58:40 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 27 28 29 30

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 13:59:23 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 27 28 29 30 31

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            print last_update
            last_update = max_val
            print last_update
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

0
2

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

stdout:

0
2

Code: 13:59:44 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 27 28 29 30 31

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            print last_update
            last_update = max_val
            print last_update
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

stdout:

WARNING: producing output may seriously slow down your code!
0
2

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

stdout:

0
2

Code: 14:00:28 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 27 28 29 30 31

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update+1:
        array[x-1] = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            print last_update
            last_update = max_val
            print last_update
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

stdout:

WARNING: producing output may seriously slow down your code!
0
2

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

stdout:

0
2

Code: 14:00:49 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 27 28 29 30 31 32

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update+1:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            print last_update
            last_update = max_val
            print last_update
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

stdout:

WARNING: producing output may seriously slow down your code!
0
2

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

stdout:

0
2

Code: 14:02:33 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 27 28 29 30 31 32 33

def increase(x, array, max_value, last_update):
    val = array[x-1] +1
    if val < last_update+1:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            print max_val
            print last_update
            last_update = max_val
            print last_update
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

stdout:

WARNING: producing output may seriously slow down your code!
2
0
2

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

stdout:

2
0
2

Code: 14:04:25 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 27 28 29 30 31 32 33 34

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1] +1
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            print max_val
            print last_update
            last_update = max_val
            print last_update
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [5, 4, 4, 8, 4] expected [3, 2, 2, 4, 2]

0.050 s

WRONG ANSWER, got [5, 4, 4, 8, 4] expected [3, 2, 2, 4, 2]

stdout:

4
0
4

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [6, 6, 6, 6, 6]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [5, 4, 4, 8, 4]

stdout:

4
0
4

Code: 14:04:47 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 27 28 29 30 31 32 33 34

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value

def max_counter(max_value, N):
    return [max_value]*N 

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for z in A:
        if z != n1:
            res, max_val = increase(z, res, max_val, last_update)
        else:
            print max_val
            print last_update
            last_update = max_val
            print last_update
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

stdout:

WARNING: producing output may seriously slow down your code!
2
0
2

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

stdout:

2
0
2

Code: 14:09: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 21 22 23 24 25 26 27 28 29 30 31

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            val = res[i-1]+=1
            if val > max_val:
                max_val = val
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

0.030 s

RUNTIME ERROR, tested program terminated unexpectedly

stdout:

  File "user.py", line 21
    val = res[i-1]+=1
                   ^
SyntaxError: invalid syntax

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
tested program terminated unexpectedly

0.030 s

RUNTIME ERROR, tested program terminated unexpectedly

stdout:

  File "user.py", line 21
    val = res[i-1]+=1
                   ^
SyntaxError: invalid syntax

▶

test_data0

✘

RUNTIME ERROR
tested program terminated unexpectedly

0.030 s

RUNTIME ERROR, tested program terminated unexpectedly

stdout:

  File "user.py", line 21
    val = res[i-1]+=1
                   ^
SyntaxError: invalid syntax

Code: 14:09:57 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 27 28 29 30 31 32

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            res[i-1]+=1
            val = res[i-1]
            if val > max_val:
                max_val = val
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

Code: 14:11:16 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 27 28 29 30 31 32 33 34

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            res[i-1]+=1
            val = res[i-1]
            if val > max_val:
                max_val = val
            if val < last_update:
                res[i-1] +=1 
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

Code: 14:11:25 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 27 28 29 30 31 32 33 34

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            res[i-1]+=1
            val = res[i-1]
            if val > max_val:
                max_val = val
            if val < last_update:
                res[i-1] +=1 
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

Code: 14:11:46 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 27 28 29 30 31 32 33 34 35 36

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            res[i-1]+=1
            val = res[i-1]
            if val > max_val:
                max_val = val
            print val
            print last_update
            if val < last_update:
                res[i-1] +=1 
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

stdout:

Code: 14:12:24 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 27 28 29 30 31 32 33 34 35 36

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            res[i-1]+=1
            val = res[i-1]
            if val > max_val:
                max_val = val
            print val
            print last_update
            if val <= last_update:
                res[i-1] +=1 
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

stdout:

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

stdout:

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

stdout:

Code: 14:12:49 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 27 28 29 30 31 32 33 34

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            res[i-1]+=1
            val = res[i-1]
            if val > max_val:
                max_val = val
            if val <= last_update:
                res[i-1] +=1 
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

▶

test_data0

✔

0.050 s

OK
function result: [2, 2, 2, 4, 2]

Code: 14:14: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 27 28 29 30 31 32 33 34

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val <= last_update:
                res[i-1] = last_update
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [3, 3, 3, 3, 3]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:15:17 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 27 28 29 30 31 32 33 34

def increase(x, array, max_value, last_update):
    array[x-1] +=1
    val = array[x-1]
    if val < last_update:
        array[x-1] = last_update+1
        val = last_update+1
    else:
        array[x-1] = val
    if max_value < val:
        max_value = val
    return array, max_value


def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val <= last_update:
                res[i-1] = last_update
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:18:28 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val <= last_update:
                res[i-1] = last_update
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [0, 0, 0, 0, 0]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:18:48 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val <= last_update:
                res[i-1] = last_update
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [1, 1, 1, 1, 1]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:19:10 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i != n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val <= last_update:
                res[i-1] = last_update
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [2, 2, 2, 2, 2]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:24:04 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i < n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val <= last_update:
                res[i-1] = last_update+1
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [2, 2, 2, 2, 2]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [4, 2, 2, 4, 2]

Code: 14:24:24 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i < n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val < last_update:
                res[i-1] = last_update+1
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✘

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

0.050 s

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

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [2, 2, 2, 2, 2]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [4, 2, 2, 4, 2]

Code: 14:24:37 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i < n1:
            val = res[i-1]+1
            if val > max_val:
                max_val = val
            if val < last_update:
                res[i-1] = last_update
            res[i-1]+=1
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [2, 2, 2, 2, 2]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:33:02 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i < n1:
            val = res[i-1]+1
            if val < last_update:
                res[i-1] = last_update
            res[i-1]+=1
            if res[i-1] > max_val:
                max_val = res[i-1]
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [2, 2, 2, 2, 2]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:37:40 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i < n1:
            if res[i-1] < last_update:
                res[i-1] = last_update
            
            res[i-1]+=1
            
            if res[i-1] > max_val:
                max_val = res[i-1]
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [2, 2, 2, 2, 2]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:42:40 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i < n1:
            if res[i-1] < last_update:
                res[i-1] = last_update
            
            res[i-1]+=1
            
            if res[i-1] > max_val:
                max_val = res[i-1]
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis

expand all Example tests

▶

example
example test

✔

0.050 s

expand all User tests

▶

test_data2

✔

0.050 s

OK
function result: [2, 2, 2, 2, 2]

▶

test_data1

✔

0.050 s

OK
function result: [4, 4, 4, 4, 4]

▶

test_data0

✔

0.050 s

OK
function result: [3, 2, 2, 4, 2]

Code: 14:42:47 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

def solution(N, A):
    res = [0] * N
    max_val = 0
    last_update = 0
    n1 = N+1
    for i in A:
        if i < n1:
            if res[i-1] < last_update:
                res[i-1] = last_update
            
            res[i-1]+=1
            
            if res[i-1] > max_val:
                max_val = res[i-1]
        else:
            last_update = max_val
    
    for i in xrange(len(res)):
        if res[i] < last_update:
            res[i] = last_update
    
    return res

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N + M)

expand all Example tests

▶

example
example test

✔

0.050 s

expand all Assessment tests

▶

extreme_small
all max_counter operations

✔

0.050 s

▶

single
only one counter

✔

0.050 s

▶

small_random1
small random test, 6 max_counter operations

✔

0.050 s

▶

small_random2
small random test, 10 max_counter operations

✔

0.050 s

▶

medium_random1
medium random test, 50 max_counter operations

✔

0.050 s

▶

medium_random2
medium random test, 500 max_counter operations

✔

0.050 s

▶

large_random1
large random test, 2120 max_counter operations

✔

0.170 s

▶

large_random2
large random test, 10000 max_counter operations

✔

0.340 s

▶

extreme_large
all max_counter operations

✔

0.430 s