oj.uz

Submission #99885

# Submission time Handle Problem Language Result Execution time Memory
99885 2019-03-08T10:56:51 Z zzee Jarvis (COCI19_jarvis) Python 3
7 / 70
 1000 ms 19752 KB 
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for i in range(len(a)):
    c = c+ [b[i]-a[i]]
i = 0
M = - 1000001
while len(c)>i:
    x = c.count(c[i])
    if x > M:
        M = x
    p = c[i]
    for j in range(x):
        c.remove(p)
    i = i + 1
print(M)

Subtask #1
7.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 3492 KB Output is correct
2 Execution timed out 1060 ms 9560 KB Time limit exceeded
3 Execution timed out 1063 ms 9960 KB Time limit exceeded
4 Execution timed out 1057 ms 8492 KB Time limit exceeded
5 Execution timed out 1065 ms 19012 KB Time limit exceeded
6 Execution timed out 1067 ms 19752 KB Time limit exceeded
7 Execution timed out 1072 ms 18996 KB Time limit exceeded
8 Execution timed out 1070 ms 18996 KB Time limit exceeded
9 Execution timed out 1070 ms 19548 KB Time limit exceeded
10 Execution timed out 1065 ms 19004 KB Time limit exceeded