Test results - Codility

Tasks Details

easy

1. StoneWall

Cover "Manhattan skyline" using the minimum number of rectangles.

Task Score

50%

Correctness

100%

Performance

22%

You are going to build a stone wall. The wall should be straight and N meters long, and its thickness should be constant; however, it should have different heights in different places. The height of the wall is specified by an array H of N positive integers. H[I] is the height of the wall from I to I+1 meters to the right of its left end. In particular, H[0] is the height of the wall's left end and H[N−1] is the height of the wall's right end.

The wall should be built of cuboid stone blocks (that is, all sides of such blocks are rectangular). Your task is to compute the minimum number of blocks needed to build the wall.

Write a function:

def solution(H)

that, given an array H of N positive integers specifying the height of the wall, returns the minimum number of blocks needed to build it.

For example, given array H containing N = 9 integers:

H[0] = 8 H[1] = 8 H[2] = 5 H[3] = 7 H[4] = 9 H[5] = 8 H[6] = 7 H[7] = 4 H[8] = 8

the function should return 7. The figure shows one possible arrangement of seven blocks.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

each element of array H is an integer within the range [1..1,000,000,000].

Solution

Programming language used Python

Time spent on task 68 minutes

Notes

not defined yet

Task timeline

Code: 04:06:52 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[] H) {
        // write your code in Java SE 8
    }
}

Code: 04:07:17 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

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

def solution(H):
    
    stack = []

    for hei in H:
        print(hei)

Code: 04:17:18 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(H):
    
    stack = []

    for hei in H:

Code: 04:17:44 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            pass
        else:
            stack.append(hei)

Code: 04:19:49 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(H):
    
    stack = []

    for hei in H:
        if stack:
            
            pass
        else:
            stack.append(hei)

Code: 04:20:00 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            stack.append()
        else:
            stack.append(hei)

Code: 04:20:12 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            stack.append()
        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:20:22 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            stack.append(hei)
        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:20:34 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            
            pass
        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:20:46 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            if hei > stack[0]:
                
            pass
        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:20:59 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    

            pass
        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:32:50 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:

        else:
            stack.append(hei)

    if stack:
        pass

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

show code in pop-up

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

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

def solution(H):
    
    stack = []

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    
        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:33:30 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

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

