You are given N counters, initially set to 0, and you have two possible operations on them:
- increase(X) − counter X is increased by 1,
- max counter − all counters are set to the maximum value of any counter.
A non-empty array A of M integers is given. This array represents consecutive operations:
- if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X),
- if A[K] = N + 1 then operation K is max counter.
For example, given integer N = 5 and array A such that:
A[0] = 3 A[1] = 4 A[2] = 4 A[3] = 6 A[4] = 1 A[5] = 4 A[6] = 4the values of the counters after each consecutive operation will be:
(0, 0, 1, 0, 0) (0, 0, 1, 1, 0) (0, 0, 1, 2, 0) (2, 2, 2, 2, 2) (3, 2, 2, 2, 2) (3, 2, 2, 3, 2) (3, 2, 2, 4, 2)The goal is to calculate the value of every counter after all operations.
Write a function:
def solution(N, A)
that, given an integer N and a non-empty array A consisting of M integers, returns a sequence of integers representing the values of the counters.
Result array should be returned as an array of integers.
For example, given:
A[0] = 3 A[1] = 4 A[2] = 4 A[3] = 6 A[4] = 1 A[5] = 4 A[6] = 4the function should return [3, 2, 2, 4, 2], as explained above.
Write an efficient algorithm for the following assumptions:
- N and M are integers within the range [1..100,000];
- each element of array A is an integer within the range [1..N + 1].
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [1]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter =
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = min(ln-1
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = min(ln-1, A[0])
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = min(ln-1, A[0])
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
Setting to max[0, 0, 1, 2, 0]
function result: [0]
Setting to max[0]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = min(ln-1, A[0])
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
else:
print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = min(ln-1, A[0])
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
max_counter = max(max_counter, ar[idx_val])
ar[idx_val] = ar[idx_val]+1
else:
print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = min(ln-1, A[0])
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
max_counter = max(max_counter, ar[idx_val])
ar[idx_val] = ar[idx_val]+1
else:
print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
Setting to max[0, 0, 1, 2, 0]
function result: [0]
Setting to max[0]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = min(ln-1, A[0])
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
max_counter = max(max_counter, ar[idx_val])
ar[idx_val] = ar[idx_val]+1
else:
print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
#print("Setting to max"+str(ar))
# ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
Traceback (most recent call last): File "exec.py", line 145, in <module> main() File "exec.py", line 86, in main sol = __import__('solution') File "/tmp/solution.py", line 22 return ar ^ IndentationError: expected an indented block
Traceback (most recent call last): File "exec.py", line 145, in <module> main() File "exec.py", line 86, in main sol = __import__('solution') File "/tmp/solution.py", line 22 return ar ^ IndentationError: expected an indented block
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
pas
#print("Setting to max"+str(ar))
# ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
pass
#print("Setting to max"+str(ar))
# ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if 1c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
pass
#print("Setting to max"+str(ar))
# ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if 1<c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
pass
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if 1<c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
# pass
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if 1<=c<ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
# pass
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if 1<=c<=ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
# pass
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if 1<=c<=ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
# pass
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
[1, [11]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# max(a,b) already there no need to import just use it
# commnd opton down arro - line duplicat
def solution(N, A):
# write your code in Python 3.6
ln = N
ar = [0]*ln
max_counter = 0
for c in A:
#print(max_counter)
if 1<=c<=ln:
idx_val = c-1
ar[idx_val] = ar[idx_val]+1
max_counter = max(max_counter, ar[idx_val])
else:
# pass
#print("Setting to max"+str(ar))
ar = [max_counter]*ln
# counter is max so set all to max value of any counter
#print(""+str(ar))
return ar
The following issues have been detected: timeout errors.