Tasks Details
hard
1.
Stones
Given N towers of stones, move stones between towers in order to get a requested number of stones on each tower, in a minimum number of moves.
Task Score
100%
Correctness
100%
Performance
100%
There are N towers of stones, numbered from 0 to N−1. The K-th tower contains A[K] stones. In one turn, you can move a single stone from tower K to one of towers K−2, K−1, K+1 or K+2. You can move a stone only to existing towers. For example, from tower 0 you can move a stone only to tower 1 or 2, and from tower 1 you can move a stone only to towers 0, 2 and 3.
What is the minimum number of turns needed to rearrange the stones such that on the K-th tower there will be B[K] stones?
Write a function
def solution(A, B)
that, given two arrays A and B of N integers each, representing the initial and final arrangements of the stones, returns the minimum number of turns needed to rearrange the stones. Since the answer can be very large, provide it modulo 109 + 7 (1,000,000,007). If rearrangement is impossible, your function should return −1.
Examples
1. Given A = [1, 1, 2, 4, 3], B = [2, 2, 2, 3, 2], your function should return 3. You can move one stone from tower 3 to tower 1 using one turn and one from tower 4 to tower 0 using two turns (4 → 2 → 0).
2. Given A = [0, 0, 2, 1, 8, 8, 2, 0], B = [8, 5, 2, 4, 0, 0, 0, 2], your function should return 31. One possible sequence of moves is as follows:
- move 8 stones from tower 4 to 0 (16 turns),
- move 8 stones from tower 5 to 3 (8 turns),
- move 5 stones from tower 3 to 1 (5 turns),
- move 2 stones from tower 6 to 7 (2 turns).
3. Given A = [109, 109, 109, 0, 0, 0], B = [0, 0, 0, 109, 109, 109], your function should return 999999972. Possible sequence of moves:
- move all stones from tower 0 to 5 (3*109 turns),
- move all stones from tower 1 to 3 (109 turns),
- move all stones from tower 2 to 4 (109 turns).
The total number of turns is 5*109, so the answer is 5*109 mod (109+7) = 999999972.
4. Given A = [2] and B = [1] your function should return −1.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- arrays A and B have the same length N;
- each element of arrays A and B is an integer within the range [0..1,000,000,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 14 minutes
Notes
not defined yet
Code: 00:26:28 UTC,
java,
autosave
Code: 00:27:14 UTC,
py,
autosave
Code: 00:27:41 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
Code: 00:28:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
re
Code: 00:29:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
Code: 00:29:42 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
Code: 00:30:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if
Code: 00:30:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[]
Code: 00:30:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i]
Code: 00:30:53 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i - 1] < 0
Code: 00:31:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i - 1] < 0:
Code: 00:31:23 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i - 1] < 0:
diff[i] =
Code: 00:31:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i - 1] < 0:
diff[i] = max(diff[i] + diff[i - 1], 0)
Code: 00:33:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i - 1] < 0:
diff[i] = max(diff[i] + diff[i - 1], 0)
Code: 00:34:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
Code: 00:34:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
Code: 00:34:43 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
Code: 00:34:55 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
else:
diff
Code: 00:35:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
Code: 00:35:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
Code: 00:35:49 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min()
Code: 00:36:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max
Code: 00:36:16 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if not diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if
Code: 00:36:47 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff
return result
Code: 00:36:54 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff
return result % (10 ** 9 + 7)
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 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 36, in solution
diff[i + 2] += diff
TypeError: unsupported operand type(s) for +=: 'int' and 'list'
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 36, in solution
diff[i + 2] += diff
TypeError: unsupported operand type(s) for +=: 'int' and 'list'
1.
0.036 s
OK
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 30, in solution
if diff[i + 1] > 0:
IndexError: list index out of range
Code: 00:37:16 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
return result % (10 ** 9 + 7)
Analysis
expand all
Example tests
1.
0.040 s
OK
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 30, in solution
if diff[i + 1] > 0:
IndexError: list index out of range
1.
0.056 s
OK
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 30, in solution
if diff[i + 1] > 0:
IndexError: list index out of range
Code: 00:37:47 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
p
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
return result % (10 ** 9 + 7)
Code: 00:37:51 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
print(diff)
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
return result % (10 ** 9 + 7)
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
[-1, -1, 0, 1, 1] [-1, -1, -1, 1, 1] [-1, -1, -1, 0, 1] [-1, -1, -1, 0, 0] [-1, -1, -1, 0, 0]
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 31, in solution
if diff[i + 1] > 0:
IndexError: list index out of range
stdout:
[-8, -5, 0, -3, 8, 8, 2, -2] [-8, -5, -8, -3, 8, 8, 2, -2] [-8, -5, -8, -8, 8, 8, 2, -2] [-8, -5, -8, -8, 0, 8, 2, -2] [-8, -5, -8, -8, 0, 0, 2, -2] [-8, -5, -8, -8, 0, 0, 2, -2] [-8, -5, -8, -8, 0, 0, 2, -2] [-8, -5, -8, -8, 0, 0, 0, -2]
1.
0.036 s
OK
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 31, in solution
if diff[i + 1] > 0:
IndexError: list index out of range
stdout:
[1000000000, 1000000000, 1000000000, -1000000000, -1000000000, -1000000000] [1000000000, 1000000000, 2000000000, -1000000000, -1000000000, -1000000000] [1000000000, 1000000000, 2000000000, 0, -1000000000, -1000000000] [1000000000, 1000000000, 2000000000, 0, 1000000000, -1000000000] [1000000000, 1000000000, 2000000000, 0, 1000000000, -1000000000] [1000000000, 1000000000, 2000000000, 0, 0, -1000000000]
Code: 00:38:17 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
print(diff)
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
d
return result % (10 ** 9 + 7)
Code: 00:38:24 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
print(diff)
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
diff[i + 1] = max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
diff[i] = 0
return result % (10 ** 9 + 7)
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
[-1, -1, 0, 1, 1] [0, -1, -1, 1, 1] [0, 0, -1, 0, 1] [0, 0, 0, 0, 0] [0, 0, 0, 0, 0]
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 31, in solution
if diff[i + 1] > 0:
IndexError: list index out of range
stdout:
[-8, -5, 0, -3, 8, 8, 2, -2] [0, -5, -8, -3, 8, 8, 2, -2] [0, 0, -8, -8, 8, 8, 2, -2] [0, 0, 0, -8, 0, 8, 2, -2] [0, 0, 0, 0, 0, 0, 2, -2] [0, 0, 0, 0, 0, 0, 2, -2] [0, 0, 0, 0, 0, 0, 2, -2] [0, 0, 0, 0, 0, 0, 0, -2]
1.
0.036 s
OK
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 139, in <module>
main()
File "exec.py", line 101, in main
result = solution( A, B )
File "/tmp/solution.py", line 31, in solution
if diff[i + 1] > 0:
IndexError: list index out of range
stdout:
[1000000000, 1000000000, 1000000000, -1000000000, -1000000000, -1000000000] [0, 1000000000, 2000000000, -1000000000, -1000000000, -1000000000] [0, 0, 2000000000, 0, -1000000000, -1000000000] [0, 0, 0, 0, 1000000000, -1000000000] [0, 0, 0, 0, 1000000000, -1000000000] [0, 0, 0, 0, 0, -1000000000]
Code: 00:38:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
print(diff)
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i] = max(diff[i] + diff[i + 1], 0)
diff[i + 1] = min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i] = min(diff[i] + diff[i + 1], 0)
= max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
diff[i] = 0
return result % (10 ** 9 + 7)
Code: 00:39:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
print(diff)
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i], diff[i + 1] = max(diff[i] + diff[i + 1], 0), min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i], diff[i + 1] = min(diff[i] + diff[i + 1], 0), max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
diff[i] = 0
return result % (10 ** 9 + 7)
Code: 00:39:30 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
print(diff)
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i], diff[i + 1] = max(diff[i] + diff[i + 1], 0), min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i], diff[i + 1] = min(diff[i] + diff[i + 1], 0), max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
diff[i] = 0
return result % (10 ** 9 + 7)
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
[-1, -1, 0, 1, 1] [0, -1, -1, 1, 1] [0, 0, -1, 0, 1] [0, 0, 0, 0, 0] [0, 0, 0, 0, 0]
1.
0.036 s
OK
stdout:
[-8, -5, 0, -3, 8, 8, 2, -2] [0, -5, -8, -3, 8, 8, 2, -2] [0, 0, -8, -8, 8, 8, 2, -2] [0, 0, 0, -8, 0, 8, 2, -2] [0, 0, 0, 0, 0, 0, 2, -2] [0, 0, 0, 0, 0, 0, 2, -2] [0, 0, 0, 0, 0, 0, 2, -2] [0, 0, 0, 0, 0, 0, 0, 0]
1.
0.036 s
OK
1.
0.036 s
OK
stdout:
[1000000000, 1000000000, 1000000000, -1000000000, -1000000000, -1000000000] [0, 1000000000, 2000000000, -1000000000, -1000000000, -1000000000] [0, 0, 2000000000, 0, -1000000000, -1000000000] [0, 0, 0, 0, 1000000000, -1000000000] [0, 0, 0, 0, 1000000000, -1000000000] [0, 0, 0, 0, 0, 0]
Code: 00:39:41 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i], diff[i + 1] = max(diff[i] + diff[i + 1], 0), min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i], diff[i + 1] = min(diff[i] + diff[i + 1], 0), max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
diff[i] = 0
return result % (10 ** 9 + 7)
Analysis
Code: 00:39:46 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i], diff[i + 1] = max(diff[i] + diff[i + 1], 0), min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i], diff[i + 1] = min(diff[i] + diff[i + 1], 0), max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
diff[i] = 0
return result % (10 ** 9 + 7)
Analysis
Code: 00:39:48 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A, B):
# write your code in Python 3.6
if sum(A) != sum(B):
return -1
diff = []
for i in range(len(A)):
diff.append(A[i] - B[i])
result = 0
for i in range(len(diff)):
if diff[i] == 0:
continue
else:
result += abs(diff[i])
if diff[i] > 0:
if diff[i + 1] < 0:
diff[i], diff[i + 1] = max(diff[i] + diff[i + 1], 0), min(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
else:
if diff[i + 1] > 0:
diff[i], diff[i + 1] = min(diff[i] + diff[i + 1], 0), max(diff[i] + diff[i + 1], 0)
if diff[i]:
diff[i + 2] += diff[i]
else:
diff[i + 2] += diff[i]
diff[i] = 0
return result % (10 ** 9 + 7)Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
5.
0.036 s
OK
1.
0.040 s
OK
2.
0.040 s
OK
1.
0.036 s
OK
2.
0.040 s
OK
1.
0.040 s
OK
expand all
Correctness/performance tests
1.
0.036 s
OK
2.
0.040 s
OK
1.
0.040 s
OK
2.
0.040 s
OK
3.
0.040 s
OK
1.
0.308 s
OK
2.
0.284 s
OK
expand all
Performance tests
1.
0.160 s
OK
2.
0.176 s
OK
3.
0.128 s
OK
4.
0.144 s
OK
1.
0.292 s
OK
2.
0.208 s
OK
3.
0.320 s
OK