Tasks Details
hard
Given an array, find all its elements that can become a leader, after increasing by 1 all of the numbers in some segment of a given length.
Task Score
100%
Correctness
100%
Performance
100%
Integers K, M and a non-empty array A consisting of N integers, not bigger than M, are given.
The leader of the array is a value that occurs in more than half of the elements of the array, and the segment of the array is a sequence of consecutive elements of the array.
You can modify A by choosing exactly one segment of length K and increasing by 1 every element within that segment.
The goal is to find all of the numbers that may become a leader after performing exactly one array modification as described above.
Write a function:
def solution(K, M, A)
that, given integers K and M and an array A consisting of N integers, returns an array of all numbers that can become a leader, after increasing by 1 every element of exactly one segment of A of length K. The returned array should be sorted in ascending order, and if there is no number that can become a leader, you should return an empty array. Moreover, if there are multiple ways of choosing a segment to turn some number into a leader, then this particular number should appear in an output array only once.
For example, given integers K = 3, M = 5 and the following array A:
A[0] = 2 A[1] = 1 A[2] = 3 A[3] = 1 A[4] = 2 A[5] = 2 A[6] = 3the function should return [2, 3]. If we choose segment A[1], A[2], A[3] then we get the following array A:
A[0] = 2 A[1] = 2 A[2] = 4 A[3] = 2 A[4] = 2 A[5] = 2 A[6] = 3and 2 is the leader of this array. If we choose A[3], A[4], A[5] then A will appear as follows:
A[0] = 2 A[1] = 1 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = 3 A[6] = 3and 3 will be the leader.
And, for example, given integers K = 4, M = 2 and the following array:
A[0] = 1 A[1] = 2 A[2] = 2 A[3] = 1 A[4] = 2the function should return [2, 3], because choosing a segment A[0], A[1], A[2], A[3] and A[1], A[2], A[3], A[4] turns 2 and 3 into the leaders, respectively.
Write an efficient algorithm for the following assumptions:
- N and M are integers within the range [1..100,000];
- K is an integer within the range [1..N];
- each element of array A is an integer within the range [1..M].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 37 minutes
Notes
not defined yet
Code: 05:50:20 UTC,
java,
autosave
Code: 06:04:40 UTC,
java,
autosave
Code: 06:05:56 UTC,
java,
autosave
Code: 06:08:49 UTC,
py,
autosave
Code: 06:09:19 UTC,
py,
autosave
Code: 06:09:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for
Code: 06:09:53 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
Code: 06:10:04 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L
Code: 06:10:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t
Code: 06:10:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
Code: 06:11:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1]
Code: 06:11:23 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[
Code: 06:11:47 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1]
Code: 06:12:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if rec[L-1] > N
Code: 06:12:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N
Code: 06:12:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if
Code: 06:13:17 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N///2:
result.add(
Code: 06:13:28 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N///2:
result.add(R+1)
Code: 06:13:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N///2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] +1
Code: 06:14:26 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N///2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
result = list(result)
result.sort()
Code: 06:14:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N///2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
result = list(result).sort()
Code: 06:14:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N///2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Code: 06:15:03 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N///2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
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 149, in <module>
main()
File "exec.py", line 90, in main
sol = __import__('solution')
File "/tmp/solution.py", line 26
if result[R+1] > N///2:
^
SyntaxError: invalid syntax
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 149, in <module>
main()
File "exec.py", line 90, in main
sol = __import__('solution')
File "/tmp/solution.py", line 26
if result[R+1] > N///2:
^
SyntaxError: invalid syntax
Code: 06:15:14 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N/2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
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 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 15, in solution
if result[j] > N/2:
TypeError: 'set' object does not support indexing
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 11, in solution
re[elm] += 1
IndexError: list index out of range
Code: 06:16:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Code: 06:16:06 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L] -= 1
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 15, in solution
if result[j] > N//2:
TypeError: 'set' object does not support indexing
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 11, in solution
re[elm] += 1
IndexError: list index out of range
Code: 06:18:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
result[L-1] += 1
result[R] -= 1
result[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Code: 06:19:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if result[L-1] > N//2:
result.add(L-1)
if result[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Code: 06:19:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if re[L-1] > N//2:
result.add(L-1)
if re[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Code: 06: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(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if result[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if re[L-1] > N//2:
result.add(L-1)
if re[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
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 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 15, in solution
if result[j] > N//2:
TypeError: 'set' object does not support indexing
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 11, in solution
re[elm] += 1
IndexError: list index out of range
Code: 06:20:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if re[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if re[L-1] > N//2:
result.add(L-1)
if re[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Code: 06:20:21 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if re[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if re[L-1] > N//2:
result.add(L-1)
if re[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
return list(result).sort()
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, array expected, <class 'NoneType'> found.
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 11, in solution
re[elm] += 1
IndexError: list index out of range
Code: 06:23:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if re[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if re[L-1] > N//2:
result.add(L-1)
if re[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
result list(result).sort()
Code: 06:23:33 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if re[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if re[L-1] > N//2:
result.add(L-1)
if re[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
result = list(result)
return result.sort()
Code: 06:23:39 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for i in range(K):
A[K] += 1
re = [0]*(M+2)
for elm in A:
re[elm] += 1
result = set()
for j in range(1, M+2):
if re[j] > N//2:
result.add(j)
for t in range(1, N-K+1):
L, R = A[t-1], A[t+K-1]
re[L] -= 1
re[L-1] += 1
re[R] -= 1
re[R+1] += 1
if re[L-1] > N//2:
result.add(L-1)
if re[R+1] > N//2:
result.add(R+1)
A[t-1] -= 1
A[t+K-1] += 1
result = list(result)
return result.sort()
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, array expected, <class 'NoneType'> found.
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 149, in <module>
main()
File "exec.py", line 111, in main
result = solution( K, M, A )
File "/tmp/solution.py", line 11, in solution
re[elm] += 1
IndexError: list index out of range
Code: 06:26:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for k in range(K):
A[k] += 1
rec = [0]*(M+2)
for a in A:
rec[a] += 1
res = set()
for i in range(1, M+2):
if rec[i] > N//2:
res.add(i)
for j in range(1, N-K+1):
L, R = A[j-1], A[j+K-1]
rec[L] -= 1
rec[L-1] += 1
rec[R] -= 1
rec[R+1] += 1
if rec[L-1] > N//2:
res.add(L-1)
if rec[R+1] > N//2:
res.add(R+1)
A[j-1] -= 1
A[j+K-1] += 1
res = list(res)
res.sort()
return res
Code: 06:26:06 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for k in range(K):
A[k] += 1
rec = [0]*(M+2)
for a in A:
rec[a] += 1
res = set()
for i in range(1, M+2):
if rec[i] > N//2:
res.add(i)
for j in range(1, N-K+1):
L, R = A[j-1], A[j+K-1]
rec[L] -= 1
rec[L-1] += 1
rec[R] -= 1
rec[R+1] += 1
if rec[L-1] > N//2:
res.add(L-1)
if rec[R+1] > N//2:
res.add(R+1)
A[j-1] -= 1
A[j+K-1] += 1
res = list(res)
res.sort()
return res
Analysis
Code: 06:26:21 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for k in range(K):
A[k] += 1
rec = [0]*(M+2)
for a in A:
rec[a] += 1
res = set()
for i in range(1, M+2):
if rec[i] > N//2:
res.add(i)
for j in range(1, N-K+1):
L, R = A[j-1], A[j+K-1]
rec[L] -= 1
rec[L-1] += 1
rec[R] -= 1
rec[R+1] += 1
if rec[L-1] > N//2:
res.add(L-1)
if rec[R+1] > N//2:
res.add(R+1)
A[j-1] -= 1
A[j+K-1] += 1
res = list(res)
res.sort()
return res
Analysis
Code: 06:26:24 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(K, M, A):
N = len(A)
for k in range(K):
A[k] += 1
rec = [0]*(M+2)
for a in A:
rec[a] += 1
res = set()
for i in range(1, M+2):
if rec[i] > N//2:
res.add(i)
for j in range(1, N-K+1):
L, R = A[j-1], A[j+K-1]
rec[L] -= 1
rec[L-1] += 1
rec[R] -= 1
rec[R+1] += 1
if rec[L-1] > N//2:
res.add(L-1)
if rec[R+1] > N//2:
res.add(R+1)
A[j-1] -= 1
A[j+K-1] += 1
res = list(res)
res.sort()
return res
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(M)
expand all
Correctness tests
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
5.
0.044 s
OK
6.
0.044 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
1.
0.036 s
OK
2.
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
expand all
Performance tests
1.
0.056 s
OK
2.
0.060 s
OK
3.
0.056 s
OK
1.
0.084 s
OK
2.
0.068 s
OK
3.
0.076 s
OK
1.
0.268 s
OK
2.
0.280 s
OK
3.
0.264 s
OK
1.
0.156 s
OK
2.
0.200 s
OK