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")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
counter = [res[0][1]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
counter = [res[0][1]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
[5, [1, 2, 6, 1, 2, 6]]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
counter = [res[0][1]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
counter = [res[0][1]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
[5, [1, 1, 6, 1, 2, 1, 6]]
[1, [2]]
[1, [1, 2]]
function result: [2, 2, 2, 2, 2]
Traceback (most recent call last): File "exec.py", line 145, in <module> main() File "exec.py", line 107, in main result = solution( N, A ) File "/tmp/solution.py", line 11, in solution counter = [res[0][1]] * N IndexError: list index out of range
function result: [1]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
counter = [res[0][0]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
counter = [counter[res[0][0]]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
[5, [1, 1, 6, 1, 2, 1, 6]]
[1, [2]]
[1, [1, 2]]
function result: [4, 4, 4, 4, 4]
Traceback (most recent call last): File "exec.py", line 145, in <module> main() File "exec.py", line 107, in main result = solution( N, A ) File "/tmp/solution.py", line 11, in solution counter = [counter[res[0][0]]] * N IndexError: list index out of range
function result: [1]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
if
counter = [counter[res[0][0]]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
if res:
counter = [counter[res[0][0]]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
[5, [1, 1, 6, 1, 2, 1, 6]]
[1, [2]]
[1, [1, 2]]
function result: [4, 4, 4, 4, 4]
function result: [0]
function result: [1]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
if res:
counter = [counter[res[0][0]]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
[5, [1, 1, 6, 1, 2, 1, 6]]
[1, [2]]
[1, [1, 2]]
function result: [4, 4, 4, 4, 4]
function result: [0]
function result: [1]
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N, A):
counter = [0] * N
max_dict = {}
for i in A:
if i == N + 1:
res = sorted(max_dict.items(), key=(lambda x:x[1]), reverse=True)
if res:
counter = [counter[res[0][0]]] * N
max_dict = {}
else:
counter[i - 1] += 1
if i - 1 not in max_dict.keys():
max_dict[i - 1] = 1
else:
max_dict[i - 1] += 1
return counter
The solution obtained perfect score.