Tasks Details
medium
Find the maximum number of towers with same color order that can be obtained from an initial group of tricolored towers if at most one swap of adjacent colors can be performed in every tower.
Task Score
54%
Correctness
100%
Performance
9%
There are N towers, each made of three single-colored blocks placed one on top of another. The colors of the towers' blocks are described in an array T made of N three-letter strings. String T[K] (for K within the range 0..N−1) describes the colors of the blocks from the bottom to the top of the K-th tower. Colors are represented by lowercase letters.
For each of the towers, we may − at most once − choose two adjacent blocks and swap them. For example, given T[K] = "abc", we may obtain "bac" by swapping the bottom two blocks or "acb" by swapping the top two blocks, or stick with "abc" by not making a swap at all. Our goal is to achieve the same order of colors (from the bottom to the top) in as many towers as possible.
What is the maximum number of towers with the same color order that we can obtain?
Write a function:
def solution(T)
that, given an array T consisting of N strings representing the towers' colors, returns the maximum number of towers that we can obtain with the same order of block colors.
Examples:
1. Given T = ["aab", "cab", "baa", "baa"], the function should return 3. We may create towers ["aba", "cab", "aba", "aba"] by swapping the top two blocks in tower number 0, the bottom two blocks in towers with numbers 2 and 3. This way, towers numbers 0, 2 and 3 will have the same order of colors.
2. Given T = ["zzz", "zbz", "zbz", "dgf"], the function should return 2. It is not necessary to perform any swaps to obtain the result.
3. Given T = ["abc", "cba", "cab", "bac", "bca"], the function should return 3.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..50,000];
- each string in array T consists only of lowercase letters (a−z);
- each string in array T is of length 3.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 33 minutes
Notes
not defined yet
Code: 07:33:58 UTC,
java,
autosave
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 70, in main
sol = __import__('solution')
File "/tmp/solution.py", line 6
for each n in T:
^
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 129, in <module>
main()
File "exec.py", line 70, in main
sol = __import__('solution')
File "/tmp/solution.py", line 6
for each n in T:
^
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 129, in <module>
main()
File "exec.py", line 70, in main
sol = __import__('solution')
File "/tmp/solution.py", line 6
for each n in T:
^
SyntaxError: invalid syntax
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 'NoneType'> found.stdout:
aab cab baa baa
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
zzz zbz zbz dgf
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
abc cba cab bac bca
Code: 07:47:42 UTC,
py,
autosave
Code: 07:47:58 UTC,
py,
autosave
Code: 07:47:58 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 9, in solution
a[0] = n.count(x[0])
NameError: name 'a' is not defined
stdout:
aab
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 9, in solution
a[0] = n.count(x[0])
NameError: name 'a' is not defined
stdout:
zzz
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 9, in solution
a[0] = n.count(x[0])
NameError: name 'a' is not defined
stdout:
abc
Code: 07:48:21 UTC,
py,
autosave
Code: 07:48:31 UTC,
py,
autosave
Code: 07:49:02 UTC,
py,
autosave
Code: 07:49:04 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[0] = n.count(x[0])
TypeError: 'str' object does not support item assignment
stdout:
aab
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[0] = n.count(x[0])
TypeError: 'str' object does not support item assignment
stdout:
zzz
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[0] = n.count(x[0])
TypeError: 'str' object does not support item assignment
stdout:
abc
Code: 07:49:52 UTC,
py,
autosave
Code: 07:49:59 UTC,
py,
verify,
result: Failed
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 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[0] = n.count(x[0])
IndexError: list assignment index out of range
stdout:
aab
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[0] = n.count(x[0])
IndexError: list assignment index out of range
stdout:
zzz
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[0] = n.count(x[0])
IndexError: list assignment index out of range
stdout:
abc
Code: 07:50:46 UTC,
py,
autosave
Code: 07:50:52 UTC,
py,
verify,
result: Failed
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 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[1] = n.count(x[0])
IndexError: list assignment index out of range
stdout:
aab
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[1] = n.count(x[0])
IndexError: list assignment index out of range
stdout:
zzz
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[1] = n.count(x[0])
IndexError: list assignment index out of range
stdout:
abc
Code: 07:51:05 UTC,
py,
verify,
result: Failed
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 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[1] = n.count(x[1])
IndexError: string index out of range
stdout:
aab
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[1] = n.count(x[1])
IndexError: string index out of range
stdout:
zzz
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
a[1] = n.count(x[1])
IndexError: string index out of range
stdout:
abc
Code: 07:51:46 UTC,
py,
autosave
Code: 07:51:58 UTC,
py,
autosave
Code: 07:52:10 UTC,
py,
autosave
Code: 07:52:40 UTC,
py,
autosave
Code: 07:52:50 UTC,
py,
autosave
Code: 07:52:58 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 9, in solution
a[0] = n.count(n[0])
IndexError: list assignment index out of range
stdout:
aab
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 9, in solution
a[0] = n.count(n[0])
IndexError: list assignment index out of range
stdout:
zzz
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 9, in solution
a[0] = n.count(n[0])
IndexError: list assignment index out of range
stdout:
abc
Code: 07:54:29 UTC,
py,
autosave
Code: 07:54:39 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
aab [2, 2, 1] cab [1, 1, 1] baa [1, 2, 2] baa [1, 2, 2]
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
zzz [3, 3, 3] zbz [2, 1, 2] zbz [2, 1, 2] dgf [1, 1, 1]
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
abc [1, 1, 1] cba [1, 1, 1] cab [1, 1, 1] bac [1, 1, 1] bca [1, 1, 1]
Code: 07:56:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 07:57:08 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 07:58:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 07:58:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 07:58:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 07:59:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:00:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
cou
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:00:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:01:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum(1 for )
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:01:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if )
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:01:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:01:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans =
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:02:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
print(n)
a[0] = n.count(n[0])
a[1] = n.count(n[1])
a[2] = n.count(n[2])
print(a)
pass
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:02:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:02:38 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
a = [0,0,0]
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
ans = max(ans,ct)
UnboundLocalError: local variable 'ans' referenced before assignment
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
ans = max(ans,ct)
UnboundLocalError: local variable 'ans' referenced before assignment
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( T )
File "/tmp/solution.py", line 10, in solution
ans = max(ans,ct)
UnboundLocalError: local variable 'ans' referenced before assignment
Code: 08:03:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:03:05 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans = 0
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Analysis
Code: 08:04:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans = 0
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:04:40 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans = 0
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
print(ans)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Analysis
Code: 08:05:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans = 0
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
# print(ans)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Code: 08:05:53 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans = 0
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
# print(ans)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Analysis
Code: 08:06:03 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans = 0
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
# print(ans)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }
Analysis
Code: 08:06:05 UTC,
py,
final,
score:
54
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(T):
# write your code in Python 3.6
ans = 0
for n in T:
for x in swaps(n):
ct = sum(1 for s in T if x in swaps(s))
ans = max(ans,ct)
# print(ans)
return ans
def swaps(t):
return { t, t[1]+t[0]+t[2], t[0]+t[2]+t[1] }Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N * A**3)
Time complexity parameters:
A - size of the alphabet
A - size of the alphabet
expand all
Correctness tests
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
3.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
5.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
expand all
Correctness/performance tests
1.
0.060 s
OK
2.
0.088 s
OK
3.
0.088 s
OK
expand all
Performance tests
big_two_colors
The towers are made of at most two different colors.
The towers are made of at most two different colors.
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
4.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
big_same_colors
All towers consist of the same color set.
All towers consist of the same color set.
✘
TIMEOUT ERROR
Killed. Hard limit reached: 7.000 sec.
Killed. Hard limit reached: 7.000 sec.
1.
7.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 7.000 sec.
2.
7.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 7.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
4.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
1.
7.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 7.000 sec.
2.
7.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 7.000 sec.
3.
7.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 7.000 sec.