Tasks Details
easy
1.
StoneWall
Cover "Manhattan skyline" using the minimum number of rectangles.
Task Score
100%
Correctness
100%
Performance
100%
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] = 8the 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].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 27 minutes
Notes
not defined yet
Code: 10:13:54 UTC,
java,
autosave
Code: 10:14:23 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.048 s
WRONG ANSWER,
got 0 expected 7
stdout:
[8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8] [8, 8, 5, 7, 9, 8, 7, 4, 8]
Code: 10:14:29 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 7
stdout:
8 8 5 7 9 8 7 4 8
Code: 10:15:12 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
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 8, in solution
if stack.empty(): stack.append(h)
AttributeError: 'dict' object has no attribute 'empty'
Code: 10:15:25 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
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 8, in solution
if len(stack) == 0: stack.append(h)
AttributeError: 'dict' object has no attribute 'append'
Code: 10:15:36 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 7
stdout:
8 5 7 9 8 7 4 8
Code: 10:16:53 UTC,
py,
autosave
Code: 10:17:07 UTC,
py,
autosave
Code: 10:17:27 UTC,
py,
autosave
Code: 10:17:38 UTC,
py,
autosave
Code: 10:17:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif if h > stack[-1]:
print("remove from stack, recheck untill ok", h)
return 0
Code: 10:18:28 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
elif h ==
return 0
Code: 10:18:36 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 7
stdout:
remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 7 add a brick, add to stack 9 remove from stack, recheck untill ok 7 remove from stack, recheck untill ok 4
Code: 10:19:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
return 0
Code: 10:19:23 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
elif:
contine
return 0
Code: 10:19:33 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
elif:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
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 70, in main
sol = __import__('solution')
File "/tmp/solution.py", line 14
elif:
^
SyntaxError: invalid syntax
Code: 10:19:39 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
1.
0.056 s
WRONG ANSWER,
got 0 expected 7
stdout:
do nothing 8 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 7 add a brick, add to stack 9 do nothing 8 remove from stack, recheck untill ok 7 remove from stack, recheck untill ok 4 do nothing 8
Code: 10:19:53 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:20:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while h <
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:20:37 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) == 0 or h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 120
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 12, in solution
print("remove from stack, recheck untill ok", h)
OSError: [Errno 27] File too large
Exception ignored in: <_io.TextIOWrapper name='<stdout>' mode='w' encoding='ANSI_X3.4-1968'>
OSError: [Errno 27] File too large
stdout:
do nothing 8 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove from stack, recheck untill ok 5 remove
Code: 10:20:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) == 0 or h < stack[-1]:
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:20:54 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) == 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
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 12, in solution
stack.pop()
IndexError: pop from empty list
stdout:
do nothing 8 remove from stack, recheck untill ok 5
Code: 10:24:22 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) == 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
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 12, in solution
stack.pop()
IndexError: pop from empty list
stdout:
do nothing 8 remove from stack, recheck untill ok 5
Code: 10:24:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:24:34 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
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 11, in solution
while len(stack) != 0 or h < stack[-1]:
IndexError: list index out of range
stdout:
do nothing 8 remove from stack, recheck untill ok 5
Code: 10:25:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfBr
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:25:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0: stack.append(h)
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:25:31 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
tack.append(h)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
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 10, in solution
tack.append(h)
NameError: name 'tack' is not defined
Code: 10:25:33 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stack.append(h)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:25:34 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stack.append(h)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Analysis
expand all
Example tests
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 14, in solution
while len(stack) != 0 or h < stack[-1]:
IndexError: list index out of range
stdout:
do nothing 8 remove from stack, recheck untill ok 5
Code: 10:25:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stack.append(h)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:26:03 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stack.append(h)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
stack[-1] -
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:26:16 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stack.append(h)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
h - stack[-1]
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:26:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:26:56 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:27:33 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:27:43 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:27:54 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:28:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
else
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:28:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
print("do nothing", h)
return 0
Code: 10:28:27 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else: continue
print("do nothing", h)
return 0
Code: 10:28:38 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:29:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:29:20 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:29:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
elif h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:29:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
if h < stack[-1]:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:29:56 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:30:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
else
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:30:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
if len(stack) == 0:
stoneSize = h
else:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:30:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:31:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:31:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:31:52 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:32:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:32:16 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:32:27 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
print("add a brick, add to stack", h)
else:
continue
print("do nothing", h)
return 0
Code: 10:32:42 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
return 0
Code: 10:33:01 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 or h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
return 0
Analysis
expand all
Example tests
1.
0.048 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 9, in solution
while len(stack) != 0 or h < stack[-1]:
IndexError: list index out of range
Code: 10:33:19 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 s h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
return 0
Code: 10:33:23 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 and h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 7
stdout:
add a brick, add to stack 8 remove from stack, recheck untill ok 5 add a brick, add to stack 5 add a brick, add to stack 7 add a brick, add to stack 9 add a brick, add to stack 8 add a brick, add to stack 7 remove from stack, recheck untill ok 4 add a brick, add to stack 4 add a brick, add to stack 8
Code: 10:33:39 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 and h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 8 expected 7
stdout:
add a brick, add to stack 8 remove from stack, recheck untill ok 5 add a brick, add to stack 5 add a brick, add to stack 7 add a brick, add to stack 9 add a brick, add to stack 8 add a brick, add to stack 7 remove from stack, recheck untill ok 4 add a brick, add to stack 4 add a brick, add to stack 8 8
Code: 10:33:47 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
for h in H:
while len(stack) != 0 and h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:34:34 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
cur
for h in H:
while len(stack) != 0 and h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:34:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < stack[-1]:
stack.pop()
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:35:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:35:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
currentHeight +
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:35:20 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:35:43 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:35:47 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > stack[-1]:
stoneSize = h - stack[-1]
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Analysis
expand all
Example tests
1.
0.044 s
WRONG ANSWER,
got 8 expected 7
stdout:
add a brick, add to stack 8 remove from stack, recheck untill ok 5 add a brick, add to stack 5 add a brick, add to stack 7 add a brick, add to stack 9 remove from stack, recheck untill ok 8 add a brick, add to stack 8 remove from stack, recheck untill ok 7 add a brick, add to stack 7 remove from stack, recheck untill ok 4 add a brick, add to stack 4 add a brick, add to stack 8 8
Code: 10:37:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > currentHeight:
stoneSize = h - stack[-1]
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == stack[-1]:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:37:18 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > currentHeight:
stoneSize = h - stack[-1]
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == currentHeight:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 8 expected 7
stdout:
add a brick, add to stack 8 remove from stack, recheck untill ok 5 add a brick, add to stack 5 add a brick, add to stack 7 add a brick, add to stack 9 remove from stack, recheck untill ok 8 add a brick, add to stack 8 remove from stack, recheck untill ok 7 add a brick, add to stack 7 remove from stack, recheck untill ok 4 add a brick, add to stack 4 add a brick, add to stack 8 8
Code: 10:38:53 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > currentHeight:
stoneSize = h - currentHeight
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == currentHeight:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:39:26 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
print("remove from stack, recheck untill ok", h)
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > currentHeight:
stoneSize = h - currentHeight
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == currentHeight:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
add a brick, add to stack 8 remove from stack, recheck untill ok 5 add a brick, add to stack 5 add a brick, add to stack 7 add a brick, add to stack 9 remove from stack, recheck untill ok 8 add a brick, add to stack 8 remove from stack, recheck untill ok 7 remove from stack, recheck untill ok 4 remove from stack, recheck untill ok 4 add a brick, add to stack 4 add a brick, add to stack 8 7
Code: 10:39:34 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > currentHeight:
stoneSize = h - currentHeight
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h == currentHeight:
continue
print("do nothing", h)
print(numberOfStones)
return numberOfStones
Code: 10:39:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
print("add a brick, add to stack", h)
elif h > currentHeight:
stoneSize = h - currentHeight
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h == currentHeight:
continue
return numberOfStones
Code: 10:40:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > currentHeight:
stoneSize = h - currentHeight
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h == currentHeight:
continue
return numberOfStones
Code: 10:40:15 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > currentHeight:
stoneSize = h - currentHeight
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h == currentHeight:
continue
return numberOfStones
Analysis
Code: 10:40:17 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(H):
stack = []
numberOfStones = 0
currentHeight = 0
for h in H:
while len(stack) != 0 and h < currentHeight:
stone = stack.pop()
currentHeight = currentHeight - stone
if len(stack) == 0:
stoneSize = h
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h > currentHeight:
stoneSize = h - currentHeight
currentHeight = h
stack.append(stoneSize)
numberOfStones = numberOfStones +1
elif h == currentHeight:
continue
return numberOfStonesAnalysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
expand all
Performance tests
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.188 s
OK
1.
0.184 s
OK
2.
0.200 s
OK
1.
0.192 s
OK
1.
0.208 s
OK
1.
0.212 s
OK