Tasks Details
medium
1.
PrettyTiling
Given a sequence of squares, find the minimum number of rotations needed to obtain a pretty sequence.
Task Score
100%
Correctness
100%
Performance
100%
Tom is decorating the pavement in his garden with N square tiles. Each tile is divided into four triangles of different colors (white - 'W', red - 'R', green - 'G' and blue - 'B'). A tile is described as a string of four characters denoting respectively, the color of the upper, right, bottom and left triangle. For example, the tile in the figure below is described as "WRGB".
Tom arranged the tiles in a row and decided to rotate some of them to obtain a pretty sequence. He considers a sequence of tiles pretty if each pair of adjacent tiles shares one side of the same color.
Write a function:
def solution(A)
that, given an array A of N strings, representing the sequence of tiles, returns the minimum number of 90-degree rotations (clockwise or counter-clockwise) that Tom has to perform.
Examples:
1. Given A = ["RGBW", "GBRW"], the function should return 1.
Tom can rotate the second tile counter-clockwise once to obtain a pretty sequence.
2. Given A = ["WBGR", "WBGR", "WRGB", "WRGB", "RBGW"], the function should return 4.
Tom can obtain a pretty sequence by rotating the first and third tiles counter-clockwise and the second and fourth tiles clockwise.
3. Given A = ["RBGW", "GBRW", "RWGB", "GBRW"], the function should return 2.
Tom can rotate the first tile clockwise twice to obtain a pretty sequence.
4. Given A = ["GBRW", "RBGW", "BWGR", "BRGW"], the function should return 2.
Tom can rotate the first two tiles clockwise to obtain a pretty sequence.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- string representing a tile has 4 letters (exactly one occurrence of 'R', 'G', 'B' and 'W').
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 56 minutes
Notes
not defined yet
Code: 05:07:50 UTC,
java,
autosave
Code: 05:14:46 UTC,
py,
autosave
Code: 05:15:01 UTC,
py,
autosave
Code: 05:16:03 UTC,
py,
autosave
Code: 05:16:14 UTC,
py,
autosave
Code: 05:16:25 UTC,
py,
autosave
Code: 05:16:48 UTC,
py,
autosave
Code: 05:16:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
Code: 05:17:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
rotate(A[i])
Code: 05:17:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
rotate(A[i],)
Code: 05:17:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif:
rotate(A[i],1)
Code: 05:17:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
Code: 05:18:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:18:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:19:03 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:19:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
Code: 05:20:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
elif ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:20:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
continue
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:20:41 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:20:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j), A[i+1]):
cnt+=1
break
elif ispretty(A[i], A[i+1]):
cnt+=1
continue
Code: 05:21:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], A[i+1]):
cnt+=2
continue
Code: 05:21:38 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], (A[i+1])):
cnt+=2
continue
Code: 05:21:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=2
continue
Code: 05:22:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:25:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:25:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:25:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(rotate(A[i],j+1), A[i+1]):
cnt+=1
break
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:26:19 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
elif ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:26:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=1
continue
Code: 05:27:36 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
cnt+=()
continue
Code: 05:28:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt
continue
Code: 05:28:20 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
continue
Code: 05:28:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:28:52 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:29:16 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
cnt=0
for i in range(4):
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:29:26 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
cnt=0
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
Code: 05:29:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
cnt=0
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
Code: 05:29:56 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
Code: 05:30:07 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Analysis
expand all
Example tests
1.
0.016 s
WRONG ANSWER,
got 2 expected 1
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
1.
0.016 s
OK
1.
0.016 s
WRONG ANSWER,
got 3 expected 2
Code: 05:30:28 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:30:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:30:55 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:30:55 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Analysis
expand all
Example tests
1.
0.016 s
WRONG ANSWER,
got 3 expected 1
1.
0.016 s
WRONG ANSWER,
got 6 expected 4
1.
0.028 s
WRONG ANSWER,
got 3 expected 2
1.
0.028 s
WRONG ANSWER,
got 4 expected 2
Code: 05:31:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return max(answer)
Code: 05:31:28 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return max(answer)
Analysis
expand all
Example tests
1.
0.016 s
WRONG ANSWER,
got 3 expected 1
stdout:
[1, 3, 3, 3]
1.
0.016 s
WRONG ANSWER,
got 6 expected 4
stdout:
[5, 5, 6, 6]
1.
0.016 s
WRONG ANSWER,
got 3 expected 2
stdout:
[2, 2, 3, 3]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
[3, 3, 4, 4]
Code: 05:31:37 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
[1, 3, 3, 3]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
[5, 5, 6, 6]
1.
0.016 s
OK
stdout:
[2, 2, 3, 3]
1.
0.016 s
WRONG ANSWER,
got 3 expected 2
stdout:
[3, 3, 4, 4]
Code: 05:31:55 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:32:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
if i==3
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:32:21 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
[1, 3, 3, 1]
1.
0.016 s
OK
stdout:
[5, 5, 6, 4]
1.
0.016 s
WRONG ANSWER,
got 1 expected 2
stdout:
[2, 2, 3, 1]
1.
0.016 s
OK
stdout:
[3, 3, 4, 2]
Code: 05:33:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:33:42 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
RGBW GBWR WRGB BWRG [1, 3, 3, 1]
1.
0.016 s
OK
stdout:
WBGR BGRW RWBG GRWB [5, 5, 6, 4]
1.
0.016 s
WRONG ANSWER,
got 1 expected 2
stdout:
RBGW BGWR WRBG GWRB [2, 2, 3, 1]
1.
0.016 s
OK
stdout:
GBRW BRWG WGBR RWGB [3, 3, 4, 2]
Code: 05:36:08 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(A[0],i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(initA,i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:33 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(initA,i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
WRONG ANSWER,
got 0 expected 1
stdout:
['RGBW', 'GBRW'] ['GBRW', 'RGBW'] ['RGBW', 'GBRW'] ['RGBW', 'GBRW'] [0, 1, 2, 1]
1.
0.016 s
WRONG ANSWER,
got 3 expected 4
stdout:
['WBGR', 'WBGR', 'WRGB', 'WRGB', 'RBGW'] ['WBGR', 'WRGB', 'WRGB', 'RBGW', 'WBGR'] ['WRGB', 'WRGB', 'RBGW', 'WBGR', 'WBGR'] ['WRGB', 'RBGW', 'WBGR', 'WBGR', 'WRGB'] [3, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 0 expected 2
stdout:
['RBGW', 'GBRW', 'RWGB', 'GBRW'] ['GBRW', 'RWGB', 'GBRW', 'RBGW'] ['RWGB', 'GBRW', 'RBGW', 'GBRW'] ['GBRW', 'RBGW', 'GBRW', 'RWGB'] [0, 1, 2, 1]
1.
0.016 s
WRONG ANSWER,
got 1 expected 2
stdout:
['GBRW', 'RBGW', 'BWGR', 'BRGW'] ['RBGW', 'BWGR', 'BRGW', 'GBRW'] ['BWGR', 'BRGW', 'GBRW', 'RBGW'] ['BRGW', 'GBRW', 'RBGW', 'BWGR'] [1, 2, 3, 2]
Code: 05:36:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[:]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:36:54 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0:1]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 115, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/exec_user_poagiv62/solution.py", line 25, in solution
if ispretty(A[i], A[i+1]):
File "/tmp/exec_user_poagiv62/solution.py", line 8, in ispretty
return True if s1[1] == s2[3] else False
IndexError: list index out of range
stdout:
['RGBW']
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 115, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/exec_user_poagiv62/solution.py", line 25, in solution
if ispretty(A[i], A[i+1]):
File "/tmp/exec_user_poagiv62/solution.py", line 8, in ispretty
return True if s1[1] == s2[3] else False
IndexError: list index out of range
stdout:
['WBGR']
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 115, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/exec_user_poagiv62/solution.py", line 25, in solution
if ispretty(A[i], A[i+1]):
File "/tmp/exec_user_poagiv62/solution.py", line 8, in ispretty
return True if s1[1] == s2[3] else False
IndexError: list index out of range
stdout:
['RBGW']
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 115, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/exec_user_poagiv62/solution.py", line 25, in solution
if ispretty(A[i], A[i+1]):
File "/tmp/exec_user_poagiv62/solution.py", line 8, in ispretty
return True if s1[1] == s2[3] else False
IndexError: list index out of range
stdout:
['GBRW']
Code: 05:37:19 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
print()
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:37:32 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
print(initA, end=':')
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
RGBW:RGBW GBWR BWRG WRGB [1, 3, 2, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
WBGR:WBGR BGRW GRWB RWBG [5, 5, 5, 5]
1.
0.020 s
OK
stdout:
RBGW:RBGW BGWR GWRB WRBG [2, 2, 2, 2]
1.
0.016 s
WRONG ANSWER,
got 3 expected 2
stdout:
GBRW:GBRW BRWG RWGB WGBR [3, 3, 3, 3]
Code: 05:37:52 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:38:01 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
print(initA, end=':')
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.020 s
OK
stdout:
RGBW:RGBW RGBW:GBWR RGBW:BWRG RGBW:WRGB [1, 3, 2, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
WBGR:WBGR WBGR:BGRW WBGR:GRWB WBGR:RWBG [5, 5, 5, 5]
1.
0.020 s
OK
stdout:
RBGW:RBGW RBGW:BGWR RBGW:GWRB RBGW:WRBG [2, 2, 2, 2]
1.
0.016 s
WRONG ANSWER,
got 3 expected 2
stdout:
GBRW:GBRW GBRW:BRWG GBRW:RWGB GBRW:WGBR [3, 3, 3, 3]
Code: 05:38:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
print(A[0])
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:38:28 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
[1, 3, 2, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
[5, 5, 5, 5]
1.
0.016 s
OK
stdout:
[2, 2, 2, 2]
1.
0.016 s
WRONG ANSWER,
got 3 expected 2
stdout:
[3, 3, 3, 3]
Code: 05:40:05 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:40:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] =
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:40:29 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
[1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
[5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
[6, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
[6, 4, 7, 4]
Code: 05:45:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
pri
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:45:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(j,"번째")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:45:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i,"번째", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:46:04 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,"번째", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
1 ?? 1 ?? 1 ?? 1 ?? 1 ?? 2 ?? 1 ?? 3 ?? [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
1 ?? 2 ?? 2 ?? 2 ?? 4 ?? 1 ?? 1 ?? 1 ?? 2 ?? 3 ?? 3 ?? 3 ?? 4 ?? 3 ?? 1 ?? 1 ?? 2 ?? 3 ?? 3 ?? 3 ?? 4 ?? 2 ?? 1 ?? 1 ?? 2 ?? 3 ?? 3 ?? 3 ?? 4 ?? 1 ?? [5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
1 ?? 2 ?? 2 ?? 2 ?? 3 ?? 2 ?? 1 ?? 3 ?? 2 ?? 3 ?? 3 ?? 3 ?? 1 ?? 3 ?? 2 ?? 3 ?? 3 ?? 3 ?? 1 ?? 3 ?? 2 ?? 3 ?? 3 ?? 3 ?? [6, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
1 ?? 2 ?? 2 ?? 2 ?? 3 ?? 2 ?? 1 ?? 3 ?? 2 ?? 1 ?? 3 ?? 3 ?? 1 ?? 3 ?? 2 ?? 2 ?? 3 ?? 2 ?? 1 ?? 3 ?? 2 ?? 3 ?? 3 ?? 1 ?? [6, 4, 7, 4]
Code: 05:46:15 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,"", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:46:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "돌림")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:46:50 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for i in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.020 s
OK
stdout:
1 : 1 rotate 1 : 1 rotate 1 : 2 rotate 1 : 3 rotate [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
1 : 2 rotate 2 : 2 rotate 4 : 1 rotate 1 : 1 rotate 2 : 3 rotate 3 : 3 rotate 4 : 3 rotate 1 : 1 rotate 2 : 3 rotate 3 : 3 rotate 4 : 2 rotate 1 : 1 rotate 2 : 3 rotate 3 : 3 rotate 4 : 1 rotate [5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
1 : 2 rotate 2 : 2 rotate 3 : 2 rotate 1 : 3 rotate 2 : 3 rotate 3 : 3 rotate 1 : 3 rotate 2 : 3 rotate 3 : 3 rotate 1 : 3 rotate 2 : 3 rotate 3 : 3 rotate [6, 4, 5, 4]
1.
0.020 s
WRONG ANSWER,
got 4 expected 2
stdout:
1 : 2 rotate 2 : 2 rotate 3 : 2 rotate 1 : 3 rotate 2 : 1 rotate 3 : 3 rotate 1 : 3 rotate 2 : 2 rotate 3 : 2 rotate 1 : 3 rotate 2 : 3 rotate 3 : 1 rotate [6, 4, 7, 4]
Code: 05:47:23 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, i)
if i==3:
cnt+=1
else:
cnt+=i
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:47:35 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:47:37 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
1 : 1 rotate 1 : 1 rotate 1 : 2 rotate 1 : 3 rotate [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
1 : 2 rotate 2 : 2 rotate 4 : 1 rotate 1 : 1 rotate 2 : 3 rotate 3 : 3 rotate 4 : 3 rotate 1 : 1 rotate 2 : 3 rotate 3 : 3 rotate 4 : 2 rotate 1 : 1 rotate 2 : 3 rotate 3 : 3 rotate 4 : 1 rotate [5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
1 : 2 rotate 2 : 2 rotate 3 : 2 rotate 1 : 3 rotate 2 : 3 rotate 3 : 3 rotate 1 : 3 rotate 2 : 3 rotate 3 : 3 rotate 1 : 3 rotate 2 : 3 rotate 3 : 3 rotate [6, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
1 : 2 rotate 2 : 2 rotate 3 : 2 rotate 1 : 3 rotate 2 : 1 rotate 3 : 3 rotate 1 : 3 rotate 2 : 2 rotate 3 : 2 rotate 1 : 3 rotate 2 : 3 rotate 3 : 1 rotate [6, 4, 7, 4]
Code: 05:48:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(ri+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:48:19 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
0 , 1 : 1 rotate 1 , 1 : 1 rotate 2 , 1 : 2 rotate 3 , 1 : 3 rotate [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
0 , 1 : 2 rotate 0 , 2 : 2 rotate 0 , 4 : 1 rotate 1 , 1 : 1 rotate 1 , 2 : 3 rotate 1 , 3 : 3 rotate 1 , 4 : 3 rotate 2 , 1 : 1 rotate 2 , 2 : 3 rotate 2 , 3 : 3 rotate 2 , 4 : 2 rotate 3 , 1 : 1 rotate 3 , 2 : 3 rotate 3 , 3 : 3 rotate 3 , 4 : 1 rotate [5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 , 1 : 2 rotate 0 , 2 : 2 rotate 0 , 3 : 2 rotate 1 , 1 : 3 rotate 1 , 2 : 3 rotate 1 , 3 : 3 rotate 2 , 1 : 3 rotate 2 , 2 : 3 rotate 2 , 3 : 3 rotate 3 , 1 : 3 rotate 3 , 2 : 3 rotate 3 , 3 : 3 rotate [6, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 , 1 : 2 rotate 0 , 2 : 2 rotate 0 , 3 : 2 rotate 1 , 1 : 3 rotate 1 , 2 : 1 rotate 1 , 3 : 3 rotate 2 , 1 : 3 rotate 2 , 2 : 2 rotate 2 , 3 : 2 rotate 3 , 1 : 3 rotate 3 , 2 : 3 rotate 3 , 3 : 1 rotate [6, 4, 7, 4]
Code: 05:48:40 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
0 0 , 1 : 1 rotate 0 1 , 1 : 1 rotate 0 2 , 1 : 2 rotate 0 3 , 1 : 3 rotate [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
0 0 , 1 : 2 rotate 0 0 , 2 : 2 rotate 0 0 , 4 : 1 rotate 0 1 , 1 : 1 rotate 0 1 , 2 : 3 rotate 0 1 , 3 : 3 rotate 0 1 , 4 : 3 rotate 0 2 , 1 : 1 rotate 0 2 , 2 : 3 rotate 0 2 , 3 : 3 rotate 0 2 , 4 : 2 rotate 0 3 , 1 : 1 rotate 0 3 , 2 : 3 rotate 0 3 , 3 : 3 rotate 0 3 , 4 : 1 rotate [5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate 0 0 , 2 : 2 rotate 0 0 , 3 : 2 rotate 0 1 , 1 : 3 rotate 0 1 , 2 : 3 rotate 0 1 , 3 : 3 rotate 0 2 , 1 : 3 rotate 0 2 , 2 : 3 rotate 0 2 , 3 : 3 rotate 0 3 , 1 : 3 rotate 0 3 , 2 : 3 rotate 0 3 , 3 : 3 rotate [6, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate 0 0 , 2 : 2 rotate 0 0 , 3 : 2 rotate 0 1 , 1 : 3 rotate 0 1 , 2 : 1 rotate 0 1 , 3 : 3 rotate 0 2 , 1 : 3 rotate 0 2 , 2 : 2 rotate 0 2 , 3 : 2 rotate 0 3 , 1 : 3 rotate 0 3 , 2 : 3 rotate 0 3 , 3 : 1 rotate [6, 4, 7, 4]
Code: 05:49:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:50:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:50:53 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate")
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.020 s
OK
stdout:
0 0 , 1 : 1 rotate 0 1 , 1 : 1 rotate 0 2 , 1 : 2 rotate 0 3 , 1 : 3 rotate [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
0 0 , 1 : 2 rotate 0 0 , 2 : 2 rotate 0 0 , 4 : 1 rotate 0 1 , 1 : 1 rotate 0 1 , 2 : 3 rotate 0 1 , 3 : 3 rotate 0 1 , 4 : 3 rotate 0 2 , 1 : 1 rotate 0 2 , 2 : 3 rotate 0 2 , 3 : 3 rotate 0 2 , 4 : 2 rotate 0 3 , 1 : 1 rotate 0 3 , 2 : 3 rotate 0 3 , 3 : 3 rotate 0 3 , 4 : 1 rotate [5, 5, 7, 5]
1.
0.020 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate 0 0 , 2 : 2 rotate 0 0 , 3 : 2 rotate 0 1 , 1 : 3 rotate 0 1 , 2 : 3 rotate 0 1 , 3 : 3 rotate 0 2 , 1 : 3 rotate 0 2 , 2 : 3 rotate 0 2 , 3 : 3 rotate 0 3 , 1 : 3 rotate 0 3 , 2 : 3 rotate 0 3 , 3 : 3 rotate [6, 4, 5, 4]
1.
0.020 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate 0 0 , 2 : 2 rotate 0 0 , 3 : 2 rotate 0 1 , 1 : 3 rotate 0 1 , 2 : 1 rotate 0 1 , 3 : 3 rotate 0 2 , 1 : 3 rotate 0 2 , 2 : 2 rotate 0 2 , 3 : 2 rotate 0 3 , 1 : 3 rotate 0 3 , 2 : 3 rotate 0 3 , 3 : 1 rotate [6, 4, 7, 4]
Code: 05:56:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate",)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:56:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A[i], A)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:56:38 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A[i], rotate(A[i+1],j+1))
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
0 0 , 1 : 1 rotate RGBW BRWG 0 1 , 1 : 1 rotate GBWR RWGB 0 2 , 1 : 2 rotate BWRG GBRW 0 3 , 1 : 3 rotate WRGB WGBR [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
0 0 , 1 : 2 rotate WBGR GRWB 0 0 , 2 : 2 rotate GRWB GBWR 0 0 , 4 : 1 rotate WRGB BGWR 0 1 , 1 : 1 rotate BGRW RWBG 0 1 , 2 : 3 rotate RWBG RGBW 0 1 , 3 : 3 rotate RGBW BWRG 0 1 , 4 : 3 rotate BWRG RBGW 0 2 , 1 : 1 rotate GRWB WBGR 0 2 , 2 : 3 rotate WBGR WRGB 0 2 , 3 : 3 rotate WRGB GBWR 0 2 , 4 : 2 rotate GBWR GWRB 0 3 , 1 : 1 rotate RWBG BGRW 0 3 , 2 : 3 rotate BGRW BWRG 0 3 , 3 : 3 rotate BWRG RGBW 0 3 , 4 : 1 rotate RGBW WRBG [5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate RBGW RWGB 0 0 , 2 : 2 rotate RWGB GBRW 0 0 , 3 : 2 rotate GBRW RWGB 0 1 , 1 : 3 rotate BGWR BRWG 0 1 , 2 : 3 rotate BRWG WGBR 0 1 , 3 : 3 rotate WGBR BRWG 0 2 , 1 : 3 rotate GWRB GBRW 0 2 , 2 : 3 rotate GBRW RWGB 0 2 , 3 : 3 rotate RWGB GBRW 0 3 , 1 : 3 rotate WRBG WGBR 0 3 , 2 : 3 rotate WGBR BRWG 0 3 , 3 : 3 rotate BRWG WGBR [6, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate GBRW GWRB 0 0 , 2 : 2 rotate GWRB GRBW 0 0 , 3 : 2 rotate GRBW GWBR 0 1 , 1 : 3 rotate BRWG BGWR 0 1 , 2 : 1 rotate BGWR RBWG 0 1 , 3 : 3 rotate RBWG RGWB 0 2 , 1 : 3 rotate RWGB RBGW 0 2 , 2 : 2 rotate RBGW WGRB 0 2 , 3 : 2 rotate WGRB WBRG 0 3 , 1 : 3 rotate WGBR WRBG 0 3 , 2 : 3 rotate WRBG BWGR 0 3 , 3 : 1 rotate BWGR BRGW [6, 4, 7, 4]
Code: 05:57:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:57:08 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
A[i+1] = rotate(A[i+1],j+1)
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
0 0 , 1 : 1 rotate ['RGBW', 'GBRW'] 0 1 , 1 : 1 rotate ['GBWR', 'BRWG'] 0 2 , 1 : 2 rotate ['BWRG', 'RWGB'] 0 3 , 1 : 3 rotate ['WRGB', 'GBRW'] [1, 2, 4, 2]
1.
0.016 s
WRONG ANSWER,
got 5 expected 4
stdout:
0 0 , 1 : 2 rotate ['WBGR', 'WBGR', 'WRGB', 'WRGB', 'RBGW'] 0 0 , 2 : 2 rotate ['WBGR', 'GRWB', 'WRGB', 'WRGB', 'RBGW'] 0 0 , 4 : 1 rotate ['WBGR', 'GRWB', 'GBWR', 'WRGB', 'RBGW'] 0 1 , 1 : 1 rotate ['BGRW', 'GRWB', 'GBWR', 'WRGB', 'BGWR'] 0 1 , 2 : 3 rotate ['BGRW', 'RWBG', 'GBWR', 'WRGB', 'BGWR'] 0 1 , 3 : 3 rotate ['BGRW', 'RWBG', 'RGBW', 'WRGB', 'BGWR'] 0 1 , 4 : 3 rotate ['BGRW', 'RWBG', 'RGBW', 'BWRG', 'BGWR'] 0 2 , 1 : 1 rotate ['GRWB', 'RWBG', 'RGBW', 'BWRG', 'RBGW'] 0 2 , 2 : 3 rotate ['GRWB', 'WBGR', 'RGBW', 'BWRG', 'RBGW'] 0 2 , 3 : 3 rotate ['GRWB', 'WBGR', 'WRGB', 'BWRG', 'RBGW'] 0 2 , 4 : 2 rotate ['GRWB', 'WBGR', 'WRGB', 'GBWR', 'RBGW'] 0 3 , 1 : 1 rotate ['RWBG', 'WBGR', 'WRGB', 'GBWR', 'GWRB'] 0 3 , 2 : 3 rotate ['RWBG', 'BGRW', 'WRGB', 'GBWR', 'GWRB'] 0 3 , 3 : 3 rotate ['RWBG', 'BGRW', 'BWRG', 'GBWR', 'GWRB'] 0 3 , 4 : 1 rotate ['RWBG', 'BGRW', 'BWRG', 'RGBW', 'GWRB'] [5, 5, 7, 5]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate ['RBGW', 'GBRW', 'RWGB', 'GBRW'] 0 0 , 2 : 2 rotate ['RBGW', 'RWGB', 'RWGB', 'GBRW'] 0 0 , 3 : 2 rotate ['RBGW', 'RWGB', 'GBRW', 'GBRW'] 0 1 , 1 : 3 rotate ['BGWR', 'RWGB', 'GBRW', 'RWGB'] 0 1 , 2 : 3 rotate ['BGWR', 'BRWG', 'GBRW', 'RWGB'] 0 1 , 3 : 3 rotate ['BGWR', 'BRWG', 'WGBR', 'RWGB'] 0 2 , 1 : 3 rotate ['GWRB', 'BRWG', 'WGBR', 'BRWG'] 0 2 , 2 : 3 rotate ['GWRB', 'GBRW', 'WGBR', 'BRWG'] 0 2 , 3 : 3 rotate ['GWRB', 'GBRW', 'RWGB', 'BRWG'] 0 3 , 1 : 3 rotate ['WRBG', 'GBRW', 'RWGB', 'GBRW'] 0 3 , 2 : 3 rotate ['WRBG', 'WGBR', 'RWGB', 'GBRW'] 0 3 , 3 : 3 rotate ['WRBG', 'WGBR', 'BRWG', 'GBRW'] [6, 4, 5, 4]
1.
0.016 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate ['GBRW', 'RBGW', 'BWGR', 'BRGW'] 0 0 , 2 : 2 rotate ['GBRW', 'GWRB', 'BWGR', 'BRGW'] 0 0 , 3 : 2 rotate ['GBRW', 'GWRB', 'GRBW', 'BRGW'] 0 1 , 1 : 3 rotate ['BRWG', 'GWRB', 'GRBW', 'GWBR'] 0 1 , 2 : 1 rotate ['BRWG', 'BGWR', 'GRBW', 'GWBR'] 0 1 , 3 : 3 rotate ['BRWG', 'BGWR', 'RBWG', 'GWBR'] 0 2 , 1 : 3 rotate ['RWGB', 'BGWR', 'RBWG', 'RGWB'] 0 2 , 2 : 2 rotate ['RWGB', 'RBGW', 'RBWG', 'RGWB'] 0 2 , 3 : 2 rotate ['RWGB', 'RBGW', 'WGRB', 'RGWB'] 0 3 , 1 : 3 rotate ['WGBR', 'RBGW', 'WGRB', 'WBRG'] 0 3 , 2 : 3 rotate ['WGBR', 'WRBG', 'WGRB', 'WBRG'] 0 3 , 3 : 1 rotate ['WGBR', 'WRBG', 'BWGR', 'WBRG'] [6, 4, 7, 4]
Code: 05:58:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 05:59:03 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(A):
return
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
A[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(A)-1):
if ispretty(A[i], A[i+1]):
continue
else:
for j in range(3):
if ispretty(A[i], rotate(A[i+1],j+1)):
A[i+1] = rotate(A[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", A)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.020 s
OK
stdout:
0 0 , 1 : 1 rotate ['RGBW', 'BRWG'] 0 1 , 1 : 1 rotate ['GBWR', 'RWGB'] 0 2 , 1 : 2 rotate ['BWRG', 'GBRW'] 0 3 , 1 : 3 rotate ['WRGB', 'WGBR'] [1, 2, 4, 2]
1.
0.020 s
WRONG ANSWER,
got 5 expected 4
stdout:
0 0 , 1 : 2 rotate ['WBGR', 'GRWB', 'WRGB', 'WRGB', 'RBGW'] 0 0 , 2 : 2 rotate ['WBGR', 'GRWB', 'GBWR', 'WRGB', 'RBGW'] 0 0 , 4 : 1 rotate ['WBGR', 'GRWB', 'GBWR', 'WRGB', 'BGWR'] 0 1 , 1 : 1 rotate ['BGRW', 'RWBG', 'GBWR', 'WRGB', 'BGWR'] 0 1 , 2 : 3 rotate ['BGRW', 'RWBG', 'RGBW', 'WRGB', 'BGWR'] 0 1 , 3 : 3 rotate ['BGRW', 'RWBG', 'RGBW', 'BWRG', 'BGWR'] 0 1 , 4 : 3 rotate ['BGRW', 'RWBG', 'RGBW', 'BWRG', 'RBGW'] 0 2 , 1 : 1 rotate ['GRWB', 'WBGR', 'RGBW', 'BWRG', 'RBGW'] 0 2 , 2 : 3 rotate ['GRWB', 'WBGR', 'WRGB', 'BWRG', 'RBGW'] 0 2 , 3 : 3 rotate ['GRWB', 'WBGR', 'WRGB', 'GBWR', 'RBGW'] 0 2 , 4 : 2 rotate ['GRWB', 'WBGR', 'WRGB', 'GBWR', 'GWRB'] 0 3 , 1 : 1 rotate ['RWBG', 'BGRW', 'WRGB', 'GBWR', 'GWRB'] 0 3 , 2 : 3 rotate ['RWBG', 'BGRW', 'BWRG', 'GBWR', 'GWRB'] 0 3 , 3 : 3 rotate ['RWBG', 'BGRW', 'BWRG', 'RGBW', 'GWRB'] 0 3 , 4 : 1 rotate ['RWBG', 'BGRW', 'BWRG', 'RGBW', 'WRBG'] [5, 5, 7, 5]
1.
0.020 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate ['RBGW', 'RWGB', 'RWGB', 'GBRW'] 0 0 , 2 : 2 rotate ['RBGW', 'RWGB', 'GBRW', 'GBRW'] 0 0 , 3 : 2 rotate ['RBGW', 'RWGB', 'GBRW', 'RWGB'] 0 1 , 1 : 3 rotate ['BGWR', 'BRWG', 'GBRW', 'RWGB'] 0 1 , 2 : 3 rotate ['BGWR', 'BRWG', 'WGBR', 'RWGB'] 0 1 , 3 : 3 rotate ['BGWR', 'BRWG', 'WGBR', 'BRWG'] 0 2 , 1 : 3 rotate ['GWRB', 'GBRW', 'WGBR', 'BRWG'] 0 2 , 2 : 3 rotate ['GWRB', 'GBRW', 'RWGB', 'BRWG'] 0 2 , 3 : 3 rotate ['GWRB', 'GBRW', 'RWGB', 'GBRW'] 0 3 , 1 : 3 rotate ['WRBG', 'WGBR', 'RWGB', 'GBRW'] 0 3 , 2 : 3 rotate ['WRBG', 'WGBR', 'BRWG', 'GBRW'] 0 3 , 3 : 3 rotate ['WRBG', 'WGBR', 'BRWG', 'WGBR'] [6, 4, 5, 4]
1.
0.020 s
WRONG ANSWER,
got 4 expected 2
stdout:
0 0 , 1 : 2 rotate ['GBRW', 'GWRB', 'BWGR', 'BRGW'] 0 0 , 2 : 2 rotate ['GBRW', 'GWRB', 'GRBW', 'BRGW'] 0 0 , 3 : 2 rotate ['GBRW', 'GWRB', 'GRBW', 'GWBR'] 0 1 , 1 : 3 rotate ['BRWG', 'BGWR', 'GRBW', 'GWBR'] 0 1 , 2 : 1 rotate ['BRWG', 'BGWR', 'RBWG', 'GWBR'] 0 1 , 3 : 3 rotate ['BRWG', 'BGWR', 'RBWG', 'RGWB'] 0 2 , 1 : 3 rotate ['RWGB', 'RBGW', 'RBWG', 'RGWB'] 0 2 , 2 : 2 rotate ['RWGB', 'RBGW', 'WGRB', 'RGWB'] 0 2 , 3 : 2 rotate ['RWGB', 'RBGW', 'WGRB', 'WBRG'] 0 3 , 1 : 3 rotate ['WGBR', 'WRBG', 'WGRB', 'WBRG'] 0 3 , 2 : 3 rotate ['WGBR', 'WRBG', 'BWGR', 'WBRG'] 0 3 , 3 : 1 rotate ['WGBR', 'WRBG', 'BWGR', 'BRGW'] [6, 4, 7, 4]
Code: 06:01:40 UTC,
py,
autosave
# you cBn write to stdout for debugging purposes, e.g.
# print("this is B debug messBge")
def rotBte(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else FBlse
def check(B):
return
def solution(B):
Bnswer=[]
initB = B[0]
for r in rBnge(4):
cnt=0
B[0] = rotBte(initB, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in rBnge(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in rBnge(3):
if ispretty(B[i], rotBte(B[i+1],j+1)):
B[i+1] = rotBte(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotBte", B)
if j==2:
cnt+=1
else:
cnt+=j+1
breBk
Bnswer.Bppend(cnt)
print(Bnswer)
return min(Bnswer)
Code: 06:01:51 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def check(B):
return
def solution(B):
answer=[]
initA = B[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = B[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
B=A[:]
initA = B[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
B=A[:]
initA = A[0]
for r in range(4):
cnt=0
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Code: 06:02:54 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
print(0, r, ",",i+1,":", j+1, "rotate", B)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
0 0 , 1 : 1 rotate ['RGBW', 'BRWG'] 0 1 , 1 : 2 rotate ['GBWR', 'RWGB'] 0 3 , 1 : 3 rotate ['WRGB', 'WGBR'] [1, 3, 2, 2]
1.
0.016 s
OK
stdout:
0 0 , 1 : 2 rotate ['WBGR', 'GRWB', 'WRGB', 'WRGB', 'RBGW'] 0 0 , 2 : 2 rotate ['WBGR', 'GRWB', 'GBWR', 'WRGB', 'RBGW'] 0 0 , 4 : 1 rotate ['WBGR', 'GRWB', 'GBWR', 'WRGB', 'BGWR'] 0 1 , 1 : 3 rotate ['BGRW', 'RWBG', 'WRGB', 'WRGB', 'RBGW'] 0 1 , 2 : 1 rotate ['BGRW', 'RWBG', 'RGBW', 'WRGB', 'RBGW'] 0 1 , 3 : 3 rotate ['BGRW', 'RWBG', 'RGBW', 'BWRG', 'RBGW'] 0 2 , 3 : 2 rotate ['GRWB', 'WBGR', 'WRGB', 'GBWR', 'RBGW'] 0 2 , 4 : 2 rotate ['GRWB', 'WBGR', 'WRGB', 'GBWR', 'GWRB'] 0 3 , 1 : 1 rotate ['RWBG', 'BGRW', 'WRGB', 'WRGB', 'RBGW'] 0 3 , 2 : 3 rotate ['RWBG', 'BGRW', 'BWRG', 'WRGB', 'RBGW'] 0 3 , 3 : 1 rotate ['RWBG', 'BGRW', 'BWRG', 'RGBW', 'RBGW'] 0 3 , 4 : 3 rotate ['RWBG', 'BGRW', 'BWRG', 'RGBW', 'WRBG'] [5, 4, 6, 5]
1.
0.016 s
OK
stdout:
0 0 , 1 : 2 rotate ['RBGW', 'RWGB', 'RWGB', 'GBRW'] 0 0 , 2 : 2 rotate ['RBGW', 'RWGB', 'GBRW', 'GBRW'] 0 0 , 3 : 2 rotate ['RBGW', 'RWGB', 'GBRW', 'RWGB'] 0 1 , 1 : 1 rotate ['BGWR', 'BRWG', 'RWGB', 'GBRW'] 0 1 , 2 : 1 rotate ['BGWR', 'BRWG', 'WGBR', 'GBRW'] 0 1 , 3 : 1 rotate ['BGWR', 'BRWG', 'WGBR', 'BRWG'] 0 3 , 1 : 3 rotate ['WRBG', 'WGBR', 'RWGB', 'GBRW'] 0 3 , 2 : 3 rotate ['WRBG', 'WGBR', 'BRWG', 'GBRW'] 0 3 , 3 : 3 rotate ['WRBG', 'WGBR', 'BRWG', 'WGBR'] [6, 4, 2, 4]
1.
0.016 s
OK
stdout:
0 0 , 1 : 2 rotate ['GBRW', 'GWRB', 'BWGR', 'BRGW'] 0 0 , 2 : 2 rotate ['GBRW', 'GWRB', 'GRBW', 'BRGW'] 0 0 , 3 : 2 rotate ['GBRW', 'GWRB', 'GRBW', 'GWBR'] 0 1 , 1 : 1 rotate ['BRWG', 'BGWR', 'BWGR', 'BRGW'] 0 1 , 2 : 3 rotate ['BRWG', 'BGWR', 'RBWG', 'BRGW'] 0 1 , 3 : 1 rotate ['BRWG', 'BGWR', 'RBWG', 'RGWB'] 0 2 , 2 : 1 rotate ['RWGB', 'RBGW', 'WGRB', 'BRGW'] 0 2 , 3 : 3 rotate ['RWGB', 'RBGW', 'WGRB', 'WBRG'] 0 3 , 1 : 3 rotate ['WGBR', 'WRBG', 'BWGR', 'BRGW'] [6, 4, 4, 2]
Code: 06:03:04 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
print(answer)
return min(answer)
Analysis
expand all
Example tests
1.
0.016 s
OK
stdout:
[1, 3, 2, 2]
1.
0.016 s
OK
stdout:
[5, 4, 6, 5]
1.
0.016 s
OK
stdout:
[6, 4, 2, 4]
1.
0.016 s
OK
stdout:
[6, 4, 4, 2]
Code: 06:03:08 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return min(answer)
Analysis
Code: 06:03:40 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return min(answer)
Analysis
Code: 06:03:44 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def rotate(s, num):
return s[num:]+s[:num]
def ispretty(s1, s2):
return True if s1[1] == s2[3] else False
def solution(A):
answer=[]
initA = A[0]
for r in range(4):
cnt=0
B=A[:]
B[0] = rotate(initA, r)
if r==3:
cnt+=1
else:
cnt+=r
for i in range(len(B)-1):
if ispretty(B[i], B[i+1]):
continue
else:
for j in range(3):
if ispretty(B[i], rotate(B[i+1],j+1)):
B[i+1] = rotate(B[i+1],j+1)
if j==2:
cnt+=1
else:
cnt+=j+1
break
answer.append(cnt)
return min(answer)
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.016 s
OK
2.
0.016 s
OK
1.
0.016 s
OK
2.
0.016 s
OK
3.
0.016 s
OK
4.
0.016 s
OK
5.
0.016 s
OK
1.
0.016 s
OK
2.
0.016 s
OK
3.
0.016 s
OK
4.
0.016 s
OK
5.
0.016 s
OK
1.
0.016 s
OK
2.
0.016 s
OK
expand all
Correctness/performance tests
1.
0.016 s
OK
2.
0.016 s
OK
3.
0.016 s
OK
4.
0.016 s
OK
5.
0.016 s
OK
1.
0.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
4.
0.020 s
OK
5.
0.020 s
OK
6.
0.020 s
OK
1.
0.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
expand all
Performance tests
1.
0.696 s
OK
2.
0.684 s
OK
3.
0.692 s
OK
4.
0.700 s
OK
5.
0.684 s
OK
6.
0.704 s
OK
7.
0.692 s
OK
1.
0.712 s
OK
2.
0.716 s
OK
3.
0.724 s
OK
4.
0.712 s
OK
1.
0.712 s
OK
2.
0.720 s
OK
3.
0.696 s
OK
4.
0.736 s
OK
5.
0.700 s
OK
1.
0.704 s
OK
2.
0.704 s
OK
3.
0.700 s
OK