Tasks Details
medium
Find the minimal nucleotide from a range of sequence DNA.
Task Score
62%
Correctness
60%
Performance
66%
A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is the minimal impact factor of nucleotides contained in a particular part of the given DNA sequence?
The DNA sequence is given as a non-empty string S = S[0]S[1]...S[N-1] consisting of N characters. There are M queries, which are given in non-empty arrays P and Q, each consisting of M integers. The K-th query (0 ≤ K < M) requires you to find the minimal impact factor of nucleotides contained in the DNA sequence between positions P[K] and Q[K] (inclusive).
For example, consider string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6The answers to these M = 3 queries are as follows:
- The part of the DNA between positions 2 and 4 contains nucleotides G and C (twice), whose impact factors are 3 and 2 respectively, so the answer is 2.
- The part between positions 5 and 5 contains a single nucleotide T, whose impact factor is 4, so the answer is 4.
- The part between positions 0 and 6 (the whole string) contains all nucleotides, in particular nucleotide A whose impact factor is 1, so the answer is 1.
Write a function:
def solution(S, P, Q)
that, given a non-empty string S consisting of N characters and two non-empty arrays P and Q consisting of M integers, returns an array consisting of M integers specifying the consecutive answers to all queries.
Result array should be returned as an array of integers.
For example, given the string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6the function should return the values [2, 4, 1], as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- M is an integer within the range [1..50,000];
- each element of arrays P and Q is an integer within the range [0..N - 1];
- P[K] ≤ Q[K], where 0 ≤ K < M;
- string S consists only of upper-case English letters A, C, G, T.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 85 minutes
Notes
not defined yet
Code: 08:13:27 UTC,
java,
autosave
Code: 09:07:51 UTC,
py,
autosave
Code: 09:08:21 UTC,
py,
autosave
Code: 09:08:38 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(S, P, Q):
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
ip = {'A':1, 'C':2, 'G':3, 'T':4}
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
Code: 09:08:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
ip = {'A':1, 'C':2, 'G':3, 'T':4}
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append()
Code: 09:09:35 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
ip = {'A':1, 'C':2, 'G':3, 'T':4}
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append()
Code: 09:10:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def findmin():
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
ip = {'A':1, 'C':2, 'G':3, 'T':4}
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append()
Code: 09:10:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin():
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append()
Code: 09:10:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin():
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(start, end))
Code: 09:10:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(s, e):
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(start, end))
Code: 09:11:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(s, e):
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start], end))
Code: 09:11:33 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(s, e):
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:11:50 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:12:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:12:20 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:12:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:13:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
mydict.keys()[mydict.values().index(16)]
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:13:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
ip.keys()[ip.values().index(16)]
return ret
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:13:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
Code: 09:13:38 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 15, in solution
counter[idx][ip[c]] += 1
IndexError: list index out of range
Code: 09:13:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:14:01 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] * N]
print(counter)
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 15, in solution
counter[idx][ip[c]] += 1
IndexError: list index out of range
stdout:
[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]
Code: 09:14:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0]] * N
print(counter)
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:14:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
print(counter)
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:14:32 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
print(counter)
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 15, in solution
counter[idx][ip[c]] += 1
IndexError: list index out of range
stdout:
[[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]
Code: 09:15:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
print(counter)
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:15:20 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
print(counter)
for idx, c in enumerate(S):
print(idx, c, ip[c])
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 16, in solution
counter[idx][ip[c]] += 1
IndexError: list index out of range
stdout:
[[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] 0 C 2 1 A 1 2 G 3 3 C 2 4 C 2 5 T 4
Code: 09:16:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
print(counter)
for idx, c in enumerate(S):
print(cou)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:16:34 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
print(counter)
for idx, c in enumerate(S):
print(counter)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:16:42 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
print(counter)
for idx, c in enumerate(S):
print(counter)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 16, in solution
counter[idx][ip[c]] += 1
IndexError: list index out of range
stdout:
[[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] [[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] [[0, 0, 1, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] [[0, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] [[0, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 1], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] [[0, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]] [[0, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0], [0, 0, 1, 0], [0, 0, 0, 0], [0, 0, 0, 0]]
Code: 09:17:04 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [0,0,0,0]
print(counter)
for idx, c in enumerate(S):
print(counter)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:17:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [0,0,0,0]
for idx, c in enumerate(S):
print(counter)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:17:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [0,0,0,0]
for idx, c in enumerate(S):
print(counter)
counter[ip[c]-1] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:17:44 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [0,0,0,0]
for idx, c in enumerate(S):
print(counter)
counter[ip[c]-1] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 20, in solution
ret.append(findmin(counter[start] - counter[end]))
IndexError: list index out of range
stdout:
[0, 0, 0, 0] [0, 1, 0, 0] [1, 1, 0, 0] [1, 1, 1, 0] [1, 2, 1, 0] [1, 3, 1, 0] [1, 3, 1, 1]
Code: 09:18:34 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [0,0,0,0]
for idx, c in enumerate(S):
print(counter)
counter[ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:18:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]]
print(counter)
for idx, c in enumerate(S):
print(counter)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:18:54 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]]
for idx, c in enumerate(S):
print(counter)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:18:56 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]]
for idx, c in enumerate(S):
print(counter)
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 15, in solution
counter[idx][ip[c]] += 1
TypeError: 'int' object is not iterable
stdout:
[[[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]]
Code: 09:19:08 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:19:20 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]]
for idx, c in enumerate(S):
counter[idx][ip[c]] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 14, in solution
counter[idx][ip[c]] += 1
TypeError: 'int' object is not iterable
Code: 09:19:38 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]]
for idx, c in enumerate(S):
counter[idx][ip[c]-] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:19:40 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]]
for idx, c in enumerate(S):
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 14, in solution
counter[idx][ip[c]-1] += 1
TypeError: 'int' object is not iterable
Code: 09:20:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:20:16 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 18, in solution
ret.append(findmin(counter[start] - counter[end]))
TypeError: unsupported operand type(s) for -: 'list' and 'list'
stdout:
[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 1, 0], [0, 1, 0, 0], [0, 1, 0, 0], [0, 0, 0, 1], [1, 0, 0, 0]]
Code: 09:21:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
cop
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:21:18 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = counter[idx-1]
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:21:28 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = counter[idx-1]
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:22:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx+1] = counter[idx]
counter[idx+1][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:22:18 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = counter[idx-1]
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:22:21 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = counter[idx-1]
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 19, in solution
ret.append(findmin(counter[start] - counter[end]))
TypeError: unsupported operand type(s) for -: 'list' and 'list'
stdout:
[[2, 2, 1, 1], [2, 2, 1, 1], [2, 2, 1, 1], [2, 2, 1, 1], [2, 2, 1, 1], [2, 2, 1, 1], [2, 2, 1, 1]]
Code: 09:24:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = counter[idx-1]
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:24:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:24:16 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 20, in solution
ret.append(findmin(counter[start] - counter[end]))
TypeError: unsupported operand type(s) for -: 'list' and 'list'
stdout:
[[1, 0, 0, 0], [1, 0, 1, 0], [1, 1, 1, 0], [1, 2, 1, 0], [1, 2, 1, 1], [2, 2, 1, 1], [0, 0, 0, 0]]
Code: 09:25:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:25:40 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S[1:]):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:25:50 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 20, in solution
ret.append(findmin(counter[start] - counter[end]))
TypeError: unsupported operand type(s) for -: 'list' and 'list'
stdout:
[[0, 1, 0, 0], [1, 1, 0, 0], [1, 1, 1, 0], [1, 2, 1, 0], [1, 3, 1, 0], [1, 3, 1, 1], [2, 3, 1, 1]]
Code: 09:26:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
print
ret.append(findmin(counter[start] - counter[end]))
return ret
Code: 09:26:20 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
print(counter[start], counter[end])
ret.append(findmin(counter[start] - counter[end]))
return ret
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 155, in <module>
main()
File "exec.py", line 117, in main
result = solution( S, P, Q )
File "/tmp/solution.py", line 21, in solution
ret.append(findmin(counter[start] - counter[end]))
TypeError: unsupported operand type(s) for -: 'list' and 'list'
stdout:
[[0, 1, 0, 0], [1, 1, 0, 0], [1, 1, 1, 0], [1, 2, 1, 0], [1, 3, 1, 0], [1, 3, 1, 1], [2, 3, 1, 1]] [1, 1, 1, 0] [1, 3, 1, 0]
Code: 09:26:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
print(counter[start], counter[end])
ret.append(findmin(counter\))
return ret
Code: 09:27:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter, start, end))
return ret
Code: 09:27:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
ret.append(findmin(counter, start, end))
return ret
Code: 09:27:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
if
ret.append(findmin(counter, start, end))
return ret
Code: 09:28:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
if counter[start][i] - counter[end][i] > 0:
return i
ret.append(findmin(counter, start, end))
return ret
Code: 09:28:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
if counter[start][i] - counter[end][i] > 0:
return i+1
ret.append(findmin(counter, start, end))
return ret
Code: 09:28:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
if counter[start][i] - counter[end][i] > 0:
ret.append(i)
return ret
Code: 09:28:24 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
if counter[start][i] - counter[end][i] > 0:
ret.append(i)
return ret
Analysis
expand all
Example tests
1.
0.060 s
WRONG ANSWER,
got [] expected [2, 4, 1]
Code: 09:28:53 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(counter[start], counter[end])
if counter[start][i] - counter[end][i] > 0:
ret.append(i)
return ret
Code: 09:29:02 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(counter[start][i], counter[end][i])
if counter[start][i] - counter[end][i] > 0:
ret.append(i)
return ret
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got [] expected [2, 4, 1]
stdout:
1 1 1 3 1 1 0 0 1 1 3 3 1 1 1 1 0 2 1 3 0 1 0 1
Code: 09:29:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i)
return ret
Code: 09:29:25 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
# print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i)
return ret
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got [1, 0, 1, 2, 3] expected [2, 4, 1]
Code: 09:29:40 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
# print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i)
break
return ret
Analysis
expand all
Example tests
1.
0.040 s
WRONG ANSWER,
got [1, 0] expected [2, 4, 1]
Code: 09:30:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
pr
for i in range(4):
# print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i)
break
return ret
Code: 09:30:19 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
print(counter, start, end)
for i in range(4):
# print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i)
break
return ret
Code: 09:30:22 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
print(counter, start, end)
for i in range(4):
# print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i)
break
return ret
Analysis
expand all
Example tests
1.
0.040 s
WRONG ANSWER,
got [1, 0] expected [2, 4, 1]
stdout:
[[0, 1, 0, 0], [1, 1, 0, 0], [1, 1, 1, 0], [1, 2, 1, 0], [1, 3, 1, 0], [1, 3, 1, 1], [2, 3, 1, 1]] 2 4 [[0, 1, 0, 0], [1, 1, 0, 0], [1, 1, 1, 0], [1, 2, 1, 0], [1, 3, 1, 0], [1, 3, 1, 1], [2, 3, 1, 1]] 5 5 [[0, 1, 0, 0], [1, 1, 0, 0], [1, 1, 1, 0], [1, 2, 1, 0], [1, 3, 1, 0], [1, 3, 1, 1], [2, 3, 1, 1]] 0 6
Code: 09:30:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i)
break
return ret
Code: 09:30:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:30:51 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
expand all
Example tests
1.
0.040 s
WRONG ANSWER,
got [2, 1] expected [2, 4, 1]
stdout:
1 1 3 3 1 1 3 3 1 1 1 1 2 2
Code: 09:31:20 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:31:21 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
expand all
Example tests
1.
0.040 s
WRONG ANSWER,
got [2, 1] expected [2, 4, 1]
stdout:
0 1 1 0 3 3 1 1 1 1 3 3 1 1 1 1 1 1 2 2 2
Code: 09:33:08 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:33:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(4)
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:34:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append()
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:34:40 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(S[idx])
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:34:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(S[idx])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:34:57 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def findmin(arr):
for a in arr:
if a > 0:
return ip.keys()[ip.values().index(a)]
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(S[idx])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'str'> found.stdout:
0 1 1 0 3 3 2 2 2
Code: 09:35:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}\
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(S[idx])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:35:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(S[idx])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:36:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(ip[S[idx]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:36:11 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(ip[S[idx]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got [2, 1, 1] expected [2, 4, 1]
stdout:
0 1 1 0 3 3 2 2 2
Code: 09:36:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
print(S)
ret.append(ip[S[idx]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:36:52 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
print(idx, S[idx], ip[S[idx]])
ret.append(ip[S[idx]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got [2, 1, 1] expected [2, 4, 1]
stdout:
0 1 1 0 3 3 1 A 1 2 2 2
Code: 09:37:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
print(idx, S[idx], ip[S[idx]])
ret.append(ip[S[start]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:37:28 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
print(start, S[start], ip[S[start]])
ret.append(ip[S[start]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
Code: 09:37:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(ip[S[start]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Code: 09:37:39 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(ip[S[start]])
else:
for i in range(4):
print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
Code: 09:37:49 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(ip[S[start]])
else:
for i in range(4):
# print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
Code: 09:38:04 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(ip[S[start]])
else:
for i in range(4):
# print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return ret
Analysis
Code: 09:38:06 UTC,
py,
final,
score:
62
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
from copy import deepcopy
ip = {'A':1, 'C':2, 'G':3, 'T':4}
def solution(S, P, Q):
ret = []
N, M = len(S), len(P)
counter = [[0,0,0,0] for _ in range(N)]
for idx, c in enumerate(S):
counter[idx] = deepcopy(counter[idx-1])
counter[idx][ip[c]-1] += 1
# print(counter)
for idx in range(M):
start, end = P[idx], Q[idx]
if start == end:
ret.append(ip[S[start]])
else:
for i in range(4):
# print(idx, counter[end][i], counter[end][i])
if counter[end][i] - counter[start][i] > 0:
ret.append(i+1)
break
return retAnalysis summary
The following issues have been detected: wrong answers, timeout errors.
For example, for the input ('AC', [0, 0, 1], [0, 1, 1]) the solution returned a wrong answer (got [1, 2, 2] expected [1, 1, 2]).
Analysis
expand all
Correctness tests
1.
0.040 s
OK
2.
0.040 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
1.
0.036 s
WRONG ANSWER,
got [1, 2, 2] expected [1, 1, 2]
2.
0.040 s
WRONG ANSWER,
got [3, 4, 4] expected [3, 3, 4]
3.
0.040 s
OK
4.
0.036 s
OK
1.
0.036 s
WRONG ANSWER,
got [1, 3, 4, 4] expected [1, 3, 3, 4]
2.
0.036 s
OK
3.
0.036 s
WRONG ANSWER,
got [4, 1, 4, 4] expected [4, 1, 1, 4]
1.
0.040 s
OK
1.
0.040 s
OK
expand all
Performance tests
almost_all_same_letters
GGGGGG..??..GGGGGG..??..GGGGGG
GGGGGG..??..GGGGGG..??..GGGGGG
✘
TIMEOUT ERROR
running time: 0.744 sec., time limit: 0.432 sec.
running time: 0.744 sec., time limit: 0.432 sec.
1.
0.908 s
OK
2.
0.744 s
TIMEOUT ERROR,
running time: 0.744 sec., time limit: 0.432 sec.
1.
0.856 s
OK
1.
0.940 s
OK