def solution(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    

        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:33:57 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(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    stack.pop()


        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:34:08 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    


        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:34:38 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:37:41 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(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    stack



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:37:52 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:38: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

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

def solution(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    before_num = 



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:38:42 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(H):
    
    stack = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    stack.pop()



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:38:56 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(H):
    
    queue = []
    count = 0

    for hei in H:
        if stack:
            if hei < stack[0]:
                while stack:
                    stack.pop()



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:39:26 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(H):
    
    queue = []
    count = 0

    for hei in H:
        if QUEUE:
            if hei < stack[0]:
                while stack:
                    stack.pop()



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:39:38 UTC, py, autosave

show code in pop-up

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

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

def solution(H):
    
    queue = []
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while stack:
                    stack.pop()



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:39:48 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(H):
    
    queue = []
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    stack.pop()



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:40:01 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(H):
    
    queue = []
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    queue



        else:
            stack.append(hei)

    if stack:
        pass

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

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

import collections
def solution(H):
    
    queue = []
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    queue



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:40:26 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")

import collections
def solution(H):
    
    queue = collections.deque()
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    queue



        else:
            stack.append(hei)

    if stack:
        pass

Code: 04:40:47 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")

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    queue



        else:
            stack.append(hei)

    if queue: 
        pass

Code: 04:41:04 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")

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    queue
                    
        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:41:34 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")

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    queue.poplef

        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:41:52 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    before_num = queue.popleft()
                    

        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:42:13 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    before_num = queue.pop()
                    


        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:42:52 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    before_num = queue.popleft()



        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:43:02 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")

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    before_num = queue.popleft()
                    



        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:43: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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                while queue:
                    before_num = queue.popleft()

                    



        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:43:26 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")

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                if before_num = 0
                while queue:
                    
                    before_num = queue.popleft()





        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:43: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 24 25 26 27

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    before_num 

                    before_num = queue.popleft()





        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:44:08 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    before_num 

                    before_num = queue.popleft()
            before_num.appedn





        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:44:18 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    before_num 

                    before_num = queue.popleft()
            queue.append()





        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:44:33 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    before_num 

                    before_num = queue.popleft()
            queue.append(hei)





        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04: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 26 27 28

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    queue[0] > before_num 

                    before_num = queue.popleft()
            queue.append(hei)





        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:45: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 19 20 21 22 23 24 25 26 27 28

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)





        else:
            queue.append(hei)

    if queue: 
        pass

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        





        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:45: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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    if queue: 
        pass

Code: 04:46: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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > be

Code: 04:46:44 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 27 28 29

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Code: 04:46:44 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 04:47:18 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Code: 04:47: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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print(hei)
        print(queue)
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

8
deque([])
8
deque([8])
5
deque([8, 8])
7
deque([5])
9
deque([5, 7])
8
deque([5, 7, 9])
7
deque([5, 7, 9, 8])
4
deque([5, 7, 9, 8, 7])
8
deque([4])
6

Code: 04:50:15 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 27 28 29 30 31 32

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print(hei)
        print(queue)
        p[]
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Code: 04:50: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 22 23 24 25 26 27 28 29 30 31 32

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print(hei)
        print(queue)
        print(count)
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

8
deque([])
0
8
deque([8])
0
5
deque([8, 8])
0
7
deque([5])
1
9
deque([5, 7])
1
8
deque([5, 7, 9])
1
7
deque([5, 7, 9, 8])
1
4
deque([5, 7, 9, 8, 7])
1
8
deque([4])
4
6

Code: 04:50:46 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print(hei)
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Code: 04:51: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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.040 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
height ::: 8
deque([4])
count ::: 4
6

Code: 04:53:26 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 27 28 29 30 31 32 33

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        print
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Code: 04:53: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 31 32 33 34

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
height ::: 8
deque([4])
count ::: 4
leave count 
deque([4, 8])
deque([8])
6

Code: 04:53:57 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 27 28 29 30 31 32 33 34 35

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print()
    print(count)

Code: 04:54:13 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
height ::: 8
deque([4])
count ::: 4
leave count 
deque([4, 8])
deque([8])
deque([])
6

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                while queue:
                    if queue[0] > before_num:
                        tempcount += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 04:54:39 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 27 28 29 30 31 32 33 34 35 36

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    before_num = queue.popleft()
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 04:54:50 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 27 28 29 30 31 32 33 34 35 36 37

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    before_num = queue.popleft()
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 04:55:14 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 27 28 29 30 31 32 33 34 35 36 37 38

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 04:55: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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
temp_count ::: 1
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
temp_count ::: 3
height ::: 8
deque([4])
count ::: 4
leave count 
deque([4, 8])
deque([8])
deque([])
6

Code: 05:03:42 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 27 28 29 30 31 32 33 34 35 36 37 38 39

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:04:00 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 27 28 29 30 31 32 33 34 35 36 37 38 39

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:04:30 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif 
                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:05:01 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        
                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:05:20 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                        temp_hash[] = 1
                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1

                    before_num = queue.popleft()
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:06:13 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:06: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 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    before_
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[]
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:07:02 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
temp_count ::: 1
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
temp_count ::: 3
height ::: 8
deque([4])
count ::: 4
leave count 
deque([4, 8])
deque([8])
deque([])
6

Code: 05:08: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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
temp_count ::: 1
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
temp_count ::: 3
height ::: 8
deque([4])
count ::: 4
leave count 
deque([4, 8])
deque([8])
deque([])
6

Code: 05:09:16 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print(temp_hash)
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:09:42 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
temp_hash ::: defaultdict(<class 'int'>, {8: 1})
temp_count ::: 1
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
temp_hash ::: defaultdict(<class 'int'>, {5: 1, 7: 1, 9: 1, 8: 1})
temp_count ::: 3
height ::: 8
deque([4])
count ::: 4
leave count 
deque([4, 8])
deque([8])
deque([])
6

Code: 05:10:13 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        print
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:10:33 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[q] == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Code: 05:11:12 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    print("leave count ")
    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

height ::: 8
deque([])
count ::: 0
height ::: 8
deque([8])
count ::: 0
height ::: 5
deque([8, 8])
count ::: 0
temp_hash ::: defaultdict(<class 'int'>, {8: 1})
temp_count ::: 1
height ::: 7
deque([5])
count ::: 1
height ::: 9
deque([5, 7])
count ::: 1
height ::: 8
deque([5, 7, 9])
count ::: 1
height ::: 7
deque([5, 7, 9, 8])
count ::: 1
height ::: 4
deque([5, 7, 9, 8, 7])
count ::: 1
tmep+_before:::9
temp_hash ::: defaultdict(<class 'int'>, {5: 1, 7: 1, 9: 1, 8: 1})
temp_count ::: 4
height ::: 8
deque([4])
count ::: 5
leave count 
deque([4, 8])
deque([8])
deque([])
7

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        print(queue)
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)
            
    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            temp_count += 1
        before_num = queue.popleft()
    
    print(queue)
    print(count)

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        print("tmep+_before:::" + str(before_num))
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                print("temp_hash ::: " + str(temp_hash))
                print("temp_count ::: " + str(temp_count))
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            temp_count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1
    
    print(queue)
    print(count)

Code: 05:13:08 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        print("height ::: " + str(hei))
        print(queue)
        print("count ::: " + str(count))
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            temp_count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

Code: 05:13:14 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            temp_count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

Analysis

expand all Example tests

▶

example

✔

0.036 s

Code: 05:13:26 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 27 28 29 30 31 32 33 34 35 36 37 38

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            temp_count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

Code: 05:13:50 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            temp_count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

User test case 1:

[5, 6, 9, 8, 8, 5, 7]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✘

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 129, in <module>
    main()
  File "exec.py", line 91, in main
    result = solution( H )
  File "/tmp/solution.py", line 34, in solution
    temp_count += 1
UnboundLocalError: local variable 'temp_count' referenced before assignment

Code: 05:14:08 UTC, py, autosave

show code in pop-up

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

Code: 05:14: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 35 36 37 38

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

User test case 1:

[5, 6, 9, 8, 8, 5, 7]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.040 s

OK
function result: 5

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

Code: 05:14:36 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

User test case 1:

[5, 6, 9, 8, 8, 5, 7]

User test case 2:

[1]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 5

▶

test_data2

✔

0.036 s

OK
function result: 1

Code: 05:14:41 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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

User test case 1:

[5, 6, 9, 8, 8, 5, 7]

User test case 2:

[1]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 5

▶

test_data2

✔

0.036 s

OK
function result: 1

Code: 05:14:44 UTC, py, final, score: 50

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

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

import collections
def solution(H):
    
    queue = collections.deque([])
    count = 0

    for hei in H:
        if queue:
            if hei < queue[0]:
                before_num = 0
                temp_count = 0
                temp_hash = collections.defaultdict(int)
                while queue:
                    if queue[0] > before_num:
                        temp_count += 1
                    elif queue[0] < before_num and temp_hash[queue[0]] == 0:
                        temp_count += 1
                    before_num = queue.popleft()
                    temp_hash[before_num] = 1
                count += temp_count
            queue.append(hei)
        else:
            queue.append(hei)

    temp_hash = collections.defaultdict(int)
    before_num = 0
    while queue:
        if queue[0] > before_num:
            count += 1
        elif queue[0] < before_num and temp_hash[queue[0]] == 0 :
            count += 1
        before_num = queue.popleft()
        temp_hash[before_num] = 1

    return count

Analysis summary

The following issues have been detected: wrong answers.

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all Correctness tests

▶

simple1

✔

0.036 s

▶

simple2

✔

0.036 s

▶

simple3

✔

0.036 s

▶

simple4

✔

0.036 s

▶

boundary_cases

✔

0.036 s

expand all Performance tests

▶

medium1

✘

WRONG ANSWER
got 87 expected 117

0.036 s

WRONG ANSWER, got 87 expected 117

▶

medium2

✘

WRONG ANSWER
got 239 expected 357

0.036 s

WRONG ANSWER, got 239 expected 357

▶

medium3

✘

WRONG ANSWER
got 260 expected 403

0.036 s

WRONG ANSWER, got 260 expected 403

▶

medium4

✘

WRONG ANSWER
got 346 expected 468

0.036 s

WRONG ANSWER, got 346 expected 468

▶

large_piramid

✔

0.176 s

▶

large_increasing_decreasing

✔

0.168 s

0.212 s

▶

large_up_to_20

✘

WRONG ANSWER
got 47489 expected 81986

0.188 s

WRONG ANSWER, got 47489 expected 81986

▶

large_up_to_100

✘

WRONG ANSWER
got 49595 expected 94813

0.164 s

WRONG ANSWER, got 49595 expected 94813

▶

large_max

✘

WRONG ANSWER
got 99999 expected 100000

0.192 s

WRONG ANSWER, got 99999 expected 100000