From a89ee2dfca285ccefae950673895bd7a0efba014 Mon Sep 17 00:00:00 2001 From: agron911 Date: Mon, 9 Dec 2024 20:41:56 -0800 Subject: [PATCH 1/2] add analysis --- notebooks/exploratory_analysis.ipynb | 38700 +++++++++++++++++++++++++ src/main.py | 2 +- src/optimizer.py | 1 + 3 files changed, 38702 insertions(+), 1 deletion(-) diff --git a/notebooks/exploratory_analysis.ipynb b/notebooks/exploratory_analysis.ipynb index 68f99c3..8ddcf23 100644 --- a/notebooks/exploratory_analysis.ipynb +++ b/notebooks/exploratory_analysis.ipynb @@ -27,6 +27,38706 @@ "print(\"Keys in each record:\")\n", "print(keys)" ] + }, + { + "cell_type": "code", + "execution_count": 11, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "[{'user_id': 'u824144553',\n", + " 'problem_id': 'p02647',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's947547146',\n", + " 'submission_id_v1': 's829816575',\n", + " 'cpu_time_v0': 897,\n", + " 'cpu_time_v1': 312,\n", + " 'memory_v0': 129220,\n", + " 'memory_v1': 169716,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 65.22,\n", + " 'input': 'import copy\\n\\nfrom functools import lru_cache\\n\\nimport numpy as np\\n\\nfrom numba import njit\\n\\n\\n\\n#@njit\\n\\n# @njit(\\'(i8[::1],)\\', cache=True)\\n\\n# def func(A):\\n\\n# N = len(A)\\n\\n# B = np.zeros_like(A)\\n\\n# for i in range(N):\\n\\n# l = max(0, i - A[i])\\n\\n# r = min(i + A[i], N-1)\\n\\n# B[l] += 1\\n\\n# if r+1 < N:\\n\\n# B[r+1] -= 1\\n\\n\\n\\n# B = np.cumsum(B)\\n\\n# return B\\n\\n\\n\\ndef resolve():\\n\\n N, K = list(map(int, input().split()))\\n\\n A = np.array(list(map(int, input().split())))\\n\\n\\n\\n # N = 2 * 10**5\\n\\n # K = 2 * 10**5\\n\\n # A = np.array([0] * N)\\n\\n\\n\\n @njit\\n\\n def func(A):\\n\\n #N = len(A)\\n\\n B = np.zeros_like(A)\\n\\n for i in range(N):\\n\\n l = max(0, i - A[i])\\n\\n r = min(i + A[i], N-1)\\n\\n B[l] += 1\\n\\n if r+1 < N:\\n\\n B[r+1] -= 1\\n\\n\\n\\n B = np.cumsum(B)\\n\\n return B\\n\\n\\n\\n for k in range(K):\\n\\n #print(k)\\n\\n A = func(A)\\n\\n if k >= 50:\\n\\n break\\n\\n\\n\\n print((\" \".join(map(str, A))))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n resolve()',\n", + " 'target': 'import copy\\n\\nfrom functools import lru_cache\\n\\n#import numpy as np\\n\\n#from numba import njit\\n\\n\\n\\ndef resolve():\\n\\n N, K = list(map(int, input().split()))\\n\\n #A = np.array(list(map(int, input().split())))\\n\\n A = list(map(int, input().split()))\\n\\n\\n\\n #N = 2 * 10**5\\n\\n #K = 2 * 10**5\\n\\n #A = np.array([0] * N)\\n\\n\\n\\n def func(A):\\n\\n B = [0] * N\\n\\n for i in range(N):\\n\\n l = max(0, i - A[i])\\n\\n r = min(i + A[i], N-1)\\n\\n B[l] += 1\\n\\n if r+1 < N:\\n\\n B[r+1] -= 1\\n\\n\\n\\n for i in range(1, N):\\n\\n B[i] += B[i-1]\\n\\n return B\\n\\n\\n\\n for k in range(K):\\n\\n #print(k)\\n\\n A = func(A)\\n\\n if k >= 50:\\n\\n break\\n\\n\\n\\n print((\" \".join(map(str, A))))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n resolve()',\n", + " 'code_v0_loc': 52,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 1071,\n", + " 'code_v1_num_chars': 792,\n", + " 'code_v0_no_empty_lines': 'import copy\\nfrom functools import lru_cache\\nimport numpy as np\\nfrom numba import njit\\n\\n# @njit\\n# @njit(\\'(i8[::1],)\\', cache=True)\\n# def func(A):\\n# N = len(A)\\n# B = np.zeros_like(A)\\n# for i in range(N):\\n# l = max(0, i - A[i])\\n# r = min(i + A[i], N-1)\\n# B[l] += 1\\n# if r+1 < N:\\n# B[r+1] -= 1\\n# B = np.cumsum(B)\\n# return B\\ndef resolve():\\n N, K = list(map(int, input().split()))\\n A = np.array(list(map(int, input().split())))\\n # N = 2 * 10**5\\n # K = 2 * 10**5\\n # A = np.array([0] * N)\\n @njit\\n def func(A):\\n # N = len(A)\\n B = np.zeros_like(A)\\n for i in range(N):\\n l = max(0, i - A[i])\\n r = min(i + A[i], N - 1)\\n B[l] += 1\\n if r + 1 < N:\\n B[r + 1] -= 1\\n B = np.cumsum(B)\\n return B\\n\\n for k in range(K):\\n # print(k)\\n A = func(A)\\n if k >= 50:\\n break\\n print((\" \".join(map(str, A))))\\n\\n\\nif __name__ == \"__main__\":\\n resolve()\\n',\n", + " 'code_v1_no_empty_lines': 'import copy\\nfrom functools import lru_cache\\n\\n# import numpy as np\\n# from numba import njit\\ndef resolve():\\n N, K = list(map(int, input().split()))\\n # A = np.array(list(map(int, input().split())))\\n A = list(map(int, input().split()))\\n # N = 2 * 10**5\\n # K = 2 * 10**5\\n # A = np.array([0] * N)\\n def func(A):\\n B = [0] * N\\n for i in range(N):\\n l = max(0, i - A[i])\\n r = min(i + A[i], N - 1)\\n B[l] += 1\\n if r + 1 < N:\\n B[r + 1] -= 1\\n for i in range(1, N):\\n B[i] += B[i - 1]\\n return B\\n\\n for k in range(K):\\n # print(k)\\n A = func(A)\\n if k >= 50:\\n break\\n print((\" \".join(map(str, A))))\\n\\n\\nif __name__ == \"__main__\":\\n resolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 28.8461538462,\n", + " 'diff': ['-import numpy as np',\n", + " '-from numba import njit',\n", + " '-# @njit',\n", + " \"-# @njit('(i8[::1],)', cache=True)\",\n", + " '-# def func(A):',\n", + " '-# N = len(A)',\n", + " '-# B = np.zeros_like(A)',\n", + " '-# for i in range(N):',\n", + " '-# l = max(0, i - A[i])',\n", + " '-# r = min(i + A[i], N-1)',\n", + " '-# B[l] += 1',\n", + " '-# if r+1 < N:',\n", + " '-# B[r+1] -= 1',\n", + " '-# B = np.cumsum(B)',\n", + " '-# return B',\n", + " '+# import numpy as np',\n", + " '+# from numba import njit',\n", + " '- A = np.array(list(map(int, input().split())))',\n", + " '+ # A = np.array(list(map(int, input().split())))',\n", + " '+ A = list(map(int, input().split()))',\n", + " '- @njit',\n", + " '- # N = len(A)',\n", + " '- B = np.zeros_like(A)',\n", + " '+ B = [0] * N',\n", + " '- B = np.cumsum(B)',\n", + " '+ for i in range(1, N):',\n", + " '+ B[i] += B[i - 1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3551732968,\n", + " 'measured_runtime_v1': 0.2157634698,\n", + " 'runtime_lift': 6.280828252,\n", + " 'key': ['s947547146', 's829816575']},\n", + " {'user_id': 'u864197622',\n", + " 'problem_id': 'p02599',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's844952454',\n", + " 'submission_id_v1': 's272405166',\n", + " 'cpu_time_v0': 1464,\n", + " 'cpu_time_v1': 1163,\n", + " 'memory_v0': 208840,\n", + " 'memory_v1': 175860,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.56,\n", + " 'input': 'NN = 19\\n\\nXX = [0] * (2**(NN+1)-1)\\n\\n\\n\\ndef addvalue(j, x):\\n\\n i = 2**NN + j - 1\\n\\n while i >= 0:\\n\\n XX[i] += x\\n\\n i = (i-1) // 2\\n\\n\\n\\ndef rangesum(a, b):\\n\\n l = a + (1<>= 1\\n\\n r >>= 1\\n\\n return s\\n\\n\\n\\nN, Q = map(int, input().split())\\n\\nC = [int(a) - 1 for a in input().split()]\\n\\nX = [[] for _ in range(N)]\\n\\nfor i in range(Q):\\n\\n l, r = map(int, input().split())\\n\\n X[r-1].append((l - 1, i))\\n\\nlast = [-1] * N\\n\\nANS = [-1] * Q\\n\\naddvalue(1, N)\\n\\nfor r in range(N):\\n\\n c = C[r]\\n\\n addvalue(last[c] + 2, -1)\\n\\n addvalue(r + 2, 1)\\n\\n last[c] = r\\n\\n for l, i in X[r]:\\n\\n ANS[i] = rangesum(l + 2, 1 << NN)\\n\\n \\n\\nprint(*ANS, sep = \"\\\\n\")\\n',\n", + " 'target': \"##### https://atcoder.jp/contests/abc174/submissions/15644075 を1次元化\\n\\n\\n\\nimport sys\\n\\nINF = 1 << 60\\n\\nMOD = 10**9 + 7 # 998244353\\n\\nsys.setrecursionlimit(2147483647)\\n\\ninput = lambda:sys.stdin.buffer.readline().rstrip()\\n\\n \\n\\nclass SegmentTree(object):\\n\\n def __init__(self, A, dot, unit):\\n\\n n = 1 << (len(A) - 1).bit_length()\\n\\n tree = [unit] * (2 * n)\\n\\n for i, v in enumerate(A):\\n\\n tree[i + n] = v\\n\\n for i in range(n - 1, 0, -1):\\n\\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\\n\\n self._n = n\\n\\n self._tree = tree\\n\\n self._dot = dot\\n\\n self._unit = unit\\n\\n \\n\\n def __getitem__(self, i):\\n\\n return self._tree[i + self._n]\\n\\n \\n\\n def update(self, i, v):\\n\\n i += self._n\\n\\n self._tree[i] = v\\n\\n while i != 1:\\n\\n i >>= 1\\n\\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\\n\\n \\n\\n def add(self, i, v):\\n\\n self.update(i, self[i] + v)\\n\\n \\n\\n def sum(self, l, r):\\n\\n l += self._n\\n\\n r += self._n\\n\\n l_val = r_val = self._unit\\n\\n while l < r:\\n\\n if l & 1:\\n\\n l_val = self._dot(l_val, self._tree[l])\\n\\n l += 1\\n\\n if r & 1:\\n\\n r -= 1\\n\\n r_val = self._dot(self._tree[r], r_val)\\n\\n l >>= 1\\n\\n r >>= 1\\n\\n return self._dot(l_val, r_val)\\n\\n\\n\\nfrom operator import add\\n\\ndef resolve():\\n\\n n, q = map(int, input().split())\\n\\n C = list(map(lambda x : int(x) - 1, input().split()))\\n\\n \\n\\n A = [0] * n\\n\\n used = [0] * n\\n\\n for i, c in enumerate(C):\\n\\n if used[c]:\\n\\n continue\\n\\n used[c] = 1\\n\\n A[i] = 1\\n\\n tree = SegmentTree(A, add, 0)\\n\\n \\n\\n next = [-1] * n\\n\\n used = [-1] * n\\n\\n for i in range(n - 1, -1, -1):\\n\\n c = C[i]\\n\\n if used[c] != -1:\\n\\n next[i] = used[c]\\n\\n used[c] = i\\n\\n \\n\\n queries = [None] * q\\n\\n for i in range(q):\\n\\n l, r = map(int, input().split())\\n\\n queries[i] = (l - 1 << 40) + (r << 20) + i\\n\\n queries.sort(reverse = 1)\\n\\n \\n\\n m = (1 << 20) - 1\\n\\n ans = [0] * q\\n\\n for l in range(n):\\n\\n while queries and queries[-1] >> 40 == l:\\n\\n lri = queries.pop()\\n\\n l = lri >> 40\\n\\n r = (lri >> 20) & m\\n\\n i = lri & m\\n\\n ans[i] = tree.sum(l, r)\\n\\n if next[l] != -1:\\n\\n tree.add(next[l], 1)\\n\\n \\n\\n print(*ans, sep = '\\\\n')\\n\\nresolve()\\n\",\n", + " 'code_v0_loc': 42,\n", + " 'code_v1_loc': 91,\n", + " 'code_v0_num_chars': 858,\n", + " 'code_v1_num_chars': 2458,\n", + " 'code_v0_no_empty_lines': 'NN = 19\\nXX = [0] * (2 ** (NN + 1) - 1)\\n\\n\\ndef addvalue(j, x):\\n i = 2**NN + j - 1\\n while i >= 0:\\n XX[i] += x\\n i = (i - 1) // 2\\n\\n\\ndef rangesum(a, b):\\n l = a + (1 << NN)\\n r = b + (1 << NN)\\n s = 0\\n while l < r:\\n if l % 2:\\n s += XX[l - 1]\\n l += 1\\n if r % 2:\\n r -= 1\\n s += XX[r - 1]\\n l >>= 1\\n r >>= 1\\n return s\\n\\n\\nN, Q = map(int, input().split())\\nC = [int(a) - 1 for a in input().split()]\\nX = [[] for _ in range(N)]\\nfor i in range(Q):\\n l, r = map(int, input().split())\\n X[r - 1].append((l - 1, i))\\nlast = [-1] * N\\nANS = [-1] * Q\\naddvalue(1, N)\\nfor r in range(N):\\n c = C[r]\\n addvalue(last[c] + 2, -1)\\n addvalue(r + 2, 1)\\n last[c] = r\\n for l, i in X[r]:\\n ANS[i] = rangesum(l + 2, 1 << NN)\\nprint(*ANS, sep=\"\\\\n\")\\n',\n", + " 'code_v1_no_empty_lines': '##### https://atcoder.jp/contests/abc174/submissions/15644075 を1次元化\\nimport sys\\n\\nINF = 1 << 60\\nMOD = 10**9 + 7 # 998244353\\nsys.setrecursionlimit(2147483647)\\ninput = lambda: sys.stdin.buffer.readline().rstrip()\\n\\n\\nclass SegmentTree(object):\\n def __init__(self, A, dot, unit):\\n n = 1 << (len(A) - 1).bit_length()\\n tree = [unit] * (2 * n)\\n for i, v in enumerate(A):\\n tree[i + n] = v\\n for i in range(n - 1, 0, -1):\\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\\n self._n = n\\n self._tree = tree\\n self._dot = dot\\n self._unit = unit\\n\\n def __getitem__(self, i):\\n return self._tree[i + self._n]\\n\\n def update(self, i, v):\\n i += self._n\\n self._tree[i] = v\\n while i != 1:\\n i >>= 1\\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\\n\\n def add(self, i, v):\\n self.update(i, self[i] + v)\\n\\n def sum(self, l, r):\\n l += self._n\\n r += self._n\\n l_val = r_val = self._unit\\n while l < r:\\n if l & 1:\\n l_val = self._dot(l_val, self._tree[l])\\n l += 1\\n if r & 1:\\n r -= 1\\n r_val = self._dot(self._tree[r], r_val)\\n l >>= 1\\n r >>= 1\\n return self._dot(l_val, r_val)\\n\\n\\nfrom operator import add\\n\\n\\ndef resolve():\\n n, q = map(int, input().split())\\n C = list(map(lambda x: int(x) - 1, input().split()))\\n A = [0] * n\\n used = [0] * n\\n for i, c in enumerate(C):\\n if used[c]:\\n continue\\n used[c] = 1\\n A[i] = 1\\n tree = SegmentTree(A, add, 0)\\n next = [-1] * n\\n used = [-1] * n\\n for i in range(n - 1, -1, -1):\\n c = C[i]\\n if used[c] != -1:\\n next[i] = used[c]\\n used[c] = i\\n queries = [None] * q\\n for i in range(q):\\n l, r = map(int, input().split())\\n queries[i] = (l - 1 << 40) + (r << 20) + i\\n queries.sort(reverse=1)\\n m = (1 << 20) - 1\\n ans = [0] * q\\n for l in range(n):\\n while queries and queries[-1] >> 40 == l:\\n lri = queries.pop()\\n l = lri >> 40\\n r = (lri >> 20) & m\\n i = lri & m\\n ans[i] = tree.sum(l, r)\\n if next[l] != -1:\\n tree.add(next[l], 1)\\n print(*ans, sep=\"\\\\n\")\\n\\n\\nresolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 53.8461538462,\n", + " 'diff': ['-NN = 19',\n", + " '-XX = [0] * (2 ** (NN + 1) - 1)',\n", + " '+##### https://atcoder.jp/contests/abc174/submissions/15644075 を1次元化',\n", + " '+import sys',\n", + " '+',\n", + " '+INF = 1 << 60',\n", + " '+MOD = 10**9 + 7 # 998244353',\n", + " '+sys.setrecursionlimit(2147483647)',\n", + " '+input = lambda: sys.stdin.buffer.readline().rstrip()',\n", + " '-def addvalue(j, x):',\n", + " '- i = 2**NN + j - 1',\n", + " '- while i >= 0:',\n", + " '- XX[i] += x',\n", + " '- i = (i - 1) // 2',\n", + " '+class SegmentTree(object):',\n", + " '+ def __init__(self, A, dot, unit):',\n", + " '+ n = 1 << (len(A) - 1).bit_length()',\n", + " '+ tree = [unit] * (2 * n)',\n", + " '+ for i, v in enumerate(A):',\n", + " '+ tree[i + n] = v',\n", + " '+ for i in range(n - 1, 0, -1):',\n", + " '+ tree[i] = dot(tree[i << 1], tree[i << 1 | 1])',\n", + " '+ self._n = n',\n", + " '+ self._tree = tree',\n", + " '+ self._dot = dot',\n", + " '+ self._unit = unit',\n", + " '+',\n", + " '+ def __getitem__(self, i):',\n", + " '+ return self._tree[i + self._n]',\n", + " '+',\n", + " '+ def update(self, i, v):',\n", + " '+ i += self._n',\n", + " '+ self._tree[i] = v',\n", + " '+ while i != 1:',\n", + " '+ i >>= 1',\n", + " '+ self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])',\n", + " '+',\n", + " '+ def add(self, i, v):',\n", + " '+ self.update(i, self[i] + v)',\n", + " '+',\n", + " '+ def sum(self, l, r):',\n", + " '+ l += self._n',\n", + " '+ r += self._n',\n", + " '+ l_val = r_val = self._unit',\n", + " '+ while l < r:',\n", + " '+ if l & 1:',\n", + " '+ l_val = self._dot(l_val, self._tree[l])',\n", + " '+ l += 1',\n", + " '+ if r & 1:',\n", + " '+ r -= 1',\n", + " '+ r_val = self._dot(self._tree[r], r_val)',\n", + " '+ l >>= 1',\n", + " '+ r >>= 1',\n", + " '+ return self._dot(l_val, r_val)',\n", + " '-def rangesum(a, b):',\n", + " '- l = a + (1 << NN)',\n", + " '- r = b + (1 << NN)',\n", + " '- s = 0',\n", + " '- while l < r:',\n", + " '- if l % 2:',\n", + " '- s += XX[l - 1]',\n", + " '- l += 1',\n", + " '- if r % 2:',\n", + " '- r -= 1',\n", + " '- s += XX[r - 1]',\n", + " '- l >>= 1',\n", + " '- r >>= 1',\n", + " '- return s',\n", + " '+from operator import add',\n", + " '-N, Q = map(int, input().split())',\n", + " '-C = [int(a) - 1 for a in input().split()]',\n", + " '-X = [[] for _ in range(N)]',\n", + " '-for i in range(Q):',\n", + " '- l, r = map(int, input().split())',\n", + " '- X[r - 1].append((l - 1, i))',\n", + " '-last = [-1] * N',\n", + " '-ANS = [-1] * Q',\n", + " '-addvalue(1, N)',\n", + " '-for r in range(N):',\n", + " '- c = C[r]',\n", + " '- addvalue(last[c] + 2, -1)',\n", + " '- addvalue(r + 2, 1)',\n", + " '- last[c] = r',\n", + " '- for l, i in X[r]:',\n", + " '- ANS[i] = rangesum(l + 2, 1 << NN)',\n", + " '-print(*ANS, sep=\"\\\\n\")',\n", + " '+def resolve():',\n", + " '+ n, q = map(int, input().split())',\n", + " '+ C = list(map(lambda x: int(x) - 1, input().split()))',\n", + " '+ A = [0] * n',\n", + " '+ used = [0] * n',\n", + " '+ for i, c in enumerate(C):',\n", + " '+ if used[c]:',\n", + " '+ continue',\n", + " '+ used[c] = 1',\n", + " '+ A[i] = 1',\n", + " '+ tree = SegmentTree(A, add, 0)',\n", + " '+ next = [-1] * n',\n", + " '+ used = [-1] * n',\n", + " '+ for i in range(n - 1, -1, -1):',\n", + " '+ c = C[i]',\n", + " '+ if used[c] != -1:',\n", + " '+ next[i] = used[c]',\n", + " '+ used[c] = i',\n", + " '+ queries = [None] * q',\n", + " '+ for i in range(q):',\n", + " '+ l, r = map(int, input().split())',\n", + " '+ queries[i] = (l - 1 << 40) + (r << 20) + i',\n", + " '+ queries.sort(reverse=1)',\n", + " '+ m = (1 << 20) - 1',\n", + " '+ ans = [0] * q',\n", + " '+ for l in range(n):',\n", + " '+ while queries and queries[-1] >> 40 == l:',\n", + " '+ lri = queries.pop()',\n", + " '+ l = lri >> 40',\n", + " '+ r = (lri >> 20) & m',\n", + " '+ i = lri & m',\n", + " '+ ans[i] = tree.sum(l, r)',\n", + " '+ if next[l] != -1:',\n", + " '+ tree.add(next[l], 1)',\n", + " '+ print(*ans, sep=\"\\\\n\")',\n", + " '+',\n", + " '+',\n", + " '+resolve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3892713579,\n", + " 'measured_runtime_v1': 0.2184136535,\n", + " 'runtime_lift': 1.7822665926,\n", + " 'key': ['s844952454', 's272405166']},\n", + " {'user_id': 'u017415492',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's441153846',\n", + " 'submission_id_v1': 's191790319',\n", + " 'cpu_time_v0': 115,\n", + " 'cpu_time_v1': 38,\n", + " 'memory_v0': 28112,\n", + " 'memory_v1': 9176,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 66.96,\n", + " 'input': 'import numpy as np\\n\\nx=int(eval(input()))\\n\\n#ａ⁵－ｂ⁵＝(ａ－ｂ)(ａ⁴＋ａ³ｂ＋ａ²ｂ²＋ａｂ³＋ｂ⁴)\\n\\ndef make_divisors(n):\\n\\n divisors = []\\n\\n for i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n divisors.append(i)\\n\\n if i != n // i:\\n\\n divisors.append(n//i)\\n\\n return divisors\\n\\nd=make_divisors(x)\\n\\nfor i in range(len(d)):\\n\\n d.append(-d[i])\\n\\nflag=False\\n\\n\\n\\nfor i in d:\\n\\n if flag==True:\\n\\n break\\n\\n tui=x//i\\n\\n ans=np.roots([5,10*i,10*i**2,5*i**3,i**4-tui])\\n\\n for j in ans:\\n\\n if flag==True:\\n\\n break\\n\\n if j.imag==0:\\n\\n a=i+round(j.real)\\n\\n if a**5-(round(j.real))**5==x:\\n\\n print((int(a),int(round(j.real))))\\n\\n flag=True\\n\\n break',\n", + " 'target': 'x=int(eval(input()))\\n\\nflag=True\\n\\nfor i in range(-118,120):\\n\\n if flag==False:\\n\\n break\\n\\n for j in range(-119,119):\\n\\n if x==(i**5-j**5):\\n\\n print((i,j))\\n\\n flag=False\\n\\n break',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 676,\n", + " 'code_v1_num_chars': 184,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nx = int(eval(input()))\\n# ａ⁵－ｂ⁵＝(ａ－ｂ)(ａ⁴＋ａ³ｂ＋ａ²ｂ²＋ａｂ³＋ｂ⁴)\\ndef make_divisors(n):\\n divisors = []\\n for i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n divisors.append(i)\\n if i != n // i:\\n divisors.append(n // i)\\n return divisors\\n\\n\\nd = make_divisors(x)\\nfor i in range(len(d)):\\n d.append(-d[i])\\nflag = False\\nfor i in d:\\n if flag == True:\\n break\\n tui = x // i\\n ans = np.roots([5, 10 * i, 10 * i**2, 5 * i**3, i**4 - tui])\\n for j in ans:\\n if flag == True:\\n break\\n if j.imag == 0:\\n a = i + round(j.real)\\n if a**5 - (round(j.real)) ** 5 == x:\\n print((int(a), int(round(j.real))))\\n flag = True\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nflag = True\\nfor i in range(-118, 120):\\n if flag == False:\\n break\\n for j in range(-119, 119):\\n if x == (i**5 - j**5):\\n print((i, j))\\n flag = False\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-# ａ⁵－ｂ⁵＝(ａ－ｂ)(ａ⁴＋ａ³ｂ＋ａ²ｂ²＋ａｂ³＋ｂ⁴)',\n", + " '-def make_divisors(n):',\n", + " '- divisors = []',\n", + " '- for i in range(1, int(n**0.5) + 1):',\n", + " '- if n % i == 0:',\n", + " '- divisors.append(i)',\n", + " '- if i != n // i:',\n", + " '- divisors.append(n // i)',\n", + " '- return divisors',\n", + " '-',\n", + " '-',\n", + " '-d = make_divisors(x)',\n", + " '-for i in range(len(d)):',\n", + " '- d.append(-d[i])',\n", + " '-flag = False',\n", + " '-for i in d:',\n", + " '- if flag == True:',\n", + " '+flag = True',\n", + " '+for i in range(-118, 120):',\n", + " '+ if flag == False:',\n", + " '- tui = x // i',\n", + " '- ans = np.roots([5, 10 * i, 10 * i**2, 5 * i**3, i**4 - tui])',\n", + " '- for j in ans:',\n", + " '- if flag == True:',\n", + " '+ for j in range(-119, 119):',\n", + " '+ if x == (i**5 - j**5):',\n", + " '+ print((i, j))',\n", + " '+ flag = False',\n", + " '- if j.imag == 0:',\n", + " '- a = i + round(j.real)',\n", + " '- if a**5 - (round(j.real)) ** 5 == x:',\n", + " '- print((int(a), int(round(j.real))))',\n", + " '- flag = True',\n", + " '- break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4192973773,\n", + " 'measured_runtime_v1': 0.0068819066,\n", + " 'runtime_lift': 206.2360709024,\n", + " 'key': ['s441153846', 's191790319']},\n", + " {'user_id': 'u378157957',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's064171222',\n", + " 'submission_id_v1': 's323999427',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 58,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.78,\n", + " 'input': 'import math\\n\\n\\n\\nN = int(eval(input()))\\n\\n\\n\\nnum = math.factorial(N)\\n\\n\\n\\nk, r = divmod(num, 10**9 + 7)\\n\\nprint(r)',\n", + " 'target': 'N = int(eval(input()))\\n\\n\\n\\nFACTOR = 10 ** 9 + 7\\n\\n\\n\\nnum = 1\\n\\nfor i in range(1, N+1):\\n\\n num *= i\\n\\n k, r = divmod(num, FACTOR)\\n\\n num = r\\n\\n\\n\\nprint(r)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 101,\n", + " 'code_v1_num_chars': 147,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nnum = math.factorial(N)\\nk, r = divmod(num, 10**9 + 7)\\nprint(r)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nFACTOR = 10**9 + 7\\nnum = 1\\nfor i in range(1, N + 1):\\n num *= i\\n k, r = divmod(num, FACTOR)\\n num = r\\nprint(r)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.2727272727,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-num = math.factorial(N)',\n", + " '-k, r = divmod(num, 10**9 + 7)',\n", + " '+FACTOR = 10**9 + 7',\n", + " '+num = 1',\n", + " '+for i in range(1, N + 1):',\n", + " '+ num *= i',\n", + " '+ k, r = divmod(num, FACTOR)',\n", + " '+ num = r'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6578995652,\n", + " 'measured_runtime_v1': 0.3768342862,\n", + " 'runtime_lift': 1.7458590932,\n", + " 'key': ['s064171222', 's323999427']},\n", + " {'user_id': 'u803617136',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's116805601',\n", + " 'submission_id_v1': 's513357045',\n", + " 'cpu_time_v0': 184,\n", + " 'cpu_time_v1': 27,\n", + " 'memory_v0': 40560,\n", + " 'memory_v1': 4148,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.33,\n", + " 'input': 'N = int(eval(input()))\\n\\n\\n\\nseq = list(map(int, input().split()))\\n\\n\\n\\ncnt = 0\\n\\n\\n\\nfor num in seq:\\n\\n while num % 2 == 0:\\n\\n cnt += 1\\n\\n num /= 2\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'target': \"n = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nans = 0\\n\\nfor num in a:\\n\\n ans += format(num, 'b')[::-1].find('1')\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 163,\n", + " 'code_v1_num_chars': 134,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nseq = list(map(int, input().split()))\\ncnt = 0\\nfor num in seq:\\n while num % 2 == 0:\\n cnt += 1\\n num /= 2\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nans = 0\\nfor num in a:\\n ans += format(num, \"b\")[::-1].find(\"1\")\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-seq = list(map(int, input().split()))',\n", + " '-cnt = 0',\n", + " '-for num in seq:',\n", + " '- while num % 2 == 0:',\n", + " '- cnt += 1',\n", + " '- num /= 2',\n", + " '-print(cnt)',\n", + " '+n = int(eval(input()))',\n", + " '+a = list(map(int, input().split()))',\n", + " '+ans = 0',\n", + " '+for num in a:',\n", + " '+ ans += format(num, \"b\")[::-1].find(\"1\")',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1574799829,\n", + " 'measured_runtime_v1': 0.0061847587,\n", + " 'runtime_lift': 25.4625913758,\n", + " 'key': ['s116805601', 's513357045']},\n", + " {'user_id': 'u628794221',\n", + " 'problem_id': 'p02688',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's048784054',\n", + " 'submission_id_v1': 's441243732',\n", + " 'cpu_time_v0': 24,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 9192,\n", + " 'memory_v1': 9172,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.67,\n", + " 'input': 'N, K = list(map(int, input().split()))\\n\\nsunuke = [True]*N\\n\\nfor i in range(K):\\n\\n d = int(eval(input()))\\n\\n A = list(map(int, input().split()))\\n\\n for a in A:\\n\\n sunuke[a-1] = False\\n\\n\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n if sunuke[i]:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'target': 'N, K = list(map(int, input().split()))\\n\\nflag = [True]*N\\n\\nfor i in range(K):\\n\\n d = int(eval(input()))\\n\\n A = list(map(int, input().split()))\\n\\n for a in A:\\n\\n flag[a-1] = False\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n if flag[i]:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 260,\n", + " 'code_v1_num_chars': 252,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\nsunuke = [True] * N\\nfor i in range(K):\\n d = int(eval(input()))\\n A = list(map(int, input().split()))\\n for a in A:\\n sunuke[a - 1] = False\\nans = 0\\nfor i in range(N):\\n if sunuke[i]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nflag = [True] * N\\nfor i in range(K):\\n d = int(eval(input()))\\n A = list(map(int, input().split()))\\n for a in A:\\n flag[a - 1] = False\\nans = 0\\nfor i in range(N):\\n if flag[i]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['-sunuke = [True] * N',\n", + " '+flag = [True] * N',\n", + " '- sunuke[a - 1] = False',\n", + " '+ flag[a - 1] = False',\n", + " '- if sunuke[i]:',\n", + " '+ if flag[i]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3757941551,\n", + " 'measured_runtime_v1': 0.2950303654,\n", + " 'runtime_lift': 1.2737473806,\n", + " 'key': ['s048784054', 's441243732']},\n", + " {'user_id': 'u692746605',\n", + " 'problem_id': 'p03287',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's303506832',\n", + " 'submission_id_v1': 's561375948',\n", + " 'cpu_time_v0': 133,\n", + " 'cpu_time_v1': 114,\n", + " 'memory_v0': 16072,\n", + " 'memory_v1': 14224,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.29,\n", + " 'input': 'n,m=list(map(int,input().split()))\\n\\na=[int(x) for x in input().split()]\\n\\nb=[0 for x in range(n+1)]\\n\\nl=list([0])\\n\\n\\n\\nfor i in range(1,n+1):\\n\\n b[i]=b[i-1]+a[i-1]\\n\\n\\n\\nfor i in range(1,n+1):\\n\\n l.append(b[i]%m)\\n\\n\\n\\nd=list()\\n\\nl.sort()\\n\\nt,c=0,1\\n\\nfor i in range(1,n+1):\\n\\n if l[i]==l[i-1]:\\n\\n c+=1\\n\\n else:\\n\\n if c!=1:\\n\\n t += c*(c-1)//2\\n\\n c=1\\n\\n\\n\\nif c!=1:\\n\\n t += c*(c-1)//2 \\n\\n\\n\\nprint(t)\\n',\n", + " 'target': 'n,m=list(map(int,input().split()))\\n\\na=[int(x) for x in input().split()]\\n\\nl=list([0])\\n\\n\\n\\nb=0\\n\\nfor i in range(0,n):\\n\\n b += a[i]\\n\\n l.append(b%m)\\n\\nl.append(m)\\n\\n\\n\\nl.sort()\\n\\nt,c=0,1\\n\\nfor i in range(1,n+2):\\n\\n if l[i]==l[i-1]:\\n\\n c+=1\\n\\n else:\\n\\n if c!=1:\\n\\n t += c*(c-1)//2\\n\\n c=1\\n\\nprint(t)\\n',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 387,\n", + " 'code_v1_num_chars': 293,\n", + " 'code_v0_no_empty_lines': 'n, m = list(map(int, input().split()))\\na = [int(x) for x in input().split()]\\nb = [0 for x in range(n + 1)]\\nl = list([0])\\nfor i in range(1, n + 1):\\n b[i] = b[i - 1] + a[i - 1]\\nfor i in range(1, n + 1):\\n l.append(b[i] % m)\\nd = list()\\nl.sort()\\nt, c = 0, 1\\nfor i in range(1, n + 1):\\n if l[i] == l[i - 1]:\\n c += 1\\n else:\\n if c != 1:\\n t += c * (c - 1) // 2\\n c = 1\\nif c != 1:\\n t += c * (c - 1) // 2\\nprint(t)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\na = [int(x) for x in input().split()]\\nl = list([0])\\nb = 0\\nfor i in range(0, n):\\n b += a[i]\\n l.append(b % m)\\nl.append(m)\\nl.sort()\\nt, c = 0, 1\\nfor i in range(1, n + 2):\\n if l[i] == l[i - 1]:\\n c += 1\\n else:\\n if c != 1:\\n t += c * (c - 1) // 2\\n c = 1\\nprint(t)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-b = [0 for x in range(n + 1)]',\n", + " '-for i in range(1, n + 1):',\n", + " '- b[i] = b[i - 1] + a[i - 1]',\n", + " '-for i in range(1, n + 1):',\n", + " '- l.append(b[i] % m)',\n", + " '-d = list()',\n", + " '+b = 0',\n", + " '+for i in range(0, n):',\n", + " '+ b += a[i]',\n", + " '+ l.append(b % m)',\n", + " '+l.append(m)',\n", + " '-for i in range(1, n + 1):',\n", + " '+for i in range(1, n + 2):',\n", + " '-if c != 1:',\n", + " '- t += c * (c - 1) // 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2560717638,\n", + " 'measured_runtime_v1': 0.1275047009,\n", + " 'runtime_lift': 2.0083319433,\n", + " 'key': ['s303506832', 's561375948']},\n", + " {'user_id': 'u047102107',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's941907428',\n", + " 'submission_id_v1': 's244206976',\n", + " 'cpu_time_v0': 181,\n", + " 'cpu_time_v1': 162,\n", + " 'memory_v0': 39920,\n", + " 'memory_v1': 38384,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.5,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\\n\\nA, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\ncost = int(1e10)\\n\\nfor num_ac in range(0, int(1e5) + 1):\\n\\n num_A = max(0, X - num_ac)\\n\\n num_B = max(0, Y - num_ac)\\n\\n c = 2 * C * num_ac + A * num_A + B * num_B\\n\\n cost = min(c, cost)\\n\\nprint(cost)',\n", + " 'target': 'A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\nans = 0\\n\\nif A + B > 2 * C:\\n\\n z = min(X, Y)\\n\\n X -= z\\n\\n Y -= z\\n\\n ans += 2 * z * C\\n\\n\\n\\n# 偏り分\\n\\nif 2 * C < A:\\n\\n k = X\\n\\n X -= k\\n\\n Y -= k\\n\\n ans += 2 * C * k\\n\\nif 2 * C < B:\\n\\n k = Y\\n\\n X -= k\\n\\n Y -= k\\n\\n ans += 2 * C * k\\n\\n\\n\\n# あまり分\\n\\nans += A * max(0, X) + B * max(0, Y)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 283,\n", + " 'code_v1_num_chars': 355,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nA, B, C, X, Y = list(map(int, input().split()))\\ncost = int(1e10)\\nfor num_ac in range(0, int(1e5) + 1):\\n num_A = max(0, X - num_ac)\\n num_B = max(0, Y - num_ac)\\n c = 2 * C * num_ac + A * num_A + B * num_B\\n cost = min(c, cost)\\nprint(cost)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nans = 0\\nif A + B > 2 * C:\\n z = min(X, Y)\\n X -= z\\n Y -= z\\n ans += 2 * z * C\\n# 偏り分\\nif 2 * C < A:\\n k = X\\n X -= k\\n Y -= k\\n ans += 2 * C * k\\nif 2 * C < B:\\n k = Y\\n X -= k\\n Y -= k\\n ans += 2 * C * k\\n# あまり分\\nans += A * max(0, X) + B * max(0, Y)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 54.1666666667,\n", + " 'diff': ['-# -*- coding: utf-8 -*-',\n", + " '-cost = int(1e10)',\n", + " '-for num_ac in range(0, int(1e5) + 1):',\n", + " '- num_A = max(0, X - num_ac)',\n", + " '- num_B = max(0, Y - num_ac)',\n", + " '- c = 2 * C * num_ac + A * num_A + B * num_B',\n", + " '- cost = min(c, cost)',\n", + " '-print(cost)',\n", + " '+ans = 0',\n", + " '+if A + B > 2 * C:',\n", + " '+ z = min(X, Y)',\n", + " '+ X -= z',\n", + " '+ Y -= z',\n", + " '+ ans += 2 * z * C',\n", + " '+# 偏り分',\n", + " '+if 2 * C < A:',\n", + " '+ k = X',\n", + " '+ X -= k',\n", + " '+ Y -= k',\n", + " '+ ans += 2 * C * k',\n", + " '+if 2 * C < B:',\n", + " '+ k = Y',\n", + " '+ X -= k',\n", + " '+ Y -= k',\n", + " '+ ans += 2 * C * k',\n", + " '+# あまり分',\n", + " '+ans += A * max(0, X) + B * max(0, Y)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4463407636,\n", + " 'measured_runtime_v1': 0.1532134106,\n", + " 'runtime_lift': 2.9131964477,\n", + " 'key': ['s941907428', 's244206976']},\n", + " {'user_id': 'u537976628',\n", + " 'problem_id': 'p04044',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's532034645',\n", + " 'submission_id_v1': 's761755032',\n", + " 'cpu_time_v0': 23,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.09,\n", + " 'input': 'N, L = list(map(int, input().split()))\\n\\nS = list(eval(input()) for i in range(N))\\n\\nstr = \"\"\\n\\nfor i in range(N-1):\\n\\n for j in range(N-1):\\n\\n if S[j+1] + S[j] <= S[j] + S[j+1]:\\n\\n S[j], S[j+1] = S[j+1], S[j]\\n\\nfor i in S:\\n\\n str += i\\n\\nprint(str)\\n',\n", + " 'target': 'N, L = list(map(int, input().split()))\\n\\nS = list(eval(input()) for i in range(N))\\n\\nS.sort()\\n\\nstr = \"\"\\n\\nfor i in S:\\n\\n str += i\\n\\nprint(str)\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 252,\n", + " 'code_v1_num_chars': 129,\n", + " 'code_v0_no_empty_lines': 'N, L = list(map(int, input().split()))\\nS = list(eval(input()) for i in range(N))\\nstr = \"\"\\nfor i in range(N - 1):\\n for j in range(N - 1):\\n if S[j + 1] + S[j] <= S[j] + S[j + 1]:\\n S[j], S[j + 1] = S[j + 1], S[j]\\nfor i in S:\\n str += i\\nprint(str)\\n',\n", + " 'code_v1_no_empty_lines': 'N, L = list(map(int, input().split()))\\nS = list(eval(input()) for i in range(N))\\nS.sort()\\nstr = \"\"\\nfor i in S:\\n str += i\\nprint(str)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.0,\n", + " 'diff': ['+S.sort()',\n", + " '-for i in range(N - 1):',\n", + " '- for j in range(N - 1):',\n", + " '- if S[j + 1] + S[j] <= S[j] + S[j + 1]:',\n", + " '- S[j], S[j + 1] = S[j + 1], S[j]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3469125528,\n", + " 'measured_runtime_v1': 0.2633319349,\n", + " 'runtime_lift': 1.317396437,\n", + " 'key': ['s532034645', 's761755032']},\n", + " {'user_id': 'u829796346',\n", + " 'problem_id': 'p02574',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's911286307',\n", + " 'submission_id_v1': 's843819881',\n", + " 'cpu_time_v0': 997,\n", + " 'cpu_time_v1': 462,\n", + " 'memory_v0': 203940,\n", + " 'memory_v1': 203640,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 53.66,\n", + " 'input': '#!/usr/bin/env pypy3\\n\\n# N,M = map(int,sys.stdin.readline().split())\\n\\n# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param\\n\\n# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param\\n\\n# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param\\n\\n# s = sys.stdin.readline().rstrip()\\n\\n# N = int(sys.stdin.readline())\\n\\n# INF = float(\"inf\")\\n\\nimport math,sys\\n\\n\\n\\nn = int(sys.stdin.readline())\\n\\na = tuple(map(int,sys.stdin.readline().split()))\\n\\n#n = int(input())\\n\\n#a = list(map(int,input().split()))\\n\\ng = math.gcd(a[0],a[1])\\n\\nfor i in range(2,n):\\n\\n g = math.gcd(g,a[i])\\n\\nM = max(a)\\n\\nacc = a[0]\\n\\nfor i in range(n):\\n\\n acc = math.gcd(acc,a[i])\\n\\nif acc != 1:\\n\\n print(\"not coprime\")\\n\\n exit()\\n\\n\\n\\nLIMIT=max(a)\\n\\nminPrime = [0]*(LIMIT+1)\\n\\nminPrime[1] = 1\\n\\ndef make():\\n\\n for i in range(2,LIMIT+1):\\n\\n if minPrime[i] == 0:\\n\\n minPrime[i] = i\\n\\n #print(i)\\n\\n for j in range(i+i,LIMIT+1,i):\\n\\n #print(i,j)\\n\\n if minPrime[j] == 0:\\n\\n minPrime[j] = i\\n\\nmake()\\n\\ndef factrial(N):\\n\\n ret = []\\n\\n while minPrime[N] != N:\\n\\n ret.append(minPrime[N])\\n\\n N = N//minPrime[N]\\n\\n if N != 1:\\n\\n ret.append(N)\\n\\n return ret\\n\\n\\n\\njudge = set([])\\n\\npc = True\\n\\n\\n\\npairwise = True\\n\\np = set() #all prime\\n\\n\\n\\nfor e in a:\\n\\n if not pairwise:\\n\\n break\\n\\n asf = set(factrial(e))\\n\\n if judge & asf != set():\\n\\n pc = False\\n\\n # #pairwise = False\\n\\n # print(\"setwise coprime\")\\n\\n # exit(0)\\n\\n judge |= asf\\n\\n# for i in a:\\n\\n# if not pc:\\n\\n# break\\n\\n# asf = set(factrial(i))\\n\\n\\n\\n# if judge & asf != set():\\n\\n# pc = False\\n\\n# judge |= asf\\n\\nif pc:\\n\\n print(\"pairwise coprime\")\\n\\nelif g == 1:\\n\\n print(\"setwise coprime\")\\n\\nelse:\\n\\n print(\"not coprime\")\\n',\n", + " 'target': '#!/usr/bin/env pypy3\\n\\n# N,M = map(int,sys.stdin.readline().split())\\n\\n# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param\\n\\n# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param\\n\\n# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param\\n\\n# s = sys.stdin.readline().rstrip()\\n\\n# N = int(sys.stdin.readline())\\n\\n# INF = float(\"inf\")\\n\\nimport math,sys\\n\\n\\n\\nn = int(sys.stdin.readline())\\n\\na = tuple(map(int,sys.stdin.readline().split()))\\n\\n#n = int(input())\\n\\n#a = list(map(int,input().split()))\\n\\ng = math.gcd(a[0],a[1])\\n\\nfor i in range(2,n):\\n\\n g = math.gcd(g,a[i])\\n\\nM = max(a)\\n\\nacc = a[0]\\n\\nfor i in range(n):\\n\\n acc = math.gcd(acc,a[i])\\n\\nif acc != 1:\\n\\n print(\"not coprime\")\\n\\n exit()\\n\\n\\n\\nLIMIT=max(a)\\n\\nminPrime = [0]*(LIMIT+1)\\n\\nminPrime[1] = 1\\n\\ndef make():\\n\\n for i in range(2,LIMIT+1):\\n\\n if minPrime[i] == 0:\\n\\n minPrime[i] = i\\n\\n #print(i)\\n\\n for j in range(i+i,LIMIT+1,i):\\n\\n #print(i,j)\\n\\n if minPrime[j] == 0:\\n\\n minPrime[j] = i\\n\\nmake()\\n\\ndef factrial(N):\\n\\n ret = []\\n\\n while minPrime[N] != N:\\n\\n ret.append(minPrime[N])\\n\\n N = N//minPrime[N]\\n\\n if N != 1:\\n\\n ret.append(N)\\n\\n return ret\\n\\n\\n\\njudge = set([])\\n\\n\\n\\nfor e in a:\\n\\n asf = set(factrial(e))\\n\\n if judge & asf != set():\\n\\n print(\"setwise coprime\")\\n\\n exit()\\n\\n judge |= asf\\n\\n #judge = judge | asf #too slow\\n\\nprint(\"pairwise coprime\")\\n',\n", + " 'code_v0_loc': 77,\n", + " 'code_v1_loc': 57,\n", + " 'code_v0_num_chars': 1904,\n", + " 'code_v1_num_chars': 1552,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env pypy3\\n# N,M = map(int,sys.stdin.readline().split())\\n# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param\\n# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param\\n# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param\\n# s = sys.stdin.readline().rstrip()\\n# N = int(sys.stdin.readline())\\n# INF = float(\"inf\")\\nimport math, sys\\n\\nn = int(sys.stdin.readline())\\na = tuple(map(int, sys.stdin.readline().split()))\\n# n = int(input())\\n# a = list(map(int,input().split()))\\ng = math.gcd(a[0], a[1])\\nfor i in range(2, n):\\n g = math.gcd(g, a[i])\\nM = max(a)\\nacc = a[0]\\nfor i in range(n):\\n acc = math.gcd(acc, a[i])\\nif acc != 1:\\n print(\"not coprime\")\\n exit()\\nLIMIT = max(a)\\nminPrime = [0] * (LIMIT + 1)\\nminPrime[1] = 1\\n\\n\\ndef make():\\n for i in range(2, LIMIT + 1):\\n if minPrime[i] == 0:\\n minPrime[i] = i\\n # print(i)\\n for j in range(i + i, LIMIT + 1, i):\\n # print(i,j)\\n if minPrime[j] == 0:\\n minPrime[j] = i\\n\\n\\nmake()\\n\\n\\ndef factrial(N):\\n ret = []\\n while minPrime[N] != N:\\n ret.append(minPrime[N])\\n N = N // minPrime[N]\\n if N != 1:\\n ret.append(N)\\n return ret\\n\\n\\njudge = set([])\\npc = True\\npairwise = True\\np = set() # all prime\\nfor e in a:\\n if not pairwise:\\n break\\n asf = set(factrial(e))\\n if judge & asf != set():\\n pc = False\\n # #pairwise = False\\n # print(\"setwise coprime\")\\n # exit(0)\\n judge |= asf\\n# for i in a:\\n# if not pc:\\n# break\\n# asf = set(factrial(i))\\n# if judge & asf != set():\\n# pc = False\\n# judge |= asf\\nif pc:\\n print(\"pairwise coprime\")\\nelif g == 1:\\n print(\"setwise coprime\")\\nelse:\\n print(\"not coprime\")\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env pypy3\\n# N,M = map(int,sys.stdin.readline().split())\\n# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param\\n# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param\\n# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param\\n# s = sys.stdin.readline().rstrip()\\n# N = int(sys.stdin.readline())\\n# INF = float(\"inf\")\\nimport math, sys\\n\\nn = int(sys.stdin.readline())\\na = tuple(map(int, sys.stdin.readline().split()))\\n# n = int(input())\\n# a = list(map(int,input().split()))\\ng = math.gcd(a[0], a[1])\\nfor i in range(2, n):\\n g = math.gcd(g, a[i])\\nM = max(a)\\nacc = a[0]\\nfor i in range(n):\\n acc = math.gcd(acc, a[i])\\nif acc != 1:\\n print(\"not coprime\")\\n exit()\\nLIMIT = max(a)\\nminPrime = [0] * (LIMIT + 1)\\nminPrime[1] = 1\\n\\n\\ndef make():\\n for i in range(2, LIMIT + 1):\\n if minPrime[i] == 0:\\n minPrime[i] = i\\n # print(i)\\n for j in range(i + i, LIMIT + 1, i):\\n # print(i,j)\\n if minPrime[j] == 0:\\n minPrime[j] = i\\n\\n\\nmake()\\n\\n\\ndef factrial(N):\\n ret = []\\n while minPrime[N] != N:\\n ret.append(minPrime[N])\\n N = N // minPrime[N]\\n if N != 1:\\n ret.append(N)\\n return ret\\n\\n\\njudge = set([])\\nfor e in a:\\n asf = set(factrial(e))\\n if judge & asf != set():\\n print(\"setwise coprime\")\\n exit()\\n judge |= asf\\n # judge = judge | asf #too slow\\nprint(\"pairwise coprime\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.974025974,\n", + " 'diff': ['-pc = True',\n", + " '-pairwise = True',\n", + " '-p = set() # all prime',\n", + " '- if not pairwise:',\n", + " '- break',\n", + " '- pc = False',\n", + " '- # #pairwise = False',\n", + " '- # print(\"setwise coprime\")',\n", + " '- # exit(0)',\n", + " '+ print(\"setwise coprime\")',\n", + " '+ exit()',\n", + " '-# for i in a:',\n", + " '-# if not pc:',\n", + " '-# break',\n", + " '-# asf = set(factrial(i))',\n", + " '-# if judge & asf != set():',\n", + " '-# pc = False',\n", + " '-# judge |= asf',\n", + " '-if pc:',\n", + " '- print(\"pairwise coprime\")',\n", + " '-elif g == 1:',\n", + " '- print(\"setwise coprime\")',\n", + " '-else:',\n", + " '- print(\"not coprime\")',\n", + " '+ # judge = judge | asf #too slow',\n", + " '+print(\"pairwise coprime\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1574707303,\n", + " 'measured_runtime_v1': 0.0059050472,\n", + " 'runtime_lift': 26.6671417322,\n", + " 'key': ['s911286307', 's843819881']},\n", + " {'user_id': 'u488401358',\n", + " 'problem_id': 'p02649',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's231020544',\n", + " 'submission_id_v1': 's831601953',\n", + " 'cpu_time_v0': 688,\n", + " 'cpu_time_v1': 413,\n", + " 'memory_v0': 76468,\n", + " 'memory_v1': 102912,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.97,\n", + " 'input': 'def popcount(x):\\n\\n x = x - ((x >> 1) & 0x55555555)\\n\\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\\n\\n x = (x + (x >> 4)) & 0x0f0f0f0f\\n\\n x = x + (x >> 8)\\n\\n x = x + (x >> 16)\\n\\n return x & 0x0000007f\\n\\n\\n\\ncmb=[[0 for i in range(51)] for j in range(51)]\\n\\ncmb[0][0]=1\\n\\nfor i in range(51):\\n\\n for j in range(51):\\n\\n if i!=50 and j!=50:\\n\\n cmb[i+1][j+1]+=cmb[i][j]\\n\\n if i!=50:\\n\\n cmb[i+1][j]+=cmb[i][j]\\n\\n\\n\\nfor i in range(1,51):\\n\\n for j in range(2,51):\\n\\n cmb[i][j]+=cmb[i][j-1]\\n\\n\\n\\nN,K,T,S=list(map(int,input().split()))\\n\\na=list(map(int,input().split()))\\n\\n\\n\\nmust0=[i for i in range(18) if S>>i &1==0]\\n\\nmust1=[i for i in range(18) if T>>i &1==1]\\n\\n\\n\\nA=[]\\n\\nfor val in a:\\n\\n check=True\\n\\n for j in must0:\\n\\n check=check&(val>>j &1==0)\\n\\n for j in must1:\\n\\n check=check&(val>>j &1==1)\\n\\n if check:\\n\\n A.append(val)\\n\\n\\n\\nif not A:\\n\\n print((0))\\n\\n exit()\\n\\n\\n\\nbit=[]\\n\\nfor i in range(18):\\n\\n if i not in must0 and i not in must1:\\n\\n bit.append(i)\\n\\n\\n\\nfor i in range(len(A)):\\n\\n temp=0\\n\\n for j in range(len(bit)):\\n\\n temp+=(A[i]>>bit[j] &1==1)*2**j\\n\\n A[i]=temp\\n\\n\\n\\nans=0\\n\\nn=len(bit)\\n\\ndata=[0]*(2**n)\\n\\nfor i in range(2**n):\\n\\n t=set([])\\n\\n for a in A:\\n\\n data[a&i]+=1\\n\\n t.add(a&i)\\n\\n temp=0\\n\\n for val in t:\\n\\n temp+=cmb[data[val]][min(K,data[val])]\\n\\n ans+=temp*(-1)**popcount(i)\\n\\n for val in t:\\n\\n data[val]=0\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'def popcount(x):\\n\\n x = x - ((x >> 1) & 0x55555555)\\n\\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\\n\\n x = (x + (x >> 4)) & 0x0f0f0f0f\\n\\n x = x + (x >> 8)\\n\\n x = x + (x >> 16)\\n\\n return x & 0x0000007f\\n\\n\\n\\ncmb=[[0 for i in range(51)] for j in range(51)]\\n\\ncmb[0][0]=1\\n\\nfor i in range(51):\\n\\n for j in range(51):\\n\\n if i!=50:\\n\\n cmb[i+1][j]+=cmb[i][j]\\n\\n if j!=50 and i!=50:\\n\\n cmb[i+1][j+1]+=cmb[i][j]\\n\\n\\n\\n\\n\\nfor i in range(1,51):\\n\\n for j in range(2,51):\\n\\n cmb[i][j]+=cmb[i][j-1]\\n\\n\\n\\nimport random\\n\\nN,K,T,S=list(map(int,input().split()))\\n\\na=list(map(int,input().split()))\\n\\n\\n\\nmust0=[i for i in range(18) if S>>i &1==0]\\n\\nmust1=[i for i in range(18) if T>>i &1==1]\\n\\n\\n\\nA=[]\\n\\nfor val in a:\\n\\n check=True\\n\\n for j in must0:\\n\\n check=check&(val>>j &1==0)\\n\\n for j in must1:\\n\\n check=check&(val>>j &1==1)\\n\\n if check:\\n\\n A.append(val)\\n\\n\\n\\nif not A:\\n\\n print((0))\\n\\n exit()\\n\\n\\n\\nbit=[]\\n\\nfor i in range(18):\\n\\n if i not in must0 and i not in must1:\\n\\n bit.append(i)\\n\\n\\n\\nfor i in range(len(A)):\\n\\n temp=0\\n\\n for j in range(len(bit)):\\n\\n temp+=(A[i]>>bit[j] &1==1)*2**j\\n\\n A[i]=temp\\n\\n\\n\\nans=0\\n\\nn=len(bit)\\n\\ndata=[0]*(2**n)\\n\\npc=[popcount(i) for i in range(2**n)]\\n\\nfor i in range(2**n):\\n\\n for a in A:\\n\\n data[a&i]+=1\\n\\n for a in A:\\n\\n if data[a&i]:\\n\\n ans+=cmb[data[a&i]][min(K,data[a&i])]*(-1)**pc[i]\\n\\n data[a&i]=0\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 68,\n", + " 'code_v1_loc': 67,\n", + " 'code_v0_num_chars': 1445,\n", + " 'code_v1_num_chars': 1441,\n", + " 'code_v0_no_empty_lines': 'def popcount(x):\\n x = x - ((x >> 1) & 0x55555555)\\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\\n x = (x + (x >> 4)) & 0x0F0F0F0F\\n x = x + (x >> 8)\\n x = x + (x >> 16)\\n return x & 0x0000007F\\n\\n\\ncmb = [[0 for i in range(51)] for j in range(51)]\\ncmb[0][0] = 1\\nfor i in range(51):\\n for j in range(51):\\n if i != 50 and j != 50:\\n cmb[i + 1][j + 1] += cmb[i][j]\\n if i != 50:\\n cmb[i + 1][j] += cmb[i][j]\\nfor i in range(1, 51):\\n for j in range(2, 51):\\n cmb[i][j] += cmb[i][j - 1]\\nN, K, T, S = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nmust0 = [i for i in range(18) if S >> i & 1 == 0]\\nmust1 = [i for i in range(18) if T >> i & 1 == 1]\\nA = []\\nfor val in a:\\n check = True\\n for j in must0:\\n check = check & (val >> j & 1 == 0)\\n for j in must1:\\n check = check & (val >> j & 1 == 1)\\n if check:\\n A.append(val)\\nif not A:\\n print((0))\\n exit()\\nbit = []\\nfor i in range(18):\\n if i not in must0 and i not in must1:\\n bit.append(i)\\nfor i in range(len(A)):\\n temp = 0\\n for j in range(len(bit)):\\n temp += (A[i] >> bit[j] & 1 == 1) * 2**j\\n A[i] = temp\\nans = 0\\nn = len(bit)\\ndata = [0] * (2**n)\\nfor i in range(2**n):\\n t = set([])\\n for a in A:\\n data[a & i] += 1\\n t.add(a & i)\\n temp = 0\\n for val in t:\\n temp += cmb[data[val]][min(K, data[val])]\\n ans += temp * (-1) ** popcount(i)\\n for val in t:\\n data[val] = 0\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def popcount(x):\\n x = x - ((x >> 1) & 0x55555555)\\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\\n x = (x + (x >> 4)) & 0x0F0F0F0F\\n x = x + (x >> 8)\\n x = x + (x >> 16)\\n return x & 0x0000007F\\n\\n\\ncmb = [[0 for i in range(51)] for j in range(51)]\\ncmb[0][0] = 1\\nfor i in range(51):\\n for j in range(51):\\n if i != 50:\\n cmb[i + 1][j] += cmb[i][j]\\n if j != 50 and i != 50:\\n cmb[i + 1][j + 1] += cmb[i][j]\\nfor i in range(1, 51):\\n for j in range(2, 51):\\n cmb[i][j] += cmb[i][j - 1]\\nimport random\\n\\nN, K, T, S = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nmust0 = [i for i in range(18) if S >> i & 1 == 0]\\nmust1 = [i for i in range(18) if T >> i & 1 == 1]\\nA = []\\nfor val in a:\\n check = True\\n for j in must0:\\n check = check & (val >> j & 1 == 0)\\n for j in must1:\\n check = check & (val >> j & 1 == 1)\\n if check:\\n A.append(val)\\nif not A:\\n print((0))\\n exit()\\nbit = []\\nfor i in range(18):\\n if i not in must0 and i not in must1:\\n bit.append(i)\\nfor i in range(len(A)):\\n temp = 0\\n for j in range(len(bit)):\\n temp += (A[i] >> bit[j] & 1 == 1) * 2**j\\n A[i] = temp\\nans = 0\\nn = len(bit)\\ndata = [0] * (2**n)\\npc = [popcount(i) for i in range(2**n)]\\nfor i in range(2**n):\\n for a in A:\\n data[a & i] += 1\\n for a in A:\\n if data[a & i]:\\n ans += cmb[data[a & i]][min(K, data[a & i])] * (-1) ** pc[i]\\n data[a & i] = 0\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 1.4705882353,\n", + " 'diff': ['- if i != 50 and j != 50:',\n", + " '- cmb[i + 1][j + 1] += cmb[i][j]',\n", + " '+ if j != 50 and i != 50:',\n", + " '+ cmb[i + 1][j + 1] += cmb[i][j]',\n", + " '+import random',\n", + " '+',\n", + " '+pc = [popcount(i) for i in range(2**n)]',\n", + " '- t = set([])',\n", + " '- t.add(a & i)',\n", + " '- temp = 0',\n", + " '- for val in t:',\n", + " '- temp += cmb[data[val]][min(K, data[val])]',\n", + " '- ans += temp * (-1) ** popcount(i)',\n", + " '- for val in t:',\n", + " '- data[val] = 0',\n", + " '+ for a in A:',\n", + " '+ if data[a & i]:',\n", + " '+ ans += cmb[data[a & i]][min(K, data[a & i])] * (-1) ** pc[i]',\n", + " '+ data[a & i] = 0'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3163019059,\n", + " 'measured_runtime_v1': 0.2340069544,\n", + " 'runtime_lift': 1.3516773748,\n", + " 'key': ['s231020544', 's831601953']},\n", + " {'user_id': 'u357751375',\n", + " 'problem_id': 'p04012',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's590976745',\n", + " 'submission_id_v1': 's361487799',\n", + " 'cpu_time_v0': 31,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 9044,\n", + " 'memory_v1': 9092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.13,\n", + " 'input': \"w = eval(input())\\n\\ny = list(set(w))\\n\\n\\n\\nfor i in range(len(y)):\\n\\n if w.count(y[i]) % 2 != 0:\\n\\n print('No')\\n\\n exit(0)\\n\\n\\n\\nprint('Yes')\",\n", + " 'target': \"w = list(eval(input()))\\n\\nx = list(set(w))\\n\\nfor i in x:\\n\\n y = w.count(i)\\n\\n if y % 2 != 0:\\n\\n print('No')\\n\\n exit(0)\\n\\nprint('Yes')\",\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 142,\n", + " 'code_v1_num_chars': 140,\n", + " 'code_v0_no_empty_lines': 'w = eval(input())\\ny = list(set(w))\\nfor i in range(len(y)):\\n if w.count(y[i]) % 2 != 0:\\n print(\"No\")\\n exit(0)\\nprint(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'w = list(eval(input()))\\nx = list(set(w))\\nfor i in x:\\n y = w.count(i)\\n if y % 2 != 0:\\n print(\"No\")\\n exit(0)\\nprint(\"Yes\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-w = eval(input())',\n", + " '-y = list(set(w))',\n", + " '-for i in range(len(y)):',\n", + " '- if w.count(y[i]) % 2 != 0:',\n", + " '+w = list(eval(input()))',\n", + " '+x = list(set(w))',\n", + " '+for i in x:',\n", + " '+ y = w.count(i)',\n", + " '+ if y % 2 != 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2480834422,\n", + " 'measured_runtime_v1': 0.172200387,\n", + " 'runtime_lift': 1.4406671583,\n", + " 'key': ['s590976745', 's361487799']},\n", + " {'user_id': 'u867069435',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's169961096',\n", + " 'submission_id_v1': 's264260313',\n", + " 'cpu_time_v0': 335,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 20580,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 94.93,\n", + " 'input': 'import numpy as np\\n\\nn = int(eval(input()))\\n\\nballs = np.array(list(map(int, input().split())))\\n\\ntime = 0\\n\\nwhile np.all(balls % 2 == 0) and np.all(balls > 0):\\n\\n time += 1\\n\\n balls = balls / 2\\n\\nprint(time)',\n", + " 'target': 'import math\\n\\nn = eval(input())\\n\\na = list(map(int, input().split()))\\n\\nans = float(\"inf\")\\n\\nfor i in a:\\n\\n ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1)\\n\\nprint((round(ans)))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 201,\n", + " 'code_v1_num_chars': 170,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nballs = np.array(list(map(int, input().split())))\\ntime = 0\\nwhile np.all(balls % 2 == 0) and np.all(balls > 0):\\n time += 1\\n balls = balls / 2\\nprint(time)\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nn = eval(input())\\na = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in a:\\n ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1)\\nprint((round(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-import numpy as np',\n", + " '+import math',\n", + " '-n = int(eval(input()))',\n", + " '-balls = np.array(list(map(int, input().split())))',\n", + " '-time = 0',\n", + " '-while np.all(balls % 2 == 0) and np.all(balls > 0):',\n", + " '- time += 1',\n", + " '- balls = balls / 2',\n", + " '-print(time)',\n", + " '+n = eval(input())',\n", + " '+a = list(map(int, input().split()))',\n", + " '+ans = float(\"inf\")',\n", + " '+for i in a:',\n", + " '+ ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1)',\n", + " '+print((round(ans)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3781843102,\n", + " 'measured_runtime_v1': 0.2403370705,\n", + " 'runtime_lift': 5.7343809154,\n", + " 'key': ['s169961096', 's264260313']},\n", + " {'user_id': 'u759934006',\n", + " 'problem_id': 'p00174',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's437122774',\n", + " 'submission_id_v1': 's723923476',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 4228,\n", + " 'memory_v1': 4232,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': \"while True:\\n\\n try:\\n\\n for i in range(3):\\n\\n line = input().strip()\\n\\n if line == '0':\\n\\n raise Exception\\n\\n\\n\\n a = b = 0\\n\\n for i, s in enumerate(line):\\n\\n if i != 0:\\n\\n if s == 'A':\\n\\n a += 1\\n\\n else:\\n\\n b += 1\\n\\n if a > b:\\n\\n a += 1\\n\\n else:\\n\\n b += 1\\n\\n print(a, b)\\n\\n\\n\\n except:\\n\\n break\",\n", + " 'target': \"while True:\\n\\n try:\\n\\n for i in range(3):\\n\\n line = input().strip()\\n\\n if line == '0':\\n\\n raise Exception\\n\\n\\n\\n if line[0] == 'A':\\n\\n a = -1\\n\\n b = 0\\n\\n else:\\n\\n a = 0\\n\\n b = -1\\n\\n for i, s in enumerate(line):\\n\\n if s == 'A':\\n\\n a += 1\\n\\n else:\\n\\n b += 1\\n\\n if a > b:\\n\\n a += 1\\n\\n else:\\n\\n b += 1\\n\\n print(a, b)\\n\\n\\n\\n except:\\n\\n break\",\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 515,\n", + " 'code_v1_num_chars': 593,\n", + " 'code_v0_no_empty_lines': 'while True:\\n try:\\n for i in range(3):\\n line = input().strip()\\n if line == \"0\":\\n raise Exception\\n a = b = 0\\n for i, s in enumerate(line):\\n if i != 0:\\n if s == \"A\":\\n a += 1\\n else:\\n b += 1\\n if a > b:\\n a += 1\\n else:\\n b += 1\\n print(a, b)\\n except:\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'while True:\\n try:\\n for i in range(3):\\n line = input().strip()\\n if line == \"0\":\\n raise Exception\\n if line[0] == \"A\":\\n a = -1\\n b = 0\\n else:\\n a = 0\\n b = -1\\n for i, s in enumerate(line):\\n if s == \"A\":\\n a += 1\\n else:\\n b += 1\\n if a > b:\\n a += 1\\n else:\\n b += 1\\n print(a, b)\\n except:\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['- a = b = 0',\n", + " '+ if line[0] == \"A\":',\n", + " '+ a = -1',\n", + " '+ b = 0',\n", + " '+ else:',\n", + " '+ a = 0',\n", + " '+ b = -1',\n", + " '- if i != 0:',\n", + " '- if s == \"A\":',\n", + " '- a += 1',\n", + " '- else:',\n", + " '- b += 1',\n", + " '+ if s == \"A\":',\n", + " '+ a += 1',\n", + " '+ else:',\n", + " '+ b += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1803158569,\n", + " 'measured_runtime_v1': 0.0065688469,\n", + " 'runtime_lift': 27.4501534712,\n", + " 'key': ['s437122774', 's723923476']},\n", + " {'user_id': 'u579699847',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's394430512',\n", + " 'submission_id_v1': 's562354145',\n", + " 'cpu_time_v0': 152,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12500,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.16,\n", + " 'input': 'import numpy\\n\\nN, D = list(map(int, input().split()))\\n\\nlistx = []\\n\\ncount = 0\\n\\nfor i in range(N):\\n\\n x = list(map(int, input().split()))\\n\\n listx.append(x)\\n\\n\\n\\nfor j in range(0, N):\\n\\n for k in range(j+1,N):\\n\\n a = numpy.array(listx[j])\\n\\n b = numpy.array(listx[k])\\n\\n u = b - a\\n\\n c = float(numpy.linalg.norm(u))\\n\\n if c.is_integer() :\\n\\n count += 1\\n\\nprint(count)',\n", + " 'target': 'def LI(): return list(map(int,input().split()))\\n\\nN,D = LI()\\n\\nX = [LI() for _ in range(N)]\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n for j in range(i+1,N):\\n\\n temp = 0\\n\\n for k in range(D):\\n\\n temp += (X[j][k]-X[i][k])**2\\n\\n if temp **0.5%1==0:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 401,\n", + " 'code_v1_num_chars': 297,\n", + " 'code_v0_no_empty_lines': 'import numpy\\n\\nN, D = list(map(int, input().split()))\\nlistx = []\\ncount = 0\\nfor i in range(N):\\n x = list(map(int, input().split()))\\n listx.append(x)\\nfor j in range(0, N):\\n for k in range(j + 1, N):\\n a = numpy.array(listx[j])\\n b = numpy.array(listx[k])\\n u = b - a\\n c = float(numpy.linalg.norm(u))\\n if c.is_integer():\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'def LI():\\n return list(map(int, input().split()))\\n\\n\\nN, D = LI()\\nX = [LI() for _ in range(N)]\\nans = 0\\nfor i in range(N):\\n for j in range(i + 1, N):\\n temp = 0\\n for k in range(D):\\n temp += (X[j][k] - X[i][k]) ** 2\\n if temp**0.5 % 1 == 0:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 29.4117647059,\n", + " 'diff': ['-import numpy',\n", + " '+def LI():',\n", + " '+ return list(map(int, input().split()))',\n", + " '-N, D = list(map(int, input().split()))',\n", + " '-listx = []',\n", + " '-count = 0',\n", + " '+',\n", + " '+N, D = LI()',\n", + " '+X = [LI() for _ in range(N)]',\n", + " '+ans = 0',\n", + " '- x = list(map(int, input().split()))',\n", + " '- listx.append(x)',\n", + " '-for j in range(0, N):',\n", + " '- for k in range(j + 1, N):',\n", + " '- a = numpy.array(listx[j])',\n", + " '- b = numpy.array(listx[k])',\n", + " '- u = b - a',\n", + " '- c = float(numpy.linalg.norm(u))',\n", + " '- if c.is_integer():',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+ for j in range(i + 1, N):',\n", + " '+ temp = 0',\n", + " '+ for k in range(D):',\n", + " '+ temp += (X[j][k] - X[i][k]) ** 2',\n", + " '+ if temp**0.5 % 1 == 0:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.65457302,\n", + " 'measured_runtime_v1': 0.2349083569,\n", + " 'runtime_lift': 7.0434830064,\n", + " 'key': ['s394430512', 's562354145']},\n", + " {'user_id': 'u797106134',\n", + " 'problem_id': 'p02880',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's138475257',\n", + " 'submission_id_v1': 's540944662',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 12484,\n", + " 'memory_v1': 9040,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.67,\n", + " 'input': \"N = int(eval(input()))\\n\\n# N>81のときはn*nで表せないので不敵\\n\\nif N>81:\\n\\n print('No')\\n\\nelse:\\n\\n import numpy as np\\n\\n n=np.array([1,2,3,4,5,6,7,8,9])\\n\\n amari=N%n\\n\\n shou=N//n\\n\\n if np.any((amari==0)*(shou<=9)):\\n\\n print('Yes')\\n\\n else:\\n\\n print('No')\\n\",\n", + " 'target': \"N = int(eval(input()))\\n\\nfor i in range(1,10):\\n\\n if not N%i == 0:\\n\\n continue\\n\\n rest = N/i\\n\\n if rest<10:\\n\\n print('Yes')\\n\\n exit()\\n\\n\\n\\nprint('No')\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 258,\n", + " 'code_v1_num_chars': 165,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\n# N>81のときはn*nで表せないので不敵\\nif N > 81:\\n print(\"No\")\\nelse:\\n import numpy as np\\n\\n n = np.array([1, 2, 3, 4, 5, 6, 7, 8, 9])\\n amari = N % n\\n shou = N // n\\n if np.any((amari == 0) * (shou <= 9)):\\n print(\"Yes\")\\n else:\\n print(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nfor i in range(1, 10):\\n if not N % i == 0:\\n continue\\n rest = N / i\\n if rest < 10:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-# N>81のときはn*nで表せないので不敵',\n", + " '-if N > 81:',\n", + " '- print(\"No\")',\n", + " '-else:',\n", + " '- import numpy as np',\n", + " '-',\n", + " '- n = np.array([1, 2, 3, 4, 5, 6, 7, 8, 9])',\n", + " '- amari = N % n',\n", + " '- shou = N // n',\n", + " '- if np.any((amari == 0) * (shou <= 9)):',\n", + " '+for i in range(1, 10):',\n", + " '+ if not N % i == 0:',\n", + " '+ continue',\n", + " '+ rest = N / i',\n", + " '+ if rest < 10:',\n", + " '- else:',\n", + " '- print(\"No\")',\n", + " '+ exit()',\n", + " '+print(\"No\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2369615827,\n", + " 'measured_runtime_v1': 0.1891755185,\n", + " 'runtime_lift': 6.5386979897,\n", + " 'key': ['s138475257', 's540944662']},\n", + " {'user_id': 'u864197622',\n", + " 'problem_id': 'p02758',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's598598719',\n", + " 'submission_id_v1': 's066197035',\n", + " 'cpu_time_v0': 1348,\n", + " 'cpu_time_v1': 954,\n", + " 'memory_v0': 102564,\n", + " 'memory_v1': 97192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 29.23,\n", + " 'input': 'mod = 998244353\\n\\nN = int(eval(input()))\\n\\nX = []\\n\\nfor _ in range(N):\\n\\n x, d = list(map(int, input().split()))\\n\\n X.append((x, x + d))\\n\\n\\n\\nX = sorted(X, key = lambda x: x[0])\\n\\nL = [(0, -(10**9+1), 10**9+1)]\\n\\nP = [-1] * (N+1)\\n\\nfor i, (x, y) in enumerate(X):\\n\\n while L[-1][2] <= y:\\n\\n if L[-1][2] > x and P[i+1] < 0:\\n\\n P[i+1] = L[-1][0]\\n\\n L.pop()\\n\\n if P[i+1] < 0:\\n\\n P[i+1] = L[-1][0]\\n\\n L.append((i+1, x, y))\\n\\n\\n\\nC = [[] for _ in range(N+1)]\\n\\nfor i, p in enumerate(P):\\n\\n if p >= 0:\\n\\n C[p].append(i)\\n\\n\\n\\nY = [1] * (N+1)\\n\\nfor i in range(N+1)[::-1]:\\n\\n s = 1\\n\\n for j in C[i]:\\n\\n s = s * (Y[j] + 1) % mod\\n\\n Y[i] = s\\n\\n\\n\\nprint((Y[0]))',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nmod = 998244353\\n\\nN = int(eval(input()))\\n\\nX = []\\n\\nfor _ in range(N):\\n\\n x, d = list(map(int, input().split()))\\n\\n X.append((x, x + d))\\n\\n\\n\\nX = sorted(X, key = lambda x: x[0])\\n\\nL = [(0, -(10**9+1), 10**9+1)]\\n\\nP = [-1] * (N+1)\\n\\nfor i, (x, y) in enumerate(X):\\n\\n while L[-1][2] <= y:\\n\\n if L[-1][2] > x and P[i+1] < 0:\\n\\n P[i+1] = L[-1][0]\\n\\n L.pop()\\n\\n if P[i+1] < 0:\\n\\n P[i+1] = L[-1][0]\\n\\n L.append((i+1, x, y))\\n\\n\\n\\nC = [[] for _ in range(N+1)]\\n\\nfor i, p in enumerate(P):\\n\\n if p >= 0:\\n\\n C[p].append(i)\\n\\n\\n\\nY = [1] * (N+1)\\n\\nfor i in range(N+1)[::-1]:\\n\\n s = 1\\n\\n for j in C[i]:\\n\\n s = s * (Y[j] + 1) % mod\\n\\n Y[i] = s\\n\\n\\n\\nprint((Y[0]))',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 35,\n", + " 'code_v0_num_chars': 675,\n", + " 'code_v1_num_chars': 717,\n", + " 'code_v0_no_empty_lines': 'mod = 998244353\\nN = int(eval(input()))\\nX = []\\nfor _ in range(N):\\n x, d = list(map(int, input().split()))\\n X.append((x, x + d))\\nX = sorted(X, key=lambda x: x[0])\\nL = [(0, -(10**9 + 1), 10**9 + 1)]\\nP = [-1] * (N + 1)\\nfor i, (x, y) in enumerate(X):\\n while L[-1][2] <= y:\\n if L[-1][2] > x and P[i + 1] < 0:\\n P[i + 1] = L[-1][0]\\n L.pop()\\n if P[i + 1] < 0:\\n P[i + 1] = L[-1][0]\\n L.append((i + 1, x, y))\\nC = [[] for _ in range(N + 1)]\\nfor i, p in enumerate(P):\\n if p >= 0:\\n C[p].append(i)\\nY = [1] * (N + 1)\\nfor i in range(N + 1)[::-1]:\\n s = 1\\n for j in C[i]:\\n s = s * (Y[j] + 1) % mod\\n Y[i] = s\\nprint((Y[0]))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nmod = 998244353\\nN = int(eval(input()))\\nX = []\\nfor _ in range(N):\\n x, d = list(map(int, input().split()))\\n X.append((x, x + d))\\nX = sorted(X, key=lambda x: x[0])\\nL = [(0, -(10**9 + 1), 10**9 + 1)]\\nP = [-1] * (N + 1)\\nfor i, (x, y) in enumerate(X):\\n while L[-1][2] <= y:\\n if L[-1][2] > x and P[i + 1] < 0:\\n P[i + 1] = L[-1][0]\\n L.pop()\\n if P[i + 1] < 0:\\n P[i + 1] = L[-1][0]\\n L.append((i + 1, x, y))\\nC = [[] for _ in range(N + 1)]\\nfor i, p in enumerate(P):\\n if p >= 0:\\n C[p].append(i)\\nY = [1] * (N + 1)\\nfor i in range(N + 1)[::-1]:\\n s = 1\\n for j in C[i]:\\n s = s * (Y[j] + 1) % mod\\n Y[i] = s\\nprint((Y[0]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.5714285714,\n", + " 'diff': ['+import sys', '+', '+input = sys.stdin.readline'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2547301891,\n", + " 'measured_runtime_v1': 0.0065454967,\n", + " 'runtime_lift': 38.9168615134,\n", + " 'key': ['s598598719', 's066197035']},\n", + " {'user_id': 'u408260374',\n", + " 'problem_id': 'p00744',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's226218538',\n", + " 'submission_id_v1': 's459214194',\n", + " 'cpu_time_v0': 30250,\n", + " 'cpu_time_v1': 21820,\n", + " 'memory_v0': 106708,\n", + " 'memory_v1': 188428,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.87,\n", + " 'input': 'import collections\\n\\nimport math\\n\\n\\n\\n\\n\\nclass Dinic:\\n\\n \"\"\"Dinic Algorithm: find max-flow\\n\\n complexity: O(EV^2)\\n\\n used in GRL6A(AOJ)\\n\\n \"\"\"\\n\\n class edge:\\n\\n def __init__(self, to, cap, rev):\\n\\n self.to, self.cap, self.rev = to, cap, rev\\n\\n\\n\\n def __init__(self, V, E, source, sink):\\n\\n \"\"\" V: the number of vertexes\\n\\n E: adjacency list\\n\\n source: start point\\n\\n sink: goal point\\n\\n \"\"\"\\n\\n self.V = V\\n\\n self.E = [[] for _ in range(V)]\\n\\n for fr in range(V):\\n\\n for to, cap in E[fr]:\\n\\n self.E[fr].append(self.edge(to, cap, len(self.E[to])))\\n\\n self.E[to].append(self.edge(fr, 0, len(self.E[fr])-1))\\n\\n self.maxflow = self.dinic(source, sink)\\n\\n\\n\\n def dinic(self, source, sink):\\n\\n \"\"\"find max-flow\"\"\"\\n\\n INF = float(\\'inf\\')\\n\\n maxflow = 0\\n\\n while True:\\n\\n self.bfs(source)\\n\\n if self.level[sink] < 0:\\n\\n return maxflow\\n\\n self.itr = [0] * self.V\\n\\n while True:\\n\\n flow = self.dfs(source, sink, INF)\\n\\n if flow > 0:\\n\\n maxflow += flow\\n\\n else:\\n\\n break\\n\\n\\n\\n def dfs(self, vertex, sink, flow):\\n\\n \"\"\"find augmenting path\"\"\"\\n\\n if vertex == sink:\\n\\n return flow\\n\\n for i in range(self.itr[vertex], len(self.E[vertex])):\\n\\n self.itr[vertex] = i\\n\\n e = self.E[vertex][i]\\n\\n if e.cap > 0 and self.level[vertex] < self.level[e.to]:\\n\\n d = self.dfs(e.to, sink, min(flow, e.cap))\\n\\n if d > 0:\\n\\n e.cap -= d\\n\\n self.E[e.to][e.rev].cap += d\\n\\n return d\\n\\n return 0\\n\\n\\n\\n def bfs(self, start):\\n\\n \"\"\"find shortest path from start\"\"\"\\n\\n que = collections.deque()\\n\\n self.level = [-1] * self.V\\n\\n que.append(start)\\n\\n self.level[start] = 0\\n\\n\\n\\n while que:\\n\\n fr = que.popleft()\\n\\n for e in self.E[fr]:\\n\\n if e.cap > 0 and self.level[e.to] < 0:\\n\\n self.level[e.to] = self.level[fr] + 1\\n\\n que.append(e.to)\\n\\n\\n\\nwhile True:\\n\\n M, N = list(map(int, input().split()))\\n\\n if M == 0 and N == 0:\\n\\n break\\n\\n blue, red = [], []\\n\\n while True:\\n\\n for x in input().split():\\n\\n blue.append(int(x))\\n\\n if len(blue) == M:\\n\\n break\\n\\n while True:\\n\\n for x in input().split():\\n\\n red.append(int(x))\\n\\n if len(red) == N:\\n\\n break\\n\\n V = M + N + 2\\n\\n edge = [set() for _ in range(V)]\\n\\n for i, b in enumerate(blue):\\n\\n if b != 1:\\n\\n for j, r in enumerate(red):\\n\\n if r % b == 0:\\n\\n edge[i].add((M+j, 1))\\n\\n for j in range(2, int(math.sqrt(b)) + 1):\\n\\n if b % j == 0:\\n\\n for k, r in enumerate(red):\\n\\n if r % j == 0 or r % (b // j) == 0:\\n\\n edge[i].add((M+k, 1))\\n\\n for i in range(M):\\n\\n edge[M+N].add((i, 1))\\n\\n for j in range(N):\\n\\n edge[M+j].add((M+N+1, 1))\\n\\n d = Dinic(V, edge, M+N, M+N+1)\\n\\n print((d.maxflow))',\n", + " 'target': 'import collections\\n\\nimport math\\n\\nrange = xrange; input = raw_input\\n\\n\\n\\n\\n\\nclass Dinic:\\n\\n \"\"\"Dinic Algorithm: find max-flow\\n\\n complexity: O(EV^2)\\n\\n used in GRL6A(AOJ)\\n\\n \"\"\"\\n\\n class edge:\\n\\n def __init__(self, to, cap, rev):\\n\\n self.to, self.cap, self.rev = to, cap, rev\\n\\n\\n\\n def __init__(self, V, E, source, sink):\\n\\n \"\"\" V: the number of vertexes\\n\\n E: adjacency list\\n\\n source: start point\\n\\n sink: goal point\\n\\n \"\"\"\\n\\n self.V = V\\n\\n self.E = [[] for _ in range(V)]\\n\\n for fr in range(V):\\n\\n for to, cap in E[fr]:\\n\\n self.E[fr].append(self.edge(to, cap, len(self.E[to])))\\n\\n self.E[to].append(self.edge(fr, 0, len(self.E[fr])-1))\\n\\n self.maxflow = self.dinic(source, sink)\\n\\n\\n\\n def dinic(self, source, sink):\\n\\n \"\"\"find max-flow\"\"\"\\n\\n INF = float(\\'inf\\')\\n\\n maxflow = 0\\n\\n while True:\\n\\n self.bfs(source)\\n\\n if self.level[sink] < 0:\\n\\n return maxflow\\n\\n self.itr = [0] * self.V\\n\\n while True:\\n\\n flow = self.dfs(source, sink, INF)\\n\\n if flow > 0:\\n\\n maxflow += flow\\n\\n else:\\n\\n break\\n\\n\\n\\n def dfs(self, vertex, sink, flow):\\n\\n \"\"\"find augmenting path\"\"\"\\n\\n if vertex == sink:\\n\\n return flow\\n\\n for i in range(self.itr[vertex], len(self.E[vertex])):\\n\\n self.itr[vertex] = i\\n\\n e = self.E[vertex][i]\\n\\n if e.cap > 0 and self.level[vertex] < self.level[e.to]:\\n\\n d = self.dfs(e.to, sink, min(flow, e.cap))\\n\\n if d > 0:\\n\\n e.cap -= d\\n\\n self.E[e.to][e.rev].cap += d\\n\\n return d\\n\\n return 0\\n\\n\\n\\n def bfs(self, start):\\n\\n \"\"\"find shortest path from start\"\"\"\\n\\n que = collections.deque()\\n\\n self.level = [-1] * self.V\\n\\n que.append(start)\\n\\n self.level[start] = 0\\n\\n\\n\\n while que:\\n\\n fr = que.popleft()\\n\\n for e in self.E[fr]:\\n\\n if e.cap > 0 and self.level[e.to] < 0:\\n\\n self.level[e.to] = self.level[fr] + 1\\n\\n que.append(e.to)\\n\\n\\n\\nwhile True:\\n\\n M, N = list(map(int, input().split()))\\n\\n if M == 0 and N == 0:\\n\\n break\\n\\n blue, red = [], []\\n\\n while True:\\n\\n for x in input().split():\\n\\n blue.append(int(x))\\n\\n if len(blue) == M:\\n\\n break\\n\\n while True:\\n\\n for x in input().split():\\n\\n red.append(int(x))\\n\\n if len(red) == N:\\n\\n break\\n\\n V = M + N + 2\\n\\n edge = [set() for _ in range(V)]\\n\\n for i, b in enumerate(blue):\\n\\n if b != 1:\\n\\n for j, r in enumerate(red):\\n\\n if r % b == 0:\\n\\n edge[i].add((M+j, 1))\\n\\n for j in range(2, int(math.sqrt(b)) + 1):\\n\\n if b % j == 0:\\n\\n for k, r in enumerate(red):\\n\\n if r % j == 0 or r % (b // j) == 0:\\n\\n edge[i].add((M+k, 1))\\n\\n for i in range(M):\\n\\n edge[M+N].add((i, 1))\\n\\n for j in range(N):\\n\\n edge[M+j].add((M+N+1, 1))\\n\\n d = Dinic(V, edge, M+N, M+N+1)\\n\\n print((d.maxflow))',\n", + " 'code_v0_loc': 105,\n", + " 'code_v1_loc': 106,\n", + " 'code_v0_num_chars': 3249,\n", + " 'code_v1_num_chars': 3284,\n", + " 'code_v0_no_empty_lines': 'import collections\\nimport math\\n\\n\\nclass Dinic:\\n \"\"\"Dinic Algorithm: find max-flow\\n complexity: O(EV^2)\\n used in GRL6A(AOJ)\\n \"\"\"\\n\\n class edge:\\n def __init__(self, to, cap, rev):\\n self.to, self.cap, self.rev = to, cap, rev\\n\\n def __init__(self, V, E, source, sink):\\n \"\"\"V: the number of vertexes\\n E: adjacency list\\n source: start point\\n sink: goal point\\n \"\"\"\\n self.V = V\\n self.E = [[] for _ in range(V)]\\n for fr in range(V):\\n for to, cap in E[fr]:\\n self.E[fr].append(self.edge(to, cap, len(self.E[to])))\\n self.E[to].append(self.edge(fr, 0, len(self.E[fr]) - 1))\\n self.maxflow = self.dinic(source, sink)\\n\\n def dinic(self, source, sink):\\n \"\"\"find max-flow\"\"\"\\n INF = float(\"inf\")\\n maxflow = 0\\n while True:\\n self.bfs(source)\\n if self.level[sink] < 0:\\n return maxflow\\n self.itr = [0] * self.V\\n while True:\\n flow = self.dfs(source, sink, INF)\\n if flow > 0:\\n maxflow += flow\\n else:\\n break\\n\\n def dfs(self, vertex, sink, flow):\\n \"\"\"find augmenting path\"\"\"\\n if vertex == sink:\\n return flow\\n for i in range(self.itr[vertex], len(self.E[vertex])):\\n self.itr[vertex] = i\\n e = self.E[vertex][i]\\n if e.cap > 0 and self.level[vertex] < self.level[e.to]:\\n d = self.dfs(e.to, sink, min(flow, e.cap))\\n if d > 0:\\n e.cap -= d\\n self.E[e.to][e.rev].cap += d\\n return d\\n return 0\\n\\n def bfs(self, start):\\n \"\"\"find shortest path from start\"\"\"\\n que = collections.deque()\\n self.level = [-1] * self.V\\n que.append(start)\\n self.level[start] = 0\\n while que:\\n fr = que.popleft()\\n for e in self.E[fr]:\\n if e.cap > 0 and self.level[e.to] < 0:\\n self.level[e.to] = self.level[fr] + 1\\n que.append(e.to)\\n\\n\\nwhile True:\\n M, N = list(map(int, input().split()))\\n if M == 0 and N == 0:\\n break\\n blue, red = [], []\\n while True:\\n for x in input().split():\\n blue.append(int(x))\\n if len(blue) == M:\\n break\\n while True:\\n for x in input().split():\\n red.append(int(x))\\n if len(red) == N:\\n break\\n V = M + N + 2\\n edge = [set() for _ in range(V)]\\n for i, b in enumerate(blue):\\n if b != 1:\\n for j, r in enumerate(red):\\n if r % b == 0:\\n edge[i].add((M + j, 1))\\n for j in range(2, int(math.sqrt(b)) + 1):\\n if b % j == 0:\\n for k, r in enumerate(red):\\n if r % j == 0 or r % (b // j) == 0:\\n edge[i].add((M + k, 1))\\n for i in range(M):\\n edge[M + N].add((i, 1))\\n for j in range(N):\\n edge[M + j].add((M + N + 1, 1))\\n d = Dinic(V, edge, M + N, M + N + 1)\\n print((d.maxflow))\\n',\n", + " 'code_v1_no_empty_lines': 'import collections\\nimport math\\n\\nrange = xrange\\ninput = raw_input\\n\\n\\nclass Dinic:\\n \"\"\"Dinic Algorithm: find max-flow\\n complexity: O(EV^2)\\n used in GRL6A(AOJ)\\n \"\"\"\\n\\n class edge:\\n def __init__(self, to, cap, rev):\\n self.to, self.cap, self.rev = to, cap, rev\\n\\n def __init__(self, V, E, source, sink):\\n \"\"\"V: the number of vertexes\\n E: adjacency list\\n source: start point\\n sink: goal point\\n \"\"\"\\n self.V = V\\n self.E = [[] for _ in range(V)]\\n for fr in range(V):\\n for to, cap in E[fr]:\\n self.E[fr].append(self.edge(to, cap, len(self.E[to])))\\n self.E[to].append(self.edge(fr, 0, len(self.E[fr]) - 1))\\n self.maxflow = self.dinic(source, sink)\\n\\n def dinic(self, source, sink):\\n \"\"\"find max-flow\"\"\"\\n INF = float(\"inf\")\\n maxflow = 0\\n while True:\\n self.bfs(source)\\n if self.level[sink] < 0:\\n return maxflow\\n self.itr = [0] * self.V\\n while True:\\n flow = self.dfs(source, sink, INF)\\n if flow > 0:\\n maxflow += flow\\n else:\\n break\\n\\n def dfs(self, vertex, sink, flow):\\n \"\"\"find augmenting path\"\"\"\\n if vertex == sink:\\n return flow\\n for i in range(self.itr[vertex], len(self.E[vertex])):\\n self.itr[vertex] = i\\n e = self.E[vertex][i]\\n if e.cap > 0 and self.level[vertex] < self.level[e.to]:\\n d = self.dfs(e.to, sink, min(flow, e.cap))\\n if d > 0:\\n e.cap -= d\\n self.E[e.to][e.rev].cap += d\\n return d\\n return 0\\n\\n def bfs(self, start):\\n \"\"\"find shortest path from start\"\"\"\\n que = collections.deque()\\n self.level = [-1] * self.V\\n que.append(start)\\n self.level[start] = 0\\n while que:\\n fr = que.popleft()\\n for e in self.E[fr]:\\n if e.cap > 0 and self.level[e.to] < 0:\\n self.level[e.to] = self.level[fr] + 1\\n que.append(e.to)\\n\\n\\nwhile True:\\n M, N = list(map(int, input().split()))\\n if M == 0 and N == 0:\\n break\\n blue, red = [], []\\n while True:\\n for x in input().split():\\n blue.append(int(x))\\n if len(blue) == M:\\n break\\n while True:\\n for x in input().split():\\n red.append(int(x))\\n if len(red) == N:\\n break\\n V = M + N + 2\\n edge = [set() for _ in range(V)]\\n for i, b in enumerate(blue):\\n if b != 1:\\n for j, r in enumerate(red):\\n if r % b == 0:\\n edge[i].add((M + j, 1))\\n for j in range(2, int(math.sqrt(b)) + 1):\\n if b % j == 0:\\n for k, r in enumerate(red):\\n if r % j == 0 or r % (b // j) == 0:\\n edge[i].add((M + k, 1))\\n for i in range(M):\\n edge[M + N].add((i, 1))\\n for j in range(N):\\n edge[M + j].add((M + N + 1, 1))\\n d = Dinic(V, edge, M + N, M + N + 1)\\n print((d.maxflow))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.9433962264,\n", + " 'diff': ['+', '+range = xrange', '+input = raw_input'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4880815578,\n", + " 'measured_runtime_v1': 0.2093546903,\n", + " 'runtime_lift': 2.3313619437,\n", + " 'key': ['s226218538', 's459214194']},\n", + " {'user_id': 'u581187895',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's060994907',\n", + " 'submission_id_v1': 's021977851',\n", + " 'cpu_time_v0': 271,\n", + " 'cpu_time_v1': 22,\n", + " 'memory_v0': 18640,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.88,\n", + " 'input': '# 全部試す\\n\\n# 1つあたりO(M)\\n\\n# O(M^2) = 10^6くらい\\n\\nimport numpy as np\\n\\nfrom scipy.sparse.csgraph import dijkstra\\n\\n\\n\\nN,M = list(map(int,input().split()))\\n\\nedge = [list(map(int, input().split())) for _ in range(M)]\\n\\n\\n\\ngraph = np.zeros((N+1, N+1))\\n\\n\\n\\nfor a, b in edge:\\n\\n graph[a, b] = 1\\n\\n \\n\\nans = 0\\n\\nfor a, b in edge:\\n\\n graph[a, b] = np.inf \\n\\n # directed=False -> 無向グラフ\\n\\n dist = dijkstra(graph, indices=a, directed=False)\\n\\n if dist[b] == np.inf:\\n\\n ans += 1\\n\\n graph[a, b] = 1 # 元に戻す\\n\\n \\n\\nprint(ans) ',\n", + " 'target': 'class UnionFind():\\n\\n def __init__(self, N):\\n\\n \"\"\" N個のノードのUnion-Find木を作成する \"\"\"\\n\\n # 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる\\n\\n self.parent = [n for n in range(0, N)]\\n\\n # グループの深さ\\n\\n self.depth = [1] * N\\n\\n \\n\\n def find(self, x):\\n\\n \"\"\" 木の根(どのグループか)を求める \"\"\"\\n\\n if self.parent[x] == x: return x\\n\\n self.parent[x] = self.find(self.parent[x]) # 縮約\\n\\n return self.parent[x]\\n\\n \\n\\n def unite(self, x, y):\\n\\n \"\"\" xとyの属する集合を併合する \"\"\"\\n\\n gx = self.find(x)\\n\\n gy = self.find(y)\\n\\n if gx == gy: return\\n\\n \\n\\n # 小さい方を大きい方に併合させる（木の偏りが減るので）\\n\\n if self.depth[gx] < self.depth[gy]:\\n\\n self.parent[gx] = gy\\n\\n else:\\n\\n self.parent[gy] = gx\\n\\n if self.depth[gx] == self.depth[gy]: self.depth[gx] += 1\\n\\n \\n\\n def is_same_group(self, x, y):\\n\\n \"\"\" xとyが同じ集合に属するか否か \"\"\"\\n\\n return self.find(x) == self.find(y)\\n\\n \\n\\nN, M = list(map(int, input().split()))\\n\\nE = [[int(x)-1 for x in input().split()] for _ in range(M)]\\n\\n\\n\\n# 各辺について、その辺が存在しない時、aとbが連結になるかをUnion-Findで判定する\\n\\nans = 0\\n\\nfor i in range(M):\\n\\n uf = UnionFind(N)\\n\\n for j, e in enumerate(E):\\n\\n if i==j: continue\\n\\n \\n\\n a, b = e\\n\\n uf.unite(a, b)\\n\\n \\n\\n # i番目の辺を除くすべての辺をつないだあとで、i番目の辺(a, b)がつながるかを判定する\\n\\n # つながらないならば、そのi番目の辺は橋である\\n\\n a, b = E[i]\\n\\n if not uf.is_same_group(a, b):\\n\\n ans += 1\\n\\n\\n\\nprint(ans) \\n',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 51,\n", + " 'code_v0_num_chars': 490,\n", + " 'code_v1_num_chars': 1409,\n", + " 'code_v0_no_empty_lines': '# 全部試す\\n# 1つあたりO(M)\\n# O(M^2) = 10^6くらい\\nimport numpy as np\\nfrom scipy.sparse.csgraph import dijkstra\\n\\nN, M = list(map(int, input().split()))\\nedge = [list(map(int, input().split())) for _ in range(M)]\\ngraph = np.zeros((N + 1, N + 1))\\nfor a, b in edge:\\n graph[a, b] = 1\\nans = 0\\nfor a, b in edge:\\n graph[a, b] = np.inf\\n # directed=False -> 無向グラフ\\n dist = dijkstra(graph, indices=a, directed=False)\\n if dist[b] == np.inf:\\n ans += 1\\n graph[a, b] = 1 # 元に戻す\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'class UnionFind:\\n def __init__(self, N):\\n \"\"\"N個のノードのUnion-Find木を作成する\"\"\"\\n # 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる\\n self.parent = [n for n in range(0, N)]\\n # グループの深さ\\n self.depth = [1] * N\\n\\n def find(self, x):\\n \"\"\"木の根(どのグループか)を求める\"\"\"\\n if self.parent[x] == x:\\n return x\\n self.parent[x] = self.find(self.parent[x]) # 縮約\\n return self.parent[x]\\n\\n def unite(self, x, y):\\n \"\"\"xとyの属する集合を併合する\"\"\"\\n gx = self.find(x)\\n gy = self.find(y)\\n if gx == gy:\\n return\\n # 小さい方を大きい方に併合させる（木の偏りが減るので）\\n if self.depth[gx] < self.depth[gy]:\\n self.parent[gx] = gy\\n else:\\n self.parent[gy] = gx\\n if self.depth[gx] == self.depth[gy]:\\n self.depth[gx] += 1\\n\\n def is_same_group(self, x, y):\\n \"\"\"xとyが同じ集合に属するか否か\"\"\"\\n return self.find(x) == self.find(y)\\n\\n\\nN, M = list(map(int, input().split()))\\nE = [[int(x) - 1 for x in input().split()] for _ in range(M)]\\n# 各辺について、その辺が存在しない時、aとbが連結になるかをUnion-Findで判定する\\nans = 0\\nfor i in range(M):\\n uf = UnionFind(N)\\n for j, e in enumerate(E):\\n if i == j:\\n continue\\n a, b = e\\n uf.unite(a, b)\\n # i番目の辺を除くすべての辺をつないだあとで、i番目の辺(a, b)がつながるかを判定する\\n # つながらないならば、そのi番目の辺は橋である\\n a, b = E[i]\\n if not uf.is_same_group(a, b):\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 52.9411764706,\n", + " 'diff': ['-# 全部試す',\n", + " '-# 1つあたりO(M)',\n", + " '-# O(M^2) = 10^6くらい',\n", + " '-import numpy as np',\n", + " '-from scipy.sparse.csgraph import dijkstra',\n", + " '+class UnionFind:',\n", + " '+ def __init__(self, N):',\n", + " '+ \"\"\"N個のノードのUnion-Find木を作成する\"\"\"',\n", + " '+ # 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる',\n", + " '+ self.parent = [n for n in range(0, N)]',\n", + " '+ # グループの深さ',\n", + " '+ self.depth = [1] * N',\n", + " '+',\n", + " '+ def find(self, x):',\n", + " '+ \"\"\"木の根(どのグループか)を求める\"\"\"',\n", + " '+ if self.parent[x] == x:',\n", + " '+ return x',\n", + " '+ self.parent[x] = self.find(self.parent[x]) # 縮約',\n", + " '+ return self.parent[x]',\n", + " '+',\n", + " '+ def unite(self, x, y):',\n", + " '+ \"\"\"xとyの属する集合を併合する\"\"\"',\n", + " '+ gx = self.find(x)',\n", + " '+ gy = self.find(y)',\n", + " '+ if gx == gy:',\n", + " '+ return',\n", + " '+ # 小さい方を大きい方に併合させる（木の偏りが減るので）',\n", + " '+ if self.depth[gx] < self.depth[gy]:',\n", + " '+ self.parent[gx] = gy',\n", + " '+ else:',\n", + " '+ self.parent[gy] = gx',\n", + " '+ if self.depth[gx] == self.depth[gy]:',\n", + " '+ self.depth[gx] += 1',\n", + " '+',\n", + " '+ def is_same_group(self, x, y):',\n", + " '+ \"\"\"xとyが同じ集合に属するか否か\"\"\"',\n", + " '+ return self.find(x) == self.find(y)',\n", + " '+',\n", + " '-edge = [list(map(int, input().split())) for _ in range(M)]',\n", + " '-graph = np.zeros((N + 1, N + 1))',\n", + " '-for a, b in edge:',\n", + " '- graph[a, b] = 1',\n", + " '+E = [[int(x) - 1 for x in input().split()] for _ in range(M)]',\n", + " '+# 各辺について、その辺が存在しない時、aとbが連結になるかをUnion-Findで判定する',\n", + " '-for a, b in edge:',\n", + " '- graph[a, b] = np.inf',\n", + " '- # directed=False -> 無向グラフ',\n", + " '- dist = dijkstra(graph, indices=a, directed=False)',\n", + " '- if dist[b] == np.inf:',\n", + " '+for i in range(M):',\n", + " '+ uf = UnionFind(N)',\n", + " '+ for j, e in enumerate(E):',\n", + " '+ if i == j:',\n", + " '+ continue',\n", + " '+ a, b = e',\n", + " '+ uf.unite(a, b)',\n", + " '+ # i番目の辺を除くすべての辺をつないだあとで、i番目の辺(a, b)がつながるかを判定する',\n", + " '+ # つながらないならば、そのi番目の辺は橋である',\n", + " '+ a, b = E[i]',\n", + " '+ if not uf.is_same_group(a, b):',\n", + " '- graph[a, b] = 1 # 元に戻す'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1378849642,\n", + " 'measured_runtime_v1': 0.2154630218,\n", + " 'runtime_lift': 9.922282472,\n", + " 'key': ['s060994907', 's021977851']},\n", + " {'user_id': 'u021548497',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's983449721',\n", + " 'submission_id_v1': 's321084928',\n", + " 'cpu_time_v0': 330,\n", + " 'cpu_time_v1': 30,\n", + " 'memory_v0': 9192,\n", + " 'memory_v1': 9108,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.91,\n", + " 'input': 'def main():\\n\\n n = int(eval(input()))\\n\\n \\n\\n dp = [0]*(n+1)\\n\\n dp[0] = 1\\n\\n mod = pow(10, 9) + 7\\n\\n for i in range(n+1):\\n\\n for j in range(i-2):\\n\\n dp[i] += dp[j]\\n\\n dp[i] %= mod\\n\\n \\n\\n print((dp[n]))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'target': 'def main():\\n\\n n = int(eval(input()))\\n\\n \\n\\n dp = [0]*(n+1)\\n\\n dp[0] = 1\\n\\n mod = pow(10, 9) + 7\\n\\n for i in range(3, n+1):\\n\\n dp[i] = dp[i-1] + dp[i-3]\\n\\n dp[i] %= mod\\n\\n \\n\\n print((dp[n]))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 242,\n", + " 'code_v1_num_chars': 226,\n", + " 'code_v0_no_empty_lines': 'def main():\\n n = int(eval(input()))\\n dp = [0] * (n + 1)\\n dp[0] = 1\\n mod = pow(10, 9) + 7\\n for i in range(n + 1):\\n for j in range(i - 2):\\n dp[i] += dp[j]\\n dp[i] %= mod\\n print((dp[n]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n n = int(eval(input()))\\n dp = [0] * (n + 1)\\n dp[0] = 1\\n mod = pow(10, 9) + 7\\n for i in range(3, n + 1):\\n dp[i] = dp[i - 1] + dp[i - 3]\\n dp[i] %= mod\\n print((dp[n]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['- for i in range(n + 1):',\n", + " '- for j in range(i - 2):',\n", + " '- dp[i] += dp[j]',\n", + " '- dp[i] %= mod',\n", + " '+ for i in range(3, n + 1):',\n", + " '+ dp[i] = dp[i - 1] + dp[i - 3]',\n", + " '+ dp[i] %= mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6721006331,\n", + " 'measured_runtime_v1': 0.344866425,\n", + " 'runtime_lift': 1.9488723295,\n", + " 'key': ['s983449721', 's321084928']},\n", + " {'user_id': 'u189326411',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's862494830',\n", + " 'submission_id_v1': 's415254610',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 4020,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.91,\n", + " 'input': 'import math\\n\\nn = int(eval(input()))\\n\\nprint((math.factorial(n)%(10**9+7)))\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\nmod = 10**9 + 7\\n\\n\\n\\npow = 1\\n\\nfor i in range(n):\\n\\n pow = pow*(i+1)%mod\\n\\n\\n\\nprint(pow)\\n',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 66,\n", + " 'code_v1_num_chars': 104,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nprint((math.factorial(n) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nmod = 10**9 + 7\\npow = 1\\nfor i in range(n):\\n pow = pow * (i + 1) % mod\\nprint(pow)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 62.5,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(n) % (10**9 + 7)))',\n", + " '+mod = 10**9 + 7',\n", + " '+pow = 1',\n", + " '+for i in range(n):',\n", + " '+ pow = pow * (i + 1) % mod',\n", + " '+print(pow)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5275577738,\n", + " 'measured_runtime_v1': 0.2526761317,\n", + " 'runtime_lift': 2.0878813135,\n", + " 'key': ['s862494830', 's415254610']},\n", + " {'user_id': 'u069838609',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's651142165',\n", + " 'submission_id_v1': 's962802291',\n", + " 'cpu_time_v0': 233,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 4408,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.99,\n", + " 'input': \"from math import sqrt, ceil, factorial\\n\\nfrom collections import defaultdict\\n\\n\\n\\n\\n\\ndef prime_factors(n):\\n\\n i = 2\\n\\n factors = defaultdict(int)\\n\\n while i * i <= n:\\n\\n if n % i:\\n\\n i += 1\\n\\n else:\\n\\n n //= i\\n\\n factors[i] += 1\\n\\n if n > 1:\\n\\n factors[n] += 1\\n\\n return factors\\n\\n\\n\\n\\n\\nN, M = [int(elem) for elem in input().split(' ')]\\n\\n\\n\\n# 素因数分解\\n\\nprime_numbers = prime_factors(M)\\n\\nsum = 1\\n\\nfac_N_m1 = factorial(N - 1)\\n\\n\\n\\nfor value in list(prime_numbers.values()):\\n\\n bunshi = 1\\n\\n saisho = value + N - 1\\n\\n for _ in range(value):\\n\\n bunshi *= saisho\\n\\n saisho -= 1\\n\\n sum *= (bunshi // factorial(value))\\n\\nprint((sum % (10**9 + 7)))\\n\",\n", + " 'target': 'from collections import defaultdict\\n\\n\\n\\n\\n\\ndef prime_factorize(num):\\n\\n prime_numbers = defaultdict(int)\\n\\n i = 2\\n\\n while i * i <= num:\\n\\n if num % i == 0:\\n\\n while num % i == 0:\\n\\n prime_numbers[i] += 1\\n\\n num //= i\\n\\n i += 1\\n\\n if num != 1:\\n\\n prime_numbers[num] += 1\\n\\n return prime_numbers\\n\\n\\n\\n\\n\\nMOD = 10**9 + 7\\n\\nN, M = [int(elem) for elem in input().split()]\\n\\n\\n\\nprime_numbers = prime_factorize(M)\\n\\n\\n\\nnum_sequences = 1\\n\\nfor exponent in list(prime_numbers.values()):\\n\\n denomimator = 1\\n\\n numerator = 1\\n\\n for i in range(1, exponent + 1):\\n\\n denomimator *= (N + exponent - i)\\n\\n numerator *= i\\n\\n num_sequences *= denomimator // numerator\\n\\n num_sequences %= MOD\\n\\n\\n\\nprint(num_sequences)\\n',\n", + " 'code_v0_loc': 33,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 697,\n", + " 'code_v1_num_chars': 770,\n", + " 'code_v0_no_empty_lines': 'from math import sqrt, ceil, factorial\\nfrom collections import defaultdict\\n\\n\\ndef prime_factors(n):\\n i = 2\\n factors = defaultdict(int)\\n while i * i <= n:\\n if n % i:\\n i += 1\\n else:\\n n //= i\\n factors[i] += 1\\n if n > 1:\\n factors[n] += 1\\n return factors\\n\\n\\nN, M = [int(elem) for elem in input().split(\" \")]\\n# 素因数分解\\nprime_numbers = prime_factors(M)\\nsum = 1\\nfac_N_m1 = factorial(N - 1)\\nfor value in list(prime_numbers.values()):\\n bunshi = 1\\n saisho = value + N - 1\\n for _ in range(value):\\n bunshi *= saisho\\n saisho -= 1\\n sum *= bunshi // factorial(value)\\nprint((sum % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\n\\ndef prime_factorize(num):\\n prime_numbers = defaultdict(int)\\n i = 2\\n while i * i <= num:\\n if num % i == 0:\\n while num % i == 0:\\n prime_numbers[i] += 1\\n num //= i\\n i += 1\\n if num != 1:\\n prime_numbers[num] += 1\\n return prime_numbers\\n\\n\\nMOD = 10**9 + 7\\nN, M = [int(elem) for elem in input().split()]\\nprime_numbers = prime_factorize(M)\\nnum_sequences = 1\\nfor exponent in list(prime_numbers.values()):\\n denomimator = 1\\n numerator = 1\\n for i in range(1, exponent + 1):\\n denomimator *= N + exponent - i\\n numerator *= i\\n num_sequences *= denomimator // numerator\\n num_sequences %= MOD\\nprint(num_sequences)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-from math import sqrt, ceil, factorial',\n", + " '-def prime_factors(n):',\n", + " '+def prime_factorize(num):',\n", + " '+ prime_numbers = defaultdict(int)',\n", + " '- factors = defaultdict(int)',\n", + " '- while i * i <= n:',\n", + " '- if n % i:',\n", + " '- i += 1',\n", + " '- else:',\n", + " '- n //= i',\n", + " '- factors[i] += 1',\n", + " '- if n > 1:',\n", + " '- factors[n] += 1',\n", + " '- return factors',\n", + " '+ while i * i <= num:',\n", + " '+ if num % i == 0:',\n", + " '+ while num % i == 0:',\n", + " '+ prime_numbers[i] += 1',\n", + " '+ num //= i',\n", + " '+ i += 1',\n", + " '+ if num != 1:',\n", + " '+ prime_numbers[num] += 1',\n", + " '+ return prime_numbers',\n", + " '-N, M = [int(elem) for elem in input().split(\" \")]',\n", + " '-# 素因数分解',\n", + " '-prime_numbers = prime_factors(M)',\n", + " '-sum = 1',\n", + " '-fac_N_m1 = factorial(N - 1)',\n", + " '-for value in list(prime_numbers.values()):',\n", + " '- bunshi = 1',\n", + " '- saisho = value + N - 1',\n", + " '- for _ in range(value):',\n", + " '- bunshi *= saisho',\n", + " '- saisho -= 1',\n", + " '- sum *= bunshi // factorial(value)',\n", + " '-print((sum % (10**9 + 7)))',\n", + " '+MOD = 10**9 + 7',\n", + " '+N, M = [int(elem) for elem in input().split()]',\n", + " '+prime_numbers = prime_factorize(M)',\n", + " '+num_sequences = 1',\n", + " '+for exponent in list(prime_numbers.values()):',\n", + " '+ denomimator = 1',\n", + " '+ numerator = 1',\n", + " '+ for i in range(1, exponent + 1):',\n", + " '+ denomimator *= N + exponent - i',\n", + " '+ numerator *= i',\n", + " '+ num_sequences *= denomimator // numerator',\n", + " '+ num_sequences %= MOD',\n", + " '+print(num_sequences)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3638904934,\n", + " 'measured_runtime_v1': 0.1944270425,\n", + " 'runtime_lift': 1.8716043238,\n", + " 'key': ['s651142165', 's962802291']},\n", + " {'user_id': 'u490553751',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's026624237',\n", + " 'submission_id_v1': 's811488510',\n", + " 'cpu_time_v0': 185,\n", + " 'cpu_time_v1': 132,\n", + " 'memory_v0': 26444,\n", + " 'memory_v1': 31604,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.65,\n", + " 'input': '#template\\n\\ndef inputlist(): return [int(j) for j in input().split()]\\n\\n#template\\n\\n#issueから始める\\n\\nK,N = inputlist()\\n\\nA = inputlist()\\n\\nlia = [0]*N\\n\\nfor i in range(1,N):\\n\\n k = A[i] - A[i-1]\\n\\n lia[i] = k\\n\\nlia[0] = (K+A[0]-A[-1])\\n\\nlia.sort()\\n\\nans = 0\\n\\nfor i in range(N-1):\\n\\n ans += lia[i]\\n\\nprint(ans)',\n", + " 'target': '#template\\n\\ndef inputlist(): return [int(j) for j in input().split()]\\n\\ndef listinput(): return input().split()\\n\\n#template\\n\\nK,N = inputlist()\\n\\nA = inputlist()\\n\\ndis = [0]*(N)\\n\\nfor i in range(N):\\n\\n if i == N-1:\\n\\n dis[i] = K+A[0] - A[i]\\n\\n continue\\n\\n dis[i] = A[i+1] - A[i]\\n\\ndis.sort()\\n\\nprint((sum(dis[:-1])))',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 301,\n", + " 'code_v1_num_chars': 321,\n", + " 'code_v0_no_empty_lines': '# template\\ndef inputlist():\\n return [int(j) for j in input().split()]\\n\\n\\n# template\\n# issueから始める\\nK, N = inputlist()\\nA = inputlist()\\nlia = [0] * N\\nfor i in range(1, N):\\n k = A[i] - A[i - 1]\\n lia[i] = k\\nlia[0] = K + A[0] - A[-1]\\nlia.sort()\\nans = 0\\nfor i in range(N - 1):\\n ans += lia[i]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# template\\ndef inputlist():\\n return [int(j) for j in input().split()]\\n\\n\\ndef listinput():\\n return input().split()\\n\\n\\n# template\\nK, N = inputlist()\\nA = inputlist()\\ndis = [0] * (N)\\nfor i in range(N):\\n if i == N - 1:\\n dis[i] = K + A[0] - A[i]\\n continue\\n dis[i] = A[i + 1] - A[i]\\ndis.sort()\\nprint((sum(dis[:-1])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['+def listinput():',\n", + " '+ return input().split()',\n", + " '+',\n", + " '+',\n", + " '-# issueから始める',\n", + " '-lia = [0] * N',\n", + " '-for i in range(1, N):',\n", + " '- k = A[i] - A[i - 1]',\n", + " '- lia[i] = k',\n", + " '-lia[0] = K + A[0] - A[-1]',\n", + " '-lia.sort()',\n", + " '-ans = 0',\n", + " '-for i in range(N - 1):',\n", + " '- ans += lia[i]',\n", + " '-print(ans)',\n", + " '+dis = [0] * (N)',\n", + " '+for i in range(N):',\n", + " '+ if i == N - 1:',\n", + " '+ dis[i] = K + A[0] - A[i]',\n", + " '+ continue',\n", + " '+ dis[i] = A[i + 1] - A[i]',\n", + " '+dis.sort()',\n", + " '+print((sum(dis[:-1])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3599109902,\n", + " 'measured_runtime_v1': 0.2745016385,\n", + " 'runtime_lift': 1.3111433221,\n", + " 'key': ['s026624237', 's811488510']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p03086',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's780520490',\n", + " 'submission_id_v1': 's016683067',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3188,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': \"import re;print((max(list(map(len,re.split('[^ACGT]',eval(input())))))))\",\n", + " 'target': \"p=m=0\\n\\nfor c in eval(input()):p=-~p*(c in'ATGC');m=max(m,p)\\n\\nprint(m)\",\n", + " 'code_v0_loc': 1,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 58,\n", + " 'code_v1_num_chars': 63,\n", + " 'code_v0_no_empty_lines': 'import re\\n\\nprint((max(list(map(len, re.split(\"[^ACGT]\", eval(input())))))))\\n',\n", + " 'code_v1_no_empty_lines': 'p = m = 0\\nfor c in eval(input()):\\n p = -~p * (c in \"ATGC\")\\n m = max(m, p)\\nprint(m)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-import re',\n", + " '-',\n", + " '-print((max(list(map(len, re.split(\"[^ACGT]\", eval(input())))))))',\n", + " '+p = m = 0',\n", + " '+for c in eval(input()):',\n", + " '+ p = -~p * (c in \"ATGC\")',\n", + " '+ m = max(m, p)',\n", + " '+print(m)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2963340635,\n", + " 'measured_runtime_v1': 0.1579363909,\n", + " 'runtime_lift': 1.8762874209,\n", + " 'key': ['s780520490', 's016683067']},\n", + " {'user_id': 'u060896757',\n", + " 'problem_id': 'p02688',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's916854343',\n", + " 'submission_id_v1': 's774123468',\n", + " 'cpu_time_v0': 116,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 27092,\n", + " 'memory_v1': 67788,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.28,\n", + " 'input': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\n\\n \\n\\nA = np.zeros(N, dtype=int)\\n\\n \\n\\nfor _ in range(K):\\n\\n eval(input())\\n\\n for i in input().split():\\n\\n A[int(i) - 1] += 1\\n\\n \\n\\nans = 0\\n\\nfor i in A:\\n\\n if i == 0:\\n\\n ans += 1\\n\\nprint(ans)\\n\\n ',\n", + " 'target': 'N, K = list(map(int, input().split()))\\n\\n\\n\\nA = [0] * N\\n\\n\\n\\nfor _ in range(K):\\n\\n eval(input())\\n\\n for i in map(int, input().split()):\\n\\n A[i - 1] += 1\\n\\n\\n\\nprint((A.count(0)))\\n',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 252,\n", + " 'code_v1_num_chars': 168,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\nA = np.zeros(N, dtype=int)\\nfor _ in range(K):\\n eval(input())\\n for i in input().split():\\n A[int(i) - 1] += 1\\nans = 0\\nfor i in A:\\n if i == 0:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nA = [0] * N\\nfor _ in range(K):\\n eval(input())\\n for i in map(int, input().split()):\\n A[i - 1] += 1\\nprint((A.count(0)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 37.5,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.zeros(N, dtype=int)',\n", + " '+A = [0] * N',\n", + " '- for i in input().split():',\n", + " '- A[int(i) - 1] += 1',\n", + " '-ans = 0',\n", + " '-for i in A:',\n", + " '- if i == 0:',\n", + " '- ans += 1',\n", + " '-print(ans)',\n", + " '+ for i in map(int, input().split()):',\n", + " '+ A[i - 1] += 1',\n", + " '+print((A.count(0)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6720787771,\n", + " 'measured_runtime_v1': 0.288313632,\n", + " 'runtime_lift': 5.7995134165,\n", + " 'key': ['s916854343', 's774123468']},\n", + " {'user_id': 'u624696727',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's619004796',\n", + " 'submission_id_v1': 's352340154',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 12220,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.91,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\nint1 = lambda x: int(x) - 1\\n\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\n\\nprintH = lambda x: print(\" \".join(map(str,x)))\\n\\ndef IS(): return sys.stdin.readline()[:-1]\\n\\ndef II(): return int(sys.stdin.readline())\\n\\ndef MI(): return map(int, sys.stdin.readline().split())\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\\n\\ndef LII(rows_number): return [II() for _ in range(rows_number)]\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\\n\\n\\n\\ndef main():\\n\\n\\tN = II()\\n\\n\\tX = LI()\\n\\n\\tX = np.array(X)\\n\\n\\tm = round(np.sum(X) / N)\\n\\n\\tprint(int(np.sum((X-m)**2)))\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n\\tmain()\\n',\n", + " 'target': 'import sys\\n\\n\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\nint1 = lambda x: int(x) - 1\\n\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\n\\nprintH = lambda x: print(\" \".join(map(str,x)))\\n\\ndef IS(): return sys.stdin.readline()[:-1]\\n\\ndef II(): return int(sys.stdin.readline())\\n\\ndef MI(): return map(int, sys.stdin.readline().split())\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\\n\\ndef LII(rows_number): return [II() for _ in range(rows_number)]\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\\n\\n\\n\\ndef main():\\n\\n\\tN = II()\\n\\n\\tX = LI()\\n\\n\\tm = round(sum(X) / N)\\n\\n\\tans = 0\\n\\n\\tfor x in X:\\n\\n\\t\\tans += ((x-m)**2)\\n\\n\\tprint(ans)\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n\\tmain()\\n',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 803,\n", + " 'code_v1_num_chars': 789,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**6)\\nint1 = lambda x: int(x) - 1\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\nprintH = lambda x: print(\" \".join(map(str, x)))\\n\\n\\ndef IS():\\n return sys.stdin.readline()[:-1]\\n\\n\\ndef II():\\n return int(sys.stdin.readline())\\n\\n\\ndef MI():\\n return map(int, sys.stdin.readline().split())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, sys.stdin.readline().split()))\\n\\n\\ndef LII(rows_number):\\n return [II() for _ in range(rows_number)]\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef LLI1(rows_number):\\n return [LI1() for _ in range(rows_number)]\\n\\n\\ndef main():\\n N = II()\\n X = LI()\\n X = np.array(X)\\n m = round(np.sum(X) / N)\\n print(int(np.sum((X - m) ** 2)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\nint1 = lambda x: int(x) - 1\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\nprintH = lambda x: print(\" \".join(map(str, x)))\\n\\n\\ndef IS():\\n return sys.stdin.readline()[:-1]\\n\\n\\ndef II():\\n return int(sys.stdin.readline())\\n\\n\\ndef MI():\\n return map(int, sys.stdin.readline().split())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, sys.stdin.readline().split()))\\n\\n\\ndef LII(rows_number):\\n return [II() for _ in range(rows_number)]\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef LLI1(rows_number):\\n return [LI1() for _ in range(rows_number)]\\n\\n\\ndef main():\\n N = II()\\n X = LI()\\n m = round(sum(X) / N)\\n ans = 0\\n for x in X:\\n ans += (x - m) ** 2\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.8461538462,\n", + " 'diff': ['-import numpy as np',\n", + " '- X = np.array(X)',\n", + " '- m = round(np.sum(X) / N)',\n", + " '- print(int(np.sum((X - m) ** 2)))',\n", + " '+ m = round(sum(X) / N)',\n", + " '+ ans = 0',\n", + " '+ for x in X:',\n", + " '+ ans += (x - m) ** 2',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5154907587,\n", + " 'measured_runtime_v1': 0.201975739,\n", + " 'runtime_lift': 7.5033306776,\n", + " 'key': ['s619004796', 's352340154']},\n", + " {'user_id': 'u811733736',\n", + " 'problem_id': 'p00144',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's682125154',\n", + " 'submission_id_v1': 's595229787',\n", + " 'cpu_time_v0': 600,\n", + " 'cpu_time_v1': 370,\n", + " 'memory_v0': 8556,\n", + " 'memory_v1': 8432,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 38.33,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0144\\n\\n\\n\\n\"\"\"\\n\\nimport sys\\n\\nfrom sys import stdin\\n\\ninput = stdin.readline\\n\\nfrom enum import Enum\\n\\n\\n\\n\\n\\nclass Graph(object):\\n\\n \"\"\" single source shortest path \"\"\"\\n\\n class Status(Enum):\\n\\n \"\"\" ?????????????¨??????¶??? \"\"\"\\n\\n white = 1 # ????¨????\\n\\n gray = 2 # ?¨???????\\n\\n black = 3 #?¨???????\\n\\n\\n\\n def __init__(self, n, data):\\n\\n self.num_of_nodes = n+1\\n\\n self.color = [Graph.Status.white] * self.num_of_nodes # ????????????????¨??????¶???\\n\\n self.M = [[float(\\'inf\\')] * self.num_of_nodes for _ in range(self.num_of_nodes)]\\n\\n for i in range(self.num_of_nodes):\\n\\n self.M[i][i] = 0\\n\\n self._make_matrix(data) # data????????????????????£??\\\\??????(?????\\\\?¶???¨???????????????????????§????????????)\\n\\n self.d = [float(\\'inf\\')] * self.num_of_nodes # ?§???????????????????(?????????)\\n\\n self.p = [-1] * self.num_of_nodes # ????????????????????????????¨?????????????????????????\\n\\n\\n\\n def _make_matrix(self, data):\\n\\n for d in data:\\n\\n r = d[0]\\n\\n for t in d[2:]:\\n\\n self.M[r][t] = 1\\n\\n\\n\\n def dijkstra(self, start):\\n\\n self.d[start] = 0\\n\\n self.p[start] = -1\\n\\n while True:\\n\\n mincost = float(\\'inf\\')\\n\\n # ??\\\\??????????????§??????????????¨?????????????????????u???????????????\\n\\n for i in range(len(self.d)):\\n\\n if self.color[i] != Graph.Status.black and self.d[i] < mincost: # S????±???????????????????S??¨??\\\\?¶?????????????????????????????????????????°???????????????????\\n\\n mincost = self.d[i]\\n\\n u = i # u??????????????????ID\\n\\n if mincost == float(\\'inf\\'):\\n\\n break\\n\\n self.color[u] = Graph.Status.black # ?????????u???S????±???????????????´???\\n\\n for v in range(len(self.d)):\\n\\n if self.color[v] != Graph.Status.black and self.M[u][v] != float(\\'inf\\'):\\n\\n # v????????????????????????????????°??????S???????????£???u????????????????????????????????????????????°??????????????±??§??´??°??????\\n\\n if self.d[u] + self.M[u][v] < self.d[v]:\\n\\n self.d[v] = self.d[u] + self.M[u][v]\\n\\n self.p[v] = u\\n\\n self.color[v] = Graph.Status.gray\\n\\n\\n\\n def warshallFloyd(self):\\n\\n V = self.num_of_nodes\\n\\n for k in range(V):\\n\\n for i in range(V):\\n\\n for j in range(V):\\n\\n self.M[i][j] = min(self.M[i][j], self.M[i][k] + self.M[k][j])\\n\\n\\n\\n\\n\\n\\n\\ndef main(args):\\n\\n n = int(eval(input()))\\n\\n network = []\\n\\n for _ in range(n):\\n\\n network.append([int(x) for x in input().split()])\\n\\n\\n\\n packets = []\\n\\n p = int(eval(input()))\\n\\n for _ in range(p):\\n\\n packets.append([int(x) for x in input().split()])\\n\\n\\n\\n g = Graph(n, network)\\n\\n g.warshallFloyd()\\n\\n\\n\\n for s, d, v in packets:\\n\\n if g.M[s][d] < v:\\n\\n print((g.M[s][d]+1))\\n\\n else:\\n\\n print(\\'NA\\')\\n\\n\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main(sys.argv[1:])',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0144\\n\\n\\n\\n\"\"\"\\n\\nimport sys\\n\\nfrom sys import stdin\\n\\ninput = stdin.readline\\n\\nfrom enum import Enum\\n\\n\\n\\n\\n\\nclass Graph(object):\\n\\n \"\"\" single source shortest path \"\"\"\\n\\n class Status(Enum):\\n\\n \"\"\" ?????????????¨??????¶??? \"\"\"\\n\\n white = 1 # ????¨????\\n\\n gray = 2 # ?¨???????\\n\\n black = 3 #?¨???????\\n\\n\\n\\n def __init__(self, n, data):\\n\\n self.num_of_nodes = n+1\\n\\n self.color = [Graph.Status.white] * self.num_of_nodes # ????????????????¨??????¶???\\n\\n self.M = [[float(\\'inf\\')] * self.num_of_nodes for _ in range(self.num_of_nodes)]\\n\\n for i in range(self.num_of_nodes):\\n\\n self.M[i][i] = 0\\n\\n self._make_matrix(data) # data????????????????????£??\\\\??????(?????\\\\?¶???¨???????????????????????§????????????)\\n\\n self.d = [float(\\'inf\\')] * self.num_of_nodes # ?§???????????????????(?????????)\\n\\n self.p = [-1] * self.num_of_nodes # ????????????????????????????¨?????????????????????????\\n\\n\\n\\n def _make_matrix(self, data):\\n\\n for d in data:\\n\\n r = d[0]\\n\\n for t in d[2:]:\\n\\n self.M[r][t] = 1\\n\\n\\n\\n def dijkstra(self, start):\\n\\n self.d[start] = 0\\n\\n self.p[start] = -1\\n\\n while True:\\n\\n mincost = float(\\'inf\\')\\n\\n # ??\\\\??????????????§??????????????¨?????????????????????u???????????????\\n\\n for i in range(len(self.d)):\\n\\n if self.color[i] != Graph.Status.black and self.d[i] < mincost: # S????±???????????????????S??¨??\\\\?¶?????????????????????????????????????????°???????????????????\\n\\n mincost = self.d[i]\\n\\n u = i # u??????????????????ID\\n\\n if mincost == float(\\'inf\\'):\\n\\n break\\n\\n self.color[u] = Graph.Status.black # ?????????u???S????±???????????????´???\\n\\n for v in range(len(self.d)):\\n\\n if self.color[v] != Graph.Status.black and self.M[u][v] != float(\\'inf\\'):\\n\\n # v????????????????????????????????°??????S???????????£???u????????????????????????????????????????????°??????????????±??§??´??°??????\\n\\n if self.d[u] + self.M[u][v] < self.d[v]:\\n\\n self.d[v] = self.d[u] + self.M[u][v]\\n\\n self.p[v] = u\\n\\n self.color[v] = Graph.Status.gray\\n\\n\\n\\n def warshallFloyd(self):\\n\\n for k in range(self.num_of_nodes):\\n\\n for i in range(self.num_of_nodes):\\n\\n for j in range(self.num_of_nodes):\\n\\n if self.M[i][k] + self.M[k][j] < self.M[i][j]: \\n\\n self.M[i][j] = self.M[i][k] + self.M[k][j]\\n\\n\\n\\n\\n\\ndef main(args):\\n\\n n = int(eval(input()))\\n\\n network = []\\n\\n for _ in range(n):\\n\\n network.append([int(x) for x in input().split()])\\n\\n\\n\\n packets = []\\n\\n p = int(eval(input()))\\n\\n for _ in range(p):\\n\\n packets.append([int(x) for x in input().split()])\\n\\n\\n\\n g = Graph(n, network)\\n\\n g.warshallFloyd()\\n\\n\\n\\n for s, d, v in packets:\\n\\n if g.M[s][d] < v:\\n\\n print((g.M[s][d]+1))\\n\\n else:\\n\\n print(\\'NA\\')\\n\\n\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main(sys.argv[1:])',\n", + " 'code_v0_loc': 89,\n", + " 'code_v1_loc': 88,\n", + " 'code_v0_num_chars': 3155,\n", + " 'code_v1_num_chars': 3224,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0144\\n\"\"\"\\nimport sys\\nfrom sys import stdin\\n\\ninput = stdin.readline\\nfrom enum import Enum\\n\\n\\nclass Graph(object):\\n \"\"\"single source shortest path\"\"\"\\n\\n class Status(Enum):\\n \"\"\"?????????????¨??????¶???\"\"\"\\n\\n white = 1 # ????¨????\\n gray = 2 # ?¨???????\\n black = 3 # ?¨???????\\n\\n def __init__(self, n, data):\\n self.num_of_nodes = n + 1\\n self.color = [\\n Graph.Status.white\\n ] * self.num_of_nodes # ????????????????¨??????¶???\\n self.M = [[float(\"inf\")] * self.num_of_nodes for _ in range(self.num_of_nodes)]\\n for i in range(self.num_of_nodes):\\n self.M[i][i] = 0\\n self._make_matrix(\\n data\\n ) # data????????????????????£??\\\\??????(?????\\\\?¶???¨???????????????????????§????????????)\\n self.d = [float(\"inf\")] * self.num_of_nodes # ?§???????????????????(?????????)\\n self.p = [\\n -1\\n ] * self.num_of_nodes # ????????????????????????????¨?????????????????????????\\n\\n def _make_matrix(self, data):\\n for d in data:\\n r = d[0]\\n for t in d[2:]:\\n self.M[r][t] = 1\\n\\n def dijkstra(self, start):\\n self.d[start] = 0\\n self.p[start] = -1\\n while True:\\n mincost = float(\"inf\")\\n # ??\\\\??????????????§??????????????¨?????????????????????u???????????????\\n for i in range(len(self.d)):\\n if (\\n self.color[i] != Graph.Status.black and self.d[i] < mincost\\n ): # S????±???????????????????S??¨??\\\\?¶?????????????????????????????????????????°???????????????????\\n mincost = self.d[i]\\n u = i # u??????????????????ID\\n if mincost == float(\"inf\"):\\n break\\n self.color[u] = Graph.Status.black # ?????????u???S????±???????????????´???\\n for v in range(len(self.d)):\\n if self.color[v] != Graph.Status.black and self.M[u][v] != float(\"inf\"):\\n # v????????????????????????????????°??????S???????????£???u????????????????????????????????????????????°??????????????±??§??´??°??????\\n if self.d[u] + self.M[u][v] < self.d[v]:\\n self.d[v] = self.d[u] + self.M[u][v]\\n self.p[v] = u\\n self.color[v] = Graph.Status.gray\\n\\n def warshallFloyd(self):\\n V = self.num_of_nodes\\n for k in range(V):\\n for i in range(V):\\n for j in range(V):\\n self.M[i][j] = min(self.M[i][j], self.M[i][k] + self.M[k][j])\\n\\n\\ndef main(args):\\n n = int(eval(input()))\\n network = []\\n for _ in range(n):\\n network.append([int(x) for x in input().split()])\\n packets = []\\n p = int(eval(input()))\\n for _ in range(p):\\n packets.append([int(x) for x in input().split()])\\n g = Graph(n, network)\\n g.warshallFloyd()\\n for s, d, v in packets:\\n if g.M[s][d] < v:\\n print((g.M[s][d] + 1))\\n else:\\n print(\"NA\")\\n\\n\\nif __name__ == \"__main__\":\\n main(sys.argv[1:])\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0144\\n\"\"\"\\nimport sys\\nfrom sys import stdin\\n\\ninput = stdin.readline\\nfrom enum import Enum\\n\\n\\nclass Graph(object):\\n \"\"\"single source shortest path\"\"\"\\n\\n class Status(Enum):\\n \"\"\"?????????????¨??????¶???\"\"\"\\n\\n white = 1 # ????¨????\\n gray = 2 # ?¨???????\\n black = 3 # ?¨???????\\n\\n def __init__(self, n, data):\\n self.num_of_nodes = n + 1\\n self.color = [\\n Graph.Status.white\\n ] * self.num_of_nodes # ????????????????¨??????¶???\\n self.M = [[float(\"inf\")] * self.num_of_nodes for _ in range(self.num_of_nodes)]\\n for i in range(self.num_of_nodes):\\n self.M[i][i] = 0\\n self._make_matrix(\\n data\\n ) # data????????????????????£??\\\\??????(?????\\\\?¶???¨???????????????????????§????????????)\\n self.d = [float(\"inf\")] * self.num_of_nodes # ?§???????????????????(?????????)\\n self.p = [\\n -1\\n ] * self.num_of_nodes # ????????????????????????????¨?????????????????????????\\n\\n def _make_matrix(self, data):\\n for d in data:\\n r = d[0]\\n for t in d[2:]:\\n self.M[r][t] = 1\\n\\n def dijkstra(self, start):\\n self.d[start] = 0\\n self.p[start] = -1\\n while True:\\n mincost = float(\"inf\")\\n # ??\\\\??????????????§??????????????¨?????????????????????u???????????????\\n for i in range(len(self.d)):\\n if (\\n self.color[i] != Graph.Status.black and self.d[i] < mincost\\n ): # S????±???????????????????S??¨??\\\\?¶?????????????????????????????????????????°???????????????????\\n mincost = self.d[i]\\n u = i # u??????????????????ID\\n if mincost == float(\"inf\"):\\n break\\n self.color[u] = Graph.Status.black # ?????????u???S????±???????????????´???\\n for v in range(len(self.d)):\\n if self.color[v] != Graph.Status.black and self.M[u][v] != float(\"inf\"):\\n # v????????????????????????????????°??????S???????????£???u????????????????????????????????????????????°??????????????±??§??´??°??????\\n if self.d[u] + self.M[u][v] < self.d[v]:\\n self.d[v] = self.d[u] + self.M[u][v]\\n self.p[v] = u\\n self.color[v] = Graph.Status.gray\\n\\n def warshallFloyd(self):\\n for k in range(self.num_of_nodes):\\n for i in range(self.num_of_nodes):\\n for j in range(self.num_of_nodes):\\n if self.M[i][k] + self.M[k][j] < self.M[i][j]:\\n self.M[i][j] = self.M[i][k] + self.M[k][j]\\n\\n\\ndef main(args):\\n n = int(eval(input()))\\n network = []\\n for _ in range(n):\\n network.append([int(x) for x in input().split()])\\n packets = []\\n p = int(eval(input()))\\n for _ in range(p):\\n packets.append([int(x) for x in input().split()])\\n g = Graph(n, network)\\n g.warshallFloyd()\\n for s, d, v in packets:\\n if g.M[s][d] < v:\\n print((g.M[s][d] + 1))\\n else:\\n print(\"NA\")\\n\\n\\nif __name__ == \"__main__\":\\n main(sys.argv[1:])\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 1.1235955056,\n", + " 'diff': ['- V = self.num_of_nodes',\n", + " '- for k in range(V):',\n", + " '- for i in range(V):',\n", + " '- for j in range(V):',\n", + " '- self.M[i][j] = min(self.M[i][j], self.M[i][k] + self.M[k][j])',\n", + " '+ for k in range(self.num_of_nodes):',\n", + " '+ for i in range(self.num_of_nodes):',\n", + " '+ for j in range(self.num_of_nodes):',\n", + " '+ if self.M[i][k] + self.M[k][j] < self.M[i][j]:',\n", + " '+ self.M[i][j] = self.M[i][k] + self.M[k][j]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3833627119,\n", + " 'measured_runtime_v1': 0.2694868836,\n", + " 'runtime_lift': 1.4225653832,\n", + " 'key': ['s682125154', 's595229787']},\n", + " {'user_id': 'u325956328',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's608143765',\n", + " 'submission_id_v1': 's686875697',\n", + " 'cpu_time_v0': 606,\n", + " 'cpu_time_v1': 256,\n", + " 'memory_v0': 33988,\n", + " 'memory_v1': 25572,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 57.76,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\np = np.array(list(map(int, input().split())))\\n\\n\\n\\ns = np.cumsum(p)\\n\\n# print(p, s)\\n\\n\\n\\nm = []\\n\\n\\n\\n\\n\\ndef partsum(s, x):\\n\\n global K\\n\\n if x == K - 1:\\n\\n return s[x]\\n\\n return s[x] - s[x - K]\\n\\n\\n\\n\\n\\nfor i in range(K - 1, N):\\n\\n m.append(partsum(s, i))\\n\\n# print(m)\\n\\n\\n\\nidx = m.index(max(m))\\n\\n# print(idx)\\n\\n\\n\\nans = 0\\n\\nfor j in range(idx, idx + K):\\n\\n ans += (p[j] + 1) / 2\\n\\nprint(ans)\\n',\n", + " 'target': 'from collections import deque\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\np = list(map(int, input().split()))\\n\\n\\n\\nmx = 0\\n\\ns = 0\\n\\nq = deque()\\n\\n\\n\\nfor i in range(N):\\n\\n p[i] += 1\\n\\n\\n\\nfor i in range(N):\\n\\n s += p[i]\\n\\n q.append(p[i])\\n\\n if len(q) > K:\\n\\n s -= q.popleft()\\n\\n if len(q) == K:\\n\\n mx = max(mx, s)\\n\\n\\n\\nprint((mx / 2))\\n\\n\\n',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 446,\n", + " 'code_v1_num_chars': 338,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\np = np.array(list(map(int, input().split())))\\ns = np.cumsum(p)\\n# print(p, s)\\nm = []\\n\\n\\ndef partsum(s, x):\\n global K\\n if x == K - 1:\\n return s[x]\\n return s[x] - s[x - K]\\n\\n\\nfor i in range(K - 1, N):\\n m.append(partsum(s, i))\\n# print(m)\\nidx = m.index(max(m))\\n# print(idx)\\nans = 0\\nfor j in range(idx, idx + K):\\n ans += (p[j] + 1) / 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque\\n\\nN, K = list(map(int, input().split()))\\np = list(map(int, input().split()))\\nmx = 0\\ns = 0\\nq = deque()\\nfor i in range(N):\\n p[i] += 1\\nfor i in range(N):\\n s += p[i]\\n q.append(p[i])\\n if len(q) > K:\\n s -= q.popleft()\\n if len(q) == K:\\n mx = max(mx, s)\\nprint((mx / 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 24.1379310345,\n", + " 'diff': ['-import numpy as np',\n", + " '+from collections import deque',\n", + " '-p = np.array(list(map(int, input().split())))',\n", + " '-s = np.cumsum(p)',\n", + " '-# print(p, s)',\n", + " '-m = []',\n", + " '-',\n", + " '-',\n", + " '-def partsum(s, x):',\n", + " '- global K',\n", + " '- if x == K - 1:',\n", + " '- return s[x]',\n", + " '- return s[x] - s[x - K]',\n", + " '-',\n", + " '-',\n", + " '-for i in range(K - 1, N):',\n", + " '- m.append(partsum(s, i))',\n", + " '-# print(m)',\n", + " '-idx = m.index(max(m))',\n", + " '-# print(idx)',\n", + " '-ans = 0',\n", + " '-for j in range(idx, idx + K):',\n", + " '- ans += (p[j] + 1) / 2',\n", + " '-print(ans)',\n", + " '+p = list(map(int, input().split()))',\n", + " '+mx = 0',\n", + " '+s = 0',\n", + " '+q = deque()',\n", + " '+for i in range(N):',\n", + " '+ p[i] += 1',\n", + " '+for i in range(N):',\n", + " '+ s += p[i]',\n", + " '+ q.append(p[i])',\n", + " '+ if len(q) > K:',\n", + " '+ s -= q.popleft()',\n", + " '+ if len(q) == K:',\n", + " '+ mx = max(mx, s)',\n", + " '+print((mx / 2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8877932756,\n", + " 'measured_runtime_v1': 0.2490595601,\n", + " 'runtime_lift': 7.5796860601,\n", + " 'key': ['s608143765', 's686875697']},\n", + " {'user_id': 'u739959951',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's666163340',\n", + " 'submission_id_v1': 's556555369',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12500,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.67,\n", + " 'input': 'n,a=list(map(int,input().split()))\\n\\n\\n\\nl=[a+i-1 for i in range(1,n+1)]\\n\\n\\n\\nimport numpy as np\\n\\nb=min(np.abs(l))\\n\\n\\n\\nif b==0:\\n\\n l.remove(0)\\n\\nelif b in l:\\n\\n l.remove(b)\\n\\nelif -b in l:\\n\\n l.remove(-b)\\n\\n \\n\\nprint((sum(l)))',\n", + " 'target': 'n,a=list(map(int,input().split()))\\n\\n\\n\\napples=[a+i for i in range(n)]\\n\\neat=min(apples,key=lambda x:abs(x))\\n\\nres=sum(apples)-eat\\n\\n\\n\\nprint(res)',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 209,\n", + " 'code_v1_num_chars': 134,\n", + " 'code_v0_no_empty_lines': 'n, a = list(map(int, input().split()))\\nl = [a + i - 1 for i in range(1, n + 1)]\\nimport numpy as np\\n\\nb = min(np.abs(l))\\nif b == 0:\\n l.remove(0)\\nelif b in l:\\n l.remove(b)\\nelif -b in l:\\n l.remove(-b)\\nprint((sum(l)))\\n',\n", + " 'code_v1_no_empty_lines': 'n, a = list(map(int, input().split()))\\napples = [a + i for i in range(n)]\\neat = min(apples, key=lambda x: abs(x))\\nres = sum(apples) - eat\\nprint(res)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 53.3333333333,\n", + " 'diff': ['-l = [a + i - 1 for i in range(1, n + 1)]',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-b = min(np.abs(l))',\n", + " '-if b == 0:',\n", + " '- l.remove(0)',\n", + " '-elif b in l:',\n", + " '- l.remove(b)',\n", + " '-elif -b in l:',\n", + " '- l.remove(-b)',\n", + " '-print((sum(l)))',\n", + " '+apples = [a + i for i in range(n)]',\n", + " '+eat = min(apples, key=lambda x: abs(x))',\n", + " '+res = sum(apples) - eat',\n", + " '+print(res)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.1117280972,\n", + " 'measured_runtime_v1': 0.1730254316,\n", + " 'runtime_lift': 6.4252294396,\n", + " 'key': ['s666163340', 's556555369']},\n", + " {'user_id': 'u873616440',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's803345472',\n", + " 'submission_id_v1': 's423400256',\n", + " 'cpu_time_v0': 163,\n", + " 'cpu_time_v1': 141,\n", + " 'memory_v0': 25952,\n", + " 'memory_v1': 25060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.5,\n", + " 'input': 'N, K = list(map(int, input().split()))\\n\\nA = list(map(int, input().split()))\\n\\ns = [0] * 1000000\\n\\nfor i in range(N):\\n\\n s[i+1] = s[i] + A[i]\\n\\n\\n\\nmax_s = 0\\n\\nfor i in range(N):\\n\\n if max_s < s[i+K] - s[i]:\\n\\n max_s = s[i+K] - s[i]\\n\\n\\n\\n\\n\\nprint(((max_s+K) / 2))',\n", + " 'target': 'N, K = list(map(int, input().split()))\\n\\np = list(map(int, input().split()))\\n\\n\\n\\nm = [(e + 1) / 2 for e in p]\\n\\n\\n\\nt = sum(m[0:K])\\n\\nresult = t\\n\\nfor i in range(N - K):\\n\\n t -= m[i]\\n\\n t += m[i + K]\\n\\n if t > result:\\n\\n result = t\\n\\nprint(result)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 261,\n", + " 'code_v1_num_chars': 245,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\ns = [0] * 1000000\\nfor i in range(N):\\n s[i + 1] = s[i] + A[i]\\nmax_s = 0\\nfor i in range(N):\\n if max_s < s[i + K] - s[i]:\\n max_s = s[i + K] - s[i]\\nprint(((max_s + K) / 2))\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\np = list(map(int, input().split()))\\nm = [(e + 1) / 2 for e in p]\\nt = sum(m[0:K])\\nresult = t\\nfor i in range(N - K):\\n t -= m[i]\\n t += m[i + K]\\n if t > result:\\n result = t\\nprint(result)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-A = list(map(int, input().split()))',\n", + " '-s = [0] * 1000000',\n", + " '-for i in range(N):',\n", + " '- s[i + 1] = s[i] + A[i]',\n", + " '-max_s = 0',\n", + " '-for i in range(N):',\n", + " '- if max_s < s[i + K] - s[i]:',\n", + " '- max_s = s[i + K] - s[i]',\n", + " '-print(((max_s + K) / 2))',\n", + " '+p = list(map(int, input().split()))',\n", + " '+m = [(e + 1) / 2 for e in p]',\n", + " '+t = sum(m[0:K])',\n", + " '+result = t',\n", + " '+for i in range(N - K):',\n", + " '+ t -= m[i]',\n", + " '+ t += m[i + K]',\n", + " '+ if t > result:',\n", + " '+ result = t',\n", + " '+print(result)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.394733299,\n", + " 'measured_runtime_v1': 0.2439838529,\n", + " 'runtime_lift': 1.6178664873,\n", + " 'key': ['s803345472', 's423400256']},\n", + " {'user_id': 'u816872429',\n", + " 'problem_id': 'p03039',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's871362008',\n", + " 'submission_id_v1': 's362897835',\n", + " 'cpu_time_v0': 1991,\n", + " 'cpu_time_v1': 98,\n", + " 'memory_v0': 18912,\n", + " 'memory_v1': 11052,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 95.08,\n", + " 'input': 'n, m, k = list(map(int, input().split()))\\n\\n\\n\\nmod = 1000000007\\n\\ndef pow(x, n):\\n\\n ret = 1\\n\\n while n > 0:\\n\\n if (n & 1) == 1:\\n\\n ret = (ret * x) % mod\\n\\n x = (x * x) % mod\\n\\n n >>= 1\\n\\n return ret\\n\\n\\n\\nfac = [1]\\n\\ninv = [1]\\n\\nfor i in range(1, n * m + 1):\\n\\n fac.append((fac[-1] * i) % mod)\\n\\n inv.append(pow(fac[i], mod - 2))\\n\\n\\n\\ndef cmb(n, k):\\n\\n return (fac[n] * inv[k] * inv[n - k]) % mod\\n\\n\\n\\ndef doit(n, m, k):\\n\\n ret = 0\\n\\n for d in range(m):\\n\\n ret = (ret + d * (m - d)) % mod\\n\\n return (ret * n * n * cmb(n * m - 2, k - 2)) % mod\\n\\n\\n\\nprint(((doit(n, m, k) + doit(m, n, k)) % mod))',\n", + " 'target': 'n, m, k = list(map(int, input().split()))\\n\\n\\n\\nmod = 1000000007\\n\\nfac = [1]\\n\\nfor i in range(1, n * m + 1):\\n\\n fac.append((fac[-1] * i) % mod)\\n\\n\\n\\ndef pow(x, n):\\n\\n ret = 1\\n\\n while n > 0:\\n\\n if (n & 1) == 1:\\n\\n ret = (ret * x) % mod\\n\\n x = (x * x) % mod\\n\\n n >>= 1\\n\\n return ret\\n\\n\\n\\ndef inv(i):\\n\\n return pow(fac[i], mod - 2)\\n\\n\\n\\ndef cmb(n, k):\\n\\n return (fac[n] * inv(k) * inv(n - k)) % mod\\n\\n\\n\\nx = sum(d * (m - d) for d in range(m)) % mod\\n\\ny = sum(d * (n - d) for d in range(n)) % mod\\n\\n\\n\\nc = cmb(n * m - 2, k - 2)\\n\\nx = (x * n * n * c) % mod\\n\\ny = (y * m * m * c) % mod\\n\\n\\n\\nprint(((x + y) % mod))',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 624,\n", + " 'code_v1_num_chars': 620,\n", + " 'code_v0_no_empty_lines': 'n, m, k = list(map(int, input().split()))\\nmod = 1000000007\\n\\n\\ndef pow(x, n):\\n ret = 1\\n while n > 0:\\n if (n & 1) == 1:\\n ret = (ret * x) % mod\\n x = (x * x) % mod\\n n >>= 1\\n return ret\\n\\n\\nfac = [1]\\ninv = [1]\\nfor i in range(1, n * m + 1):\\n fac.append((fac[-1] * i) % mod)\\n inv.append(pow(fac[i], mod - 2))\\n\\n\\ndef cmb(n, k):\\n return (fac[n] * inv[k] * inv[n - k]) % mod\\n\\n\\ndef doit(n, m, k):\\n ret = 0\\n for d in range(m):\\n ret = (ret + d * (m - d)) % mod\\n return (ret * n * n * cmb(n * m - 2, k - 2)) % mod\\n\\n\\nprint(((doit(n, m, k) + doit(m, n, k)) % mod))\\n',\n", + " 'code_v1_no_empty_lines': 'n, m, k = list(map(int, input().split()))\\nmod = 1000000007\\nfac = [1]\\nfor i in range(1, n * m + 1):\\n fac.append((fac[-1] * i) % mod)\\n\\n\\ndef pow(x, n):\\n ret = 1\\n while n > 0:\\n if (n & 1) == 1:\\n ret = (ret * x) % mod\\n x = (x * x) % mod\\n n >>= 1\\n return ret\\n\\n\\ndef inv(i):\\n return pow(fac[i], mod - 2)\\n\\n\\ndef cmb(n, k):\\n return (fac[n] * inv(k) * inv(n - k)) % mod\\n\\n\\nx = sum(d * (m - d) for d in range(m)) % mod\\ny = sum(d * (n - d) for d in range(n)) % mod\\nc = cmb(n * m - 2, k - 2)\\nx = (x * n * n * c) % mod\\ny = (y * m * m * c) % mod\\nprint(((x + y) % mod))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['+fac = [1]',\n", + " '+for i in range(1, n * m + 1):',\n", + " '+ fac.append((fac[-1] * i) % mod)',\n", + " '-fac = [1]',\n", + " '-inv = [1]',\n", + " '-for i in range(1, n * m + 1):',\n", + " '- fac.append((fac[-1] * i) % mod)',\n", + " '- inv.append(pow(fac[i], mod - 2))',\n", + " '+def inv(i):',\n", + " '+ return pow(fac[i], mod - 2)',\n", + " '- return (fac[n] * inv[k] * inv[n - k]) % mod',\n", + " '+ return (fac[n] * inv(k) * inv(n - k)) % mod',\n", + " '-def doit(n, m, k):',\n", + " '- ret = 0',\n", + " '- for d in range(m):',\n", + " '- ret = (ret + d * (m - d)) % mod',\n", + " '- return (ret * n * n * cmb(n * m - 2, k - 2)) % mod',\n", + " '-',\n", + " '-',\n", + " '-print(((doit(n, m, k) + doit(m, n, k)) % mod))',\n", + " '+x = sum(d * (m - d) for d in range(m)) % mod',\n", + " '+y = sum(d * (n - d) for d in range(n)) % mod',\n", + " '+c = cmb(n * m - 2, k - 2)',\n", + " '+x = (x * n * n * c) % mod',\n", + " '+y = (y * m * m * c) % mod',\n", + " '+print(((x + y) % mod))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7987827396,\n", + " 'measured_runtime_v1': 0.3213389852,\n", + " 'runtime_lift': 2.4857946791,\n", + " 'key': ['s871362008', 's362897835']},\n", + " {'user_id': 'u844005364',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's135697405',\n", + " 'submission_id_v1': 's243236458',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': 'n, like = list(map(int, input().split()))\\n\\n\\n\\narr = [like + i for i in range(n)]\\n\\n\\n\\narr.sort(key=lambda x:abs(x))\\n\\n\\n\\nprint((sum(arr[1:])))\\n',\n", + " 'target': 'n, like = list(map(int, input().split()))\\n\\narr = [like + i for i in range(n)]\\n\\narr.sort(key=abs)\\n\\nprint((sum(arr[1:])))\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 130,\n", + " 'code_v1_num_chars': 112,\n", + " 'code_v0_no_empty_lines': 'n, like = list(map(int, input().split()))\\narr = [like + i for i in range(n)]\\narr.sort(key=lambda x: abs(x))\\nprint((sum(arr[1:])))\\n',\n", + " 'code_v1_no_empty_lines': 'n, like = list(map(int, input().split()))\\narr = [like + i for i in range(n)]\\narr.sort(key=abs)\\nprint((sum(arr[1:])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.8571428571,\n", + " 'diff': ['-arr.sort(key=lambda x: abs(x))', '+arr.sort(key=abs)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2677221475,\n", + " 'measured_runtime_v1': 0.0993615375,\n", + " 'runtime_lift': 2.6944243647,\n", + " 'key': ['s135697405', 's243236458']},\n", + " {'user_id': 'u595289165',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's893034804',\n", + " 'submission_id_v1': 's639832443',\n", + " 'cpu_time_v0': 386,\n", + " 'cpu_time_v1': 218,\n", + " 'memory_v0': 33972,\n", + " 'memory_v1': 25060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.52,\n", + " 'input': 'import numpy as np\\n\\nn, k = list(map(int, input().split()))\\n\\np = np.array(list(map(int, input().split())))\\n\\np += 1\\n\\nsum_E = np.cumsum(p)\\n\\nsum_e = np.append([0], sum_E)\\n\\nans = -1\\n\\nfor i in range(n-k+1):\\n\\n ans = max(ans, sum_e[i+k] - sum_e[i])\\n\\nprint((ans/2))',\n", + " 'target': 'n, k = list(map(int, input().split()))\\n\\np = list(map(int, input().split()))\\n\\n\\n\\ndef calc(x):\\n\\n return (x + 1) / 2\\n\\n\\n\\n\\n\\nw = 0\\n\\n\\n\\nfor i in range(k):\\n\\n w += calc(p[i])\\n\\n\\n\\nans = w\\n\\nfor i in range(k, n):\\n\\n w += calc(p[i]) - calc(p[i - k])\\n\\n ans = max(ans, w)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 251,\n", + " 'code_v1_num_chars': 270,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, k = list(map(int, input().split()))\\np = np.array(list(map(int, input().split())))\\np += 1\\nsum_E = np.cumsum(p)\\nsum_e = np.append([0], sum_E)\\nans = -1\\nfor i in range(n - k + 1):\\n ans = max(ans, sum_e[i + k] - sum_e[i])\\nprint((ans / 2))\\n',\n", + " 'code_v1_no_empty_lines': 'n, k = list(map(int, input().split()))\\np = list(map(int, input().split()))\\n\\n\\ndef calc(x):\\n return (x + 1) / 2\\n\\n\\nw = 0\\nfor i in range(k):\\n w += calc(p[i])\\nans = w\\nfor i in range(k, n):\\n w += calc(p[i]) - calc(p[i - k])\\n ans = max(ans, w)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.1764705882,\n", + " 'diff': ['-import numpy as np',\n", + " '+n, k = list(map(int, input().split()))',\n", + " '+p = list(map(int, input().split()))',\n", + " '-n, k = list(map(int, input().split()))',\n", + " '-p = np.array(list(map(int, input().split())))',\n", + " '-p += 1',\n", + " '-sum_E = np.cumsum(p)',\n", + " '-sum_e = np.append([0], sum_E)',\n", + " '-ans = -1',\n", + " '-for i in range(n - k + 1):',\n", + " '- ans = max(ans, sum_e[i + k] - sum_e[i])',\n", + " '-print((ans / 2))',\n", + " '+',\n", + " '+def calc(x):',\n", + " '+ return (x + 1) / 2',\n", + " '+',\n", + " '+',\n", + " '+w = 0',\n", + " '+for i in range(k):',\n", + " '+ w += calc(p[i])',\n", + " '+ans = w',\n", + " '+for i in range(k, n):',\n", + " '+ w += calc(p[i]) - calc(p[i - k])',\n", + " '+ ans = max(ans, w)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3460690436,\n", + " 'measured_runtime_v1': 0.2107389896,\n", + " 'runtime_lift': 6.3873754267,\n", + " 'key': ['s893034804', 's639832443']},\n", + " {'user_id': 'u588341295',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's242527358',\n", + " 'submission_id_v1': 's893815197',\n", + " 'cpu_time_v0': 171,\n", + " 'cpu_time_v1': 71,\n", + " 'memory_v0': 19188,\n", + " 'memory_v1': 11240,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 58.48,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\\n\\n\"\"\"\\n\\n参考：http://drken1215.hatenablog.com/entry/2018/09/23/224100\\n\\n\\u3000\\u3000\\u3000http://tutuz.hateblo.jp/entry/2018/09/24/121248\\n\\n・素因数分解と重複組み合わせ\\n\\n・毎回階乗やると死ぬから階乗と逆元のテーブル作る(忘れてた)\\n\\n\"\"\"\\n\\n\\n\\nfrom collections import defaultdict\\n\\nfrom math import sqrt\\n\\n\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\ndef fact_prime(num):\\n\\n d = defaultdict(int)\\n\\n # 終点はルート切り捨て+1\\n\\n end = int(sqrt(num)) + 1\\n\\n for i in range(2, end+1):\\n\\n cnt = 0\\n\\n # 素因数分解：小さい方から割れるだけ割って素数をカウント\\n\\n while num % i == 0:\\n\\n num //= i\\n\\n d[i] += 1\\n\\n # 1まで来たら終了\\n\\n if num == 1:\\n\\n break\\n\\n # 最後までそのまま来たやつはnumが素数(ただし1^1は1^0なので数に入れない)\\n\\n if num != 1:\\n\\n d[num] += 1\\n\\n return d\\n\\n\\n\\n# とりあえずv+N-1が収まればいいはず\\n\\nMAX = 10 ** 5 * 2\\n\\n# 予め組み合わせ計算に必要な階乗と逆元のテーブルを作っておく\\n\\nfactorial = [1] * (MAX)\\n\\nfactorial[0] = factorial[1] = 1\\n\\nfor i in range(2, MAX):\\n\\n factorial[i] = factorial[i-1] * i % MOD\\n\\n\\n\\ninverse = [1] * (MAX)\\n\\n# powに第三引数入れると冪乗のmod付計算を高速にやってくれる\\n\\ninverse[MAX-1] = pow(factorial[MAX-1], MOD-2, MOD)\\n\\nfor i in range(MAX-2, 0, -1):\\n\\n # 最後から戻っていくこのループならH+W回powするより処理が速い\\n\\n inverse[i] = inverse[i+1] * (i+1) % MOD\\n\\n\\n\\n# 組み合わせの数\\n\\ndef nCr(n, r):\\n\\n # 10C7 = 10C3\\n\\n r = min(r, n-r)\\n\\n # 分子の計算\\n\\n numerator = factorial[n]\\n\\n # 分母の計算\\n\\n denominator = inverse[r] * inverse[n-r] % MOD\\n\\n return numerator * denominator % MOD\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\n\\n\\n# d = fact_prime(M)\\n\\n# print(d)\\n\\nans = 1\\n\\nfor k, v in list(fact_prime(M).items()):\\n\\n # 重複組み合わせ\\n\\n # v個のkとN-1個の仕切りから、v個を並べる(v+N-1個のマスからv個を選び出す組み合わせ)\\n\\n ans = (ans * nCr(v+N-1, v)) % MOD\\n\\nprint(ans)\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\n\\n\\nimport sys\\n\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\\n\\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\\n\\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\\n\\ndef ceil(x, y=1): return int(-(-x // y))\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\\n\\ndef Yes(): print(\\'Yes\\')\\n\\ndef No(): print(\\'No\\')\\n\\ndef YES(): print(\\'YES\\')\\n\\ndef NO(): print(\\'NO\\')\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float(\\'inf\\')\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\ndef factorize(num: int) -> dict:\\n\\n \"\"\" 素因数分解 \"\"\"\\n\\n from math import sqrt\\n\\n from collections import Counter\\n\\n\\n\\n d = Counter()\\n\\n # 終点はルート切り捨て+1\\n\\n for i in range(2, int(sqrt(num))+1):\\n\\n # 素因数分解：小さい方から割れるだけ割って素数をカウント\\n\\n while num % i == 0:\\n\\n num //= i\\n\\n d[i] += 1\\n\\n # 1まで分解したら終了\\n\\n if num == 1:\\n\\n break\\n\\n # 最後に残ったnumは素数(ただし1^1は1^0なので数に入れない)\\n\\n if num != 1:\\n\\n d[num] += 1\\n\\n return d\\n\\n\\n\\nclass FactInvMOD:\\n\\n \"\"\" 階乗たくさん使う時用のテーブル準備 \"\"\"\\n\\n\\n\\n def __init__(self, MAX, MOD):\\n\\n \"\"\" MAX：階乗に使う数値の最大以上まで作る \"\"\"\\n\\n \\n\\n MAX += 1\\n\\n self.MAX = MAX\\n\\n self.MOD = MOD\\n\\n # 階乗テーブル\\n\\n factorial = [1] * MAX\\n\\n factorial[0] = factorial[1] = 1\\n\\n for i in range(2, MAX):\\n\\n factorial[i] = factorial[i-1] * i % MOD\\n\\n # 階乗の逆元テーブル\\n\\n inverse = [1] * MAX\\n\\n # powに第三引数入れると冪乗のmod付計算を高速にやってくれる\\n\\n inverse[MAX-1] = pow(factorial[MAX-1], MOD-2, MOD)\\n\\n for i in range(MAX-2, 0, -1):\\n\\n # 最後から戻っていくこのループならMAX回powするより処理が速い\\n\\n inverse[i] = inverse[i+1] * (i+1) % MOD\\n\\n self.fact = factorial\\n\\n self.inv = inverse\\n\\n \\n\\n def nCr(self, n, r):\\n\\n \"\"\" 組み合わせの数 (必要な階乗と逆元のテーブルを事前に作っておく) \"\"\"\\n\\n\\n\\n if n < r: return 0\\n\\n # 10C7 = 10C3\\n\\n r = min(r, n-r)\\n\\n # 分子の計算\\n\\n numerator = self.fact[n]\\n\\n # 分母の計算\\n\\n denominator = self.inv[r] * self.inv[n-r] % self.MOD\\n\\n return numerator * denominator % self.MOD\\n\\n\\n\\n def nPr(self, n, r):\\n\\n \"\"\" 順列 \"\"\"\\n\\n\\n\\n if n < r: return 0\\n\\n return self.fact[n] * self.inv[n-r] % self.MOD\\n\\n\\n\\n def nHr(self, n, r):\\n\\n \"\"\" 重複組み合わせ \"\"\"\\n\\n\\n\\n # r個選ぶところにN-1個の仕切りを入れる\\n\\n return self.nCr(r+n-1, r)\\n\\n\\n\\nN, M = MAP()\\n\\n\\n\\nd = factorize(M)\\n\\n\\n\\n# 例外処理\\n\\nif not d:\\n\\n print((1))\\n\\n exit()\\n\\n\\n\\nMAX = N + max(d.values())\\n\\nfim = FactInvMOD(MAX, MOD)\\n\\nans = 1\\n\\nfor k, v in list(d.items()):\\n\\n ans *= fim.nHr(N, v)\\n\\n ans %= MOD\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 67,\n", + " 'code_v1_loc': 104,\n", + " 'code_v0_num_chars': 1591,\n", + " 'code_v1_num_chars': 2726,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\n参考：http://drken1215.hatenablog.com/entry/2018/09/23/224100\\n\\u3000\\u3000\\u3000http://tutuz.hateblo.jp/entry/2018/09/24/121248\\n・素因数分解と重複組み合わせ\\n・毎回階乗やると死ぬから階乗と逆元のテーブル作る(忘れてた)\\n\"\"\"\\nfrom collections import defaultdict\\nfrom math import sqrt\\n\\nMOD = 10**9 + 7\\n\\n\\ndef fact_prime(num):\\n d = defaultdict(int)\\n # 終点はルート切り捨て+1\\n end = int(sqrt(num)) + 1\\n for i in range(2, end + 1):\\n cnt = 0\\n # 素因数分解：小さい方から割れるだけ割って素数をカウント\\n while num % i == 0:\\n num //= i\\n d[i] += 1\\n # 1まで来たら終了\\n if num == 1:\\n break\\n # 最後までそのまま来たやつはnumが素数(ただし1^1は1^0なので数に入れない)\\n if num != 1:\\n d[num] += 1\\n return d\\n\\n\\n# とりあえずv+N-1が収まればいいはず\\nMAX = 10**5 * 2\\n# 予め組み合わせ計算に必要な階乗と逆元のテーブルを作っておく\\nfactorial = [1] * (MAX)\\nfactorial[0] = factorial[1] = 1\\nfor i in range(2, MAX):\\n factorial[i] = factorial[i - 1] * i % MOD\\ninverse = [1] * (MAX)\\n# powに第三引数入れると冪乗のmod付計算を高速にやってくれる\\ninverse[MAX - 1] = pow(factorial[MAX - 1], MOD - 2, MOD)\\nfor i in range(MAX - 2, 0, -1):\\n # 最後から戻っていくこのループならH+W回powするより処理が速い\\n inverse[i] = inverse[i + 1] * (i + 1) % MOD\\n# 組み合わせの数\\ndef nCr(n, r):\\n # 10C7 = 10C3\\n r = min(r, n - r)\\n # 分子の計算\\n numerator = factorial[n]\\n # 分母の計算\\n denominator = inverse[r] * inverse[n - r] % MOD\\n return numerator * denominator % MOD\\n\\n\\nN, M = list(map(int, input().split()))\\n# d = fact_prime(M)\\n# print(d)\\nans = 1\\nfor k, v in list(fact_prime(M).items()):\\n # 重複組み合わせ\\n # v個のkとN-1個の仕切りから、v個を並べる(v+N-1個のマスからv個を選び出す組み合わせ)\\n ans = (ans * nCr(v + N - 1, v)) % MOD\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef list2d(a, b, c):\\n return [[c] * b for i in range(a)]\\n\\n\\ndef list3d(a, b, c, d):\\n return [[[d] * c for j in range(b)] for i in range(a)]\\n\\n\\ndef list4d(a, b, c, d, e):\\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\\n\\n\\ndef ceil(x, y=1):\\n return int(-(-x // y))\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST(N=None):\\n return list(MAP()) if N is None else [INT() for i in range(N)]\\n\\n\\ndef Yes():\\n print(\"Yes\")\\n\\n\\ndef No():\\n print(\"No\")\\n\\n\\ndef YES():\\n print(\"YES\")\\n\\n\\ndef NO():\\n print(\"NO\")\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nMOD = 10**9 + 7\\n\\n\\ndef factorize(num: int) -> dict:\\n \"\"\"素因数分解\"\"\"\\n from math import sqrt\\n from collections import Counter\\n\\n d = Counter()\\n # 終点はルート切り捨て+1\\n for i in range(2, int(sqrt(num)) + 1):\\n # 素因数分解：小さい方から割れるだけ割って素数をカウント\\n while num % i == 0:\\n num //= i\\n d[i] += 1\\n # 1まで分解したら終了\\n if num == 1:\\n break\\n # 最後に残ったnumは素数(ただし1^1は1^0なので数に入れない)\\n if num != 1:\\n d[num] += 1\\n return d\\n\\n\\nclass FactInvMOD:\\n \"\"\"階乗たくさん使う時用のテーブル準備\"\"\"\\n\\n def __init__(self, MAX, MOD):\\n \"\"\"MAX：階乗に使う数値の最大以上まで作る\"\"\"\\n MAX += 1\\n self.MAX = MAX\\n self.MOD = MOD\\n # 階乗テーブル\\n factorial = [1] * MAX\\n factorial[0] = factorial[1] = 1\\n for i in range(2, MAX):\\n factorial[i] = factorial[i - 1] * i % MOD\\n # 階乗の逆元テーブル\\n inverse = [1] * MAX\\n # powに第三引数入れると冪乗のmod付計算を高速にやってくれる\\n inverse[MAX - 1] = pow(factorial[MAX - 1], MOD - 2, MOD)\\n for i in range(MAX - 2, 0, -1):\\n # 最後から戻っていくこのループならMAX回powするより処理が速い\\n inverse[i] = inverse[i + 1] * (i + 1) % MOD\\n self.fact = factorial\\n self.inv = inverse\\n\\n def nCr(self, n, r):\\n \"\"\"組み合わせの数 (必要な階乗と逆元のテーブルを事前に作っておく)\"\"\"\\n if n < r:\\n return 0\\n # 10C7 = 10C3\\n r = min(r, n - r)\\n # 分子の計算\\n numerator = self.fact[n]\\n # 分母の計算\\n denominator = self.inv[r] * self.inv[n - r] % self.MOD\\n return numerator * denominator % self.MOD\\n\\n def nPr(self, n, r):\\n \"\"\"順列\"\"\"\\n if n < r:\\n return 0\\n return self.fact[n] * self.inv[n - r] % self.MOD\\n\\n def nHr(self, n, r):\\n \"\"\"重複組み合わせ\"\"\"\\n # r個選ぶところにN-1個の仕切りを入れる\\n return self.nCr(r + n - 1, r)\\n\\n\\nN, M = MAP()\\nd = factorize(M)\\n# 例外処理\\nif not d:\\n print((1))\\n exit()\\nMAX = N + max(d.values())\\nfim = FactInvMOD(MAX, MOD)\\nans = 1\\nfor k, v in list(d.items()):\\n ans *= fim.nHr(N, v)\\n ans %= MOD\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.5769230769,\n", + " 'diff': ['-\"\"\"',\n", + " '-参考：http://drken1215.hatenablog.com/entry/2018/09/23/224100',\n", + " '-\\u3000\\u3000\\u3000http://tutuz.hateblo.jp/entry/2018/09/24/121248',\n", + " '-・素因数分解と重複組み合わせ',\n", + " '-・毎回階乗やると死ぬから階乗と逆元のテーブル作る(忘れてた)',\n", + " '-\"\"\"',\n", + " '-from collections import defaultdict',\n", + " '-from math import sqrt',\n", + " '+import sys',\n", + " '+',\n", + " '+def input():',\n", + " '+ return sys.stdin.readline().strip()',\n", + " '+',\n", + " '+',\n", + " '+def list2d(a, b, c):',\n", + " '+ return [[c] * b for i in range(a)]',\n", + " '+',\n", + " '+',\n", + " '+def list3d(a, b, c, d):',\n", + " '+ return [[[d] * c for j in range(b)] for i in range(a)]',\n", + " '+',\n", + " '+',\n", + " '+def list4d(a, b, c, d, e):',\n", + " '+ return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]',\n", + " '+',\n", + " '+',\n", + " '+def ceil(x, y=1):',\n", + " '+ return int(-(-x // y))',\n", + " '+',\n", + " '+',\n", + " '+def INT():',\n", + " '+ return int(eval(input()))',\n", + " '+',\n", + " '+',\n", + " '+def MAP():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+def LIST(N=None):',\n", + " '+ return list(MAP()) if N is None else [INT() for i in range(N)]',\n", + " '+',\n", + " '+',\n", + " '+def Yes():',\n", + " '+ print(\"Yes\")',\n", + " '+',\n", + " '+',\n", + " '+def No():',\n", + " '+ print(\"No\")',\n", + " '+',\n", + " '+',\n", + " '+def YES():',\n", + " '+ print(\"YES\")',\n", + " '+',\n", + " '+',\n", + " '+def NO():',\n", + " '+ print(\"NO\")',\n", + " '+',\n", + " '+',\n", + " '+sys.setrecursionlimit(10**9)',\n", + " '+INF = float(\"inf\")',\n", + " '-def fact_prime(num):',\n", + " '- d = defaultdict(int)',\n", + " '+def factorize(num: int) -> dict:',\n", + " '+ \"\"\"素因数分解\"\"\"',\n", + " '+ from math import sqrt',\n", + " '+ from collections import Counter',\n", + " '+',\n", + " '+ d = Counter()',\n", + " '- end = int(sqrt(num)) + 1',\n", + " '- for i in range(2, end + 1):',\n", + " '- cnt = 0',\n", + " '+ for i in range(2, int(sqrt(num)) + 1):',\n", + " '- # 1まで来たら終了',\n", + " '+ # 1まで分解したら終了',\n", + " '- # 最後までそのまま来たやつはnumが素数(ただし1^1は1^0なので数に入れない)',\n", + " '+ # 最後に残ったnumは素数(ただし1^1は1^0なので数に入れない)',\n", + " '-# とりあえずv+N-1が収まればいいはず',\n", + " '-MAX = 10**5 * 2',\n", + " '-# 予め組み合わせ計算に必要な階乗と逆元のテーブルを作っておく',\n", + " '-factorial = [1] * (MAX)',\n", + " '-factorial[0] = factorial[1] = 1',\n", + " '-for i in range(2, MAX):',\n", + " '- factorial[i] = factorial[i - 1] * i % MOD',\n", + " '-inverse = [1] * (MAX)',\n", + " '-# powに第三引数入れると冪乗のmod付計算を高速にやってくれる',\n", + " '-inverse[MAX - 1] = pow(factorial[MAX - 1], MOD - 2, MOD)',\n", + " '-for i in range(MAX - 2, 0, -1):',\n", + " '- # 最後から戻っていくこのループならH+W回powするより処理が速い',\n", + " '- inverse[i] = inverse[i + 1] * (i + 1) % MOD',\n", + " '-# 組み合わせの数',\n", + " '-def nCr(n, r):',\n", + " '- # 10C7 = 10C3',\n", + " '- r = min(r, n - r)',\n", + " '- # 分子の計算',\n", + " '- numerator = factorial[n]',\n", + " '- # 分母の計算',\n", + " '- denominator = inverse[r] * inverse[n - r] % MOD',\n", + " '- return numerator * denominator % MOD',\n", + " '+class FactInvMOD:',\n", + " '+ \"\"\"階乗たくさん使う時用のテーブル準備\"\"\"',\n", + " '+',\n", + " '+ def __init__(self, MAX, MOD):',\n", + " '+ \"\"\"MAX：階乗に使う数値の最大以上まで作る\"\"\"',\n", + " '+ MAX += 1',\n", + " '+ self.MAX = MAX',\n", + " '+ self.MOD = MOD',\n", + " '+ # 階乗テーブル',\n", + " '+ factorial = [1] * MAX',\n", + " '+ factorial[0] = factorial[1] = 1',\n", + " '+ for i in range(2, MAX):',\n", + " '+ factorial[i] = factorial[i - 1] * i % MOD',\n", + " '+ # 階乗の逆元テーブル',\n", + " '+ inverse = [1] * MAX',\n", + " '+ # powに第三引数入れると冪乗のmod付計算を高速にやってくれる',\n", + " '+ inverse[MAX - 1] = pow(factorial[MAX - 1], MOD - 2, MOD)',\n", + " '+ for i in range(MAX - 2, 0, -1):',\n", + " '+ # 最後から戻っていくこのループならMAX回powするより処理が速い',\n", + " '+ inverse[i] = inverse[i + 1] * (i + 1) % MOD',\n", + " '+ self.fact = factorial',\n", + " '+ self.inv = inverse',\n", + " '+',\n", + " '+ def nCr(self, n, r):',\n", + " '+ \"\"\"組み合わせの数 (必要な階乗と逆元のテーブルを事前に作っておく)\"\"\"',\n", + " '+ if n < r:',\n", + " '+ return 0',\n", + " '+ # 10C7 = 10C3',\n", + " '+ r = min(r, n - r)',\n", + " '+ # 分子の計算',\n", + " '+ numerator = self.fact[n]',\n", + " '+ # 分母の計算',\n", + " '+ denominator = self.inv[r] * self.inv[n - r] % self.MOD',\n", + " '+ return numerator * denominator % self.MOD',\n", + " '+',\n", + " '+ def nPr(self, n, r):',\n", + " '+ \"\"\"順列\"\"\"',\n", + " '+ if n < r:',\n", + " '+ return 0',\n", + " '+ return self.fact[n] * self.inv[n - r] % self.MOD',\n", + " '+',\n", + " '+ def nHr(self, n, r):',\n", + " '+ \"\"\"重複組み合わせ\"\"\"',\n", + " '+ # r個選ぶところにN-1個の仕切りを入れる',\n", + " '+ return self.nCr(r + n - 1, r)',\n", + " '-N, M = list(map(int, input().split()))',\n", + " '-# d = fact_prime(M)',\n", + " '-# print(d)',\n", + " '+N, M = MAP()',\n", + " '+d = factorize(M)',\n", + " '+# 例外処理',\n", + " '+if not d:',\n", + " '+ print((1))',\n", + " '+ exit()',\n", + " '+MAX = N + max(d.values())',\n", + " '+fim = FactInvMOD(MAX, MOD)',\n", + " '-for k, v in list(fact_prime(M).items()):',\n", + " '- # 重複組み合わせ',\n", + " '- # v個のkとN-1個の仕切りから、v個を並べる(v+N-1個のマスからv個を選び出す組み合わせ)',\n", + " '- ans = (ans * nCr(v + N - 1, v)) % MOD',\n", + " '+for k, v in list(d.items()):',\n", + " '+ ans *= fim.nHr(N, v)',\n", + " '+ ans %= MOD'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4126218548,\n", + " 'measured_runtime_v1': 0.2794496491,\n", + " 'runtime_lift': 5.0550138793,\n", + " 'key': ['s242527358', 's893815197']},\n", + " {'user_id': 'u628335443',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's314983266',\n", + " 'submission_id_v1': 's746344991',\n", + " 'cpu_time_v0': 1077,\n", + " 'cpu_time_v1': 699,\n", + " 'memory_v0': 56144,\n", + " 'memory_v1': 50192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.1,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\na = np.array([input().split() for i in range(N)], dtype=int)\\n\\n\\n\\ndp = np.zeros((N, 3), dtype=int)\\n\\ndp[0] = a[0]\\n\\n\\n\\nfor i in range(1, N):\\n\\n dp[i] = [\\n\\n a[i][0] + max(dp[i - 1][1], dp[i - 1][2]),\\n\\n a[i][1] + max(dp[i - 1][2], dp[i - 1][0]),\\n\\n a[i][2] + max(dp[i - 1][0], dp[i - 1][1]),\\n\\n ]\\n\\n\\n\\nprint((np.max(dp[-1])))\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\na = [list(map(int, input().split())) for _ in range(N)]\\n\\n\\n\\ndp = [[0, 0, 0] for _ in range(N+1)]\\n\\n\\n\\nfor i in range(N):\\n\\n for j in range(3):\\n\\n for k in range(3):\\n\\n if j == k:\\n\\n continue\\n\\n dp[i+1][k] = max(dp[i+1][k], dp[i][j] + a[i][k])\\n\\n\\n\\nprint((max(dp[-1])))\\n',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 379,\n", + " 'code_v1_num_chars': 322,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\na = np.array([input().split() for i in range(N)], dtype=int)\\ndp = np.zeros((N, 3), dtype=int)\\ndp[0] = a[0]\\nfor i in range(1, N):\\n dp[i] = [\\n a[i][0] + max(dp[i - 1][1], dp[i - 1][2]),\\n a[i][1] + max(dp[i - 1][2], dp[i - 1][0]),\\n a[i][2] + max(dp[i - 1][0], dp[i - 1][1]),\\n ]\\nprint((np.max(dp[-1])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\na = [list(map(int, input().split())) for _ in range(N)]\\ndp = [[0, 0, 0] for _ in range(N + 1)]\\nfor i in range(N):\\n for j in range(3):\\n for k in range(3):\\n if j == k:\\n continue\\n dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])\\nprint((max(dp[-1])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.75,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-a = np.array([input().split() for i in range(N)], dtype=int)',\n", + " '-dp = np.zeros((N, 3), dtype=int)',\n", + " '-dp[0] = a[0]',\n", + " '-for i in range(1, N):',\n", + " '- dp[i] = [',\n", + " '- a[i][0] + max(dp[i - 1][1], dp[i - 1][2]),',\n", + " '- a[i][1] + max(dp[i - 1][2], dp[i - 1][0]),',\n", + " '- a[i][2] + max(dp[i - 1][0], dp[i - 1][1]),',\n", + " '- ]',\n", + " '-print((np.max(dp[-1])))',\n", + " '+a = [list(map(int, input().split())) for _ in range(N)]',\n", + " '+dp = [[0, 0, 0] for _ in range(N + 1)]',\n", + " '+for i in range(N):',\n", + " '+ for j in range(3):',\n", + " '+ for k in range(3):',\n", + " '+ if j == k:',\n", + " '+ continue',\n", + " '+ dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])',\n", + " '+print((max(dp[-1])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3170761042,\n", + " 'measured_runtime_v1': 0.2653971686,\n", + " 'runtime_lift': 4.9626607205,\n", + " 'key': ['s314983266', 's746344991']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p02921',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's533958811',\n", + " 'submission_id_v1': 's140590362',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': '# 2019-11-17 20:44:23(JST)\\n\\nimport sys\\n\\n# import collections\\n\\n# import math\\n\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\n\\n# import itertools\\n\\n# from functools import reduce\\n\\n# import operator as op\\n\\n# import re\\n\\n# import heapq\\n\\n# import array\\n\\n# from scipy.misc import comb # (default: exact=False)\\n\\n# import numpy as np \\n\\n\\n\\n\\n\\ndef main():\\n\\n s, t = sys.stdin.read().split()\\n\\n\\n\\n count = 0\\n\\n for i in range(3):\\n\\n if s[i] == t[i]:\\n\\n count += 1\\n\\n print(count)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': \"import sys\\n\\n\\n\\ns, t = sys.stdin.read().split()\\n\\n\\n\\ndef main():\\n\\n cnt = 0\\n\\n for i in range(3):\\n\\n if s[i] == t[i]:\\n\\n cnt += 1\\n\\n return cnt\\n\\n \\n\\nif __name__ == '__main__':\\n\\n ans = main()\\n\\n print(ans)\",\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 611,\n", + " 'code_v1_num_chars': 229,\n", + " 'code_v0_no_empty_lines': '# 2019-11-17 20:44:23(JST)\\nimport sys\\n\\n# import collections\\n# import math\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\n# import itertools\\n# from functools import reduce\\n# import operator as op\\n# import re\\n# import heapq\\n# import array\\n# from scipy.misc import comb # (default: exact=False)\\n# import numpy as np\\ndef main():\\n s, t = sys.stdin.read().split()\\n count = 0\\n for i in range(3):\\n if s[i] == t[i]:\\n count += 1\\n print(count)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ns, t = sys.stdin.read().split()\\n\\n\\ndef main():\\n cnt = 0\\n for i in range(3):\\n if s[i] == t[i]:\\n cnt += 1\\n return cnt\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-# 2019-11-17 20:44:23(JST)',\n", + " '-# import collections',\n", + " '-# import math',\n", + " '-# from string import ascii_lowercase, ascii_uppercase, digits',\n", + " '-# from bisect import bisect_left as bi_l, bisect_right as bi_r',\n", + " '-# import itertools',\n", + " '-# from functools import reduce',\n", + " '-# import operator as op',\n", + " '-# import re',\n", + " '-# import heapq',\n", + " '-# import array',\n", + " '-# from scipy.misc import comb # (default: exact=False)',\n", + " '-# import numpy as np',\n", + " '+s, t = sys.stdin.read().split()',\n", + " '+',\n", + " '+',\n", + " '- s, t = sys.stdin.read().split()',\n", + " '- count = 0',\n", + " '+ cnt = 0',\n", + " '- count += 1',\n", + " '- print(count)',\n", + " '+ cnt += 1',\n", + " '+ return cnt',\n", + " '- main()',\n", + " '+ ans = main()',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2871051877,\n", + " 'measured_runtime_v1': 0.085240711,\n", + " 'runtime_lift': 3.3681697905,\n", + " 'key': ['s533958811', 's140590362']},\n", + " {'user_id': 'u923662841',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's990999147',\n", + " 'submission_id_v1': 's307361938',\n", + " 'cpu_time_v0': 211,\n", + " 'cpu_time_v1': 159,\n", + " 'memory_v0': 34024,\n", + " 'memory_v1': 31160,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 24.64,\n", + " 'input': 'import statistics\\n\\nN = int(eval(input()))\\n\\nA = [int(a)-i-1 for i,a in enumerate(input().split(),1)]\\n\\nb = statistics.median_low(A)\\n\\nc = statistics.median_high(A)\\n\\nd = sum([abs(x-b) for x in A])\\n\\ne = sum([abs(x-c) for x in A])\\n\\nprint((min(d,e)))',\n", + " 'target': 'N=int(eval(input()))\\n\\nA=sorted(a-i-1 for i,a in enumerate(map(int,input().split())))\\n\\nprint((sum(abs(a-A[N//2]) for a in A)))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 241,\n", + " 'code_v1_num_chars': 117,\n", + " 'code_v0_no_empty_lines': 'import statistics\\n\\nN = int(eval(input()))\\nA = [int(a) - i - 1 for i, a in enumerate(input().split(), 1)]\\nb = statistics.median_low(A)\\nc = statistics.median_high(A)\\nd = sum([abs(x - b) for x in A])\\ne = sum([abs(x - c) for x in A])\\nprint((min(d, e)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = sorted(a - i - 1 for i, a in enumerate(map(int, input().split())))\\nprint((sum(abs(a - A[N // 2]) for a in A)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 62.5,\n", + " 'diff': ['-import statistics',\n", + " '-',\n", + " '-A = [int(a) - i - 1 for i, a in enumerate(input().split(), 1)]',\n", + " '-b = statistics.median_low(A)',\n", + " '-c = statistics.median_high(A)',\n", + " '-d = sum([abs(x - b) for x in A])',\n", + " '-e = sum([abs(x - c) for x in A])',\n", + " '-print((min(d, e)))',\n", + " '+A = sorted(a - i - 1 for i, a in enumerate(map(int, input().split())))',\n", + " '+print((sum(abs(a - A[N // 2]) for a in A)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3014758439,\n", + " 'measured_runtime_v1': 0.2369829128,\n", + " 'runtime_lift': 1.2721416931,\n", + " 'key': ['s990999147', 's307361938']},\n", + " {'user_id': 'u930705402',\n", + " 'problem_id': 'p03723',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's632911465',\n", + " 'submission_id_v1': 's017275362',\n", + " 'cpu_time_v0': 1018,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 98.23,\n", + " 'input': 'import time\\n\\nt=time.time()\\n\\nA,B,C=list(map(int,input().split()))\\n\\ncnt=0\\n\\nwhile(A%2==B%2==C%2==0):\\n\\n a,b,c=A,B,C\\n\\n A=b//2+c//2;B=a//2+c//2;C=a//2+b//2\\n\\n cnt+=1\\n\\n if(time.time()-t>=1):\\n\\n print((-1))\\n\\n exit()\\n\\nprint(cnt)',\n", + " 'target': 'A,B,C=list(map(int,input().split()))\\n\\ncnt=0\\n\\nif(A==B==C):\\n\\n if A%2!=0:\\n\\n print((0))\\n\\n else:\\n\\n print((-1))\\n\\n exit()\\n\\nwhile(A%2==B%2==C%2==0):\\n\\n a,b,c=A,B,C\\n\\n A=b//2+c//2;B=a//2+c//2;C=a//2+b//2\\n\\n cnt+=1\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 235,\n", + " 'code_v1_num_chars': 235,\n", + " 'code_v0_no_empty_lines': 'import time\\n\\nt = time.time()\\nA, B, C = list(map(int, input().split()))\\ncnt = 0\\nwhile A % 2 == B % 2 == C % 2 == 0:\\n a, b, c = A, B, C\\n A = b // 2 + c // 2\\n B = a // 2 + c // 2\\n C = a // 2 + b // 2\\n cnt += 1\\n if time.time() - t >= 1:\\n print((-1))\\n exit()\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C = list(map(int, input().split()))\\ncnt = 0\\nif A == B == C:\\n if A % 2 != 0:\\n print((0))\\n else:\\n print((-1))\\n exit()\\nwhile A % 2 == B % 2 == C % 2 == 0:\\n a, b, c = A, B, C\\n A = b // 2 + c // 2\\n B = a // 2 + c // 2\\n C = a // 2 + b // 2\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['-import time',\n", + " '-',\n", + " '-t = time.time()',\n", + " '+if A == B == C:',\n", + " '+ if A % 2 != 0:',\n", + " '+ print((0))',\n", + " '+ else:',\n", + " '+ print((-1))',\n", + " '+ exit()',\n", + " '- if time.time() - t >= 1:',\n", + " '- print((-1))',\n", + " '- exit()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4561348832,\n", + " 'measured_runtime_v1': 0.2831880744,\n", + " 'runtime_lift': 1.6107136015,\n", + " 'key': ['s632911465', 's017275362']},\n", + " {'user_id': 'u193598069',\n", + " 'problem_id': 'p03544',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's403516424',\n", + " 'submission_id_v1': 's258691406',\n", + " 'cpu_time_v0': 27,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 10740,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.04,\n", + " 'input': 'N = int(eval(input()))\\n\\nL = [ 0 ] * 1000000\\n\\n\\n\\nL[0] = 2\\n\\nL[1] = 1\\n\\n\\n\\nfor i in range(2, N+1):\\n\\n L[i] = L[i-2] + L[i-1]\\n\\n\\n\\nprint((L[N]))\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nL = [ 0 ] * (N+1)\\n\\n\\n\\nL[0] = 2\\n\\nL[1] = 1\\n\\n\\n\\nfor i in range(2, N+1):\\n\\n L[i] = L[i-2] + L[i-1]\\n\\n\\n\\nprint((L[N]))\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 129,\n", + " 'code_v1_num_chars': 127,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nL = [0] * 1000000\\nL[0] = 2\\nL[1] = 1\\nfor i in range(2, N + 1):\\n L[i] = L[i - 2] + L[i - 1]\\nprint((L[N]))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nL = [0] * (N + 1)\\nL[0] = 2\\nL[1] = 1\\nfor i in range(2, N + 1):\\n L[i] = L[i - 2] + L[i - 1]\\nprint((L[N]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-L = [0] * 1000000', '+L = [0] * (N + 1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4811118691,\n", + " 'measured_runtime_v1': 0.3226976706,\n", + " 'runtime_lift': 1.4909059249,\n", + " 'key': ['s403516424', 's258691406']},\n", + " {'user_id': 'u887207211',\n", + " 'problem_id': 'p03086',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's916999030',\n", + " 'submission_id_v1': 's575230730',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3188,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'import re\\n\\nptn = re.compile(r\"(A|C|G|T)*\")\\n\\n\\n\\nS = eval(input())\\n\\n\\n\\nans = 0\\n\\nfor i in range(len(S)):\\n\\n for j in range(len(S)):\\n\\n x = ptn.match(S[i:i+j+1]).group(0)\\n\\n if(x):\\n\\n ans = max(ans, len(x))\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\n\\n\\nstdin = sys.stdin\\n\\n\\n\\nns = lambda : stdin.readline().rstrip()\\n\\nni = lambda : int(ns())\\n\\nna = lambda : list(map(int, stdin.readline().split()))\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\ndef check(In):\\n\\n return In != \"A\" and In != \"C\" and In != \"G\" and In != \"T\"\\n\\n\\n\\ndef main():\\n\\n s = ns()\\n\\n\\n\\n count = 0\\n\\n ans = 0\\n\\n for i in range(len(s)):\\n\\n if check(s[i]):\\n\\n count = 0\\n\\n else:\\n\\n count += 1\\n\\n ans = max(ans, count)\\n\\n print(ans)\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 214,\n", + " 'code_v1_num_chars': 537,\n", + " 'code_v0_no_empty_lines': 'import re\\n\\nptn = re.compile(r\"(A|C|G|T)*\")\\nS = eval(input())\\nans = 0\\nfor i in range(len(S)):\\n for j in range(len(S)):\\n x = ptn.match(S[i : i + j + 1]).group(0)\\n if x:\\n ans = max(ans, len(x))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nstdin = sys.stdin\\nns = lambda: stdin.readline().rstrip()\\nni = lambda: int(ns())\\nna = lambda: list(map(int, stdin.readline().split()))\\nsys.setrecursionlimit(10**7)\\n\\n\\ndef check(In):\\n return In != \"A\" and In != \"C\" and In != \"G\" and In != \"T\"\\n\\n\\ndef main():\\n s = ns()\\n count = 0\\n ans = 0\\n for i in range(len(s)):\\n if check(s[i]):\\n count = 0\\n else:\\n count += 1\\n ans = max(ans, count)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.5555555556,\n", + " 'diff': ['-import re',\n", + " '+import sys',\n", + " '-ptn = re.compile(r\"(A|C|G|T)*\")',\n", + " '-S = eval(input())',\n", + " '-ans = 0',\n", + " '-for i in range(len(S)):',\n", + " '- for j in range(len(S)):',\n", + " '- x = ptn.match(S[i : i + j + 1]).group(0)',\n", + " '- if x:',\n", + " '- ans = max(ans, len(x))',\n", + " '-print(ans)',\n", + " '+stdin = sys.stdin',\n", + " '+ns = lambda: stdin.readline().rstrip()',\n", + " '+ni = lambda: int(ns())',\n", + " '+na = lambda: list(map(int, stdin.readline().split()))',\n", + " '+sys.setrecursionlimit(10**7)',\n", + " '+',\n", + " '+',\n", + " '+def check(In):',\n", + " '+ return In != \"A\" and In != \"C\" and In != \"G\" and In != \"T\"',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ s = ns()',\n", + " '+ count = 0',\n", + " '+ ans = 0',\n", + " '+ for i in range(len(s)):',\n", + " '+ if check(s[i]):',\n", + " '+ count = 0',\n", + " '+ else:',\n", + " '+ count += 1',\n", + " '+ ans = max(ans, count)',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3654596429,\n", + " 'measured_runtime_v1': 0.2052364919,\n", + " 'runtime_lift': 1.7806757436,\n", + " 'key': ['s916999030', 's575230730']},\n", + " {'user_id': 'u293528047',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's372211236',\n", + " 'submission_id_v1': 's213603098',\n", + " 'cpu_time_v0': 393,\n", + " 'cpu_time_v1': 115,\n", + " 'memory_v0': 33764,\n", + " 'memory_v1': 25060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 70.74,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN, K= list(map(int, input().split()))\\n\\np = np.array(list(map(int, input().split())))\\n\\n\\n\\ntmp = np.sum(p[:K])\\n\\nmax = tmp\\n\\nfor i in range(N-K):\\n\\n tmp = tmp-p[i]+p[i+K]\\n\\n if tmp>max:\\n\\n max = tmp\\n\\n\\n\\nprint(((max+K)/2))',\n", + " 'target': 'N, K= list(map(int, input().split()))\\n\\np = list(map(int, input().split()))\\n\\n\\n\\ntmp = sum(p[:K])\\n\\nmax = tmp\\n\\nfor i in range(N-K):\\n\\n tmp = tmp-p[i]+p[i+K]\\n\\n if tmp>max:\\n\\n max = tmp\\n\\n\\n\\nprint(((max+K)/2))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 239,\n", + " 'code_v1_num_chars': 204,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\np = np.array(list(map(int, input().split())))\\ntmp = np.sum(p[:K])\\nmax = tmp\\nfor i in range(N - K):\\n tmp = tmp - p[i] + p[i + K]\\n if tmp > max:\\n max = tmp\\nprint(((max + K) / 2))\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\np = list(map(int, input().split()))\\ntmp = sum(p[:K])\\nmax = tmp\\nfor i in range(N - K):\\n tmp = tmp - p[i] + p[i + K]\\n if tmp > max:\\n max = tmp\\nprint(((max + K) / 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-p = np.array(list(map(int, input().split())))',\n", + " '-tmp = np.sum(p[:K])',\n", + " '+p = list(map(int, input().split()))',\n", + " '+tmp = sum(p[:K])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5991840155,\n", + " 'measured_runtime_v1': 0.2738144584,\n", + " 'runtime_lift': 5.8403928886,\n", + " 'key': ['s372211236', 's213603098']},\n", + " {'user_id': 'u094191970',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's681282504',\n", + " 'submission_id_v1': 's043765093',\n", + " 'cpu_time_v0': 508,\n", + " 'cpu_time_v1': 204,\n", + " 'memory_v0': 23412,\n", + " 'memory_v1': 23592,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.84,\n", + " 'input': 'import numpy as np\\n\\nn=int(eval(input()))\\n\\ns=np.argsort(np.array(list(map(int,input().split()))))+1\\n\\nprint((*s))',\n", + " 'target': 'n=int(eval(input()))\\n\\na=list(map(int,input().split()))\\n\\nl=sorted([[inx+1,j] for inx,j in enumerate(a)],key=lambda x:x[1])\\n\\nans=[i for i,j in l]\\n\\nprint((*ans))',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 103,\n", + " 'code_v1_num_chars': 150,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\ns = np.argsort(np.array(list(map(int, input().split())))) + 1\\nprint((*s))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nl = sorted([[inx + 1, j] for inx, j in enumerate(a)], key=lambda x: x[1])\\nans = [i for i, j in l]\\nprint((*ans))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-s = np.argsort(np.array(list(map(int, input().split())))) + 1',\n", + " '-print((*s))',\n", + " '+a = list(map(int, input().split()))',\n", + " '+l = sorted([[inx + 1, j] for inx, j in enumerate(a)], key=lambda x: x[1])',\n", + " '+ans = [i for i, j in l]',\n", + " '+print((*ans))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8138762745,\n", + " 'measured_runtime_v1': 0.2870095253,\n", + " 'runtime_lift': 6.3199166387,\n", + " 'key': ['s681282504', 's043765093']},\n", + " {'user_id': 'u952708174',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's922291815',\n", + " 'submission_id_v1': 's412525457',\n", + " 'cpu_time_v0': 717,\n", + " 'cpu_time_v1': 455,\n", + " 'memory_v0': 194972,\n", + " 'memory_v1': 129708,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 36.54,\n", + " 'input': \"def d_cake_123_binary_search(X, Y, Z, K, A, B, C):\\n\\n # editionalの解法4 O(K^2log(max(P))\\n\\n # 参考: https://atcoder.jp/contests/abc123/submissions/4871511\\n\\n import bisect\\n\\n ab = sorted([e1 + e2 for e2 in B for e1 in A]) # A, Bの要素は全部調べる\\n\\n\\n\\n # rejected 以上の値は、美味しさの合計がそれ以上である個数がK個未満である\\n\\n accepted, rejected = -1, 10**11\\n\\n while abs(accepted - rejected) > 1:\\n\\n mid = (accepted + rejected) // 2\\n\\n count = sum([len(ab) - bisect.bisect_left(ab, mid - e) for e in C])\\n\\n if count >= K:\\n\\n accepted = mid\\n\\n else:\\n\\n rejected = mid\\n\\n\\n\\n ans = []\\n\\n for e in C:\\n\\n idx = bisect.bisect_left(ab, accepted - e)\\n\\n for i in range(idx, len(ab)):\\n\\n ans.append(e + ab[i])\\n\\n ans.sort(reverse=True)\\n\\n return '\\\\n'.join(map(str, ans[:K]))\\n\\n\\n\\nX, Y, Z, K = [int(i) for i in input().split()]\\n\\nA = [int(i) for i in input().split()]\\n\\nB = [int(i) for i in input().split()]\\n\\nC = [int(i) for i in input().split()]\\n\\nprint((d_cake_123_binary_search(X, Y, Z, K, A, B, C)))\",\n", + " 'target': 'def d_cake_123_sort_modified():\\n\\n \"\"\"editorial の解法 1.\"\"\"\\n\\n import sys\\n\\n import numpy as np\\n\\n input = sys.stdin.readline\\n\\n X, Y, Z, K = [int(i) for i in input().split()]\\n\\n A = np.array([int(i) for i in input().split()])\\n\\n B = np.array([int(i) for i in input().split()])\\n\\n C = np.array([int(i) for i in input().split()])\\n\\n\\n\\n _a, _b = np.meshgrid(A, B)\\n\\n ab = np.sort((_a + _b).flatten())[::-1][:K]\\n\\n _ab, _c = np.meshgrid(ab, C)\\n\\n ans = np.sort((_ab + _c).flatten())[::-1][:K]\\n\\n return \\'\\\\n\\'.join(map(str, ans))\\n\\n\\n\\nprint((d_cake_123_sort_modified()))',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 1033,\n", + " 'code_v1_num_chars': 584,\n", + " 'code_v0_no_empty_lines': 'def d_cake_123_binary_search(X, Y, Z, K, A, B, C):\\n # editionalの解法4 O(K^2log(max(P))\\n # 参考: https://atcoder.jp/contests/abc123/submissions/4871511\\n import bisect\\n\\n ab = sorted([e1 + e2 for e2 in B for e1 in A]) # A, Bの要素は全部調べる\\n # rejected 以上の値は、美味しさの合計がそれ以上である個数がK個未満である\\n accepted, rejected = -1, 10**11\\n while abs(accepted - rejected) > 1:\\n mid = (accepted + rejected) // 2\\n count = sum([len(ab) - bisect.bisect_left(ab, mid - e) for e in C])\\n if count >= K:\\n accepted = mid\\n else:\\n rejected = mid\\n ans = []\\n for e in C:\\n idx = bisect.bisect_left(ab, accepted - e)\\n for i in range(idx, len(ab)):\\n ans.append(e + ab[i])\\n ans.sort(reverse=True)\\n return \"\\\\n\".join(map(str, ans[:K]))\\n\\n\\nX, Y, Z, K = [int(i) for i in input().split()]\\nA = [int(i) for i in input().split()]\\nB = [int(i) for i in input().split()]\\nC = [int(i) for i in input().split()]\\nprint((d_cake_123_binary_search(X, Y, Z, K, A, B, C)))\\n',\n", + " 'code_v1_no_empty_lines': 'def d_cake_123_sort_modified():\\n \"\"\"editorial の解法 1.\"\"\"\\n import sys\\n import numpy as np\\n\\n input = sys.stdin.readline\\n X, Y, Z, K = [int(i) for i in input().split()]\\n A = np.array([int(i) for i in input().split()])\\n B = np.array([int(i) for i in input().split()])\\n C = np.array([int(i) for i in input().split()])\\n _a, _b = np.meshgrid(A, B)\\n ab = np.sort((_a + _b).flatten())[::-1][:K]\\n _ab, _c = np.meshgrid(ab, C)\\n ans = np.sort((_ab + _c).flatten())[::-1][:K]\\n return \"\\\\n\".join(map(str, ans))\\n\\n\\nprint((d_cake_123_sort_modified()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.3793103448,\n", + " 'diff': ['-def d_cake_123_binary_search(X, Y, Z, K, A, B, C):',\n", + " '- # editionalの解法4 O(K^2log(max(P))',\n", + " '- # 参考: https://atcoder.jp/contests/abc123/submissions/4871511',\n", + " '- import bisect',\n", + " '+def d_cake_123_sort_modified():',\n", + " '+ \"\"\"editorial の解法 1.\"\"\"',\n", + " '+ import sys',\n", + " '+ import numpy as np',\n", + " '- ab = sorted([e1 + e2 for e2 in B for e1 in A]) # A, Bの要素は全部調べる',\n", + " '- # rejected 以上の値は、美味しさの合計がそれ以上である個数がK個未満である',\n", + " '- accepted, rejected = -1, 10**11',\n", + " '- while abs(accepted - rejected) > 1:',\n", + " '- mid = (accepted + rejected) // 2',\n", + " '- count = sum([len(ab) - bisect.bisect_left(ab, mid - e) for e in C])',\n", + " '- if count >= K:',\n", + " '- accepted = mid',\n", + " '- else:',\n", + " '- rejected = mid',\n", + " '- ans = []',\n", + " '- for e in C:',\n", + " '- idx = bisect.bisect_left(ab, accepted - e)',\n", + " '- for i in range(idx, len(ab)):',\n", + " '- ans.append(e + ab[i])',\n", + " '- ans.sort(reverse=True)',\n", + " '- return \"\\\\n\".join(map(str, ans[:K]))',\n", + " '+ input = sys.stdin.readline',\n", + " '+ X, Y, Z, K = [int(i) for i in input().split()]',\n", + " '+ A = np.array([int(i) for i in input().split()])',\n", + " '+ B = np.array([int(i) for i in input().split()])',\n", + " '+ C = np.array([int(i) for i in input().split()])',\n", + " '+ _a, _b = np.meshgrid(A, B)',\n", + " '+ ab = np.sort((_a + _b).flatten())[::-1][:K]',\n", + " '+ _ab, _c = np.meshgrid(ab, C)',\n", + " '+ ans = np.sort((_ab + _c).flatten())[::-1][:K]',\n", + " '+ return \"\\\\n\".join(map(str, ans))',\n", + " '-X, Y, Z, K = [int(i) for i in input().split()]',\n", + " '-A = [int(i) for i in input().split()]',\n", + " '-B = [int(i) for i in input().split()]',\n", + " '-C = [int(i) for i in input().split()]',\n", + " '-print((d_cake_123_binary_search(X, Y, Z, K, A, B, C)))',\n", + " '+print((d_cake_123_sort_modified()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1953599396,\n", + " 'measured_runtime_v1': 0.0065046697,\n", + " 'runtime_lift': 30.0337986858,\n", + " 'key': ['s922291815', 's412525457']},\n", + " {'user_id': 'u291766461',\n", + " 'problem_id': 'p03074',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's221518045',\n", + " 'submission_id_v1': 's305948108',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 123,\n", + " 'memory_v0': 4212,\n", + " 'memory_v1': 7884,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.45,\n", + " 'input': 'N, K = list(map(int, input().split()))\\n\\nS = eval(input())\\n\\nnums = []\\n\\nnow = 1\\n\\ncnt = 0\\n\\nfor i in range(N):\\n\\n if S[i] == str(now):\\n\\n cnt += 1\\n\\n else:\\n\\n nums.append(cnt)\\n\\n now = 1 - now\\n\\n cnt = 1\\n\\nif cnt != 0:\\n\\n nums.append(cnt)\\n\\nif len(nums) % 2 == 0:\\n\\n nums.append(0)\\n\\n\\n\\nadd = 2 * K + 1\\n\\nans = 0\\n\\nleft = 0\\n\\nright = 0\\n\\ntmp = 0\\n\\nfor i in range(0, len(nums), 2):\\n\\n\\n\\n next_left = i\\n\\n next_right = min(i + add, len(nums))\\n\\n\\n\\n while next_left > left:\\n\\n tmp -= nums[left]\\n\\n left += 1\\n\\n\\n\\n while next_right > right:\\n\\n tmp += nums[right]\\n\\n right += 1\\n\\n\\n\\n ans = max(ans, tmp)\\n\\nprint(ans)',\n", + " 'target': 'N, K = list(map(int, input().split()))\\n\\nS = eval(input())\\n\\nnums = []\\n\\nnow = 1\\n\\ncnt = 0\\n\\nfor i in range(N):\\n\\n if S[i] == str(now):\\n\\n cnt += 1\\n\\n else:\\n\\n nums.append(cnt)\\n\\n now = 1 - now\\n\\n cnt = 1\\n\\nif cnt != 0:\\n\\n nums.append(cnt)\\n\\nif len(nums) % 2 == 0:\\n\\n nums.append(0)\\n\\n\\n\\ncsum = [0] * (len(nums) + 1)\\n\\nfor i in range(len(nums)):\\n\\n csum[i + 1] = csum[i] + nums[i]\\n\\n\\n\\nadd = 2 * K + 1\\n\\nans = 0\\n\\ntmp = 0\\n\\nfor i in range(0, len(nums), 2):\\n\\n left = i\\n\\n right = min(i + add, len(nums))\\n\\n tmp = csum[right] - csum[left]\\n\\n ans = max(ans, tmp)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 37,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 647,\n", + " 'code_v1_num_chars': 587,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\nS = eval(input())\\nnums = []\\nnow = 1\\ncnt = 0\\nfor i in range(N):\\n if S[i] == str(now):\\n cnt += 1\\n else:\\n nums.append(cnt)\\n now = 1 - now\\n cnt = 1\\nif cnt != 0:\\n nums.append(cnt)\\nif len(nums) % 2 == 0:\\n nums.append(0)\\nadd = 2 * K + 1\\nans = 0\\nleft = 0\\nright = 0\\ntmp = 0\\nfor i in range(0, len(nums), 2):\\n next_left = i\\n next_right = min(i + add, len(nums))\\n while next_left > left:\\n tmp -= nums[left]\\n left += 1\\n while next_right > right:\\n tmp += nums[right]\\n right += 1\\n ans = max(ans, tmp)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nS = eval(input())\\nnums = []\\nnow = 1\\ncnt = 0\\nfor i in range(N):\\n if S[i] == str(now):\\n cnt += 1\\n else:\\n nums.append(cnt)\\n now = 1 - now\\n cnt = 1\\nif cnt != 0:\\n nums.append(cnt)\\nif len(nums) % 2 == 0:\\n nums.append(0)\\ncsum = [0] * (len(nums) + 1)\\nfor i in range(len(nums)):\\n csum[i + 1] = csum[i] + nums[i]\\nadd = 2 * K + 1\\nans = 0\\ntmp = 0\\nfor i in range(0, len(nums), 2):\\n left = i\\n right = min(i + add, len(nums))\\n tmp = csum[right] - csum[left]\\n ans = max(ans, tmp)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.9189189189,\n", + " 'diff': ['+csum = [0] * (len(nums) + 1)',\n", + " '+for i in range(len(nums)):',\n", + " '+ csum[i + 1] = csum[i] + nums[i]',\n", + " '-left = 0',\n", + " '-right = 0',\n", + " '- next_left = i',\n", + " '- next_right = min(i + add, len(nums))',\n", + " '- while next_left > left:',\n", + " '- tmp -= nums[left]',\n", + " '- left += 1',\n", + " '- while next_right > right:',\n", + " '- tmp += nums[right]',\n", + " '- right += 1',\n", + " '+ left = i',\n", + " '+ right = min(i + add, len(nums))',\n", + " '+ tmp = csum[right] - csum[left]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2166490428,\n", + " 'measured_runtime_v1': 0.0894378448,\n", + " 'runtime_lift': 2.422341945,\n", + " 'key': ['s221518045', 's305948108']},\n", + " {'user_id': 'u815878613',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's043802358',\n", + " 'submission_id_v1': 's120994164',\n", + " 'cpu_time_v0': 220,\n", + " 'cpu_time_v1': 195,\n", + " 'memory_v0': 27220,\n", + " 'memory_v1': 9100,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.36,\n", + " 'input': 'N, M = list(map(int, input().split()))\\n\\nLR = [list(map(int, input().split())) for _ in range(M)]\\n\\n\\n\\nleft = 1\\n\\nright = N\\n\\n\\n\\nfor l, r in LR:\\n\\n if left < l:\\n\\n left = l\\n\\n if right > r:\\n\\n right = r\\n\\n\\n\\nans = right - left\\n\\n\\n\\nprint((ans + 1 if ans >= 0 else 0))\\n',\n", + " 'target': 'N, M = list(map(int, input().split()))\\n\\n\\n\\nleft = 1\\n\\nright = N\\n\\n\\n\\nfor _ in range(M):\\n\\n l, r = list(map(int, input().split()))\\n\\n\\n\\n if left < l:\\n\\n left = l\\n\\n if right > r:\\n\\n right = r\\n\\n\\n\\nans = right - left\\n\\n\\n\\nprint((ans + 1 if ans >= 0 else 0))\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 266,\n", + " 'code_v1_num_chars': 251,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\nLR = [list(map(int, input().split())) for _ in range(M)]\\nleft = 1\\nright = N\\nfor l, r in LR:\\n if left < l:\\n left = l\\n if right > r:\\n right = r\\nans = right - left\\nprint((ans + 1 if ans >= 0 else 0))\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nleft = 1\\nright = N\\nfor _ in range(M):\\n l, r = list(map(int, input().split()))\\n if left < l:\\n left = l\\n if right > r:\\n right = r\\nans = right - left\\nprint((ans + 1 if ans >= 0 else 0))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.25,\n", + " 'diff': ['-LR = [list(map(int, input().split())) for _ in range(M)]',\n", + " '-for l, r in LR:',\n", + " '+for _ in range(M):',\n", + " '+ l, r = list(map(int, input().split()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2458969798,\n", + " 'measured_runtime_v1': 0.1910107524,\n", + " 'runtime_lift': 1.2873462706,\n", + " 'key': ['s043802358', 's120994164']},\n", + " {'user_id': 'u519939795',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's108105198',\n", + " 'submission_id_v1': 's959516011',\n", + " 'cpu_time_v0': 151,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12480,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.08,\n", + " 'input': 'import numpy as np\\n\\nn,d=list(map(int,input().split()))\\n\\nx=[list(map(int,input().split())) for i in range(n)]\\n\\ncount=0\\n\\nfor i in range(n-1):\\n\\n for j in range(i+1,n):\\n\\n a=np.array(x[i])\\n\\n b=np.array(x[j])\\n\\n ab=sum(np.power((a-b),2))**0.5\\n\\n if ab%1==0:\\n\\n count+=1\\n\\nprint(count)',\n", + " 'target': 'n,d=list(map(int,input().split()))\\n\\nL=[list(map(int,input().split())) for i in range(n)]\\n\\nans=0\\n\\nfor i in range(n-1):\\n\\n for j in range(i+1,n):\\n\\n a=0\\n\\n for k in range(d):\\n\\n a+=(L[i][k]-L[j][k])**2\\n\\n if int(a**0.5)==a**0.5:\\n\\n ans+=1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 310,\n", + " 'code_v1_num_chars': 282,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, d = list(map(int, input().split()))\\nx = [list(map(int, input().split())) for i in range(n)]\\ncount = 0\\nfor i in range(n - 1):\\n for j in range(i + 1, n):\\n a = np.array(x[i])\\n b = np.array(x[j])\\n ab = sum(np.power((a - b), 2)) ** 0.5\\n if ab % 1 == 0:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n, d = list(map(int, input().split()))\\nL = [list(map(int, input().split())) for i in range(n)]\\nans = 0\\nfor i in range(n - 1):\\n for j in range(i + 1, n):\\n a = 0\\n for k in range(d):\\n a += (L[i][k] - L[j][k]) ** 2\\n if int(a**0.5) == a**0.5:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-x = [list(map(int, input().split())) for i in range(n)]',\n", + " '-count = 0',\n", + " '+L = [list(map(int, input().split())) for i in range(n)]',\n", + " '+ans = 0',\n", + " '- a = np.array(x[i])',\n", + " '- b = np.array(x[j])',\n", + " '- ab = sum(np.power((a - b), 2)) ** 0.5',\n", + " '- if ab % 1 == 0:',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+ a = 0',\n", + " '+ for k in range(d):',\n", + " '+ a += (L[i][k] - L[j][k]) ** 2',\n", + " '+ if int(a**0.5) == a**0.5:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8732560987,\n", + " 'measured_runtime_v1': 0.2386262383,\n", + " 'runtime_lift': 7.8501681611,\n", + " 'key': ['s108105198', 's959516011']},\n", + " {'user_id': 'u525065967',\n", + " 'problem_id': 'p02574',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's426798312',\n", + " 'submission_id_v1': 's281371619',\n", + " 'cpu_time_v0': 542,\n", + " 'cpu_time_v1': 466,\n", + " 'memory_v0': 127576,\n", + " 'memory_v1': 127552,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.02,\n", + " 'input': \"def gen_d_prim(n):\\n\\n D = [n+1 if i%2 else 2 for i in range(n+1)]\\n\\n D[0] = D[1] = 0\\n\\n for i in range(3, n+1, 2):\\n\\n if D[i] != n+1: continue\\n\\n for j in range(i, n+1, i): D[j] = i\\n\\n return D\\n\\n\\n\\ndef is_pairwise(A):\\n\\n D = gen_d_prim(10**6)\\n\\n past = set()\\n\\n for a in A:\\n\\n now = set()\\n\\n while a != 1:\\n\\n # 素数 D[a]: 今回は未済 & 過去で済\\n\\n if not D[a] in now and D[a] in past: return False\\n\\n now.add(D[a])\\n\\n past.add(D[a])\\n\\n a //= D[a]\\n\\n return True\\n\\n\\n\\ndef gcd_all(A):\\n\\n from math import gcd\\n\\n g = 0\\n\\n for a in A: g = gcd(g, a)\\n\\n return g\\n\\n\\n\\ndef solve():\\n\\n if is_pairwise(A): return 0\\n\\n if gcd_all(A) == 1: return 1\\n\\n return 2\\n\\n\\n\\nn = int(eval(input()))\\n\\nA = [*list(map(int, input().split()))]\\n\\nprint((['pairwise','setwise','not'][solve()], 'coprime'))\\n\",\n", + " 'target': \"def gen_d_prim(n):\\n\\n D = [0,0] + [-1] * (n-1)\\n\\n for i in range(2, n+1, 2): D[i] = 2\\n\\n for i in range(3, n+1, 2):\\n\\n if D[i] > 0: continue\\n\\n for j in range(i, n+1, i): D[j] = i\\n\\n return D\\n\\n\\n\\ndef is_pairwise(A):\\n\\n D = gen_d_prim(10**6)\\n\\n past = set()\\n\\n for a in A:\\n\\n now = set()\\n\\n while a != 1:\\n\\n # 素数 D[a]: 今回は未済 & 過去で済\\n\\n if not D[a] in now and D[a] in past: return False\\n\\n now.add(D[a])\\n\\n past.add(D[a])\\n\\n a //= D[a]\\n\\n return True\\n\\n\\n\\ndef gcd_all(A):\\n\\n from math import gcd\\n\\n g = 0\\n\\n for a in A: g = gcd(g, a)\\n\\n return g\\n\\n\\n\\ndef solve():\\n\\n if is_pairwise(A): return 0\\n\\n if gcd_all(A) == 1: return 1\\n\\n return 2\\n\\n\\n\\nn = int(eval(input()))\\n\\nA = [*list(map(int, input().split()))]\\n\\nprint((['pairwise','setwise','not'][solve()], 'coprime'))\\n\",\n", + " 'code_v0_loc': 35,\n", + " 'code_v1_loc': 35,\n", + " 'code_v0_num_chars': 848,\n", + " 'code_v1_num_chars': 846,\n", + " 'code_v0_no_empty_lines': 'def gen_d_prim(n):\\n D = [n + 1 if i % 2 else 2 for i in range(n + 1)]\\n D[0] = D[1] = 0\\n for i in range(3, n + 1, 2):\\n if D[i] != n + 1:\\n continue\\n for j in range(i, n + 1, i):\\n D[j] = i\\n return D\\n\\n\\ndef is_pairwise(A):\\n D = gen_d_prim(10**6)\\n past = set()\\n for a in A:\\n now = set()\\n while a != 1:\\n # 素数 D[a]: 今回は未済 & 過去で済\\n if not D[a] in now and D[a] in past:\\n return False\\n now.add(D[a])\\n past.add(D[a])\\n a //= D[a]\\n return True\\n\\n\\ndef gcd_all(A):\\n from math import gcd\\n\\n g = 0\\n for a in A:\\n g = gcd(g, a)\\n return g\\n\\n\\ndef solve():\\n if is_pairwise(A):\\n return 0\\n if gcd_all(A) == 1:\\n return 1\\n return 2\\n\\n\\nn = int(eval(input()))\\nA = [*list(map(int, input().split()))]\\nprint(([\"pairwise\", \"setwise\", \"not\"][solve()], \"coprime\"))\\n',\n", + " 'code_v1_no_empty_lines': 'def gen_d_prim(n):\\n D = [0, 0] + [-1] * (n - 1)\\n for i in range(2, n + 1, 2):\\n D[i] = 2\\n for i in range(3, n + 1, 2):\\n if D[i] > 0:\\n continue\\n for j in range(i, n + 1, i):\\n D[j] = i\\n return D\\n\\n\\ndef is_pairwise(A):\\n D = gen_d_prim(10**6)\\n past = set()\\n for a in A:\\n now = set()\\n while a != 1:\\n # 素数 D[a]: 今回は未済 & 過去で済\\n if not D[a] in now and D[a] in past:\\n return False\\n now.add(D[a])\\n past.add(D[a])\\n a //= D[a]\\n return True\\n\\n\\ndef gcd_all(A):\\n from math import gcd\\n\\n g = 0\\n for a in A:\\n g = gcd(g, a)\\n return g\\n\\n\\ndef solve():\\n if is_pairwise(A):\\n return 0\\n if gcd_all(A) == 1:\\n return 1\\n return 2\\n\\n\\nn = int(eval(input()))\\nA = [*list(map(int, input().split()))]\\nprint(([\"pairwise\", \"setwise\", \"not\"][solve()], \"coprime\"))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- D = [n + 1 if i % 2 else 2 for i in range(n + 1)]',\n", + " '- D[0] = D[1] = 0',\n", + " '+ D = [0, 0] + [-1] * (n - 1)',\n", + " '+ for i in range(2, n + 1, 2):',\n", + " '+ D[i] = 2',\n", + " '- if D[i] != n + 1:',\n", + " '+ if D[i] > 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 4.0933866422,\n", + " 'measured_runtime_v1': 3.0755219285,\n", + " 'runtime_lift': 1.3309567408,\n", + " 'key': ['s426798312', 's281371619']},\n", + " {'user_id': 'u423966555',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's734835984',\n", + " 'submission_id_v1': 's256781932',\n", + " 'cpu_time_v0': 338,\n", + " 'cpu_time_v1': 178,\n", + " 'memory_v0': 16560,\n", + " 'memory_v1': 9056,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 47.34,\n", + " 'input': 'K = int(eval(input()))\\n\\n\\n\\nflg = [False]*K\\n\\n\\n\\ntmp = 7 % K\\n\\ncnt = 1\\n\\nif tmp == 0:\\n\\n print(cnt)\\n\\n exit()\\n\\nwhile True:\\n\\n tmp = (tmp*10+7)%K\\n\\n if flg[tmp]:\\n\\n print((-1))\\n\\n break\\n\\n else:\\n\\n cnt += 1\\n\\n if tmp == 0:\\n\\n print(cnt)\\n\\n break\\n\\n flg[tmp] = True\\n',\n", + " 'target': 'K = int(eval(input()))\\n\\nt = 7\\n\\nt %= K\\n\\n\\n\\nfor i in range(K+1):\\n\\n if t == 0:\\n\\n print((i+1))\\n\\n exit()\\n\\n t = (t*10+7)%K\\n\\nprint((-1))\\n',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 310,\n", + " 'code_v1_num_chars': 139,\n", + " 'code_v0_no_empty_lines': 'K = int(eval(input()))\\nflg = [False] * K\\ntmp = 7 % K\\ncnt = 1\\nif tmp == 0:\\n print(cnt)\\n exit()\\nwhile True:\\n tmp = (tmp * 10 + 7) % K\\n if flg[tmp]:\\n print((-1))\\n break\\n else:\\n cnt += 1\\n if tmp == 0:\\n print(cnt)\\n break\\n flg[tmp] = True\\n',\n", + " 'code_v1_no_empty_lines': 'K = int(eval(input()))\\nt = 7\\nt %= K\\nfor i in range(K + 1):\\n if t == 0:\\n print((i + 1))\\n exit()\\n t = (t * 10 + 7) % K\\nprint((-1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-flg = [False] * K',\n", + " '-tmp = 7 % K',\n", + " '-cnt = 1',\n", + " '-if tmp == 0:',\n", + " '- print(cnt)',\n", + " '- exit()',\n", + " '-while True:',\n", + " '- tmp = (tmp * 10 + 7) % K',\n", + " '- if flg[tmp]:',\n", + " '- print((-1))',\n", + " '- break',\n", + " '- else:',\n", + " '- cnt += 1',\n", + " '- if tmp == 0:',\n", + " '- print(cnt)',\n", + " '- break',\n", + " '- flg[tmp] = True',\n", + " '+t = 7',\n", + " '+t %= K',\n", + " '+for i in range(K + 1):',\n", + " '+ if t == 0:',\n", + " '+ print((i + 1))',\n", + " '+ exit()',\n", + " '+ t = (t * 10 + 7) % K',\n", + " '+print((-1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6767371264,\n", + " 'measured_runtime_v1': 0.4369205115,\n", + " 'runtime_lift': 1.5488792779,\n", + " 'key': ['s734835984', 's256781932']},\n", + " {'user_id': 'u911856499',\n", + " 'problem_id': 'p03774',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's205905114',\n", + " 'submission_id_v1': 's474977819',\n", + " 'cpu_time_v0': 31,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 9140,\n", + " 'memory_v1': 9144,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.13,\n", + " 'input': 'N,M = [int(c) for c in input().split()]\\n\\nab = [list(map(int,input().split())) for c in range(N)]\\n\\ncd = [list(map(int,input().split())) for c in range(M)]\\n\\nfor i in range(N):\\n\\n mi = 2*10**9\\n\\n for j in range(M):\\n\\n tmp = abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])\\n\\n if mi > tmp:\\n\\n mi = tmp\\n\\n ans = j+1\\n\\n print(ans)\\n',\n", + " 'target': 'N,M = [int(c) for c in input().split()]\\n\\nab = [list(map(int,input().split())) for c in range(N)]\\n\\ncd = [list(map(int,input().split())) for c in range(M)]\\n\\nfor i in range(N):\\n\\n mi = 10**9\\n\\n for j in range(M):\\n\\n tmp = abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])\\n\\n if mi > tmp:\\n\\n mi = tmp\\n\\n ans = j+1\\n\\n print(ans)\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 360,\n", + " 'code_v1_num_chars': 358,\n", + " 'code_v0_no_empty_lines': 'N, M = [int(c) for c in input().split()]\\nab = [list(map(int, input().split())) for c in range(N)]\\ncd = [list(map(int, input().split())) for c in range(M)]\\nfor i in range(N):\\n mi = 2 * 10**9\\n for j in range(M):\\n tmp = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])\\n if mi > tmp:\\n mi = tmp\\n ans = j + 1\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = [int(c) for c in input().split()]\\nab = [list(map(int, input().split())) for c in range(N)]\\ncd = [list(map(int, input().split())) for c in range(M)]\\nfor i in range(N):\\n mi = 10**9\\n for j in range(M):\\n tmp = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])\\n if mi > tmp:\\n mi = tmp\\n ans = j + 1\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- mi = 2 * 10**9', '+ mi = 10**9'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2982070241,\n", + " 'measured_runtime_v1': 0.232865705,\n", + " 'runtime_lift': 1.2805965742,\n", + " 'key': ['s205905114', 's474977819']},\n", + " {'user_id': 'u631277801',\n", + " 'problem_id': 'p02996',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's825135097',\n", + " 'submission_id_v1': 's901008925',\n", + " 'cpu_time_v0': 649,\n", + " 'cpu_time_v1': 495,\n", + " 'memory_v0': 54192,\n", + " 'memory_v1': 31936,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.73,\n", + " 'input': 'import sys\\n\\nstdin = sys.stdin\\n\\n\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\ndef li(): return list(map(int, stdin.readline().split()))\\n\\ndef li_(): return [int(x) - 1 for x in stdin.readline().split()]\\n\\ndef lf(): return list(map(float, stdin.readline().split()))\\n\\ndef ls(): return stdin.readline().split()\\n\\ndef ns(): return stdin.readline().rstrip()\\n\\ndef lc(): return list(ns())\\n\\ndef ni(): return int(stdin.readline())\\n\\ndef nf(): return float(stdin.readline())\\n\\n\\n\\nn = ni()\\n\\nab = [list(li()) for _ in range(n)]\\n\\n\\n\\nab.sort(key=lambda x: x[1])\\n\\n\\n\\ncur = 0\\n\\n\\n\\nans = True\\n\\n\\n\\nfor ai, bi in ab:\\n\\n cur += ai\\n\\n if cur > bi:\\n\\n ans = False\\n\\n\\n\\nprint((\"Yes\" if ans else \"No\"))',\n", + " 'target': 'import sys\\n\\nstdin = sys.stdin\\n\\n\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\ndef li(): return list(map(int, stdin.readline().split()))\\n\\ndef li_(): return [int(x) - 1 for x in stdin.readline().split()]\\n\\ndef lf(): return list(map(float, stdin.readline().split()))\\n\\ndef ls(): return stdin.readline().split()\\n\\ndef ns(): return stdin.readline().rstrip()\\n\\ndef lc(): return list(ns())\\n\\ndef ni(): return int(stdin.readline())\\n\\ndef nf(): return float(stdin.readline())\\n\\n\\n\\nn = ni()\\n\\nab = [tuple(li()) for _ in range(n)]\\n\\n\\n\\nab.sort(key=lambda x: x[1])\\n\\ncur = 0\\n\\nok = True\\n\\n\\n\\nfor ai, bi in ab:\\n\\n cur += ai\\n\\n if cur > bi:\\n\\n ok = False\\n\\n break\\n\\n\\n\\nprint((\"Yes\" if ok else \"No\"))\\n',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 28,\n", + " 'code_v0_num_chars': 655,\n", + " 'code_v1_num_chars': 665,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nstdin = sys.stdin\\nsys.setrecursionlimit(10**7)\\n\\n\\ndef li():\\n return list(map(int, stdin.readline().split()))\\n\\n\\ndef li_():\\n return [int(x) - 1 for x in stdin.readline().split()]\\n\\n\\ndef lf():\\n return list(map(float, stdin.readline().split()))\\n\\n\\ndef ls():\\n return stdin.readline().split()\\n\\n\\ndef ns():\\n return stdin.readline().rstrip()\\n\\n\\ndef lc():\\n return list(ns())\\n\\n\\ndef ni():\\n return int(stdin.readline())\\n\\n\\ndef nf():\\n return float(stdin.readline())\\n\\n\\nn = ni()\\nab = [list(li()) for _ in range(n)]\\nab.sort(key=lambda x: x[1])\\ncur = 0\\nans = True\\nfor ai, bi in ab:\\n cur += ai\\n if cur > bi:\\n ans = False\\nprint((\"Yes\" if ans else \"No\"))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nstdin = sys.stdin\\nsys.setrecursionlimit(10**7)\\n\\n\\ndef li():\\n return list(map(int, stdin.readline().split()))\\n\\n\\ndef li_():\\n return [int(x) - 1 for x in stdin.readline().split()]\\n\\n\\ndef lf():\\n return list(map(float, stdin.readline().split()))\\n\\n\\ndef ls():\\n return stdin.readline().split()\\n\\n\\ndef ns():\\n return stdin.readline().rstrip()\\n\\n\\ndef lc():\\n return list(ns())\\n\\n\\ndef ni():\\n return int(stdin.readline())\\n\\n\\ndef nf():\\n return float(stdin.readline())\\n\\n\\nn = ni()\\nab = [tuple(li()) for _ in range(n)]\\nab.sort(key=lambda x: x[1])\\ncur = 0\\nok = True\\nfor ai, bi in ab:\\n cur += ai\\n if cur > bi:\\n ok = False\\n break\\nprint((\"Yes\" if ok else \"No\"))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.4482758621,\n", + " 'diff': ['-ab = [list(li()) for _ in range(n)]',\n", + " '+ab = [tuple(li()) for _ in range(n)]',\n", + " '-ans = True',\n", + " '+ok = True',\n", + " '- ans = False',\n", + " '-print((\"Yes\" if ans else \"No\"))',\n", + " '+ ok = False',\n", + " '+ break',\n", + " '+print((\"Yes\" if ok else \"No\"))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2910801413,\n", + " 'measured_runtime_v1': 0.1842719517,\n", + " 'runtime_lift': 1.5796226102,\n", + " 'key': ['s825135097', 's901008925']},\n", + " {'user_id': 'u947883560',\n", + " 'problem_id': 'p02883',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's930888083',\n", + " 'submission_id_v1': 's224851007',\n", + " 'cpu_time_v0': 856,\n", + " 'cpu_time_v1': 625,\n", + " 'memory_v0': 144812,\n", + " 'memory_v1': 49884,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.99,\n", + " 'input': '#!/usr/bin/env python3\\n\\nimport sys\\n\\nINF = float(\"inf\")\\n\\nfrom bisect import bisect_left\\n\\n\\n\\n\\n\\ndef solve(N: int, K: int, A: \"List[int]\", F: \"List[int]\"):\\n\\n A.sort()\\n\\n F.sort(reverse=True)\\n\\n h = []\\n\\n for a, f in zip(A, F):\\n\\n h.append((a*f, a, f))\\n\\n h.sort()\\n\\n maxtime = h[-1][0]\\n\\n\\n\\n def isOK(y):\\n\\n i = bisect_left(h, (y+1, -1, -1))\\n\\n counter = 0\\n\\n # print(h[i:])\\n\\n for p, a, f in h[i:]:\\n\\n counter += a-y//f\\n\\n return counter <= K\\n\\n\\n\\n def binary_search(x):\\n\\n ng = -1\\n\\n ok = len(x)\\n\\n while abs(ok - ng) > 1:\\n\\n mid = (ok + ng)//2\\n\\n # print(\"mid: {}, in ({}, {})\".format(mid, ng, ok))\\n\\n if isOK(mid):\\n\\n ok = mid\\n\\n else:\\n\\n ng = mid\\n\\n return ng, ok\\n\\n\\n\\n ng, ok = binary_search(list(range(maxtime)))\\n\\n print(ok)\\n\\n\\n\\n # while k > 0:\\n\\n # p1, a1, f1 = heapq.heappop(h)\\n\\n # p2, a2, f2 = heapq.heappop(h)\\n\\n # p1, p2 = -p1, -p2\\n\\n # sub = min(a1 - math.ceil((p2/f1)-1), k)\\n\\n # a1 -= sub\\n\\n # k -= sub\\n\\n # heapq.heappush(h, (-a1*f1, a1, f1))\\n\\n # heapq.heappush(h, (-a2*f2, a2, f2))\\n\\n # # print(h)\\n\\n # p, a, f = heapq.heappop(h)\\n\\n # print(-p)\\n\\n\\n\\n return\\n\\n\\n\\n\\n\\ndef main():\\n\\n\\n\\n def iterate_tokens():\\n\\n for line in sys.stdin:\\n\\n for word in line.split():\\n\\n yield word\\n\\n tokens = iterate_tokens()\\n\\n N = int(next(tokens)) # type: int\\n\\n K = int(next(tokens)) # type: int\\n\\n A = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n\\n F = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n\\n solve(N, K, A, F)\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': '#!/usr/bin/env python3\\n\\nimport sys\\n\\nINF = float(\"inf\")\\n\\nimport numpy as np\\n\\n\\n\\n\\n\\ndef solve(N: int, K: int, A: \"List[int]\", F: \"List[int]\"):\\n\\n A.sort()\\n\\n F.sort(reverse=True)\\n\\n A = np.asarray(A, dtype=np.int)\\n\\n F = np.asarray(F, dtype=np.int)\\n\\n\\n\\n Asum = A.sum()\\n\\n\\n\\n def isOK(y):\\n\\n return Asum-np.minimum(A, y//F).sum() <= K\\n\\n\\n\\n def binary_search(x):\\n\\n ng = -1\\n\\n ok = len(x)\\n\\n while abs(ok - ng) > 1:\\n\\n mid = (ok + ng)//2\\n\\n # print(\"mid: {}, in ({}, {})\".format(mid, ng, ok))\\n\\n if isOK(mid):\\n\\n ok = mid\\n\\n else:\\n\\n ng = mid\\n\\n return ng, ok\\n\\n\\n\\n ng, ok = binary_search(list(range(A.max()*F.max())))\\n\\n print(ok)\\n\\n\\n\\n # while k > 0:\\n\\n # p1, a1, f1 = heapq.heappop(h)\\n\\n # p2, a2, f2 = heapq.heappop(h)\\n\\n # p1, p2 = -p1, -p2\\n\\n # sub = min(a1 - math.ceil((p2/f1)-1), k)\\n\\n # a1 -= sub\\n\\n # k -= sub\\n\\n # heapq.heappush(h, (-a1*f1, a1, f1))\\n\\n # heapq.heappush(h, (-a2*f2, a2, f2))\\n\\n # # print(h)\\n\\n # p, a, f = heapq.heappop(h)\\n\\n # print(-p)\\n\\n\\n\\n return\\n\\n\\n\\n\\n\\ndef main():\\n\\n\\n\\n def iterate_tokens():\\n\\n for line in sys.stdin:\\n\\n for word in line.split():\\n\\n yield word\\n\\n tokens = iterate_tokens()\\n\\n N = int(next(tokens)) # type: int\\n\\n K = int(next(tokens)) # type: int\\n\\n A = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n\\n F = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n\\n solve(N, K, A, F)\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'code_v0_loc': 70,\n", + " 'code_v1_loc': 64,\n", + " 'code_v0_num_chars': 1739,\n", + " 'code_v1_num_chars': 1595,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\n\\nINF = float(\"inf\")\\nfrom bisect import bisect_left\\n\\n\\ndef solve(N: int, K: int, A: \"List[int]\", F: \"List[int]\"):\\n A.sort()\\n F.sort(reverse=True)\\n h = []\\n for a, f in zip(A, F):\\n h.append((a * f, a, f))\\n h.sort()\\n maxtime = h[-1][0]\\n\\n def isOK(y):\\n i = bisect_left(h, (y + 1, -1, -1))\\n counter = 0\\n # print(h[i:])\\n for p, a, f in h[i:]:\\n counter += a - y // f\\n return counter <= K\\n\\n def binary_search(x):\\n ng = -1\\n ok = len(x)\\n while abs(ok - ng) > 1:\\n mid = (ok + ng) // 2\\n # print(\"mid: {}, in ({}, {})\".format(mid, ng, ok))\\n if isOK(mid):\\n ok = mid\\n else:\\n ng = mid\\n return ng, ok\\n\\n ng, ok = binary_search(list(range(maxtime)))\\n print(ok)\\n # while k > 0:\\n # p1, a1, f1 = heapq.heappop(h)\\n # p2, a2, f2 = heapq.heappop(h)\\n # p1, p2 = -p1, -p2\\n # sub = min(a1 - math.ceil((p2/f1)-1), k)\\n # a1 -= sub\\n # k -= sub\\n # heapq.heappush(h, (-a1*f1, a1, f1))\\n # heapq.heappush(h, (-a2*f2, a2, f2))\\n # # print(h)\\n # p, a, f = heapq.heappop(h)\\n # print(-p)\\n return\\n\\n\\ndef main():\\n def iterate_tokens():\\n for line in sys.stdin:\\n for word in line.split():\\n yield word\\n\\n tokens = iterate_tokens()\\n N = int(next(tokens)) # type: int\\n K = int(next(tokens)) # type: int\\n A = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n F = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n solve(N, K, A, F)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\n\\nINF = float(\"inf\")\\nimport numpy as np\\n\\n\\ndef solve(N: int, K: int, A: \"List[int]\", F: \"List[int]\"):\\n A.sort()\\n F.sort(reverse=True)\\n A = np.asarray(A, dtype=np.int)\\n F = np.asarray(F, dtype=np.int)\\n Asum = A.sum()\\n\\n def isOK(y):\\n return Asum - np.minimum(A, y // F).sum() <= K\\n\\n def binary_search(x):\\n ng = -1\\n ok = len(x)\\n while abs(ok - ng) > 1:\\n mid = (ok + ng) // 2\\n # print(\"mid: {}, in ({}, {})\".format(mid, ng, ok))\\n if isOK(mid):\\n ok = mid\\n else:\\n ng = mid\\n return ng, ok\\n\\n ng, ok = binary_search(list(range(A.max() * F.max())))\\n print(ok)\\n # while k > 0:\\n # p1, a1, f1 = heapq.heappop(h)\\n # p2, a2, f2 = heapq.heappop(h)\\n # p1, p2 = -p1, -p2\\n # sub = min(a1 - math.ceil((p2/f1)-1), k)\\n # a1 -= sub\\n # k -= sub\\n # heapq.heappush(h, (-a1*f1, a1, f1))\\n # heapq.heappush(h, (-a2*f2, a2, f2))\\n # # print(h)\\n # p, a, f = heapq.heappop(h)\\n # print(-p)\\n return\\n\\n\\ndef main():\\n def iterate_tokens():\\n for line in sys.stdin:\\n for word in line.split():\\n yield word\\n\\n tokens = iterate_tokens()\\n N = int(next(tokens)) # type: int\\n K = int(next(tokens)) # type: int\\n A = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n F = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\\n solve(N, K, A, F)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.5714285714,\n", + " 'diff': ['-from bisect import bisect_left',\n", + " '+import numpy as np',\n", + " '- h = []',\n", + " '- for a, f in zip(A, F):',\n", + " '- h.append((a * f, a, f))',\n", + " '- h.sort()',\n", + " '- maxtime = h[-1][0]',\n", + " '+ A = np.asarray(A, dtype=np.int)',\n", + " '+ F = np.asarray(F, dtype=np.int)',\n", + " '+ Asum = A.sum()',\n", + " '- i = bisect_left(h, (y + 1, -1, -1))',\n", + " '- counter = 0',\n", + " '- # print(h[i:])',\n", + " '- for p, a, f in h[i:]:',\n", + " '- counter += a - y // f',\n", + " '- return counter <= K',\n", + " '+ return Asum - np.minimum(A, y // F).sum() <= K',\n", + " '- ng, ok = binary_search(list(range(maxtime)))',\n", + " '+ ng, ok = binary_search(list(range(A.max() * F.max())))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1431037025,\n", + " 'measured_runtime_v1': 0.0063273711,\n", + " 'runtime_lift': 22.616612744,\n", + " 'key': ['s930888083', 's224851007']},\n", + " {'user_id': 'u492605584',\n", + " 'problem_id': 'p03164',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's292196170',\n", + " 'submission_id_v1': 's917581247',\n", + " 'cpu_time_v0': 446,\n", + " 'cpu_time_v1': 321,\n", + " 'memory_v0': 119916,\n", + " 'memory_v1': 41964,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.03,\n", + " 'input': 'N, W = list(map(int, input().split()))\\n\\nL = [list(map(int, input().split())) for i in range(N)]\\n\\nV = 0\\n\\nfor i in range(N):\\n\\n V += L[i][1]\\n\\n\\n\\ndp = [[10**9+1] * (V + 1) for i in range(N+1)]\\n\\ndp[0][0] = 0\\n\\nfor i in range(N):\\n\\n for j in range(V+1):\\n\\n if j - L[i][1] >= 0:\\n\\n dp[i+1][j] = min(dp[i][j], dp[i][j-L[i][1]] + L[i][0])\\n\\n else:\\n\\n dp[i+1][j] = dp[i][j]\\n\\nans = 0\\n\\nfor j in range(V+1):\\n\\n if W >= dp[-1][j]:\\n\\n ans = max(ans, j)\\n\\nprint(ans)',\n", + " 'target': 'N, W = list(map(int, input().split()))\\n\\nL = [list(map(int, input().split())) for i in range(N)]\\n\\nV = 0\\n\\nfor i in range(N):\\n\\n V += L[i][1]\\n\\n\\n\\ndp = [10**9+1] * (V + 1)\\n\\ndp[0] = 0\\n\\nfor i in range(N):\\n\\n for j in range(V, -1, -1):\\n\\n dp[j] = min(dp[j], dp[j-L[i][1]] + L[i][0])\\n\\nans = 0\\n\\nfor j in range(V+1):\\n\\n if W >= dp[j]:\\n\\n ans = max(ans, j)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 481,\n", + " 'code_v1_num_chars': 367,\n", + " 'code_v0_no_empty_lines': 'N, W = list(map(int, input().split()))\\nL = [list(map(int, input().split())) for i in range(N)]\\nV = 0\\nfor i in range(N):\\n V += L[i][1]\\ndp = [[10**9 + 1] * (V + 1) for i in range(N + 1)]\\ndp[0][0] = 0\\nfor i in range(N):\\n for j in range(V + 1):\\n if j - L[i][1] >= 0:\\n dp[i + 1][j] = min(dp[i][j], dp[i][j - L[i][1]] + L[i][0])\\n else:\\n dp[i + 1][j] = dp[i][j]\\nans = 0\\nfor j in range(V + 1):\\n if W >= dp[-1][j]:\\n ans = max(ans, j)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, W = list(map(int, input().split()))\\nL = [list(map(int, input().split())) for i in range(N)]\\nV = 0\\nfor i in range(N):\\n V += L[i][1]\\ndp = [10**9 + 1] * (V + 1)\\ndp[0] = 0\\nfor i in range(N):\\n for j in range(V, -1, -1):\\n dp[j] = min(dp[j], dp[j - L[i][1]] + L[i][0])\\nans = 0\\nfor j in range(V + 1):\\n if W >= dp[j]:\\n ans = max(ans, j)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.7894736842,\n", + " 'diff': ['-dp = [[10**9 + 1] * (V + 1) for i in range(N + 1)]',\n", + " '-dp[0][0] = 0',\n", + " '+dp = [10**9 + 1] * (V + 1)',\n", + " '+dp[0] = 0',\n", + " '- for j in range(V + 1):',\n", + " '- if j - L[i][1] >= 0:',\n", + " '- dp[i + 1][j] = min(dp[i][j], dp[i][j - L[i][1]] + L[i][0])',\n", + " '- else:',\n", + " '- dp[i + 1][j] = dp[i][j]',\n", + " '+ for j in range(V, -1, -1):',\n", + " '+ dp[j] = min(dp[j], dp[j - L[i][1]] + L[i][0])',\n", + " '- if W >= dp[-1][j]:',\n", + " '+ if W >= dp[j]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3010064836,\n", + " 'measured_runtime_v1': 0.1980076838,\n", + " 'runtime_lift': 1.5201757721,\n", + " 'key': ['s292196170', 's917581247']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p03000',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's741155786',\n", + " 'submission_id_v1': 's174835156',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12508,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.67,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN, X = lr()\\n\\nL = np.array([0] + lr())\\n\\nLcum = L.cumsum()\\n\\ni = np.searchsorted(Lcum, X, side='right')\\n\\nprint(i)\\n\\n# \",\n", + " 'target': '# coding: utf-8\\n\\nimport sys\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN, X = lr()\\n\\nL = lr()\\n\\ncnt = 1\\n\\ncur = 0\\n\\nfor l in L: \\n\\n cur += l\\n\\n if cur > X:\\n\\n break\\n\\n cnt += 1\\n\\n\\n\\nanswer = cnt\\n\\nprint(answer)\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 261,\n", + " 'code_v1_num_chars': 291,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN, X = lr()\\nL = np.array([0] + lr())\\nLcum = L.cumsum()\\ni = np.searchsorted(Lcum, X, side=\"right\")\\nprint(i)\\n#\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nimport sys\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN, X = lr()\\nL = lr()\\ncnt = 1\\ncur = 0\\nfor l in L:\\n cur += l\\n if cur > X:\\n break\\n cnt += 1\\nanswer = cnt\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.5789473684,\n", + " 'diff': ['+# coding: utf-8',\n", + " '-import numpy as np',\n", + " '-L = np.array([0] + lr())',\n", + " '-Lcum = L.cumsum()',\n", + " '-i = np.searchsorted(Lcum, X, side=\"right\")',\n", + " '-print(i)',\n", + " '-#',\n", + " '+L = lr()',\n", + " '+cnt = 1',\n", + " '+cur = 0',\n", + " '+for l in L:',\n", + " '+ cur += l',\n", + " '+ if cur > X:',\n", + " '+ break',\n", + " '+ cnt += 1',\n", + " '+answer = cnt',\n", + " '+print(answer)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5985637542,\n", + " 'measured_runtime_v1': 0.2292145673,\n", + " 'runtime_lift': 6.9740931968,\n", + " 'key': ['s741155786', 's174835156']},\n", + " {'user_id': 'u969190727',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's944521020',\n", + " 'submission_id_v1': 's713825460',\n", + " 'cpu_time_v0': 121,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.95,\n", + " 'input': 'a,b,c,x,y=list(map(int,input().split()))\\n\\nans=a*x+b*y\\n\\nn=max(x,y)\\n\\nfor i in range(1,n+1):\\n\\n ans=min(ans,2*i*c+a*max(0,x-i)+b*max(0,y-i))\\n\\nprint(ans)\\n\\n\\n\\n\\n',\n", + " 'target': 'a,b,c,x,y=list(map(int,input().split()))\\n\\nans1=a*x+b*y\\n\\nans2=2*c*max(x,y)\\n\\nans3=2*c*min(x,y)+a*(x-min(x,y))+b*(y-min(x,y))\\n\\nprint((min(ans1,ans2,ans3)))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 148,\n", + " 'code_v1_num_chars': 144,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = a * x + b * y\\nn = max(x, y)\\nfor i in range(1, n + 1):\\n ans = min(ans, 2 * i * c + a * max(0, x - i) + b * max(0, y - i))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans1 = a * x + b * y\\nans2 = 2 * c * max(x, y)\\nans3 = 2 * c * min(x, y) + a * (x - min(x, y)) + b * (y - min(x, y))\\nprint((min(ans1, ans2, ans3)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 37.5,\n", + " 'diff': ['-ans = a * x + b * y',\n", + " '-n = max(x, y)',\n", + " '-for i in range(1, n + 1):',\n", + " '- ans = min(ans, 2 * i * c + a * max(0, x - i) + b * max(0, y - i))',\n", + " '-print(ans)',\n", + " '+ans1 = a * x + b * y',\n", + " '+ans2 = 2 * c * max(x, y)',\n", + " '+ans3 = 2 * c * min(x, y) + a * (x - min(x, y)) + b * (y - min(x, y))',\n", + " '+print((min(ans1, ans2, ans3)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.247306282,\n", + " 'measured_runtime_v1': 0.1774894836,\n", + " 'runtime_lift': 1.3933573811,\n", + " 'key': ['s944521020', 's713825460']},\n", + " {'user_id': 'u353895424',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's954474488',\n", + " 'submission_id_v1': 's311308759',\n", + " 'cpu_time_v0': 81,\n", + " 'cpu_time_v1': 56,\n", + " 'memory_v0': 4148,\n", + " 'memory_v1': 10088,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.86,\n", + " 'input': 'from math import log2\\n\\nn = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nans = 0\\n\\n\\n\\nfor _a in a:\\n\\n if _a%2 == 0:\\n\\n cnt =0\\n\\n while _a%2 == 0:\\n\\n _a //= 2\\n\\n cnt += 1\\n\\n ans += cnt\\n\\n\\n\\nprint((int(ans)))',\n", + " 'target': 'def f(k):\\n\\n cnt = 0\\n\\n while k%2 == 0:\\n\\n k //= 2\\n\\n cnt += 1\\n\\n # print(k)\\n\\n # print(\"-----\")\\n\\n return cnt\\n\\n\\n\\nn = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nans = 0\\n\\n\\n\\nfor a in A:\\n\\n if a%2 == 0:\\n\\n ans += f(a)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 245,\n", + " 'code_v1_num_chars': 272,\n", + " 'code_v0_no_empty_lines': 'from math import log2\\n\\nn = int(eval(input()))\\na = list(map(int, input().split()))\\nans = 0\\nfor _a in a:\\n if _a % 2 == 0:\\n cnt = 0\\n while _a % 2 == 0:\\n _a //= 2\\n cnt += 1\\n ans += cnt\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'def f(k):\\n cnt = 0\\n while k % 2 == 0:\\n k //= 2\\n cnt += 1\\n # print(k)\\n # print(\"-----\")\\n return cnt\\n\\n\\nn = int(eval(input()))\\nA = list(map(int, input().split()))\\nans = 0\\nfor a in A:\\n if a % 2 == 0:\\n ans += f(a)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.6470588235,\n", + " 'diff': ['-from math import log2',\n", + " '+def f(k):',\n", + " '+ cnt = 0',\n", + " '+ while k % 2 == 0:',\n", + " '+ k //= 2',\n", + " '+ cnt += 1',\n", + " '+ # print(k)',\n", + " '+ return cnt',\n", + " '+',\n", + " '-a = list(map(int, input().split()))',\n", + " '+A = list(map(int, input().split()))',\n", + " '-for _a in a:',\n", + " '- if _a % 2 == 0:',\n", + " '- cnt = 0',\n", + " '- while _a % 2 == 0:',\n", + " '- _a //= 2',\n", + " '- cnt += 1',\n", + " '- ans += cnt',\n", + " '-print((int(ans)))',\n", + " '+for a in A:',\n", + " '+ if a % 2 == 0:',\n", + " '+ ans += f(a)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3309142907,\n", + " 'measured_runtime_v1': 0.2479304838,\n", + " 'runtime_lift': 1.3347059448,\n", + " 'key': ['s954474488', 's311308759']},\n", + " {'user_id': 'u107077660',\n", + " 'problem_id': 'p04012',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's204906128',\n", + " 'submission_id_v1': 's764910207',\n", + " 'cpu_time_v0': 38,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.68,\n", + " 'input': 'w = eval(input())\\n\\nfor l in w:\\n\\n\\tif w.count(l) % 2 == 1:\\n\\n\\t\\tprint(\"No\")\\n\\n\\t\\tbreak\\n\\nelse:\\n\\n\\tprint(\"Yes\")',\n", + " 'target': 'from collections import Counter\\n\\ns = eval(input())\\n\\nc = list(Counter(s).values())\\n\\nfor n in c:\\n\\n\\tif n & 1 == 1:\\n\\n\\t\\tprint(\"No\")\\n\\n\\t\\tbreak\\n\\nelse:\\n\\n\\tprint(\"Yes\")\\n\\n\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 96,\n", + " 'code_v1_num_chars': 148,\n", + " 'code_v0_no_empty_lines': 'w = eval(input())\\nfor l in w:\\n if w.count(l) % 2 == 1:\\n print(\"No\")\\n break\\nelse:\\n print(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\n\\ns = eval(input())\\nc = list(Counter(s).values())\\nfor n in c:\\n if n & 1 == 1:\\n print(\"No\")\\n break\\nelse:\\n print(\"Yes\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.0,\n", + " 'diff': ['-w = eval(input())',\n", + " '-for l in w:',\n", + " '- if w.count(l) % 2 == 1:',\n", + " '+from collections import Counter',\n", + " '+',\n", + " '+s = eval(input())',\n", + " '+c = list(Counter(s).values())',\n", + " '+for n in c:',\n", + " '+ if n & 1 == 1:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3070713311,\n", + " 'measured_runtime_v1': 0.212444066,\n", + " 'runtime_lift': 1.44542202,\n", + " 'key': ['s204906128', 's764910207']},\n", + " {'user_id': 'u787562674',\n", + " 'problem_id': 'p03363',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's520227607',\n", + " 'submission_id_v1': 's241017574',\n", + " 'cpu_time_v0': 271,\n", + " 'cpu_time_v1': 224,\n", + " 'memory_v0': 41880,\n", + " 'memory_v1': 41472,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.34,\n", + " 'input': 'from collections import Counter\\n\\n\\n\\nN = int(eval(input()))\\n\\ninputs = [int(i) for i in input().split()]\\n\\n\\n\\nans = 0\\n\\nruisekiwa = [0] * (N+1)\\n\\n\\n\\nfor i in range(N):\\n\\n ruisekiwa[i+1] = ruisekiwa[i] + inputs[i]\\n\\n\\n\\nruisekiwa = ruisekiwa[1:]\\n\\nruisekiwa.sort()\\n\\ncounter_ruiseki = Counter(ruisekiwa)\\n\\n\\n\\nfor key, value in list(counter_ruiseki.items()):\\n\\n if key == 0 and value == 1:\\n\\n ans += value\\n\\n continue\\n\\n elif key == 0 and value > 1:\\n\\n ans += value\\n\\n if value > 1:\\n\\n ans += sum(list(range(value)))\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'from collections import Counter\\n\\nfrom itertools import accumulate\\n\\n\\n\\nN = int(eval(input()))\\n\\ninputs = [int(i) for i in input().split()]\\n\\n\\n\\nans = 0\\n\\n\\n\\nruisekiwa = list(accumulate(inputs))\\n\\nruisekiwa.sort()\\n\\ncounter_ruiseki = Counter(ruisekiwa)\\n\\n\\n\\nfor key, value in list(counter_ruiseki.items()):\\n\\n if key == 0 and value == 1:\\n\\n ans += value\\n\\n continue\\n\\n elif key == 0 and value > 1:\\n\\n ans += value\\n\\n if value > 1:\\n\\n ans += sum(list(range(value)))\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 534,\n", + " 'code_v1_num_chars': 485,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\n\\nN = int(eval(input()))\\ninputs = [int(i) for i in input().split()]\\nans = 0\\nruisekiwa = [0] * (N + 1)\\nfor i in range(N):\\n ruisekiwa[i + 1] = ruisekiwa[i] + inputs[i]\\nruisekiwa = ruisekiwa[1:]\\nruisekiwa.sort()\\ncounter_ruiseki = Counter(ruisekiwa)\\nfor key, value in list(counter_ruiseki.items()):\\n if key == 0 and value == 1:\\n ans += value\\n continue\\n elif key == 0 and value > 1:\\n ans += value\\n if value > 1:\\n ans += sum(list(range(value)))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\nfrom itertools import accumulate\\n\\nN = int(eval(input()))\\ninputs = [int(i) for i in input().split()]\\nans = 0\\nruisekiwa = list(accumulate(inputs))\\nruisekiwa.sort()\\ncounter_ruiseki = Counter(ruisekiwa)\\nfor key, value in list(counter_ruiseki.items()):\\n if key == 0 and value == 1:\\n ans += value\\n continue\\n elif key == 0 and value > 1:\\n ans += value\\n if value > 1:\\n ans += sum(list(range(value)))\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.0,\n", + " 'diff': ['+from itertools import accumulate',\n", + " '-ruisekiwa = [0] * (N + 1)',\n", + " '-for i in range(N):',\n", + " '- ruisekiwa[i + 1] = ruisekiwa[i] + inputs[i]',\n", + " '-ruisekiwa = ruisekiwa[1:]',\n", + " '+ruisekiwa = list(accumulate(inputs))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.19887093,\n", + " 'measured_runtime_v1': 0.1327844608,\n", + " 'runtime_lift': 1.4976973116,\n", + " 'key': ['s520227607', 's241017574']},\n", + " {'user_id': 'u243699903',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's088381244',\n", + " 'submission_id_v1': 's357905210',\n", + " 'cpu_time_v0': 104,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.65,\n", + " 'input': 'a,b,c,x,y=list(map(int,input().split()))\\n\\n\\n\\nans=a*x+b*y\\n\\nfor ci in range(max(x,y)+1):\\n\\n sumc = 2*ci*c\\n\\n sumc += (x-ci)*a if (x-ci)>0 else 0\\n\\n sumc += (y-ci)*b if (y-ci)>0 else 0\\n\\n ans=min(ans,sumc)\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'a,b,c,x,y=list(map(int,input().split()))\\n\\nans=a*x+b*y\\n\\nif x==y:\\n\\n ans=min(ans,2*x*c)\\n\\nelif x>y:\\n\\n ans=min(ans,a*(x-y)+2*y*c)\\n\\n ans=min(ans,2*x*c)\\n\\nelse:\\n\\n ans=min(ans,b*(y-x)+2*x*c)\\n\\n ans=min(ans,2*y*c)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 217,\n", + " 'code_v1_num_chars': 223,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = a * x + b * y\\nfor ci in range(max(x, y) + 1):\\n sumc = 2 * ci * c\\n sumc += (x - ci) * a if (x - ci) > 0 else 0\\n sumc += (y - ci) * b if (y - ci) > 0 else 0\\n ans = min(ans, sumc)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = a * x + b * y\\nif x == y:\\n ans = min(ans, 2 * x * c)\\nelif x > y:\\n ans = min(ans, a * (x - y) + 2 * y * c)\\n ans = min(ans, 2 * x * c)\\nelse:\\n ans = min(ans, b * (y - x) + 2 * x * c)\\n ans = min(ans, 2 * y * c)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-for ci in range(max(x, y) + 1):',\n", + " '- sumc = 2 * ci * c',\n", + " '- sumc += (x - ci) * a if (x - ci) > 0 else 0',\n", + " '- sumc += (y - ci) * b if (y - ci) > 0 else 0',\n", + " '- ans = min(ans, sumc)',\n", + " '+if x == y:',\n", + " '+ ans = min(ans, 2 * x * c)',\n", + " '+elif x > y:',\n", + " '+ ans = min(ans, a * (x - y) + 2 * y * c)',\n", + " '+ ans = min(ans, 2 * x * c)',\n", + " '+else:',\n", + " '+ ans = min(ans, b * (y - x) + 2 * x * c)',\n", + " '+ ans = min(ans, 2 * y * c)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2025436199,\n", + " 'measured_runtime_v1': 0.1559800074,\n", + " 'runtime_lift': 1.2985229532,\n", + " 'key': ['s088381244', 's357905210']},\n", + " {'user_id': 'u580316619',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's104933715',\n", + " 'submission_id_v1': 's431749405',\n", + " 'cpu_time_v0': 148,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 12396,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.81,\n", + " 'input': 'import numpy as np\\n\\nn=int(eval(input()))\\n\\na=np.array(list(map(int,input().split())))\\n\\nb=0\\n\\nwhile np.all(a%2==0):\\n\\n\\ta=a/2\\n\\n\\tb+=1\\n\\n\\t\\n\\nprint(b)',\n", + " 'target': 'a = int(eval(input(\"\")))\\n\\nb = input(\"\").split(\" \")\\n\\nc = 0\\n\\nd = []\\n\\n\\n\\nfor i in range(a):\\n\\n\\tc = 0\\n\\n\\twhile (int(b[i]) % 2 == 0):\\n\\n\\t\\tb[i] = int(b[i]) / 2\\n\\n\\t\\tc += 1\\n\\n\\td.append(c)\\n\\nprint((min(d)))',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 134,\n", + " 'code_v1_num_chars': 182,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\na = np.array(list(map(int, input().split())))\\nb = 0\\nwhile np.all(a % 2 == 0):\\n a = a / 2\\n b += 1\\nprint(b)\\n',\n", + " 'code_v1_no_empty_lines': 'a = int(eval(input(\"\")))\\nb = input(\"\").split(\" \")\\nc = 0\\nd = []\\nfor i in range(a):\\n c = 0\\n while int(b[i]) % 2 == 0:\\n b[i] = int(b[i]) / 2\\n c += 1\\n d.append(c)\\nprint((min(d)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-n = int(eval(input()))',\n", + " '-a = np.array(list(map(int, input().split())))',\n", + " '-b = 0',\n", + " '-while np.all(a % 2 == 0):',\n", + " '- a = a / 2',\n", + " '- b += 1',\n", + " '-print(b)',\n", + " '+a = int(eval(input(\"\")))',\n", + " '+b = input(\"\").split(\" \")',\n", + " '+c = 0',\n", + " '+d = []',\n", + " '+for i in range(a):',\n", + " '+ c = 0',\n", + " '+ while int(b[i]) % 2 == 0:',\n", + " '+ b[i] = int(b[i]) / 2',\n", + " '+ c += 1',\n", + " '+ d.append(c)',\n", + " '+print((min(d)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.2201787407,\n", + " 'measured_runtime_v1': 0.3198084066,\n", + " 'runtime_lift': 6.9422150729,\n", + " 'key': ['s104933715', 's431749405']},\n", + " {'user_id': 'u365686736',\n", + " 'problem_id': 'p02390',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's143749551',\n", + " 'submission_id_v1': 's514847697',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 7676,\n", + " 'memory_v1': 5584,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.33,\n", + " 'input': 'S = int(input())\\n\\n\\n\\nif S >= 3600:\\n\\n h=S//3600\\n\\n m=S%3600//60\\n\\n s=S%60\\n\\nelif 3600 > S >= 60:\\n\\n h=0\\n\\n m=S//60\\n\\n s=S%60\\n\\nelse:\\n\\n h=m=0\\n\\n s=S\\n\\nprint(h, m, s, sep=\":\")\\n',\n", + " 'target': 's = int(input())\\n\\nh = s // 3600\\n\\nm = (s - h * 3600) // 60\\n\\ns = s - h * 3600 - m * 60\\n\\nprint(h, m, s, sep=\":\")\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 186,\n", + " 'code_v1_num_chars': 110,\n", + " 'code_v0_no_empty_lines': 'S = int(input())\\nif S >= 3600:\\n h = S // 3600\\n m = S % 3600 // 60\\n s = S % 60\\nelif 3600 > S >= 60:\\n h = 0\\n m = S // 60\\n s = S % 60\\nelse:\\n h = m = 0\\n s = S\\nprint(h, m, s, sep=\":\")\\n',\n", + " 'code_v1_no_empty_lines': 's = int(input())\\nh = s // 3600\\nm = (s - h * 3600) // 60\\ns = s - h * 3600 - m * 60\\nprint(h, m, s, sep=\":\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 64.2857142857,\n", + " 'diff': ['-S = int(input())',\n", + " '-if S >= 3600:',\n", + " '- h = S // 3600',\n", + " '- m = S % 3600 // 60',\n", + " '- s = S % 60',\n", + " '-elif 3600 > S >= 60:',\n", + " '- h = 0',\n", + " '- m = S // 60',\n", + " '- s = S % 60',\n", + " '-else:',\n", + " '- h = m = 0',\n", + " '- s = S',\n", + " '+s = int(input())',\n", + " '+h = s // 3600',\n", + " '+m = (s - h * 3600) // 60',\n", + " '+s = s - h * 3600 - m * 60'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3295819011,\n", + " 'measured_runtime_v1': 0.255378567,\n", + " 'runtime_lift': 1.2905621053,\n", + " 'key': ['s143749551', 's514847697']},\n", + " {'user_id': 'u055875839',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's284976980',\n", + " 'submission_id_v1': 's533147628',\n", + " 'cpu_time_v0': 151,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12508,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.42,\n", + " 'input': 'eval(input())\\n\\n\\n\\nimport numpy as np\\n\\nA = np.array(list(map(int, input().split(\" \"))))\\n\\na = 0\\n\\n\\n\\nwhile np.sum(A%2) == 0:\\n\\n A = A/2\\n\\n a = a + 1\\n\\n\\n\\nprint(a)',\n", + " 'target': 'eval(input())\\n\\n\\n\\nA = list(map(int, input().split(\" \")))\\n\\nB = 0\\n\\n\\n\\nwhile all(a%2 == 0 for a in A):\\n\\n A = [a/2 for a in A]\\n\\n B += 1\\n\\n \\n\\nprint(B)\\n\\n ',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 149,\n", + " 'code_v1_num_chars': 145,\n", + " 'code_v0_no_empty_lines': 'eval(input())\\nimport numpy as np\\n\\nA = np.array(list(map(int, input().split(\" \"))))\\na = 0\\nwhile np.sum(A % 2) == 0:\\n A = A / 2\\n a = a + 1\\nprint(a)\\n',\n", + " 'code_v1_no_empty_lines': 'eval(input())\\nA = list(map(int, input().split(\" \")))\\nB = 0\\nwhile all(a % 2 == 0 for a in A):\\n A = [a / 2 for a in A]\\n B += 1\\nprint(B)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.array(list(map(int, input().split(\" \"))))',\n", + " '-a = 0',\n", + " '-while np.sum(A % 2) == 0:',\n", + " '- A = A / 2',\n", + " '- a = a + 1',\n", + " '-print(a)',\n", + " '+A = list(map(int, input().split(\" \")))',\n", + " '+B = 0',\n", + " '+while all(a % 2 == 0 for a in A):',\n", + " '+ A = [a / 2 for a in A]',\n", + " '+ B += 1',\n", + " '+print(B)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3803981676,\n", + " 'measured_runtime_v1': 0.2073892272,\n", + " 'runtime_lift': 6.6560746019,\n", + " 'key': ['s284976980', 's533147628']},\n", + " {'user_id': 'u347600233',\n", + " 'problem_id': 'p02952',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's073920837',\n", + " 'submission_id_v1': 's426081507',\n", + " 'cpu_time_v0': 75,\n", + " 'cpu_time_v1': 58,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.67,\n", + " 'input': 'import math\\n\\nn = int(eval(input()))\\n\\ncnt = 0\\n\\nfor i in range(1, n + 1):\\n\\n if math.floor(math.log10(i) + 1) % 2:\\n\\n cnt += 1\\n\\nprint(cnt)',\n", + " 'target': 'n = int(eval(input()))\\n\\ncnt = 0\\n\\nfor i in range(1, n + 1):\\n\\n if len(str(i)) % 2:\\n\\n cnt += 1\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 138,\n", + " 'code_v1_num_chars': 107,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\ncnt = 0\\nfor i in range(1, n + 1):\\n if math.floor(math.log10(i) + 1) % 2:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\ncnt = 0\\nfor i in range(1, n + 1):\\n if len(str(i)) % 2:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '- if math.floor(math.log10(i) + 1) % 2:',\n", + " '+ if len(str(i)) % 2:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3655955575,\n", + " 'measured_runtime_v1': 0.2850201683,\n", + " 'runtime_lift': 1.282700658,\n", + " 'key': ['s073920837', 's426081507']},\n", + " {'user_id': 'u260980560',\n", + " 'problem_id': 'p00713',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's376249504',\n", + " 'submission_id_v1': 's496295641',\n", + " 'cpu_time_v0': 32130,\n", + " 'cpu_time_v1': 27750,\n", + " 'memory_v0': 6520,\n", + " 'memory_v1': 6552,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.63,\n", + " 'input': 'from math import sqrt\\n\\nfrom bisect import bisect_left\\n\\ndef circle_center(x1, y1, x2, y2):\\n\\n xd = x2 - x1; yd = y2 - y1\\n\\n d = xd**2 + yd**2\\n\\n k = sqrt((4.0 - d) / d) / 2.0\\n\\n xc = (x1 + x2) / 2.0\\n\\n yc = (y1 + y2) / 2.0\\n\\n return [[xc - k*yd, yc + k*xd], [xc + k*yd, yc - k*xd]]\\n\\nwhile 1:\\n\\n n = int(input())\\n\\n if n==0: break\\n\\n p = [list(map(float, input().split())) for i in range(n)]\\n\\n p.sort()\\n\\n prev = 0\\n\\n ans = 1\\n\\n for i in range(n):\\n\\n bx, by = p[i]\\n\\n while bx - p[prev][0] >= 2.0: prev += 1\\n\\n for j in range(i+1, n):\\n\\n cx, cy = p[j]\\n\\n if cx - bx >= 2.0: break\\n\\n if (bx - cx)**2 + (by - cy)**2 <= 4.0:\\n\\n for ex, ey in circle_center(bx, by, cx, cy):\\n\\n count = 2\\n\\n for k in range(prev, n):\\n\\n if k==i or k==j: continue\\n\\n dx, dy = p[k]\\n\\n if dx - bx >= 2.0: break\\n\\n if (ex - dx)**2 + (ey - dy)**2 <= 1.0:\\n\\n count += 1\\n\\n ans = max(ans, count)\\n\\n print(ans)',\n", + " 'target': 'from math import sqrt\\n\\nfrom bisect import bisect_left\\n\\ndef circle_center(x1, y1, x2, y2):\\n\\n xd = x2 - x1; yd = y2 - y1\\n\\n d = xd**2 + yd**2\\n\\n k = sqrt((4.0 - d) / d) / 2.0\\n\\n xc = (x1 + x2) / 2.0; yc = (y1 + y2) / 2.0\\n\\n xd *= k; yd *= k\\n\\n return [[xc - yd, yc + xd], [xc + yd, yc - xd]]\\n\\nwhile 1:\\n\\n n = int(input())\\n\\n if n==0: break\\n\\n p = sorted(list(map(float, input().split())) for i in range(n))\\n\\n prev = 0\\n\\n ans = 1\\n\\n for i in range(n):\\n\\n bx, by = p[i]\\n\\n while bx - p[prev][0] >= 2.0: prev += 1\\n\\n for j in range(i+1, n):\\n\\n cx, cy = p[j]\\n\\n if cx - bx >= 2.0: break\\n\\n if (bx - cx)**2 + (by - cy)**2 <= 4.0:\\n\\n for ex, ey in circle_center(bx, by, cx, cy):\\n\\n count = 2\\n\\n for k in range(prev, n):\\n\\n if k==i or k==j: continue\\n\\n dx, dy = p[k]\\n\\n if dx - ex >= 1.0: break\\n\\n if (ex - dx)**2 + (ey - dy)**2 <= 1.0:\\n\\n count += 1\\n\\n ans = max(ans, count)\\n\\n print(ans)',\n", + " 'code_v0_loc': 33,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 1141,\n", + " 'code_v1_num_chars': 1143,\n", + " 'code_v0_no_empty_lines': 'from math import sqrt\\nfrom bisect import bisect_left\\n\\n\\ndef circle_center(x1, y1, x2, y2):\\n xd = x2 - x1\\n yd = y2 - y1\\n d = xd**2 + yd**2\\n k = sqrt((4.0 - d) / d) / 2.0\\n xc = (x1 + x2) / 2.0\\n yc = (y1 + y2) / 2.0\\n return [[xc - k * yd, yc + k * xd], [xc + k * yd, yc - k * xd]]\\n\\n\\nwhile 1:\\n n = int(input())\\n if n == 0:\\n break\\n p = [list(map(float, input().split())) for i in range(n)]\\n p.sort()\\n prev = 0\\n ans = 1\\n for i in range(n):\\n bx, by = p[i]\\n while bx - p[prev][0] >= 2.0:\\n prev += 1\\n for j in range(i + 1, n):\\n cx, cy = p[j]\\n if cx - bx >= 2.0:\\n break\\n if (bx - cx) ** 2 + (by - cy) ** 2 <= 4.0:\\n for ex, ey in circle_center(bx, by, cx, cy):\\n count = 2\\n for k in range(prev, n):\\n if k == i or k == j:\\n continue\\n dx, dy = p[k]\\n if dx - bx >= 2.0:\\n break\\n if (ex - dx) ** 2 + (ey - dy) ** 2 <= 1.0:\\n count += 1\\n ans = max(ans, count)\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from math import sqrt\\nfrom bisect import bisect_left\\n\\n\\ndef circle_center(x1, y1, x2, y2):\\n xd = x2 - x1\\n yd = y2 - y1\\n d = xd**2 + yd**2\\n k = sqrt((4.0 - d) / d) / 2.0\\n xc = (x1 + x2) / 2.0\\n yc = (y1 + y2) / 2.0\\n xd *= k\\n yd *= k\\n return [[xc - yd, yc + xd], [xc + yd, yc - xd]]\\n\\n\\nwhile 1:\\n n = int(input())\\n if n == 0:\\n break\\n p = sorted(list(map(float, input().split())) for i in range(n))\\n prev = 0\\n ans = 1\\n for i in range(n):\\n bx, by = p[i]\\n while bx - p[prev][0] >= 2.0:\\n prev += 1\\n for j in range(i + 1, n):\\n cx, cy = p[j]\\n if cx - bx >= 2.0:\\n break\\n if (bx - cx) ** 2 + (by - cy) ** 2 <= 4.0:\\n for ex, ey in circle_center(bx, by, cx, cy):\\n count = 2\\n for k in range(prev, n):\\n if k == i or k == j:\\n continue\\n dx, dy = p[k]\\n if dx - ex >= 1.0:\\n break\\n if (ex - dx) ** 2 + (ey - dy) ** 2 <= 1.0:\\n count += 1\\n ans = max(ans, count)\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.0303030303,\n", + " 'diff': ['- return [[xc - k * yd, yc + k * xd], [xc + k * yd, yc - k * xd]]',\n", + " '+ xd *= k',\n", + " '+ yd *= k',\n", + " '+ return [[xc - yd, yc + xd], [xc + yd, yc - xd]]',\n", + " '- p = [list(map(float, input().split())) for i in range(n)]',\n", + " '- p.sort()',\n", + " '+ p = sorted(list(map(float, input().split())) for i in range(n))',\n", + " '- if dx - bx >= 2.0:',\n", + " '+ if dx - ex >= 1.0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3026192219,\n", + " 'measured_runtime_v1': 0.1054183228,\n", + " 'runtime_lift': 2.8706510771,\n", + " 'key': ['s376249504', 's496295641']},\n", + " {'user_id': 'u637175065',\n", + " 'problem_id': 'p03553',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's305170925',\n", + " 'submission_id_v1': 's833575440',\n", + " 'cpu_time_v0': 88,\n", + " 'cpu_time_v1': 46,\n", + " 'memory_v0': 7240,\n", + " 'memory_v1': 10956,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 47.73,\n", + " 'input': 'import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\\n\\n\\n\\nsys.setrecursionlimit(10**7)\\n\\ninf = 10**20\\n\\neps = 1.0 / 10**15\\n\\nmod = 10**9+7\\n\\n\\n\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\n\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\n\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\n\\ndef LS(): return sys.stdin.readline().split()\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef F(): return float(sys.stdin.readline())\\n\\ndef S(): return input()\\n\\ndef pf(s): return print(s, flush=True)\\n\\ndef divisions(n):\\n\\n sq = int(math.sqrt(n)+1)\\n\\n d = collections.defaultdict(int)\\n\\n while n % 2 == 0:\\n\\n n //= 2\\n\\n d[2] += 1\\n\\n i = 3\\n\\n while n > 1 and sq >= i:\\n\\n if n % i == 0:\\n\\n n //= i\\n\\n d[i] += 1\\n\\n else:\\n\\n i += 2\\n\\n\\n\\n if n > 1:\\n\\n d[n] += 1\\n\\n\\n\\n r = [1]\\n\\n for k, v in d.items():\\n\\n for c in r[:]:\\n\\n for i in range(1,v+1):\\n\\n r.append(c*(k**i))\\n\\n\\n\\n return sorted(r)\\n\\n\\n\\ndef main():\\n\\n n = I()\\n\\n a = LI()\\n\\n s = set()\\n\\n for i in range(n,0,-1):\\n\\n d = divisions(i)\\n\\n ld = len(d)\\n\\n for j in range(1,2**ld):\\n\\n c = []\\n\\n ff = True\\n\\n for k in range(ld):\\n\\n if j & (1< 0:\\n\\n e[c][i] -= k\\n\\n e[i][c] += k\\n\\n return k\\n\\n return 0\\n\\n\\n\\n while True:\\n\\n self.v = [None] * self.N\\n\\n fs = f(s, inf)\\n\\n if fs == 0:\\n\\n break\\n\\n r += fs\\n\\n\\n\\n return r\\n\\n\\n\\n\\n\\ndef main():\\n\\n n = I()\\n\\n a = LI()\\n\\n\\n\\n s = n\\n\\n t = n + 1\\n\\n e = [[0] * (n+2) for _ in range(n+2)]\\n\\n for i in range(n):\\n\\n c = a[i]\\n\\n if c < 0:\\n\\n e[s][i] = -c\\n\\n ii = i + 1\\n\\n for j in range(ii*2, n+1, ii):\\n\\n e[i][j-1] = inf\\n\\n else:\\n\\n e[i][t] = c\\n\\n\\n\\n\\n\\n fl = Flow(e, n+2)\\n\\n r = fl.max_flow(s,t)\\n\\n\\n\\n return sum(map(lambda x: max(0,x), a)) - r\\n\\n\\n\\n# start = time.time()\\n\\nprint(main())\\n\\n# pe(time.time() - start)\\n\\n\\n\\n\\n\\n\\n',\n", + " 'code_v0_loc': 92,\n", + " 'code_v1_loc': 89,\n", + " 'code_v0_num_chars': 2351,\n", + " 'code_v1_num_chars': 2252,\n", + " 'code_v0_no_empty_lines': 'import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\neps = 1.0 / 10**15\\nmod = 10**9 + 7\\n\\n\\ndef LI():\\n return [int(x) for x in sys.stdin.readline().split()]\\n\\n\\ndef LI_():\\n return [int(x) - 1 for x in sys.stdin.readline().split()]\\n\\n\\ndef LF():\\n return [float(x) for x in sys.stdin.readline().split()]\\n\\n\\ndef LS():\\n return sys.stdin.readline().split()\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef F():\\n return float(sys.stdin.readline())\\n\\n\\ndef S():\\n return input()\\n\\n\\ndef pf(s):\\n return print(s, flush=True)\\n\\n\\ndef divisions(n):\\n sq = int(math.sqrt(n) + 1)\\n d = collections.defaultdict(int)\\n while n % 2 == 0:\\n n //= 2\\n d[2] += 1\\n i = 3\\n while n > 1 and sq >= i:\\n if n % i == 0:\\n n //= i\\n d[i] += 1\\n else:\\n i += 2\\n if n > 1:\\n d[n] += 1\\n r = [1]\\n for k, v in d.items():\\n for c in r[:]:\\n for i in range(1, v + 1):\\n r.append(c * (k**i))\\n return sorted(r)\\n\\n\\ndef main():\\n n = I()\\n a = LI()\\n s = set()\\n for i in range(n, 0, -1):\\n d = divisions(i)\\n ld = len(d)\\n for j in range(1, 2**ld):\\n c = []\\n ff = True\\n for k in range(ld):\\n if j & (1 << k):\\n f = True\\n for e in c:\\n if d[k] % e == 0:\\n f = False\\n ff = False\\n break\\n if f:\\n c.append(d[k])\\n if not ff:\\n break\\n if ff:\\n s.add(tuple(c + [n + 1]))\\n b = sorted(list(s), reverse=True)\\n for c in b:\\n t = 0\\n for j in range(1, n + 1):\\n f = False\\n for e in c:\\n if j % e == 0:\\n f = True\\n break\\n if f:\\n t += a[j - 1]\\n if t < 0:\\n for j in range(1, n + 1):\\n f = False\\n for e in c:\\n if j % e == 0:\\n f = True\\n break\\n if f:\\n a[j - 1] = 0\\n return sum(a)\\n\\n\\nprint(main())\\n',\n", + " 'code_v1_no_empty_lines': 'import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools\\nimport time, random\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\neps = 1.0 / 10**10\\nmod = 10**9 + 7\\nmod2 = 998244353\\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LLI():\\n return [list(map(int, l.split())) for l in sys.stdin.readlines()]\\n\\n\\ndef LI_():\\n return [int(x) - 1 for x in sys.stdin.readline().split()]\\n\\n\\ndef LF():\\n return [float(x) for x in sys.stdin.readline().split()]\\n\\n\\ndef LS():\\n return sys.stdin.readline().split()\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef F():\\n return float(sys.stdin.readline())\\n\\n\\ndef S():\\n return input()\\n\\n\\ndef pf(s):\\n return print(s, flush=True)\\n\\n\\ndef pe(s):\\n return print(str(s), file=sys.stderr)\\n\\n\\ndef JA(a, sep):\\n return sep.join(map(str, a))\\n\\n\\ndef JAA(a, s, t):\\n return s.join(t.join(map(str, b)) for b in a)\\n\\n\\nclass Flow:\\n def __init__(self, e, N):\\n self.E = e\\n self.N = N\\n\\n def max_flow(self, s, t):\\n r = 0\\n e = self.E\\n\\n def f(c, cap):\\n v = self.v\\n v[c] = 1\\n if c == t:\\n return cap\\n for i in range(self.N):\\n if v[i] or e[c][i] <= 0:\\n continue\\n cp = min(cap, e[c][i])\\n k = f(i, cp)\\n if k > 0:\\n e[c][i] -= k\\n e[i][c] += k\\n return k\\n return 0\\n\\n while True:\\n self.v = [None] * self.N\\n fs = f(s, inf)\\n if fs == 0:\\n break\\n r += fs\\n return r\\n\\n\\ndef main():\\n n = I()\\n a = LI()\\n s = n\\n t = n + 1\\n e = [[0] * (n + 2) for _ in range(n + 2)]\\n for i in range(n):\\n c = a[i]\\n if c < 0:\\n e[s][i] = -c\\n ii = i + 1\\n for j in range(ii * 2, n + 1, ii):\\n e[i][j - 1] = inf\\n else:\\n e[i][t] = c\\n fl = Flow(e, n + 2)\\n r = fl.max_flow(s, t)\\n return sum(map(lambda x: max(0, x), a)) - r\\n\\n\\n# start = time.time()\\nprint(main())\\n# pe(time.time() - start)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.2608695652,\n", + " 'diff': ['-import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools',\n", + " '+import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools',\n", + " '+import time, random',\n", + " '-eps = 1.0 / 10**15',\n", + " '+eps = 1.0 / 10**10',\n", + " '+mod2 = 998244353',\n", + " '+dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]',\n", + " '+ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]',\n", + " '- return [int(x) for x in sys.stdin.readline().split()]',\n", + " '+ return list(map(int, sys.stdin.readline().split()))',\n", + " '+',\n", + " '+',\n", + " '+def LLI():',\n", + " '+ return [list(map(int, l.split())) for l in sys.stdin.readlines()]',\n", + " '-def divisions(n):',\n", + " '- sq = int(math.sqrt(n) + 1)',\n", + " '- d = collections.defaultdict(int)',\n", + " '- while n % 2 == 0:',\n", + " '- n //= 2',\n", + " '- d[2] += 1',\n", + " '- i = 3',\n", + " '- while n > 1 and sq >= i:',\n", + " '- if n % i == 0:',\n", + " '- n //= i',\n", + " '- d[i] += 1',\n", + " '- else:',\n", + " '- i += 2',\n", + " '- if n > 1:',\n", + " '- d[n] += 1',\n", + " '- r = [1]',\n", + " '- for k, v in d.items():',\n", + " '- for c in r[:]:',\n", + " '- for i in range(1, v + 1):',\n", + " '- r.append(c * (k**i))',\n", + " '- return sorted(r)',\n", + " '+def pe(s):',\n", + " '+ return print(str(s), file=sys.stderr)',\n", + " '+',\n", + " '+',\n", + " '+def JA(a, sep):',\n", + " '+ return sep.join(map(str, a))',\n", + " '+',\n", + " '+',\n", + " '+def JAA(a, s, t):',\n", + " '+ return s.join(t.join(map(str, b)) for b in a)',\n", + " '+',\n", + " '+',\n", + " '+class Flow:',\n", + " '+ def __init__(self, e, N):',\n", + " '+ self.E = e',\n", + " '+ self.N = N',\n", + " '+',\n", + " '+ def max_flow(self, s, t):',\n", + " '+ r = 0',\n", + " '+ e = self.E',\n", + " '+',\n", + " '+ def f(c, cap):',\n", + " '+ v = self.v',\n", + " '+ v[c] = 1',\n", + " '+ if c == t:',\n", + " '+ return cap',\n", + " '+ for i in range(self.N):',\n", + " '+ if v[i] or e[c][i] <= 0:',\n", + " '+ continue',\n", + " '+ cp = min(cap, e[c][i])',\n", + " '+ k = f(i, cp)',\n", + " '+ if k > 0:',\n", + " '+ e[c][i] -= k',\n", + " '+ e[i][c] += k',\n", + " '+ return k',\n", + " '+ return 0',\n", + " '+',\n", + " '+ while True:',\n", + " '+ self.v = [None] * self.N',\n", + " '+ fs = f(s, inf)',\n", + " '+ if fs == 0:',\n", + " '+ break',\n", + " '+ r += fs',\n", + " '+ return r',\n", + " '- s = set()',\n", + " '- for i in range(n, 0, -1):',\n", + " '- d = divisions(i)',\n", + " '- ld = len(d)',\n", + " '- for j in range(1, 2**ld):',\n", + " '- c = []',\n", + " '- ff = True',\n", + " '- for k in range(ld):',\n", + " '- if j & (1 << k):',\n", + " '- f = True',\n", + " '- for e in c:',\n", + " '- if d[k] % e == 0:',\n", + " '- f = False',\n", + " '- ff = False',\n", + " '- break',\n", + " '- if f:',\n", + " '- c.append(d[k])',\n", + " '- if not ff:',\n", + " '- break',\n", + " '- if ff:',\n", + " '- s.add(tuple(c + [n + 1]))',\n", + " '- b = sorted(list(s), reverse=True)',\n", + " '- for c in b:',\n", + " '- t = 0',\n", + " '- for j in range(1, n + 1):',\n", + " '- f = False',\n", + " '- for e in c:',\n", + " '- if j % e == 0:',\n", + " '- f = True',\n", + " '- break',\n", + " '- if f:',\n", + " '- t += a[j - 1]',\n", + " '- if t < 0:',\n", + " '- for j in range(1, n + 1):',\n", + " '- f = False',\n", + " '- for e in c:',\n", + " '- if j % e == 0:',\n", + " '- f = True',\n", + " '- break',\n", + " '- if f:',\n", + " '- a[j - 1] = 0',\n", + " '- return sum(a)',\n", + " '+ s = n',\n", + " '+ t = n + 1',\n", + " '+ e = [[0] * (n + 2) for _ in range(n + 2)]',\n", + " '+ for i in range(n):',\n", + " '+ c = a[i]',\n", + " '+ if c < 0:',\n", + " '+ e[s][i] = -c',\n", + " '+ ii = i + 1',\n", + " '+ for j in range(ii * 2, n + 1, ii):',\n", + " '+ e[i][j - 1] = inf',\n", + " '+ else:',\n", + " '+ e[i][t] = c',\n", + " '+ fl = Flow(e, n + 2)',\n", + " '+ r = fl.max_flow(s, t)',\n", + " '+ return sum(map(lambda x: max(0, x), a)) - r',\n", + " '+# start = time.time()',\n", + " '+# pe(time.time() - start)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2170818343,\n", + " 'measured_runtime_v1': 0.0062613072,\n", + " 'runtime_lift': 34.670369248,\n", + " 'key': ['s305170925', 's833575440']},\n", + " {'user_id': 'u585482323',\n", + " 'problem_id': 'p03634',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's798160758',\n", + " 'submission_id_v1': 's876456894',\n", + " 'cpu_time_v0': 777,\n", + " 'cpu_time_v1': 659,\n", + " 'memory_v0': 85552,\n", + " 'memory_v1': 85552,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.19,\n", + " 'input': '#!usr/bin/env python3\\n\\nfrom collections import defaultdict\\n\\nfrom collections import deque\\n\\nfrom heapq import heappush, heappop\\n\\nimport sys\\n\\nimport math\\n\\nimport bisect\\n\\nimport random\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LS():return list(map(list, sys.stdin.readline().split()))\\n\\ndef S(): return list(sys.stdin.readline())[:-1]\\n\\ndef IR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = I()\\n\\n return l\\n\\ndef LIR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = LI()\\n\\n return l\\n\\ndef SR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = S()\\n\\n return l\\n\\ndef LSR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = SR()\\n\\n return l\\n\\nmod = 1000000007\\n\\n\\n\\n#A\\n\\n\"\"\"\\n\\ndef gcd(a,b):\\n\\n if a == 0:\\n\\n return b\\n\\n return gcd(b%a,a)\\n\\nn = I()\\n\\na = IR(n)\\n\\nl = a[0]\\n\\nfor i in range(1,n):\\n\\n g = gcd(l,a[i])\\n\\n l *= a[i]//g\\n\\nprint(l)\\n\\n\"\"\"\\n\\n\\n\\n#B\\n\\nn = I()\\n\\nv = [[] for i in range(n)]\\n\\nfor i in range(n-1):\\n\\n a,b,c = LI()\\n\\n a -= 1\\n\\n b -= 1\\n\\n v[a].append([b,c])\\n\\n v[b].append([a,c])\\n\\nQ,k = LI()\\n\\nd = [-1 for i in range(n)]\\n\\nd[k-1] = 0\\n\\nq = deque()\\n\\nq.append(k-1)\\n\\nwhile q:\\n\\n x = q.pop()\\n\\n for y,c in v[x]:\\n\\n if d[y] == -1:\\n\\n d[y] = d[x]+c\\n\\n q.append(y)\\n\\nfor i in range(Q):\\n\\n x,y = LI()\\n\\n x -= 1\\n\\n y -= 1\\n\\n print((d[x]+d[y]))\\n\\n#C\\n\\n\\n\\n#D\\n\\n\\n\\n#E\\n\\n\\n\\n#F\\n\\n\\n\\n#G\\n\\n\\n\\n#H\\n\\n\\n\\n#I\\n\\n\\n\\n#J\\n\\n\\n\\n#K\\n\\n\\n\\n#L\\n\\n\\n\\n#M\\n\\n\\n\\n#N\\n\\n\\n\\n#O\\n\\n\\n\\n#P\\n\\n\\n\\n#Q\\n\\n\\n\\n#R\\n\\n\\n\\n#S\\n\\n\\n\\n#T\\n',\n", + " 'target': '#!usr/bin/env python3\\n\\nfrom collections import defaultdict\\n\\nfrom collections import deque\\n\\nfrom heapq import heappush, heappop\\n\\nimport sys\\n\\nimport math\\n\\nimport bisect\\n\\nimport random\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LS():return list(map(list, sys.stdin.readline().split()))\\n\\ndef S(): return list(sys.stdin.readline())[:-1]\\n\\ndef IR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = I()\\n\\n return l\\n\\ndef LIR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = LI()\\n\\n return l\\n\\ndef SR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = S()\\n\\n return l\\n\\ndef LSR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = SR()\\n\\n return l\\n\\nmod = 1000000007\\n\\n\\n\\n#A\\n\\n\"\"\"\\n\\ndef gcd(a,b):\\n\\n if a == 0:\\n\\n return b\\n\\n return gcd(b%a,a)\\n\\nn = I()\\n\\na = IR(n)\\n\\nl = a[0]\\n\\nfor i in range(1,n):\\n\\n g = gcd(l,a[i])\\n\\n l *= a[i]//g\\n\\nprint(l)\\n\\n\"\"\"\\n\\n\\n\\n#B\\n\\nn = I()\\n\\nv = [[] for i in range(n)]\\n\\nfor i in range(n-1):\\n\\n a,b,c = LI()\\n\\n a -= 1\\n\\n b -= 1\\n\\n v[a].append([b,c])\\n\\n v[b].append([a,c])\\n\\nQ,k = LI()\\n\\nd = [-1 for i in range(n)]\\n\\nd[k-1] = 0\\n\\nq = deque()\\n\\nq.append(k-1)\\n\\nwhile q:\\n\\n x = q.popleft()\\n\\n for y,c in v[x]:\\n\\n if d[y] == -1:\\n\\n d[y] = d[x]+c\\n\\n q.append(y)\\n\\nfor i in range(Q):\\n\\n x,y = LI()\\n\\n x -= 1\\n\\n y -= 1\\n\\n print((d[x]+d[y]))\\n\\n#C\\n\\n\\n\\n#D\\n\\n\\n\\n#E\\n\\n\\n\\n#F\\n\\n\\n\\n#G\\n\\n\\n\\n#H\\n\\n\\n\\n#I\\n\\n\\n\\n#J\\n\\n\\n\\n#K\\n\\n\\n\\n#L\\n\\n\\n\\n#M\\n\\n\\n\\n#N\\n\\n\\n\\n#O\\n\\n\\n\\n#P\\n\\n\\n\\n#Q\\n\\n\\n\\n#R\\n\\n\\n\\n#S\\n\\n\\n\\n#T\\n',\n", + " 'code_v0_loc': 105,\n", + " 'code_v1_loc': 105,\n", + " 'code_v0_num_chars': 1535,\n", + " 'code_v1_num_chars': 1539,\n", + " 'code_v0_no_empty_lines': '#!usr/bin/env python3\\nfrom collections import defaultdict\\nfrom collections import deque\\nfrom heapq import heappush, heappop\\nimport sys\\nimport math\\nimport bisect\\nimport random\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LS():\\n return list(map(list, sys.stdin.readline().split()))\\n\\n\\ndef S():\\n return list(sys.stdin.readline())[:-1]\\n\\n\\ndef IR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = I()\\n return l\\n\\n\\ndef LIR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = LI()\\n return l\\n\\n\\ndef SR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = S()\\n return l\\n\\n\\ndef LSR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = SR()\\n return l\\n\\n\\nmod = 1000000007\\n# A\\n\"\"\"\\ndef gcd(a,b):\\n if a == 0:\\n return b\\n return gcd(b%a,a)\\nn = I()\\na = IR(n)\\nl = a[0]\\nfor i in range(1,n):\\n g = gcd(l,a[i])\\n l *= a[i]//g\\nprint(l)\\n\"\"\"\\n# B\\nn = I()\\nv = [[] for i in range(n)]\\nfor i in range(n - 1):\\n a, b, c = LI()\\n a -= 1\\n b -= 1\\n v[a].append([b, c])\\n v[b].append([a, c])\\nQ, k = LI()\\nd = [-1 for i in range(n)]\\nd[k - 1] = 0\\nq = deque()\\nq.append(k - 1)\\nwhile q:\\n x = q.pop()\\n for y, c in v[x]:\\n if d[y] == -1:\\n d[y] = d[x] + c\\n q.append(y)\\nfor i in range(Q):\\n x, y = LI()\\n x -= 1\\n y -= 1\\n print((d[x] + d[y]))\\n# C\\n# D\\n# E\\n# F\\n# G\\n# H\\n# I\\n# J\\n# K\\n# L\\n# M\\n# N\\n# O\\n# P\\n# Q\\n# R\\n# S\\n# T\\n',\n", + " 'code_v1_no_empty_lines': '#!usr/bin/env python3\\nfrom collections import defaultdict\\nfrom collections import deque\\nfrom heapq import heappush, heappop\\nimport sys\\nimport math\\nimport bisect\\nimport random\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LS():\\n return list(map(list, sys.stdin.readline().split()))\\n\\n\\ndef S():\\n return list(sys.stdin.readline())[:-1]\\n\\n\\ndef IR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = I()\\n return l\\n\\n\\ndef LIR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = LI()\\n return l\\n\\n\\ndef SR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = S()\\n return l\\n\\n\\ndef LSR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = SR()\\n return l\\n\\n\\nmod = 1000000007\\n# A\\n\"\"\"\\ndef gcd(a,b):\\n if a == 0:\\n return b\\n return gcd(b%a,a)\\nn = I()\\na = IR(n)\\nl = a[0]\\nfor i in range(1,n):\\n g = gcd(l,a[i])\\n l *= a[i]//g\\nprint(l)\\n\"\"\"\\n# B\\nn = I()\\nv = [[] for i in range(n)]\\nfor i in range(n - 1):\\n a, b, c = LI()\\n a -= 1\\n b -= 1\\n v[a].append([b, c])\\n v[b].append([a, c])\\nQ, k = LI()\\nd = [-1 for i in range(n)]\\nd[k - 1] = 0\\nq = deque()\\nq.append(k - 1)\\nwhile q:\\n x = q.popleft()\\n for y, c in v[x]:\\n if d[y] == -1:\\n d[y] = d[x] + c\\n q.append(y)\\nfor i in range(Q):\\n x, y = LI()\\n x -= 1\\n y -= 1\\n print((d[x] + d[y]))\\n# C\\n# D\\n# E\\n# F\\n# G\\n# H\\n# I\\n# J\\n# K\\n# L\\n# M\\n# N\\n# O\\n# P\\n# Q\\n# R\\n# S\\n# T\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- x = q.pop()', '+ x = q.popleft()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3495916958,\n", + " 'measured_runtime_v1': 0.1121557097,\n", + " 'runtime_lift': 3.1170209395,\n", + " 'key': ['s798160758', 's876456894']},\n", + " {'user_id': 'u969850098',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's201924324',\n", + " 'submission_id_v1': 's693837759',\n", + " 'cpu_time_v0': 323,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 21432,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 94.74,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN, D = list(map(int, input().split()))\\n\\npoints = [list(map(int, input().split())) for _ in range(N)]\\n\\ncount = 0\\n\\nfor i in range(N):\\n\\n for j in range(N):\\n\\n if j == i:\\n\\n continue\\n\\n dist = np.sqrt(sum([(points[i][d] - points[j][d]) ** 2 for d in range(D)]))\\n\\n if dist.is_integer():\\n\\n count += 1\\n\\nprint((count // 2))',\n", + " 'target': \"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\n\\n\\n\\n\\ndef calc_dist(x, y):\\n\\n dist = 0\\n\\n for xi, yi in zip(x, y):\\n\\n dist += (yi - xi) ** 2\\n\\n return dist ** (1/2)\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, D = list(map(int, sys.stdin.readline().rstrip().split()))\\n\\n X = [list(map(int, sys.stdin.readline().rstrip().split())) for _ in range(N)]\\n\\n\\n\\n ans = 0\\n\\n for i in range(N):\\n\\n for j in range(i+1, N):\\n\\n dist = calc_dist(X[i], X[j])\\n\\n if dist.is_integer():\\n\\n ans += 1\\n\\n \\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 372,\n", + " 'code_v1_num_chars': 571,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, D = list(map(int, input().split()))\\npoints = [list(map(int, input().split())) for _ in range(N)]\\ncount = 0\\nfor i in range(N):\\n for j in range(N):\\n if j == i:\\n continue\\n dist = np.sqrt(sum([(points[i][d] - points[j][d]) ** 2 for d in range(D)]))\\n if dist.is_integer():\\n count += 1\\nprint((count // 2))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\n\\n\\ndef calc_dist(x, y):\\n dist = 0\\n for xi, yi in zip(x, y):\\n dist += (yi - xi) ** 2\\n return dist ** (1 / 2)\\n\\n\\ndef main():\\n N, D = list(map(int, sys.stdin.readline().rstrip().split()))\\n X = [list(map(int, sys.stdin.readline().rstrip().split())) for _ in range(N)]\\n ans = 0\\n for i in range(N):\\n for j in range(i + 1, N):\\n dist = calc_dist(X[i], X[j])\\n if dist.is_integer():\\n ans += 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 51.8518518519,\n", + " 'diff': ['-import numpy as np',\n", + " '+import sys',\n", + " '-N, D = list(map(int, input().split()))',\n", + " '-points = [list(map(int, input().split())) for _ in range(N)]',\n", + " '-count = 0',\n", + " '-for i in range(N):',\n", + " '- for j in range(N):',\n", + " '- if j == i:',\n", + " '- continue',\n", + " '- dist = np.sqrt(sum([(points[i][d] - points[j][d]) ** 2 for d in range(D)]))',\n", + " '- if dist.is_integer():',\n", + " '- count += 1',\n", + " '-print((count // 2))',\n", + " '+sys.setrecursionlimit(10**6)',\n", + " '+',\n", + " '+',\n", + " '+def calc_dist(x, y):',\n", + " '+ dist = 0',\n", + " '+ for xi, yi in zip(x, y):',\n", + " '+ dist += (yi - xi) ** 2',\n", + " '+ return dist ** (1 / 2)',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ N, D = list(map(int, sys.stdin.readline().rstrip().split()))',\n", + " '+ X = [list(map(int, sys.stdin.readline().rstrip().split())) for _ in range(N)]',\n", + " '+ ans = 0',\n", + " '+ for i in range(N):',\n", + " '+ for j in range(i + 1, N):',\n", + " '+ dist = calc_dist(X[i], X[j])',\n", + " '+ if dist.is_integer():',\n", + " '+ ans += 1',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3888782218,\n", + " 'measured_runtime_v1': 0.1985105653,\n", + " 'runtime_lift': 6.9964952229,\n", + " 'key': ['s201924324', 's693837759']},\n", + " {'user_id': 'u094191970',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's541572320',\n", + " 'submission_id_v1': 's786496298',\n", + " 'cpu_time_v0': 431,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 22604,\n", + " 'memory_v1': 3444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.34,\n", + " 'input': \"from scipy.sparse.csgraph import floyd_warshall\\n\\n\\n\\nn,m=list(map(int,input().split()))\\n\\nl=[list(map(int,input().split())) for i in range(m)]\\n\\n\\n\\nans=0\\n\\nfor i in range(m):\\n\\n ll=l[:i]+l[i+1:]\\n\\n\\n\\n d=[[float('inf')]*n for i in range(n)]\\n\\n for i in range(n):\\n\\n d[i][i]=0\\n\\n\\n\\n for j in ll:\\n\\n d[j[0]-1][j[1]-1]=1\\n\\n d[j[1]-1][j[0]-1]=1\\n\\n\\n\\n d=floyd_warshall(d)\\n\\n\\n\\n if float('inf') in d:\\n\\n ans+=1\\n\\n\\n\\nprint(ans)\",\n", + " 'target': 'class UnionFind():\\n\\n def __init__(self, n):\\n\\n self.n = n\\n\\n self.parents = [-1] * n\\n\\n\\n\\n def find(self, x):\\n\\n if self.parents[x] < 0:\\n\\n return x\\n\\n else:\\n\\n self.parents[x] = self.find(self.parents[x])\\n\\n return self.parents[x]\\n\\n\\n\\n def union(self, x, y):\\n\\n x = self.find(x)\\n\\n y = self.find(y)\\n\\n\\n\\n if x == y:\\n\\n return\\n\\n\\n\\n if self.parents[x] > self.parents[y]:\\n\\n x, y = y, x\\n\\n\\n\\n self.parents[x] += self.parents[y]\\n\\n self.parents[y] = x\\n\\n\\n\\n def roots(self):\\n\\n return [i for i, x in enumerate(self.parents) if x < 0]\\n\\n\\n\\n def group_count(self):\\n\\n return len(self.roots())\\n\\n\\n\\nfrom copy import deepcopy\\n\\n\\n\\nn,m=list(map(int,input().split()))\\n\\nl=[list(map(int,input().split())) for i in range(m)]\\n\\n\\n\\ncnt=0\\n\\nfor i in range(m):\\n\\n uf=UnionFind(n)\\n\\n ll=deepcopy(l)\\n\\n del ll[i]\\n\\n for a,b in ll:\\n\\n a-=1\\n\\n b-=1\\n\\n uf.union(a,b)\\n\\n if uf.group_count()>=2:\\n\\n cnt+=1\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 48,\n", + " 'code_v0_num_chars': 437,\n", + " 'code_v1_num_chars': 1017,\n", + " 'code_v0_no_empty_lines': 'from scipy.sparse.csgraph import floyd_warshall\\n\\nn, m = list(map(int, input().split()))\\nl = [list(map(int, input().split())) for i in range(m)]\\nans = 0\\nfor i in range(m):\\n ll = l[:i] + l[i + 1 :]\\n d = [[float(\"inf\")] * n for i in range(n)]\\n for i in range(n):\\n d[i][i] = 0\\n for j in ll:\\n d[j[0] - 1][j[1] - 1] = 1\\n d[j[1] - 1][j[0] - 1] = 1\\n d = floyd_warshall(d)\\n if float(\"inf\") in d:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'class UnionFind:\\n def __init__(self, n):\\n self.n = n\\n self.parents = [-1] * n\\n\\n def find(self, x):\\n if self.parents[x] < 0:\\n return x\\n else:\\n self.parents[x] = self.find(self.parents[x])\\n return self.parents[x]\\n\\n def union(self, x, y):\\n x = self.find(x)\\n y = self.find(y)\\n if x == y:\\n return\\n if self.parents[x] > self.parents[y]:\\n x, y = y, x\\n self.parents[x] += self.parents[y]\\n self.parents[y] = x\\n\\n def roots(self):\\n return [i for i, x in enumerate(self.parents) if x < 0]\\n\\n def group_count(self):\\n return len(self.roots())\\n\\n\\nfrom copy import deepcopy\\n\\nn, m = list(map(int, input().split()))\\nl = [list(map(int, input().split())) for i in range(m)]\\ncnt = 0\\nfor i in range(m):\\n uf = UnionFind(n)\\n ll = deepcopy(l)\\n del ll[i]\\n for a, b in ll:\\n a -= 1\\n b -= 1\\n uf.union(a, b)\\n if uf.group_count() >= 2:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 52.0833333333,\n", + " 'diff': ['-from scipy.sparse.csgraph import floyd_warshall',\n", + " '+class UnionFind:',\n", + " '+ def __init__(self, n):',\n", + " '+ self.n = n',\n", + " '+ self.parents = [-1] * n',\n", + " '+',\n", + " '+ def find(self, x):',\n", + " '+ if self.parents[x] < 0:',\n", + " '+ return x',\n", + " '+ else:',\n", + " '+ self.parents[x] = self.find(self.parents[x])',\n", + " '+ return self.parents[x]',\n", + " '+',\n", + " '+ def union(self, x, y):',\n", + " '+ x = self.find(x)',\n", + " '+ y = self.find(y)',\n", + " '+ if x == y:',\n", + " '+ return',\n", + " '+ if self.parents[x] > self.parents[y]:',\n", + " '+ x, y = y, x',\n", + " '+ self.parents[x] += self.parents[y]',\n", + " '+ self.parents[y] = x',\n", + " '+',\n", + " '+ def roots(self):',\n", + " '+ return [i for i, x in enumerate(self.parents) if x < 0]',\n", + " '+',\n", + " '+ def group_count(self):',\n", + " '+ return len(self.roots())',\n", + " '+',\n", + " '+',\n", + " '+from copy import deepcopy',\n", + " '-ans = 0',\n", + " '+cnt = 0',\n", + " '- ll = l[:i] + l[i + 1 :]',\n", + " '- d = [[float(\"inf\")] * n for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- d[i][i] = 0',\n", + " '- for j in ll:',\n", + " '- d[j[0] - 1][j[1] - 1] = 1',\n", + " '- d[j[1] - 1][j[0] - 1] = 1',\n", + " '- d = floyd_warshall(d)',\n", + " '- if float(\"inf\") in d:',\n", + " '- ans += 1',\n", + " '-print(ans)',\n", + " '+ uf = UnionFind(n)',\n", + " '+ ll = deepcopy(l)',\n", + " '+ del ll[i]',\n", + " '+ for a, b in ll:',\n", + " '+ a -= 1',\n", + " '+ b -= 1',\n", + " '+ uf.union(a, b)',\n", + " '+ if uf.group_count() >= 2:',\n", + " '+ cnt += 1',\n", + " '+print(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1057568979,\n", + " 'measured_runtime_v1': 0.2238623059,\n", + " 'runtime_lift': 9.4064826571,\n", + " 'key': ['s541572320', 's786496298']},\n", + " {'user_id': 'u672220554',\n", + " 'problem_id': 'p02983',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's554161170',\n", + " 'submission_id_v1': 's606893257',\n", + " 'cpu_time_v0': 990,\n", + " 'cpu_time_v1': 76,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.32,\n", + " 'input': 'l,r = list(map(int,input().split()))\\n\\n\\n\\nif r - l > 2019:\\n\\n print((0))\\n\\nelse:\\n\\n tres = 2019\\n\\n for i in range(l,r):\\n\\n for j in range(i+1,r+1):\\n\\n mod = (i % 2019) * (j % 2019) % 2019\\n\\n tres = min(tres,mod)\\n\\n print(tres)\\n',\n", + " 'target': 'l,r = list(map(int,input().split()))\\n\\n\\n\\nif r - l > 2019:\\n\\n print((0))\\n\\nelse:\\n\\n tres = 2019\\n\\n for i in range(l,r):\\n\\n for j in range(i+1,r+1):\\n\\n mod = (i % 2019) * (j % 2019) % 2019\\n\\n tres = min(tres,mod)\\n\\n if tres == 0:\\n\\n break\\n\\n if tres == 0:\\n\\n break\\n\\n print(tres)\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 250,\n", + " 'code_v1_num_chars': 342,\n", + " 'code_v0_no_empty_lines': 'l, r = list(map(int, input().split()))\\nif r - l > 2019:\\n print((0))\\nelse:\\n tres = 2019\\n for i in range(l, r):\\n for j in range(i + 1, r + 1):\\n mod = (i % 2019) * (j % 2019) % 2019\\n tres = min(tres, mod)\\n print(tres)\\n',\n", + " 'code_v1_no_empty_lines': 'l, r = list(map(int, input().split()))\\nif r - l > 2019:\\n print((0))\\nelse:\\n tres = 2019\\n for i in range(l, r):\\n for j in range(i + 1, r + 1):\\n mod = (i % 2019) * (j % 2019) % 2019\\n tres = min(tres, mod)\\n if tres == 0:\\n break\\n if tres == 0:\\n break\\n print(tres)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.6666666667,\n", + " 'diff': ['+ if tres == 0:',\n", + " '+ break',\n", + " '+ if tres == 0:',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2616734529,\n", + " 'measured_runtime_v1': 0.2086780975,\n", + " 'runtime_lift': 1.2539574397,\n", + " 'key': ['s554161170', 's606893257']},\n", + " {'user_id': 'u581187895',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's424797203',\n", + " 'submission_id_v1': 's436835790',\n", + " 'cpu_time_v0': 169,\n", + " 'cpu_time_v1': 116,\n", + " 'memory_v0': 29000,\n", + " 'memory_v1': 3464,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 31.36,\n", + " 'input': '# a+b-2\\n\\n# N = a*b よってNの約数を求める\\n\\nimport numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nU = 10**6+100\\n\\nx = np.arange(1, U, dtype=np.int64)\\n\\ndiv = x[N%x==0]\\n\\nans = (div + N//div).min() - 2\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\nread = sys.stdin.buffer.read \\n\\ninput = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines \\n\\n\\n\\ndef make_divisors(n):\\n\\n divisors = []\\n\\n for i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n divisors.append((i, n//i))\\n\\n \\n\\n # divisors.sort()\\n\\n return divisors\\n\\n\\n\\nN = int(eval(input()))\\n\\ndiv = make_divisors(N)\\n\\n\\n\\nans = 10**15\\n\\nfor a, b in div:\\n\\n ans = min(ans, a+b-2)\\n\\nprint(ans) \\n\\n\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 184,\n", + " 'code_v1_num_chars': 475,\n", + " 'code_v0_no_empty_lines': '# a+b-2\\n# N = a*b よってNの約数を求める\\nimport numpy as np\\n\\nN = int(eval(input()))\\nU = 10**6 + 100\\nx = np.arange(1, U, dtype=np.int64)\\ndiv = x[N % x == 0]\\nans = (div + N // div).min() - 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**7)\\nread = sys.stdin.buffer.read\\ninput = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\ndef make_divisors(n):\\n divisors = []\\n for i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n divisors.append((i, n // i))\\n # divisors.sort()\\n return divisors\\n\\n\\nN = int(eval(input()))\\ndiv = make_divisors(N)\\nans = 10**15\\nfor a, b in div:\\n ans = min(ans, a + b - 2)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 56.5217391304,\n", + " 'diff': ['-# a+b-2',\n", + " '-# N = a*b よってNの約数を求める',\n", + " '-import numpy as np',\n", + " '+import sys',\n", + " '+',\n", + " '+sys.setrecursionlimit(10**7)',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+input = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '+',\n", + " '+',\n", + " '+def make_divisors(n):',\n", + " '+ divisors = []',\n", + " '+ for i in range(1, int(n**0.5) + 1):',\n", + " '+ if n % i == 0:',\n", + " '+ divisors.append((i, n // i))',\n", + " '+ # divisors.sort()',\n", + " '+ return divisors',\n", + " '+',\n", + " '-U = 10**6 + 100',\n", + " '-x = np.arange(1, U, dtype=np.int64)',\n", + " '-div = x[N % x == 0]',\n", + " '-ans = (div + N // div).min() - 2',\n", + " '+div = make_divisors(N)',\n", + " '+ans = 10**15',\n", + " '+for a, b in div:',\n", + " '+ ans = min(ans, a + b - 2)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7032481675,\n", + " 'measured_runtime_v1': 0.2399272685,\n", + " 'runtime_lift': 7.099018707,\n", + " 'key': ['s424797203', 's436835790']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's376562926',\n", + " 'submission_id_v1': 's211637431',\n", + " 'cpu_time_v0': 153,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 12680,\n", + " 'memory_v1': 4468,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.27,\n", + " 'input': \"# coding: utf-8\\n\\nimport sys\\n\\nimport numpy as np\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nH, W = lr()\\n\\nB = np.array([list(sr()) for _ in range(H)])\\n\\nA = [[1 if x == '#' else 0 for x in b] for b in B]\\n\\nrow = np.sum(A, axis=1)\\n\\ncolumn = np.sum(A, axis=0)\\n\\nr = row != 0\\n\\nc = column != 0\\n\\nanswer = B[r]\\n\\nanswer = answer[:, c].tolist()\\n\\nfor a in answer:\\n\\n print((''.join(a)))\\n\",\n", + " 'target': \"# coding: utf-8\\n\\nimport sys\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nH, W = lr()\\n\\nA = [sr() for _ in range(H)]\\n\\nB = []\\n\\nfor a in A:\\n\\n if '#' in a:\\n\\n B.append(a)\\n\\n\\n\\nB = zip(*[b for b in zip(*B) if '#' in b])\\n\\nfor b in B:\\n\\n print(*b, sep='')\\n\",\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 446,\n", + " 'code_v1_num_chars': 328,\n", + " 'code_v0_no_empty_lines': '# coding: utf-8\\nimport sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nH, W = lr()\\nB = np.array([list(sr()) for _ in range(H)])\\nA = [[1 if x == \"#\" else 0 for x in b] for b in B]\\nrow = np.sum(A, axis=1)\\ncolumn = np.sum(A, axis=0)\\nr = row != 0\\nc = column != 0\\nanswer = B[r]\\nanswer = answer[:, c].tolist()\\nfor a in answer:\\n print((\"\".join(a)))\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nimport sys\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nH, W = lr()\\nA = [sr() for _ in range(H)]\\nB = []\\nfor a in A:\\n if \"#\" in a:\\n B.append(a)\\nB = zip(*[b for b in zip(*B) if \"#\" in b])\\nfor b in B:\\n print(*b, sep=\"\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.5263157895,\n", + " 'diff': ['-import numpy as np',\n", + " '-B = np.array([list(sr()) for _ in range(H)])',\n", + " '-A = [[1 if x == \"#\" else 0 for x in b] for b in B]',\n", + " '-row = np.sum(A, axis=1)',\n", + " '-column = np.sum(A, axis=0)',\n", + " '-r = row != 0',\n", + " '-c = column != 0',\n", + " '-answer = B[r]',\n", + " '-answer = answer[:, c].tolist()',\n", + " '-for a in answer:',\n", + " '- print((\"\".join(a)))',\n", + " '+A = [sr() for _ in range(H)]',\n", + " '+B = []',\n", + " '+for a in A:',\n", + " '+ if \"#\" in a:',\n", + " '+ B.append(a)',\n", + " '+B = zip(*[b for b in zip(*B) if \"#\" in b])',\n", + " '+for b in B:',\n", + " '+ print(*b, sep=\"\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2545773008,\n", + " 'measured_runtime_v1': 0.1868477131,\n", + " 'runtime_lift': 6.7144375496,\n", + " 'key': ['s376562926', 's211637431']},\n", + " {'user_id': 'u771634798',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's591694965',\n", + " 'submission_id_v1': 's705639429',\n", + " 'cpu_time_v0': 110,\n", + " 'cpu_time_v1': 85,\n", + " 'memory_v0': 32148,\n", + " 'memory_v1': 32380,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.73,\n", + " 'input': 'k, n = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\n\\n\\ndiff = []\\n\\n\\n\\nfor i in range(n - 1):\\n\\n diff.append(a[i + 1] - a[i])\\n\\ndiff.append(k - a[-1] + a[0])\\n\\n\\n\\nprint((k - max(diff)))\\n',\n", + " 'target': 'k, n = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\n\\n\\na.append(k + a[0])\\n\\ndiff = [a1 - a0 for a0, a1 in zip(a, a[1:])]\\n\\n\\n\\nprint((k - max(diff)))\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 198,\n", + " 'code_v1_num_chars': 162,\n", + " 'code_v0_no_empty_lines': 'k, n = list(map(int, input().split()))\\na = list(map(int, input().split()))\\ndiff = []\\nfor i in range(n - 1):\\n diff.append(a[i + 1] - a[i])\\ndiff.append(k - a[-1] + a[0])\\nprint((k - max(diff)))\\n',\n", + " 'code_v1_no_empty_lines': 'k, n = list(map(int, input().split()))\\na = list(map(int, input().split()))\\na.append(k + a[0])\\ndiff = [a1 - a0 for a0, a1 in zip(a, a[1:])]\\nprint((k - max(diff)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.0,\n", + " 'diff': ['-diff = []',\n", + " '-for i in range(n - 1):',\n", + " '- diff.append(a[i + 1] - a[i])',\n", + " '-diff.append(k - a[-1] + a[0])',\n", + " '+a.append(k + a[0])',\n", + " '+diff = [a1 - a0 for a0, a1 in zip(a, a[1:])]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3387992765,\n", + " 'measured_runtime_v1': 0.2554280306,\n", + " 'runtime_lift': 1.3263981864,\n", + " 'key': ['s591694965', 's705639429']},\n", + " {'user_id': 'u164727245',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's121951272',\n", + " 'submission_id_v1': 's390007993',\n", + " 'cpu_time_v0': 131,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 9476,\n", + " 'memory_v1': 9244,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.81,\n", + " 'input': '# coding: utf-8\\n\\n\\n\\n\\n\\ndef solve(*args: str) -> str:\\n\\n k = int(args[0])\\n\\n\\n\\n l = 9*(k//7 if k % 7 == 0 else k)\\n\\n if l % 2 == 0 or l % 5 == 0:\\n\\n return \\'-1\\'\\n\\n\\n\\n r = phi = l\\n\\n for i in range(2, int(-pow(l, 1/2))):\\n\\n if r % i == 0:\\n\\n phi = phi//i*(i-1)\\n\\n while r % i:\\n\\n r //= i\\n\\n\\n\\n a = 10 % l\\n\\n ret = 1\\n\\n while(a != 1):\\n\\n a = a*10 % l\\n\\n ret += 1\\n\\n if phi < ret:\\n\\n ret = -1\\n\\n break\\n\\n\\n\\n return str(ret)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'target': '# coding: utf-8\\n\\nfrom math import sqrt\\n\\n\\n\\n\\n\\ndef solve(*args: str) -> str:\\n\\n k = int(args[0])\\n\\n\\n\\n l = 9*(k//7 if 0 == k % 7 else k)\\n\\n if 0 == l % 2 or 0 == l % 5:\\n\\n return \\'-1\\'\\n\\n\\n\\n r = phi = l\\n\\n for i in range(2, int(sqrt(l)+1)):\\n\\n if 0 == r % i:\\n\\n phi = phi*(i-1)//i\\n\\n while 0 == r % i:\\n\\n r //= i\\n\\n if 1 < r:\\n\\n phi = phi*(r-1)//r\\n\\n\\n\\n D = set()\\n\\n for d in range(1, int(sqrt(phi)+1)):\\n\\n if 0 == phi % d:\\n\\n D.add(d)\\n\\n D.add(phi//d)\\n\\n\\n\\n ret = -1\\n\\n for m in sorted(D):\\n\\n if 1 == pow(10, m, l):\\n\\n ret = m\\n\\n break\\n\\n\\n\\n return str(ret)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'code_v0_loc': 31,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 598,\n", + " 'code_v1_num_chars': 758,\n", + " 'code_v0_no_empty_lines': '# coding: utf-8\\ndef solve(*args: str) -> str:\\n k = int(args[0])\\n l = 9 * (k // 7 if k % 7 == 0 else k)\\n if l % 2 == 0 or l % 5 == 0:\\n return \"-1\"\\n r = phi = l\\n for i in range(2, int(-pow(l, 1 / 2))):\\n if r % i == 0:\\n phi = phi // i * (i - 1)\\n while r % i:\\n r //= i\\n a = 10 % l\\n ret = 1\\n while a != 1:\\n a = a * 10 % l\\n ret += 1\\n if phi < ret:\\n ret = -1\\n break\\n return str(ret)\\n\\n\\nif __name__ == \"__main__\":\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nfrom math import sqrt\\n\\n\\ndef solve(*args: str) -> str:\\n k = int(args[0])\\n l = 9 * (k // 7 if 0 == k % 7 else k)\\n if 0 == l % 2 or 0 == l % 5:\\n return \"-1\"\\n r = phi = l\\n for i in range(2, int(sqrt(l) + 1)):\\n if 0 == r % i:\\n phi = phi * (i - 1) // i\\n while 0 == r % i:\\n r //= i\\n if 1 < r:\\n phi = phi * (r - 1) // r\\n D = set()\\n for d in range(1, int(sqrt(phi) + 1)):\\n if 0 == phi % d:\\n D.add(d)\\n D.add(phi // d)\\n ret = -1\\n for m in sorted(D):\\n if 1 == pow(10, m, l):\\n ret = m\\n break\\n return str(ret)\\n\\n\\nif __name__ == \"__main__\":\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.2162162162,\n", + " 'diff': ['+from math import sqrt',\n", + " '+',\n", + " '+',\n", + " '- l = 9 * (k // 7 if k % 7 == 0 else k)',\n", + " '- if l % 2 == 0 or l % 5 == 0:',\n", + " '+ l = 9 * (k // 7 if 0 == k % 7 else k)',\n", + " '+ if 0 == l % 2 or 0 == l % 5:',\n", + " '- for i in range(2, int(-pow(l, 1 / 2))):',\n", + " '- if r % i == 0:',\n", + " '- phi = phi // i * (i - 1)',\n", + " '- while r % i:',\n", + " '+ for i in range(2, int(sqrt(l) + 1)):',\n", + " '+ if 0 == r % i:',\n", + " '+ phi = phi * (i - 1) // i',\n", + " '+ while 0 == r % i:',\n", + " '- a = 10 % l',\n", + " '- ret = 1',\n", + " '- while a != 1:',\n", + " '- a = a * 10 % l',\n", + " '- ret += 1',\n", + " '- if phi < ret:',\n", + " '- ret = -1',\n", + " '+ if 1 < r:',\n", + " '+ phi = phi * (r - 1) // r',\n", + " '+ D = set()',\n", + " '+ for d in range(1, int(sqrt(phi) + 1)):',\n", + " '+ if 0 == phi % d:',\n", + " '+ D.add(d)',\n", + " '+ D.add(phi // d)',\n", + " '+ ret = -1',\n", + " '+ for m in sorted(D):',\n", + " '+ if 1 == pow(10, m, l):',\n", + " '+ ret = m'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4349818358,\n", + " 'measured_runtime_v1': 0.2757263954,\n", + " 'runtime_lift': 1.5775850377,\n", + " 'key': ['s121951272', 's390007993']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p03434',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's231475572',\n", + " 'submission_id_v1': 's619171000',\n", + " 'cpu_time_v0': 35,\n", + " 'cpu_time_v1': 30,\n", + " 'memory_v0': 9016,\n", + " 'memory_v1': 9012,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.29,\n", + " 'input': '_,s=open(c:=0)\\n\\nfor a in sorted(map(int,s.split())):c=a-c\\n\\nprint(c)',\n", + " 'target': 'for a in sorted(map(int,[*open(c:=0)][1].split())):c=a-c\\n\\nprint(c)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 2,\n", + " 'code_v0_num_chars': 67,\n", + " 'code_v1_num_chars': 66,\n", + " 'code_v0_no_empty_lines': '_, s = open(c := 0)\\nfor a in sorted(map(int, s.split())):\\n c = a - c\\nprint(c)\\n',\n", + " 'code_v1_no_empty_lines': 'for a in sorted(map(int, [*open(c := 0)][1].split())):\\n c = a - c\\nprint(c)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-_, s = open(c := 0)',\n", + " '-for a in sorted(map(int, s.split())):',\n", + " '+for a in sorted(map(int, [*open(c := 0)][1].split())):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.269129122,\n", + " 'measured_runtime_v1': 0.112153646,\n", + " 'runtime_lift': 2.3996466598,\n", + " 'key': ['s231475572', 's619171000']},\n", + " {'user_id': 'u488127128',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's637972642',\n", + " 'submission_id_v1': 's581563839',\n", + " 'cpu_time_v0': 32,\n", + " 'cpu_time_v1': 28,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.5,\n", + " 'input': \"def factorial(N):\\n\\n power_r = 1\\n\\n for n in range(2,N+1):\\n\\n power_r *= n\\n\\n power_r %= 10**9+7\\n\\n return power_r\\n\\n\\n\\nif __name__ == '__main__':\\n\\n N = int(eval(input()))\\n\\n print((factorial(N)))\",\n", + " 'target': \"def factorial(N):\\n\\n power_r = 1\\n\\n for n in range(2,N+1):\\n\\n power_r = power_r*n % (10**9+7)\\n\\n return power_r\\n\\n\\n\\nif __name__ == '__main__':\\n\\n N = int(eval(input()))\\n\\n print((factorial(N)))\",\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 209,\n", + " 'code_v1_num_chars': 200,\n", + " 'code_v0_no_empty_lines': 'def factorial(N):\\n power_r = 1\\n for n in range(2, N + 1):\\n power_r *= n\\n power_r %= 10**9 + 7\\n return power_r\\n\\n\\nif __name__ == \"__main__\":\\n N = int(eval(input()))\\n print((factorial(N)))\\n',\n", + " 'code_v1_no_empty_lines': 'def factorial(N):\\n power_r = 1\\n for n in range(2, N + 1):\\n power_r = power_r * n % (10**9 + 7)\\n return power_r\\n\\n\\nif __name__ == \"__main__\":\\n N = int(eval(input()))\\n print((factorial(N)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['- power_r *= n',\n", + " '- power_r %= 10**9 + 7',\n", + " '+ power_r = power_r * n % (10**9 + 7)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3227770622,\n", + " 'measured_runtime_v1': 0.2497183731,\n", + " 'runtime_lift': 1.2925643324,\n", + " 'key': ['s637972642', 's581563839']},\n", + " {'user_id': 'u297574184',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's401307257',\n", + " 'submission_id_v1': 's179676165',\n", + " 'cpu_time_v0': 236,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.37,\n", + " 'input': 'def solve():\\n\\n N = int(eval(input()))\\n\\n\\n\\n numss = [[0]*(10) for _ in range(10)]\\n\\n for x in range(1, 10):\\n\\n for y in range(1, 10):\\n\\n num = 0\\n\\n for d in range(1, 5):\\n\\n for i in range(10**d):\\n\\n j = x*10**(d+1) + i*10 + y\\n\\n if 1 <= j <= N:\\n\\n num += 1\\n\\n else:\\n\\n break\\n\\n j = x*10 + y\\n\\n if 1 <= j <= N:\\n\\n num += 1\\n\\n if x == y:\\n\\n j = x\\n\\n if 1 <= j <= N:\\n\\n num += 1\\n\\n numss[x][y] = num\\n\\n\\n\\n ans = 0\\n\\n for A in range(1, N+1):\\n\\n ss = str(A)\\n\\n ans += numss[int(ss[-1])][int(ss[0])]\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nsolve()\\n',\n", + " 'target': 'def solve():\\n\\n strN = eval(input())\\n\\n N = int(strN)\\n\\n\\n\\n maxD = len(strN)\\n\\n\\n\\n numss = [[0]*(10) for _ in range(10)]\\n\\n for x in range(1, 10):\\n\\n for y in range(1, 10):\\n\\n num = 0\\n\\n for d in range(1, maxD-2):\\n\\n num += 10**d\\n\\n if maxD-2 > 0:\\n\\n if x < int(strN[0]):\\n\\n num += 10**(maxD-2)\\n\\n elif x == int(strN[0]):\\n\\n num += int(strN[1:-1]) + 1\\n\\n if y > int(strN[-1]):\\n\\n num -= 1\\n\\n j = x*10 + y\\n\\n if 1 <= j <= N:\\n\\n num += 1\\n\\n if x == y:\\n\\n j = x\\n\\n if 1 <= j <= N:\\n\\n num += 1\\n\\n numss[x][y] = num\\n\\n\\n\\n ans = 0\\n\\n for i in range(1, 10):\\n\\n for j in range(1, 10):\\n\\n ans += numss[i][j]*numss[j][i]\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nsolve()\\n',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 778,\n", + " 'code_v1_num_chars': 917,\n", + " 'code_v0_no_empty_lines': 'def solve():\\n N = int(eval(input()))\\n numss = [[0] * (10) for _ in range(10)]\\n for x in range(1, 10):\\n for y in range(1, 10):\\n num = 0\\n for d in range(1, 5):\\n for i in range(10**d):\\n j = x * 10 ** (d + 1) + i * 10 + y\\n if 1 <= j <= N:\\n num += 1\\n else:\\n break\\n j = x * 10 + y\\n if 1 <= j <= N:\\n num += 1\\n if x == y:\\n j = x\\n if 1 <= j <= N:\\n num += 1\\n numss[x][y] = num\\n ans = 0\\n for A in range(1, N + 1):\\n ss = str(A)\\n ans += numss[int(ss[-1])][int(ss[0])]\\n print(ans)\\n\\n\\nsolve()\\n',\n", + " 'code_v1_no_empty_lines': 'def solve():\\n strN = eval(input())\\n N = int(strN)\\n maxD = len(strN)\\n numss = [[0] * (10) for _ in range(10)]\\n for x in range(1, 10):\\n for y in range(1, 10):\\n num = 0\\n for d in range(1, maxD - 2):\\n num += 10**d\\n if maxD - 2 > 0:\\n if x < int(strN[0]):\\n num += 10 ** (maxD - 2)\\n elif x == int(strN[0]):\\n num += int(strN[1:-1]) + 1\\n if y > int(strN[-1]):\\n num -= 1\\n j = x * 10 + y\\n if 1 <= j <= N:\\n num += 1\\n if x == y:\\n j = x\\n if 1 <= j <= N:\\n num += 1\\n numss[x][y] = num\\n ans = 0\\n for i in range(1, 10):\\n for j in range(1, 10):\\n ans += numss[i][j] * numss[j][i]\\n print(ans)\\n\\n\\nsolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.5135135135,\n", + " 'diff': ['- N = int(eval(input()))',\n", + " '+ strN = eval(input())',\n", + " '+ N = int(strN)',\n", + " '+ maxD = len(strN)',\n", + " '- for d in range(1, 5):',\n", + " '- for i in range(10**d):',\n", + " '- j = x * 10 ** (d + 1) + i * 10 + y',\n", + " '- if 1 <= j <= N:',\n", + " '- num += 1',\n", + " '- else:',\n", + " '- break',\n", + " '+ for d in range(1, maxD - 2):',\n", + " '+ num += 10**d',\n", + " '+ if maxD - 2 > 0:',\n", + " '+ if x < int(strN[0]):',\n", + " '+ num += 10 ** (maxD - 2)',\n", + " '+ elif x == int(strN[0]):',\n", + " '+ num += int(strN[1:-1]) + 1',\n", + " '+ if y > int(strN[-1]):',\n", + " '+ num -= 1',\n", + " '- for A in range(1, N + 1):',\n", + " '- ss = str(A)',\n", + " '- ans += numss[int(ss[-1])][int(ss[0])]',\n", + " '+ for i in range(1, 10):',\n", + " '+ for j in range(1, 10):',\n", + " '+ ans += numss[i][j] * numss[j][i]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3220527915,\n", + " 'measured_runtime_v1': 0.2179562147,\n", + " 'runtime_lift': 1.4776031599,\n", + " 'key': ['s401307257', 's179676165']},\n", + " {'user_id': 'u638456847',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's863703424',\n", + " 'submission_id_v1': 's161615946',\n", + " 'cpu_time_v0': 171,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 13232,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.3,\n", + " 'input': 'import numpy as np\\n\\nimport sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\ndef main():\\n\\n N = int(readline())\\n\\n X = [int(i) for i in readline().split()]\\n\\n X = np.array(X)\\n\\n\\n\\n ans = np.min(np.sum((X - np.arange(1,101).reshape(100, 1))**2, axis=1))\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\ndef main():\\n\\n N = int(readline())\\n\\n X = [int(i) for i in readline().split()]\\n\\n\\n\\n ans = float(\\'inf\\')\\n\\n for i in range(1,101):\\n\\n tmp = 0\\n\\n for x in X:\\n\\n tmp += (x - i)**2\\n\\n \\n\\n if tmp < ans:\\n\\n ans = tmp\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 364,\n", + " 'code_v1_num_chars': 425,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\n\\n\\ndef main():\\n N = int(readline())\\n X = [int(i) for i in readline().split()]\\n X = np.array(X)\\n ans = np.min(np.sum((X - np.arange(1, 101).reshape(100, 1)) ** 2, axis=1))\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\n\\n\\ndef main():\\n N = int(readline())\\n X = [int(i) for i in readline().split()]\\n ans = float(\"inf\")\\n for i in range(1, 101):\\n tmp = 0\\n for x in X:\\n tmp += (x - i) ** 2\\n if tmp < ans:\\n ans = tmp\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.0869565217,\n", + " 'diff': ['-import numpy as np',\n", + " '- X = np.array(X)',\n", + " '- ans = np.min(np.sum((X - np.arange(1, 101).reshape(100, 1)) ** 2, axis=1))',\n", + " '+ ans = float(\"inf\")',\n", + " '+ for i in range(1, 101):',\n", + " '+ tmp = 0',\n", + " '+ for x in X:',\n", + " '+ tmp += (x - i) ** 2',\n", + " '+ if tmp < ans:',\n", + " '+ ans = tmp'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4478538656,\n", + " 'measured_runtime_v1': 0.2722764146,\n", + " 'runtime_lift': 5.3175882587,\n", + " 'key': ['s863703424', 's161615946']},\n", + " {'user_id': 'u994988729',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's496930898',\n", + " 'submission_id_v1': 's370133718',\n", + " 'cpu_time_v0': 237,\n", + " 'cpu_time_v1': 22,\n", + " 'memory_v0': 16952,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.72,\n", + " 'input': 'from scipy.sparse.csgraph import floyd_warshall\\n\\nimport numpy as np\\n\\nimport sys\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\nAB = []\\n\\nedge = np.zeros((N, N), dtype=int)\\n\\nfor _ in range(M):\\n\\n a, b = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n AB.append((a, b))\\n\\n edge[a][b] = 1\\n\\n edge[b][a] = 1\\n\\n\\n\\nans = 0\\n\\nfor i in range(M):\\n\\n graph = np.copy(edge)\\n\\n a, b = AB[i]\\n\\n graph[a][b] = 0\\n\\n graph[b][a] = 0\\n\\n fw = floyd_warshall(graph)\\n\\n if fw.max() > 10000:\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\n\\n\\nclass UF_tree:\\n\\n def __init__(self, n):\\n\\n self.root = [-1] * (n + 1) # -1ならそのノードが根,で絶対値が木の要素数\\n\\n self.rank = [0] * (n + 1)\\n\\n\\n\\n def find(self, x): # xの根となる要素番号を返す\\n\\n if self.root[x] < 0:\\n\\n return x\\n\\n else:\\n\\n self.root[x] = self.find(self.root[x])\\n\\n return self.root[x]\\n\\n\\n\\n def isSame(self, x, y):\\n\\n return self.find(x) == self.find(y)\\n\\n\\n\\n def unite(self, x, y):\\n\\n x = self.find(x)\\n\\n y = self.find(y)\\n\\n if x == y:\\n\\n return\\n\\n elif self.rank[x] < self.rank[y]:\\n\\n self.root[y] += self.root[x]\\n\\n self.root[x] = y\\n\\n else:\\n\\n self.root[x] += self.root[y]\\n\\n self.root[y] = x\\n\\n if self.rank[x] == self.rank[y]:\\n\\n self.rank[x] += 1\\n\\n\\n\\n def getNodeLen(self, x):\\n\\n return -self.root[self.find(x)]\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n N, M = list(map(int, input().split()))\\n\\n AB = tuple(tuple(map(int, input().split())) for _ in range(M))\\n\\n\\n\\n ans = 0\\n\\n for i in range(M):\\n\\n uf = UF_tree(N)\\n\\n for j, (a, b) in enumerate(AB):\\n\\n if i == j:\\n\\n continue\\n\\n uf.unite(a, b)\\n\\n a, b = AB[i]\\n\\n if not uf.isSame(a, b):\\n\\n ans += 1\\n\\n print(ans)',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 53,\n", + " 'code_v0_num_chars': 544,\n", + " 'code_v1_num_chars': 1385,\n", + " 'code_v0_no_empty_lines': 'from scipy.sparse.csgraph import floyd_warshall\\nimport numpy as np\\nimport sys\\n\\ninput = sys.stdin.readline\\nN, M = list(map(int, input().split()))\\nAB = []\\nedge = np.zeros((N, N), dtype=int)\\nfor _ in range(M):\\n a, b = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n AB.append((a, b))\\n edge[a][b] = 1\\n edge[b][a] = 1\\nans = 0\\nfor i in range(M):\\n graph = np.copy(edge)\\n a, b = AB[i]\\n graph[a][b] = 0\\n graph[b][a] = 0\\n fw = floyd_warshall(graph)\\n if fw.max() > 10000:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\nsys.setrecursionlimit(10**7)\\n\\n\\nclass UF_tree:\\n def __init__(self, n):\\n self.root = [-1] * (n + 1) # -1ならそのノードが根,で絶対値が木の要素数\\n self.rank = [0] * (n + 1)\\n\\n def find(self, x): # xの根となる要素番号を返す\\n if self.root[x] < 0:\\n return x\\n else:\\n self.root[x] = self.find(self.root[x])\\n return self.root[x]\\n\\n def isSame(self, x, y):\\n return self.find(x) == self.find(y)\\n\\n def unite(self, x, y):\\n x = self.find(x)\\n y = self.find(y)\\n if x == y:\\n return\\n elif self.rank[x] < self.rank[y]:\\n self.root[y] += self.root[x]\\n self.root[x] = y\\n else:\\n self.root[x] += self.root[y]\\n self.root[y] = x\\n if self.rank[x] == self.rank[y]:\\n self.rank[x] += 1\\n\\n def getNodeLen(self, x):\\n return -self.root[self.find(x)]\\n\\n\\nif __name__ == \"__main__\":\\n N, M = list(map(int, input().split()))\\n AB = tuple(tuple(map(int, input().split())) for _ in range(M))\\n ans = 0\\n for i in range(M):\\n uf = UF_tree(N)\\n for j, (a, b) in enumerate(AB):\\n if i == j:\\n continue\\n uf.unite(a, b)\\n a, b = AB[i]\\n if not uf.isSame(a, b):\\n ans += 1\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 47.1698113208,\n", + " 'diff': ['-from scipy.sparse.csgraph import floyd_warshall',\n", + " '-import numpy as np',\n", + " '-input = sys.stdin.readline',\n", + " '-N, M = list(map(int, input().split()))',\n", + " '-AB = []',\n", + " '-edge = np.zeros((N, N), dtype=int)',\n", + " '-for _ in range(M):',\n", + " '- a, b = list(map(int, input().split()))',\n", + " '- a -= 1',\n", + " '- b -= 1',\n", + " '- AB.append((a, b))',\n", + " '- edge[a][b] = 1',\n", + " '- edge[b][a] = 1',\n", + " '-ans = 0',\n", + " '-for i in range(M):',\n", + " '- graph = np.copy(edge)',\n", + " '- a, b = AB[i]',\n", + " '- graph[a][b] = 0',\n", + " '- graph[b][a] = 0',\n", + " '- fw = floyd_warshall(graph)',\n", + " '- if fw.max() > 10000:',\n", + " '- ans += 1',\n", + " '-print(ans)',\n", + " '+input = sys.stdin.buffer.readline',\n", + " '+sys.setrecursionlimit(10**7)',\n", + " '+',\n", + " '+',\n", + " '+class UF_tree:',\n", + " '+ def __init__(self, n):',\n", + " '+ self.root = [-1] * (n + 1) # -1ならそのノードが根,で絶対値が木の要素数',\n", + " '+ self.rank = [0] * (n + 1)',\n", + " '+',\n", + " '+ def find(self, x): # xの根となる要素番号を返す',\n", + " '+ if self.root[x] < 0:',\n", + " '+ return x',\n", + " '+ else:',\n", + " '+ self.root[x] = self.find(self.root[x])',\n", + " '+ return self.root[x]',\n", + " '+',\n", + " '+ def isSame(self, x, y):',\n", + " '+ return self.find(x) == self.find(y)',\n", + " '+',\n", + " '+ def unite(self, x, y):',\n", + " '+ x = self.find(x)',\n", + " '+ y = self.find(y)',\n", + " '+ if x == y:',\n", + " '+ return',\n", + " '+ elif self.rank[x] < self.rank[y]:',\n", + " '+ self.root[y] += self.root[x]',\n", + " '+ self.root[x] = y',\n", + " '+ else:',\n", + " '+ self.root[x] += self.root[y]',\n", + " '+ self.root[y] = x',\n", + " '+ if self.rank[x] == self.rank[y]:',\n", + " '+ self.rank[x] += 1',\n", + " '+',\n", + " '+ def getNodeLen(self, x):',\n", + " '+ return -self.root[self.find(x)]',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ N, M = list(map(int, input().split()))',\n", + " '+ AB = tuple(tuple(map(int, input().split())) for _ in range(M))',\n", + " '+ ans = 0',\n", + " '+ for i in range(M):',\n", + " '+ uf = UF_tree(N)',\n", + " '+ for j, (a, b) in enumerate(AB):',\n", + " '+ if i == j:',\n", + " '+ continue',\n", + " '+ uf.unite(a, b)',\n", + " '+ a, b = AB[i]',\n", + " '+ if not uf.isSame(a, b):',\n", + " '+ ans += 1',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9811262887,\n", + " 'measured_runtime_v1': 0.2078541028,\n", + " 'runtime_lift': 9.5313311664,\n", + " 'key': ['s496930898', 's370133718']},\n", + " {'user_id': 'u618107373',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's205446737',\n", + " 'submission_id_v1': 's887904874',\n", + " 'cpu_time_v0': 450,\n", + " 'cpu_time_v1': 113,\n", + " 'memory_v0': 473344,\n", + " 'memory_v1': 11884,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.89,\n", + " 'input': 'import sys\\n\\nsys.setrecursionlimit(100000)\\n\\n\\n\\ndef intinput(): return list(map(int,sys.stdin.readline().split()))\\n\\n\\n\\nfib={0:0,1:1,2:1}\\n\\nfor i in range(3,100003):\\n\\n fib[i]=fib[i-1]+fib[i-2]\\n\\n # fib.append(fib[i-1]+fib[i-2])\\n\\n\\n\\nn,m=intinput()\\n\\nmod=10**9+7\\n\\na=[int(sys.stdin.readline()) for _ in range(m)]\\n\\nif m!=0:\\n\\n l=[a[0]]\\n\\n for i in range(len(a)-1):\\n\\n l.append(a[i+1]-a[i]-1)\\n\\n l.append(n-a[-1])\\n\\n k=1\\n\\n for i in l:\\n\\n k=fib[i]*k%mod\\n\\n print((k%mod))\\n\\nelse:\\n\\n print((fib[n+1]%mod))',\n", + " 'target': 'import sys\\n\\nsys.setrecursionlimit(100000)\\n\\n\\n\\ndef intinput(): return list(map(int,sys.stdin.readline().split()))\\n\\n\\n\\n\\n\\nn, m = intinput()\\n\\na = {int(sys.stdin.readline()) for _ in range(m)}\\n\\nmemo = [0 for x in range(n + 4)]\\n\\nmemo[0] = 1\\n\\nmod = 10 ** 9 + 7\\n\\nfor i in range(n):\\n\\n if i + 1 not in a:\\n\\n memo[i + 1] = (memo[i + 1] + memo[i]) % mod\\n\\n if i + 2 not in a:\\n\\n memo[i + 2] = (memo[i + 2] + memo[i]) % mod\\n\\nprint((memo[n]))',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 510,\n", + " 'code_v1_num_chars': 435,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(100000)\\n\\n\\ndef intinput():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\nfib = {0: 0, 1: 1, 2: 1}\\nfor i in range(3, 100003):\\n fib[i] = fib[i - 1] + fib[i - 2]\\n# fib.append(fib[i-1]+fib[i-2])\\nn, m = intinput()\\nmod = 10**9 + 7\\na = [int(sys.stdin.readline()) for _ in range(m)]\\nif m != 0:\\n l = [a[0]]\\n for i in range(len(a) - 1):\\n l.append(a[i + 1] - a[i] - 1)\\n l.append(n - a[-1])\\n k = 1\\n for i in l:\\n k = fib[i] * k % mod\\n print((k % mod))\\nelse:\\n print((fib[n + 1] % mod))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(100000)\\n\\n\\ndef intinput():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\nn, m = intinput()\\na = {int(sys.stdin.readline()) for _ in range(m)}\\nmemo = [0 for x in range(n + 4)]\\nmemo[0] = 1\\nmod = 10**9 + 7\\nfor i in range(n):\\n if i + 1 not in a:\\n memo[i + 1] = (memo[i + 1] + memo[i]) % mod\\n if i + 2 not in a:\\n memo[i + 2] = (memo[i + 2] + memo[i]) % mod\\nprint((memo[n]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 29.1666666667,\n", + " 'diff': ['-fib = {0: 0, 1: 1, 2: 1}',\n", + " '-for i in range(3, 100003):',\n", + " '- fib[i] = fib[i - 1] + fib[i - 2]',\n", + " '-# fib.append(fib[i-1]+fib[i-2])',\n", + " '+a = {int(sys.stdin.readline()) for _ in range(m)}',\n", + " '+memo = [0 for x in range(n + 4)]',\n", + " '+memo[0] = 1',\n", + " '-a = [int(sys.stdin.readline()) for _ in range(m)]',\n", + " '-if m != 0:',\n", + " '- l = [a[0]]',\n", + " '- for i in range(len(a) - 1):',\n", + " '- l.append(a[i + 1] - a[i] - 1)',\n", + " '- l.append(n - a[-1])',\n", + " '- k = 1',\n", + " '- for i in l:',\n", + " '- k = fib[i] * k % mod',\n", + " '- print((k % mod))',\n", + " '-else:',\n", + " '- print((fib[n + 1] % mod))',\n", + " '+for i in range(n):',\n", + " '+ if i + 1 not in a:',\n", + " '+ memo[i + 1] = (memo[i + 1] + memo[i]) % mod',\n", + " '+ if i + 2 not in a:',\n", + " '+ memo[i + 2] = (memo[i + 2] + memo[i]) % mod',\n", + " '+print((memo[n]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 3.8133613999,\n", + " 'measured_runtime_v1': 0.2074506006,\n", + " 'runtime_lift': 18.3820214944,\n", + " 'key': ['s205446737', 's887904874']},\n", + " {'user_id': 'u150984829',\n", + " 'problem_id': 'p02276',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's439916574',\n", + " 'submission_id_v1': 's927428389',\n", + " 'cpu_time_v0': 80,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 16392,\n", + " 'memory_v1': 16388,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 25.0,\n", + " 'input': 'n=int(eval(input()))-1\\n\\nA=list(map(int,input().split()))\\n\\ni=0\\n\\nfor j in range(n):\\n\\n if A[j]<=A[-1]:A[i],A[j]=A[j],A[i];i+=1\\n\\nA[i],A[n]=A[n],A[i]\\n\\nprint((\" \".join(map(str,A[:i]))+\" [\"+str(A[i])+\"] \"+\" \".join(map(str,A[i+1:]))))\\n',\n", + " 'target': 'def s():\\n\\n n=int(eval(input()))-1\\n\\n A=list(map(int,input().split()))\\n\\n i=0\\n\\n for j in range(n):\\n\\n if A[j]<=A[-1]:A[i],A[j]=A[j],A[i];i+=1\\n\\n A[i],A[n]=A[n],A[i]\\n\\n print((\" \".join(map(str,A[:i]))+\" [\"+str(A[i])+\"] \"+\" \".join(map(str,A[i+1:]))))\\n\\nif\\'__main__\\'==__name__:s()\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 219,\n", + " 'code_v1_num_chars': 264,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input())) - 1\\nA = list(map(int, input().split()))\\ni = 0\\nfor j in range(n):\\n if A[j] <= A[-1]:\\n A[i], A[j] = A[j], A[i]\\n i += 1\\nA[i], A[n] = A[n], A[i]\\nprint(\\n (\\n \" \".join(map(str, A[:i]))\\n + \" [\"\\n + str(A[i])\\n + \"] \"\\n + \" \".join(map(str, A[i + 1 :]))\\n )\\n)\\n',\n", + " 'code_v1_no_empty_lines': 'def s():\\n n = int(eval(input())) - 1\\n A = list(map(int, input().split()))\\n i = 0\\n for j in range(n):\\n if A[j] <= A[-1]:\\n A[i], A[j] = A[j], A[i]\\n i += 1\\n A[i], A[n] = A[n], A[i]\\n print(\\n (\\n \" \".join(map(str, A[:i]))\\n + \" [\"\\n + str(A[i])\\n + \"] \"\\n + \" \".join(map(str, A[i + 1 :]))\\n )\\n )\\n\\n\\nif \"__main__\" == __name__:\\n s()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['-n = int(eval(input())) - 1',\n", + " '-A = list(map(int, input().split()))',\n", + " '-i = 0',\n", + " '-for j in range(n):',\n", + " '- if A[j] <= A[-1]:',\n", + " '- A[i], A[j] = A[j], A[i]',\n", + " '- i += 1',\n", + " '-A[i], A[n] = A[n], A[i]',\n", + " '-print(',\n", + " '- (',\n", + " '- \" \".join(map(str, A[:i]))',\n", + " '- + \" [\"',\n", + " '- + str(A[i])',\n", + " '- + \"] \"',\n", + " '- + \" \".join(map(str, A[i + 1 :]))',\n", + " '+def s():',\n", + " '+ n = int(eval(input())) - 1',\n", + " '+ A = list(map(int, input().split()))',\n", + " '+ i = 0',\n", + " '+ for j in range(n):',\n", + " '+ if A[j] <= A[-1]:',\n", + " '+ A[i], A[j] = A[j], A[i]',\n", + " '+ i += 1',\n", + " '+ A[i], A[n] = A[n], A[i]',\n", + " '+ print(',\n", + " '+ (',\n", + " '+ \" \".join(map(str, A[:i]))',\n", + " '+ + \" [\"',\n", + " '+ + str(A[i])',\n", + " '+ + \"] \"',\n", + " '+ + \" \".join(map(str, A[i + 1 :]))',\n", + " '+ )',\n", + " '-)',\n", + " '+',\n", + " '+',\n", + " '+if \"__main__\" == __name__:',\n", + " '+ s()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2844968953,\n", + " 'measured_runtime_v1': 0.0927553341,\n", + " 'runtime_lift': 3.0671755746,\n", + " 'key': ['s439916574', 's927428389']},\n", + " {'user_id': 'u043236471',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's517208919',\n", + " 'submission_id_v1': 's465254734',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12492,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.59,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn,l = [int(x) for x in input().split()] \\n\\nx = np.arange(l,l+n)\\n\\ny = np.abs(x)\\n\\nx = np.delete(x, np.argmin(y))\\n\\nprint((np.sum(x)))',\n", + " 'target': 'N, L = list(map(int, input().split()))\\n\\napples = [i for i in range(L, L+N)]\\n\\napples_abs = [abs(i) for i in apples]\\n\\nmin_idx = apples_abs.index(min(apples_abs))\\n\\n\\n\\nprint((sum(apples) - apples[min_idx]))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 149,\n", + " 'code_v1_num_chars': 193,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, l = [int(x) for x in input().split()]\\nx = np.arange(l, l + n)\\ny = np.abs(x)\\nx = np.delete(x, np.argmin(y))\\nprint((np.sum(x)))\\n',\n", + " 'code_v1_no_empty_lines': 'N, L = list(map(int, input().split()))\\napples = [i for i in range(L, L + N)]\\napples_abs = [abs(i) for i in apples]\\nmin_idx = apples_abs.index(min(apples_abs))\\nprint((sum(apples) - apples[min_idx]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-n, l = [int(x) for x in input().split()]',\n", + " '-x = np.arange(l, l + n)',\n", + " '-y = np.abs(x)',\n", + " '-x = np.delete(x, np.argmin(y))',\n", + " '-print((np.sum(x)))',\n", + " '+N, L = list(map(int, input().split()))',\n", + " '+apples = [i for i in range(L, L + N)]',\n", + " '+apples_abs = [abs(i) for i in apples]',\n", + " '+min_idx = apples_abs.index(min(apples_abs))',\n", + " '+print((sum(apples) - apples[min_idx]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.748840265,\n", + " 'measured_runtime_v1': 0.2910926256,\n", + " 'runtime_lift': 6.0078480561,\n", + " 'key': ['s517208919', 's465254734']},\n", + " {'user_id': 'u998741086',\n", + " 'problem_id': 'p03425',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's570150327',\n", + " 'submission_id_v1': 's255248054',\n", + " 'cpu_time_v0': 227,\n", + " 'cpu_time_v1': 144,\n", + " 'memory_v0': 16268,\n", + " 'memory_v1': 16064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 36.56,\n", + " 'input': \"#!/usr/bin/env python3\\n\\n\\n\\nn = int(eval(input()))\\n\\ns = [eval(input()) for _ in range(n)]\\n\\n\\n\\nc = [0 for _ in range(5)]\\n\\nt = 'MARCH'\\n\\n\\n\\nfor i in range(n):\\n\\n for j in range(5):\\n\\n if s[i][0] == t[j]:\\n\\n c[j] += 1\\n\\nans = 0 \\n\\nfor i in range(5):\\n\\n for j in range(i+1, 5): \\n\\n for k in range(j+1, 5): \\n\\n ans += c[i]*c[k]*c[j]\\n\\nprint(ans)\\n\",\n", + " 'target': \"#!/usr/bin/env python3\\n\\n\\n\\nn = int(eval(input()))\\n\\ns = [eval(input()) for _ in range(n)]\\n\\nd = {}\\n\\n\\n\\nfor c in s:\\n\\n if c[0] not in d:\\n\\n d[c[0]] = 1 \\n\\n else:\\n\\n d[c[0]] += 1\\n\\n\\n\\ntmp = d.copy()\\n\\nt = ['M', 'A', 'R', 'C', 'H']\\n\\nfor c in tmp:\\n\\n if c not in t:\\n\\n d.pop(c)\\n\\n\\n\\nans = 0 \\n\\ndlist = list(d.items())\\n\\nfor i in range(len(dlist)):\\n\\n for j in range(i+1, len(dlist)):\\n\\n for k in range(j+1, len(dlist)):\\n\\n ans += dlist[i][1]*dlist[j][1]*dlist[k][1]\\n\\nprint(ans)\\n\",\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 357,\n", + " 'code_v1_num_chars': 493,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env python3\\nn = int(eval(input()))\\ns = [eval(input()) for _ in range(n)]\\nc = [0 for _ in range(5)]\\nt = \"MARCH\"\\nfor i in range(n):\\n for j in range(5):\\n if s[i][0] == t[j]:\\n c[j] += 1\\nans = 0\\nfor i in range(5):\\n for j in range(i + 1, 5):\\n for k in range(j + 1, 5):\\n ans += c[i] * c[k] * c[j]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\nn = int(eval(input()))\\ns = [eval(input()) for _ in range(n)]\\nd = {}\\nfor c in s:\\n if c[0] not in d:\\n d[c[0]] = 1\\n else:\\n d[c[0]] += 1\\ntmp = d.copy()\\nt = [\"M\", \"A\", \"R\", \"C\", \"H\"]\\nfor c in tmp:\\n if c not in t:\\n d.pop(c)\\nans = 0\\ndlist = list(d.items())\\nfor i in range(len(dlist)):\\n for j in range(i + 1, len(dlist)):\\n for k in range(j + 1, len(dlist)):\\n ans += dlist[i][1] * dlist[j][1] * dlist[k][1]\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 28.0,\n", + " 'diff': ['-c = [0 for _ in range(5)]',\n", + " '-t = \"MARCH\"',\n", + " '-for i in range(n):',\n", + " '- for j in range(5):',\n", + " '- if s[i][0] == t[j]:',\n", + " '- c[j] += 1',\n", + " '+d = {}',\n", + " '+for c in s:',\n", + " '+ if c[0] not in d:',\n", + " '+ d[c[0]] = 1',\n", + " '+ else:',\n", + " '+ d[c[0]] += 1',\n", + " '+tmp = d.copy()',\n", + " '+t = [\"M\", \"A\", \"R\", \"C\", \"H\"]',\n", + " '+for c in tmp:',\n", + " '+ if c not in t:',\n", + " '+ d.pop(c)',\n", + " '-for i in range(5):',\n", + " '- for j in range(i + 1, 5):',\n", + " '- for k in range(j + 1, 5):',\n", + " '- ans += c[i] * c[k] * c[j]',\n", + " '+dlist = list(d.items())',\n", + " '+for i in range(len(dlist)):',\n", + " '+ for j in range(i + 1, len(dlist)):',\n", + " '+ for k in range(j + 1, len(dlist)):',\n", + " '+ ans += dlist[i][1] * dlist[j][1] * dlist[k][1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3218575408,\n", + " 'measured_runtime_v1': 0.2488505929,\n", + " 'runtime_lift': 1.2933766287,\n", + " 'key': ['s570150327', 's255248054']},\n", + " {'user_id': 'u408260374',\n", + " 'problem_id': 'p00447',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's848528651',\n", + " 'submission_id_v1': 's273363528',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 90,\n", + " 'memory_v0': 22692,\n", + " 'memory_v1': 7092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.0,\n", + " 'input': 'board = [[False]*1000001]*1000001\\n\\nwhile True:\\n\\n m = int(eval(input()))\\n\\n if m == 0: break\\n\\n star = list({tuple(map(int, input().split())) for i in range(m)})\\n\\n sx, sy = star[0]\\n\\n \\n\\n n = int(eval(input()))\\n\\n starlist = list({tuple(map(int, input().split())) for i in range(n)})\\n\\n for i in range(len(starlist)):\\n\\n board[starlist[i][0]][starlist[i][1]] = True\\n\\n for i in range(n):\\n\\n flag = True\\n\\n for j in range(len(star)-1):\\n\\n dx = starlist[i][0] + star[j+1][0] - sx\\n\\n dy = starlist[i][1] + star[j+1][1] - sy\\n\\n if dx < 0 or 1000000 < dx or dy < 0 or 1000000 < dy or board[dx][dy] == False:\\n\\n flag = False\\n\\n break\\n\\n\\n\\n if flag == True:\\n\\n print((\"{} {}\".format(starlist[i][0] - sx, starlist[i][1] -sy)))\\n\\n break\\n\\n ',\n", + " 'target': 'while True:\\n\\n m = int(eval(input()))\\n\\n if m == 0: break\\n\\n star = list({tuple(map(int, input().split())) for i in range(m)})\\n\\n sx, sy = star[0]\\n\\n \\n\\n n = int(eval(input()))\\n\\n starset = {tuple(map(int, input().split())) for i in range(n)}\\n\\n for x, y in starset:\\n\\n flag = True\\n\\n for j in range(len(star)-1):\\n\\n dx = x + star[j+1][0] - sx\\n\\n dy = y + star[j+1][1] - sy\\n\\n if (dx, dy) not in starset:\\n\\n flag = False\\n\\n break\\n\\n\\n\\n if flag == True:\\n\\n print((x - sx, y - sy))\\n\\n break\\n\\n ',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 839,\n", + " 'code_v1_num_chars': 591,\n", + " 'code_v0_no_empty_lines': 'board = [[False] * 1000001] * 1000001\\nwhile True:\\n m = int(eval(input()))\\n if m == 0:\\n break\\n star = list({tuple(map(int, input().split())) for i in range(m)})\\n sx, sy = star[0]\\n n = int(eval(input()))\\n starlist = list({tuple(map(int, input().split())) for i in range(n)})\\n for i in range(len(starlist)):\\n board[starlist[i][0]][starlist[i][1]] = True\\n for i in range(n):\\n flag = True\\n for j in range(len(star) - 1):\\n dx = starlist[i][0] + star[j + 1][0] - sx\\n dy = starlist[i][1] + star[j + 1][1] - sy\\n if (\\n dx < 0\\n or 1000000 < dx\\n or dy < 0\\n or 1000000 < dy\\n or board[dx][dy] == False\\n ):\\n flag = False\\n break\\n if flag == True:\\n print((\"{} {}\".format(starlist[i][0] - sx, starlist[i][1] - sy)))\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'while True:\\n m = int(eval(input()))\\n if m == 0:\\n break\\n star = list({tuple(map(int, input().split())) for i in range(m)})\\n sx, sy = star[0]\\n n = int(eval(input()))\\n starset = {tuple(map(int, input().split())) for i in range(n)}\\n for x, y in starset:\\n flag = True\\n for j in range(len(star) - 1):\\n dx = x + star[j + 1][0] - sx\\n dy = y + star[j + 1][1] - sy\\n if (dx, dy) not in starset:\\n flag = False\\n break\\n if flag == True:\\n print((x - sx, y - sy))\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-board = [[False] * 1000001] * 1000001',\n", + " '- starlist = list({tuple(map(int, input().split())) for i in range(n)})',\n", + " '- for i in range(len(starlist)):',\n", + " '- board[starlist[i][0]][starlist[i][1]] = True',\n", + " '- for i in range(n):',\n", + " '+ starset = {tuple(map(int, input().split())) for i in range(n)}',\n", + " '+ for x, y in starset:',\n", + " '- dx = starlist[i][0] + star[j + 1][0] - sx',\n", + " '- dy = starlist[i][1] + star[j + 1][1] - sy',\n", + " '- if (',\n", + " '- dx < 0',\n", + " '- or 1000000 < dx',\n", + " '- or dy < 0',\n", + " '- or 1000000 < dy',\n", + " '- or board[dx][dy] == False',\n", + " '- ):',\n", + " '+ dx = x + star[j + 1][0] - sx',\n", + " '+ dy = y + star[j + 1][1] - sy',\n", + " '+ if (dx, dy) not in starset:',\n", + " '- print((\"{} {}\".format(starlist[i][0] - sx, starlist[i][1] - sy)))',\n", + " '+ print((x - sx, y - sy))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5961894131,\n", + " 'measured_runtime_v1': 0.2429299738,\n", + " 'runtime_lift': 2.454161599,\n", + " 'key': ['s848528651', 's273363528']},\n", + " {'user_id': 'u951601135',\n", + " 'problem_id': 'p03434',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's638983666',\n", + " 'submission_id_v1': 's443344147',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12504,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.59,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nvalue = list(map(int,input().split()))\\n\\nvalue=np.sort(value)[::-1]\\n\\n#print(N,value)\\n\\na = np.sum(value[::2])\\n\\nb = np.sum(value[1::2])\\n\\nprint((a-b))',\n", + " 'target': 'n = int(eval(input()))\\n\\na = sorted(list(map(int, input().split())), reverse=True)\\n\\nprint((sum(a[::2]) - sum(a[1::2])))\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 182,\n", + " 'code_v1_num_chars': 111,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nvalue = list(map(int, input().split()))\\nvalue = np.sort(value)[::-1]\\n# print(N,value)\\na = np.sum(value[::2])\\nb = np.sum(value[1::2])\\nprint((a - b))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = sorted(list(map(int, input().split())), reverse=True)\\nprint((sum(a[::2]) - sum(a[1::2])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 62.5,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '-value = list(map(int, input().split()))',\n", + " '-value = np.sort(value)[::-1]',\n", + " '-# print(N,value)',\n", + " '-a = np.sum(value[::2])',\n", + " '-b = np.sum(value[1::2])',\n", + " '-print((a - b))',\n", + " '+n = int(eval(input()))',\n", + " '+a = sorted(list(map(int, input().split())), reverse=True)',\n", + " '+print((sum(a[::2]) - sum(a[1::2])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3596615281,\n", + " 'measured_runtime_v1': 0.1847207425,\n", + " 'runtime_lift': 7.3606326496,\n", + " 'key': ['s638983666', 's443344147']},\n", + " {'user_id': 'u285443936',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's057200482',\n", + " 'submission_id_v1': 's045600813',\n", + " 'cpu_time_v0': 246,\n", + " 'cpu_time_v1': 216,\n", + " 'memory_v0': 27232,\n", + " 'memory_v1': 25200,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.2,\n", + " 'input': 'import statistics\\n\\nN = int(eval(input()))\\n\\na = [int(i) for i in input().split()]\\n\\nans = 0\\n\\n\\n\\nfor i in range(1,N+1):\\n\\n a[i-1] -= i\\n\\n\\n\\nb = statistics.median(a)\\n\\nfor i in range(N):\\n\\n ans += abs(a[i]-b)\\n\\nprint((int(ans)))',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = [int(i) for i in input().split()]\\n\\nC = [A[i]-i for i in range(N)]\\n\\nC.sort()\\n\\nans = 0\\n\\nmed = C[N//2]\\n\\nfor i in range(N):\\n\\n ans += abs(C[i]-med)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 211,\n", + " 'code_v1_num_chars': 177,\n", + " 'code_v0_no_empty_lines': 'import statistics\\n\\nN = int(eval(input()))\\na = [int(i) for i in input().split()]\\nans = 0\\nfor i in range(1, N + 1):\\n a[i - 1] -= i\\nb = statistics.median(a)\\nfor i in range(N):\\n ans += abs(a[i] - b)\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [int(i) for i in input().split()]\\nC = [A[i] - i for i in range(N)]\\nC.sort()\\nans = 0\\nmed = C[N // 2]\\nfor i in range(N):\\n ans += abs(C[i] - med)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-import statistics',\n", + " '-',\n", + " '-a = [int(i) for i in input().split()]',\n", + " '+A = [int(i) for i in input().split()]',\n", + " '+C = [A[i] - i for i in range(N)]',\n", + " '+C.sort()',\n", + " '-for i in range(1, N + 1):',\n", + " '- a[i - 1] -= i',\n", + " '-b = statistics.median(a)',\n", + " '+med = C[N // 2]',\n", + " '- ans += abs(a[i] - b)',\n", + " '-print((int(ans)))',\n", + " '+ ans += abs(C[i] - med)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2933883266,\n", + " 'measured_runtime_v1': 0.2086455548,\n", + " 'runtime_lift': 1.406156613,\n", + " 'key': ['s057200482', 's045600813']},\n", + " {'user_id': 'u488127128',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's349010345',\n", + " 'submission_id_v1': 's174569561',\n", + " 'cpu_time_v0': 35,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.14,\n", + " 'input': 'N = int(eval(input()))\\n\\na = 1\\n\\nfor n in range(2,N+1):\\n\\n a = a*n % (10**9+7)\\n\\nprint(a)',\n", + " 'target': \"def factorial(N):\\n\\n a = 1\\n\\n for n in range(2,N+1):\\n\\n a = a*n % (10**9 + 7)\\n\\n return a\\n\\n\\n\\nif __name__ == '__main__':\\n\\n N = int(eval(input()))\\n\\n print((factorial(N)))\",\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 82,\n", + " 'code_v1_num_chars': 178,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\na = 1\\nfor n in range(2, N + 1):\\n a = a * n % (10**9 + 7)\\nprint(a)\\n',\n", + " 'code_v1_no_empty_lines': 'def factorial(N):\\n a = 1\\n for n in range(2, N + 1):\\n a = a * n % (10**9 + 7)\\n return a\\n\\n\\nif __name__ == \"__main__\":\\n N = int(eval(input()))\\n print((factorial(N)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 44.4444444444,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-a = 1',\n", + " '-for n in range(2, N + 1):',\n", + " '- a = a * n % (10**9 + 7)',\n", + " '-print(a)',\n", + " '+def factorial(N):',\n", + " '+ a = 1',\n", + " '+ for n in range(2, N + 1):',\n", + " '+ a = a * n % (10**9 + 7)',\n", + " '+ return a',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ N = int(eval(input()))',\n", + " '+ print((factorial(N)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3416386657,\n", + " 'measured_runtime_v1': 0.2695478878,\n", + " 'runtime_lift': 1.2674507244,\n", + " 'key': ['s349010345', 's174569561']},\n", + " {'user_id': 'u642883360',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's671319819',\n", + " 'submission_id_v1': 's345697128',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 167,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 38512,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.39,\n", + " 'input': '#!/usr/bin/env pypy3\\n\\n\\n\\nimport math\\n\\nprint((math.factorial(int(eval(input()))) % 1000000007))',\n", + " 'target': 'n = int(eval(input()))\\n\\nfor i in range(n - 1, 1, -1):\\n\\n\\tn *= i\\n\\n\\tn %= 10**9 + 7\\n\\nprint(n)',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 85,\n", + " 'code_v1_num_chars': 83,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env pypy3\\nimport math\\n\\nprint((math.factorial(int(eval(input()))) % 1000000007))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nfor i in range(n - 1, 1, -1):\\n n *= i\\n n %= 10**9 + 7\\nprint(n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-#!/usr/bin/env pypy3',\n", + " '-import math',\n", + " '-',\n", + " '-print((math.factorial(int(eval(input()))) % 1000000007))',\n", + " '+n = int(eval(input()))',\n", + " '+for i in range(n - 1, 1, -1):',\n", + " '+ n *= i',\n", + " '+ n %= 10**9 + 7',\n", + " '+print(n)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5574923191,\n", + " 'measured_runtime_v1': 0.2242465372,\n", + " 'runtime_lift': 2.4860687974,\n", + " 'key': ['s671319819', 's345697128']},\n", + " {'user_id': 'u077291787',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's828043733',\n", + " 'submission_id_v1': 's360156642',\n", + " 'cpu_time_v0': 210,\n", + " 'cpu_time_v1': 183,\n", + " 'memory_v0': 27472,\n", + " 'memory_v1': 25324,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.86,\n", + " 'input': '# ABC102C - Linear Approximation (ARC100C)\\n\\nfrom statistics import median\\n\\n\\n\\n\\n\\ndef main():\\n\\n n = int(eval(input()))\\n\\n A = tuple(map(int, input().rstrip().split()))\\n\\n A = tuple(j - i for i, j in enumerate(A, start=1))\\n\\n b = median(A)\\n\\n ans = sum(abs(a - b) for a in A)\\n\\n print((int(ans)))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'target': '# ABC102C - Linear Approximation (ARC100C)\\n\\ndef main():\\n\\n n = int(eval(input()))\\n\\n A = tuple(map(int, input().rstrip().split()))\\n\\n A = sorted(j - i for i, j in enumerate(A, start=1))\\n\\n b = A[n // 2]\\n\\n ans = sum(abs(a - b) for a in A)\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 341,\n", + " 'code_v1_num_chars': 302,\n", + " 'code_v0_no_empty_lines': '# ABC102C - Linear Approximation (ARC100C)\\nfrom statistics import median\\n\\n\\ndef main():\\n n = int(eval(input()))\\n A = tuple(map(int, input().rstrip().split()))\\n A = tuple(j - i for i, j in enumerate(A, start=1))\\n b = median(A)\\n ans = sum(abs(a - b) for a in A)\\n print((int(ans)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# ABC102C - Linear Approximation (ARC100C)\\ndef main():\\n n = int(eval(input()))\\n A = tuple(map(int, input().rstrip().split()))\\n A = sorted(j - i for i, j in enumerate(A, start=1))\\n b = A[n // 2]\\n ans = sum(abs(a - b) for a in A)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-from statistics import median',\n", + " '-',\n", + " '-',\n", + " '- A = tuple(j - i for i, j in enumerate(A, start=1))',\n", + " '- b = median(A)',\n", + " '+ A = sorted(j - i for i, j in enumerate(A, start=1))',\n", + " '+ b = A[n // 2]',\n", + " '- print((int(ans)))',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2185840318,\n", + " 'measured_runtime_v1': 0.1650515537,\n", + " 'runtime_lift': 1.3243379227,\n", + " 'key': ['s828043733', 's360156642']},\n", + " {'user_id': 'u892487306',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's223961880',\n", + " 'submission_id_v1': 's091600532',\n", + " 'cpu_time_v0': 1331,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 130692,\n", + " 'memory_v1': 5012,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 97.37,\n", + " 'input': \"import numpy as np\\n\\n\\n\\n\\n\\ndef main():\\n\\n X, Y, Z, K = list(map(int, input().split(' ')))\\n\\n A = np.array(list(map(int, input().split(' '))))\\n\\n B = np.array(list(map(int, input().split(' '))))\\n\\n C = np.array(list(map(int, input().split(' '))))\\n\\n AB = np.array(np.meshgrid(A, B)).T.reshape(-1, 2).sum(axis=1)\\n\\n AB[::-1].sort()\\n\\n AB = AB[:min([K, X * Y])]\\n\\n ABC = np.array(np.meshgrid(AB, C)).T.reshape(-1, 2).sum(axis=1)\\n\\n ABC[::-1].sort()\\n\\n for ans in ABC[:K]:\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"from heapq import heappush, heappop\\n\\nfrom collections import defaultdict\\n\\n\\n\\n\\n\\ndef main():\\n\\n X, Y, Z, K = list(map(int, input().split(' ')))\\n\\n A = list(map(int, input().split(' ')))\\n\\n B = list(map(int, input().split(' ')))\\n\\n C = list(map(int, input().split(' ')))\\n\\n A.sort(reverse=True)\\n\\n B.sort(reverse=True)\\n\\n C.sort(reverse=True)\\n\\n que = [(- A[0] - B[0] - C[0], 0, 0, 0)] # multiply -1 to change min to max\\n\\n already_inserted = defaultdict(int)\\n\\n answer = list()\\n\\n for _ in range(K):\\n\\n q, i, j, k = heappop(que)\\n\\n answer.append(-q)\\n\\n if i + 1 < X:\\n\\n item_a = (- A[i + 1] - B[j] - C[k], i + 1, j, k)\\n\\n if already_inserted[item_a] == 0:\\n\\n heappush(que, item_a)\\n\\n already_inserted[item_a] = 1\\n\\n if j + 1 < Y:\\n\\n item_b = (- A[i] - B[j + 1] - C[k], i, j + 1, k)\\n\\n if already_inserted[item_b] == 0:\\n\\n heappush(que, item_b)\\n\\n already_inserted[item_b] = 1\\n\\n if k + 1 < Z:\\n\\n item_c = (- A[i] - B[j] - C[k + 1], i, j, k + 1)\\n\\n if already_inserted[item_c] == 0:\\n\\n heappush(que, item_c)\\n\\n already_inserted[item_c] = 1\\n\\n for ans in answer:\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 39,\n", + " 'code_v0_num_chars': 549,\n", + " 'code_v1_num_chars': 1320,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n\\ndef main():\\n X, Y, Z, K = list(map(int, input().split(\" \")))\\n A = np.array(list(map(int, input().split(\" \"))))\\n B = np.array(list(map(int, input().split(\" \"))))\\n C = np.array(list(map(int, input().split(\" \"))))\\n AB = np.array(np.meshgrid(A, B)).T.reshape(-1, 2).sum(axis=1)\\n AB[::-1].sort()\\n AB = AB[: min([K, X * Y])]\\n ABC = np.array(np.meshgrid(AB, C)).T.reshape(-1, 2).sum(axis=1)\\n ABC[::-1].sort()\\n for ans in ABC[:K]:\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from heapq import heappush, heappop\\nfrom collections import defaultdict\\n\\n\\ndef main():\\n X, Y, Z, K = list(map(int, input().split(\" \")))\\n A = list(map(int, input().split(\" \")))\\n B = list(map(int, input().split(\" \")))\\n C = list(map(int, input().split(\" \")))\\n A.sort(reverse=True)\\n B.sort(reverse=True)\\n C.sort(reverse=True)\\n que = [(-A[0] - B[0] - C[0], 0, 0, 0)] # multiply -1 to change min to max\\n already_inserted = defaultdict(int)\\n answer = list()\\n for _ in range(K):\\n q, i, j, k = heappop(que)\\n answer.append(-q)\\n if i + 1 < X:\\n item_a = (-A[i + 1] - B[j] - C[k], i + 1, j, k)\\n if already_inserted[item_a] == 0:\\n heappush(que, item_a)\\n already_inserted[item_a] = 1\\n if j + 1 < Y:\\n item_b = (-A[i] - B[j + 1] - C[k], i, j + 1, k)\\n if already_inserted[item_b] == 0:\\n heappush(que, item_b)\\n already_inserted[item_b] = 1\\n if k + 1 < Z:\\n item_c = (-A[i] - B[j] - C[k + 1], i, j, k + 1)\\n if already_inserted[item_c] == 0:\\n heappush(que, item_c)\\n already_inserted[item_c] = 1\\n for ans in answer:\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 51.2820512821,\n", + " 'diff': ['-import numpy as np',\n", + " '+from heapq import heappush, heappop',\n", + " '+from collections import defaultdict',\n", + " '- A = np.array(list(map(int, input().split(\" \"))))',\n", + " '- B = np.array(list(map(int, input().split(\" \"))))',\n", + " '- C = np.array(list(map(int, input().split(\" \"))))',\n", + " '- AB = np.array(np.meshgrid(A, B)).T.reshape(-1, 2).sum(axis=1)',\n", + " '- AB[::-1].sort()',\n", + " '- AB = AB[: min([K, X * Y])]',\n", + " '- ABC = np.array(np.meshgrid(AB, C)).T.reshape(-1, 2).sum(axis=1)',\n", + " '- ABC[::-1].sort()',\n", + " '- for ans in ABC[:K]:',\n", + " '+ A = list(map(int, input().split(\" \")))',\n", + " '+ B = list(map(int, input().split(\" \")))',\n", + " '+ C = list(map(int, input().split(\" \")))',\n", + " '+ A.sort(reverse=True)',\n", + " '+ B.sort(reverse=True)',\n", + " '+ C.sort(reverse=True)',\n", + " '+ que = [(-A[0] - B[0] - C[0], 0, 0, 0)] # multiply -1 to change min to max',\n", + " '+ already_inserted = defaultdict(int)',\n", + " '+ answer = list()',\n", + " '+ for _ in range(K):',\n", + " '+ q, i, j, k = heappop(que)',\n", + " '+ answer.append(-q)',\n", + " '+ if i + 1 < X:',\n", + " '+ item_a = (-A[i + 1] - B[j] - C[k], i + 1, j, k)',\n", + " '+ if already_inserted[item_a] == 0:',\n", + " '+ heappush(que, item_a)',\n", + " '+ already_inserted[item_a] = 1',\n", + " '+ if j + 1 < Y:',\n", + " '+ item_b = (-A[i] - B[j + 1] - C[k], i, j + 1, k)',\n", + " '+ if already_inserted[item_b] == 0:',\n", + " '+ heappush(que, item_b)',\n", + " '+ already_inserted[item_b] = 1',\n", + " '+ if k + 1 < Z:',\n", + " '+ item_c = (-A[i] - B[j] - C[k + 1], i, j, k + 1)',\n", + " '+ if already_inserted[item_c] == 0:',\n", + " '+ heappush(que, item_c)',\n", + " '+ already_inserted[item_c] = 1',\n", + " '+ for ans in answer:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8347421198,\n", + " 'measured_runtime_v1': 0.2379373548,\n", + " 'runtime_lift': 7.7110301627,\n", + " 'key': ['s223961880', 's091600532']},\n", + " {'user_id': 'u271752889',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's550736524',\n", + " 'submission_id_v1': 's101169834',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12504,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.59,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn,l=list(map(int,input().split()))\\n\\nli=[]\\n\\nfor i in range(n):\\n\\n li.append(l+i)\\n\\ns=sum(li)\\n\\np=np.array(li)\\n\\na=np.abs(p).tolist()\\n\\nk=min(a)\\n\\nb=a.index(k)\\n\\nprint((s-li[b]))',\n", + " 'target': 'n,l=list(map(int,input().split()))\\n\\na=0\\n\\nfor i in range(n):\\n\\n a+=i+l\\n\\nif l>=0:\\n\\n print((a-l))\\n\\nelif l+n-1<0:\\n\\n print((a-(l+n-1)))\\n\\nelse:\\n\\n print(a)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 184,\n", + " 'code_v1_num_chars': 141,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, l = list(map(int, input().split()))\\nli = []\\nfor i in range(n):\\n li.append(l + i)\\ns = sum(li)\\np = np.array(li)\\na = np.abs(p).tolist()\\nk = min(a)\\nb = a.index(k)\\nprint((s - li[b]))\\n',\n", + " 'code_v1_no_empty_lines': 'n, l = list(map(int, input().split()))\\na = 0\\nfor i in range(n):\\n a += i + l\\nif l >= 0:\\n print((a - l))\\nelif l + n - 1 < 0:\\n print((a - (l + n - 1)))\\nelse:\\n print(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-li = []',\n", + " '+a = 0',\n", + " '- li.append(l + i)',\n", + " '-s = sum(li)',\n", + " '-p = np.array(li)',\n", + " '-a = np.abs(p).tolist()',\n", + " '-k = min(a)',\n", + " '-b = a.index(k)',\n", + " '-print((s - li[b]))',\n", + " '+ a += i + l',\n", + " '+if l >= 0:',\n", + " '+ print((a - l))',\n", + " '+elif l + n - 1 < 0:',\n", + " '+ print((a - (l + n - 1)))',\n", + " '+else:',\n", + " '+ print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6350720274,\n", + " 'measured_runtime_v1': 0.006301439,\n", + " 'runtime_lift': 259.4759725026,\n", + " 'key': ['s550736524', 's101169834']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p02599',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's861498168',\n", + " 'submission_id_v1': 's937881941',\n", + " 'cpu_time_v0': 1554,\n", + " 'cpu_time_v1': 1387,\n", + " 'memory_v0': 102172,\n", + " 'memory_v1': 102328,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.75,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nBsize = 700\\n\\n\\n\\ndef Mo_argsort(LR):\\n\\n L = LR[:, 0]\\n\\n R = LR[:, 1]\\n\\n key1 = L // Bsize\\n\\n key2 = np.where(key1 & 1, -R, R)\\n\\n key = (key1 << 32) + key2\\n\\n return np.argsort(key)\\n\\n\\n\\ndef main(A, LR):\\n\\n N = len(A)\\n\\n Q = len(LR)\\n\\n ind = Mo_argsort(LR)\\n\\n count = np.zeros(N + 1, np.int64)\\n\\n ans = 0\\n\\n\\n\\n def add(x):\\n\\n nonlocal ans\\n\\n if not count[x]:\\n\\n ans += 1\\n\\n count[x] += 1\\n\\n\\n\\n def rem(x):\\n\\n nonlocal ans\\n\\n count[x] -= 1\\n\\n if not count[x]:\\n\\n ans -= 1\\n\\n\\n\\n answers = np.empty(Q, np.int64)\\n\\n nl, nr = 0, 0\\n\\n for i in ind:\\n\\n l, r = LR[i]\\n\\n l -= 1\\n\\n # 区間 [l, r) に対する計算\\n\\n while nl > l:\\n\\n nl -= 1\\n\\n add(A[nl])\\n\\n while nr < r:\\n\\n add(A[nr])\\n\\n nr += 1\\n\\n while nl < l:\\n\\n rem(A[nl])\\n\\n nl += 1\\n\\n while nr > r:\\n\\n nr -= 1\\n\\n rem(A[nr])\\n\\n # 答を求めて ans[i] に格納する\\n\\n answers[i] = ans\\n\\n return answers\\n\\n\\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n import numba\\n\\n from numba.pycc import CC\\n\\n i4 = numba.int32\\n\\n i8 = numba.int64\\n\\n cc = CC('my_module')\\n\\n\\n\\n def cc_export(f, signature):\\n\\n cc.export(f.__name__, signature)(f)\\n\\n return numba.njit(f)\\n\\n\\n\\n Mo_argsort = cc_export(Mo_argsort, (i8[:,:],))\\n\\n main = cc_export(main, (i8[:], i8[:, :]))\\n\\n cc.compile()\\n\\n\\n\\nfrom my_module import main\\n\\n\\n\\nN, Q = list(map(int, readline().split()))\\n\\nA = np.array(readline().split(), np.int64)\\n\\nLR = np.array(read().split(), np.int64).reshape(Q, 2)\\n\\n\\n\\nans = main(A, LR)\\n\\nprint(('\\\\n'.join(map(str, ans.tolist()))))\",\n", + " 'target': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nBsize = 1000\\n\\n\\n\\ndef Mo_argsort(LR):\\n\\n L = LR[:, 0]\\n\\n R = LR[:, 1]\\n\\n key1 = L // Bsize\\n\\n key2 = np.where(key1 & 1, -R, R)\\n\\n key = (key1 << 32) + key2\\n\\n return np.argsort(key)\\n\\n\\n\\ndef main(A, LR):\\n\\n N = len(A)\\n\\n Q = len(LR)\\n\\n ind = Mo_argsort(LR)\\n\\n count = np.zeros(N + 1, np.int64)\\n\\n ans = 0\\n\\n\\n\\n def add(x):\\n\\n nonlocal ans\\n\\n if not count[x]:\\n\\n ans += 1\\n\\n count[x] += 1\\n\\n\\n\\n def rem(x):\\n\\n nonlocal ans\\n\\n count[x] -= 1\\n\\n if not count[x]:\\n\\n ans -= 1\\n\\n\\n\\n answers = np.empty(Q, np.int64)\\n\\n nl, nr = 0, 0\\n\\n for i in ind:\\n\\n l, r = LR[i]\\n\\n l -= 1\\n\\n # 区間 [l, r) に対する計算\\n\\n while nl > l:\\n\\n nl -= 1\\n\\n add(A[nl])\\n\\n while nr < r:\\n\\n add(A[nr])\\n\\n nr += 1\\n\\n while nl < l:\\n\\n rem(A[nl])\\n\\n nl += 1\\n\\n while nr > r:\\n\\n nr -= 1\\n\\n rem(A[nr])\\n\\n # 答を求めて ans[i] に格納する\\n\\n answers[i] = ans\\n\\n return answers\\n\\n\\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n import numba\\n\\n from numba.pycc import CC\\n\\n i4 = numba.int32\\n\\n i8 = numba.int64\\n\\n cc = CC('my_module')\\n\\n\\n\\n def cc_export(f, signature):\\n\\n cc.export(f.__name__, signature)(f)\\n\\n return numba.njit(f)\\n\\n\\n\\n Mo_argsort = cc_export(Mo_argsort, (i8[:,:],))\\n\\n main = cc_export(main, (i8[:], i8[:, :]))\\n\\n cc.compile()\\n\\n\\n\\nfrom my_module import main\\n\\n\\n\\nN, Q = list(map(int, readline().split()))\\n\\nA = np.array(readline().split(), np.int64)\\n\\nLR = np.array(read().split(), np.int64).reshape(Q, 2)\\n\\n\\n\\nans = main(A, LR)\\n\\nprint(('\\\\n'.join(map(str, ans.tolist()))))\\n\",\n", + " 'code_v0_loc': 81,\n", + " 'code_v1_loc': 81,\n", + " 'code_v0_num_chars': 1799,\n", + " 'code_v1_num_chars': 1801,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nBsize = 700\\n\\n\\ndef Mo_argsort(LR):\\n L = LR[:, 0]\\n R = LR[:, 1]\\n key1 = L // Bsize\\n key2 = np.where(key1 & 1, -R, R)\\n key = (key1 << 32) + key2\\n return np.argsort(key)\\n\\n\\ndef main(A, LR):\\n N = len(A)\\n Q = len(LR)\\n ind = Mo_argsort(LR)\\n count = np.zeros(N + 1, np.int64)\\n ans = 0\\n\\n def add(x):\\n nonlocal ans\\n if not count[x]:\\n ans += 1\\n count[x] += 1\\n\\n def rem(x):\\n nonlocal ans\\n count[x] -= 1\\n if not count[x]:\\n ans -= 1\\n\\n answers = np.empty(Q, np.int64)\\n nl, nr = 0, 0\\n for i in ind:\\n l, r = LR[i]\\n l -= 1\\n # 区間 [l, r) に対する計算\\n while nl > l:\\n nl -= 1\\n add(A[nl])\\n while nr < r:\\n add(A[nr])\\n nr += 1\\n while nl < l:\\n rem(A[nl])\\n nl += 1\\n while nr > r:\\n nr -= 1\\n rem(A[nr])\\n # 答を求めて ans[i] に格納する\\n answers[i] = ans\\n return answers\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n import numba\\n from numba.pycc import CC\\n\\n i4 = numba.int32\\n i8 = numba.int64\\n cc = CC(\"my_module\")\\n\\n def cc_export(f, signature):\\n cc.export(f.__name__, signature)(f)\\n return numba.njit(f)\\n\\n Mo_argsort = cc_export(Mo_argsort, (i8[:, :],))\\n main = cc_export(main, (i8[:], i8[:, :]))\\n cc.compile()\\nfrom my_module import main\\n\\nN, Q = list(map(int, readline().split()))\\nA = np.array(readline().split(), np.int64)\\nLR = np.array(read().split(), np.int64).reshape(Q, 2)\\nans = main(A, LR)\\nprint((\"\\\\n\".join(map(str, ans.tolist()))))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nBsize = 1000\\n\\n\\ndef Mo_argsort(LR):\\n L = LR[:, 0]\\n R = LR[:, 1]\\n key1 = L // Bsize\\n key2 = np.where(key1 & 1, -R, R)\\n key = (key1 << 32) + key2\\n return np.argsort(key)\\n\\n\\ndef main(A, LR):\\n N = len(A)\\n Q = len(LR)\\n ind = Mo_argsort(LR)\\n count = np.zeros(N + 1, np.int64)\\n ans = 0\\n\\n def add(x):\\n nonlocal ans\\n if not count[x]:\\n ans += 1\\n count[x] += 1\\n\\n def rem(x):\\n nonlocal ans\\n count[x] -= 1\\n if not count[x]:\\n ans -= 1\\n\\n answers = np.empty(Q, np.int64)\\n nl, nr = 0, 0\\n for i in ind:\\n l, r = LR[i]\\n l -= 1\\n # 区間 [l, r) に対する計算\\n while nl > l:\\n nl -= 1\\n add(A[nl])\\n while nr < r:\\n add(A[nr])\\n nr += 1\\n while nl < l:\\n rem(A[nl])\\n nl += 1\\n while nr > r:\\n nr -= 1\\n rem(A[nr])\\n # 答を求めて ans[i] に格納する\\n answers[i] = ans\\n return answers\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n import numba\\n from numba.pycc import CC\\n\\n i4 = numba.int32\\n i8 = numba.int64\\n cc = CC(\"my_module\")\\n\\n def cc_export(f, signature):\\n cc.export(f.__name__, signature)(f)\\n return numba.njit(f)\\n\\n Mo_argsort = cc_export(Mo_argsort, (i8[:, :],))\\n main = cc_export(main, (i8[:], i8[:, :]))\\n cc.compile()\\nfrom my_module import main\\n\\nN, Q = list(map(int, readline().split()))\\nA = np.array(readline().split(), np.int64)\\nLR = np.array(read().split(), np.int64).reshape(Q, 2)\\nans = main(A, LR)\\nprint((\"\\\\n\".join(map(str, ans.tolist()))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-Bsize = 700', '+Bsize = 1000'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.3248852704,\n", + " 'measured_runtime_v1': 1.8262778948,\n", + " 'runtime_lift': 1.2730183489,\n", + " 'key': ['s861498168', 's937881941']},\n", + " {'user_id': 'u325282913',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's961535130',\n", + " 'submission_id_v1': 's147927462',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 192,\n", + " 'memory_v0': 40940,\n", + " 'memory_v1': 7668,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.52,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nN, M = list(map(int,input().split()))\\n\\nhole = [0] * (N+1)\\n\\nfor i in range(M):\\n\\n hole[int(eval(input()))] = 1\\n\\nif N == 1:\\n\\n print((1))\\n\\n exit()\\n\\nif N == 2:\\n\\n if hole[1] == 1:\\n\\n print((1))\\n\\n exit()\\n\\n if hole[1] == 0:\\n\\n print((2))\\n\\n exit()\\n\\nflg_one = False\\n\\nflg_two = False\\n\\nfirst = 1\\n\\nsecond = 2\\n\\nif hole[1] == 1:\\n\\n first = 0\\n\\n second = 1\\n\\n flg_one = True\\n\\nif hole[2] == 1:\\n\\n first = 1\\n\\n second = 0\\n\\n flg_two = True\\n\\nif flg_one and flg_two:\\n\\n print((0))\\n\\n exit()\\n\\n\\n\\nfor i in range(3,N):\\n\\n if hole[i] == 1:\\n\\n first = second\\n\\n second = 0\\n\\n continue\\n\\n tmp = first + second\\n\\n tmp %= 1000000007\\n\\n first = second\\n\\n second = tmp\\n\\ntmp = first + second\\n\\ntmp %= 1000000007\\n\\nprint(tmp)',\n", + " 'target': 'MOD = 10**9 + 7\\n\\nN, M = list(map(int, input().split()))\\n\\nstairs = [0]*(N+1)\\n\\nfor _ in range(M):\\n\\n stairs[int(eval(input()))] = 1\\n\\nif N == 1:\\n\\n print((1))\\n\\n exit()\\n\\nans = [0]*(N+1)\\n\\nans[1] = 1 if stairs[1] == 0 else 0\\n\\nans[2] = 1 + ans[1] if stairs[2] == 0 else 0\\n\\nfor i in range(3,N+1):\\n\\n if stairs[i] == 1:\\n\\n ans[i] = 0\\n\\n continue\\n\\n ans[i] = (ans[i-1] + ans[i-2]) % MOD\\n\\nprint((ans[N]))',\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 795,\n", + " 'code_v1_num_chars': 400,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nN, M = list(map(int, input().split()))\\nhole = [0] * (N + 1)\\nfor i in range(M):\\n hole[int(eval(input()))] = 1\\nif N == 1:\\n print((1))\\n exit()\\nif N == 2:\\n if hole[1] == 1:\\n print((1))\\n exit()\\n if hole[1] == 0:\\n print((2))\\n exit()\\nflg_one = False\\nflg_two = False\\nfirst = 1\\nsecond = 2\\nif hole[1] == 1:\\n first = 0\\n second = 1\\n flg_one = True\\nif hole[2] == 1:\\n first = 1\\n second = 0\\n flg_two = True\\nif flg_one and flg_two:\\n print((0))\\n exit()\\nfor i in range(3, N):\\n if hole[i] == 1:\\n first = second\\n second = 0\\n continue\\n tmp = first + second\\n tmp %= 1000000007\\n first = second\\n second = tmp\\ntmp = first + second\\ntmp %= 1000000007\\nprint(tmp)\\n',\n", + " 'code_v1_no_empty_lines': 'MOD = 10**9 + 7\\nN, M = list(map(int, input().split()))\\nstairs = [0] * (N + 1)\\nfor _ in range(M):\\n stairs[int(eval(input()))] = 1\\nif N == 1:\\n print((1))\\n exit()\\nans = [0] * (N + 1)\\nans[1] = 1 if stairs[1] == 0 else 0\\nans[2] = 1 + ans[1] if stairs[2] == 0 else 0\\nfor i in range(3, N + 1):\\n if stairs[i] == 1:\\n ans[i] = 0\\n continue\\n ans[i] = (ans[i - 1] + ans[i - 2]) % MOD\\nprint((ans[N]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 61.3636363636,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-input = sys.stdin.readline',\n", + " '+MOD = 10**9 + 7',\n", + " '-hole = [0] * (N + 1)',\n", + " '-for i in range(M):',\n", + " '- hole[int(eval(input()))] = 1',\n", + " '+stairs = [0] * (N + 1)',\n", + " '+for _ in range(M):',\n", + " '+ stairs[int(eval(input()))] = 1',\n", + " '-if N == 2:',\n", + " '- if hole[1] == 1:',\n", + " '- print((1))',\n", + " '- exit()',\n", + " '- if hole[1] == 0:',\n", + " '- print((2))',\n", + " '- exit()',\n", + " '-flg_one = False',\n", + " '-flg_two = False',\n", + " '-first = 1',\n", + " '-second = 2',\n", + " '-if hole[1] == 1:',\n", + " '- first = 0',\n", + " '- second = 1',\n", + " '- flg_one = True',\n", + " '-if hole[2] == 1:',\n", + " '- first = 1',\n", + " '- second = 0',\n", + " '- flg_two = True',\n", + " '-if flg_one and flg_two:',\n", + " '- print((0))',\n", + " '- exit()',\n", + " '-for i in range(3, N):',\n", + " '- if hole[i] == 1:',\n", + " '- first = second',\n", + " '- second = 0',\n", + " '+ans = [0] * (N + 1)',\n", + " '+ans[1] = 1 if stairs[1] == 0 else 0',\n", + " '+ans[2] = 1 + ans[1] if stairs[2] == 0 else 0',\n", + " '+for i in range(3, N + 1):',\n", + " '+ if stairs[i] == 1:',\n", + " '+ ans[i] = 0',\n", + " '- tmp = first + second',\n", + " '- tmp %= 1000000007',\n", + " '- first = second',\n", + " '- second = tmp',\n", + " '-tmp = first + second',\n", + " '-tmp %= 1000000007',\n", + " '-print(tmp)',\n", + " '+ ans[i] = (ans[i - 1] + ans[i - 2]) % MOD',\n", + " '+print((ans[N]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3368466201,\n", + " 'measured_runtime_v1': 0.2647972648,\n", + " 'runtime_lift': 1.2720925207,\n", + " 'key': ['s961535130', 's147927462']},\n", + " {'user_id': 'u768896740',\n", + " 'problem_id': 'p02951',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's688063139',\n", + " 'submission_id_v1': 's870650241',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'a, b, c = list(map(int, input().split()))\\n\\n\\n\\nif a < b + c:\\n\\n print((b+c-a))\\n\\nelse:\\n\\n print((0))',\n", + " 'target': 'a,b,c = list(map(int, input().split()))\\n\\n\\n\\nprint((max(0, c-(a-b))))',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 91,\n", + " 'code_v1_num_chars': 59,\n", + " 'code_v0_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\nif a < b + c:\\n print((b + c - a))\\nelse:\\n print((0))\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\nprint((max(0, c - (a - b))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-if a < b + c:',\n", + " '- print((b + c - a))',\n", + " '-else:',\n", + " '- print((0))',\n", + " '+print((max(0, c - (a - b))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2555535069,\n", + " 'measured_runtime_v1': 0.0829026203,\n", + " 'runtime_lift': 3.0825745416,\n", + " 'key': ['s688063139', 's870650241']},\n", + " {'user_id': 'u898080410',\n", + " 'problem_id': 'p03060',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's092296313',\n", + " 'submission_id_v1': 's809303091',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12488,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.67,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn = int(eval(input()))\\n\\nv = np.array(list(map(int, input().split())))\\n\\nc = np.array(list(map(int, input().split())))\\n\\np = v-c\\n\\nans = 0\\n\\nfor i in p:\\n\\n if i>0:\\n\\n ans+=i\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'n=int(eval(input()))\\n\\nV=list(map(int,input().split()))\\n\\nC=list(map(int,input().split()))\\n\\nans=0\\n\\nfor v,c in zip(V,C):\\n\\n diff=v-c\\n\\n if 0 0:\\n ans += i\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nV = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nans = 0\\nfor v, c in zip(V, C):\\n diff = v - c\\n if 0 < diff:\\n ans += diff\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-v = np.array(list(map(int, input().split())))',\n", + " '-c = np.array(list(map(int, input().split())))',\n", + " '-p = v - c',\n", + " '+V = list(map(int, input().split()))',\n", + " '+C = list(map(int, input().split()))',\n", + " '-for i in p:',\n", + " '- if i > 0:',\n", + " '- ans += i',\n", + " '+for v, c in zip(V, C):',\n", + " '+ diff = v - c',\n", + " '+ if 0 < diff:',\n", + " '+ ans += diff'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3782214599,\n", + " 'measured_runtime_v1': 0.1984234223,\n", + " 'runtime_lift': 6.9458607435,\n", + " 'key': ['s092296313', 's809303091']},\n", + " {'user_id': 'u316386814',\n", + " 'problem_id': 'p03608',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's433890015',\n", + " 'submission_id_v1': 's895796017',\n", + " 'cpu_time_v0': 713,\n", + " 'cpu_time_v1': 509,\n", + " 'memory_v0': 13028,\n", + " 'memory_v1': 13576,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.61,\n", + " 'input': \"n, m, r = list(map(int, input().split()))\\n\\nrs = list(map(int, input().split()))\\n\\n# construct map\\n\\nimport numpy as np\\n\\ndists = np.ones((n + 1, n + 1)) * float('inf')\\n\\nfor _ in range(m):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n dists[a, b] = dists[b, a] = c\\n\\nfor i in range(1, n + 1):\\n\\n dists[i, i] = 0\\n\\n\\n\\nfrom itertools import product, permutations\\n\\nfor i, j in product(list(range(1, 1 + n)), repeat=2):\\n\\n dists[j] = np.minimum(dists[j], dists[i] + dists[j, i])\\n\\n\\n\\nans = float('inf')\\n\\nfor path in permutations(rs):\\n\\n val = sum(dists[i, j] for i, j in zip(path, path[1:]))\\n\\n val = int(val)\\n\\n if val < ans:\\n\\n ans = val\\n\\n\\n\\nprint(ans)\",\n", + " 'target': \"n, m, r = list(map(int, input().split()))\\n\\nrs = list(map(int, input().split()))\\n\\n# construct map\\n\\nimport numpy as np\\n\\ndists = np.ones((n + 1, n + 1)) * float('inf')\\n\\nfor _ in range(m):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n dists[a, b] = dists[b, a] = c\\n\\nfor i in range(1, n + 1):\\n\\n dists[i, i] = 0\\n\\n\\n\\nfrom itertools import permutations\\n\\nfor i in range(1, 1 + n):\\n\\n dists = np.minimum(dists, dists[i: i + 1] + dists[:, i: i + 1])\\n\\n\\n\\nans = float('inf')\\n\\nfor path in permutations(rs):\\n\\n val = sum(dists[i, j] for i, j in zip(path, path[1:]))\\n\\n val = int(val)\\n\\n if val < ans:\\n\\n ans = val\\n\\n\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 656,\n", + " 'code_v1_num_chars': 633,\n", + " 'code_v0_no_empty_lines': 'n, m, r = list(map(int, input().split()))\\nrs = list(map(int, input().split()))\\n# construct map\\nimport numpy as np\\n\\ndists = np.ones((n + 1, n + 1)) * float(\"inf\")\\nfor _ in range(m):\\n a, b, c = list(map(int, input().split()))\\n dists[a, b] = dists[b, a] = c\\nfor i in range(1, n + 1):\\n dists[i, i] = 0\\nfrom itertools import product, permutations\\n\\nfor i, j in product(list(range(1, 1 + n)), repeat=2):\\n dists[j] = np.minimum(dists[j], dists[i] + dists[j, i])\\nans = float(\"inf\")\\nfor path in permutations(rs):\\n val = sum(dists[i, j] for i, j in zip(path, path[1:]))\\n val = int(val)\\n if val < ans:\\n ans = val\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m, r = list(map(int, input().split()))\\nrs = list(map(int, input().split()))\\n# construct map\\nimport numpy as np\\n\\ndists = np.ones((n + 1, n + 1)) * float(\"inf\")\\nfor _ in range(m):\\n a, b, c = list(map(int, input().split()))\\n dists[a, b] = dists[b, a] = c\\nfor i in range(1, n + 1):\\n dists[i, i] = 0\\nfrom itertools import permutations\\n\\nfor i in range(1, 1 + n):\\n dists = np.minimum(dists, dists[i : i + 1] + dists[:, i : i + 1])\\nans = float(\"inf\")\\nfor path in permutations(rs):\\n val = sum(dists[i, j] for i, j in zip(path, path[1:]))\\n val = int(val)\\n if val < ans:\\n ans = val\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-from itertools import product, permutations',\n", + " '+from itertools import permutations',\n", + " '-for i, j in product(list(range(1, 1 + n)), repeat=2):',\n", + " '- dists[j] = np.minimum(dists[j], dists[i] + dists[j, i])',\n", + " '+for i in range(1, 1 + n):',\n", + " '+ dists = np.minimum(dists, dists[i : i + 1] + dists[:, i : i + 1])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.845153213,\n", + " 'measured_runtime_v1': 0.7010826969,\n", + " 'runtime_lift': 2.6318624338,\n", + " 'key': ['s433890015', 's895796017']},\n", + " {'user_id': 'u944325914',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's220148525',\n", + " 'submission_id_v1': 's009987907',\n", + " 'cpu_time_v0': 1010,\n", + " 'cpu_time_v1': 521,\n", + " 'memory_v0': 104656,\n", + " 'memory_v1': 50176,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.42,\n", + " 'input': 'import collections\\n\\nn = int(eval(input()))\\n\\na=[eval(input()) for _ in range(n)]\\n\\nanslist=[]\\n\\nb=collections.Counter(a)\\n\\nc=max(list(b.values()))\\n\\nfor i in b:\\n\\n if b[i]==c:\\n\\n anslist.append(i)\\n\\nd=sorted(anslist)\\n\\nfor i in tuple(d):\\n\\n print(i)',\n", + " 'target': 'from collections import Counter\\n\\nn=int(eval(input()))\\n\\na=[]\\n\\nfor i in range(n):\\n\\n a.append(eval(input()))\\n\\nac=Counter(a)\\n\\nacs=sorted(list(ac.items()),key=lambda x:x[1],reverse=1)\\n\\nz=len(acs)\\n\\ni=0\\n\\ntemp=[]\\n\\n\\n\\nwhile i<=z-1 and acs[i][1]==acs[0][1] :\\n\\n temp.append(acs[i][0])\\n\\n i+=1\\n\\ntemp.sort()\\n\\nfor i in temp:\\n\\n print(i)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 240,\n", + " 'code_v1_num_chars': 305,\n", + " 'code_v0_no_empty_lines': 'import collections\\n\\nn = int(eval(input()))\\na = [eval(input()) for _ in range(n)]\\nanslist = []\\nb = collections.Counter(a)\\nc = max(list(b.values()))\\nfor i in b:\\n if b[i] == c:\\n anslist.append(i)\\nd = sorted(anslist)\\nfor i in tuple(d):\\n print(i)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\n\\nn = int(eval(input()))\\na = []\\nfor i in range(n):\\n a.append(eval(input()))\\nac = Counter(a)\\nacs = sorted(list(ac.items()), key=lambda x: x[1], reverse=1)\\nz = len(acs)\\ni = 0\\ntemp = []\\nwhile i <= z - 1 and acs[i][1] == acs[0][1]:\\n temp.append(acs[i][0])\\n i += 1\\ntemp.sort()\\nfor i in temp:\\n print(i)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 29.4117647059,\n", + " 'diff': ['-import collections',\n", + " '+from collections import Counter',\n", + " '-a = [eval(input()) for _ in range(n)]',\n", + " '-anslist = []',\n", + " '-b = collections.Counter(a)',\n", + " '-c = max(list(b.values()))',\n", + " '-for i in b:',\n", + " '- if b[i] == c:',\n", + " '- anslist.append(i)',\n", + " '-d = sorted(anslist)',\n", + " '-for i in tuple(d):',\n", + " '+a = []',\n", + " '+for i in range(n):',\n", + " '+ a.append(eval(input()))',\n", + " '+ac = Counter(a)',\n", + " '+acs = sorted(list(ac.items()), key=lambda x: x[1], reverse=1)',\n", + " '+z = len(acs)',\n", + " '+i = 0',\n", + " '+temp = []',\n", + " '+while i <= z - 1 and acs[i][1] == acs[0][1]:',\n", + " '+ temp.append(acs[i][0])',\n", + " '+ i += 1',\n", + " '+temp.sort()',\n", + " '+for i in temp:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3929853504,\n", + " 'measured_runtime_v1': 0.3037585902,\n", + " 'runtime_lift': 1.2937423435,\n", + " 'key': ['s220148525', 's009987907']},\n", + " {'user_id': 'u691018832',\n", + " 'problem_id': 'p03945',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's808413359',\n", + " 'submission_id_v1': 's766599872',\n", + " 'cpu_time_v0': 84,\n", + " 'cpu_time_v1': 46,\n", + " 'memory_v0': 3188,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 45.24,\n", + " 'input': 's = eval(input())\\n\\nlen_s = len(s)\\n\\ncnt = [0, 0]\\n\\nfor i in range(1, len(s)):\\n\\n memo_0 = s[i - 1]\\n\\n memo_1 = s[len_s - i]\\n\\n if s[i] != memo_0:\\n\\n cnt[0] += 1\\n\\n if s[len_s - i - 1] != memo_1:\\n\\n cnt[1] += 1\\n\\nprint((min(cnt)))\\n',\n", + " 'target': 's = eval(input())\\n\\nlen_s = len(s)\\n\\ncnt = 0\\n\\nfor i in range(1, len(s)):\\n\\n memo_0 = s[i - 1]\\n\\n if s[i] != memo_0:\\n\\n cnt += 1\\n\\nprint(cnt)\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 239,\n", + " 'code_v1_num_chars': 142,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\nlen_s = len(s)\\ncnt = [0, 0]\\nfor i in range(1, len(s)):\\n memo_0 = s[i - 1]\\n memo_1 = s[len_s - i]\\n if s[i] != memo_0:\\n cnt[0] += 1\\n if s[len_s - i - 1] != memo_1:\\n cnt[1] += 1\\nprint((min(cnt)))\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nlen_s = len(s)\\ncnt = 0\\nfor i in range(1, len(s)):\\n memo_0 = s[i - 1]\\n if s[i] != memo_0:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.2727272727,\n", + " 'diff': ['-cnt = [0, 0]',\n", + " '+cnt = 0',\n", + " '- memo_1 = s[len_s - i]',\n", + " '- cnt[0] += 1',\n", + " '- if s[len_s - i - 1] != memo_1:',\n", + " '- cnt[1] += 1',\n", + " '-print((min(cnt)))',\n", + " '+ cnt += 1',\n", + " '+print(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3379861441,\n", + " 'measured_runtime_v1': 0.264947257,\n", + " 'runtime_lift': 1.2756733088,\n", + " 'key': ['s808413359', 's766599872']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p02624',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's575776489',\n", + " 'submission_id_v1': 's814917437',\n", + " 'cpu_time_v0': 1604,\n", + " 'cpu_time_v1': 222,\n", + " 'memory_v0': 105124,\n", + " 'memory_v1': 26992,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.16,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\ndef main(N):\\n\\n div = np.zeros(N+1, np.int64)\\n\\n for n in range(1, N+1):\\n\\n for m in range(n, N+1, n):\\n\\n div[m] += m\\n\\n return div.sum()\\n\\n\\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n import numba\\n\\n from numba.pycc import CC\\n\\n i8 = numba.int64\\n\\n cc = CC('my_module')\\n\\n\\n\\n def cc_export(f, signature):\\n\\n cc.export(f.__name__, signature)(f)\\n\\n return numba.njit(f)\\n\\n\\n\\n main = cc_export(main, (i8, ))\\n\\n cc.compile()\\n\\n\\n\\nfrom my_module import main\\n\\n\\n\\nN = int(read())\\n\\nprint((main(N)))\\n\",\n", + " 'target': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\ndef main(N):\\n\\n x = 0\\n\\n for a in range(1, N+1):\\n\\n for b in range(1, N//a+1):\\n\\n x += a*b\\n\\n return x\\n\\n\\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n import numba\\n\\n from numba.pycc import CC\\n\\n i8 = numba.int64\\n\\n cc = CC('my_module')\\n\\n\\n\\n def cc_export(f, signature):\\n\\n cc.export(f.__name__, signature)(f)\\n\\n return numba.njit(f)\\n\\n\\n\\n main = cc_export(main, (i8, ))\\n\\n cc.compile()\\n\\n\\n\\nfrom my_module import main\\n\\n\\n\\nN = int(read())\\n\\nprint((main(N)))\\n\",\n", + " 'code_v0_loc': 31,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 665,\n", + " 'code_v1_num_chars': 636,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\ndef main(N):\\n div = np.zeros(N + 1, np.int64)\\n for n in range(1, N + 1):\\n for m in range(n, N + 1, n):\\n div[m] += m\\n return div.sum()\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n import numba\\n from numba.pycc import CC\\n\\n i8 = numba.int64\\n cc = CC(\"my_module\")\\n\\n def cc_export(f, signature):\\n cc.export(f.__name__, signature)(f)\\n return numba.njit(f)\\n\\n main = cc_export(main, (i8,))\\n cc.compile()\\nfrom my_module import main\\n\\nN = int(read())\\nprint((main(N)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\ndef main(N):\\n x = 0\\n for a in range(1, N + 1):\\n for b in range(1, N // a + 1):\\n x += a * b\\n return x\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n import numba\\n from numba.pycc import CC\\n\\n i8 = numba.int64\\n cc = CC(\"my_module\")\\n\\n def cc_export(f, signature):\\n cc.export(f.__name__, signature)(f)\\n return numba.njit(f)\\n\\n main = cc_export(main, (i8,))\\n cc.compile()\\nfrom my_module import main\\n\\nN = int(read())\\nprint((main(N)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- div = np.zeros(N + 1, np.int64)',\n", + " '- for n in range(1, N + 1):',\n", + " '- for m in range(n, N + 1, n):',\n", + " '- div[m] += m',\n", + " '- return div.sum()',\n", + " '+ x = 0',\n", + " '+ for a in range(1, N + 1):',\n", + " '+ for b in range(1, N // a + 1):',\n", + " '+ x += a * b',\n", + " '+ return x'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5076009564,\n", + " 'measured_runtime_v1': 0.2714631007,\n", + " 'runtime_lift': 5.5536128212,\n", + " 'key': ['s575776489', 's814917437']},\n", + " {'user_id': 'u503228842',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's264986040',\n", + " 'submission_id_v1': 's936814116',\n", + " 'cpu_time_v0': 455,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 9180,\n", + " 'memory_v1': 9188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 93.63,\n", + " 'input': 'n = int(eval(input()))\\n\\nm = 10**9 + 7\\n\\n# ans = [0] * (n + 1)\\n\\nans = [0] * 2200\\n\\nans[0] = 1\\n\\n# ans[3] = 1\\n\\n# ans[4] = 1\\n\\n# ans[5] = 1\\n\\nfor i in range(3, n + 1):\\n\\n for j in range(i - 2):\\n\\n ans[i] += ans[j]\\n\\n ans[i] %= m\\n\\nprint((ans[n]))\\n\\n# print(ans[:10])\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\nm = 10**9 + 7\\n\\n# ans = [0] * (n + 1)\\n\\nans = [0] * 2200\\n\\nans[0] = 1\\n\\n# ans[3] = 1\\n\\n# ans[4] = 1\\n\\n# ans[5] = 1\\n\\nfor i in range(3, n + 1):\\n\\n ans[i] = ans[i - 1] + ans[i - 3]\\n\\n ans[i] %= m\\n\\n # for j in range(i - 2):\\n\\n # ans[i] += ans[j]\\n\\n # ans[i] %= m\\n\\nprint((ans[n]))\\n\\n# print(ans[:10])\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 263,\n", + " 'code_v1_num_chars': 324,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nm = 10**9 + 7\\n# ans = [0] * (n + 1)\\nans = [0] * 2200\\nans[0] = 1\\n# ans[3] = 1\\n# ans[4] = 1\\n# ans[5] = 1\\nfor i in range(3, n + 1):\\n for j in range(i - 2):\\n ans[i] += ans[j]\\n ans[i] %= m\\nprint((ans[n]))\\n# print(ans[:10])\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nm = 10**9 + 7\\n# ans = [0] * (n + 1)\\nans = [0] * 2200\\nans[0] = 1\\n# ans[3] = 1\\n# ans[4] = 1\\n# ans[5] = 1\\nfor i in range(3, n + 1):\\n ans[i] = ans[i - 1] + ans[i - 3]\\n ans[i] %= m\\n # for j in range(i - 2):\\n # ans[i] += ans[j]\\n # ans[i] %= m\\nprint((ans[n]))\\n# print(ans[:10])\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['- for j in range(i - 2):',\n", + " '- ans[i] += ans[j]',\n", + " '- ans[i] %= m',\n", + " '+ ans[i] = ans[i - 1] + ans[i - 3]',\n", + " '+ ans[i] %= m',\n", + " '+ # for j in range(i - 2):',\n", + " '+ # ans[i] += ans[j]',\n", + " '+ # ans[i] %= m'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6218082716,\n", + " 'measured_runtime_v1': 0.188438025,\n", + " 'runtime_lift': 3.2998025299,\n", + " 'key': ['s264986040', 's936814116']},\n", + " {'user_id': 'u197300773',\n", + " 'problem_id': 'p02901',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's172477662',\n", + " 'submission_id_v1': 's096488733',\n", + " 'cpu_time_v0': 1463,\n", + " 'cpu_time_v1': 1316,\n", + " 'memory_v0': 36468,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.05,\n", + " 'input': \"def main():\\n\\n import math\\n\\n N,M=list(map(int,input().split()))\\n\\n a=[]\\n\\n for i in range(M):\\n\\n tmp=list(map(int,input().split()))\\n\\n tmpc=list(map(int,input().split()))\\n\\n c=0\\n\\n for j in range(len(tmpc)):\\n\\n c+=2**(tmpc[j]-1)\\n\\n tmp[1]=c\\n\\n a+=[tmp]\\n\\n\\n\\n\\n\\n dp=[[10**10 for j in range(2**N)] for i in range(M)]\\n\\n dp[0][0]=0\\n\\n dp[0][a[0][1]]=a[0][0]\\n\\n\\n\\n\\n\\n for i in range(1,M):\\n\\n dp[i]=dp[i-1]\\n\\n for j in range(2**N):\\n\\n z,p=a[i][0],a[i][1]\\n\\n q=j|p\\n\\n x=dp[i-1][j]+z\\n\\n if dp[i][q]>x: dp[i][q]=x\\n\\n\\n\\n ans=dp[M-1][2**N-1]\\n\\n print((ans if ans<10**10 else -1))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': 'n,m=list(map(int,input().split()))\\n\\nL=2**n\\n\\ncost=[0]+[10**8 for i in range(L-1)]\\n\\n\\n\\nfor i in range(m):\\n\\n a,b=list(map(int,input().split()))\\n\\n c=sum([2**(int(i)-1) for i in input().split()])\\n\\n for j in range(L):\\n\\n q=j|c\\n\\n x=cost[j]+a\\n\\n if cost[q]>x:\\n\\n cost[q]=x\\n\\nprint((cost[L-1] if cost[L-1]<10**8 else -1))',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 718,\n", + " 'code_v1_num_chars': 334,\n", + " 'code_v0_no_empty_lines': 'def main():\\n import math\\n\\n N, M = list(map(int, input().split()))\\n a = []\\n for i in range(M):\\n tmp = list(map(int, input().split()))\\n tmpc = list(map(int, input().split()))\\n c = 0\\n for j in range(len(tmpc)):\\n c += 2 ** (tmpc[j] - 1)\\n tmp[1] = c\\n a += [tmp]\\n dp = [[10**10 for j in range(2**N)] for i in range(M)]\\n dp[0][0] = 0\\n dp[0][a[0][1]] = a[0][0]\\n for i in range(1, M):\\n dp[i] = dp[i - 1]\\n for j in range(2**N):\\n z, p = a[i][0], a[i][1]\\n q = j | p\\n x = dp[i - 1][j] + z\\n if dp[i][q] > x:\\n dp[i][q] = x\\n ans = dp[M - 1][2**N - 1]\\n print((ans if ans < 10**10 else -1))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nL = 2**n\\ncost = [0] + [10**8 for i in range(L - 1)]\\nfor i in range(m):\\n a, b = list(map(int, input().split()))\\n c = sum([2 ** (int(i) - 1) for i in input().split()])\\n for j in range(L):\\n q = j | c\\n x = cost[j] + a\\n if cost[q] > x:\\n cost[q] = x\\nprint((cost[L - 1] if cost[L - 1] < 10**8 else -1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 59.375,\n", + " 'diff': ['-def main():',\n", + " '- import math',\n", + " '-',\n", + " '- N, M = list(map(int, input().split()))',\n", + " '- a = []',\n", + " '- for i in range(M):',\n", + " '- tmp = list(map(int, input().split()))',\n", + " '- tmpc = list(map(int, input().split()))',\n", + " '- c = 0',\n", + " '- for j in range(len(tmpc)):',\n", + " '- c += 2 ** (tmpc[j] - 1)',\n", + " '- tmp[1] = c',\n", + " '- a += [tmp]',\n", + " '- dp = [[10**10 for j in range(2**N)] for i in range(M)]',\n", + " '- dp[0][0] = 0',\n", + " '- dp[0][a[0][1]] = a[0][0]',\n", + " '- for i in range(1, M):',\n", + " '- dp[i] = dp[i - 1]',\n", + " '- for j in range(2**N):',\n", + " '- z, p = a[i][0], a[i][1]',\n", + " '- q = j | p',\n", + " '- x = dp[i - 1][j] + z',\n", + " '- if dp[i][q] > x:',\n", + " '- dp[i][q] = x',\n", + " '- ans = dp[M - 1][2**N - 1]',\n", + " '- print((ans if ans < 10**10 else -1))',\n", + " '-',\n", + " '-',\n", + " '-if __name__ == \"__main__\":',\n", + " '- main()',\n", + " '+n, m = list(map(int, input().split()))',\n", + " '+L = 2**n',\n", + " '+cost = [0] + [10**8 for i in range(L - 1)]',\n", + " '+for i in range(m):',\n", + " '+ a, b = list(map(int, input().split()))',\n", + " '+ c = sum([2 ** (int(i) - 1) for i in input().split()])',\n", + " '+ for j in range(L):',\n", + " '+ q = j | c',\n", + " '+ x = cost[j] + a',\n", + " '+ if cost[q] > x:',\n", + " '+ cost[q] = x',\n", + " '+print((cost[L - 1] if cost[L - 1] < 10**8 else -1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3366471643,\n", + " 'measured_runtime_v1': 0.2183672116,\n", + " 'runtime_lift': 1.5416561941,\n", + " 'key': ['s172477662', 's096488733']},\n", + " {'user_id': 'u375616706',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's865425208',\n", + " 'submission_id_v1': 's683198450',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.0,\n", + " 'input': '\\n\\nclass UnionFind:\\n\\n def __init__(self, size):\\n\\n self.table = [i for i in range(size)]\\n\\n\\n\\n def find(self, x):\\n\\n return self.table[x]\\n\\n\\n\\n def union(self, x, y):\\n\\n x1 = self.find(x)\\n\\n y1 = self.find(y)\\n\\n\\n\\n if x1 == y1:\\n\\n return False\\n\\n\\n\\n for i in range(len(self.table)):\\n\\n if self.table[i] == y1:\\n\\n self.table[i] = x1\\n\\n return True\\n\\n\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\n\\n\\nedges = []\\n\\nfor _ in range(M):\\n\\n a, b = list(map(int, input().split()))\\n\\n edges.append([a-1, b-1])\\n\\n\\n\\nmat = [[0]*N for _ in range(N)]\\n\\nfor s, g in edges:\\n\\n mat[s][g] = 1\\n\\n mat[g][s] = 1\\n\\n\\n\\nans = 0\\n\\n\\n\\nfor i in range(M):\\n\\n uni = UnionFind(N)\\n\\n\\n\\n for j in range(M):\\n\\n if i != j:\\n\\n uni.union(edges[j][0], edges[j][1])\\n\\n\\n\\n if not all(uni.find(0) == uni.find(x) for x in range(N)):\\n\\n ans += 1\\n\\nprint(ans)\\n',\n", + " 'target': '# python template for atcoder1\\n\\nimport sys\\n\\nsys.setrecursionlimit(10**9)\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\\n\\nclass UnionFind:\\n\\n def __init__(self, size):\\n\\n \"\"\"\\n\\n size:頂点の数\\n\\n \"\"\"\\n\\n self.parent = [i for i in range(size)]\\n\\n self.rank = [0 for _ in range(size)]\\n\\n\\n\\n def find(self, x):\\n\\n \"\"\"\\n\\n xのrootを返す\\n\\n \"\"\"\\n\\n if self.parent[x] == x:\\n\\n return x\\n\\n else:\\n\\n return self.find(self.parent[x])\\n\\n\\n\\n def union(self, x, y):\\n\\n \"\"\"\\n\\n x,yを同じグループとしてまとめる\\n\\n \"\"\"\\n\\n x = self.find(x)\\n\\n y = self.find(y)\\n\\n if x == y:\\n\\n return\\n\\n\\n\\n if self.rank[x] < self.rank[y]:\\n\\n self.parent[x] = y\\n\\n else:\\n\\n self.parent[y] = x\\n\\n if self.rank[x] == self.rank[y]:\\n\\n self.rank[x] += 1\\n\\n\\n\\n def same(self, x, y):\\n\\n \"\"\"\\n\\n xとyが同じグループならTrue\\n\\n \"\"\"\\n\\n return self.find(x) == self.find(y)\\n\\n\\n\\n def component(self):\\n\\n \"\"\"\\n\\n 各連結成分のrootの集合を返す\\n\\n len()をとれば連結成分の数が求められる\\n\\n return-> set()\\n\\n \"\"\"\\n\\n comp = set()\\n\\n for i in self.parent:\\n\\n p = self.find(i)\\n\\n comp.add(p)\\n\\n return comp\\n\\n\\n\\n def __str__(self):\\n\\n \"\"\"\\n\\n for debug\\n\\n クラスのlistの情報を出力\\n\\n \"\"\"\\n\\n ret = \"parents\\\\n\"\\n\\n ret += \" \".join(map(str, self.parent))\\n\\n ret += \\'\\\\n\\'\\n\\n ret += \" \".join(map(str, self.rank))\\n\\n return ret\\n\\n\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\nedges = []\\n\\n\\n\\nfor _ in range(M):\\n\\n a, b = [int(x)-1 for x in input().split()]\\n\\n edges.append([a, b])\\n\\n\\n\\nans = 0\\n\\nfor e in edges:\\n\\n Un = UnionFind(N)\\n\\n for g in edges:\\n\\n if e == g:\\n\\n continue\\n\\n else:\\n\\n Un.union(g[0], g[1])\\n\\n if not Un.same(e[0], e[1]):\\n\\n ans += 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 45,\n", + " 'code_v1_loc': 87,\n", + " 'code_v0_num_chars': 905,\n", + " 'code_v1_num_chars': 1882,\n", + " 'code_v0_no_empty_lines': 'class UnionFind:\\n def __init__(self, size):\\n self.table = [i for i in range(size)]\\n\\n def find(self, x):\\n return self.table[x]\\n\\n def union(self, x, y):\\n x1 = self.find(x)\\n y1 = self.find(y)\\n if x1 == y1:\\n return False\\n for i in range(len(self.table)):\\n if self.table[i] == y1:\\n self.table[i] = x1\\n return True\\n\\n\\nN, M = list(map(int, input().split()))\\nedges = []\\nfor _ in range(M):\\n a, b = list(map(int, input().split()))\\n edges.append([a - 1, b - 1])\\nmat = [[0] * N for _ in range(N)]\\nfor s, g in edges:\\n mat[s][g] = 1\\n mat[g][s] = 1\\nans = 0\\nfor i in range(M):\\n uni = UnionFind(N)\\n for j in range(M):\\n if i != j:\\n uni.union(edges[j][0], edges[j][1])\\n if not all(uni.find(0) == uni.find(x) for x in range(N)):\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# python template for atcoder1\\nimport sys\\n\\nsys.setrecursionlimit(10**9)\\ninput = sys.stdin.readline\\n\\n\\nclass UnionFind:\\n def __init__(self, size):\\n \"\"\"\\n size:頂点の数\\n \"\"\"\\n self.parent = [i for i in range(size)]\\n self.rank = [0 for _ in range(size)]\\n\\n def find(self, x):\\n \"\"\"\\n xのrootを返す\\n \"\"\"\\n if self.parent[x] == x:\\n return x\\n else:\\n return self.find(self.parent[x])\\n\\n def union(self, x, y):\\n \"\"\"\\n x,yを同じグループとしてまとめる\\n \"\"\"\\n x = self.find(x)\\n y = self.find(y)\\n if x == y:\\n return\\n if self.rank[x] < self.rank[y]:\\n self.parent[x] = y\\n else:\\n self.parent[y] = x\\n if self.rank[x] == self.rank[y]:\\n self.rank[x] += 1\\n\\n def same(self, x, y):\\n \"\"\"\\n xとyが同じグループならTrue\\n \"\"\"\\n return self.find(x) == self.find(y)\\n\\n def component(self):\\n \"\"\"\\n 各連結成分のrootの集合を返す\\n len()をとれば連結成分の数が求められる\\n return-> set()\\n \"\"\"\\n comp = set()\\n for i in self.parent:\\n p = self.find(i)\\n comp.add(p)\\n return comp\\n\\n def __str__(self):\\n \"\"\"\\n for debug\\n クラスのlistの情報を出力\\n \"\"\"\\n ret = \"parents\\\\n\"\\n ret += \" \".join(map(str, self.parent))\\n ret += \"\\\\n\"\\n ret += \" \".join(map(str, self.rank))\\n return ret\\n\\n\\nN, M = list(map(int, input().split()))\\nedges = []\\nfor _ in range(M):\\n a, b = [int(x) - 1 for x in input().split()]\\n edges.append([a, b])\\nans = 0\\nfor e in edges:\\n Un = UnionFind(N)\\n for g in edges:\\n if e == g:\\n continue\\n else:\\n Un.union(g[0], g[1])\\n if not Un.same(e[0], e[1]):\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 48.275862069,\n", + " 'diff': ['+# python template for atcoder1',\n", + " '+import sys',\n", + " '+',\n", + " '+sys.setrecursionlimit(10**9)',\n", + " '+input = sys.stdin.readline',\n", + " '+',\n", + " '+',\n", + " '- self.table = [i for i in range(size)]',\n", + " '+ \"\"\"',\n", + " '+ size:頂点の数',\n", + " '+ \"\"\"',\n", + " '+ self.parent = [i for i in range(size)]',\n", + " '+ self.rank = [0 for _ in range(size)]',\n", + " '- return self.table[x]',\n", + " '+ \"\"\"',\n", + " '+ xのrootを返す',\n", + " '+ \"\"\"',\n", + " '+ if self.parent[x] == x:',\n", + " '+ return x',\n", + " '+ else:',\n", + " '+ return self.find(self.parent[x])',\n", + " '- x1 = self.find(x)',\n", + " '- y1 = self.find(y)',\n", + " '- if x1 == y1:',\n", + " '- return False',\n", + " '- for i in range(len(self.table)):',\n", + " '- if self.table[i] == y1:',\n", + " '- self.table[i] = x1',\n", + " '- return True',\n", + " '+ \"\"\"',\n", + " '+ x,yを同じグループとしてまとめる',\n", + " '+ \"\"\"',\n", + " '+ x = self.find(x)',\n", + " '+ y = self.find(y)',\n", + " '+ if x == y:',\n", + " '+ return',\n", + " '+ if self.rank[x] < self.rank[y]:',\n", + " '+ self.parent[x] = y',\n", + " '+ else:',\n", + " '+ self.parent[y] = x',\n", + " '+ if self.rank[x] == self.rank[y]:',\n", + " '+ self.rank[x] += 1',\n", + " '+',\n", + " '+ def same(self, x, y):',\n", + " '+ \"\"\"',\n", + " '+ xとyが同じグループならTrue',\n", + " '+ \"\"\"',\n", + " '+ return self.find(x) == self.find(y)',\n", + " '+',\n", + " '+ def component(self):',\n", + " '+ \"\"\"',\n", + " '+ 各連結成分のrootの集合を返す',\n", + " '+ len()をとれば連結成分の数が求められる',\n", + " '+ return-> set()',\n", + " '+ \"\"\"',\n", + " '+ comp = set()',\n", + " '+ for i in self.parent:',\n", + " '+ p = self.find(i)',\n", + " '+ comp.add(p)',\n", + " '+ return comp',\n", + " '+',\n", + " '+ def __str__(self):',\n", + " '+ \"\"\"',\n", + " '+ for debug',\n", + " '+ クラスのlistの情報を出力',\n", + " '+ \"\"\"',\n", + " '+ ret = \"parents\\\\n\"',\n", + " '+ ret += \" \".join(map(str, self.parent))',\n", + " '+ ret += \"\\\\n\"',\n", + " '+ ret += \" \".join(map(str, self.rank))',\n", + " '+ return ret',\n", + " '- a, b = list(map(int, input().split()))',\n", + " '- edges.append([a - 1, b - 1])',\n", + " '-mat = [[0] * N for _ in range(N)]',\n", + " '-for s, g in edges:',\n", + " '- mat[s][g] = 1',\n", + " '- mat[g][s] = 1',\n", + " '+ a, b = [int(x) - 1 for x in input().split()]',\n", + " '+ edges.append([a, b])',\n", + " '-for i in range(M):',\n", + " '- uni = UnionFind(N)',\n", + " '- for j in range(M):',\n", + " '- if i != j:',\n", + " '- uni.union(edges[j][0], edges[j][1])',\n", + " '- if not all(uni.find(0) == uni.find(x) for x in range(N)):',\n", + " '+for e in edges:',\n", + " '+ Un = UnionFind(N)',\n", + " '+ for g in edges:',\n", + " '+ if e == g:',\n", + " '+ continue',\n", + " '+ else:',\n", + " '+ Un.union(g[0], g[1])',\n", + " '+ if not Un.same(e[0], e[1]):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3550173998,\n", + " 'measured_runtime_v1': 0.2645738666,\n", + " 'runtime_lift': 1.3418460573,\n", + " 'key': ['s865425208', 's683198450']},\n", + " {'user_id': 'u945359338',\n", + " 'problem_id': 'p02595',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's600709561',\n", + " 'submission_id_v1': 's552125258',\n", + " 'cpu_time_v0': 840,\n", + " 'cpu_time_v1': 755,\n", + " 'memory_v0': 57424,\n", + " 'memory_v1': 9988,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.12,\n", + " 'input': 'from decimal import *\\n\\ngetcontext().prec = 14\\n\\n\\n\\nN, D = list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef distance(x1, x2, y1, y2):\\n\\n dx = x2-x1\\n\\n dy = y2-y1\\n\\n return (dx*dx + dy*dy).sqrt()\\n\\n\\n\\n\\n\\nX = [0] * N\\n\\nY = [0] * N\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n X[i], Y[i] = list(map(Decimal, input().split()))\\n\\n if (distance(0, X[i], 0, Y[i]) <= D):\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'from decimal import *\\n\\ngetcontext().prec = 14 # あんまり大きいと計算遅いかも\\n\\n\\n\\nN, D = list(map(int, input().split()))\\n\\n\\n\\ndef distance(x1, x2, y1, y2):\\n\\n dx = x2-x1\\n\\n dy = y2-y1\\n\\n return (dx*dx + dy*dy).sqrt()\\n\\n\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n X, Y = list(map(Decimal, input().split()))\\n\\n if (distance(0, X, 0, Y) <= D):\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 366,\n", + " 'code_v1_num_chars': 342,\n", + " 'code_v0_no_empty_lines': 'from decimal import *\\n\\ngetcontext().prec = 14\\nN, D = list(map(int, input().split()))\\n\\n\\ndef distance(x1, x2, y1, y2):\\n dx = x2 - x1\\n dy = y2 - y1\\n return (dx * dx + dy * dy).sqrt()\\n\\n\\nX = [0] * N\\nY = [0] * N\\nans = 0\\nfor i in range(N):\\n X[i], Y[i] = list(map(Decimal, input().split()))\\n if distance(0, X[i], 0, Y[i]) <= D:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from decimal import *\\n\\ngetcontext().prec = 14 # あんまり大きいと計算遅いかも\\nN, D = list(map(int, input().split()))\\n\\n\\ndef distance(x1, x2, y1, y2):\\n dx = x2 - x1\\n dy = y2 - y1\\n return (dx * dx + dy * dy).sqrt()\\n\\n\\nans = 0\\nfor i in range(N):\\n X, Y = list(map(Decimal, input().split()))\\n if distance(0, X, 0, Y) <= D:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 19.0476190476,\n", + " 'diff': ['-getcontext().prec = 14',\n", + " '+getcontext().prec = 14 # あんまり大きいと計算遅いかも',\n", + " '-X = [0] * N',\n", + " '-Y = [0] * N',\n", + " '- X[i], Y[i] = list(map(Decimal, input().split()))',\n", + " '- if distance(0, X[i], 0, Y[i]) <= D:',\n", + " '+ X, Y = list(map(Decimal, input().split()))',\n", + " '+ if distance(0, X, 0, Y) <= D:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4031279888,\n", + " 'measured_runtime_v1': 0.2312259483,\n", + " 'runtime_lift': 1.7434374978,\n", + " 'key': ['s600709561', 's552125258']},\n", + " {'user_id': 'u488178971',\n", + " 'problem_id': 'p03000',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's975287095',\n", + " 'submission_id_v1': 's789478825',\n", + " 'cpu_time_v0': 148,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12516,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.51,\n", + " 'input': '#ABC 130 B\\n\\nN,X=list(map(int,input().split()))\\n\\nL= [int(j) for j in input().split()]\\n\\ncnt=0\\n\\nimport numpy as np\\n\\njump = list(np.cumsum(L))\\n\\nfor j in jump:\\n\\n if j <= X:\\n\\n cnt+=1\\n\\n else:\\n\\n break\\n\\nprint((cnt+1))',\n", + " 'target': '#ABC 130 B\\n\\nN,X=list(map(int,input().split()))\\n\\nL= [int(j) for j in input().split()]\\n\\ncnt=0\\n\\nd = 0\\n\\n\\n\\nfor l in L :\\n\\n d+=l\\n\\n if d <= X:\\n\\n cnt+=1\\n\\n else:\\n\\n break\\n\\nprint((cnt+1))',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 220,\n", + " 'code_v1_num_chars': 190,\n", + " 'code_v0_no_empty_lines': '# ABC 130 B\\nN, X = list(map(int, input().split()))\\nL = [int(j) for j in input().split()]\\ncnt = 0\\nimport numpy as np\\n\\njump = list(np.cumsum(L))\\nfor j in jump:\\n if j <= X:\\n cnt += 1\\n else:\\n break\\nprint((cnt + 1))\\n',\n", + " 'code_v1_no_empty_lines': '# ABC 130 B\\nN, X = list(map(int, input().split()))\\nL = [int(j) for j in input().split()]\\ncnt = 0\\nd = 0\\nfor l in L:\\n d += l\\n if d <= X:\\n cnt += 1\\n else:\\n break\\nprint((cnt + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-jump = list(np.cumsum(L))',\n", + " '-for j in jump:',\n", + " '- if j <= X:',\n", + " '+d = 0',\n", + " '+for l in L:',\n", + " '+ d += l',\n", + " '+ if d <= X:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4958784676,\n", + " 'measured_runtime_v1': 0.1985901146,\n", + " 'runtime_lift': 7.5324920912,\n", + " 'key': ['s975287095', 's789478825']},\n", + " {'user_id': 'u912237403',\n", + " 'problem_id': 'p00003',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's588310858',\n", + " 'submission_id_v1': 's978758272',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 4212,\n", + " 'memory_v1': 4212,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': 'for n in range(eval(input())):\\n\\n a,b,c=sorted(map(int,input().split()))\\n\\n s=\"YES\" if a*a+b*b==c*c else \"NO\"\\n\\n print(s)',\n", + " 'target': 'for n in range(eval(input())):\\n\\n a,b,c=sorted(map(int,input().split()))\\n\\n print(\"YES\" if a*a + b*b == c*c else \"NO\")',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 118,\n", + " 'code_v1_num_chars': 115,\n", + " 'code_v0_no_empty_lines': 'for n in range(eval(input())):\\n a, b, c = sorted(map(int, input().split()))\\n s = \"YES\" if a * a + b * b == c * c else \"NO\"\\n print(s)\\n',\n", + " 'code_v1_no_empty_lines': 'for n in range(eval(input())):\\n a, b, c = sorted(map(int, input().split()))\\n print(\"YES\" if a * a + b * b == c * c else \"NO\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['- s = \"YES\" if a * a + b * b == c * c else \"NO\"',\n", + " '- print(s)',\n", + " '+ print(\"YES\" if a * a + b * b == c * c else \"NO\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1218309853,\n", + " 'measured_runtime_v1': 0.0062354748,\n", + " 'runtime_lift': 19.5383653264,\n", + " 'key': ['s588310858', 's978758272']},\n", + " {'user_id': 'u996434204',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's285618885',\n", + " 'submission_id_v1': 's172989285',\n", + " 'cpu_time_v0': 114,\n", + " 'cpu_time_v1': 57,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': 'a,b=list(map(int,input().split()))\\n\\n\\n\\nans=0\\n\\n\\n\\nfor i in range(a,b+1):\\n\\n buf=str(i)\\n\\n #print(buf[0:int(len(buf)/2)],buf[int(len(buf)/2+1):])\\n\\n str1=buf[0:int(len(buf)/2)]\\n\\n str2=buf[int(len(buf)/2+1):]\\n\\n if str1[0]==str2[1] and str1[1]==str2[0]:\\n\\n ans+=1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'a,b=list(map(int,input().split()))\\n\\n\\n\\nans=0\\n\\n\\n\\nfor i in range(a,b+1):\\n\\n buf=str(i)\\n\\n str1=buf[::-1]\\n\\n if buf==str1:\\n\\n ans+=1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 284,\n", + " 'code_v1_num_chars': 149,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().split()))\\nans = 0\\nfor i in range(a, b + 1):\\n buf = str(i)\\n # print(buf[0:int(len(buf)/2)],buf[int(len(buf)/2+1):])\\n str1 = buf[0 : int(len(buf) / 2)]\\n str2 = buf[int(len(buf) / 2 + 1) :]\\n if str1[0] == str2[1] and str1[1] == str2[0]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = list(map(int, input().split()))\\nans = 0\\nfor i in range(a, b + 1):\\n buf = str(i)\\n str1 = buf[::-1]\\n if buf == str1:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['- # print(buf[0:int(len(buf)/2)],buf[int(len(buf)/2+1):])',\n", + " '- str1 = buf[0 : int(len(buf) / 2)]',\n", + " '- str2 = buf[int(len(buf) / 2 + 1) :]',\n", + " '- if str1[0] == str2[1] and str1[1] == str2[0]:',\n", + " '+ str1 = buf[::-1]',\n", + " '+ if buf == str1:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3597218115,\n", + " 'measured_runtime_v1': 0.2724662972,\n", + " 'runtime_lift': 1.3202433295,\n", + " 'key': ['s285618885', 's172989285']},\n", + " {'user_id': 'u077291787',\n", + " 'problem_id': 'p04020',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's648607888',\n", + " 'submission_id_v1': 's112859245',\n", + " 'cpu_time_v0': 58,\n", + " 'cpu_time_v1': 46,\n", + " 'memory_v0': 14252,\n", + " 'memory_v1': 14092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.69,\n", + " 'input': '# AGC003B - Simplified mahjong\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef main():\\n\\n # split in subsequences when 0 appears -> sum up cur // 2\\n\\n N = int(eval(input()))\\n\\n A = list(map(int, [eval(input()) for _ in range(N)])) + [0]\\n\\n ans, cur = 0, 0\\n\\n for i in A:\\n\\n if i:\\n\\n cur += i\\n\\n else:\\n\\n ans += cur // 2\\n\\n cur = 0\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'target': '# AGC003B - Simplified mahjong\\n\\ndef main():\\n\\n # split in subsequences when 0 appears -> sum up cur // 2\\n\\n N, *A = list(map(int, open(0).read().split()))\\n\\n A.append(0)\\n\\n ans, cur = 0, 0\\n\\n for i in A:\\n\\n if i:\\n\\n cur += i\\n\\n else:\\n\\n ans += cur // 2\\n\\n cur = 0\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 429,\n", + " 'code_v1_num_chars': 369,\n", + " 'code_v0_no_empty_lines': '# AGC003B - Simplified mahjong\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n # split in subsequences when 0 appears -> sum up cur // 2\\n N = int(eval(input()))\\n A = list(map(int, [eval(input()) for _ in range(N)])) + [0]\\n ans, cur = 0, 0\\n for i in A:\\n if i:\\n cur += i\\n else:\\n ans += cur // 2\\n cur = 0\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# AGC003B - Simplified mahjong\\ndef main():\\n # split in subsequences when 0 appears -> sum up cur // 2\\n N, *A = list(map(int, open(0).read().split()))\\n A.append(0)\\n ans, cur = 0, 0\\n for i in A:\\n if i:\\n cur += i\\n else:\\n ans += cur // 2\\n cur = 0\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.0,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-input = sys.stdin.readline',\n", + " '-',\n", + " '-',\n", + " '- N = int(eval(input()))',\n", + " '- A = list(map(int, [eval(input()) for _ in range(N)])) + [0]',\n", + " '+ N, *A = list(map(int, open(0).read().split()))',\n", + " '+ A.append(0)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.282343082,\n", + " 'measured_runtime_v1': 0.1984000847,\n", + " 'runtime_lift': 1.4230996042,\n", + " 'key': ['s648607888', 's112859245']},\n", + " {'user_id': 'u490552503',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's709803197',\n", + " 'submission_id_v1': 's765235052',\n", + " 'cpu_time_v0': 161,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12392,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.82,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nA = np.array(A)\\n\\ncount = 0\\n\\nwhile 1:\\n\\n x = 0\\n\\n for i in range(N):\\n\\n if A[i] % 2 == 1:\\n\\n x = 1\\n\\n if x == 1:\\n\\n break\\n\\n else:\\n\\n A = A / 2\\n\\n count+=1\\n\\nprint(count)',\n", + " 'target': \"import math\\n\\nn = eval(input())\\n\\na = list(map(int, input().split()))\\n\\nans = float('inf')\\n\\nfor i in a:\\n\\n ans = min(ans, len(bin(i)) - bin(i).rfind('1') - 1)\\n\\nprint((round(ans)))\",\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 285,\n", + " 'code_v1_num_chars': 170,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nA = np.array(A)\\ncount = 0\\nwhile 1:\\n x = 0\\n for i in range(N):\\n if A[i] % 2 == 1:\\n x = 1\\n if x == 1:\\n break\\n else:\\n A = A / 2\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nn = eval(input())\\na = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in a:\\n ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1)\\nprint((round(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 56.25,\n", + " 'diff': ['-import numpy as np',\n", + " '+import math',\n", + " '-N = int(eval(input()))',\n", + " '-A = list(map(int, input().split()))',\n", + " '-A = np.array(A)',\n", + " '-count = 0',\n", + " '-while 1:',\n", + " '- x = 0',\n", + " '- for i in range(N):',\n", + " '- if A[i] % 2 == 1:',\n", + " '- x = 1',\n", + " '- if x == 1:',\n", + " '- break',\n", + " '- else:',\n", + " '- A = A / 2',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+n = eval(input())',\n", + " '+a = list(map(int, input().split()))',\n", + " '+ans = float(\"inf\")',\n", + " '+for i in a:',\n", + " '+ ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1)',\n", + " '+print((round(ans)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4903787866,\n", + " 'measured_runtime_v1': 0.2328151391,\n", + " 'runtime_lift': 6.4015544373,\n", + " 'key': ['s709803197', 's765235052']},\n", + " {'user_id': 'u282228874',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's600331807',\n", + " 'submission_id_v1': 's809304917',\n", + " 'cpu_time_v0': 241,\n", + " 'cpu_time_v1': 180,\n", + " 'memory_v0': 9592,\n", + " 'memory_v1': 13192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 25.31,\n", + " 'input': 'N,M = list(map(int,input().split()))\\n\\nMOD = 10**9+7\\n\\ndp = [0]*(N+1)\\n\\ndp[0]=1\\n\\nA = [int(eval(input())) for i in range(M)]\\n\\nban = [1]*(N+1)\\n\\nfor a in A:\\n\\n ban[a]=0\\n\\nfor i in range(N):\\n\\n if i-1>=0:\\n\\n dp[i+1]=dp[i]*ban[i]+dp[i-1]*ban[i-1]\\n\\n else:\\n\\n dp[i+1]=dp[i]*ban[i]\\n\\n dp[i+1] %= MOD \\n\\nprint((dp[N]))',\n", + " 'target': 'N,M = list(map(int,input().split()))\\n\\nA = [int(eval(input())) for i in range(M)]\\n\\nMOD = 10**9+7\\n\\nA = set(A)\\n\\ndp = [0]*(N+1)\\n\\ndp[0] = 1\\n\\nfor i in range(1,N+1):\\n\\n if i in A:\\n\\n continue\\n\\n if i == 1:\\n\\n dp[1] = dp[0]\\n\\n else:\\n\\n dp[i] = (dp[i-1]+dp[i-2])%MOD\\n\\nprint((dp[N]))',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 311,\n", + " 'code_v1_num_chars': 283,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\nMOD = 10**9 + 7\\ndp = [0] * (N + 1)\\ndp[0] = 1\\nA = [int(eval(input())) for i in range(M)]\\nban = [1] * (N + 1)\\nfor a in A:\\n ban[a] = 0\\nfor i in range(N):\\n if i - 1 >= 0:\\n dp[i + 1] = dp[i] * ban[i] + dp[i - 1] * ban[i - 1]\\n else:\\n dp[i + 1] = dp[i] * ban[i]\\n dp[i + 1] %= MOD\\nprint((dp[N]))\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nA = [int(eval(input())) for i in range(M)]\\nMOD = 10**9 + 7\\nA = set(A)\\ndp = [0] * (N + 1)\\ndp[0] = 1\\nfor i in range(1, N + 1):\\n if i in A:\\n continue\\n if i == 1:\\n dp[1] = dp[0]\\n else:\\n dp[i] = (dp[i - 1] + dp[i - 2]) % MOD\\nprint((dp[N]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['+A = [int(eval(input())) for i in range(M)]',\n", + " '+A = set(A)',\n", + " '-A = [int(eval(input())) for i in range(M)]',\n", + " '-ban = [1] * (N + 1)',\n", + " '-for a in A:',\n", + " '- ban[a] = 0',\n", + " '-for i in range(N):',\n", + " '- if i - 1 >= 0:',\n", + " '- dp[i + 1] = dp[i] * ban[i] + dp[i - 1] * ban[i - 1]',\n", + " '+for i in range(1, N + 1):',\n", + " '+ if i in A:',\n", + " '+ continue',\n", + " '+ if i == 1:',\n", + " '+ dp[1] = dp[0]',\n", + " '- dp[i + 1] = dp[i] * ban[i]',\n", + " '- dp[i + 1] %= MOD',\n", + " '+ dp[i] = (dp[i - 1] + dp[i - 2]) % MOD'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2076114528,\n", + " 'measured_runtime_v1': 0.0063931749,\n", + " 'runtime_lift': 32.4739204186,\n", + " 'key': ['s600331807', 's809304917']},\n", + " {'user_id': 'u949115942',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's340353046',\n", + " 'submission_id_v1': 's559860999',\n", + " 'cpu_time_v0': 262,\n", + " 'cpu_time_v1': 184,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 29.77,\n", + " 'input': 'n = int(eval(input()))\\n\\n\\n\\nXY = []\\n\\nfor i in range(n):\\n\\n a = int(eval(input()))\\n\\n xy = []\\n\\n for j in range(a):\\n\\n xy.append(list(map(int, input().split())))\\n\\n \\n\\n XY.append(xy)\\n\\n \\n\\ndef check(i, xiyj, HoU):\\n\\n # 矛盾したらFalse 正直者と仮定した証言より 正直&正直者と仮定されている / 不親切&不親切と仮定されている True\\n\\n if ((i >> xiyj) & 1) ^ HoU:\\n\\n return False\\n\\n\\n\\n return True\\n\\n \\n\\nmax_honest = 0\\n\\nfor i in range(2 ** len(XY)):\\n\\n count = 0\\n\\n is_contradiction = True\\n\\n for j in range(len(XY)):\\n\\n # 正直者と仮定したときだけ採用\\n\\n if not ((i >> j) & 1): continue\\n\\n for k in range(len(XY[j])):\\n\\n xiyj = XY[j][k][0] - 1\\n\\n HoU = XY[j][k][1]\\n\\n \\n\\n if not check(i, xiyj, HoU):\\n\\n is_contradiction = False\\n\\n break\\n\\n \\n\\n if not is_contradiction:\\n\\n break\\n\\n\\n\\n if is_contradiction:\\n\\n for j in range(len(XY)):\\n\\n if ((i >> j) & 1): count+=1 \\n\\n \\n\\n if count > max_honest:\\n\\n max_honest =count\\n\\n \\n\\nprint(max_honest)',\n", + " 'target': 'n = int(eval(input()))\\n\\n\\n\\nXY = []\\n\\nfor i in range(n):\\n\\n a = int(eval(input()))\\n\\n xy = []\\n\\n for j in range(a):\\n\\n xy.append(list(map(int, input().split())))\\n\\n \\n\\n XY.append(xy)\\n\\n\\n\\n\"\"\"\\n\\n 矛盾したらFalse\\n\\n 矛盾しなければTrue\\n\\n 正直者と仮定した者の証言\\n\\n 正直&正直者と仮定されている\\n\\n 不親切&不親切と仮定されている\\n\\n\"\"\"\\n\\ndef check(i, xiyj, HoU):\\n\\n # XOR\\n\\n if HoU ^ ((i >> xiyj) & 1):\\n\\n return False\\n\\n\\n\\n return True\\n\\n\\n\\nmax_honest = 0\\n\\nfor i in range(2 ** len(XY)):\\n\\n count = 0\\n\\n is_contradiction = True\\n\\n for j in range(len(XY)):\\n\\n # 正直者と仮定したときだけ採用\\n\\n if not ((i >> j) & 1): continue\\n\\n count+=1\\n\\n for k in range(len(XY[j])):\\n\\n xiyj = XY[j][k][0] - 1\\n\\n HoU = XY[j][k][1]\\n\\n \\n\\n if not check(i, xiyj, HoU):\\n\\n is_contradiction = False\\n\\n break # TLE対策\\n\\n \\n\\n if not is_contradiction:\\n\\n break # TLE対策\\n\\n\\n\\n # 矛盾がなく、正直者の数が更新できれば更新\\n\\n if is_contradiction and (count > max_honest):\\n\\n max_honest =count\\n\\n \\n\\nprint(max_honest)',\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 49,\n", + " 'code_v0_num_chars': 1065,\n", + " 'code_v1_num_chars': 1066,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nXY = []\\nfor i in range(n):\\n a = int(eval(input()))\\n xy = []\\n for j in range(a):\\n xy.append(list(map(int, input().split())))\\n XY.append(xy)\\n\\n\\ndef check(i, xiyj, HoU):\\n # 矛盾したらFalse 正直者と仮定した証言より 正直&正直者と仮定されている / 不親切&不親切と仮定されている True\\n if ((i >> xiyj) & 1) ^ HoU:\\n return False\\n return True\\n\\n\\nmax_honest = 0\\nfor i in range(2 ** len(XY)):\\n count = 0\\n is_contradiction = True\\n for j in range(len(XY)):\\n # 正直者と仮定したときだけ採用\\n if not ((i >> j) & 1):\\n continue\\n for k in range(len(XY[j])):\\n xiyj = XY[j][k][0] - 1\\n HoU = XY[j][k][1]\\n if not check(i, xiyj, HoU):\\n is_contradiction = False\\n break\\n if not is_contradiction:\\n break\\n if is_contradiction:\\n for j in range(len(XY)):\\n if (i >> j) & 1:\\n count += 1\\n if count > max_honest:\\n max_honest = count\\nprint(max_honest)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nXY = []\\nfor i in range(n):\\n a = int(eval(input()))\\n xy = []\\n for j in range(a):\\n xy.append(list(map(int, input().split())))\\n XY.append(xy)\\n\"\"\"\\n 矛盾したらFalse\\n 矛盾しなければTrue\\n 正直者と仮定した者の証言\\n 正直&正直者と仮定されている\\n 不親切&不親切と仮定されている\\n\"\"\"\\n\\n\\ndef check(i, xiyj, HoU):\\n # XOR\\n if HoU ^ ((i >> xiyj) & 1):\\n return False\\n return True\\n\\n\\nmax_honest = 0\\nfor i in range(2 ** len(XY)):\\n count = 0\\n is_contradiction = True\\n for j in range(len(XY)):\\n # 正直者と仮定したときだけ採用\\n if not ((i >> j) & 1):\\n continue\\n count += 1\\n for k in range(len(XY[j])):\\n xiyj = XY[j][k][0] - 1\\n HoU = XY[j][k][1]\\n if not check(i, xiyj, HoU):\\n is_contradiction = False\\n break # TLE対策\\n if not is_contradiction:\\n break # TLE対策\\n # 矛盾がなく、正直者の数が更新できれば更新\\n if is_contradiction and (count > max_honest):\\n max_honest = count\\nprint(max_honest)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.2040816327,\n", + " 'diff': ['+\"\"\"',\n", + " '+ 矛盾したらFalse',\n", + " '+ 矛盾しなければTrue',\n", + " '+ 正直者と仮定した者の証言',\n", + " '+ 正直&正直者と仮定されている',\n", + " '+ 不親切&不親切と仮定されている',\n", + " '+\"\"\"',\n", + " '- # 矛盾したらFalse 正直者と仮定した証言より 正直&正直者と仮定されている / 不親切&不親切と仮定されている True',\n", + " '- if ((i >> xiyj) & 1) ^ HoU:',\n", + " '+ # XOR',\n", + " '+ if HoU ^ ((i >> xiyj) & 1):',\n", + " '+ count += 1',\n", + " '- break',\n", + " '+ break # TLE対策',\n", + " '- break',\n", + " '- if is_contradiction:',\n", + " '- for j in range(len(XY)):',\n", + " '- if (i >> j) & 1:',\n", + " '- count += 1',\n", + " '- if count > max_honest:',\n", + " '- max_honest = count',\n", + " '+ break # TLE対策',\n", + " '+ # 矛盾がなく、正直者の数が更新できれば更新',\n", + " '+ if is_contradiction and (count > max_honest):',\n", + " '+ max_honest = count'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.357986707,\n", + " 'measured_runtime_v1': 0.2736512365,\n", + " 'runtime_lift': 1.3081859651,\n", + " 'key': ['s340353046', 's559860999']},\n", + " {'user_id': 'u815878613',\n", + " 'problem_id': 'p03000',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's551428668',\n", + " 'submission_id_v1': 's698553150',\n", + " 'cpu_time_v0': 156,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12396,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.1,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\nN, X = list(map(int, input().split()))\\n\\n\\n\\nL = np.array(list(map(int, input().split())))\\n\\n\\n\\nx = np.zeros(N+1)\\n\\n\\n\\nfor n in range(1,N+1):\\n\\n x[n] = x[n-1] + L[n-1]\\n\\n if x[n] > X:\\n\\n print(n)\\n\\n sys.exit()\\n\\n\\n\\nprint((N+1))\\n\\n\\n',\n", + " 'target': 'N, X = list(map(int, input().split()))\\n\\nL = list(map(int, input().split()))\\n\\n\\n\\ncnt = 1\\n\\nsum_L = 0\\n\\nfor l in L:\\n\\n sum_L += l\\n\\n if sum_L <= X:\\n\\n cnt += 1\\n\\n else:\\n\\n break\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 270,\n", + " 'code_v1_num_chars': 199,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nN, X = list(map(int, input().split()))\\nL = np.array(list(map(int, input().split())))\\nx = np.zeros(N + 1)\\nfor n in range(1, N + 1):\\n x[n] = x[n - 1] + L[n - 1]\\n if x[n] > X:\\n print(n)\\n sys.exit()\\nprint((N + 1))\\n',\n", + " 'code_v1_no_empty_lines': 'N, X = list(map(int, input().split()))\\nL = list(map(int, input().split()))\\ncnt = 1\\nsum_L = 0\\nfor l in L:\\n sum_L += l\\n if sum_L <= X:\\n cnt += 1\\n else:\\n break\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.5294117647,\n", + " 'diff': ['-import sys',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-L = np.array(list(map(int, input().split())))',\n", + " '-x = np.zeros(N + 1)',\n", + " '-for n in range(1, N + 1):',\n", + " '- x[n] = x[n - 1] + L[n - 1]',\n", + " '- if x[n] > X:',\n", + " '- print(n)',\n", + " '- sys.exit()',\n", + " '-print((N + 1))',\n", + " '+L = list(map(int, input().split()))',\n", + " '+cnt = 1',\n", + " '+sum_L = 0',\n", + " '+for l in L:',\n", + " '+ sum_L += l',\n", + " '+ if sum_L <= X:',\n", + " '+ cnt += 1',\n", + " '+ else:',\n", + " '+ break',\n", + " '+print(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.9238229019,\n", + " 'measured_runtime_v1': 0.1570141087,\n", + " 'runtime_lift': 5.883693572,\n", + " 'key': ['s551428668', 's698553150']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's242343005',\n", + " 'submission_id_v1': 's569938093',\n", + " 'cpu_time_v0': 72,\n", + " 'cpu_time_v1': 23,\n", + " 'memory_v0': 11380,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 68.06,\n", + " 'input': 'class Calc:\\n\\n def __init__(self, max_value, mod):\\n\\n \"\"\"combination(max_value, all)\"\"\"\\n\\n fact = [-1] * (max_value + 1)\\n\\n fact[0] = 1\\n\\n fact[1] = 1\\n\\n for x in range(2, max_value + 1):\\n\\n fact[x] = x * fact[x - 1] % mod\\n\\n\\n\\n invs = [1] * (max_value + 1)\\n\\n invs[max_value] = pow(fact[max_value], mod - 2, mod)\\n\\n for x in range(max_value - 1, 0, -1):\\n\\n invs[x] = invs[x + 1] * (x + 1) % mod\\n\\n\\n\\n self.fact = fact\\n\\n self.invs = invs\\n\\n self.mod = mod\\n\\n\\n\\n def combination(self, n, r):\\n\\n if n - r < r:\\n\\n return self.combination(n, n - r)\\n\\n if r < 0:\\n\\n return 0\\n\\n if r == 0:\\n\\n return 1\\n\\n if r == 1:\\n\\n return n\\n\\n return self.fact[n] * self.invs[r] * self.invs[n - r] % self.mod\\n\\n\\n\\n\\n\\ndef gen(n):\\n\\n x = n\\n\\n d = 2\\n\\n cnt = 0\\n\\n while x % d == 0:\\n\\n x //= d\\n\\n cnt += 1\\n\\n yield cnt\\n\\n\\n\\n d = 3\\n\\n ma = d * d\\n\\n while ma <= n:\\n\\n cnt = 0\\n\\n while x % d == 0:\\n\\n x //= d\\n\\n cnt += 1\\n\\n yield cnt\\n\\n ma += d * 4 + 4\\n\\n d += 2\\n\\n\\n\\n if x > 1:\\n\\n yield 1\\n\\n\\n\\n\\n\\ndef main():\\n\\n MOD = 10 ** 9 + 7\\n\\n\\n\\n N, M = list(map(int, input().split()))\\n\\n\\n\\n cal = Calc(max_value=N + 30, mod=MOD)\\n\\n\\n\\n ans = 1\\n\\n for cnt in gen(M):\\n\\n ans = (ans * cal.combination(N + cnt - 1, cnt)) % MOD\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': \"def gen(n):\\n\\n x = n\\n\\n d = 2\\n\\n cnt = 0\\n\\n while x % d == 0:\\n\\n x //= d\\n\\n cnt += 1\\n\\n yield cnt\\n\\n\\n\\n d = 3\\n\\n while d * d <= n:\\n\\n cnt = 0\\n\\n while x % d == 0:\\n\\n x //= d\\n\\n cnt += 1\\n\\n yield cnt\\n\\n d += 2\\n\\n\\n\\n if x > 1:\\n\\n yield 1\\n\\n\\n\\n\\n\\ndef main():\\n\\n MOD = 10 ** 9 + 7\\n\\n\\n\\n N, M = list(map(int, input().split()))\\n\\n\\n\\n ans = 1\\n\\n for cnt in gen(M):\\n\\n for d in range(cnt):\\n\\n ans = (ans * (N - 1 + cnt - d) % MOD) * pow(d + 1, MOD - 2, MOD) % MOD\\n\\n \\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 69,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 1490,\n", + " 'code_v1_num_chars': 619,\n", + " 'code_v0_no_empty_lines': 'class Calc:\\n def __init__(self, max_value, mod):\\n \"\"\"combination(max_value, all)\"\"\"\\n fact = [-1] * (max_value + 1)\\n fact[0] = 1\\n fact[1] = 1\\n for x in range(2, max_value + 1):\\n fact[x] = x * fact[x - 1] % mod\\n invs = [1] * (max_value + 1)\\n invs[max_value] = pow(fact[max_value], mod - 2, mod)\\n for x in range(max_value - 1, 0, -1):\\n invs[x] = invs[x + 1] * (x + 1) % mod\\n self.fact = fact\\n self.invs = invs\\n self.mod = mod\\n\\n def combination(self, n, r):\\n if n - r < r:\\n return self.combination(n, n - r)\\n if r < 0:\\n return 0\\n if r == 0:\\n return 1\\n if r == 1:\\n return n\\n return self.fact[n] * self.invs[r] * self.invs[n - r] % self.mod\\n\\n\\ndef gen(n):\\n x = n\\n d = 2\\n cnt = 0\\n while x % d == 0:\\n x //= d\\n cnt += 1\\n yield cnt\\n d = 3\\n ma = d * d\\n while ma <= n:\\n cnt = 0\\n while x % d == 0:\\n x //= d\\n cnt += 1\\n yield cnt\\n ma += d * 4 + 4\\n d += 2\\n if x > 1:\\n yield 1\\n\\n\\ndef main():\\n MOD = 10**9 + 7\\n N, M = list(map(int, input().split()))\\n cal = Calc(max_value=N + 30, mod=MOD)\\n ans = 1\\n for cnt in gen(M):\\n ans = (ans * cal.combination(N + cnt - 1, cnt)) % MOD\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def gen(n):\\n x = n\\n d = 2\\n cnt = 0\\n while x % d == 0:\\n x //= d\\n cnt += 1\\n yield cnt\\n d = 3\\n while d * d <= n:\\n cnt = 0\\n while x % d == 0:\\n x //= d\\n cnt += 1\\n yield cnt\\n d += 2\\n if x > 1:\\n yield 1\\n\\n\\ndef main():\\n MOD = 10**9 + 7\\n N, M = list(map(int, input().split()))\\n ans = 1\\n for cnt in gen(M):\\n for d in range(cnt):\\n ans = (ans * (N - 1 + cnt - d) % MOD) * pow(d + 1, MOD - 2, MOD) % MOD\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 46.3768115942,\n", + " 'diff': ['-class Calc:',\n", + " '- def __init__(self, max_value, mod):',\n", + " '- \"\"\"combination(max_value, all)\"\"\"',\n", + " '- fact = [-1] * (max_value + 1)',\n", + " '- fact[0] = 1',\n", + " '- fact[1] = 1',\n", + " '- for x in range(2, max_value + 1):',\n", + " '- fact[x] = x * fact[x - 1] % mod',\n", + " '- invs = [1] * (max_value + 1)',\n", + " '- invs[max_value] = pow(fact[max_value], mod - 2, mod)',\n", + " '- for x in range(max_value - 1, 0, -1):',\n", + " '- invs[x] = invs[x + 1] * (x + 1) % mod',\n", + " '- self.fact = fact',\n", + " '- self.invs = invs',\n", + " '- self.mod = mod',\n", + " '-',\n", + " '- def combination(self, n, r):',\n", + " '- if n - r < r:',\n", + " '- return self.combination(n, n - r)',\n", + " '- if r < 0:',\n", + " '- return 0',\n", + " '- if r == 0:',\n", + " '- return 1',\n", + " '- if r == 1:',\n", + " '- return n',\n", + " '- return self.fact[n] * self.invs[r] * self.invs[n - r] % self.mod',\n", + " '-',\n", + " '-',\n", + " '- ma = d * d',\n", + " '- while ma <= n:',\n", + " '+ while d * d <= n:',\n", + " '- ma += d * 4 + 4',\n", + " '- cal = Calc(max_value=N + 30, mod=MOD)',\n", + " '- ans = (ans * cal.combination(N + cnt - 1, cnt)) % MOD',\n", + " '+ for d in range(cnt):',\n", + " '+ ans = (ans * (N - 1 + cnt - d) % MOD) * pow(d + 1, MOD - 2, MOD) % MOD'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5542220466,\n", + " 'measured_runtime_v1': 0.3755235486,\n", + " 'runtime_lift': 1.4758649588,\n", + " 'key': ['s242343005', 's569938093']},\n", + " {'user_id': 'u060938295',\n", + " 'problem_id': 'p03170',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's262531692',\n", + " 'submission_id_v1': 's447405152',\n", + " 'cpu_time_v0': 775,\n", + " 'cpu_time_v1': 215,\n", + " 'memory_v0': 14308,\n", + " 'memory_v1': 14256,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 72.26,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nCreated on Sat Apr 25 18:20:35 2020\\n\\n\"\"\"\\n\\n\\n\\nimport sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\n#def input():\\n\\n# return sys.stdin.readline()[:-1]\\n\\nmod = 10**9+7\\n\\n\\n\\n#N = int(input())\\n\\nN, K = list(map(int,input().split()))\\n\\nA = np.array(list(map(int,input().split())))\\n\\n\\n\\ndp = [True for i in range(K + A[-1] + 1)]\\n\\nfor i in range(K):\\n\\n if dp[i]:\\n\\n for a in A:\\n\\n dp[i + a] = False\\n\\n\\n\\n# print(i, dp[i],A+i,dp[A+i])\\n\\n#print(dp)\\n\\n\\n\\nif dp[K]:\\n\\n ans = \\'Second\\'\\n\\nelse:\\n\\n ans = \\'First\\'\\n\\nprint(ans)',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nCreated on Sat Apr 25 18:20:35 2020\\n\\n\"\"\"\\n\\n\\n\\nimport sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\n#def input():\\n\\n# return sys.stdin.readline()[:-1]\\n\\nmod = 10**9+7\\n\\n\\n\\n#N = int(input())\\n\\n#N, K = map(int,input().split())\\n\\n#A = np.array(list(map(int,input().split())))\\n\\nN, K, *A = list(map(int, open(0).read().split()))\\n\\n\\n\\ndp = [True for i in range(K + A[-1] + 1)]\\n\\nfor i in range(K):\\n\\n if dp[i]:\\n\\n for a in A:\\n\\n dp[i + a] = False\\n\\n\\n\\n# print(i, dp[i],A+i,dp[A+i])\\n\\n#print(dp)\\n\\n\\n\\nif dp[K]:\\n\\n ans = \\'Second\\'\\n\\nelse:\\n\\n ans = \\'First\\'\\n\\nprint(ans)',\n", + " 'code_v0_loc': 31,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 558,\n", + " 'code_v1_num_chars': 605,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nCreated on Sat Apr 25 18:20:35 2020\\n\"\"\"\\nimport sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**9)\\n# def input():\\n# return sys.stdin.readline()[:-1]\\nmod = 10**9 + 7\\n# N = int(input())\\nN, K = list(map(int, input().split()))\\nA = np.array(list(map(int, input().split())))\\ndp = [True for i in range(K + A[-1] + 1)]\\nfor i in range(K):\\n if dp[i]:\\n for a in A:\\n dp[i + a] = False\\n# print(i, dp[i],A+i,dp[A+i])\\n# print(dp)\\nif dp[K]:\\n ans = \"Second\"\\nelse:\\n ans = \"First\"\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nCreated on Sat Apr 25 18:20:35 2020\\n\"\"\"\\nimport sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**9)\\n# def input():\\n# return sys.stdin.readline()[:-1]\\nmod = 10**9 + 7\\n# N = int(input())\\n# N, K = map(int,input().split())\\n# A = np.array(list(map(int,input().split())))\\nN, K, *A = list(map(int, open(0).read().split()))\\ndp = [True for i in range(K + A[-1] + 1)]\\nfor i in range(K):\\n if dp[i]:\\n for a in A:\\n dp[i + a] = False\\n# print(i, dp[i],A+i,dp[A+i])\\n# print(dp)\\nif dp[K]:\\n ans = \"Second\"\\nelse:\\n ans = \"First\"\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.125,\n", + " 'diff': ['-N, K = list(map(int, input().split()))',\n", + " '-A = np.array(list(map(int, input().split())))',\n", + " '+# N, K = map(int,input().split())',\n", + " '+# A = np.array(list(map(int,input().split())))',\n", + " '+N, K, *A = list(map(int, open(0).read().split()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3617031952,\n", + " 'measured_runtime_v1': 0.2231245196,\n", + " 'runtime_lift': 6.102884603,\n", + " 'key': ['s262531692', 's447405152']},\n", + " {'user_id': 'u070201429',\n", + " 'problem_id': 'p03837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's719627889',\n", + " 'submission_id_v1': 's550164411',\n", + " 'cpu_time_v0': 1368,\n", + " 'cpu_time_v1': 267,\n", + " 'memory_v0': 27336,\n", + " 'memory_v1': 71572,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.48,\n", + " 'input': 'def main():\\n\\n from sys import stdin\\n\\n def input():\\n\\n return stdin.readline().strip()\\n\\n\\n\\n n, m = list(map(int, input().split()))\\n\\n tree = [[] for _ in range(n)]\\n\\n for _ in range(m):\\n\\n i, j, k = list(map(int, input().split()))\\n\\n i -= 1\\n\\n j -= 1\\n\\n tree[i].append((k, j))\\n\\n tree[j].append((k, i))\\n\\n\\n\\n # dijkstra\\n\\n import heapq\\n\\n from numpy import zeros\\n\\n\\n\\n ans = 0\\n\\n for i in range(n):\\n\\n for j in tree[i]:\\n\\n seen = zeros(n)\\n\\n goal = j[1]\\n\\n base = j[0]\\n\\n seen[i] = 1\\n\\n todo = []\\n\\n heapq.heapify(todo)\\n\\n for k in tree[i]:\\n\\n if k[0] < base and k != j:\\n\\n heapq.heappush(todo, k)\\n\\n while len(todo) > 0:\\n\\n k = heapq.heappop(todo)\\n\\n if k[1] == goal:\\n\\n if k[0] < base:\\n\\n ans += 1\\n\\n break\\n\\n seen[k[1]] = 1\\n\\n for l in tree[k[1]]:\\n\\n if seen[l[1]] == 0 and k[0] + l[0] < base:\\n\\n heapq.heappush(todo, (k[0] + l[0], l[1]))\\n\\n\\n\\n print((ans // 2))\\n\\n\\n\\nmain()',\n", + " 'target': 'def main():\\n\\n from sys import stdin\\n\\n def input():\\n\\n return stdin.readline().strip()\\n\\n\\n\\n n, m = list(map(int, input().split()))\\n\\n tree = [[] for _ in range(n)]\\n\\n for _ in range(m):\\n\\n i, j, k = list(map(int, input().split()))\\n\\n i -= 1\\n\\n j -= 1\\n\\n tree[i].append((k, j))\\n\\n tree[j].append((k, i))\\n\\n\\n\\n # dijkstra\\n\\n import heapq\\n\\n\\n\\n ans = 0\\n\\n for i in range(n):\\n\\n for j in tree[i]:\\n\\n seen = [0] * n\\n\\n goal = j[1]\\n\\n base = j[0]\\n\\n seen[i] = 1\\n\\n todo = []\\n\\n heapq.heapify(todo)\\n\\n for k in tree[i]:\\n\\n if k[0] < base and k != j:\\n\\n heapq.heappush(todo, k)\\n\\n while len(todo) > 0:\\n\\n k = heapq.heappop(todo)\\n\\n if k[1] == goal:\\n\\n if k[0] < base:\\n\\n ans += 1\\n\\n break\\n\\n seen[k[1]] = 1\\n\\n for l in tree[k[1]]:\\n\\n if seen[l[1]] == 0 and k[0] + l[0] < base:\\n\\n heapq.heappush(todo, (k[0] + l[0], l[1]))\\n\\n\\n\\n print((ans // 2))\\n\\n\\n\\nmain()',\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 43,\n", + " 'code_v0_num_chars': 1189,\n", + " 'code_v1_num_chars': 1159,\n", + " 'code_v0_no_empty_lines': 'def main():\\n from sys import stdin\\n\\n def input():\\n return stdin.readline().strip()\\n\\n n, m = list(map(int, input().split()))\\n tree = [[] for _ in range(n)]\\n for _ in range(m):\\n i, j, k = list(map(int, input().split()))\\n i -= 1\\n j -= 1\\n tree[i].append((k, j))\\n tree[j].append((k, i))\\n # dijkstra\\n import heapq\\n from numpy import zeros\\n\\n ans = 0\\n for i in range(n):\\n for j in tree[i]:\\n seen = zeros(n)\\n goal = j[1]\\n base = j[0]\\n seen[i] = 1\\n todo = []\\n heapq.heapify(todo)\\n for k in tree[i]:\\n if k[0] < base and k != j:\\n heapq.heappush(todo, k)\\n while len(todo) > 0:\\n k = heapq.heappop(todo)\\n if k[1] == goal:\\n if k[0] < base:\\n ans += 1\\n break\\n seen[k[1]] = 1\\n for l in tree[k[1]]:\\n if seen[l[1]] == 0 and k[0] + l[0] < base:\\n heapq.heappush(todo, (k[0] + l[0], l[1]))\\n print((ans // 2))\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n from sys import stdin\\n\\n def input():\\n return stdin.readline().strip()\\n\\n n, m = list(map(int, input().split()))\\n tree = [[] for _ in range(n)]\\n for _ in range(m):\\n i, j, k = list(map(int, input().split()))\\n i -= 1\\n j -= 1\\n tree[i].append((k, j))\\n tree[j].append((k, i))\\n # dijkstra\\n import heapq\\n\\n ans = 0\\n for i in range(n):\\n for j in tree[i]:\\n seen = [0] * n\\n goal = j[1]\\n base = j[0]\\n seen[i] = 1\\n todo = []\\n heapq.heapify(todo)\\n for k in tree[i]:\\n if k[0] < base and k != j:\\n heapq.heappush(todo, k)\\n while len(todo) > 0:\\n k = heapq.heappop(todo)\\n if k[1] == goal:\\n if k[0] < base:\\n ans += 1\\n break\\n seen[k[1]] = 1\\n for l in tree[k[1]]:\\n if seen[l[1]] == 0 and k[0] + l[0] < base:\\n heapq.heappush(todo, (k[0] + l[0], l[1]))\\n print((ans // 2))\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.2727272727,\n", + " 'diff': ['- from numpy import zeros',\n", + " '- seen = zeros(n)',\n", + " '+ seen = [0] * n'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1406116307,\n", + " 'measured_runtime_v1': 0.1031825858,\n", + " 'runtime_lift': 20.7458614645,\n", + " 'key': ['s719627889', 's550164411']},\n", + " {'user_id': 'u062560908',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's405829600',\n", + " 'submission_id_v1': 's667622299',\n", + " 'cpu_time_v0': 288,\n", + " 'cpu_time_v1': 54,\n", + " 'memory_v0': 135980,\n", + " 'memory_v1': 66236,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.25,\n", + " 'input': \"def sol(n):\\n\\n d = {}\\n\\n N = 100000\\n\\n for i in range(-N, N+1):\\n\\n d[i**5]=i\\n\\n for i in d:\\n\\n j = n+i\\n\\n if j in d:\\n\\n print(d[j], d[i])\\n\\n return\\n\\n\\n\\ndef main():\\n\\n n = eval(input())\\n\\n sol(n)\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"def sol(n):\\n\\n d = {}\\n\\n N = 1000\\n\\n for i in range(-N, N+1):\\n\\n d[i**5]=i\\n\\n for i in d:\\n\\n j = n+i\\n\\n if j in d:\\n\\n print(d[j], d[i])\\n\\n return\\n\\n\\n\\ndef main():\\n\\n n = eval(input())\\n\\n sol(n)\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 277,\n", + " 'code_v1_num_chars': 275,\n", + " 'code_v0_no_empty_lines': 'def sol(n):\\n d = {}\\n N = 100000\\n for i in range(-N, N + 1):\\n d[i**5] = i\\n for i in d:\\n j = n + i\\n if j in d:\\n print(d[j], d[i])\\n return\\n\\n\\ndef main():\\n n = eval(input())\\n sol(n)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def sol(n):\\n d = {}\\n N = 1000\\n for i in range(-N, N + 1):\\n d[i**5] = i\\n for i in d:\\n j = n + i\\n if j in d:\\n print(d[j], d[i])\\n return\\n\\n\\ndef main():\\n n = eval(input())\\n sol(n)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- N = 100000', '+ N = 1000'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.1436646879,\n", + " 'measured_runtime_v1': 0.1839788636,\n", + " 'runtime_lift': 6.2162830322,\n", + " 'key': ['s405829600', 's667622299']},\n", + " {'user_id': 'u546338822',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's185507084',\n", + " 'submission_id_v1': 's217859496',\n", + " 'cpu_time_v0': 410,\n", + " 'cpu_time_v1': 152,\n", + " 'memory_v0': 21760,\n", + " 'memory_v1': 12836,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.93,\n", + " 'input': 'from functools import lru_cache\\n\\n\\n\\ndef main():\\n\\n n,m = list(map(int,input().split()))\\n\\n import numpy as np\\n\\n ans = np.ones(n+1,dtype=int)*-1\\n\\n ans[0] = 1\\n\\n mod = 10**9+7\\n\\n for _ in range(m):\\n\\n a = int(eval(input()))\\n\\n ans[a]=0\\n\\n if ans[1]!=0:\\n\\n ans[1]=1\\n\\n for i in range(2,n+1):\\n\\n if ans[i]!=0:\\n\\n ans[i] = (ans[i-1]+ans[i-2])%mod\\n\\n print((ans[-1]))\\n\\n \\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'target': 'def main():\\n\\n n,m = list(map(int,input().split()))\\n\\n dp = [0 for i in range(n+1)]\\n\\n mod = 10**9+7\\n\\n for i in range(m):\\n\\n a = int(eval(input()))\\n\\n dp[a] = -1\\n\\n dp[0] = 1\\n\\n if dp[1]!=-1:\\n\\n dp[1] = 1\\n\\n for i in range(2,n+1):\\n\\n if dp[i]==-1:\\n\\n continue\\n\\n if dp[i-1]!=-1 and dp[i-2]!=-1:\\n\\n dp[i] = dp[i-1] + dp[i-2]\\n\\n dp[i] = dp[i]%mod\\n\\n elif dp[i-1]!=-1 and dp[i-2]==-1:\\n\\n dp[i] = dp[i-1]\\n\\n elif dp[i-1]==-1 and dp[i-2]!=-1:\\n\\n dp[i] = dp[i-2]\\n\\n else:\\n\\n dp[i] = 0\\n\\n print((dp[-1]))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 452,\n", + " 'code_v1_num_chars': 651,\n", + " 'code_v0_no_empty_lines': 'from functools import lru_cache\\n\\n\\ndef main():\\n n, m = list(map(int, input().split()))\\n import numpy as np\\n\\n ans = np.ones(n + 1, dtype=int) * -1\\n ans[0] = 1\\n mod = 10**9 + 7\\n for _ in range(m):\\n a = int(eval(input()))\\n ans[a] = 0\\n if ans[1] != 0:\\n ans[1] = 1\\n for i in range(2, n + 1):\\n if ans[i] != 0:\\n ans[i] = (ans[i - 1] + ans[i - 2]) % mod\\n print((ans[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n n, m = list(map(int, input().split()))\\n dp = [0 for i in range(n + 1)]\\n mod = 10**9 + 7\\n for i in range(m):\\n a = int(eval(input()))\\n dp[a] = -1\\n dp[0] = 1\\n if dp[1] != -1:\\n dp[1] = 1\\n for i in range(2, n + 1):\\n if dp[i] == -1:\\n continue\\n if dp[i - 1] != -1 and dp[i - 2] != -1:\\n dp[i] = dp[i - 1] + dp[i - 2]\\n dp[i] = dp[i] % mod\\n elif dp[i - 1] != -1 and dp[i - 2] == -1:\\n dp[i] = dp[i - 1]\\n elif dp[i - 1] == -1 and dp[i - 2] != -1:\\n dp[i] = dp[i - 2]\\n else:\\n dp[i] = 0\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 19.2307692308,\n", + " 'diff': ['-from functools import lru_cache',\n", + " '-',\n", + " '-',\n", + " '- import numpy as np',\n", + " '-',\n", + " '- ans = np.ones(n + 1, dtype=int) * -1',\n", + " '- ans[0] = 1',\n", + " '+ dp = [0 for i in range(n + 1)]',\n", + " '- for _ in range(m):',\n", + " '+ for i in range(m):',\n", + " '- ans[a] = 0',\n", + " '- if ans[1] != 0:',\n", + " '- ans[1] = 1',\n", + " '+ dp[a] = -1',\n", + " '+ dp[0] = 1',\n", + " '+ if dp[1] != -1:',\n", + " '+ dp[1] = 1',\n", + " '- if ans[i] != 0:',\n", + " '- ans[i] = (ans[i - 1] + ans[i - 2]) % mod',\n", + " '- print((ans[-1]))',\n", + " '+ if dp[i] == -1:',\n", + " '+ continue',\n", + " '+ if dp[i - 1] != -1 and dp[i - 2] != -1:',\n", + " '+ dp[i] = dp[i - 1] + dp[i - 2]',\n", + " '+ dp[i] = dp[i] % mod',\n", + " '+ elif dp[i - 1] != -1 and dp[i - 2] == -1:',\n", + " '+ dp[i] = dp[i - 1]',\n", + " '+ elif dp[i - 1] == -1 and dp[i - 2] != -1:',\n", + " '+ dp[i] = dp[i - 2]',\n", + " '+ else:',\n", + " '+ dp[i] = 0',\n", + " '+ print((dp[-1]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3205960586,\n", + " 'measured_runtime_v1': 0.2082385263,\n", + " 'runtime_lift': 6.3417470423,\n", + " 'key': ['s185507084', 's217859496']},\n", + " {'user_id': 'u764215612',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's260490264',\n", + " 'submission_id_v1': 's471661437',\n", + " 'cpu_time_v0': 40,\n", + " 'cpu_time_v1': 34,\n", + " 'memory_v0': 9168,\n", + " 'memory_v1': 9040,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': 'x=int(eval(input()))\\n\\nfor i in range(-118,120):\\n\\n for j in range(-119,129):\\n\\n if i**5-j**5==x:\\n\\n print((i,j))\\n\\n exit()',\n", + " 'target': 'x = int(eval(input()))\\n\\nfor i in range(120):\\n\\n for j in range(-119,129):\\n\\n if i**5 - j**5 == x:\\n\\n print((i, j))\\n\\n exit()',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 124,\n", + " 'code_v1_num_chars': 126,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(-118, 120):\\n for j in range(-119, 129):\\n if i**5 - j**5 == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(120):\\n for j in range(-119, 129):\\n if i**5 - j**5 == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in range(-118, 120):', '+for i in range(120):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5536552926,\n", + " 'measured_runtime_v1': 0.1323317309,\n", + " 'runtime_lift': 4.1838438044,\n", + " 'key': ['s260490264', 's471661437']},\n", + " {'user_id': 'u773686010',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's443943241',\n", + " 'submission_id_v1': 's399855216',\n", + " 'cpu_time_v0': 1938,\n", + " 'cpu_time_v1': 418,\n", + " 'memory_v0': 46688,\n", + " 'memory_v1': 28484,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 78.43,\n", + " 'input': '# https://atcoder.jp/contests/dp/tasks/dp_c\\n\\nimport numpy as np\\n\\nN = int(eval(input()))\\n\\nMax_List=[]\\n\\nN_List=[i for i in range(3)]\\n\\nfor i in range(N):\\n\\n Current_List=list(map(int,input().split())) \\n\\n if i == 0:\\n\\n Max_List.append(Current_List)\\n\\n else:\\n\\n Current_Max_List = []\\n\\n for j in range(3):\\n\\n Index_List=np.array(Max_List[i-1])\\n\\n ind = np.ones(3, dtype=bool)\\n\\n ind[j] = False\\n\\n Current_Max_List.append(max(Index_List[ind])+Current_List[j])\\n\\n \\n\\n Max_List.append(Current_Max_List)\\n\\n \\n\\n \\n\\nprint((max(Max_List[-1])))',\n", + " 'target': '# https://atcoder.jp/contests/dp/tasks/dp_c\\n\\nN = int(eval(input()))\\n\\nMax_List=[]\\n\\nN_List=[i for i in range(3)]\\n\\nfor i in range(N):\\n\\n Current_List=list(map(int,input().split())) \\n\\n if i == 0:\\n\\n Max_List.append(Current_List)\\n\\n else:\\n\\n Current_Max_List = []\\n\\n Search_List=Max_List[i-1]\\n\\n for j in range(3):\\n\\n Current_Search_List=Search_List[1:3]\\n\\n Current_Max_List.append(max(Current_Search_List)+Current_List[j])\\n\\n Search_List.append(Search_List[0])\\n\\n del Search_List[0]\\n\\n Max_List.append(Current_Max_List)\\n\\n \\n\\n \\n\\nprint((max(Max_List[-1])))',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 611,\n", + " 'code_v1_num_chars': 628,\n", + " 'code_v0_no_empty_lines': '# https://atcoder.jp/contests/dp/tasks/dp_c\\nimport numpy as np\\n\\nN = int(eval(input()))\\nMax_List = []\\nN_List = [i for i in range(3)]\\nfor i in range(N):\\n Current_List = list(map(int, input().split()))\\n if i == 0:\\n Max_List.append(Current_List)\\n else:\\n Current_Max_List = []\\n for j in range(3):\\n Index_List = np.array(Max_List[i - 1])\\n ind = np.ones(3, dtype=bool)\\n ind[j] = False\\n Current_Max_List.append(max(Index_List[ind]) + Current_List[j])\\n Max_List.append(Current_Max_List)\\nprint((max(Max_List[-1])))\\n',\n", + " 'code_v1_no_empty_lines': '# https://atcoder.jp/contests/dp/tasks/dp_c\\nN = int(eval(input()))\\nMax_List = []\\nN_List = [i for i in range(3)]\\nfor i in range(N):\\n Current_List = list(map(int, input().split()))\\n if i == 0:\\n Max_List.append(Current_List)\\n else:\\n Current_Max_List = []\\n Search_List = Max_List[i - 1]\\n for j in range(3):\\n Current_Search_List = Search_List[1:3]\\n Current_Max_List.append(max(Current_Search_List) + Current_List[j])\\n Search_List.append(Search_List[0])\\n del Search_List[0]\\n Max_List.append(Current_Max_List)\\nprint((max(Max_List[-1])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.7619047619,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '+ Search_List = Max_List[i - 1]',\n", + " '- Index_List = np.array(Max_List[i - 1])',\n", + " '- ind = np.ones(3, dtype=bool)',\n", + " '- ind[j] = False',\n", + " '- Current_Max_List.append(max(Index_List[ind]) + Current_List[j])',\n", + " '+ Current_Search_List = Search_List[1:3]',\n", + " '+ Current_Max_List.append(max(Current_Search_List) + Current_List[j])',\n", + " '+ Search_List.append(Search_List[0])',\n", + " '+ del Search_List[0]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9151891472,\n", + " 'measured_runtime_v1': 0.3473046393,\n", + " 'runtime_lift': 5.5144358302,\n", + " 'key': ['s443943241', 's399855216']},\n", + " {'user_id': 'u935184340',\n", + " 'problem_id': 'p00003',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's695745765',\n", + " 'submission_id_v1': 's444816349',\n", + " 'cpu_time_v0': 40,\n", + " 'cpu_time_v1': 30,\n", + " 'memory_v0': 7832,\n", + " 'memory_v1': 7708,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 25.0,\n", + " 'input': 'import sys\\n\\nr = []\\n\\nn = int(eval(input()))\\n\\nl = sys.stdin.readlines()\\n\\nfor i in l:\\n\\n x, y, z = sorted([x*x for x in list(map(int, i.split()))])\\n\\n if x + y == z:\\n\\n print(\"YES\")\\n\\n else:\\n\\n print(\"NO\")',\n", + " 'target': 'import sys\\n\\n\\n\\nn = int(input())\\n\\nl = sys.stdin.readlines()\\n\\ns = \"\"\\n\\nfor i in l:\\n\\n x, y, z = sorted(map(lambda x:x*x,map(int, i.split())))\\n\\n if x + y == z:\\n\\n s += \"YES\\\\n\"\\n\\n else:\\n\\n s += \"NO\\\\n\"\\n\\n\\n\\nprint(s,end=\"\")\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 201,\n", + " 'code_v1_num_chars': 222,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nr = []\\nn = int(eval(input()))\\nl = sys.stdin.readlines()\\nfor i in l:\\n x, y, z = sorted([x * x for x in list(map(int, i.split()))])\\n if x + y == z:\\n print(\"YES\")\\n else:\\n print(\"NO\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nn = int(input())\\nl = sys.stdin.readlines()\\ns = \"\"\\nfor i in l:\\n x, y, z = sorted(map(lambda x: x * x, map(int, i.split())))\\n if x + y == z:\\n s += \"YES\\\\n\"\\n else:\\n s += \"NO\\\\n\"\\nprint(s, end=\"\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-r = []',\n", + " '-n = int(eval(input()))',\n", + " '+n = int(input())',\n", + " '+s = \"\"',\n", + " '- x, y, z = sorted([x * x for x in list(map(int, i.split()))])',\n", + " '+ x, y, z = sorted(map(lambda x: x * x, map(int, i.split())))',\n", + " '- print(\"YES\")',\n", + " '+ s += \"YES\\\\n\"',\n", + " '- print(\"NO\")',\n", + " '+ s += \"NO\\\\n\"',\n", + " '+print(s, end=\"\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3577006006,\n", + " 'measured_runtime_v1': 0.2704619627,\n", + " 'runtime_lift': 1.3225541848,\n", + " 'key': ['s695745765', 's444816349']},\n", + " {'user_id': 'u759412327',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's189199377',\n", + " 'submission_id_v1': 's590295023',\n", + " 'cpu_time_v0': 249,\n", + " 'cpu_time_v1': 43,\n", + " 'memory_v0': 17568,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.73,\n", + " 'input': 'from scipy.sparse import *\\n\\nN,M,*A=list(map(int,open(0).read().split()));g=csr_matrix(([1]*M,(A[::2],A[1::2])),shape=(N+1,N+1)).tolil()\\n\\nc = 0\\n\\n\\n\\nfor a,b in zip(*g.nonzero()):\\n\\n g[a,b]=0\\n\\n n,_=csgraph.connected_components(g)\\n\\n c+=n!=2\\n\\n g[a,b]=1\\n\\n\\n\\nprint(c)',\n", + " 'target': 'N,M=list(map(int,input().split()))\\n\\nedges=[list(map(int,input().split())) for i in range(M)]\\n\\nans=0\\n\\nfor x in edges:\\n\\n l=list(range(N))\\n\\n for y in edges:\\n\\n if y!=x:l=[l[y[0]-1] if l[i]==l[y[1]-1] else l[i] for i in range(N)]\\n\\n if len(set(l))!=1:ans+=1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 255,\n", + " 'code_v1_num_chars': 273,\n", + " 'code_v0_no_empty_lines': 'from scipy.sparse import *\\n\\nN, M, *A = list(map(int, open(0).read().split()))\\ng = csr_matrix(([1] * M, (A[::2], A[1::2])), shape=(N + 1, N + 1)).tolil()\\nc = 0\\nfor a, b in zip(*g.nonzero()):\\n g[a, b] = 0\\n n, _ = csgraph.connected_components(g)\\n c += n != 2\\n g[a, b] = 1\\nprint(c)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nedges = [list(map(int, input().split())) for i in range(M)]\\nans = 0\\nfor x in edges:\\n l = list(range(N))\\n for y in edges:\\n if y != x:\\n l = [l[y[0] - 1] if l[i] == l[y[1] - 1] else l[i] for i in range(N)]\\n if len(set(l)) != 1:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['-from scipy.sparse import *',\n", + " '-',\n", + " '-N, M, *A = list(map(int, open(0).read().split()))',\n", + " '-g = csr_matrix(([1] * M, (A[::2], A[1::2])), shape=(N + 1, N + 1)).tolil()',\n", + " '-c = 0',\n", + " '-for a, b in zip(*g.nonzero()):',\n", + " '- g[a, b] = 0',\n", + " '- n, _ = csgraph.connected_components(g)',\n", + " '- c += n != 2',\n", + " '- g[a, b] = 1',\n", + " '-print(c)',\n", + " '+N, M = list(map(int, input().split()))',\n", + " '+edges = [list(map(int, input().split())) for i in range(M)]',\n", + " '+ans = 0',\n", + " '+for x in edges:',\n", + " '+ l = list(range(N))',\n", + " '+ for y in edges:',\n", + " '+ if y != x:',\n", + " '+ l = [l[y[0] - 1] if l[i] == l[y[1] - 1] else l[i] for i in range(N)]',\n", + " '+ if len(set(l)) != 1:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8243682652,\n", + " 'measured_runtime_v1': 0.2276114681,\n", + " 'runtime_lift': 8.0152739248,\n", + " 'key': ['s189199377', 's590295023']},\n", + " {'user_id': 'u624696727',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's863705375',\n", + " 'submission_id_v1': 's938285380',\n", + " 'cpu_time_v0': 334,\n", + " 'cpu_time_v1': 121,\n", + " 'memory_v0': 40120,\n", + " 'memory_v1': 25692,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 63.77,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\nint1 = lambda x: int(x) - 1\\n\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\n\\nprintH = lambda x: print(\" \".join(map(str,x)))\\n\\ndef IS(): return sys.stdin.readline()[:-1]\\n\\ndef II(): return int(sys.stdin.readline())\\n\\ndef MI(): return map(int, sys.stdin.readline().split())\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\\n\\ndef LII(rows_number): return [II() for _ in range(rows_number)]\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\\n\\n\\n\\ndef main():\\n\\n\\tK,N = MI()\\n\\n\\tA = np.array(LI())\\n\\n\\tA_LAST = K+A[0] - A[N-1]\\n\\n\\tB = A[1:]-A[:N-1]\\n\\n\\tB = np.sort(B)\\n\\n\\tprint(K-max(B[N-2],A_LAST))\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n\\tmain()\\n',\n", + " 'target': 'import sys\\n\\n\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\nint1 = lambda x: int(x) - 1\\n\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\n\\nprintH = lambda x: print(\" \".join(map(str,x)))\\n\\ndef IS(): return sys.stdin.readline()[:-1]\\n\\ndef II(): return int(sys.stdin.readline())\\n\\ndef MI(): return map(int, sys.stdin.readline().split())\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\\n\\ndef LII(rows_number): return [II() for _ in range(rows_number)]\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\\n\\n\\n\\ndef main():\\n\\n\\tk,n = MI()\\n\\n\\ta = LI()\\n\\n\\tb = [0]*n\\n\\n\\tfor i in range(n):\\n\\n\\t\\tif i == n-1:\\n\\n\\t\\t\\tb[i] = a[0]+k-a[i]\\n\\n\\t\\telse:\\n\\n\\t\\t\\tb[i] = a[i+1]-a[i]\\n\\n\\tb.sort()\\n\\n\\tprint(k-b[-1])\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n\\tmain()\\n',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 833,\n", + " 'code_v1_num_chars': 843,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**6)\\nint1 = lambda x: int(x) - 1\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\nprintH = lambda x: print(\" \".join(map(str, x)))\\n\\n\\ndef IS():\\n return sys.stdin.readline()[:-1]\\n\\n\\ndef II():\\n return int(sys.stdin.readline())\\n\\n\\ndef MI():\\n return map(int, sys.stdin.readline().split())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, sys.stdin.readline().split()))\\n\\n\\ndef LII(rows_number):\\n return [II() for _ in range(rows_number)]\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef LLI1(rows_number):\\n return [LI1() for _ in range(rows_number)]\\n\\n\\ndef main():\\n K, N = MI()\\n A = np.array(LI())\\n A_LAST = K + A[0] - A[N - 1]\\n B = A[1:] - A[: N - 1]\\n B = np.sort(B)\\n print(K - max(B[N - 2], A_LAST))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\nint1 = lambda x: int(x) - 1\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\nprintH = lambda x: print(\" \".join(map(str, x)))\\n\\n\\ndef IS():\\n return sys.stdin.readline()[:-1]\\n\\n\\ndef II():\\n return int(sys.stdin.readline())\\n\\n\\ndef MI():\\n return map(int, sys.stdin.readline().split())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, sys.stdin.readline().split()))\\n\\n\\ndef LII(rows_number):\\n return [II() for _ in range(rows_number)]\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef LLI1(rows_number):\\n return [LI1() for _ in range(rows_number)]\\n\\n\\ndef main():\\n k, n = MI()\\n a = LI()\\n b = [0] * n\\n for i in range(n):\\n if i == n - 1:\\n b[i] = a[0] + k - a[i]\\n else:\\n b[i] = a[i + 1] - a[i]\\n b.sort()\\n print(k - b[-1])\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '- K, N = MI()',\n", + " '- A = np.array(LI())',\n", + " '- A_LAST = K + A[0] - A[N - 1]',\n", + " '- B = A[1:] - A[: N - 1]',\n", + " '- B = np.sort(B)',\n", + " '- print(K - max(B[N - 2], A_LAST))',\n", + " '+ k, n = MI()',\n", + " '+ a = LI()',\n", + " '+ b = [0] * n',\n", + " '+ for i in range(n):',\n", + " '+ if i == n - 1:',\n", + " '+ b[i] = a[0] + k - a[i]',\n", + " '+ else:',\n", + " '+ b[i] = a[i + 1] - a[i]',\n", + " '+ b.sort()',\n", + " '+ print(k - b[-1])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.0759786758,\n", + " 'measured_runtime_v1': 0.207579791,\n", + " 'runtime_lift': 5.1834461855,\n", + " 'key': ['s863705375', 's938285380']},\n", + " {'user_id': 'u199290844',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's958779549',\n", + " 'submission_id_v1': 's995029254',\n", + " 'cpu_time_v0': 279,\n", + " 'cpu_time_v1': 126,\n", + " 'memory_v0': 35108,\n", + " 'memory_v1': 26420,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.84,\n", + " 'input': \"import numpy as np\\n\\n\\n\\nK, N = [int(i) for i in input().rstrip().split(' ')]\\n\\nA = [int(i) for i in input().rstrip().split(' ')]\\n\\n\\n\\nx = A[0]\\n\\ny = K - A[-1]\\n\\nn = [int(A[i+1] - A[i]) for i in range(N-1)]\\n\\nn.append(x+y)\\n\\n\\n\\nnp_list = np.array(n)\\n\\nn.pop(np_list.argmax())\\n\\nprint((sum(n)))\",\n", + " 'target': 'k,n = list(map(int,input().split()))\\n\\na = list(map(int,input().split()))\\n\\n\\n\\ndp = [0 for i in range(n)]\\n\\ndp[0] = abs(k-a[-1]) + a[0]\\n\\n\\n\\nfor i in range(1,n):\\n\\n dp[i] = abs(a[i]-a[i-1])\\n\\n\\n\\nprint((sum(dp) - max(dp)))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 278,\n", + " 'code_v1_num_chars': 213,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nK, N = [int(i) for i in input().rstrip().split(\" \")]\\nA = [int(i) for i in input().rstrip().split(\" \")]\\nx = A[0]\\ny = K - A[-1]\\nn = [int(A[i + 1] - A[i]) for i in range(N - 1)]\\nn.append(x + y)\\nnp_list = np.array(n)\\nn.pop(np_list.argmax())\\nprint((sum(n)))\\n',\n", + " 'code_v1_no_empty_lines': 'k, n = list(map(int, input().split()))\\na = list(map(int, input().split()))\\ndp = [0 for i in range(n)]\\ndp[0] = abs(k - a[-1]) + a[0]\\nfor i in range(1, n):\\n dp[i] = abs(a[i] - a[i - 1])\\nprint((sum(dp) - max(dp)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-K, N = [int(i) for i in input().rstrip().split(\" \")]',\n", + " '-A = [int(i) for i in input().rstrip().split(\" \")]',\n", + " '-x = A[0]',\n", + " '-y = K - A[-1]',\n", + " '-n = [int(A[i + 1] - A[i]) for i in range(N - 1)]',\n", + " '-n.append(x + y)',\n", + " '-np_list = np.array(n)',\n", + " '-n.pop(np_list.argmax())',\n", + " '-print((sum(n)))',\n", + " '+k, n = list(map(int, input().split()))',\n", + " '+a = list(map(int, input().split()))',\n", + " '+dp = [0 for i in range(n)]',\n", + " '+dp[0] = abs(k - a[-1]) + a[0]',\n", + " '+for i in range(1, n):',\n", + " '+ dp[i] = abs(a[i] - a[i - 1])',\n", + " '+print((sum(dp) - max(dp)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5235492842,\n", + " 'measured_runtime_v1': 0.2507305129,\n", + " 'runtime_lift': 6.0764414622,\n", + " 'key': ['s958779549', 's995029254']},\n", + " {'user_id': 'u275934251',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's111144925',\n", + " 'submission_id_v1': 's028336395',\n", + " 'cpu_time_v0': 229,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 3980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.84,\n", + " 'input': 'import math\\n\\n\\n\\nN = int(eval(input()))\\n\\n\\n\\npower = math.factorial(N)\\n\\n\\n\\nprint((power % 1000000007))\\n\\n\\n',\n", + " 'target': 'n=int(eval(input()))\\n\\nans=1\\n\\nfor i in range(n):\\n\\n ans=(ans*(i+1))%(10**9+7)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 92,\n", + " 'code_v1_num_chars': 84,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\npower = math.factorial(N)\\nprint((power % 1000000007))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 1\\nfor i in range(n):\\n ans = (ans * (i + 1)) % (10**9 + 7)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 37.5,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '-power = math.factorial(N)',\n", + " '-print((power % 1000000007))',\n", + " '+n = int(eval(input()))',\n", + " '+ans = 1',\n", + " '+for i in range(n):',\n", + " '+ ans = (ans * (i + 1)) % (10**9 + 7)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7185150633,\n", + " 'measured_runtime_v1': 0.3322105608,\n", + " 'runtime_lift': 2.1628302891,\n", + " 'key': ['s111144925', 's028336395']},\n", + " {'user_id': 'u893063840',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's467181004',\n", + " 'submission_id_v1': 's228678870',\n", + " 'cpu_time_v0': 173,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 13416,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.44,\n", + " 'input': 'import numpy as\\tnp\\n\\n\\n\\nn, d = list(map(int, input().split()))\\n\\nx = []\\n\\nfor i in range(n):\\n\\n x.append(list(map(int, input().split())))\\n\\n\\n\\nx = np.array(x)\\n\\n\\n\\ncount =\\t0\\n\\nfor i in range(n):\\n\\n for j in range(i+1, n):\\n\\n dist = np.linalg.norm(x[i] - x[j])\\n\\n if dist == int(dist):\\n\\n count += 1\\n\\n\\n\\nprint(count)',\n", + " 'target': 'n, d = list(map(int, input().split()))\\n\\nx = [list(map(int, input().split())) for _ in range(n)]\\n\\n\\n\\n\\n\\ndef dist(a, b):\\n\\n sm = 0\\n\\n for ea, eb in zip(a, b):\\n\\n sm += (ea - eb) ** 2\\n\\n\\n\\n return sm ** 0.5\\n\\n\\n\\n\\n\\nans = 0\\n\\nfor i in range(n):\\n\\n for j in range(i + 1, n):\\n\\n dst = dist(x[i], x[j])\\n\\n for k in range(int(16000 ** 0.5) + 1):\\n\\n if k == dst:\\n\\n ans += 1\\n\\n break\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 325,\n", + " 'code_v1_num_chars': 440,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, d = list(map(int, input().split()))\\nx = []\\nfor i in range(n):\\n x.append(list(map(int, input().split())))\\nx = np.array(x)\\ncount = 0\\nfor i in range(n):\\n for j in range(i + 1, n):\\n dist = np.linalg.norm(x[i] - x[j])\\n if dist == int(dist):\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n, d = list(map(int, input().split()))\\nx = [list(map(int, input().split())) for _ in range(n)]\\n\\n\\ndef dist(a, b):\\n sm = 0\\n for ea, eb in zip(a, b):\\n sm += (ea - eb) ** 2\\n return sm**0.5\\n\\n\\nans = 0\\nfor i in range(n):\\n for j in range(i + 1, n):\\n dst = dist(x[i], x[j])\\n for k in range(int(16000**0.5) + 1):\\n if k == dst:\\n ans += 1\\n break\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.7272727273,\n", + " 'diff': ['-import numpy as np',\n", + " '+n, d = list(map(int, input().split()))',\n", + " '+x = [list(map(int, input().split())) for _ in range(n)]',\n", + " '-n, d = list(map(int, input().split()))',\n", + " '-x = []',\n", + " '-for i in range(n):',\n", + " '- x.append(list(map(int, input().split())))',\n", + " '-x = np.array(x)',\n", + " '-count = 0',\n", + " '+',\n", + " '+def dist(a, b):',\n", + " '+ sm = 0',\n", + " '+ for ea, eb in zip(a, b):',\n", + " '+ sm += (ea - eb) ** 2',\n", + " '+ return sm**0.5',\n", + " '+',\n", + " '+',\n", + " '+ans = 0',\n", + " '- dist = np.linalg.norm(x[i] - x[j])',\n", + " '- if dist == int(dist):',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+ dst = dist(x[i], x[j])',\n", + " '+ for k in range(int(16000**0.5) + 1):',\n", + " '+ if k == dst:',\n", + " '+ ans += 1',\n", + " '+ break',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4700319977,\n", + " 'measured_runtime_v1': 0.24048966,\n", + " 'runtime_lift': 6.1126619642,\n", + " 'key': ['s467181004', 's228678870']},\n", + " {'user_id': 'u034782764',\n", + " 'problem_id': 'p03434',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's168786498',\n", + " 'submission_id_v1': 's082866179',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12504,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.59,\n", + " 'input': \"import numpy as np\\n\\n\\n\\nn=int(eval(input()))\\n\\na_list=list(map(int,input().split()))\\n\\na_list_2=sorted(a_list,reverse=True)\\n\\na=np.array(a_list_2,dtype='uint8')\\n\\n\\n\\nalice=0\\n\\nbob=0\\n\\nfor i in range(n):\\n\\n\\tif i%2==0:\\n\\n\\t\\talice+=a[i]\\n\\n\\telse:\\n\\n\\t\\tbob+=a[i]\\n\\n\\n\\nprint((alice-bob))\\n\",\n", + " 'target': 'n=int(eval(input()))\\n\\na=list(map(int,input().split()))\\n\\na.sort(reverse=True)\\n\\n\\n\\nalice=0\\n\\nbob=0\\n\\n\\n\\nfor i in range(n):\\n\\n if i%2==0:\\n\\n alice+=a[i]\\n\\n else:\\n\\n bob+=a[i]\\n\\n \\n\\nprint((alice-bob))',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 257,\n", + " 'code_v1_num_chars': 205,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\na_list = list(map(int, input().split()))\\na_list_2 = sorted(a_list, reverse=True)\\na = np.array(a_list_2, dtype=\"uint8\")\\nalice = 0\\nbob = 0\\nfor i in range(n):\\n if i % 2 == 0:\\n alice += a[i]\\n else:\\n bob += a[i]\\nprint((alice - bob))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nalice = 0\\nbob = 0\\nfor i in range(n):\\n if i % 2 == 0:\\n alice += a[i]\\n else:\\n bob += a[i]\\nprint((alice - bob))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-a_list = list(map(int, input().split()))',\n", + " '-a_list_2 = sorted(a_list, reverse=True)',\n", + " '-a = np.array(a_list_2, dtype=\"uint8\")',\n", + " '+a = list(map(int, input().split()))',\n", + " '+a.sort(reverse=True)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7632728631,\n", + " 'measured_runtime_v1': 0.2690178177,\n", + " 'runtime_lift': 6.5544835577,\n", + " 'key': ['s168786498', 's082866179']},\n", + " {'user_id': 'u222668979',\n", + " 'problem_id': 'p02996',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's000658921',\n", + " 'submission_id_v1': 's911267857',\n", + " 'cpu_time_v0': 791,\n", + " 'cpu_time_v1': 572,\n", + " 'memory_v0': 38028,\n", + " 'memory_v1': 117796,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.69,\n", + " 'input': \"import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nn = int(eval(input()))\\n\\nab = sorted([list(map(int, input().split()))[::-1] for _ in range(n)])\\n\\n\\n\\ncnt = 0\\n\\nfor b, a in ab:\\n\\n cnt += a\\n\\n if cnt > b:\\n\\n print('No')\\n\\n break\\n\\nelse:\\n\\n print('Yes')\\n\",\n", + " 'target': \"n = int(eval(input()))\\n\\nab = [list(map(int, input().split())) for _ in range(n)]\\n\\nab = sorted(ab, key=lambda x: x[1])\\n\\n\\n\\nt = 0\\n\\nfor a, b in ab:\\n\\n t += a\\n\\n if t > b:\\n\\n print('No')\\n\\n break\\n\\nelse:\\n\\n print('Yes')\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 251,\n", + " 'code_v1_num_chars': 226,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nn = int(eval(input()))\\nab = sorted([list(map(int, input().split()))[::-1] for _ in range(n)])\\ncnt = 0\\nfor b, a in ab:\\n cnt += a\\n if cnt > b:\\n print(\"No\")\\n break\\nelse:\\n print(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nab = [list(map(int, input().split())) for _ in range(n)]\\nab = sorted(ab, key=lambda x: x[1])\\nt = 0\\nfor a, b in ab:\\n t += a\\n if t > b:\\n print(\"No\")\\n break\\nelse:\\n print(\"Yes\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-input = sys.stdin.readline',\n", + " '-ab = sorted([list(map(int, input().split()))[::-1] for _ in range(n)])',\n", + " '-cnt = 0',\n", + " '-for b, a in ab:',\n", + " '- cnt += a',\n", + " '- if cnt > b:',\n", + " '+ab = [list(map(int, input().split())) for _ in range(n)]',\n", + " '+ab = sorted(ab, key=lambda x: x[1])',\n", + " '+t = 0',\n", + " '+for a, b in ab:',\n", + " '+ t += a',\n", + " '+ if t > b:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2345721078,\n", + " 'measured_runtime_v1': 0.0064230425,\n", + " 'runtime_lift': 36.5204038616,\n", + " 'key': ['s000658921', 's911267857']},\n", + " {'user_id': 'u060938295',\n", + " 'problem_id': 'p03170',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's305058110',\n", + " 'submission_id_v1': 's224120927',\n", + " 'cpu_time_v0': 751,\n", + " 'cpu_time_v1': 224,\n", + " 'memory_v0': 14280,\n", + " 'memory_v1': 14280,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 70.17,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nCreated on Sat Apr 25 18:20:35 2020\\n\\n\"\"\"\\n\\n\\n\\nimport sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\ndef input():\\n\\n return sys.stdin.readline()[:-1]\\n\\nmod = 10**9+7\\n\\n\\n\\n#N = int(input())\\n\\nN, K = list(map(int,input().split()))\\n\\nA = np.array(list(map(int,input().split())))\\n\\n#N, K, *A = map(int, open(0).read().split())\\n\\n\\n\\ndp = [True for i in range(K + A[-1] + 1)]\\n\\nfor i in range(K):\\n\\n if dp[i]:\\n\\n for a in A:\\n\\n dp[i + a] = False\\n\\n\\n\\n# print(i, dp[i],A+i,dp[A+i])\\n\\n#print(dp)\\n\\n\\n\\nif dp[K]:\\n\\n ans = \\'Second\\'\\n\\nelse:\\n\\n ans = \\'First\\'\\n\\nprint(ans)',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nCreated on Sat Apr 25 18:20:35 2020\\n\\n\"\"\"\\n\\n\\n\\nimport sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\n#def input():\\n\\n# return sys.stdin.readline()[:-1]\\n\\nmod = 10**9+7\\n\\n\\n\\n#N = int(input())\\n\\nN, K = list(map(int,input().split()))\\n\\n#A = np.array(list(map(int,input().split())))\\n\\nA = list(map(int,input().split()))\\n\\n\\n\\ndp = [True for i in range(K + A[-1] + 1)]\\n\\nfor i in range(K):\\n\\n if dp[i]:\\n\\n for a in A:\\n\\n dp[i + a] = False\\n\\n\\n\\n# print(i, dp[i],A+i,dp[A+i])\\n\\n#print(dp)\\n\\n\\n\\nif dp[K]:\\n\\n ans = \\'Second\\'\\n\\nelse:\\n\\n ans = \\'First\\'\\n\\nprint(ans)',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 602,\n", + " 'code_v1_num_chars': 595,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nCreated on Sat Apr 25 18:20:35 2020\\n\"\"\"\\nimport sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**9)\\n\\n\\ndef input():\\n return sys.stdin.readline()[:-1]\\n\\n\\nmod = 10**9 + 7\\n# N = int(input())\\nN, K = list(map(int, input().split()))\\nA = np.array(list(map(int, input().split())))\\n# N, K, *A = map(int, open(0).read().split())\\ndp = [True for i in range(K + A[-1] + 1)]\\nfor i in range(K):\\n if dp[i]:\\n for a in A:\\n dp[i + a] = False\\n# print(i, dp[i],A+i,dp[A+i])\\n# print(dp)\\nif dp[K]:\\n ans = \"Second\"\\nelse:\\n ans = \"First\"\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nCreated on Sat Apr 25 18:20:35 2020\\n\"\"\"\\nimport sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**9)\\n# def input():\\n# return sys.stdin.readline()[:-1]\\nmod = 10**9 + 7\\n# N = int(input())\\nN, K = list(map(int, input().split()))\\n# A = np.array(list(map(int,input().split())))\\nA = list(map(int, input().split()))\\ndp = [True for i in range(K + A[-1] + 1)]\\nfor i in range(K):\\n if dp[i]:\\n for a in A:\\n dp[i + a] = False\\n# print(i, dp[i],A+i,dp[A+i])\\n# print(dp)\\nif dp[K]:\\n ans = \"Second\"\\nelse:\\n ans = \"First\"\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def input():',\n", + " '- return sys.stdin.readline()[:-1]',\n", + " '-',\n", + " '-',\n", + " '+# def input():',\n", + " '+# return sys.stdin.readline()[:-1]',\n", + " '-A = np.array(list(map(int, input().split())))',\n", + " '-# N, K, *A = map(int, open(0).read().split())',\n", + " '+# A = np.array(list(map(int,input().split())))',\n", + " '+A = list(map(int, input().split()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4205468479,\n", + " 'measured_runtime_v1': 0.2123065576,\n", + " 'runtime_lift': 6.691017292,\n", + " 'key': ['s305058110', 's224120927']},\n", + " {'user_id': 'u528470578',\n", + " 'problem_id': 'p03680',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's142356798',\n", + " 'submission_id_v1': 's532531190',\n", + " 'cpu_time_v0': 547,\n", + " 'cpu_time_v1': 248,\n", + " 'memory_v0': 7084,\n", + " 'memory_v1': 7084,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.66,\n", + " 'input': 'import sys\\n\\n\\n\\nN = int(eval(input()))\\n\\na = [int(eval(input())) for _ in range(N)]\\n\\n\\n\\nl = 1\\n\\np = a[0] - 1\\n\\n\\n\\nif a[0] == 2:\\n\\n print(l)\\n\\n sys.exit()\\n\\n\\n\\nwhile l < int(1e6):\\n\\n l += 1\\n\\n if a[p] == 2:\\n\\n print(l)\\n\\n break\\n\\n else:\\n\\n p = a[p] - 1\\n\\nelse:\\n\\n print((-1))',\n", + " 'target': 'import sys\\n\\n\\n\\nN = int(eval(input()))\\n\\na = [int(eval(input())) for _ in range(N)]\\n\\n\\n\\nl = 1\\n\\np = a[0] - 1\\n\\n\\n\\nif a[0] == 2:\\n\\n print(l)\\n\\n sys.exit()\\n\\n\\n\\nwhile l < int(2e5):\\n\\n l += 1\\n\\n if a[p] == 2:\\n\\n print(l)\\n\\n break\\n\\n else:\\n\\n p = a[p] - 1\\n\\nelse:\\n\\n print((-1))',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 280,\n", + " 'code_v1_num_chars': 280,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nN = int(eval(input()))\\na = [int(eval(input())) for _ in range(N)]\\nl = 1\\np = a[0] - 1\\nif a[0] == 2:\\n print(l)\\n sys.exit()\\nwhile l < int(1e6):\\n l += 1\\n if a[p] == 2:\\n print(l)\\n break\\n else:\\n p = a[p] - 1\\nelse:\\n print((-1))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nN = int(eval(input()))\\na = [int(eval(input())) for _ in range(N)]\\nl = 1\\np = a[0] - 1\\nif a[0] == 2:\\n print(l)\\n sys.exit()\\nwhile l < int(2e5):\\n l += 1\\n if a[p] == 2:\\n print(l)\\n break\\n else:\\n p = a[p] - 1\\nelse:\\n print((-1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-while l < int(1e6):', '+while l < int(2e5):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.1321929171,\n", + " 'measured_runtime_v1': 0.4105077217,\n", + " 'runtime_lift': 2.7580307442,\n", + " 'key': ['s142356798', 's532531190']},\n", + " {'user_id': 'u414877092',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's477602976',\n", + " 'submission_id_v1': 's500304823',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 31,\n", + " 'memory_v0': 4024,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.52,\n", + " 'input': 'import math\\n\\nn=int(eval(input()))\\n\\nprint((math.factorial(n)%(10**9+7)))',\n", + " 'target': 'N=int(eval(input()))\\n\\ndef fact(n):\\n\\n val=1\\n\\n for i in range(2,n+1):\\n\\n val*=i\\n\\n val%=1000000007\\n\\n return val\\n\\nprint((fact(N)))',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 63,\n", + " 'code_v1_num_chars': 140,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nprint((math.factorial(n) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\n\\n\\ndef fact(n):\\n val = 1\\n for i in range(2, n + 1):\\n val *= i\\n val %= 1000000007\\n return val\\n\\n\\nprint((fact(N)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 62.5,\n", + " 'diff': ['-import math',\n", + " '+N = int(eval(input()))',\n", + " '-n = int(eval(input()))',\n", + " '-print((math.factorial(n) % (10**9 + 7)))',\n", + " '+',\n", + " '+def fact(n):',\n", + " '+ val = 1',\n", + " '+ for i in range(2, n + 1):',\n", + " '+ val *= i',\n", + " '+ val %= 1000000007',\n", + " '+ return val',\n", + " '+',\n", + " '+',\n", + " '+print((fact(N)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5394072673,\n", + " 'measured_runtime_v1': 0.259771318,\n", + " 'runtime_lift': 2.0764696871,\n", + " 'key': ['s477602976', 's500304823']},\n", + " {'user_id': 'u832039789',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's033280454',\n", + " 'submission_id_v1': 's671785140',\n", + " 'cpu_time_v0': 346,\n", + " 'cpu_time_v1': 137,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 60.4,\n", + " 'input': \"import math\\n\\n\\n\\na,b,c,x,y = list(map(int,input().split()))\\n\\n\\n\\n# cを全探索？\\n\\nres = float('inf')\\n\\nfor i in range(max(x,y)*2+1):\\n\\n money = i * c\\n\\n if i/2= 0 and Z <= K:\\n\\n ans += 1\\n\\nprint(ans) ',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 217,\n", + " 'code_v1_num_chars': 184,\n", + " 'code_v0_no_empty_lines': '# ABC951B/Sum_of_Three_Integers\\nK, S = list(map(int, input().split()))\\nans = 0\\nfor x in range(0, K + 1):\\n for y in range(0, K + 1):\\n z = S - x - y\\n if 0 <= z and z <= K:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'K, S = list(map(int, input().split()))\\nans = 0\\nfor X in range(K + 1):\\n for Y in range(K + 1):\\n Z = S - X - Y\\n if Z >= 0 and Z <= K:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-# ABC951B/Sum_of_Three_Integers',\n", + " '-for x in range(0, K + 1):',\n", + " '- for y in range(0, K + 1):',\n", + " '- z = S - x - y',\n", + " '- if 0 <= z and z <= K:',\n", + " '+for X in range(K + 1):',\n", + " '+ for Y in range(K + 1):',\n", + " '+ Z = S - X - Y',\n", + " '+ if Z >= 0 and Z <= K:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2646004359,\n", + " 'measured_runtime_v1': 0.0728798735,\n", + " 'runtime_lift': 3.6306379676,\n", + " 'key': ['s258964318', 's303783261']},\n", + " {'user_id': 'u379136995',\n", + " 'problem_id': 'p02921',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's545345968',\n", + " 'submission_id_v1': 's346622706',\n", + " 'cpu_time_v0': 27,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.04,\n", + " 'input': 's=eval(input())\\n\\nt=eval(input())\\n\\nans=0\\n\\nif s[0]==t[0]:\\n\\n ans+=1\\n\\nif s[1]==t[1]:\\n\\n ans+=1\\n\\nif s[2]==t[2]:\\n\\n ans+=1\\n\\nprint(ans)\\n',\n", + " 'target': 's=eval(input())\\n\\nt=eval(input())\\n\\nans=0\\n\\nfor i in range(0,3):\\n\\n if s[i]==t[i]:\\n\\n ans+=1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 124,\n", + " 'code_v1_num_chars': 98,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\nt = eval(input())\\nans = 0\\nif s[0] == t[0]:\\n ans += 1\\nif s[1] == t[1]:\\n ans += 1\\nif s[2] == t[2]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nt = eval(input())\\nans = 0\\nfor i in range(0, 3):\\n if s[i] == t[i]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.0,\n", + " 'diff': ['-if s[0] == t[0]:',\n", + " '- ans += 1',\n", + " '-if s[1] == t[1]:',\n", + " '- ans += 1',\n", + " '-if s[2] == t[2]:',\n", + " '- ans += 1',\n", + " '+for i in range(0, 3):',\n", + " '+ if s[i] == t[i]:',\n", + " '+ ans += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3561623907,\n", + " 'measured_runtime_v1': 0.2681128595,\n", + " 'runtime_lift': 1.3284047299,\n", + " 'key': ['s545345968', 's346622706']},\n", + " {'user_id': 'u624696727',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's196711845',\n", + " 'submission_id_v1': 's619004796',\n", + " 'cpu_time_v0': 338,\n", + " 'cpu_time_v1': 149,\n", + " 'memory_v0': 22124,\n", + " 'memory_v1': 12220,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.92,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\nint1 = lambda x: int(x) - 1\\n\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\n\\nprintH = lambda x: print(\" \".join(map(str,x)))\\n\\ndef IS(): return sys.stdin.readline()[:-1]\\n\\ndef II(): return int(sys.stdin.readline())\\n\\ndef MI(): return map(int, sys.stdin.readline().split())\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\\n\\ndef LII(rows_number): return [II() for _ in range(rows_number)]\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\\n\\n\\n\\ndef main():\\n\\n\\tN = II()\\n\\n\\tX = LI()\\n\\n\\tX = np.array(X, dtype=\"int32\")\\n\\n\\tm = round(np.sum(X) / N)\\n\\n\\tprint(int(np.sum((X-m)**2)))\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n\\tmain()\\n',\n", + " 'target': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\nint1 = lambda x: int(x) - 1\\n\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\n\\nprintH = lambda x: print(\" \".join(map(str,x)))\\n\\ndef IS(): return sys.stdin.readline()[:-1]\\n\\ndef II(): return int(sys.stdin.readline())\\n\\ndef MI(): return map(int, sys.stdin.readline().split())\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\\n\\ndef LII(rows_number): return [II() for _ in range(rows_number)]\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\\n\\n\\n\\ndef main():\\n\\n\\tN = II()\\n\\n\\tX = LI()\\n\\n\\tX = np.array(X)\\n\\n\\tm = round(np.sum(X) / N)\\n\\n\\tprint(int(np.sum((X-m)**2)))\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n\\tmain()\\n',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 818,\n", + " 'code_v1_num_chars': 803,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**6)\\nint1 = lambda x: int(x) - 1\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\nprintH = lambda x: print(\" \".join(map(str, x)))\\n\\n\\ndef IS():\\n return sys.stdin.readline()[:-1]\\n\\n\\ndef II():\\n return int(sys.stdin.readline())\\n\\n\\ndef MI():\\n return map(int, sys.stdin.readline().split())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, sys.stdin.readline().split()))\\n\\n\\ndef LII(rows_number):\\n return [II() for _ in range(rows_number)]\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef LLI1(rows_number):\\n return [LI1() for _ in range(rows_number)]\\n\\n\\ndef main():\\n N = II()\\n X = LI()\\n X = np.array(X, dtype=\"int32\")\\n m = round(np.sum(X) / N)\\n print(int(np.sum((X - m) ** 2)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nsys.setrecursionlimit(10**6)\\nint1 = lambda x: int(x) - 1\\nprintV = lambda x: print(*x, sep=\"\\\\n\")\\nprintH = lambda x: print(\" \".join(map(str, x)))\\n\\n\\ndef IS():\\n return sys.stdin.readline()[:-1]\\n\\n\\ndef II():\\n return int(sys.stdin.readline())\\n\\n\\ndef MI():\\n return map(int, sys.stdin.readline().split())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, sys.stdin.readline().split()))\\n\\n\\ndef LII(rows_number):\\n return [II() for _ in range(rows_number)]\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef LLI1(rows_number):\\n return [LI1() for _ in range(rows_number)]\\n\\n\\ndef main():\\n N = II()\\n X = LI()\\n X = np.array(X)\\n m = round(np.sum(X) / N)\\n print(int(np.sum((X - m) ** 2)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- X = np.array(X, dtype=\"int32\")', '+ X = np.array(X)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.6973853536,\n", + " 'measured_runtime_v1': 1.5154907587,\n", + " 'runtime_lift': 1.7798758179,\n", + " 'key': ['s196711845', 's619004796']},\n", + " {'user_id': 'u484780899',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's524734651',\n", + " 'submission_id_v1': 's003316364',\n", + " 'cpu_time_v0': 684,\n", + " 'cpu_time_v1': 151,\n", + " 'memory_v0': 23488,\n", + " 'memory_v1': 13880,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 77.92,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(input())\\n\\n\\n\\nA = np.array([int(i) for i in input().split()])\\n\\n\\n\\nx = np.argsort(A)\\n\\nx += 1\\n\\n\\n\\nfor i in range(N):\\n\\n print(x[i], end=\" \")\\n\\n \\n\\nprint()\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\n\\n\\nA = [int(i) for i in input().split()]\\n\\n\\n\\nB = [0]*N\\n\\nfor i in range(N):\\n\\n B[A[i]-1] = i+1\\n\\n\\n\\nfor i in range(N):\\n\\n print((B[i]))\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 181,\n", + " 'code_v1_num_chars': 151,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(input())\\nA = np.array([int(i) for i in input().split()])\\nx = np.argsort(A)\\nx += 1\\nfor i in range(N):\\n print(x[i], end=\" \")\\nprint()\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [int(i) for i in input().split()]\\nB = [0] * N\\nfor i in range(N):\\n B[A[i] - 1] = i + 1\\nfor i in range(N):\\n print((B[i]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-N = int(input())',\n", + " '-A = np.array([int(i) for i in input().split()])',\n", + " '-x = np.argsort(A)',\n", + " '-x += 1',\n", + " '+N = int(eval(input()))',\n", + " '+A = [int(i) for i in input().split()]',\n", + " '+B = [0] * N',\n", + " '- print(x[i], end=\" \")',\n", + " '-print()',\n", + " '+ B[A[i] - 1] = i + 1',\n", + " '+for i in range(N):',\n", + " '+ print((B[i]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4031675689,\n", + " 'measured_runtime_v1': 0.1788432901,\n", + " 'runtime_lift': 7.8457937574,\n", + " 'key': ['s524734651', 's003316364']},\n", + " {'user_id': 'u216015528',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's221937243',\n", + " 'submission_id_v1': 's826522174',\n", + " 'cpu_time_v0': 984,\n", + " 'cpu_time_v1': 281,\n", + " 'memory_v0': 50312,\n", + " 'memory_v1': 30052,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 71.44,\n", + " 'input': \"#!/usr/bin/env python3\\n\\ndef main():\\n\\n import numpy as np\\n\\n\\n\\n N = int(eval(input()))\\n\\n happiness = [list(map(int, input().split())) for _ in range(N)]\\n\\n\\n\\n dp = np.zeros((N, 3), dtype=np.int64)\\n\\n dp[0] = happiness[0]\\n\\n for i in range(1, N):\\n\\n for a, yesterday in enumerate(dp[i - 1]):\\n\\n for b, today in enumerate(happiness[i]):\\n\\n if a == b:\\n\\n continue\\n\\n dp[i][b] = max(dp[i][b], yesterday + today)\\n\\n print((max(dp[-1])))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"#!/usr/bin/env python3\\n\\ndef main():\\n\\n N = int(eval(input()))\\n\\n happiness = [list(map(int, input().split())) for _ in range(N)]\\n\\n\\n\\n dp = [0, 0, 0]\\n\\n for a, b, c in happiness:\\n\\n dp = [max(dp[1], dp[2]) + a,\\n\\n max(dp[0], dp[2]) + b,\\n\\n max(dp[0], dp[1]) + c]\\n\\n print((max(dp)))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 543,\n", + " 'code_v1_num_chars': 358,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env python3\\ndef main():\\n import numpy as np\\n\\n N = int(eval(input()))\\n happiness = [list(map(int, input().split())) for _ in range(N)]\\n dp = np.zeros((N, 3), dtype=np.int64)\\n dp[0] = happiness[0]\\n for i in range(1, N):\\n for a, yesterday in enumerate(dp[i - 1]):\\n for b, today in enumerate(happiness[i]):\\n if a == b:\\n continue\\n dp[i][b] = max(dp[i][b], yesterday + today)\\n print((max(dp[-1])))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\ndef main():\\n N = int(eval(input()))\\n happiness = [list(map(int, input().split())) for _ in range(N)]\\n dp = [0, 0, 0]\\n for a, b, c in happiness:\\n dp = [max(dp[1], dp[2]) + a, max(dp[0], dp[2]) + b, max(dp[0], dp[1]) + c]\\n print((max(dp)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['- import numpy as np',\n", + " '-',\n", + " '- dp = np.zeros((N, 3), dtype=np.int64)',\n", + " '- dp[0] = happiness[0]',\n", + " '- for i in range(1, N):',\n", + " '- for a, yesterday in enumerate(dp[i - 1]):',\n", + " '- for b, today in enumerate(happiness[i]):',\n", + " '- if a == b:',\n", + " '- continue',\n", + " '- dp[i][b] = max(dp[i][b], yesterday + today)',\n", + " '- print((max(dp[-1])))',\n", + " '+ dp = [0, 0, 0]',\n", + " '+ for a, b, c in happiness:',\n", + " '+ dp = [max(dp[1], dp[2]) + a, max(dp[0], dp[2]) + b, max(dp[0], dp[1]) + c]',\n", + " '+ print((max(dp)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.24619206,\n", + " 'measured_runtime_v1': 0.1905300226,\n", + " 'runtime_lift': 6.5406598015,\n", + " 'key': ['s221937243', 's826522174']},\n", + " {'user_id': 'u497046426',\n", + " 'problem_id': 'p03164',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's932824364',\n", + " 'submission_id_v1': 's969626696',\n", + " 'cpu_time_v0': 1534,\n", + " 'cpu_time_v1': 582,\n", + " 'memory_v0': 170860,\n", + " 'memory_v1': 171120,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.06,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN, W = list(map(int, input().split()))\\n\\nitems = []\\n\\nfor _ in range(N):\\n\\n items.append(tuple(map(int, input().split())))\\n\\nv_max = sum([i[1] for i in items])\\n\\nINF = 10**12\\n\\ndp = np.array([[INF for j in range(v_max+1)] for _ in range(N+1)])\\n\\ndp[0, 0] = 0\\n\\nfor i in range(1, N+1):\\n\\n w, v = items[i-1]\\n\\n dp[i, :v] = dp[i-1, :v]\\n\\n dp[i, v:] = np.minimum(dp[i-1, :-v] + w, dp[i-1, v:])\\n\\nans = 0\\n\\nfor v in range(v_max, -1, -1):\\n\\n if dp[N][v] <= W:\\n\\n ans = v\\n\\n break\\n\\nprint(ans)',\n", + " 'target': 'N, W = list(map(int, input().split()))\\n\\nitems = []\\n\\nINF = 10**12\\n\\nfor _ in range(N):\\n\\n items.append(tuple(map(int, input().split())))\\n\\nMAX_V = sum([v for _, v in items])\\n\\ndp = [[INF for j in range(MAX_V+1)] for i in range(N+1)]\\n\\ndp[0][0] = 0\\n\\nfor i in range(1, N+1):\\n\\n w, v = items[i-1]\\n\\n for j in range(MAX_V+1):\\n\\n if j - v >= 0:\\n\\n dp[i][j] = min(dp[i-1][j-v] + w, dp[i-1][j])\\n\\n else:\\n\\n dp[i][j] = dp[i-1][j]\\n\\nfor v in range(MAX_V, -1, -1):\\n\\n if dp[N][v] <= W:\\n\\n break\\n\\nprint(v)',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 514,\n", + " 'code_v1_num_chars': 528,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, W = list(map(int, input().split()))\\nitems = []\\nfor _ in range(N):\\n items.append(tuple(map(int, input().split())))\\nv_max = sum([i[1] for i in items])\\nINF = 10**12\\ndp = np.array([[INF for j in range(v_max + 1)] for _ in range(N + 1)])\\ndp[0, 0] = 0\\nfor i in range(1, N + 1):\\n w, v = items[i - 1]\\n dp[i, :v] = dp[i - 1, :v]\\n dp[i, v:] = np.minimum(dp[i - 1, :-v] + w, dp[i - 1, v:])\\nans = 0\\nfor v in range(v_max, -1, -1):\\n if dp[N][v] <= W:\\n ans = v\\n break\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, W = list(map(int, input().split()))\\nitems = []\\nINF = 10**12\\nfor _ in range(N):\\n items.append(tuple(map(int, input().split())))\\nMAX_V = sum([v for _, v in items])\\ndp = [[INF for j in range(MAX_V + 1)] for i in range(N + 1)]\\ndp[0][0] = 0\\nfor i in range(1, N + 1):\\n w, v = items[i - 1]\\n for j in range(MAX_V + 1):\\n if j - v >= 0:\\n dp[i][j] = min(dp[i - 1][j - v] + w, dp[i - 1][j])\\n else:\\n dp[i][j] = dp[i - 1][j]\\nfor v in range(MAX_V, -1, -1):\\n if dp[N][v] <= W:\\n break\\nprint(v)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '+INF = 10**12',\n", + " '-v_max = sum([i[1] for i in items])',\n", + " '-INF = 10**12',\n", + " '-dp = np.array([[INF for j in range(v_max + 1)] for _ in range(N + 1)])',\n", + " '-dp[0, 0] = 0',\n", + " '+MAX_V = sum([v for _, v in items])',\n", + " '+dp = [[INF for j in range(MAX_V + 1)] for i in range(N + 1)]',\n", + " '+dp[0][0] = 0',\n", + " '- dp[i, :v] = dp[i - 1, :v]',\n", + " '- dp[i, v:] = np.minimum(dp[i - 1, :-v] + w, dp[i - 1, v:])',\n", + " '-ans = 0',\n", + " '-for v in range(v_max, -1, -1):',\n", + " '+ for j in range(MAX_V + 1):',\n", + " '+ if j - v >= 0:',\n", + " '+ dp[i][j] = min(dp[i - 1][j - v] + w, dp[i - 1][j])',\n", + " '+ else:',\n", + " '+ dp[i][j] = dp[i - 1][j]',\n", + " '+for v in range(MAX_V, -1, -1):',\n", + " '- ans = v',\n", + " '-print(ans)',\n", + " '+print(v)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3271882429,\n", + " 'measured_runtime_v1': 0.2112405212,\n", + " 'runtime_lift': 6.2828298063,\n", + " 'key': ['s932824364', 's969626696']},\n", + " {'user_id': 'u285891772',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's323914382',\n", + " 'submission_id_v1': 's323368336',\n", + " 'cpu_time_v0': 910,\n", + " 'cpu_time_v1': 524,\n", + " 'memory_v0': 69644,\n", + " 'memory_v1': 18184,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 42.42,\n", + " 'input': 'import sys, re\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\n\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\n\\nfrom operator import itemgetter, mul\\n\\nfrom copy import deepcopy\\n\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\n\\nfrom bisect import bisect, bisect_left, insort, insort_left\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import reduce, lru_cache\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef INT(): return int(input())\\n\\ndef MAP(): return map(int, input().split())\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\ndef TUPLE(): return tuple(map(int, input().split()))\\n\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float(\\'inf\\')\\n\\nmod = 10 ** 9 + 7 \\n\\n#mod = 998244353\\n\\nfrom decimal import *\\n\\n#import numpy as np\\n\\n#decimal.getcontext().prec = 10\\n\\n\\n\\nX, Y, Z, K = MAP()\\n\\nA = sorted(LIST(), reverse = True)\\n\\nB = sorted(LIST(), reverse = True)\\n\\nC = sorted(LIST(), reverse = True)\\n\\n\\n\\nAB = []\\n\\nfor i in range(X):\\n\\n\\tfor j in range(Y):\\n\\n\\t\\tAB.append(A[i]+B[j])\\n\\n\\n\\nAB.sort(reverse = True)\\n\\nAB = AB[:3000]\\n\\nABC = sorted([C[0]+AB[i] for i in range(min(3000, X*Y))], reverse = True)\\n\\n\\n\\nfor j in range(1, Z):\\n\\n\\tABC_tmp = sorted([C[j]+AB[i] for i in range(min(3000, X*Y))])\\n\\n\\tABC += ABC_tmp\\n\\n\\tABC.sort(reverse = True)\\n\\n\\tABC = ABC[:3000]\\n\\n\\n\\nprint(*ABC[:K], sep= \"\\\\n\")\\n\\n\\n',\n", + " 'target': \"import sys, re\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\n\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\n\\nfrom operator import itemgetter, mul\\n\\nfrom copy import deepcopy\\n\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\n\\nfrom bisect import bisect, bisect_left, insort, insort_left\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import reduce, lru_cache\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\ndef TUPLE(): return tuple(map(int, input().split()))\\n\\ndef ZIP(n): return list(zip(*(MAP() for _ in range(n))))\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float('inf')\\n\\nmod = 10 ** 9 + 7 \\n\\n#mod = 998244353\\n\\nfrom decimal import *\\n\\n#import numpy as np\\n\\n#decimal.getcontext().prec = 10\\n\\n\\n\\nX, Y, Z, K = MAP()\\n\\nA = sorted(LIST(), reverse = True)\\n\\nB = sorted(LIST(), reverse = True)\\n\\nC = sorted(LIST(), reverse = True)\\n\\n\\n\\nans = []\\n\\nfor i in range(X):\\n\\n\\tfor j in range(Y):\\n\\n\\t\\tfor k in range(Z):\\n\\n\\t\\t\\tif (i+1)*(j+1)*(k+1) <= K:\\n\\n\\t\\t\\t\\tans.append(A[i]+B[j]+C[k])\\n\\n\\t\\t\\telse:\\n\\n\\t\\t\\t\\tbreak\\n\\n\\n\\nfor a in sorted(ans)[::-1][:K]:\\n\\n\\tprint(a)\\n\",\n", + " 'code_v0_loc': 46,\n", + " 'code_v1_loc': 40,\n", + " 'code_v0_num_chars': 1517,\n", + " 'code_v1_num_chars': 1344,\n", + " 'code_v0_no_empty_lines': 'import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import (\\n ceil,\\n sqrt,\\n hypot,\\n factorial,\\n pi,\\n sin,\\n cos,\\n tan,\\n asin,\\n acos,\\n atan,\\n radians,\\n degrees,\\n log2,\\n gcd,\\n)\\nfrom itertools import (\\n accumulate,\\n permutations,\\n combinations,\\n combinations_with_replacement,\\n product,\\n groupby,\\n)\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce, lru_cache\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef INT():\\n return int(input())\\n\\n\\ndef MAP():\\n return map(int, input().split())\\n\\n\\ndef LIST():\\n return list(map(int, input().split()))\\n\\n\\ndef TUPLE():\\n return tuple(map(int, input().split()))\\n\\n\\ndef ZIP(n):\\n return zip(*(MAP() for _ in range(n)))\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nmod = 10**9 + 7\\n# mod = 998244353\\nfrom decimal import *\\n\\n# import numpy as np\\n# decimal.getcontext().prec = 10\\nX, Y, Z, K = MAP()\\nA = sorted(LIST(), reverse=True)\\nB = sorted(LIST(), reverse=True)\\nC = sorted(LIST(), reverse=True)\\nAB = []\\nfor i in range(X):\\n for j in range(Y):\\n AB.append(A[i] + B[j])\\nAB.sort(reverse=True)\\nAB = AB[:3000]\\nABC = sorted([C[0] + AB[i] for i in range(min(3000, X * Y))], reverse=True)\\nfor j in range(1, Z):\\n ABC_tmp = sorted([C[j] + AB[i] for i in range(min(3000, X * Y))])\\n ABC += ABC_tmp\\n ABC.sort(reverse=True)\\n ABC = ABC[:3000]\\nprint(*ABC[:K], sep=\"\\\\n\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import (\\n ceil,\\n sqrt,\\n hypot,\\n factorial,\\n pi,\\n sin,\\n cos,\\n tan,\\n asin,\\n acos,\\n atan,\\n radians,\\n degrees,\\n log2,\\n gcd,\\n)\\nfrom itertools import (\\n accumulate,\\n permutations,\\n combinations,\\n combinations_with_replacement,\\n product,\\n groupby,\\n)\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce, lru_cache\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST():\\n return list(map(int, input().split()))\\n\\n\\ndef TUPLE():\\n return tuple(map(int, input().split()))\\n\\n\\ndef ZIP(n):\\n return list(zip(*(MAP() for _ in range(n))))\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nmod = 10**9 + 7\\n# mod = 998244353\\nfrom decimal import *\\n\\n# import numpy as np\\n# decimal.getcontext().prec = 10\\nX, Y, Z, K = MAP()\\nA = sorted(LIST(), reverse=True)\\nB = sorted(LIST(), reverse=True)\\nC = sorted(LIST(), reverse=True)\\nans = []\\nfor i in range(X):\\n for j in range(Y):\\n for k in range(Z):\\n if (i + 1) * (j + 1) * (k + 1) <= K:\\n ans.append(A[i] + B[j] + C[k])\\n else:\\n break\\nfor a in sorted(ans)[::-1][:K]:\\n print(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.0434782609,\n", + " 'diff': ['- return int(input())',\n", + " '+ return int(eval(input()))',\n", + " '- return map(int, input().split())',\n", + " '+ return list(map(int, input().split()))',\n", + " '- return zip(*(MAP() for _ in range(n)))',\n", + " '+ return list(zip(*(MAP() for _ in range(n))))',\n", + " '-AB = []',\n", + " '+ans = []',\n", + " '- AB.append(A[i] + B[j])',\n", + " '-AB.sort(reverse=True)',\n", + " '-AB = AB[:3000]',\n", + " '-ABC = sorted([C[0] + AB[i] for i in range(min(3000, X * Y))], reverse=True)',\n", + " '-for j in range(1, Z):',\n", + " '- ABC_tmp = sorted([C[j] + AB[i] for i in range(min(3000, X * Y))])',\n", + " '- ABC += ABC_tmp',\n", + " '- ABC.sort(reverse=True)',\n", + " '- ABC = ABC[:3000]',\n", + " '-print(*ABC[:K], sep=\"\\\\n\")',\n", + " '+ for k in range(Z):',\n", + " '+ if (i + 1) * (j + 1) * (k + 1) <= K:',\n", + " '+ ans.append(A[i] + B[j] + C[k])',\n", + " '+ else:',\n", + " '+ break',\n", + " '+for a in sorted(ans)[::-1][:K]:',\n", + " '+ print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3039683881,\n", + " 'measured_runtime_v1': 0.2292593994,\n", + " 'runtime_lift': 1.3258709952,\n", + " 'key': ['s323914382', 's323368336']},\n", + " {'user_id': 'u141786930',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's650122850',\n", + " 'submission_id_v1': 's038671040',\n", + " 'cpu_time_v0': 401,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 19980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 95.76,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nX = np.array(list(int(x) for x in input().split()))\\n\\nm = round(np.mean(X))\\n\\n\\n\\nprint((int(sum((X-m)**2))))',\n", + " 'target': 'N = int(eval(input()))\\n\\nX = list(int(x) for x in input().split())\\n\\np = round(sum(X)/len(X))\\n\\nans = 0\\n\\n\\n\\nfor i in range(N):\\n\\n ans += (X[i] - p)**2\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 143,\n", + " 'code_v1_num_chars': 156,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nX = np.array(list(int(x) for x in input().split()))\\nm = round(np.mean(X))\\nprint((int(sum((X - m) ** 2))))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nX = list(int(x) for x in input().split())\\np = round(sum(X) / len(X))\\nans = 0\\nfor i in range(N):\\n ans += (X[i] - p) ** 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-X = np.array(list(int(x) for x in input().split()))',\n", + " '-m = round(np.mean(X))',\n", + " '-print((int(sum((X - m) ** 2))))',\n", + " '+X = list(int(x) for x in input().split())',\n", + " '+p = round(sum(X) / len(X))',\n", + " '+ans = 0',\n", + " '+for i in range(N):',\n", + " '+ ans += (X[i] - p) ** 2',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.840335056,\n", + " 'measured_runtime_v1': 0.2786408437,\n", + " 'runtime_lift': 6.6046851977,\n", + " 'key': ['s650122850', 's038671040']},\n", + " {'user_id': 'u761529120',\n", + " 'problem_id': 'p03634',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's135133436',\n", + " 'submission_id_v1': 's083939253',\n", + " 'cpu_time_v0': 1459,\n", + " 'cpu_time_v1': 754,\n", + " 'memory_v0': 135740,\n", + " 'memory_v1': 94752,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.32,\n", + " 'input': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\n\\ndef dfs(v,p,d):\\n\\n for i, j in tree[v]:\\n\\n if i != p:\\n\\n depth[i] = d + j\\n\\n dfs(i,v,d+j)\\n\\n\\n\\nN = int(eval(input()))\\n\\n\\n\\ntree = [[] for _ in range(N)]\\n\\n\\n\\nfor i in range(N-1):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n tree[a].append((b,c))\\n\\n tree[b].append((a,c))\\n\\n\\n\\nQ, K = list(map(int, input().split()))\\n\\n\\n\\ndepth = [0 for i in range(N)]\\n\\ndepth[K-1] = 0\\n\\n\\n\\ndfs(K-1,-1,0)\\n\\n\\n\\nfor _ in range(Q):\\n\\n x, y = list(map(int, input().split()))\\n\\n print((depth[x-1] + depth[y-1]))',\n", + " 'target': 'import heapq\\n\\nimport sys\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef dijkstra(s, edge, N):\\n\\n d = [float(\\'inf\\')] * N\\n\\n used = [True] * N\\n\\n d[s] = 0\\n\\n used[s] = False\\n\\n edgelist = []\\n\\n for a, b in edge[s]:\\n\\n heapq.heappush(edgelist, a * (10 ** 6) + b)\\n\\n while len(edgelist):\\n\\n minedge = heapq.heappop(edgelist)\\n\\n\\n\\n if not used[minedge%(10 ** 6)]:\\n\\n continue\\n\\n v = minedge % (10 ** 6)\\n\\n d[v] = minedge // (10 ** 6)\\n\\n used[v] = False\\n\\n for e in edge[v]:\\n\\n if used[e[1]]:\\n\\n heapq.heappush(edgelist, (e[0] + d[v]) * (10 ** 6) + e[1])\\n\\n return d\\n\\n\\n\\ndef main():\\n\\n N = int(eval(input()))\\n\\n edge = [[] for _ in range(N)]\\n\\n for _ in range(N-1):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n edge[a].append([c,b])\\n\\n edge[b].append([c,a])\\n\\n Q, K = list(map(int, input().split()))\\n\\n K -= 1\\n\\n d = dijkstra(K, edge, N)\\n\\n for _ in range(Q):\\n\\n x, y = list(map(int, input().split()))\\n\\n x -= 1\\n\\n y -= 1\\n\\n print((d[x] + d[y]))\\n\\n\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 48,\n", + " 'code_v0_num_chars': 553,\n", + " 'code_v1_num_chars': 1130,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\n\\n\\ndef dfs(v, p, d):\\n for i, j in tree[v]:\\n if i != p:\\n depth[i] = d + j\\n dfs(i, v, d + j)\\n\\n\\nN = int(eval(input()))\\ntree = [[] for _ in range(N)]\\nfor i in range(N - 1):\\n a, b, c = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n tree[a].append((b, c))\\n tree[b].append((a, c))\\nQ, K = list(map(int, input().split()))\\ndepth = [0 for i in range(N)]\\ndepth[K - 1] = 0\\ndfs(K - 1, -1, 0)\\nfor _ in range(Q):\\n x, y = list(map(int, input().split()))\\n print((depth[x - 1] + depth[y - 1]))\\n',\n", + " 'code_v1_no_empty_lines': 'import heapq\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef dijkstra(s, edge, N):\\n d = [float(\"inf\")] * N\\n used = [True] * N\\n d[s] = 0\\n used[s] = False\\n edgelist = []\\n for a, b in edge[s]:\\n heapq.heappush(edgelist, a * (10**6) + b)\\n while len(edgelist):\\n minedge = heapq.heappop(edgelist)\\n if not used[minedge % (10**6)]:\\n continue\\n v = minedge % (10**6)\\n d[v] = minedge // (10**6)\\n used[v] = False\\n for e in edge[v]:\\n if used[e[1]]:\\n heapq.heappush(edgelist, (e[0] + d[v]) * (10**6) + e[1])\\n return d\\n\\n\\ndef main():\\n N = int(eval(input()))\\n edge = [[] for _ in range(N)]\\n for _ in range(N - 1):\\n a, b, c = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n edge[a].append([c, b])\\n edge[b].append([c, a])\\n Q, K = list(map(int, input().split()))\\n K -= 1\\n d = dijkstra(K, edge, N)\\n for _ in range(Q):\\n x, y = list(map(int, input().split()))\\n x -= 1\\n y -= 1\\n print((d[x] + d[y]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 39.5833333333,\n", + " 'diff': ['+import heapq',\n", + " '-sys.setrecursionlimit(10**6)',\n", + " '+input = sys.stdin.readline',\n", + " '-def dfs(v, p, d):',\n", + " '- for i, j in tree[v]:',\n", + " '- if i != p:',\n", + " '- depth[i] = d + j',\n", + " '- dfs(i, v, d + j)',\n", + " '+def dijkstra(s, edge, N):',\n", + " '+ d = [float(\"inf\")] * N',\n", + " '+ used = [True] * N',\n", + " '+ d[s] = 0',\n", + " '+ used[s] = False',\n", + " '+ edgelist = []',\n", + " '+ for a, b in edge[s]:',\n", + " '+ heapq.heappush(edgelist, a * (10**6) + b)',\n", + " '+ while len(edgelist):',\n", + " '+ minedge = heapq.heappop(edgelist)',\n", + " '+ if not used[minedge % (10**6)]:',\n", + " '+ continue',\n", + " '+ v = minedge % (10**6)',\n", + " '+ d[v] = minedge // (10**6)',\n", + " '+ used[v] = False',\n", + " '+ for e in edge[v]:',\n", + " '+ if used[e[1]]:',\n", + " '+ heapq.heappush(edgelist, (e[0] + d[v]) * (10**6) + e[1])',\n", + " '+ return d',\n", + " '-N = int(eval(input()))',\n", + " '-tree = [[] for _ in range(N)]',\n", + " '-for i in range(N - 1):',\n", + " '- a, b, c = list(map(int, input().split()))',\n", + " '- a -= 1',\n", + " '- b -= 1',\n", + " '- tree[a].append((b, c))',\n", + " '- tree[b].append((a, c))',\n", + " '-Q, K = list(map(int, input().split()))',\n", + " '-depth = [0 for i in range(N)]',\n", + " '-depth[K - 1] = 0',\n", + " '-dfs(K - 1, -1, 0)',\n", + " '-for _ in range(Q):',\n", + " '- x, y = list(map(int, input().split()))',\n", + " '- print((depth[x - 1] + depth[y - 1]))',\n", + " '+def main():',\n", + " '+ N = int(eval(input()))',\n", + " '+ edge = [[] for _ in range(N)]',\n", + " '+ for _ in range(N - 1):',\n", + " '+ a, b, c = list(map(int, input().split()))',\n", + " '+ a -= 1',\n", + " '+ b -= 1',\n", + " '+ edge[a].append([c, b])',\n", + " '+ edge[b].append([c, a])',\n", + " '+ Q, K = list(map(int, input().split()))',\n", + " '+ K -= 1',\n", + " '+ d = dijkstra(K, edge, N)',\n", + " '+ for _ in range(Q):',\n", + " '+ x, y = list(map(int, input().split()))',\n", + " '+ x -= 1',\n", + " '+ y -= 1',\n", + " '+ print((d[x] + d[y]))',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5217886055,\n", + " 'measured_runtime_v1': 0.3235212803,\n", + " 'runtime_lift': 1.6128416807,\n", + " 'key': ['s135133436', 's083939253']},\n", + " {'user_id': 'u578323547',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's188140590',\n", + " 'submission_id_v1': 's074739481',\n", + " 'cpu_time_v0': 1208,\n", + " 'cpu_time_v1': 136,\n", + " 'memory_v0': 9100,\n", + " 'memory_v1': 9028,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.74,\n", + " 'input': 'x = int(eval(input()))\\n\\n\\n\\nfor a in range(10**4):\\n\\n for b in range(10**4):\\n\\n if(a**5 + b**5 == x):\\n\\n print((a, -b))\\n\\n break\\n\\n elif(a**5 - b**5 == x):\\n\\n print((a, b))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break',\n", + " 'target': 'x = int(eval(input()))\\n\\n\\n\\nfor a in range(10**3):\\n\\n for b in range(10**3):\\n\\n if(a**5 + b**5 == x):\\n\\n print((a, -b))\\n\\n break\\n\\n elif(a**5 - b**5 == x):\\n\\n print((a, b))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 263,\n", + " 'code_v1_num_chars': 264,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nfor a in range(10**4):\\n for b in range(10**4):\\n if a**5 + b**5 == x:\\n print((a, -b))\\n break\\n elif a**5 - b**5 == x:\\n print((a, b))\\n break\\n else:\\n continue\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nfor a in range(10**3):\\n for b in range(10**3):\\n if a**5 + b**5 == x:\\n print((a, -b))\\n break\\n elif a**5 - b**5 == x:\\n print((a, b))\\n break\\n else:\\n continue\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for a in range(10**4):',\n", + " '- for b in range(10**4):',\n", + " '+for a in range(10**3):',\n", + " '+ for b in range(10**3):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4177670181,\n", + " 'measured_runtime_v1': 0.3141400119,\n", + " 'runtime_lift': 1.3298752221,\n", + " 'key': ['s188140590', 's074739481']},\n", + " {'user_id': 'u134019875',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's983655328',\n", + " 'submission_id_v1': 's754374761',\n", + " 'cpu_time_v0': 231,\n", + " 'cpu_time_v1': 36,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.42,\n", + " 'input': 'import math\\n\\n\\n\\nn = int(eval(input()))\\n\\nprint((math.factorial(n) % (10 ** 9 + 7)))',\n", + " 'target': 'n = int(eval(input()))\\n\\np = 1\\n\\nfor i in range(1, n + 1):\\n\\n p = p * i % (10 ** 9 + 7)\\n\\nprint(p)',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 73,\n", + " 'code_v1_num_chars': 89,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nprint((math.factorial(n) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\np = 1\\nfor i in range(1, n + 1):\\n p = p * i % (10**9 + 7)\\nprint(p)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(n) % (10**9 + 7)))',\n", + " '+p = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ p = p * i % (10**9 + 7)',\n", + " '+print(p)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1349290106,\n", + " 'measured_runtime_v1': 0.0997186968,\n", + " 'runtime_lift': 1.3530964092,\n", + " 'key': ['s983655328', 's754374761']},\n", + " {'user_id': 'u811841526',\n", + " 'problem_id': 'p02390',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's941329471',\n", + " 'submission_id_v1': 's549187322',\n", + " 'cpu_time_v0': 40,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 7664,\n", + " 'memory_v1': 5592,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': \"s = int(eval(input()))\\n\\nm, s = s // 60, s % 60\\n\\nh, m = m // 60, m % 60\\n\\nprint((':'.join(map(str, [h,m,s]))))\",\n", + " 'target': \"s = int(eval(input()))\\n\\n\\n\\nsecond = s % 60\\n\\ns = s // 60\\n\\nmin = s % 60\\n\\nhour = s // 60\\n\\n\\n\\nprint(f'{hour}:{min}:{second}')\\n\",\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 100,\n", + " 'code_v1_num_chars': 114,\n", + " 'code_v0_no_empty_lines': 's = int(eval(input()))\\nm, s = s // 60, s % 60\\nh, m = m // 60, m % 60\\nprint((\":\".join(map(str, [h, m, s]))))\\n',\n", + " 'code_v1_no_empty_lines': 's = int(eval(input()))\\nsecond = s % 60\\ns = s // 60\\nmin = s % 60\\nhour = s // 60\\nprint(f\"{hour}:{min}:{second}\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-m, s = s // 60, s % 60',\n", + " '-h, m = m // 60, m % 60',\n", + " '-print((\":\".join(map(str, [h, m, s]))))',\n", + " '+second = s % 60',\n", + " '+s = s // 60',\n", + " '+min = s % 60',\n", + " '+hour = s // 60',\n", + " '+print(f\"{hour}:{min}:{second}\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1672595444,\n", + " 'measured_runtime_v1': 0.0066597962,\n", + " 'runtime_lift': 25.1148140492,\n", + " 'key': ['s941329471', 's549187322']},\n", + " {'user_id': 'u018679195',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's992615685',\n", + " 'submission_id_v1': 's822858934',\n", + " 'cpu_time_v0': 232,\n", + " 'cpu_time_v1': 36,\n", + " 'memory_v0': 4024,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.48,\n", + " 'input': 'import math\\n\\nx = int(eval(input()))\\n\\nprint((math.factorial(x) % (10**9 + 7)))',\n", + " 'target': 'M = 1000000007\\n\\nn=int(eval(input()))\\n\\nf = 1\\n\\nfor i in range(1, n + 1): \\n\\n f = (f * i) % M \\n\\nprint(f)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 69,\n", + " 'code_v1_num_chars': 98,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nx = int(eval(input()))\\nprint((math.factorial(x) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'M = 1000000007\\nn = int(eval(input()))\\nf = 1\\nfor i in range(1, n + 1):\\n f = (f * i) % M\\nprint(f)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-x = int(eval(input()))',\n", + " '-print((math.factorial(x) % (10**9 + 7)))',\n", + " '+M = 1000000007',\n", + " '+n = int(eval(input()))',\n", + " '+f = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ f = (f * i) % M',\n", + " '+print(f)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5256081567,\n", + " 'measured_runtime_v1': 0.2486211307,\n", + " 'runtime_lift': 2.1140928576,\n", + " 'key': ['s992615685', 's822858934']},\n", + " {'user_id': 'u794910686',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's844467922',\n", + " 'submission_id_v1': 's428626489',\n", + " 'cpu_time_v0': 148,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12496,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.16,\n", + " 'input': 'import numpy as np\\n\\n\\n\\neval(input())\\n\\nA = np.array(list(map(int, input().split())))\\n\\n\\n\\nans = 0\\n\\nwhile(all(A%2==0)):\\n\\n A = A/2\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'eval(input())\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nans = 0\\n\\nwhile all(a%2==0 for a in A):\\n\\n A=[a/2 for a in A]\\n\\n ans += 1\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 150,\n", + " 'code_v1_num_chars': 138,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\neval(input())\\nA = np.array(list(map(int, input().split())))\\nans = 0\\nwhile all(A % 2 == 0):\\n A = A / 2\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'eval(input())\\nA = list(map(int, input().split()))\\nans = 0\\nwhile all(a % 2 == 0 for a in A):\\n A = [a / 2 for a in A]\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.array(list(map(int, input().split())))',\n", + " '+A = list(map(int, input().split()))',\n", + " '-while all(A % 2 == 0):',\n", + " '- A = A / 2',\n", + " '+while all(a % 2 == 0 for a in A):',\n", + " '+ A = [a / 2 for a in A]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3495693932,\n", + " 'measured_runtime_v1': 0.2052214348,\n", + " 'runtime_lift': 6.5761619599,\n", + " 'key': ['s844467922', 's428626489']},\n", + " {'user_id': 'u826929627',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's202497340',\n", + " 'submission_id_v1': 's462008938',\n", + " 'cpu_time_v0': 1254,\n", + " 'cpu_time_v1': 403,\n", + " 'memory_v0': 42120,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 67.86,\n", + " 'input': 'N = int(eval(input()))\\n\\nABC = []\\n\\n\\n\\nfor n in range(N):\\n\\n ABC.append(list(map(int, input().split())))\\n\\n\\n\\nimport numpy as np\\n\\nABC = np.array(ABC)\\n\\n\\n\\n## 「日付」、「選択した行動」ごとの幸福度の最大値を格納するarray\\n\\nhp=np.zeros((N,3),dtype=int)\\n\\nhp[0] = ABC[0]\\n\\n\\n\\nfor n in range(1,N):# 日単位でのループ\\n\\n for c in range(3): # 選択肢ごとのループ\\n\\n ## n日にcを選択した場合の幸福度。つまり前日はc以外を選択している\\n\\n if c == 0:\\n\\n hp[n][0] = max(hp[n-1][1],hp[n-1][2]) + ABC[n][0]\\n\\n elif c == 1:\\n\\n hp[n][1] = max(hp[n-1][0],hp[n-1][2]) + ABC[n][1]\\n\\n elif c == 2:\\n\\n hp[n][2] = max(hp[n-1][0],hp[n-1][1]) + ABC[n][2]\\n\\n\\n\\n\\n\\nans = max(hp[-1])\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\n\\n\\ndpa,dpb,dpc = 0,0,0\\n\\nfor n in range(N):\\n\\n a,b,c = list(map(int, input().split())) \\n\\n dpa,dpb,dpc = max(dpb+a,dpc+a),max(dpa+b,dpc+b),max(dpa+c,dpb+c)\\n\\n \\n\\nans = max(dpa,dpb,dpc)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 591,\n", + " 'code_v1_num_chars': 206,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nABC = []\\nfor n in range(N):\\n ABC.append(list(map(int, input().split())))\\nimport numpy as np\\n\\nABC = np.array(ABC)\\n## 「日付」、「選択した行動」ごとの幸福度の最大値を格納するarray\\nhp = np.zeros((N, 3), dtype=int)\\nhp[0] = ABC[0]\\nfor n in range(1, N): # 日単位でのループ\\n for c in range(3): # 選択肢ごとのループ\\n ## n日にcを選択した場合の幸福度。つまり前日はc以外を選択している\\n if c == 0:\\n hp[n][0] = max(hp[n - 1][1], hp[n - 1][2]) + ABC[n][0]\\n elif c == 1:\\n hp[n][1] = max(hp[n - 1][0], hp[n - 1][2]) + ABC[n][1]\\n elif c == 2:\\n hp[n][2] = max(hp[n - 1][0], hp[n - 1][1]) + ABC[n][2]\\nans = max(hp[-1])\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\ndpa, dpb, dpc = 0, 0, 0\\nfor n in range(N):\\n a, b, c = list(map(int, input().split()))\\n dpa, dpb, dpc = max(dpb + a, dpc + a), max(dpa + b, dpc + b), max(dpa + c, dpb + c)\\nans = max(dpa, dpb, dpc)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 65.3846153846,\n", + " 'diff': ['-ABC = []',\n", + " '+dpa, dpb, dpc = 0, 0, 0',\n", + " '- ABC.append(list(map(int, input().split())))',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-ABC = np.array(ABC)',\n", + " '-## 「日付」、「選択した行動」ごとの幸福度の最大値を格納するarray',\n", + " '-hp = np.zeros((N, 3), dtype=int)',\n", + " '-hp[0] = ABC[0]',\n", + " '-for n in range(1, N): # 日単位でのループ',\n", + " '- for c in range(3): # 選択肢ごとのループ',\n", + " '- ## n日にcを選択した場合の幸福度。つまり前日はc以外を選択している',\n", + " '- if c == 0:',\n", + " '- hp[n][0] = max(hp[n - 1][1], hp[n - 1][2]) + ABC[n][0]',\n", + " '- elif c == 1:',\n", + " '- hp[n][1] = max(hp[n - 1][0], hp[n - 1][2]) + ABC[n][1]',\n", + " '- elif c == 2:',\n", + " '- hp[n][2] = max(hp[n - 1][0], hp[n - 1][1]) + ABC[n][2]',\n", + " '-ans = max(hp[-1])',\n", + " '+ a, b, c = list(map(int, input().split()))',\n", + " '+ dpa, dpb, dpc = max(dpb + a, dpc + a), max(dpa + b, dpc + b), max(dpa + c, dpb + c)',\n", + " '+ans = max(dpa, dpb, dpc)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8550028729,\n", + " 'measured_runtime_v1': 0.2768508897,\n", + " 'runtime_lift': 6.7003681115,\n", + " 'key': ['s202497340', 's462008938']},\n", + " {'user_id': 'u884982181',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's470797111',\n", + " 'submission_id_v1': 's347705079',\n", + " 'cpu_time_v0': 557,\n", + " 'cpu_time_v1': 99,\n", + " 'memory_v0': 14868,\n", + " 'memory_v1': 4148,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.23,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\na = list(map(int,input().split()))\\n\\nans = 0\\n\\na = np.array(a)\\n\\nwhile a.size > 0:\\n\\n a = a[a%2 == 0]\\n\\n ans += len(a)\\n\\n a = a//2\\n\\nprint(ans)',\n", + " 'target': 'n = int(eval(input()))\\n\\na = list(map(int,input().split()))\\n\\nans = 0\\n\\nfor i in range(n):\\n\\n while a[i]%2 == 0:\\n\\n a[i] //=2\\n\\n ans+=1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 183,\n", + " 'code_v1_num_chars': 152,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\na = list(map(int, input().split()))\\nans = 0\\na = np.array(a)\\nwhile a.size > 0:\\n a = a[a % 2 == 0]\\n ans += len(a)\\n a = a // 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nans = 0\\nfor i in range(n):\\n while a[i] % 2 == 0:\\n a[i] //= 2\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '+n = int(eval(input()))',\n", + " '-a = np.array(a)',\n", + " '-while a.size > 0:',\n", + " '- a = a[a % 2 == 0]',\n", + " '- ans += len(a)',\n", + " '- a = a // 2',\n", + " '+for i in range(n):',\n", + " '+ while a[i] % 2 == 0:',\n", + " '+ a[i] //= 2',\n", + " '+ ans += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4026193674,\n", + " 'measured_runtime_v1': 0.2031858566,\n", + " 'runtime_lift': 6.9031348485,\n", + " 'key': ['s470797111', 's347705079']},\n", + " {'user_id': 'u010110540',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's700640855',\n", + " 'submission_id_v1': 's281752333',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.61,\n", + " 'input': 'import math\\n\\n\\n\\nN = int(eval(input()))\\n\\nC = 10**9 + 7\\n\\n\\n\\nprint((math.factorial(N) % C))',\n", + " 'target': 'N = int(eval(input()))\\n\\nC = 10**9+7\\n\\nans = 1\\n\\nfor i in range(1, N + 1):\\n\\n ans *= i\\n\\n ans %= C\\n\\nprint(ans)',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 78,\n", + " 'code_v1_num_chars': 105,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nC = 10**9 + 7\\nprint((math.factorial(N) % C))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nC = 10**9 + 7\\nans = 1\\nfor i in range(1, N + 1):\\n ans *= i\\n ans %= C\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(N) % C))',\n", + " '+ans = 1',\n", + " '+for i in range(1, N + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= C',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7524980175,\n", + " 'measured_runtime_v1': 0.4259025633,\n", + " 'runtime_lift': 1.7668313889,\n", + " 'key': ['s700640855', 's281752333']},\n", + " {'user_id': 'u062484507',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's309433375',\n", + " 'submission_id_v1': 's915228066',\n", + " 'cpu_time_v0': 279,\n", + " 'cpu_time_v1': 182,\n", + " 'memory_v0': 52432,\n", + " 'memory_v1': 32532,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 34.77,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nn, k = list(map(int, readline().split()))\\n\\np = list(map(int, readline().split()))\\n\\n\\n\\ntmp = [(i+1)/2 for i in p]\\n\\ncs = list(np.cumsum(tmp))\\n\\n\\n\\nif n == k:\\n\\n print((cs[-1]))\\n\\n exit()\\n\\nans = 0\\n\\nfor i in range(n - k):\\n\\n ans = max(ans, cs[i + k] - cs[i])\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\n# import numpy as np\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nn, k = list(map(int, readline().split()))\\n\\np = list(map(int, readline().split()))\\n\\n\\n\\ntmp = [(i+1)/2 for i in p]\\n\\n# cs = list(np.cumsum(tmp))\\n\\n\\n\\ncs = [0]*n\\n\\ncs[0] = tmp[0]\\n\\nfor i in range(len(tmp)-1):\\n\\n cs[i + 1] = cs[i] + tmp[i + 1]\\n\\n\\n\\nif n == k:\\n\\n print((cs[-1]))\\n\\n exit()\\n\\nans = 0\\n\\nfor i in range(n - k):\\n\\n ans = max(ans, cs[i + k] - cs[i])\\n\\nprint(ans)',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 403,\n", + " 'code_v1_num_chars': 502,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nn, k = list(map(int, readline().split()))\\np = list(map(int, readline().split()))\\ntmp = [(i + 1) / 2 for i in p]\\ncs = list(np.cumsum(tmp))\\nif n == k:\\n print((cs[-1]))\\n exit()\\nans = 0\\nfor i in range(n - k):\\n ans = max(ans, cs[i + k] - cs[i])\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n# import numpy as np\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nn, k = list(map(int, readline().split()))\\np = list(map(int, readline().split()))\\ntmp = [(i + 1) / 2 for i in p]\\n# cs = list(np.cumsum(tmp))\\ncs = [0] * n\\ncs[0] = tmp[0]\\nfor i in range(len(tmp) - 1):\\n cs[i + 1] = cs[i] + tmp[i + 1]\\nif n == k:\\n print((cs[-1]))\\n exit()\\nans = 0\\nfor i in range(n - k):\\n ans = max(ans, cs[i + k] - cs[i])\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.8333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '+# import numpy as np',\n", + " '-cs = list(np.cumsum(tmp))',\n", + " '+# cs = list(np.cumsum(tmp))',\n", + " '+cs = [0] * n',\n", + " '+cs[0] = tmp[0]',\n", + " '+for i in range(len(tmp) - 1):',\n", + " '+ cs[i + 1] = cs[i] + tmp[i + 1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3658499551,\n", + " 'measured_runtime_v1': 0.2102261074,\n", + " 'runtime_lift': 6.4970520178,\n", + " 'key': ['s309433375', 's915228066']},\n", + " {'user_id': 'u968166680',\n", + " 'problem_id': 'p03752',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's863090450',\n", + " 'submission_id_v1': 's059435285',\n", + " 'cpu_time_v0': 32,\n", + " 'cpu_time_v1': 24,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 25.0,\n", + " 'input': \"import sys\\n\\n\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = 1 << 60\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, K, *A = list(map(int, read().split()))\\n\\n\\n\\n ans = INF\\n\\n for bit in range(1 << N):\\n\\n if (not (bit & 1)) or bin(bit).count('1') != K:\\n\\n continue\\n\\n\\n\\n total = 0\\n\\n max_height = A[0]\\n\\n for i, a in enumerate(A[1:], 1):\\n\\n if a <= max_height:\\n\\n if bit & (1 << i):\\n\\n total += max_height - a + 1\\n\\n max_height += 1\\n\\n else:\\n\\n max_height = a\\n\\n\\n\\n if ans > total:\\n\\n ans = total\\n\\n\\n\\n print(ans)\\n\\n\\n\\n return\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"import sys\\n\\nfrom itertools import combinations\\n\\n\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = 1 << 60\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, K, *A = list(map(int, read().split()))\\n\\n\\n\\n ans = INF\\n\\n for comb in combinations(list(range(1, N)), K - 1):\\n\\n included = [False] * N\\n\\n for i in comb:\\n\\n included[i] = True\\n\\n\\n\\n total = 0\\n\\n max_height = A[0]\\n\\n for i, a in enumerate(A[1:], 1):\\n\\n if a <= max_height:\\n\\n if included[i]:\\n\\n total += max_height - a + 1\\n\\n max_height += 1\\n\\n else:\\n\\n max_height = a\\n\\n\\n\\n if ans > total:\\n\\n ans = total\\n\\n\\n\\n print(ans)\\n\\n\\n\\n return\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 37,\n", + " 'code_v1_loc': 39,\n", + " 'code_v0_num_chars': 756,\n", + " 'code_v1_num_chars': 818,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10**9)\\nINF = 1 << 60\\n\\n\\ndef main():\\n N, K, *A = list(map(int, read().split()))\\n ans = INF\\n for bit in range(1 << N):\\n if (not (bit & 1)) or bin(bit).count(\"1\") != K:\\n continue\\n total = 0\\n max_height = A[0]\\n for i, a in enumerate(A[1:], 1):\\n if a <= max_height:\\n if bit & (1 << i):\\n total += max_height - a + 1\\n max_height += 1\\n else:\\n max_height = a\\n if ans > total:\\n ans = total\\n print(ans)\\n return\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom itertools import combinations\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10**9)\\nINF = 1 << 60\\n\\n\\ndef main():\\n N, K, *A = list(map(int, read().split()))\\n ans = INF\\n for comb in combinations(list(range(1, N)), K - 1):\\n included = [False] * N\\n for i in comb:\\n included[i] = True\\n total = 0\\n max_height = A[0]\\n for i, a in enumerate(A[1:], 1):\\n if a <= max_height:\\n if included[i]:\\n total += max_height - a + 1\\n max_height += 1\\n else:\\n max_height = a\\n if ans > total:\\n ans = total\\n print(ans)\\n return\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.1282051282,\n", + " 'diff': ['+from itertools import combinations',\n", + " '- for bit in range(1 << N):',\n", + " '- if (not (bit & 1)) or bin(bit).count(\"1\") != K:',\n", + " '- continue',\n", + " '+ for comb in combinations(list(range(1, N)), K - 1):',\n", + " '+ included = [False] * N',\n", + " '+ for i in comb:',\n", + " '+ included[i] = True',\n", + " '- if bit & (1 << i):',\n", + " '+ if included[i]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4393207397,\n", + " 'measured_runtime_v1': 0.2213684809,\n", + " 'runtime_lift': 1.9845677122,\n", + " 'key': ['s863090450', 's059435285']},\n", + " {'user_id': 'u394731058',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's948462743',\n", + " 'submission_id_v1': 's673167226',\n", + " 'cpu_time_v0': 210,\n", + " 'cpu_time_v1': 76,\n", + " 'memory_v0': 13304,\n", + " 'memory_v1': 17740,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 63.81,\n", + " 'input': 'import sys\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef main():\\n\\n ans = 0\\n\\n n = int(input())\\n\\n o = list(map(int, input().split()))\\n\\n l = [0]*n\\n\\n for i in range(n):\\n\\n l[o[i]-1] = i+1\\n\\n for i in range(len(l)):\\n\\n if i != len(l)-1:\\n\\n print(\"{} \".format(l[i]), end=\\'\\')\\n\\n else:\\n\\n print(l[i])\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef main():\\n\\n ans = 0\\n\\n n = int(eval(input()))\\n\\n o = list(map(int, input().split()))\\n\\n l = [0]*n\\n\\n for i in range(n):\\n\\n l[o[i]-1] = i+1\\n\\n print((\" \".join(map(str,l))))\\n\\nif __name__ == \\'__main__\\':\\n\\n main()',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 381,\n", + " 'code_v1_num_chars': 268,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n ans = 0\\n n = int(input())\\n o = list(map(int, input().split()))\\n l = [0] * n\\n for i in range(n):\\n l[o[i] - 1] = i + 1\\n for i in range(len(l)):\\n if i != len(l) - 1:\\n print(\"{} \".format(l[i]), end=\"\")\\n else:\\n print(l[i])\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n ans = 0\\n n = int(eval(input()))\\n o = list(map(int, input().split()))\\n l = [0] * n\\n for i in range(n):\\n l[o[i] - 1] = i + 1\\n print((\" \".join(map(str, l))))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.3157894737,\n", + " 'diff': ['- n = int(input())',\n", + " '+ n = int(eval(input()))',\n", + " '- for i in range(len(l)):',\n", + " '- if i != len(l) - 1:',\n", + " '- print(\"{} \".format(l[i]), end=\"\")',\n", + " '- else:',\n", + " '- print(l[i])',\n", + " '+ print((\" \".join(map(str, l))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3305146998,\n", + " 'measured_runtime_v1': 0.2638847903,\n", + " 'runtime_lift': 1.2524962104,\n", + " 'key': ['s948462743', 's673167226']},\n", + " {'user_id': 'u561083515',\n", + " 'problem_id': 'p02959',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's872669573',\n", + " 'submission_id_v1': 's116182226',\n", + " 'cpu_time_v0': 274,\n", + " 'cpu_time_v1': 160,\n", + " 'memory_v0': 73316,\n", + " 'memory_v1': 19648,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 41.61,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = [int(i) for i in input().split()]\\n\\nB = [int(i) for i in input().split()]\\n\\nbefore = sum(A)\\n\\n\\n\\nfor i in range(N):\\n\\n nokori = B[i]\\n\\n for j in range(i,i+2):\\n\\n if nokori >= A[j]:\\n\\n nokori -= A[j]\\n\\n A[j] = 0\\n\\n else:\\n\\n A[j] -= nokori\\n\\n nokori = 0\\n\\nafter = sum(A)\\n\\n\\n\\nprint((before - after))',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = [int(i) for i in input().split()]\\n\\nB = [int(i) for i in input().split()]\\n\\n\\n\\ncnt = 0\\n\\nfor i in range(N):\\n\\n if B[i] >= A[i]:\\n\\n cnt += A[i]\\n\\n B[i] -= A[i]\\n\\n else:\\n\\n cnt += B[i]\\n\\n B[i] = 0\\n\\n if B[i] == 0:\\n\\n continue\\n\\n if B[i] >= A[i+1]:\\n\\n cnt += A[i+1]\\n\\n A[i+1] = 0\\n\\n else:\\n\\n cnt += B[i]\\n\\n A[i+1] -= B[i]\\n\\n\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 440,\n", + " 'code_v1_num_chars': 414,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(10**7)\\nN = int(eval(input()))\\nA = [int(i) for i in input().split()]\\nB = [int(i) for i in input().split()]\\nbefore = sum(A)\\nfor i in range(N):\\n nokori = B[i]\\n for j in range(i, i + 2):\\n if nokori >= A[j]:\\n nokori -= A[j]\\n A[j] = 0\\n else:\\n A[j] -= nokori\\n nokori = 0\\nafter = sum(A)\\nprint((before - after))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [int(i) for i in input().split()]\\nB = [int(i) for i in input().split()]\\ncnt = 0\\nfor i in range(N):\\n if B[i] >= A[i]:\\n cnt += A[i]\\n B[i] -= A[i]\\n else:\\n cnt += B[i]\\n B[i] = 0\\n if B[i] == 0:\\n continue\\n if B[i] >= A[i + 1]:\\n cnt += A[i + 1]\\n A[i + 1] = 0\\n else:\\n cnt += B[i]\\n A[i + 1] -= B[i]\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-input = sys.stdin.readline',\n", + " '-sys.setrecursionlimit(10**7)',\n", + " '-before = sum(A)',\n", + " '+cnt = 0',\n", + " '- nokori = B[i]',\n", + " '- for j in range(i, i + 2):',\n", + " '- if nokori >= A[j]:',\n", + " '- nokori -= A[j]',\n", + " '- A[j] = 0',\n", + " '- else:',\n", + " '- A[j] -= nokori',\n", + " '- nokori = 0',\n", + " '-after = sum(A)',\n", + " '-print((before - after))',\n", + " '+ if B[i] >= A[i]:',\n", + " '+ cnt += A[i]',\n", + " '+ B[i] -= A[i]',\n", + " '+ else:',\n", + " '+ cnt += B[i]',\n", + " '+ B[i] = 0',\n", + " '+ if B[i] == 0:',\n", + " '+ continue',\n", + " '+ if B[i] >= A[i + 1]:',\n", + " '+ cnt += A[i + 1]',\n", + " '+ A[i + 1] = 0',\n", + " '+ else:',\n", + " '+ cnt += B[i]',\n", + " '+ A[i + 1] -= B[i]',\n", + " '+print(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3369382279,\n", + " 'measured_runtime_v1': 0.0062937415,\n", + " 'runtime_lift': 53.5354413986,\n", + " 'key': ['s872669573', 's116182226']},\n", + " {'user_id': 'u620238824',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's361313136',\n", + " 'submission_id_v1': 's308076339',\n", + " 'cpu_time_v0': 1222,\n", + " 'cpu_time_v1': 629,\n", + " 'memory_v0': 9168,\n", + " 'memory_v1': 73340,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.53,\n", + " 'input': 'X = int(eval(input()))#数字\\n\\n\\n\\nfor i in range(10 ** 8):\\n\\n for j in range(-10000,10 ** 4):\\n\\n if i ** 5 - j ** 5 == X:\\n\\n print((i, j))\\n\\n exit()',\n", + " 'target': 'x = int(eval(input()))\\n\\ny = 10**4\\n\\n\\n\\nfor i in range(y):\\n\\n for j in range(-y,y):\\n\\n if i ** 5 - j ** 5 == x:\\n\\n print((i, j))\\n\\n exit()',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 163,\n", + " 'code_v1_num_chars': 155,\n", + " 'code_v0_no_empty_lines': 'X = int(eval(input())) # 数字\\nfor i in range(10**8):\\n for j in range(-10000, 10**4):\\n if i**5 - j**5 == X:\\n print((i, j))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\ny = 10**4\\nfor i in range(y):\\n for j in range(-y, y):\\n if i**5 - j**5 == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-X = int(eval(input())) # 数字',\n", + " '-for i in range(10**8):',\n", + " '- for j in range(-10000, 10**4):',\n", + " '- if i**5 - j**5 == X:',\n", + " '+x = int(eval(input()))',\n", + " '+y = 10**4',\n", + " '+for i in range(y):',\n", + " '+ for j in range(-y, y):',\n", + " '+ if i**5 - j**5 == x:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5543799698,\n", + " 'measured_runtime_v1': 0.3403863927,\n", + " 'runtime_lift': 1.628678413,\n", + " 'key': ['s361313136', 's308076339']},\n", + " {'user_id': 'u562016607',\n", + " 'problem_id': 'p03835',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's390314187',\n", + " 'submission_id_v1': 's016239384',\n", + " 'cpu_time_v0': 1476,\n", + " 'cpu_time_v1': 282,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 41180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.89,\n", + " 'input': 'K,S=list(map(int,input().split()))\\n\\nO=0\\n\\nfor X in range(K+1):\\n\\n for Y in range(K+1):\\n\\n Z=S-X-Y\\n\\n if 0<=Z<=K:\\n\\n O+=1\\n\\nprint(O)\\n',\n", + " 'target': 'K,S=list(map(int,input().split()))\\n\\nans=0\\n\\nfor X in range(K+1):\\n\\n for Y in range(K+1):\\n\\n Z=S-X-Y\\n\\n if 0<=Z<=K:\\n\\n ans+=1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 132,\n", + " 'code_v1_num_chars': 154,\n", + " 'code_v0_no_empty_lines': 'K, S = list(map(int, input().split()))\\nO = 0\\nfor X in range(K + 1):\\n for Y in range(K + 1):\\n Z = S - X - Y\\n if 0 <= Z <= K:\\n O += 1\\nprint(O)\\n',\n", + " 'code_v1_no_empty_lines': 'K, S = list(map(int, input().split()))\\nans = 0\\nfor X in range(K + 1):\\n for Y in range(K + 1):\\n Z = S - X - Y\\n if 0 <= Z <= K:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-O = 0',\n", + " '+ans = 0',\n", + " '- O += 1',\n", + " '-print(O)',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2257852338,\n", + " 'measured_runtime_v1': 0.0060590109,\n", + " 'runtime_lift': 37.2643715379,\n", + " 'key': ['s390314187', 's016239384']},\n", + " {'user_id': 'u864197622',\n", + " 'problem_id': 'p02822',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's981663077',\n", + " 'submission_id_v1': 's820806781',\n", + " 'cpu_time_v0': 1240,\n", + " 'cpu_time_v1': 890,\n", + " 'memory_v0': 93784,\n", + " 'memory_v1': 100756,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.23,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nfrom collections import deque\\n\\nN = int(eval(input()))\\n\\nX = [[] for i in range(N)]\\n\\nfor i in range(N-1):\\n\\n x, y = list(map(int, input().split()))\\n\\n X[x-1].append(y-1)\\n\\n X[y-1].append(x-1)\\n\\ni0 = min([i for i in range(N) if len(X[i]) == 1])\\n\\n\\n\\nP = [-1] * N\\n\\nQ = deque([i0])\\n\\nR = []\\n\\nwhile Q:\\n\\n i = deque.popleft(Q)\\n\\n R.append(i)\\n\\n for a in X[i]:\\n\\n if a != P[i]:\\n\\n P[a] = i\\n\\n X[a].remove(i)\\n\\n deque.append(Q, a)\\n\\n\\n\\nmod = 10 ** 9 + 7\\n\\ninv2 = (mod + 1) // 2\\n\\nA = [1] * N\\n\\nfor i in R[::-1]:\\n\\n s = 0\\n\\n for j in X[i]:\\n\\n A[i] += A[j]\\n\\n\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n s = pow(inv2, N - A[i], mod)\\n\\n t = 1 + (1-pow(inv2, N - A[i], mod)) * pow(2, N - A[i], mod)\\n\\n for j in X[i]:\\n\\n s = (s * pow(inv2, A[j], mod)) % mod\\n\\n t = (t + (1-pow(inv2, A[j], mod)) * pow(2, A[j], mod)) % mod\\n\\n ans = (ans + 1 - s * t) % mod\\n\\n\\n\\nprint((ans * inv2 % mod))',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nfrom collections import deque\\n\\nN = int(eval(input()))\\n\\nX = [[] for i in range(N)]\\n\\nfor i in range(N-1):\\n\\n x, y = list(map(int, input().split()))\\n\\n X[x-1].append(y-1)\\n\\n X[y-1].append(x-1)\\n\\ni0 = min([i for i in range(N) if len(X[i]) == 1])\\n\\n\\n\\nP = [-1] * N\\n\\nQ = deque([i0])\\n\\nR = []\\n\\nwhile Q:\\n\\n i = deque.popleft(Q)\\n\\n R.append(i)\\n\\n for a in X[i]:\\n\\n if a != P[i]:\\n\\n P[a] = i\\n\\n X[a].remove(i)\\n\\n deque.append(Q, a)\\n\\n\\n\\nmod = 10 ** 9 + 7\\n\\npow2 = [1]\\n\\nfor i in range(N + 10):\\n\\n pow2.append(pow2[-1] * 2 % mod)\\n\\ninv2 = (mod + 1) // 2\\n\\n\\n\\ninvpow2 = [pow(pow2[-1], mod-2, mod)]\\n\\nfor i in range(N + 10)[::-1]:\\n\\n invpow2.append(invpow2[-1] * 2 % mod)\\n\\ninvpow2 = invpow2[::-1]\\n\\n\\n\\nA = [1] * N\\n\\nfor i in R[::-1]:\\n\\n s = 0\\n\\n for j in X[i]:\\n\\n A[i] += A[j]\\n\\n\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n s = pow(inv2, N - A[i], mod)\\n\\n t = 1 + (1-invpow2[N-A[i]]) * pow2[N-A[i]]\\n\\n for j in X[i]:\\n\\n s = (s * invpow2[A[j]]) % mod\\n\\n t = (t + (1-invpow2[A[j]]) * pow2[A[j]]) % mod\\n\\n ans = (ans + 1 - s * t) % mod\\n\\n\\n\\nprint((ans * inv2 % mod))',\n", + " 'code_v0_loc': 41,\n", + " 'code_v1_loc': 50,\n", + " 'code_v0_num_chars': 951,\n", + " 'code_v1_num_chars': 1128,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nfrom collections import deque\\n\\nN = int(eval(input()))\\nX = [[] for i in range(N)]\\nfor i in range(N - 1):\\n x, y = list(map(int, input().split()))\\n X[x - 1].append(y - 1)\\n X[y - 1].append(x - 1)\\ni0 = min([i for i in range(N) if len(X[i]) == 1])\\nP = [-1] * N\\nQ = deque([i0])\\nR = []\\nwhile Q:\\n i = deque.popleft(Q)\\n R.append(i)\\n for a in X[i]:\\n if a != P[i]:\\n P[a] = i\\n X[a].remove(i)\\n deque.append(Q, a)\\nmod = 10**9 + 7\\ninv2 = (mod + 1) // 2\\nA = [1] * N\\nfor i in R[::-1]:\\n s = 0\\n for j in X[i]:\\n A[i] += A[j]\\nans = 0\\nfor i in range(N):\\n s = pow(inv2, N - A[i], mod)\\n t = 1 + (1 - pow(inv2, N - A[i], mod)) * pow(2, N - A[i], mod)\\n for j in X[i]:\\n s = (s * pow(inv2, A[j], mod)) % mod\\n t = (t + (1 - pow(inv2, A[j], mod)) * pow(2, A[j], mod)) % mod\\n ans = (ans + 1 - s * t) % mod\\nprint((ans * inv2 % mod))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nfrom collections import deque\\n\\nN = int(eval(input()))\\nX = [[] for i in range(N)]\\nfor i in range(N - 1):\\n x, y = list(map(int, input().split()))\\n X[x - 1].append(y - 1)\\n X[y - 1].append(x - 1)\\ni0 = min([i for i in range(N) if len(X[i]) == 1])\\nP = [-1] * N\\nQ = deque([i0])\\nR = []\\nwhile Q:\\n i = deque.popleft(Q)\\n R.append(i)\\n for a in X[i]:\\n if a != P[i]:\\n P[a] = i\\n X[a].remove(i)\\n deque.append(Q, a)\\nmod = 10**9 + 7\\npow2 = [1]\\nfor i in range(N + 10):\\n pow2.append(pow2[-1] * 2 % mod)\\ninv2 = (mod + 1) // 2\\ninvpow2 = [pow(pow2[-1], mod - 2, mod)]\\nfor i in range(N + 10)[::-1]:\\n invpow2.append(invpow2[-1] * 2 % mod)\\ninvpow2 = invpow2[::-1]\\nA = [1] * N\\nfor i in R[::-1]:\\n s = 0\\n for j in X[i]:\\n A[i] += A[j]\\nans = 0\\nfor i in range(N):\\n s = pow(inv2, N - A[i], mod)\\n t = 1 + (1 - invpow2[N - A[i]]) * pow2[N - A[i]]\\n for j in X[i]:\\n s = (s * invpow2[A[j]]) % mod\\n t = (t + (1 - invpow2[A[j]]) * pow2[A[j]]) % mod\\n ans = (ans + 1 - s * t) % mod\\nprint((ans * inv2 % mod))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.0,\n", + " 'diff': ['+pow2 = [1]',\n", + " '+for i in range(N + 10):',\n", + " '+ pow2.append(pow2[-1] * 2 % mod)',\n", + " '+invpow2 = [pow(pow2[-1], mod - 2, mod)]',\n", + " '+for i in range(N + 10)[::-1]:',\n", + " '+ invpow2.append(invpow2[-1] * 2 % mod)',\n", + " '+invpow2 = invpow2[::-1]',\n", + " '- t = 1 + (1 - pow(inv2, N - A[i], mod)) * pow(2, N - A[i], mod)',\n", + " '+ t = 1 + (1 - invpow2[N - A[i]]) * pow2[N - A[i]]',\n", + " '- s = (s * pow(inv2, A[j], mod)) % mod',\n", + " '- t = (t + (1 - pow(inv2, A[j], mod)) * pow(2, A[j], mod)) % mod',\n", + " '+ s = (s * invpow2[A[j]]) % mod',\n", + " '+ t = (t + (1 - invpow2[A[j]]) * pow2[A[j]]) % mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2550587091,\n", + " 'measured_runtime_v1': 0.1362446928,\n", + " 'runtime_lift': 1.8720634461,\n", + " 'key': ['s981663077', 's820806781']},\n", + " {'user_id': 'u691874710',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's109040531',\n", + " 'submission_id_v1': 's154929994',\n", + " 'cpu_time_v0': 142,\n", + " 'cpu_time_v1': 38,\n", + " 'memory_v0': 9168,\n", + " 'memory_v1': 9132,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.24,\n", + " 'input': 'x=int(eval(input()))\\n\\nA=0\\n\\nB=0\\n\\nfor a in range(-120,120):\\n\\n for b in range(-500,500):\\n\\n if a**5-b**5==x:\\n\\n A=a\\n\\n B=b\\n\\n break\\n\\nprint((A,B))',\n", + " 'target': 'x=int(eval(input()))\\n\\nA=0\\n\\nB=0\\n\\nfor a in range(-120, 120):\\n\\n a5 = a**5\\n\\n for b in range(-120, 120):\\n\\n if a5 - b**5 == x:\\n\\n A = a\\n\\n B = b\\n\\n break\\n\\nprint((A,B))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 173,\n", + " 'code_v1_num_chars': 196,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nA = 0\\nB = 0\\nfor a in range(-120, 120):\\n for b in range(-500, 500):\\n if a**5 - b**5 == x:\\n A = a\\n B = b\\n break\\nprint((A, B))\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nA = 0\\nB = 0\\nfor a in range(-120, 120):\\n a5 = a**5\\n for b in range(-120, 120):\\n if a5 - b**5 == x:\\n A = a\\n B = b\\n break\\nprint((A, B))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['- for b in range(-500, 500):',\n", + " '- if a**5 - b**5 == x:',\n", + " '+ a5 = a**5',\n", + " '+ for b in range(-120, 120):',\n", + " '+ if a5 - b**5 == x:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9916155219,\n", + " 'measured_runtime_v1': 0.3713067094,\n", + " 'runtime_lift': 5.363801599,\n", + " 'key': ['s109040531', 's154929994']},\n", + " {'user_id': 'u239981649',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's383796227',\n", + " 'submission_id_v1': 's138334572',\n", + " 'cpu_time_v0': 232,\n", + " 'cpu_time_v1': 34,\n", + " 'memory_v0': 3972,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.34,\n", + " 'input': 'from math import factorial\\n\\nprint((factorial(int(eval(input()))) % (10**9+7)))',\n", + " 'target': 'ans = 1\\n\\nfor k in range(1, int(eval(input()))+1):\\n\\n ans = ans*k % (10**9+7)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 70,\n", + " 'code_v1_num_chars': 84,\n", + " 'code_v0_no_empty_lines': 'from math import factorial\\n\\nprint((factorial(int(eval(input()))) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'ans = 1\\nfor k in range(1, int(eval(input())) + 1):\\n ans = ans * k % (10**9 + 7)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-from math import factorial',\n", + " '-',\n", + " '-print((factorial(int(eval(input()))) % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+for k in range(1, int(eval(input())) + 1):',\n", + " '+ ans = ans * k % (10**9 + 7)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3382144179,\n", + " 'measured_runtime_v1': 0.1644267938,\n", + " 'runtime_lift': 2.0569300785,\n", + " 'key': ['s383796227', 's138334572']},\n", + " {'user_id': 'u260216890',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's285612655',\n", + " 'submission_id_v1': 's586502539',\n", + " 'cpu_time_v0': 1324,\n", + " 'cpu_time_v1': 196,\n", + " 'memory_v0': 21280,\n", + " 'memory_v1': 40044,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.2,\n", + " 'input': 'import numpy as np\\n\\nN=int(eval(input()))\\n\\nroot=int(np.sqrt(N)//1)\\n\\na=N\\n\\nb=N\\n\\nfor i in range(root, 0, -1):\\n\\n if N%i==0:\\n\\n a=i\\n\\n b=N//i\\n\\n break\\n\\nprint((a-1+b-1))',\n", + " 'target': 'N=int(eval(input()))\\n\\nroot=int((N**0.5)//1)\\n\\na=N\\n\\nb=N\\n\\nfor i in range(root, 0, -1):\\n\\n if N%i==0:\\n\\n a=i\\n\\n b=N//i\\n\\n break\\n\\nprint((a-1+b-1))\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 175,\n", + " 'code_v1_num_chars': 154,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nroot = int(np.sqrt(N) // 1)\\na = N\\nb = N\\nfor i in range(root, 0, -1):\\n if N % i == 0:\\n a = i\\n b = N // i\\n break\\nprint((a - 1 + b - 1))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nroot = int((N**0.5) // 1)\\na = N\\nb = N\\nfor i in range(root, 0, -1):\\n if N % i == 0:\\n a = i\\n b = N // i\\n break\\nprint((a - 1 + b - 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-root = int(np.sqrt(N) // 1)',\n", + " '+root = int((N**0.5) // 1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.2620700173,\n", + " 'measured_runtime_v1': 0.2775772495,\n", + " 'runtime_lift': 8.149335081,\n", + " 'key': ['s285612655', 's586502539']},\n", + " {'user_id': 'u326609687',\n", + " 'problem_id': 'p03074',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's171288721',\n", + " 'submission_id_v1': 's319292568',\n", + " 'cpu_time_v0': 80,\n", + " 'cpu_time_v1': 65,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 4460,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.75,\n", + " 'input': \"import sys\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\nS = eval(input())\\n\\n\\n\\n\\n\\ndef nexti(n):\\n\\n while S[n] == '1':\\n\\n n += 1\\n\\n while S[n] == '0':\\n\\n n += 1\\n\\n return n\\n\\n\\n\\n\\n\\ndef nextj(n):\\n\\n while S[n] == '0':\\n\\n n += 1\\n\\n if n == N:\\n\\n return N\\n\\n while S[n] == '1':\\n\\n n += 1\\n\\n if n == N:\\n\\n return N\\n\\n return n\\n\\n\\n\\n\\n\\ni = 0\\n\\nj = 0\\n\\nwhile S[j] == '1':\\n\\n j += 1\\n\\n if j == N:\\n\\n print(N)\\n\\n sys.exit(0)\\n\\nfor _ in range(K):\\n\\n j = nextj(j)\\n\\n if j == N:\\n\\n print(N)\\n\\n sys.exit(0)\\n\\n\\n\\nans = j - i\\n\\nwhile True:\\n\\n i = nexti(i)\\n\\n j = nextj(j)\\n\\n ans = max(ans, j - i)\\n\\n if j == N:\\n\\n break\\n\\n\\n\\nprint(ans)\",\n", + " 'target': \"from collections import deque\\n\\n\\n\\n\\n\\ndef nextj(n):\\n\\n while S[n] == '0':\\n\\n n += 1\\n\\n if n == N:\\n\\n return N\\n\\n q.appendleft(n)\\n\\n while S[n] == '1':\\n\\n n += 1\\n\\n if n == N:\\n\\n return N\\n\\n return n\\n\\n\\n\\n\\n\\ndef init(n):\\n\\n while S[n] == '1':\\n\\n n += 1\\n\\n if n == N:\\n\\n return N\\n\\n return n\\n\\n\\n\\n\\n\\ndef calc():\\n\\n q.appendleft(0)\\n\\n ans = 0\\n\\n j = init(0)\\n\\n if j == N:\\n\\n return N\\n\\n for _ in range(K - 1):\\n\\n j = nextj(j)\\n\\n if j == N:\\n\\n return N\\n\\n while True:\\n\\n j = nextj(j)\\n\\n ans = max(ans, j - q.pop())\\n\\n if j == N:\\n\\n return ans\\n\\n\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\nS = eval(input())\\n\\nq = deque()\\n\\nprint((calc()))\\n\",\n", + " 'code_v0_loc': 48,\n", + " 'code_v1_loc': 45,\n", + " 'code_v0_num_chars': 703,\n", + " 'code_v1_num_chars': 755,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nN, K = list(map(int, input().split()))\\nS = eval(input())\\n\\n\\ndef nexti(n):\\n while S[n] == \"1\":\\n n += 1\\n while S[n] == \"0\":\\n n += 1\\n return n\\n\\n\\ndef nextj(n):\\n while S[n] == \"0\":\\n n += 1\\n if n == N:\\n return N\\n while S[n] == \"1\":\\n n += 1\\n if n == N:\\n return N\\n return n\\n\\n\\ni = 0\\nj = 0\\nwhile S[j] == \"1\":\\n j += 1\\n if j == N:\\n print(N)\\n sys.exit(0)\\nfor _ in range(K):\\n j = nextj(j)\\n if j == N:\\n print(N)\\n sys.exit(0)\\nans = j - i\\nwhile True:\\n i = nexti(i)\\n j = nextj(j)\\n ans = max(ans, j - i)\\n if j == N:\\n break\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque\\n\\n\\ndef nextj(n):\\n while S[n] == \"0\":\\n n += 1\\n if n == N:\\n return N\\n q.appendleft(n)\\n while S[n] == \"1\":\\n n += 1\\n if n == N:\\n return N\\n return n\\n\\n\\ndef init(n):\\n while S[n] == \"1\":\\n n += 1\\n if n == N:\\n return N\\n return n\\n\\n\\ndef calc():\\n q.appendleft(0)\\n ans = 0\\n j = init(0)\\n if j == N:\\n return N\\n for _ in range(K - 1):\\n j = nextj(j)\\n if j == N:\\n return N\\n while True:\\n j = nextj(j)\\n ans = max(ans, j - q.pop())\\n if j == N:\\n return ans\\n\\n\\nN, K = list(map(int, input().split()))\\nS = eval(input())\\nq = deque()\\nprint((calc()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.25,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-N, K = list(map(int, input().split()))',\n", + " '-S = eval(input())',\n", + " '-',\n", + " '-',\n", + " '-def nexti(n):',\n", + " '- while S[n] == \"1\":',\n", + " '- n += 1',\n", + " '- while S[n] == \"0\":',\n", + " '- n += 1',\n", + " '- return n',\n", + " '+from collections import deque',\n", + " '+ q.appendleft(n)',\n", + " '-i = 0',\n", + " '-j = 0',\n", + " '-while S[j] == \"1\":',\n", + " '- j += 1',\n", + " '+def init(n):',\n", + " '+ while S[n] == \"1\":',\n", + " '+ n += 1',\n", + " '+ if n == N:',\n", + " '+ return N',\n", + " '+ return n',\n", + " '+',\n", + " '+',\n", + " '+def calc():',\n", + " '+ q.appendleft(0)',\n", + " '+ ans = 0',\n", + " '+ j = init(0)',\n", + " '- print(N)',\n", + " '- sys.exit(0)',\n", + " '-for _ in range(K):',\n", + " '- j = nextj(j)',\n", + " '- if j == N:',\n", + " '- print(N)',\n", + " '- sys.exit(0)',\n", + " '-ans = j - i',\n", + " '-while True:',\n", + " '- i = nexti(i)',\n", + " '- j = nextj(j)',\n", + " '- ans = max(ans, j - i)',\n", + " '- if j == N:',\n", + " '- break',\n", + " '-print(ans)',\n", + " '+ return N',\n", + " '+ for _ in range(K - 1):',\n", + " '+ j = nextj(j)',\n", + " '+ if j == N:',\n", + " '+ return N',\n", + " '+ while True:',\n", + " '+ j = nextj(j)',\n", + " '+ ans = max(ans, j - q.pop())',\n", + " '+ if j == N:',\n", + " '+ return ans',\n", + " '+',\n", + " '+',\n", + " '+N, K = list(map(int, input().split()))',\n", + " '+S = eval(input())',\n", + " '+q = deque()',\n", + " '+print((calc()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3886394203,\n", + " 'measured_runtime_v1': 0.2086165268,\n", + " 'runtime_lift': 1.8629368734,\n", + " 'key': ['s171288721', 's319292568']},\n", + " {'user_id': 'u802963389',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's237263897',\n", + " 'submission_id_v1': 's723941772',\n", + " 'cpu_time_v0': 737,\n", + " 'cpu_time_v1': 23,\n", + " 'memory_v0': 26508,\n", + " 'memory_v1': 3436,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 96.88,\n", + " 'input': 'from scipy.sparse.csgraph import dijkstra\\n\\nN, M = list(map(int, input().split()))\\n\\nedge = [list(map(int, input().split())) for _ in range(M)]\\n\\n\\n\\n# 隣接行列\\n\\ngraph = [[0] * (N + 1) for _ in range(N + 1)]\\n\\n\\n\\nfor i, j in edge:\\n\\n graph[i][j] = 1\\n\\n \\n\\nans = 0\\n\\nINF = 10 ** 9\\n\\nfor a, b in edge:\\n\\n # 辺を取り除く-> INF\\n\\n graph[a][b] = INF\\n\\n dist = dijkstra(graph, indices=a, directed=False) # directed=False -> 無効グラフ用\\n\\n if dist[b] >= INF:\\n\\n ans += 1\\n\\n # 元に戻す -> 1\\n\\n graph[a][b] = 1\\n\\n\\n\\nprint(ans)',\n", + " 'target': '# C - Bridge\\n\\n# https://atcoder.jp/contests/abc075/tasks/abc075_c\\n\\n\\n\\nfrom collections import deque\\n\\n\\n\\ndef dfs(n, start, graph):\\n\\n visited = [False] * n\\n\\n stack = deque()\\n\\n stack.append(start)\\n\\n visited[start] = True\\n\\n while stack:\\n\\n q = stack.popleft()\\n\\n nxts = graph[q]\\n\\n for nxt in nxts:\\n\\n if not visited[nxt]:\\n\\n visited[nxt] = True\\n\\n stack.append(nxt)\\n\\n return visited\\n\\n\\n\\nn, m = list(map(int, input().split()))\\n\\nedge = [list(map(int, input().split())) for _ in range(m)]\\n\\n\\n\\nans = 0\\n\\nfor i in range(m):\\n\\n graph = [[] for _ in range(n)]\\n\\n for itr, (a, b) in enumerate(edge):\\n\\n if itr != i:\\n\\n graph[a - 1].append(b - 1)\\n\\n graph[b - 1].append(a - 1)\\n\\n\\n\\n if not all(dfs(n, 0, graph)):\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 34,\n", + " 'code_v0_num_chars': 482,\n", + " 'code_v1_num_chars': 755,\n", + " 'code_v0_no_empty_lines': 'from scipy.sparse.csgraph import dijkstra\\n\\nN, M = list(map(int, input().split()))\\nedge = [list(map(int, input().split())) for _ in range(M)]\\n# 隣接行列\\ngraph = [[0] * (N + 1) for _ in range(N + 1)]\\nfor i, j in edge:\\n graph[i][j] = 1\\nans = 0\\nINF = 10**9\\nfor a, b in edge:\\n # 辺を取り除く-> INF\\n graph[a][b] = INF\\n dist = dijkstra(graph, indices=a, directed=False) # directed=False -> 無効グラフ用\\n if dist[b] >= INF:\\n ans += 1\\n # 元に戻す -> 1\\n graph[a][b] = 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# C - Bridge\\n# https://atcoder.jp/contests/abc075/tasks/abc075_c\\nfrom collections import deque\\n\\n\\ndef dfs(n, start, graph):\\n visited = [False] * n\\n stack = deque()\\n stack.append(start)\\n visited[start] = True\\n while stack:\\n q = stack.popleft()\\n nxts = graph[q]\\n for nxt in nxts:\\n if not visited[nxt]:\\n visited[nxt] = True\\n stack.append(nxt)\\n return visited\\n\\n\\nn, m = list(map(int, input().split()))\\nedge = [list(map(int, input().split())) for _ in range(m)]\\nans = 0\\nfor i in range(m):\\n graph = [[] for _ in range(n)]\\n for itr, (a, b) in enumerate(edge):\\n if itr != i:\\n graph[a - 1].append(b - 1)\\n graph[b - 1].append(a - 1)\\n if not all(dfs(n, 0, graph)):\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.2941176471,\n", + " 'diff': ['-from scipy.sparse.csgraph import dijkstra',\n", + " '+# C - Bridge',\n", + " '+# https://atcoder.jp/contests/abc075/tasks/abc075_c',\n", + " '+from collections import deque',\n", + " '-N, M = list(map(int, input().split()))',\n", + " '-edge = [list(map(int, input().split())) for _ in range(M)]',\n", + " '-# 隣接行列',\n", + " '-graph = [[0] * (N + 1) for _ in range(N + 1)]',\n", + " '-for i, j in edge:',\n", + " '- graph[i][j] = 1',\n", + " '+',\n", + " '+def dfs(n, start, graph):',\n", + " '+ visited = [False] * n',\n", + " '+ stack = deque()',\n", + " '+ stack.append(start)',\n", + " '+ visited[start] = True',\n", + " '+ while stack:',\n", + " '+ q = stack.popleft()',\n", + " '+ nxts = graph[q]',\n", + " '+ for nxt in nxts:',\n", + " '+ if not visited[nxt]:',\n", + " '+ visited[nxt] = True',\n", + " '+ stack.append(nxt)',\n", + " '+ return visited',\n", + " '+',\n", + " '+',\n", + " '+n, m = list(map(int, input().split()))',\n", + " '+edge = [list(map(int, input().split())) for _ in range(m)]',\n", + " '-INF = 10**9',\n", + " '-for a, b in edge:',\n", + " '- # 辺を取り除く-> INF',\n", + " '- graph[a][b] = INF',\n", + " '- dist = dijkstra(graph, indices=a, directed=False) # directed=False -> 無効グラフ用',\n", + " '- if dist[b] >= INF:',\n", + " '+for i in range(m):',\n", + " '+ graph = [[] for _ in range(n)]',\n", + " '+ for itr, (a, b) in enumerate(edge):',\n", + " '+ if itr != i:',\n", + " '+ graph[a - 1].append(b - 1)',\n", + " '+ graph[b - 1].append(a - 1)',\n", + " '+ if not all(dfs(n, 0, graph)):',\n", + " '- # 元に戻す -> 1',\n", + " '- graph[a][b] = 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.4053020849,\n", + " 'measured_runtime_v1': 0.2385866599,\n", + " 'runtime_lift': 10.0814609071,\n", + " 'key': ['s237263897', 's723941772']},\n", + " {'user_id': 'u811436126',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's082576202',\n", + " 'submission_id_v1': 's465570710',\n", + " 'cpu_time_v0': 367,\n", + " 'cpu_time_v1': 30,\n", + " 'memory_v0': 9988,\n", + " 'memory_v1': 9128,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.83,\n", + " 'input': 'from functools import lru_cache\\n\\nimport sys\\n\\n\\n\\nsys.setrecursionlimit(2000)\\n\\n\\n\\ns = int(eval(input()))\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\n\\n\\n@lru_cache(maxsize=None)\\n\\ndef dfs(n):\\n\\n if n <= 2:\\n\\n return 0\\n\\n elif 3<=n<=5:\\n\\n return 1\\n\\n else:\\n\\n count = 1\\n\\n for i in range(3, n + 1):\\n\\n count += dfs(n - i)\\n\\n count %= mod\\n\\n\\n\\n return count % mod\\n\\n\\n\\n\\n\\nans = dfs(s)\\n\\nprint(ans)\\n',\n", + " 'target': 's = int(eval(input()))\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\ndp = [0] * (s + 1)\\n\\ndp[0] = 1\\n\\n\\n\\nx = 0\\n\\nfor i in range(3, s + 1):\\n\\n x += dp[i - 3]\\n\\n dp[i] = x % mod\\n\\n\\n\\nans = dp[s] % mod\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 412,\n", + " 'code_v1_num_chars': 179,\n", + " 'code_v0_no_empty_lines': 'from functools import lru_cache\\nimport sys\\n\\nsys.setrecursionlimit(2000)\\ns = int(eval(input()))\\nmod = 10**9 + 7\\n\\n\\n@lru_cache(maxsize=None)\\ndef dfs(n):\\n if n <= 2:\\n return 0\\n elif 3 <= n <= 5:\\n return 1\\n else:\\n count = 1\\n for i in range(3, n + 1):\\n count += dfs(n - i)\\n count %= mod\\n return count % mod\\n\\n\\nans = dfs(s)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 's = int(eval(input()))\\nmod = 10**9 + 7\\ndp = [0] * (s + 1)\\ndp[0] = 1\\nx = 0\\nfor i in range(3, s + 1):\\n x += dp[i - 3]\\n dp[i] = x % mod\\nans = dp[s] % mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-from functools import lru_cache',\n", + " '-import sys',\n", + " '-',\n", + " '-sys.setrecursionlimit(2000)',\n", + " '-',\n", + " '-',\n", + " '-@lru_cache(maxsize=None)',\n", + " '-def dfs(n):',\n", + " '- if n <= 2:',\n", + " '- return 0',\n", + " '- elif 3 <= n <= 5:',\n", + " '- return 1',\n", + " '- else:',\n", + " '- count = 1',\n", + " '- for i in range(3, n + 1):',\n", + " '- count += dfs(n - i)',\n", + " '- count %= mod',\n", + " '- return count % mod',\n", + " '-',\n", + " '-',\n", + " '-ans = dfs(s)',\n", + " '+dp = [0] * (s + 1)',\n", + " '+dp[0] = 1',\n", + " '+x = 0',\n", + " '+for i in range(3, s + 1):',\n", + " '+ x += dp[i - 3]',\n", + " '+ dp[i] = x % mod',\n", + " '+ans = dp[s] % mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5571973288,\n", + " 'measured_runtime_v1': 0.21483691,\n", + " 'runtime_lift': 2.593582866,\n", + " 'key': ['s082576202', 's465570710']},\n", + " {'user_id': 'u079022693',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's064765551',\n", + " 'submission_id_v1': 's282052850',\n", + " 'cpu_time_v0': 289,\n", + " 'cpu_time_v1': 146,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 49.48,\n", + " 'input': 'N=int(eval(input()))\\n\\nC=[[0]*9 for i in range(9)]\\n\\ncount=0\\n\\n\\n\\nfor n in range(1,N+1):\\n\\n if str(n)[-1]!=\"0\":\\n\\n left=int(str(n)[0])-1\\n\\n right=int(str(n)[-1])-1\\n\\n C[left][right]+=1\\n\\n \\n\\nfor i in range(1,10):\\n\\n for j in range(1,10):\\n\\n count+=C[i-1][j-1]*C[j-1][i-1]\\n\\n\\n\\nprint(count)',\n", + " 'target': 'from sys import stdin\\n\\ndef main():\\n\\n #入力\\n\\n readline=stdin.readline\\n\\n N=int(readline())\\n\\n d=dict()\\n\\n for i in range(1,N+1):\\n\\n i=str(i)\\n\\n head=i[0]\\n\\n tail=i[-1]\\n\\n if tail==\"0\":\\n\\n continue\\n\\n if (head,tail) not in d:\\n\\n d[(head,tail)]=1\\n\\n else:\\n\\n d[(head,tail)]+=1\\n\\n\\n\\n ans=0\\n\\n s=set()\\n\\n for k in list(d.keys()):\\n\\n m,l=k[0],k[1]\\n\\n if (m,l) in s:\\n\\n continue\\n\\n if (l,m) in d:\\n\\n ans+=d[(m,l)]*d[(l,m)]\\n\\n if (m,l)!=(l,m):\\n\\n ans+=d[(m,l)]*d[(l,m)]\\n\\n s.add((m,l))\\n\\n s.add((l,m))\\n\\n\\n\\n print(ans)\\n\\n\\n\\nif __name__==\"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 34,\n", + " 'code_v0_num_chars': 299,\n", + " 'code_v1_num_chars': 700,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nC = [[0] * 9 for i in range(9)]\\ncount = 0\\nfor n in range(1, N + 1):\\n if str(n)[-1] != \"0\":\\n left = int(str(n)[0]) - 1\\n right = int(str(n)[-1]) - 1\\n C[left][right] += 1\\nfor i in range(1, 10):\\n for j in range(1, 10):\\n count += C[i - 1][j - 1] * C[j - 1][i - 1]\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'from sys import stdin\\n\\n\\ndef main():\\n # 入力\\n readline = stdin.readline\\n N = int(readline())\\n d = dict()\\n for i in range(1, N + 1):\\n i = str(i)\\n head = i[0]\\n tail = i[-1]\\n if tail == \"0\":\\n continue\\n if (head, tail) not in d:\\n d[(head, tail)] = 1\\n else:\\n d[(head, tail)] += 1\\n ans = 0\\n s = set()\\n for k in list(d.keys()):\\n m, l = k[0], k[1]\\n if (m, l) in s:\\n continue\\n if (l, m) in d:\\n ans += d[(m, l)] * d[(l, m)]\\n if (m, l) != (l, m):\\n ans += d[(m, l)] * d[(l, m)]\\n s.add((m, l))\\n s.add((l, m))\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.8823529412,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-C = [[0] * 9 for i in range(9)]',\n", + " '-count = 0',\n", + " '-for n in range(1, N + 1):',\n", + " '- if str(n)[-1] != \"0\":',\n", + " '- left = int(str(n)[0]) - 1',\n", + " '- right = int(str(n)[-1]) - 1',\n", + " '- C[left][right] += 1',\n", + " '-for i in range(1, 10):',\n", + " '- for j in range(1, 10):',\n", + " '- count += C[i - 1][j - 1] * C[j - 1][i - 1]',\n", + " '-print(count)',\n", + " '+from sys import stdin',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ # 入力',\n", + " '+ readline = stdin.readline',\n", + " '+ N = int(readline())',\n", + " '+ d = dict()',\n", + " '+ for i in range(1, N + 1):',\n", + " '+ i = str(i)',\n", + " '+ head = i[0]',\n", + " '+ tail = i[-1]',\n", + " '+ if tail == \"0\":',\n", + " '+ continue',\n", + " '+ if (head, tail) not in d:',\n", + " '+ d[(head, tail)] = 1',\n", + " '+ else:',\n", + " '+ d[(head, tail)] += 1',\n", + " '+ ans = 0',\n", + " '+ s = set()',\n", + " '+ for k in list(d.keys()):',\n", + " '+ m, l = k[0], k[1]',\n", + " '+ if (m, l) in s:',\n", + " '+ continue',\n", + " '+ if (l, m) in d:',\n", + " '+ ans += d[(m, l)] * d[(l, m)]',\n", + " '+ if (m, l) != (l, m):',\n", + " '+ ans += d[(m, l)] * d[(l, m)]',\n", + " '+ s.add((m, l))',\n", + " '+ s.add((l, m))',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3649349464,\n", + " 'measured_runtime_v1': 0.2790334361,\n", + " 'runtime_lift': 1.3078538236,\n", + " 'key': ['s064765551', 's282052850']},\n", + " {'user_id': 'u981931040',\n", + " 'problem_id': 'p02873',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's351782639',\n", + " 'submission_id_v1': 's125422304',\n", + " 'cpu_time_v0': 1362,\n", + " 'cpu_time_v1': 407,\n", + " 'memory_v0': 22568,\n", + " 'memory_v1': 27056,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 70.12,\n", + " 'input': 'import numpy as np\\n\\nS = list(eval(input()))\\n\\nS_len = len(S)\\n\\nnum_lst = np.zeros(S_len + 1)\\n\\nfor i in range(S_len):\\n\\n if S[i] == \"<\":\\n\\n num_lst[i + 1] = max(num_lst[i] + 1, num_lst[i + 1])\\n\\n\\n\\n\\n\\nfor i in range(S_len - 1, -1 , -1):\\n\\n if S[i] == \">\":\\n\\n num_lst[i] = max(num_lst[i], num_lst[i + 1] + 1)\\n\\nprint((int(np.sum(num_lst))))',\n", + " 'target': \"S = list(eval(input()))\\n\\nnumList = [0] * (len(S) + 1)\\n\\nfor i in range(len(S)):\\n\\n if S[i] == '<':\\n\\n numList[i + 1] = numList[i] + 1\\n\\n\\n\\nfor i in range(len(S) - 1 , -1 , -1):\\n\\n if S[i] == '>':\\n\\n numList[i] = max(numList[i + 1] + 1 ,numList[i])\\n\\nprint((sum(numList)))\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 340,\n", + " 'code_v1_num_chars': 275,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nS = list(eval(input()))\\nS_len = len(S)\\nnum_lst = np.zeros(S_len + 1)\\nfor i in range(S_len):\\n if S[i] == \"<\":\\n num_lst[i + 1] = max(num_lst[i] + 1, num_lst[i + 1])\\nfor i in range(S_len - 1, -1, -1):\\n if S[i] == \">\":\\n num_lst[i] = max(num_lst[i], num_lst[i + 1] + 1)\\nprint((int(np.sum(num_lst))))\\n',\n", + " 'code_v1_no_empty_lines': 'S = list(eval(input()))\\nnumList = [0] * (len(S) + 1)\\nfor i in range(len(S)):\\n if S[i] == \"<\":\\n numList[i + 1] = numList[i] + 1\\nfor i in range(len(S) - 1, -1, -1):\\n if S[i] == \">\":\\n numList[i] = max(numList[i + 1] + 1, numList[i])\\nprint((sum(numList)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-S_len = len(S)',\n", + " '-num_lst = np.zeros(S_len + 1)',\n", + " '-for i in range(S_len):',\n", + " '+numList = [0] * (len(S) + 1)',\n", + " '+for i in range(len(S)):',\n", + " '- num_lst[i + 1] = max(num_lst[i] + 1, num_lst[i + 1])',\n", + " '-for i in range(S_len - 1, -1, -1):',\n", + " '+ numList[i + 1] = numList[i] + 1',\n", + " '+for i in range(len(S) - 1, -1, -1):',\n", + " '- num_lst[i] = max(num_lst[i], num_lst[i + 1] + 1)',\n", + " '-print((int(np.sum(num_lst))))',\n", + " '+ numList[i] = max(numList[i + 1] + 1, numList[i])',\n", + " '+print((sum(numList)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7631940264,\n", + " 'measured_runtime_v1': 0.252567987,\n", + " 'runtime_lift': 6.9810669474,\n", + " 'key': ['s351782639', 's125422304']},\n", + " {'user_id': 'u762420987',\n", + " 'problem_id': 'p03060',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's726202703',\n", + " 'submission_id_v1': 's079907574',\n", + " 'cpu_time_v0': 334,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 21668,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 94.91,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nVlist = np.array(list(map(int,input().split())))\\n\\nClist = np.array(list(map(int,input().split())))\\n\\n\\n\\nDlist = Vlist-Clist\\n\\n\\n\\nsum_ = 0\\n\\nfor d in Dlist:\\n\\n if d >= 0:\\n\\n sum_ += d\\n\\n\\n\\nprint(sum_)\\n',\n", + " 'target': '# 入力\\n\\nN = int(eval(input()))\\n\\nVlist = list(map(int, input().split()))\\n\\nClist = list(map(int, input().split()))\\n\\n\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n Z = Vlist[i] - Clist[i]\\n\\n if Z > 0:\\n\\n ans += Z\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 239,\n", + " 'code_v1_num_chars': 212,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nVlist = np.array(list(map(int, input().split())))\\nClist = np.array(list(map(int, input().split())))\\nDlist = Vlist - Clist\\nsum_ = 0\\nfor d in Dlist:\\n if d >= 0:\\n sum_ += d\\nprint(sum_)\\n',\n", + " 'code_v1_no_empty_lines': '# 入力\\nN = int(eval(input()))\\nVlist = list(map(int, input().split()))\\nClist = list(map(int, input().split()))\\nans = 0\\nfor i in range(N):\\n Z = Vlist[i] - Clist[i]\\n if Z > 0:\\n ans += Z\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '+# 入力',\n", + " '-Vlist = np.array(list(map(int, input().split())))',\n", + " '-Clist = np.array(list(map(int, input().split())))',\n", + " '-Dlist = Vlist - Clist',\n", + " '-sum_ = 0',\n", + " '-for d in Dlist:',\n", + " '- if d >= 0:',\n", + " '- sum_ += d',\n", + " '-print(sum_)',\n", + " '+Vlist = list(map(int, input().split()))',\n", + " '+Clist = list(map(int, input().split()))',\n", + " '+ans = 0',\n", + " '+for i in range(N):',\n", + " '+ Z = Vlist[i] - Clist[i]',\n", + " '+ if Z > 0:',\n", + " '+ ans += Z',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6892928483,\n", + " 'measured_runtime_v1': 0.2294992757,\n", + " 'runtime_lift': 7.3607763826,\n", + " 'key': ['s726202703', 's079907574']},\n", + " {'user_id': 'u829249049',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's047602834',\n", + " 'submission_id_v1': 's942020484',\n", + " 'cpu_time_v0': 745,\n", + " 'cpu_time_v1': 112,\n", + " 'memory_v0': 27280,\n", + " 'memory_v1': 9336,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.97,\n", + " 'input': 'import numpy as np\\n\\nS=eval(input())\\n\\nN=len(S)\\n\\nmod=[0 for i in range(2019)]\\n\\nmod2=0\\n\\nten=1\\n\\nfor i in range(N-1,-1,-1): \\n\\n s=int(S[i])*ten\\n\\n mod2+=np.mod(s,2019)\\n\\n mod2=np.mod(mod2,2019)\\n\\n mod[mod2]+=1\\n\\n ten=(ten*10)%2019\\n\\nans=0\\n\\nfor i in range(2019):\\n\\n k=mod[i]\\n\\n if i==0:\\n\\n if k>=2:\\n\\n ans+=k*(k-1)//2+k\\n\\n else:\\n\\n ans+=k\\n\\n else:\\n\\n if k>=2:\\n\\n ans+=k*(k-1)//2\\n\\nprint(ans) ',\n", + " 'target': 'S=eval(input())\\n\\nN=len(S)\\n\\nmod=[0 for i in range(2019)]\\n\\ns=0\\n\\nten=1\\n\\nfor i in range(N-1,-1,-1): \\n\\n s+=int(S[i])*ten\\n\\n mod2=s%2019\\n\\n mod[mod2]+=1\\n\\n ten=(ten*10)%2019\\n\\nans=0\\n\\nfor i in range(2019):\\n\\n k=mod[i]\\n\\n if i==0:\\n\\n if k>=2:\\n\\n ans+=k*(k-1)//2+k\\n\\n else:\\n\\n ans+=k\\n\\n else:\\n\\n if k>=2:\\n\\n ans+=k*(k-1)//2\\n\\nprint(ans) ',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 396,\n", + " 'code_v1_num_chars': 339,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nS = eval(input())\\nN = len(S)\\nmod = [0 for i in range(2019)]\\nmod2 = 0\\nten = 1\\nfor i in range(N - 1, -1, -1):\\n s = int(S[i]) * ten\\n mod2 += np.mod(s, 2019)\\n mod2 = np.mod(mod2, 2019)\\n mod[mod2] += 1\\n ten = (ten * 10) % 2019\\nans = 0\\nfor i in range(2019):\\n k = mod[i]\\n if i == 0:\\n if k >= 2:\\n ans += k * (k - 1) // 2 + k\\n else:\\n ans += k\\n else:\\n if k >= 2:\\n ans += k * (k - 1) // 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nN = len(S)\\nmod = [0 for i in range(2019)]\\ns = 0\\nten = 1\\nfor i in range(N - 1, -1, -1):\\n s += int(S[i]) * ten\\n mod2 = s % 2019\\n mod[mod2] += 1\\n ten = (ten * 10) % 2019\\nans = 0\\nfor i in range(2019):\\n k = mod[i]\\n if i == 0:\\n if k >= 2:\\n ans += k * (k - 1) // 2 + k\\n else:\\n ans += k\\n else:\\n if k >= 2:\\n ans += k * (k - 1) // 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-mod2 = 0',\n", + " '+s = 0',\n", + " '- s = int(S[i]) * ten',\n", + " '- mod2 += np.mod(s, 2019)',\n", + " '- mod2 = np.mod(mod2, 2019)',\n", + " '+ s += int(S[i]) * ten',\n", + " '+ mod2 = s % 2019'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3945806601,\n", + " 'measured_runtime_v1': 0.1306606822,\n", + " 'runtime_lift': 3.0198882589,\n", + " 'key': ['s047602834', 's942020484']},\n", + " {'user_id': 'u903005414',\n", + " 'problem_id': 'p02731',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's953070867',\n", + " 'submission_id_v1': 's699633695',\n", + " 'cpu_time_v0': 299,\n", + " 'cpu_time_v1': 152,\n", + " 'memory_v0': 21532,\n", + " 'memory_v1': 12420,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 49.16,\n", + " 'input': \"import numpy as np\\n\\nL = np.array(int(eval(input())), dtype='float128')\\n\\nans = (L / 3)**3\\n\\nprint(ans)\\n\",\n", + " 'target': 'import numpy as np\\n\\nL = int(eval(input()))\\n\\nans = (L / 3)**3\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 95,\n", + " 'code_v1_num_chars': 67,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nL = np.array(int(eval(input())), dtype=\"float128\")\\nans = (L / 3) ** 3\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import numpy as np\\n\\nL = int(eval(input()))\\nans = (L / 3) ** 3\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-L = np.array(int(eval(input())), dtype=\"float128\")',\n", + " '+L = int(eval(input()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3999788343,\n", + " 'measured_runtime_v1': 0.259592965,\n", + " 'runtime_lift': 5.3929767875,\n", + " 'key': ['s953070867', 's699633695']},\n", + " {'user_id': 'u597455618',\n", + " 'problem_id': 'p03640',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's574129545',\n", + " 'submission_id_v1': 's549640590',\n", + " 'cpu_time_v0': 121,\n", + " 'cpu_time_v1': 34,\n", + " 'memory_v0': 27292,\n", + " 'memory_v1': 9536,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 71.9,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\n\\n\\ndef main():\\n\\n h, w = list(map(int, sys.stdin.buffer.readline().split()))\\n\\n n = int(sys.stdin.buffer.readline())\\n\\n a = list(map(int, sys.stdin.buffer.readline().split()))\\n\\n ans = np.zeros(w*h, np.int64)\\n\\n now = 0\\n\\n for i, x in enumerate(a):\\n\\n for j in range(x):\\n\\n ans[now + j] = i+1\\n\\n now += x\\n\\n\\n\\n ans = ans.reshape(h, w)\\n\\n for i in range(h):\\n\\n if i % 2:\\n\\n print((*ans[i, ::-1]))\\n\\n else:\\n\\n print((*ans[i]))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\n\\n\\n\\n\\ndef main():\\n\\n h, w = list(map(int, sys.stdin.buffer.readline().split()))\\n\\n n = int(sys.stdin.buffer.readline())\\n\\n a = list(map(int, sys.stdin.buffer.readline().split()))\\n\\n ans = [0]*(w*h)\\n\\n now = 0\\n\\n for i, x in enumerate(a):\\n\\n for j in range(x):\\n\\n ans[now + j] = i+1\\n\\n now += x\\n\\n\\n\\n for i in range(h):\\n\\n if i % 2:\\n\\n print((*reversed(ans[i*w:(i+1)*w])))\\n\\n else:\\n\\n print((*ans[i*w:(i+1)*w]))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 561,\n", + " 'code_v1_num_chars': 522,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\n\\ndef main():\\n h, w = list(map(int, sys.stdin.buffer.readline().split()))\\n n = int(sys.stdin.buffer.readline())\\n a = list(map(int, sys.stdin.buffer.readline().split()))\\n ans = np.zeros(w * h, np.int64)\\n now = 0\\n for i, x in enumerate(a):\\n for j in range(x):\\n ans[now + j] = i + 1\\n now += x\\n ans = ans.reshape(h, w)\\n for i in range(h):\\n if i % 2:\\n print((*ans[i, ::-1]))\\n else:\\n print((*ans[i]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef main():\\n h, w = list(map(int, sys.stdin.buffer.readline().split()))\\n n = int(sys.stdin.buffer.readline())\\n a = list(map(int, sys.stdin.buffer.readline().split()))\\n ans = [0] * (w * h)\\n now = 0\\n for i, x in enumerate(a):\\n for j in range(x):\\n ans[now + j] = i + 1\\n now += x\\n for i in range(h):\\n if i % 2:\\n print((*reversed(ans[i * w : (i + 1) * w])))\\n else:\\n print((*ans[i * w : (i + 1) * w]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.0,\n", + " 'diff': ['-import numpy as np',\n", + " '- ans = np.zeros(w * h, np.int64)',\n", + " '+ ans = [0] * (w * h)',\n", + " '- ans = ans.reshape(h, w)',\n", + " '- print((*ans[i, ::-1]))',\n", + " '+ print((*reversed(ans[i * w : (i + 1) * w])))',\n", + " '- print((*ans[i]))',\n", + " '+ print((*ans[i * w : (i + 1) * w]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4232974133,\n", + " 'measured_runtime_v1': 0.1936318126,\n", + " 'runtime_lift': 7.3505349889,\n", + " 'key': ['s574129545', 's549640590']},\n", + " {'user_id': 'u207097826',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's736173164',\n", + " 'submission_id_v1': 's628306332',\n", + " 'cpu_time_v0': 499,\n", + " 'cpu_time_v1': 86,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 68180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.77,\n", + " 'input': 'import itertools\\n\\nN = int(eval(input()))\\n\\nNketa = len(str(N))\\n\\n\\n\\nrange_count = [[0 for j in range(10)]for i in range(10)]\\n\\n\\n\\n\\n\\nfor p in range(1,N+1):\\n\\n mae = int(str(p)[0])\\n\\n ato = int(str(p)[-1])\\n\\n range_count[mae][ato] += 1\\n\\n\\n\\n \\n\\n\\n\\ncount = 0\\n\\nfor j in range(1,N+1):\\n\\n a_mae = int(str(j)[0])\\n\\n a_ato = int(str(j)[-1])\\n\\n \\n\\n b_mae = a_ato\\n\\n b_ato = a_mae\\n\\n \\n\\n if b_mae == 0:\\n\\n continue\\n\\n else:\\n\\n count += range_count[b_mae][b_ato]\\n\\nprint(count)\\n\\n ',\n", + " 'target': 'n = int(eval(input()))\\n\\n\\n\\nall_count = 0\\n\\noptions = [str(i) for i in range(10)]\\n\\n\\n\\nmaeato = [[0 for i in range(10)] for j in range(10)]\\n\\n\\n\\nfor i in range(n+1):\\n\\n checking = str(i)\\n\\n maeato[int(checking[0])][int(checking[-1])]+=1\\n\\nall_count = 0\\n\\nfor i in range(1,10):\\n\\n for j in range(1,10):\\n\\n for k in range(1,10):\\n\\n for p in range(1,10):\\n\\n if i == p and j == k:\\n\\n all_count+=maeato[i][j]*maeato[k][p]\\n\\nprint(all_count)',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 491,\n", + " 'code_v1_num_chars': 473,\n", + " 'code_v0_no_empty_lines': 'import itertools\\n\\nN = int(eval(input()))\\nNketa = len(str(N))\\nrange_count = [[0 for j in range(10)] for i in range(10)]\\nfor p in range(1, N + 1):\\n mae = int(str(p)[0])\\n ato = int(str(p)[-1])\\n range_count[mae][ato] += 1\\ncount = 0\\nfor j in range(1, N + 1):\\n a_mae = int(str(j)[0])\\n a_ato = int(str(j)[-1])\\n b_mae = a_ato\\n b_ato = a_mae\\n if b_mae == 0:\\n continue\\n else:\\n count += range_count[b_mae][b_ato]\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nall_count = 0\\noptions = [str(i) for i in range(10)]\\nmaeato = [[0 for i in range(10)] for j in range(10)]\\nfor i in range(n + 1):\\n checking = str(i)\\n maeato[int(checking[0])][int(checking[-1])] += 1\\nall_count = 0\\nfor i in range(1, 10):\\n for j in range(1, 10):\\n for k in range(1, 10):\\n for p in range(1, 10):\\n if i == p and j == k:\\n all_count += maeato[i][j] * maeato[k][p]\\nprint(all_count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.7142857143,\n", + " 'diff': ['-import itertools',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '-Nketa = len(str(N))',\n", + " '-range_count = [[0 for j in range(10)] for i in range(10)]',\n", + " '-for p in range(1, N + 1):',\n", + " '- mae = int(str(p)[0])',\n", + " '- ato = int(str(p)[-1])',\n", + " '- range_count[mae][ato] += 1',\n", + " '-count = 0',\n", + " '-for j in range(1, N + 1):',\n", + " '- a_mae = int(str(j)[0])',\n", + " '- a_ato = int(str(j)[-1])',\n", + " '- b_mae = a_ato',\n", + " '- b_ato = a_mae',\n", + " '- if b_mae == 0:',\n", + " '- continue',\n", + " '- else:',\n", + " '- count += range_count[b_mae][b_ato]',\n", + " '-print(count)',\n", + " '+n = int(eval(input()))',\n", + " '+all_count = 0',\n", + " '+options = [str(i) for i in range(10)]',\n", + " '+maeato = [[0 for i in range(10)] for j in range(10)]',\n", + " '+for i in range(n + 1):',\n", + " '+ checking = str(i)',\n", + " '+ maeato[int(checking[0])][int(checking[-1])] += 1',\n", + " '+all_count = 0',\n", + " '+for i in range(1, 10):',\n", + " '+ for j in range(1, 10):',\n", + " '+ for k in range(1, 10):',\n", + " '+ for p in range(1, 10):',\n", + " '+ if i == p and j == k:',\n", + " '+ all_count += maeato[i][j] * maeato[k][p]',\n", + " '+print(all_count)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5609512657,\n", + " 'measured_runtime_v1': 0.4347667047,\n", + " 'runtime_lift': 1.2902351069,\n", + " 'key': ['s736173164', 's628306332']},\n", + " {'user_id': 'u753803401',\n", + " 'problem_id': 'p03835',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's742815481',\n", + " 'submission_id_v1': 's376437490',\n", + " 'cpu_time_v0': 1589,\n", + " 'cpu_time_v1': 1250,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.33,\n", + " 'input': 'k, s = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor i in range(k + 1):\\n\\n for j in range(k + 1):\\n\\n if i + j > s:\\n\\n break\\n\\n elif s - i - j <= k:\\n\\n cnt += 1\\n\\nprint(cnt)\\n',\n", + " 'target': 'k, s = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor i in range(k + 1):\\n\\n for j in range(k + 1):\\n\\n if 0 <= s - i - j <= k:\\n\\n cnt += 1\\n\\nprint(cnt)\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 200,\n", + " 'code_v1_num_chars': 161,\n", + " 'code_v0_no_empty_lines': 'k, s = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(k + 1):\\n for j in range(k + 1):\\n if i + j > s:\\n break\\n elif s - i - j <= k:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'k, s = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(k + 1):\\n for j in range(k + 1):\\n if 0 <= s - i - j <= k:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['- if i + j > s:',\n", + " '- break',\n", + " '- elif s - i - j <= k:',\n", + " '+ if 0 <= s - i - j <= k:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3744940901,\n", + " 'measured_runtime_v1': 0.2492418245,\n", + " 'runtime_lift': 1.5025330956,\n", + " 'key': ['s742815481', 's376437490']},\n", + " {'user_id': 'u990900604',\n", + " 'problem_id': 'p02390',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's359089221',\n", + " 'submission_id_v1': 's084524983',\n", + " 'cpu_time_v0': 50,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 9852,\n", + " 'memory_v1': 4632,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.0,\n", + " 'input': 'import sys\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n import doctest\\n\\n doctest.testmod()\\n\\n S = int(sys.stdin.read())\\n\\n h = S / 3600\\n\\n m = (S % 3600) / 60\\n\\n s = S % 60\\n\\n print(\"%d:%d:%d\" % (h, m, s))\\n',\n", + " 'target': '#!/usr/bin/env python\\n\\n#-*- coding: utf-8 -*-\\n\\n\\n\\n# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_D\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n S = int(input())\\n\\n h = S / 3600\\n\\n m = (S % 3600) / 60\\n\\n s = S % 60\\n\\n print(\"%d:%d:%d\" % (h, m, s))\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 208,\n", + " 'code_v1_num_chars': 266,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nif __name__ == \"__main__\":\\n import doctest\\n\\n doctest.testmod()\\n S = int(sys.stdin.read())\\n h = S / 3600\\n m = (S % 3600) / 60\\n s = S % 60\\n print(\"%d:%d:%d\" % (h, m, s))\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_D\\nif __name__ == \"__main__\":\\n S = int(input())\\n h = S / 3600\\n m = (S % 3600) / 60\\n s = S % 60\\n print(\"%d:%d:%d\" % (h, m, s))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '+#!/usr/bin/env python',\n", + " '+# -*- coding: utf-8 -*-',\n", + " '+# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_D',\n", + " '- import doctest',\n", + " '-',\n", + " '- doctest.testmod()',\n", + " '- S = int(sys.stdin.read())',\n", + " '+ S = int(input())'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7406475422,\n", + " 'measured_runtime_v1': 0.2172099149,\n", + " 'runtime_lift': 3.4098238217,\n", + " 'key': ['s359089221', 's084524983']},\n", + " {'user_id': 'u494927057',\n", + " 'problem_id': 'p03814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's883482084',\n", + " 'submission_id_v1': 's072538424',\n", + " 'cpu_time_v0': 59,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 3516,\n", + " 'memory_v1': 3516,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.68,\n", + " 'input': \"s = eval(input())\\n\\n\\n\\nstart = -1\\n\\nend = 0\\n\\nfor i in range(len(s)):\\n\\n if s[i] == 'A' and start < 0:\\n\\n start = i\\n\\n elif s[i] == 'Z':\\n\\n end = i\\n\\nprint((end - start + 1))\\n\",\n", + " 'target': \"s = eval(input())\\n\\n\\n\\nstart = 0\\n\\nfor i in range(len(s)):\\n\\n if s[i] == 'A':\\n\\n start = i\\n\\n break\\n\\n\\n\\nend = 0\\n\\nfor i in reversed(list(range(len(s)))):\\n\\n if s[i] == 'Z':\\n\\n end = i\\n\\n break\\n\\nprint((end - start + 1))\\n\",\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 178,\n", + " 'code_v1_num_chars': 228,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\nstart = -1\\nend = 0\\nfor i in range(len(s)):\\n if s[i] == \"A\" and start < 0:\\n start = i\\n elif s[i] == \"Z\":\\n end = i\\nprint((end - start + 1))\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nstart = 0\\nfor i in range(len(s)):\\n if s[i] == \"A\":\\n start = i\\n break\\nend = 0\\nfor i in reversed(list(range(len(s)))):\\n if s[i] == \"Z\":\\n end = i\\n break\\nprint((end - start + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 28.5714285714,\n", + " 'diff': ['-start = -1',\n", + " '+start = 0',\n", + " '+for i in range(len(s)):',\n", + " '+ if s[i] == \"A\":',\n", + " '+ start = i',\n", + " '+ break',\n", + " '-for i in range(len(s)):',\n", + " '- if s[i] == \"A\" and start < 0:',\n", + " '- start = i',\n", + " '- elif s[i] == \"Z\":',\n", + " '+for i in reversed(list(range(len(s)))):',\n", + " '+ if s[i] == \"Z\":',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2661928608,\n", + " 'measured_runtime_v1': 0.1145644054,\n", + " 'runtime_lift': 2.3235215143,\n", + " 'key': ['s883482084', 's072538424']},\n", + " {'user_id': 'u143173995',\n", + " 'problem_id': 'p03250',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's114284602',\n", + " 'submission_id_v1': 's442028856',\n", + " 'cpu_time_v0': 276,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 17964,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 93.84,\n", + " 'input': '# インポート\\n\\nimport numpy as np\\n\\n# A,B,Cの値の獲得\\n\\nnum = list(map(int, input().split()))\\n\\n# numリストの最大値を10倍\\n\\nnum[num.index(max(num))] = max(num) * 10\\n\\n# npで要素の和を計算し、出力\\n\\nprint((np.sum(num)))',\n", + " 'target': '# A,B,Cの値の獲得\\n\\nnum = list(map(int, input().split()))\\n\\n# numリストの最大値を10倍\\n\\nnum[num.index(max(num))] *= 10\\n\\n# npで要素の和を計算し、出力\\n\\nprint((sum(num)))\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 178,\n", + " 'code_v1_num_chars': 137,\n", + " 'code_v0_no_empty_lines': '# インポート\\nimport numpy as np\\n\\n# A,B,Cの値の獲得\\nnum = list(map(int, input().split()))\\n# numリストの最大値を10倍\\nnum[num.index(max(num))] = max(num) * 10\\n# npで要素の和を計算し、出力\\nprint((np.sum(num)))\\n',\n", + " 'code_v1_no_empty_lines': '# A,B,Cの値の獲得\\nnum = list(map(int, input().split()))\\n# numリストの最大値を10倍\\nnum[num.index(max(num))] *= 10\\n# npで要素の和を計算し、出力\\nprint((sum(num)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-# インポート',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-num[num.index(max(num))] = max(num) * 10',\n", + " '+num[num.index(max(num))] *= 10',\n", + " '-print((np.sum(num)))',\n", + " '+print((sum(num)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3555554001,\n", + " 'measured_runtime_v1': 0.1939001415,\n", + " 'runtime_lift': 6.990997478,\n", + " 'key': ['s114284602', 's442028856']},\n", + " {'user_id': 'u925626880',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's424280278',\n", + " 'submission_id_v1': 's408493869',\n", + " 'cpu_time_v0': 151,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12396,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.42,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\nn = int(eval(input()))\\n\\nl = np.array(list(map(int, input().split())))\\n\\n\\n\\ncount = 0\\n\\n\\n\\nwhile(1):\\n\\n if all(1 - (l % 2)):\\n\\n count += 1\\n\\n l = l / 2\\n\\n else:\\n\\n break\\n\\n\\n\\nprint(count)\\n',\n", + " 'target': 'N = eval(input())\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\ncount = 0\\n\\nwhile all(a%2==0 for a in A):\\n\\n count += 1\\n\\n A = [a/2 for a in A]\\n\\n\\n\\nprint(count)\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 246,\n", + " 'code_v1_num_chars': 151,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport numpy as np\\n\\nn = int(eval(input()))\\nl = np.array(list(map(int, input().split())))\\ncount = 0\\nwhile 1:\\n if all(1 - (l % 2)):\\n count += 1\\n l = l / 2\\n else:\\n break\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'N = eval(input())\\nA = list(map(int, input().split()))\\ncount = 0\\nwhile all(a % 2 == 0 for a in A):\\n count += 1\\n A = [a / 2 for a in A]\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 47.0588235294,\n", + " 'diff': ['-# -*- coding: utf-8 -*-',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-n = int(eval(input()))',\n", + " '-l = np.array(list(map(int, input().split())))',\n", + " '+N = eval(input())',\n", + " '+A = list(map(int, input().split()))',\n", + " '-while 1:',\n", + " '- if all(1 - (l % 2)):',\n", + " '- count += 1',\n", + " '- l = l / 2',\n", + " '- else:',\n", + " '- break',\n", + " '+while all(a % 2 == 0 for a in A):',\n", + " '+ count += 1',\n", + " '+ A = [a / 2 for a in A]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 3.0328897429,\n", + " 'measured_runtime_v1': 0.4000873275,\n", + " 'runtime_lift': 7.5805693769,\n", + " 'key': ['s424280278', 's408493869']},\n", + " {'user_id': 'u183422236',\n", + " 'problem_id': 'p02612',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's828418851',\n", + " 'submission_id_v1': 's809335980',\n", + " 'cpu_time_v0': 81,\n", + " 'cpu_time_v1': 70,\n", + " 'memory_v0': 61540,\n", + " 'memory_v1': 61736,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.58,\n", + " 'input': 'n = int(eval(input())) % 1000\\n\\nif n == 0:\\n\\n print((0))\\n\\nelse:\\n\\n print((1000 - n))',\n", + " 'target': 'n = int(eval(input()))\\n\\nprint(((1000 - n % 1000) % 1000))',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 2,\n", + " 'code_v0_num_chars': 77,\n", + " 'code_v1_num_chars': 49,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input())) % 1000\\nif n == 0:\\n print((0))\\nelse:\\n print((1000 - n))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nprint(((1000 - n % 1000) % 1000))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 60.0,\n", + " 'diff': ['-n = int(eval(input())) % 1000',\n", + " '-if n == 0:',\n", + " '- print((0))',\n", + " '-else:',\n", + " '- print((1000 - n))',\n", + " '+n = int(eval(input()))',\n", + " '+print(((1000 - n % 1000) % 1000))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2545247498,\n", + " 'measured_runtime_v1': 0.1889497155,\n", + " 'runtime_lift': 1.3470501881,\n", + " 'key': ['s828418851', 's809335980']},\n", + " {'user_id': 'u440985596',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's706783355',\n", + " 'submission_id_v1': 's449961507',\n", + " 'cpu_time_v0': 252,\n", + " 'cpu_time_v1': 161,\n", + " 'memory_v0': 20632,\n", + " 'memory_v1': 7848,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 36.11,\n", + " 'input': \"import math\\n\\ndef cmb(n, r, mod, g1, g2):\\n\\n if ( r<0 or r>n ):\\n\\n return 0\\n\\n r = min(r, n-r)\\n\\n return g1[n] * g2[r] * g2[n-r] % mod\\n\\n\\n\\ndef main():\\n\\n N, M = list(map(int, input().split()))\\n\\n A = [-1] + [int(eval(input())) for i in range(M)] + [N + 1]\\n\\n\\n\\n mod = 10**9+7 #出力の制限\\n\\n N = 10**5\\n\\n g1 = [1, 1] # 元テーブル\\n\\n g2 = [1, 1] #逆元テーブル\\n\\n inverse = [0, 1] #逆元テーブル計算用テーブル\\n\\n for i in range( 2, N + 1 ):\\n\\n g1.append( ( g1[-1] * i ) % mod )\\n\\n inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )\\n\\n g2.append( (g2[-1] * inverse[-1]) % mod )\\n\\n\\n\\n d = [0] * (len(A) - 1)\\n\\n for i in range(len(A) - 1):\\n\\n if A[i+1] - A[i] == 1:\\n\\n print((0))\\n\\n exit(0)\\n\\n d[i] = A[i+1] - 1 - (A[i] + 1)\\n\\n\\n\\n ans = 1\\n\\n for dd in d:\\n\\n if dd > 1:\\n\\n tmp = 0\\n\\n for j in range(dd//2 + 1):\\n\\n tmp += cmb(dd - j, j, mod, g1, g2)\\n\\n ans *= tmp\\n\\n\\n\\n print((ans % 1000000007))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"def main():\\n\\n N, M = list(map(int, input().split()))\\n\\n A = [int(eval(input())) for i in range(M)] + [0]\\n\\n\\n\\n a = 0\\n\\n b = 1\\n\\n j = 0\\n\\n tmp = 0\\n\\n if N == 1:\\n\\n print((1))\\n\\n else:\\n\\n for i in range(1, N + 1):\\n\\n if A[j] == i:\\n\\n if tmp == 1:\\n\\n print((0))\\n\\n exit()\\n\\n tmp = 1\\n\\n j += 1\\n\\n a = 0\\n\\n else:\\n\\n if tmp == 1:\\n\\n b = a + b\\n\\n a = 0\\n\\n else:\\n\\n c = a + b\\n\\n a = b\\n\\n b = c\\n\\n tmp = 0\\n\\n print((b % 1000000007))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 40,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 1022,\n", + " 'code_v1_num_chars': 726,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\n\\ndef cmb(n, r, mod, g1, g2):\\n if r < 0 or r > n:\\n return 0\\n r = min(r, n - r)\\n return g1[n] * g2[r] * g2[n - r] % mod\\n\\n\\ndef main():\\n N, M = list(map(int, input().split()))\\n A = [-1] + [int(eval(input())) for i in range(M)] + [N + 1]\\n mod = 10**9 + 7 # 出力の制限\\n N = 10**5\\n g1 = [1, 1] # 元テーブル\\n g2 = [1, 1] # 逆元テーブル\\n inverse = [0, 1] # 逆元テーブル計算用テーブル\\n for i in range(2, N + 1):\\n g1.append((g1[-1] * i) % mod)\\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\\n g2.append((g2[-1] * inverse[-1]) % mod)\\n d = [0] * (len(A) - 1)\\n for i in range(len(A) - 1):\\n if A[i + 1] - A[i] == 1:\\n print((0))\\n exit(0)\\n d[i] = A[i + 1] - 1 - (A[i] + 1)\\n ans = 1\\n for dd in d:\\n if dd > 1:\\n tmp = 0\\n for j in range(dd // 2 + 1):\\n tmp += cmb(dd - j, j, mod, g1, g2)\\n ans *= tmp\\n print((ans % 1000000007))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n N, M = list(map(int, input().split()))\\n A = [int(eval(input())) for i in range(M)] + [0]\\n a = 0\\n b = 1\\n j = 0\\n tmp = 0\\n if N == 1:\\n print((1))\\n else:\\n for i in range(1, N + 1):\\n if A[j] == i:\\n if tmp == 1:\\n print((0))\\n exit()\\n tmp = 1\\n j += 1\\n a = 0\\n else:\\n if tmp == 1:\\n b = a + b\\n a = 0\\n else:\\n c = a + b\\n a = b\\n b = c\\n tmp = 0\\n print((b % 1000000007))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-',\n", + " '-def cmb(n, r, mod, g1, g2):',\n", + " '- if r < 0 or r > n:',\n", + " '- return 0',\n", + " '- r = min(r, n - r)',\n", + " '- return g1[n] * g2[r] * g2[n - r] % mod',\n", + " '-',\n", + " '-',\n", + " '- A = [-1] + [int(eval(input())) for i in range(M)] + [N + 1]',\n", + " '- mod = 10**9 + 7 # 出力の制限',\n", + " '- N = 10**5',\n", + " '- g1 = [1, 1] # 元テーブル',\n", + " '- g2 = [1, 1] # 逆元テーブル',\n", + " '- inverse = [0, 1] # 逆元テーブル計算用テーブル',\n", + " '- for i in range(2, N + 1):',\n", + " '- g1.append((g1[-1] * i) % mod)',\n", + " '- inverse.append((-inverse[mod % i] * (mod // i)) % mod)',\n", + " '- g2.append((g2[-1] * inverse[-1]) % mod)',\n", + " '- d = [0] * (len(A) - 1)',\n", + " '- for i in range(len(A) - 1):',\n", + " '- if A[i + 1] - A[i] == 1:',\n", + " '- print((0))',\n", + " '- exit(0)',\n", + " '- d[i] = A[i + 1] - 1 - (A[i] + 1)',\n", + " '- ans = 1',\n", + " '- for dd in d:',\n", + " '- if dd > 1:',\n", + " '- tmp = 0',\n", + " '- for j in range(dd // 2 + 1):',\n", + " '- tmp += cmb(dd - j, j, mod, g1, g2)',\n", + " '- ans *= tmp',\n", + " '- print((ans % 1000000007))',\n", + " '+ A = [int(eval(input())) for i in range(M)] + [0]',\n", + " '+ a = 0',\n", + " '+ b = 1',\n", + " '+ j = 0',\n", + " '+ tmp = 0',\n", + " '+ if N == 1:',\n", + " '+ print((1))',\n", + " '+ else:',\n", + " '+ for i in range(1, N + 1):',\n", + " '+ if A[j] == i:',\n", + " '+ if tmp == 1:',\n", + " '+ print((0))',\n", + " '+ exit()',\n", + " '+ tmp = 1',\n", + " '+ j += 1',\n", + " '+ a = 0',\n", + " '+ else:',\n", + " '+ if tmp == 1:',\n", + " '+ b = a + b',\n", + " '+ a = 0',\n", + " '+ else:',\n", + " '+ c = a + b',\n", + " '+ a = b',\n", + " '+ b = c',\n", + " '+ tmp = 0',\n", + " '+ print((b % 1000000007))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4844854877,\n", + " 'measured_runtime_v1': 0.2640559788,\n", + " 'runtime_lift': 5.621859026,\n", + " 'key': ['s706783355', 's449961507']},\n", + " {'user_id': 'u177388368',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's386884404',\n", + " 'submission_id_v1': 's516418112',\n", + " 'cpu_time_v0': 474,\n", + " 'cpu_time_v1': 256,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 45.99,\n", + " 'input': 'import math\\n\\nn=int(eval(input()))\\n\\nans=n\\n\\ni=1\\n\\nwhile(i<=math.sqrt(n)):\\n\\n if n%i==0:\\n\\n d=i+n/i-2\\n\\n ans=min(ans,d)\\n\\n i+=1\\n\\nprint((int(ans)))',\n", + " 'target': 'from math import floor\\n\\nfrom math import sqrt\\n\\nn=int(eval(input()))\\n\\nnn=floor(sqrt(n))\\n\\nrest=n%nn\\n\\nwhile rest!=0:\\n\\n nn-=1\\n\\n rest=n%nn\\n\\nnnn=n/nn\\n\\nprint((int(nn+nnn-2)))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 150,\n", + " 'code_v1_num_chars': 165,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nans = n\\ni = 1\\nwhile i <= math.sqrt(n):\\n if n % i == 0:\\n d = i + n / i - 2\\n ans = min(ans, d)\\n i += 1\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'from math import floor\\nfrom math import sqrt\\n\\nn = int(eval(input()))\\nnn = floor(sqrt(n))\\nrest = n % nn\\nwhile rest != 0:\\n nn -= 1\\n rest = n % nn\\nnnn = n / nn\\nprint((int(nn + nnn - 2)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import math',\n", + " '+from math import floor',\n", + " '+from math import sqrt',\n", + " '-ans = n',\n", + " '-i = 1',\n", + " '-while i <= math.sqrt(n):',\n", + " '- if n % i == 0:',\n", + " '- d = i + n / i - 2',\n", + " '- ans = min(ans, d)',\n", + " '- i += 1',\n", + " '-print((int(ans)))',\n", + " '+nn = floor(sqrt(n))',\n", + " '+rest = n % nn',\n", + " '+while rest != 0:',\n", + " '+ nn -= 1',\n", + " '+ rest = n % nn',\n", + " '+nnn = n / nn',\n", + " '+print((int(nn + nnn - 2)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3770523396,\n", + " 'measured_runtime_v1': 0.2395324836,\n", + " 'runtime_lift': 1.5741177727,\n", + " 'key': ['s386884404', 's516418112']},\n", + " {'user_id': 'u188827677',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's854593654',\n", + " 'submission_id_v1': 's214318281',\n", + " 'cpu_time_v0': 39,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 9156,\n", + " 'memory_v1': 9120,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.26,\n", + " 'input': 'x = int(eval(input()))\\n\\n\\n\\nfor a in range(-118,119):\\n\\n for b in range(-119,118):\\n\\n if a**5 - b**5 == x:\\n\\n print((a,b))\\n\\n exit()',\n", + " 'target': 'x = int(eval(input()))\\n\\n\\n\\nfor i in range(0, 120):\\n\\n for j in range(-119, 120):\\n\\n if (i**5 - j**5) == x:\\n\\n print((i,j))\\n\\n exit()\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 132,\n", + " 'code_v1_num_chars': 134,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nfor a in range(-118, 119):\\n for b in range(-119, 118):\\n if a**5 - b**5 == x:\\n print((a, b))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(0, 120):\\n for j in range(-119, 120):\\n if (i**5 - j**5) == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for a in range(-118, 119):',\n", + " '- for b in range(-119, 118):',\n", + " '- if a**5 - b**5 == x:',\n", + " '- print((a, b))',\n", + " '+for i in range(0, 120):',\n", + " '+ for j in range(-119, 120):',\n", + " '+ if (i**5 - j**5) == x:',\n", + " '+ print((i, j))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3689326783,\n", + " 'measured_runtime_v1': 0.2223354737,\n", + " 'runtime_lift': 1.6593513943,\n", + " 'key': ['s854593654', 's214318281']},\n", + " {'user_id': 'u924691798',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's473277676',\n", + " 'submission_id_v1': 's669766257',\n", + " 'cpu_time_v0': 175,\n", + " 'cpu_time_v1': 139,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.57,\n", + " 'input': 'N = int(eval(input()))\\n\\nA = [0]*N\\n\\nX = []\\n\\nY = []\\n\\nfor i in range(N):\\n\\n A[i] = int(eval(input()))\\n\\n X.append([])\\n\\n Y.append([])\\n\\n for j in range(A[i]):\\n\\n x, y = list(map(int, input().split()))\\n\\n X[i].append(x-1)\\n\\n Y[i].append(y)\\n\\nans = 0\\n\\nfor bit in range(1< 0:\\n\\n x += self.data[i]\\n\\n i -= i & -i\\n\\n return x\\n\\n\\n\\n # Return sum for [l, r)\\n\\n def get_sum_range(self, l, r):\\n\\n return self.get_sum(r - 1) - self.get_sum(l - 1)\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, Q = map(int, readline().split())\\n\\n C = list(map(int, readline().split()))\\n\\n LR = map(int, read().split())\\n\\n\\n\\n prev = [-1] * (N + 1)\\n\\n ps = [[] for _ in range(N)]\\n\\n for i, c in enumerate(C):\\n\\n if prev[c] != -1:\\n\\n ps[prev[c]].append(i)\\n\\n prev[c] = i\\n\\n\\n\\n qs = [[] for _ in range(N + 1)]\\n\\n for i, (l, r) in enumerate(zip(*[iter(LR)] * 2)):\\n\\n l -= 1\\n\\n r -= 1\\n\\n qs[l].append((r, i))\\n\\n\\n\\n ans = [0] * Q\\n\\n bit = BIT(N)\\n\\n\\n\\n for l in range(N - 1, -1, -1):\\n\\n for r in ps[l]:\\n\\n bit.add(r)\\n\\n for r, i in qs[l]:\\n\\n ans[i] = (r - l + 1) - bit.get_sum(r)\\n\\n\\n\\n print(*ans, sep='\\\\n')\\n\\n\\n\\n return\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 99,\n", + " 'code_v1_loc': 68,\n", + " 'code_v0_num_chars': 2366,\n", + " 'code_v1_num_chars': 1436,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10**9)\\nINF = 1 << 60\\nMOD = 1000000007\\n# Reference: https://www.geeksforgeeks.org/queries-number-distinct-elements-subarray/\\n# Python3 code to find number of\\n# distinct numbers in a subarray\\nMAX = 1000001\\n# structure to store queries\\nclass Query:\\n def __init__(self, l, r, idx):\\n self.l = l\\n self.r = r\\n self.idx = idx\\n\\n\\n# updating the bit array\\ndef update(idx, val, bit, n):\\n while idx <= n:\\n bit[idx] += val\\n idx += idx & -idx\\n\\n\\n# querying the bit array\\ndef query(idx, bit, n):\\n summ = 0\\n while idx:\\n summ += bit[idx]\\n idx -= idx & -idx\\n return summ\\n\\n\\ndef answeringQueries(arr, n, queries, q):\\n # initialising bit array\\n bit = [0] * (n + 1)\\n # holds the rightmost index of\\n # any number as numbers of a[i]\\n # are less than or equal to 10^6\\n last_visit = [-1] * MAX\\n # answer for each query\\n ans = [0] * q\\n query_counter = 0\\n for i in range(n):\\n # If last visit is not -1 update -1 at the\\n # idx equal to last_visit[arr[i]]\\n if last_visit[arr[i]] != -1:\\n update(last_visit[arr[i]] + 1, -1, bit, n)\\n # Setting last_visit[arr[i]] as i and\\n # updating the bit array accordingly\\n last_visit[arr[i]] = i\\n update(i + 1, 1, bit, n)\\n # If i is equal to r of any query store answer\\n # for that query in ans[]\\n while query_counter < q and queries[query_counter].r == i:\\n ans[queries[query_counter].idx] = query(\\n queries[query_counter].r + 1, bit, n\\n ) - query(queries[query_counter].l, bit, n)\\n query_counter += 1\\n # print answer for each query\\n for i in range(q):\\n print((ans[i]))\\n\\n\\n# This code is contributed by\\n# sanjeev2552\\ndef main():\\n N, Q = list(map(int, readline().split()))\\n C = list(map(int, readline().split()))\\n (*LR,) = list(map(int, read().split()))\\n queries = [0] * Q\\n for i, (l, r) in enumerate(zip(*[iter(LR)] * 2)):\\n queries[i] = Query(l - 1, r - 1, i)\\n queries.sort(key=lambda x: x.r)\\n answeringQueries(C, N, queries, Q)\\n return\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10**9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\nclass BIT:\\n def __init__(self, n):\\n self.n = n\\n self.data = [0] * (n + 1)\\n\\n def add(self, i, x=1):\\n i += 1\\n while i <= self.n:\\n self.data[i] += x\\n i += i & -i\\n\\n def get_sum(self, i):\\n i += 1\\n x = 0\\n while i > 0:\\n x += self.data[i]\\n i -= i & -i\\n return x\\n\\n # Return sum for [l, r)\\n def get_sum_range(self, l, r):\\n return self.get_sum(r - 1) - self.get_sum(l - 1)\\n\\n\\ndef main():\\n N, Q = map(int, readline().split())\\n C = list(map(int, readline().split()))\\n LR = map(int, read().split())\\n prev = [-1] * (N + 1)\\n ps = [[] for _ in range(N)]\\n for i, c in enumerate(C):\\n if prev[c] != -1:\\n ps[prev[c]].append(i)\\n prev[c] = i\\n qs = [[] for _ in range(N + 1)]\\n for i, (l, r) in enumerate(zip(*[iter(LR)] * 2)):\\n l -= 1\\n r -= 1\\n qs[l].append((r, i))\\n ans = [0] * Q\\n bit = BIT(N)\\n for l in range(N - 1, -1, -1):\\n for r in ps[l]:\\n bit.add(r)\\n for r, i in qs[l]:\\n ans[i] = (r - l + 1) - bit.get_sum(r)\\n print(*ans, sep=\"\\\\n\")\\n return\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.3131313131,\n", + " 'diff': ['-# Reference: https://www.geeksforgeeks.org/queries-number-distinct-elements-subarray/',\n", + " '-# Python3 code to find number of',\n", + " '-# distinct numbers in a subarray',\n", + " '-MAX = 1000001',\n", + " '-# structure to store queries',\n", + " '-class Query:',\n", + " '- def __init__(self, l, r, idx):',\n", + " '- self.l = l',\n", + " '- self.r = r',\n", + " '- self.idx = idx',\n", + " '-# updating the bit array',\n", + " '-def update(idx, val, bit, n):',\n", + " '- while idx <= n:',\n", + " '- bit[idx] += val',\n", + " '- idx += idx & -idx',\n", + " '+class BIT:',\n", + " '+ def __init__(self, n):',\n", + " '+ self.n = n',\n", + " '+ self.data = [0] * (n + 1)',\n", + " '+',\n", + " '+ def add(self, i, x=1):',\n", + " '+ i += 1',\n", + " '+ while i <= self.n:',\n", + " '+ self.data[i] += x',\n", + " '+ i += i & -i',\n", + " '+',\n", + " '+ def get_sum(self, i):',\n", + " '+ i += 1',\n", + " '+ x = 0',\n", + " '+ while i > 0:',\n", + " '+ x += self.data[i]',\n", + " '+ i -= i & -i',\n", + " '+ return x',\n", + " '+',\n", + " '+ # Return sum for [l, r)',\n", + " '+ def get_sum_range(self, l, r):',\n", + " '+ return self.get_sum(r - 1) - self.get_sum(l - 1)',\n", + " '-# querying the bit array',\n", + " '-def query(idx, bit, n):',\n", + " '- summ = 0',\n", + " '- while idx:',\n", + " '- summ += bit[idx]',\n", + " '- idx -= idx & -idx',\n", + " '- return summ',\n", + " '-',\n", + " '-',\n", + " '-def answeringQueries(arr, n, queries, q):',\n", + " '- # initialising bit array',\n", + " '- bit = [0] * (n + 1)',\n", + " '- # holds the rightmost index of',\n", + " '- # any number as numbers of a[i]',\n", + " '- # are less than or equal to 10^6',\n", + " '- last_visit = [-1] * MAX',\n", + " '- # answer for each query',\n", + " '- ans = [0] * q',\n", + " '- query_counter = 0',\n", + " '- for i in range(n):',\n", + " '- # If last visit is not -1 update -1 at the',\n", + " '- # idx equal to last_visit[arr[i]]',\n", + " '- if last_visit[arr[i]] != -1:',\n", + " '- update(last_visit[arr[i]] + 1, -1, bit, n)',\n", + " '- # Setting last_visit[arr[i]] as i and',\n", + " '- # updating the bit array accordingly',\n", + " '- last_visit[arr[i]] = i',\n", + " '- update(i + 1, 1, bit, n)',\n", + " '- # If i is equal to r of any query store answer',\n", + " '- # for that query in ans[]',\n", + " '- while query_counter < q and queries[query_counter].r == i:',\n", + " '- ans[queries[query_counter].idx] = query(',\n", + " '- queries[query_counter].r + 1, bit, n',\n", + " '- ) - query(queries[query_counter].l, bit, n)',\n", + " '- query_counter += 1',\n", + " '- # print answer for each query',\n", + " '- for i in range(q):',\n", + " '- print((ans[i]))',\n", + " '-',\n", + " '-',\n", + " '-# This code is contributed by',\n", + " '-# sanjeev2552',\n", + " '- N, Q = list(map(int, readline().split()))',\n", + " '+ N, Q = map(int, readline().split())',\n", + " '- (*LR,) = list(map(int, read().split()))',\n", + " '- queries = [0] * Q',\n", + " '+ LR = map(int, read().split())',\n", + " '+ prev = [-1] * (N + 1)',\n", + " '+ ps = [[] for _ in range(N)]',\n", + " '+ for i, c in enumerate(C):',\n", + " '+ if prev[c] != -1:',\n", + " '+ ps[prev[c]].append(i)',\n", + " '+ prev[c] = i',\n", + " '+ qs = [[] for _ in range(N + 1)]',\n", + " '- queries[i] = Query(l - 1, r - 1, i)',\n", + " '- queries.sort(key=lambda x: x.r)',\n", + " '- answeringQueries(C, N, queries, Q)',\n", + " '+ l -= 1',\n", + " '+ r -= 1',\n", + " '+ qs[l].append((r, i))',\n", + " '+ ans = [0] * Q',\n", + " '+ bit = BIT(N)',\n", + " '+ for l in range(N - 1, -1, -1):',\n", + " '+ for r in ps[l]:',\n", + " '+ bit.add(r)',\n", + " '+ for r, i in qs[l]:',\n", + " '+ ans[i] = (r - l + 1) - bit.get_sum(r)',\n", + " '+ print(*ans, sep=\"\\\\n\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.264044944,\n", + " 'measured_runtime_v1': 0.2106282006,\n", + " 'runtime_lift': 1.2536067971,\n", + " 'key': ['s648865207', 's892817156']},\n", + " {'user_id': 'u393253137',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's794256283',\n", + " 'submission_id_v1': 's949005771',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.59,\n", + " 'input': 'a,b,c,x,y=list(map(int,input().split()))\\n\\nans=a*x+b*y\\n\\nfor HaH in range(0,2*max(x,y)+1,2):\\n\\n ans = min(ans, c*HaH+max(0, a*(x-HaH//2))+max(0, b*(y-HaH//2)))\\n\\nprint(ans)',\n", + " 'target': 'a,b,c,x,y=list(map(int,input().split()))\\n\\nans=0\\n\\nm=min(x,y)\\n\\nif a+b>=2*c: #Half and Half購入で安くなる可能性あるパターン\\n\\n # HaHをm枚買って残りHaH購入,または全部HaH購入,このいずれかしかあり得ない\\n\\n ans = min(2*c*m+a*(x-m)+b*(y-m), 2*c*max(x,y))\\n\\nelse:\\n\\n ans = a*x+b*y\\n\\nprint(ans)',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 165,\n", + " 'code_v1_num_chars': 237,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = a * x + b * y\\nfor HaH in range(0, 2 * max(x, y) + 1, 2):\\n ans = min(ans, c * HaH + max(0, a * (x - HaH // 2)) + max(0, b * (y - HaH // 2)))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = 0\\nm = min(x, y)\\nif a + b >= 2 * c: # Half and Half購入で安くなる可能性あるパターン\\n # HaHをm枚買って残りHaH購入,または全部HaH購入,このいずれかしかあり得ない\\n ans = min(2 * c * m + a * (x - m) + b * (y - m), 2 * c * max(x, y))\\nelse:\\n ans = a * x + b * y\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 44.4444444444,\n", + " 'diff': ['-ans = a * x + b * y',\n", + " '-for HaH in range(0, 2 * max(x, y) + 1, 2):',\n", + " '- ans = min(ans, c * HaH + max(0, a * (x - HaH // 2)) + max(0, b * (y - HaH // 2)))',\n", + " '+ans = 0',\n", + " '+m = min(x, y)',\n", + " '+if a + b >= 2 * c: # Half and Half購入で安くなる可能性あるパターン',\n", + " '+ # HaHをm枚買って残りHaH購入,または全部HaH購入,このいずれかしかあり得ない',\n", + " '+ ans = min(2 * c * m + a * (x - m) + b * (y - m), 2 * c * max(x, y))',\n", + " '+else:',\n", + " '+ ans = a * x + b * y'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.479530653,\n", + " 'measured_runtime_v1': 0.260008795,\n", + " 'runtime_lift': 1.8442862786,\n", + " 'key': ['s794256283', 's949005771']},\n", + " {'user_id': 'u645250356',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's344747010',\n", + " 'submission_id_v1': 's621981799',\n", + " 'cpu_time_v0': 434,\n", + " 'cpu_time_v1': 102,\n", + " 'memory_v0': 70376,\n", + " 'memory_v1': 21544,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.5,\n", + " 'input': 'from collections import Counter,defaultdict,deque\\n\\nimport sys,heapq,bisect,math,itertools,string,queue\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef inpl_str(): return list(sys.stdin.readline().split())\\n\\ndef inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\n\\nn = inp()\\n\\na = inpl()\\n\\naa = []\\n\\nfor i in range(n):\\n\\n aa.append([i+1,a[i]])\\n\\naa.sort(key=lambda x:x[1])\\n\\nfor i in range(n):\\n\\n print((aa[i][0]))\\n\\n\\n',\n", + " 'target': \"from collections import Counter,defaultdict,deque\\n\\nfrom heapq import heappop,heappush\\n\\nfrom bisect import bisect_left,bisect_right \\n\\nimport sys,math,itertools,fractions\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\nINF = float('inf')\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\nn = inp()\\n\\na = inpl()\\n\\nres = [0] * n\\n\\nfor i,x in enumerate(a):\\n\\n res[x-1] = i+1\\n\\nprint((*res))\\n\",\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 541,\n", + " 'code_v1_num_chars': 443,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nimport sys, heapq, bisect, math, itertools, string, queue\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef inpl_str():\\n return list(sys.stdin.readline().split())\\n\\n\\ndef inpln(n):\\n return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\nn = inp()\\na = inpl()\\naa = []\\nfor i in range(n):\\n aa.append([i + 1, a[i]])\\naa.sort(key=lambda x: x[1])\\nfor i in range(n):\\n print((aa[i][0]))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nfrom heapq import heappop, heappush\\nfrom bisect import bisect_left, bisect_right\\nimport sys, math, itertools, fractions\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\nINF = float(\"inf\")\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\nn = inp()\\na = inpl()\\nres = [0] * n\\nfor i, x in enumerate(a):\\n res[x - 1] = i + 1\\nprint((*res))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-import sys, heapq, bisect, math, itertools, string, queue',\n", + " '+from heapq import heappop, heappush',\n", + " '+from bisect import bisect_left, bisect_right',\n", + " '+import sys, math, itertools, fractions',\n", + " '+INF = float(\"inf\")',\n", + " '-def inpl_str():',\n", + " '- return list(sys.stdin.readline().split())',\n", + " '-',\n", + " '-',\n", + " '-def inpln(n):',\n", + " '- return list(int(sys.stdin.readline()) for i in range(n))',\n", + " '-',\n", + " '-',\n", + " '-aa = []',\n", + " '-for i in range(n):',\n", + " '- aa.append([i + 1, a[i]])',\n", + " '-aa.sort(key=lambda x: x[1])',\n", + " '-for i in range(n):',\n", + " '- print((aa[i][0]))',\n", + " '+res = [0] * n',\n", + " '+for i, x in enumerate(a):',\n", + " '+ res[x - 1] = i + 1',\n", + " '+print((*res))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2881344714,\n", + " 'measured_runtime_v1': 0.207670383,\n", + " 'runtime_lift': 1.3874605868,\n", + " 'key': ['s344747010', 's621981799']},\n", + " {'user_id': 'u693694535',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's328045307',\n", + " 'submission_id_v1': 's953197610',\n", + " 'cpu_time_v0': 105,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 9176,\n", + " 'memory_v1': 9168,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.24,\n", + " 'input': 'A,B,C,X,Y=list(map(int,input().split()))\\n\\n\\n\\nK=10**9\\n\\nfor i in range(10**5+1):\\n\\n S=i*2*C+max(0,X-i)*A+max(0,Y-i)*B\\n\\n K=min(K,S)\\n\\nprint(K)',\n", + " 'target': 'A,B,C,X,Y=list(map(int,input().split()))\\n\\n\\n\\na=min(X,Y)*min(A+B,2*C)\\n\\n\\n\\na+=max(0,X-Y)*min(A,2*C)\\n\\na+=max(0,Y-X)*min(B,2*C)\\n\\n\\n\\n\\n\\nprint(a)',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 136,\n", + " 'code_v1_num_chars': 129,\n", + " 'code_v0_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nK = 10**9\\nfor i in range(10**5 + 1):\\n S = i * 2 * C + max(0, X - i) * A + max(0, Y - i) * B\\n K = min(K, S)\\nprint(K)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\na = min(X, Y) * min(A + B, 2 * C)\\na += max(0, X - Y) * min(A, 2 * C)\\na += max(0, Y - X) * min(B, 2 * C)\\nprint(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['-K = 10**9',\n", + " '-for i in range(10**5 + 1):',\n", + " '- S = i * 2 * C + max(0, X - i) * A + max(0, Y - i) * B',\n", + " '- K = min(K, S)',\n", + " '-print(K)',\n", + " '+a = min(X, Y) * min(A + B, 2 * C)',\n", + " '+a += max(0, X - Y) * min(A, 2 * C)',\n", + " '+a += max(0, Y - X) * min(B, 2 * C)',\n", + " '+print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3979784026,\n", + " 'measured_runtime_v1': 0.2418090019,\n", + " 'runtime_lift': 5.7813331656,\n", + " 'key': ['s328045307', 's953197610']},\n", + " {'user_id': 'u290563917',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's511736682',\n", + " 'submission_id_v1': 's377839923',\n", + " 'cpu_time_v0': 188,\n", + " 'cpu_time_v1': 64,\n", + " 'memory_v0': 40940,\n", + " 'memory_v1': 65396,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 65.96,\n", + " 'input': \"a, b, c, x, y = list(map(int, input().split()))\\n\\n# print(a, b, c, x, y)\\n\\n\\n\\nans = 10000 * (10 **5) + 7\\n\\nc_max = 0\\n\\nif x > y:\\n\\n c_max = x * 2\\n\\nelse:\\n\\n c_max = y * 2\\n\\n\\n\\nfor cc in range(c_max+1):\\n\\n ac = x - (cc // 2)\\n\\n bc = y - (cc // 2)\\n\\n \\n\\n if ac < 0:\\n\\n ac = 0\\n\\n if bc < 0:\\n\\n bc = 0\\n\\n price = ac * a + bc * b + cc * c\\n\\n # print('price: {}, ac: {}, bc: {}, cc: {}'.format(price, ac, bc, cc))\\n\\n ans = min(ans, price)\\n\\n\\n\\nprint(ans)\",\n", + " 'target': \"a, b, c, x, y = list(map(int, input().split()))\\n\\n# print(a, b, c, x, y)\\n\\n\\n\\nans = 10000 * (10 **5) + 7\\n\\nc_max = 0\\n\\nif x > y:\\n\\n c_max = x * 2\\n\\nelse:\\n\\n c_max = y * 2\\n\\n\\n\\nfor cc in range(0, c_max+1, 2):\\n\\n ac = x - (cc // 2)\\n\\n bc = y - (cc // 2)\\n\\n \\n\\n if ac < 0:\\n\\n ac = 0\\n\\n if bc < 0:\\n\\n bc = 0\\n\\n price = ac * a + bc * b + cc * c\\n\\n # print('price: {}, ac: {}, bc: {}, cc: {}'.format(price, ac, bc, cc))\\n\\n ans = min(ans, price)\\n\\n\\n\\nprint(ans)\\n\\n \",\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 436,\n", + " 'code_v1_num_chars': 446,\n", + " 'code_v0_no_empty_lines': \"a, b, c, x, y = list(map(int, input().split()))\\n# print(a, b, c, x, y)\\nans = 10000 * (10**5) + 7\\nc_max = 0\\nif x > y:\\n c_max = x * 2\\nelse:\\n c_max = y * 2\\nfor cc in range(c_max + 1):\\n ac = x - (cc // 2)\\n bc = y - (cc // 2)\\n if ac < 0:\\n ac = 0\\n if bc < 0:\\n bc = 0\\n price = ac * a + bc * b + cc * c\\n # print('price: {}, ac: {}, bc: {}, cc: {}'.format(price, ac, bc, cc))\\n ans = min(ans, price)\\nprint(ans)\\n\",\n", + " 'code_v1_no_empty_lines': \"a, b, c, x, y = list(map(int, input().split()))\\n# print(a, b, c, x, y)\\nans = 10000 * (10**5) + 7\\nc_max = 0\\nif x > y:\\n c_max = x * 2\\nelse:\\n c_max = y * 2\\nfor cc in range(0, c_max + 1, 2):\\n ac = x - (cc // 2)\\n bc = y - (cc // 2)\\n if ac < 0:\\n ac = 0\\n if bc < 0:\\n bc = 0\\n price = ac * a + bc * b + cc * c\\n # print('price: {}, ac: {}, bc: {}, cc: {}'.format(price, ac, bc, cc))\\n ans = min(ans, price)\\nprint(ans)\\n\",\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.1666666667,\n", + " 'diff': ['-for cc in range(c_max + 1):',\n", + " '+for cc in range(0, c_max + 1, 2):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4004499781,\n", + " 'measured_runtime_v1': 0.3093135242,\n", + " 'runtime_lift': 1.2946410251,\n", + " 'key': ['s511736682', 's377839923']},\n", + " {'user_id': 'u991567869',\n", + " 'problem_id': 'p03854',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's135519212',\n", + " 'submission_id_v1': 's896370774',\n", + " 'cpu_time_v0': 59,\n", + " 'cpu_time_v1': 42,\n", + " 'memory_v0': 9264,\n", + " 'memory_v1': 12828,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.81,\n", + " 'input': 's = input()[::-1]\\n\\n\\n\\nwhile True:\\n\\n if len(s) == 0:\\n\\n break\\n\\n if s[:7] == \"remaerd\":\\n\\n s = s[7:]\\n\\n elif s[:6] == \"resare\":\\n\\n s = s[6:]\\n\\n elif s[:5] == \"maerd\" or s[:5] == \"esare\":\\n\\n s = s[5:]\\n\\n else:\\n\\n print(\"NO\")\\n\\n exit()\\n\\n\\n\\nprint(\"YES\")',\n", + " 'target': 'import re\\n\\n\\n\\ns = eval(input())\\n\\n\\n\\nif re.fullmatch(r\"(dream|dreamer|erase|eraser)+\", s):\\n\\n print(\"YES\")\\n\\nelse:\\n\\n print(\"NO\")',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 294,\n", + " 'code_v1_num_chars': 123,\n", + " 'code_v0_no_empty_lines': 's = input()[::-1]\\nwhile True:\\n if len(s) == 0:\\n break\\n if s[:7] == \"remaerd\":\\n s = s[7:]\\n elif s[:6] == \"resare\":\\n s = s[6:]\\n elif s[:5] == \"maerd\" or s[:5] == \"esare\":\\n s = s[5:]\\n else:\\n print(\"NO\")\\n exit()\\nprint(\"YES\")\\n',\n", + " 'code_v1_no_empty_lines': 'import re\\n\\ns = eval(input())\\nif re.fullmatch(r\"(dream|dreamer|erase|eraser)+\", s):\\n print(\"YES\")\\nelse:\\n print(\"NO\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-s = input()[::-1]',\n", + " '-while True:',\n", + " '- if len(s) == 0:',\n", + " '- break',\n", + " '- if s[:7] == \"remaerd\":',\n", + " '- s = s[7:]',\n", + " '- elif s[:6] == \"resare\":',\n", + " '- s = s[6:]',\n", + " '- elif s[:5] == \"maerd\" or s[:5] == \"esare\":',\n", + " '- s = s[5:]',\n", + " '- else:',\n", + " '- print(\"NO\")',\n", + " '- exit()',\n", + " '-print(\"YES\")',\n", + " '+import re',\n", + " '+',\n", + " '+s = eval(input())',\n", + " '+if re.fullmatch(r\"(dream|dreamer|erase|eraser)+\", s):',\n", + " '+ print(\"YES\")',\n", + " '+else:',\n", + " '+ print(\"NO\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1782437842,\n", + " 'measured_runtime_v1': 0.0065195048,\n", + " 'runtime_lift': 27.340080233,\n", + " 'key': ['s135519212', 's896370774']},\n", + " {'user_id': 'u775681539',\n", + " 'problem_id': 'p03752',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's912626788',\n", + " 'submission_id_v1': 's563152491',\n", + " 'cpu_time_v0': 311,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 12484,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.96,\n", + " 'input': \"import numpy as np\\n\\nfrom itertools import combinations \\n\\nINF = int(1e9)*15\\n\\ndef main():\\n\\n n, k = list(map(int, input().split())) \\n\\n a = np.array(input().split(), np.int32)\\n\\n c = np.array([int(i) for i in range(1, n)])\\n\\n ans = INF\\n\\n for comb in combinations(c, k-1):\\n\\n s = set(comb)\\n\\n mx = a[0]\\n\\n cost = 0\\n\\n for i in range(n):\\n\\n if i in s:\\n\\n if a[i] > mx:\\n\\n mx = a[i]\\n\\n continue\\n\\n else:\\n\\n mx += 1\\n\\n cost += mx-a[i] \\n\\n continue\\n\\n mx = max(mx, a[i])\\n\\n ans = min(cost, ans)\\n\\n print(ans)\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"from itertools import combinations \\n\\nINF = int(1e9)*15\\n\\ndef main():\\n\\n n, k = list(map(int, input().split())) \\n\\n a = [int(i) for i in input().split()]\\n\\n c = [int(i) for i in range(1, n)]\\n\\n ans = INF\\n\\n for comb in combinations(c, k-1):\\n\\n s = set(comb)\\n\\n mx = a[0]\\n\\n cost = 0\\n\\n for i in range(n):\\n\\n if i in s:\\n\\n if a[i] > mx:\\n\\n mx = a[i]\\n\\n continue\\n\\n else:\\n\\n mx += 1\\n\\n cost += mx-a[i] \\n\\n continue\\n\\n mx = max(mx, a[i])\\n\\n ans = min(cost, ans)\\n\\n print(ans)\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 717,\n", + " 'code_v1_num_chars': 685,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nfrom itertools import combinations\\n\\nINF = int(1e9) * 15\\n\\n\\ndef main():\\n n, k = list(map(int, input().split()))\\n a = np.array(input().split(), np.int32)\\n c = np.array([int(i) for i in range(1, n)])\\n ans = INF\\n for comb in combinations(c, k - 1):\\n s = set(comb)\\n mx = a[0]\\n cost = 0\\n for i in range(n):\\n if i in s:\\n if a[i] > mx:\\n mx = a[i]\\n continue\\n else:\\n mx += 1\\n cost += mx - a[i]\\n continue\\n mx = max(mx, a[i])\\n ans = min(cost, ans)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from itertools import combinations\\n\\nINF = int(1e9) * 15\\n\\n\\ndef main():\\n n, k = list(map(int, input().split()))\\n a = [int(i) for i in input().split()]\\n c = [int(i) for i in range(1, n)]\\n ans = INF\\n for comb in combinations(c, k - 1):\\n s = set(comb)\\n mx = a[0]\\n cost = 0\\n for i in range(n):\\n if i in s:\\n if a[i] > mx:\\n mx = a[i]\\n continue\\n else:\\n mx += 1\\n cost += mx - a[i]\\n continue\\n mx = max(mx, a[i])\\n ans = min(cost, ans)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.8461538462,\n", + " 'diff': ['-import numpy as np',\n", + " '- a = np.array(input().split(), np.int32)',\n", + " '- c = np.array([int(i) for i in range(1, n)])',\n", + " '+ a = [int(i) for i in input().split()]',\n", + " '+ c = [int(i) for i in range(1, n)]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8447637084,\n", + " 'measured_runtime_v1': 0.2996491623,\n", + " 'runtime_lift': 6.1564120326,\n", + " 'key': ['s912626788', 's563152491']},\n", + " {'user_id': 'u595289165',\n", + " 'problem_id': 'p03060',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's881584489',\n", + " 'submission_id_v1': 's205765913',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12508,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.59,\n", + " 'input': 'import numpy as np\\n\\nn = int(eval(input()))\\n\\nvalue = np.array(tuple(map(int, input().split())))\\n\\ncost = np.array(tuple(map(int, input().split())))\\n\\nxy = value - cost\\n\\nans = 0\\n\\nfor i in range(n):\\n\\n if xy[i] < 0:\\n\\n continue\\n\\n else:\\n\\n ans += xy[i]\\n\\nprint(ans)',\n", + " 'target': 'n = int(eval(input()))\\n\\nvalue = tuple(map(int, input().split()))\\n\\ncost = tuple(map(int, input().split()))\\n\\n# iこめまでのxーyの最大値\\n\\ninf = -100\\n\\ndp = [inf] * (n+1)\\n\\ndp[1] = max(0, value[0]-cost[0])\\n\\nfor i in range(2, n+1):\\n\\n dp[i] = max(dp[i-1], dp[i-1]+value[i-1]-cost[i-1])\\n\\n\\n\\nprint((dp[n]))\\n',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 269,\n", + " 'code_v1_num_chars': 280,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nvalue = np.array(tuple(map(int, input().split())))\\ncost = np.array(tuple(map(int, input().split())))\\nxy = value - cost\\nans = 0\\nfor i in range(n):\\n if xy[i] < 0:\\n continue\\n else:\\n ans += xy[i]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nvalue = tuple(map(int, input().split()))\\ncost = tuple(map(int, input().split()))\\n# iこめまでのxーyの最大値\\ninf = -100\\ndp = [inf] * (n + 1)\\ndp[1] = max(0, value[0] - cost[0])\\nfor i in range(2, n + 1):\\n dp[i] = max(dp[i - 1], dp[i - 1] + value[i - 1] - cost[i - 1])\\nprint((dp[n]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-value = np.array(tuple(map(int, input().split())))',\n", + " '-cost = np.array(tuple(map(int, input().split())))',\n", + " '-xy = value - cost',\n", + " '-ans = 0',\n", + " '-for i in range(n):',\n", + " '- if xy[i] < 0:',\n", + " '- continue',\n", + " '- else:',\n", + " '- ans += xy[i]',\n", + " '-print(ans)',\n", + " '+value = tuple(map(int, input().split()))',\n", + " '+cost = tuple(map(int, input().split()))',\n", + " '+# iこめまでのxーyの最大値',\n", + " '+inf = -100',\n", + " '+dp = [inf] * (n + 1)',\n", + " '+dp[1] = max(0, value[0] - cost[0])',\n", + " '+for i in range(2, n + 1):',\n", + " '+ dp[i] = max(dp[i - 1], dp[i - 1] + value[i - 1] - cost[i - 1])',\n", + " '+print((dp[n]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4092471268,\n", + " 'measured_runtime_v1': 0.2268988938,\n", + " 'runtime_lift': 6.2109034687,\n", + " 'key': ['s881584489', 's205765913']},\n", + " {'user_id': 'u263753244',\n", + " 'problem_id': 'p03835',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's871403539',\n", + " 'submission_id_v1': 's899034376',\n", + " 'cpu_time_v0': 1228,\n", + " 'cpu_time_v1': 261,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 42092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 78.75,\n", + " 'input': 'k,s=list(map(int,input().split()))\\n\\ncnt=0\\n\\nfor i in range(k+1):\\n\\n for j in range(k+1):\\n\\n if 0 <= s-i-j <= k:\\n\\n cnt+=1\\n\\nprint(cnt)',\n", + " 'target': 'k,s=list(map(int,input().split()))\\n\\na=0\\n\\nfor i in range(0,k+1):\\n\\n for j in range(0,k+1):\\n\\n if 0<=s-i-j<=k:\\n\\n a+=1\\n\\nprint(a)',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 144,\n", + " 'code_v1_num_chars': 138,\n", + " 'code_v0_no_empty_lines': 'k, s = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(k + 1):\\n for j in range(k + 1):\\n if 0 <= s - i - j <= k:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'k, s = list(map(int, input().split()))\\na = 0\\nfor i in range(0, k + 1):\\n for j in range(0, k + 1):\\n if 0 <= s - i - j <= k:\\n a += 1\\nprint(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-cnt = 0',\n", + " '-for i in range(k + 1):',\n", + " '- for j in range(k + 1):',\n", + " '+a = 0',\n", + " '+for i in range(0, k + 1):',\n", + " '+ for j in range(0, k + 1):',\n", + " '- cnt += 1',\n", + " '-print(cnt)',\n", + " '+ a += 1',\n", + " '+print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2440719529,\n", + " 'measured_runtime_v1': 0.12879462,\n", + " 'runtime_lift': 1.8950477354,\n", + " 'key': ['s871403539', 's899034376']},\n", + " {'user_id': 'u328510800',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's903355789',\n", + " 'submission_id_v1': 's800578512',\n", + " 'cpu_time_v0': 617,\n", + " 'cpu_time_v1': 144,\n", + " 'memory_v0': 23416,\n", + " 'memory_v1': 30160,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.66,\n", + " 'input': 'import numpy as np\\n\\nn = int(eval(input()))\\n\\na = np.array(list(map(int, input().split())))\\n\\n\\n\\nprint((*list([x + 1 for x in np.argsort(a)])))',\n", + " 'target': \"n = int(eval(input()))\\n\\nm = [(x, 0) for x in range(1, n+1)]\\n\\n\\n\\nfor i, x in enumerate(map(int, input().split())):\\n\\n m[i] = (m[i][0], x)\\n\\nm.sort(key=lambda x : x[1])\\n\\nprint((' '.join([str(x[0]) for x in m])))\",\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 137,\n", + " 'code_v1_num_chars': 199,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\na = np.array(list(map(int, input().split())))\\nprint((*list([x + 1 for x in np.argsort(a)])))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nm = [(x, 0) for x in range(1, n + 1)]\\nfor i, x in enumerate(map(int, input().split())):\\n m[i] = (m[i][0], x)\\nm.sort(key=lambda x: x[1])\\nprint((\" \".join([str(x[0]) for x in m])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 28.5714285714,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-a = np.array(list(map(int, input().split())))',\n", + " '-print((*list([x + 1 for x in np.argsort(a)])))',\n", + " '+m = [(x, 0) for x in range(1, n + 1)]',\n", + " '+for i, x in enumerate(map(int, input().split())):',\n", + " '+ m[i] = (m[i][0], x)',\n", + " '+m.sort(key=lambda x: x[1])',\n", + " '+print((\" \".join([str(x[0]) for x in m])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3737991261,\n", + " 'measured_runtime_v1': 0.1981218202,\n", + " 'runtime_lift': 6.9341131869,\n", + " 'key': ['s903355789', 's800578512']},\n", + " {'user_id': 'u140201022',\n", + " 'problem_id': 'p02412',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's179146540',\n", + " 'submission_id_v1': 's419434066',\n", + " 'cpu_time_v0': 420,\n", + " 'cpu_time_v1': 30,\n", + " 'memory_v0': 4208,\n", + " 'memory_v1': 4204,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.86,\n", + " 'input': 'while 1:\\n\\n ans=0\\n\\n n,x=list(map(int,input().split()))\\n\\n if n:\\n\\n for i in range(1,n-1):\\n\\n for j in range(i+1,n):\\n\\n for k in range(j+1,n+1):\\n\\n if i+j+k==x:ans+=1\\n\\n else:break\\n\\n print(ans)',\n", + " 'target': 'while 1:\\n\\n a=0\\n\\n n,x=list(map(int,input().split()))\\n\\n if n==0:break\\n\\n for i in range(1,n-1):\\n\\n for j in range(i+1,n):\\n\\n c=x-i-j\\n\\n if c>j and c<=n:a+=1\\n\\n print(a)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 249,\n", + " 'code_v1_num_chars': 202,\n", + " 'code_v0_no_empty_lines': 'while 1:\\n ans = 0\\n n, x = list(map(int, input().split()))\\n if n:\\n for i in range(1, n - 1):\\n for j in range(i + 1, n):\\n for k in range(j + 1, n + 1):\\n if i + j + k == x:\\n ans += 1\\n else:\\n break\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'while 1:\\n a = 0\\n n, x = list(map(int, input().split()))\\n if n == 0:\\n break\\n for i in range(1, n - 1):\\n for j in range(i + 1, n):\\n c = x - i - j\\n if c > j and c <= n:\\n a += 1\\n print(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['- ans = 0',\n", + " '+ a = 0',\n", + " '- if n:',\n", + " '- for i in range(1, n - 1):',\n", + " '- for j in range(i + 1, n):',\n", + " '- for k in range(j + 1, n + 1):',\n", + " '- if i + j + k == x:',\n", + " '- ans += 1',\n", + " '- else:',\n", + " '+ if n == 0:',\n", + " '- print(ans)',\n", + " '+ for i in range(1, n - 1):',\n", + " '+ for j in range(i + 1, n):',\n", + " '+ c = x - i - j',\n", + " '+ if c > j and c <= n:',\n", + " '+ a += 1',\n", + " '+ print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3642889087,\n", + " 'measured_runtime_v1': 0.2896689522,\n", + " 'runtime_lift': 1.2576042614,\n", + " 'key': ['s179146540', 's419434066']},\n", + " {'user_id': 'u940568210',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's276670685',\n", + " 'submission_id_v1': 's252609642',\n", + " 'cpu_time_v0': 167,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 13884,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.62,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nh, w = tuple(map(int, input().split()))\\n\\nmatrix = np.zeros((h, w), dtype=bool)\\n\\nfor i in range(h):\\n\\n row = np.array(list(input()))\\n\\n matrix[i, :] = row == \".\"\\n\\n\\n\\nfor i in range(h)[::-1]:\\n\\n if np.all(matrix[i, :]):\\n\\n matrix = np.delete(matrix, i, 0)\\n\\n\\n\\nfor i in range(w)[::-1]:\\n\\n if np.all(matrix[:, i]):\\n\\n matrix = np.delete(matrix, i, 1)\\n\\n\\n\\nmatrix = np.where(matrix, \".\", \"#\")\\n\\nfor row in matrix:\\n\\n for e in row:\\n\\n print(e, end=\"\")\\n\\n print()\\n',\n", + " 'target': '# h wの読み込み\\n\\nh, w = list(map(int, input().split()))\\n\\n# 行列作成\\n\\nmat = [eval(input()) for _ in range(h)]\\n\\n\\n\\n# #が含まれていない行を削除\\n\\n[mat.remove(row) for row in mat[::-1] if (\"#\" not in row)]\\n\\n# #が含まれている列のインデックスを取得\\n\\nshowCol = [i for i in range(w) if \"#\" in [row[i] for row in mat]]\\n\\n\\n\\n# 表示\\n\\nprint((\"\\\\n\".join([\"\".join([row[c] for c in showCol]) for row in mat])))\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 504,\n", + " 'code_v1_num_chars': 336,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nh, w = tuple(map(int, input().split()))\\nmatrix = np.zeros((h, w), dtype=bool)\\nfor i in range(h):\\n row = np.array(list(input()))\\n matrix[i, :] = row == \".\"\\nfor i in range(h)[::-1]:\\n if np.all(matrix[i, :]):\\n matrix = np.delete(matrix, i, 0)\\nfor i in range(w)[::-1]:\\n if np.all(matrix[:, i]):\\n matrix = np.delete(matrix, i, 1)\\nmatrix = np.where(matrix, \".\", \"#\")\\nfor row in matrix:\\n for e in row:\\n print(e, end=\"\")\\n print()\\n',\n", + " 'code_v1_no_empty_lines': '# h wの読み込み\\nh, w = list(map(int, input().split()))\\n# 行列作成\\nmat = [eval(input()) for _ in range(h)]\\n# #が含まれていない行を削除\\n[mat.remove(row) for row in mat[::-1] if (\"#\" not in row)]\\n# #が含まれている列のインデックスを取得\\nshowCol = [i for i in range(w) if \"#\" in [row[i] for row in mat]]\\n# 表示\\nprint((\"\\\\n\".join([\"\".join([row[c] for c in showCol]) for row in mat])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.8571428571,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-h, w = tuple(map(int, input().split()))',\n", + " '-matrix = np.zeros((h, w), dtype=bool)',\n", + " '-for i in range(h):',\n", + " '- row = np.array(list(input()))',\n", + " '- matrix[i, :] = row == \".\"',\n", + " '-for i in range(h)[::-1]:',\n", + " '- if np.all(matrix[i, :]):',\n", + " '- matrix = np.delete(matrix, i, 0)',\n", + " '-for i in range(w)[::-1]:',\n", + " '- if np.all(matrix[:, i]):',\n", + " '- matrix = np.delete(matrix, i, 1)',\n", + " '-matrix = np.where(matrix, \".\", \"#\")',\n", + " '-for row in matrix:',\n", + " '- for e in row:',\n", + " '- print(e, end=\"\")',\n", + " '- print()',\n", + " '+# h wの読み込み',\n", + " '+h, w = list(map(int, input().split()))',\n", + " '+# 行列作成',\n", + " '+mat = [eval(input()) for _ in range(h)]',\n", + " '+# #が含まれていない行を削除',\n", + " '+[mat.remove(row) for row in mat[::-1] if (\"#\" not in row)]',\n", + " '+# #が含まれている列のインデックスを取得',\n", + " '+showCol = [i for i in range(w) if \"#\" in [row[i] for row in mat]]',\n", + " '+# 表示',\n", + " '+print((\"\\\\n\".join([\"\".join([row[c] for c in showCol]) for row in mat])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5763139927,\n", + " 'measured_runtime_v1': 0.2879686127,\n", + " 'runtime_lift': 5.4739090419,\n", + " 'key': ['s276670685', 's252609642']},\n", + " {'user_id': 'u620868411',\n", + " 'problem_id': 'p03436',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's808760844',\n", + " 'submission_id_v1': 's833213139',\n", + " 'cpu_time_v0': 54,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 4080,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 51.85,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\nfrom queue import Queue\\n\\nh,w = list(map(int, input().split()))\\n\\nd = []\\n\\nfor _ in range(h):\\n\\n d.append(eval(input()))\\n\\ncost = [[0]*w for _ in range(h)]\\n\\n\\n\\nq = Queue()\\n\\nq.put((0,0))\\n\\nwhile not q.empty():\\n\\n hi,wi = q.get()\\n\\n if hi==h-1 and wi==w-1:\\n\\n break\\n\\n\\n\\n for dh,dw in [[0,1],[1,0],[0,-1],[-1,0]]:\\n\\n if h>dh+hi>=0 and w>dw+wi>=0 and d[dh+hi][dw+wi]==\".\":\\n\\n if cost[dh+hi][dw+wi]==0 or cost[dh+hi][dw+wi]>cost[hi][wi]+1:\\n\\n cost[dh+hi][dw+wi] = cost[hi][wi]+1\\n\\n q.put((dh+hi, dw+wi))\\n\\n\\n\\nif cost[h-1][w-1]==0:\\n\\n print((-1))\\n\\n exit()\\n\\n\\n\\nres = 0\\n\\nfor hi in range(h):\\n\\n for wi in range(w):\\n\\n if (hi==0 and wi==0) or (hi==h-1 and wi==-1):\\n\\n continue\\n\\n if d[hi][wi]==\".\":\\n\\n res += 1\\n\\n\\n\\nprint((res - cost[h-1][w-1]))\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\nfrom collections import deque\\n\\nh,w = list(map(int, input().split()))\\n\\nm = [\"#\"*(w+2)] + [\"#\"+eval(input())+\"#\" for _ in range(h)] + [\"#\"*(w+2)]\\n\\n\\n\\ncnt = 0\\n\\nfor hi in range(1,h+1):\\n\\n for wi in range(1,w+1):\\n\\n if m[hi][wi]==\".\":\\n\\n cnt += 1\\n\\n\\n\\ninf = 10**9\\n\\nd = [[inf]*(w+2) for _ in range(h+2)]\\n\\nq = deque([(1,1,1)])\\n\\nd[1][1] = 1\\n\\nwhile len(q):\\n\\n ch,cw,r = q.popleft()\\n\\n\\n\\n for hi,wi in [[ch+1,cw],[ch,cw+1],[ch-1,cw],[ch,cw-1]]:\\n\\n if m[hi][wi]==\".\" and d[hi][wi]>r+1:\\n\\n d[hi][wi]=r+1\\n\\n q.append((hi,wi,r+1))\\n\\n\\n\\nif d[h][w]==inf:\\n\\n print((-1))\\n\\nelse:\\n\\n print((cnt-d[h][w]))',\n", + " 'code_v0_loc': 34,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 831,\n", + " 'code_v1_num_chars': 639,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nfrom queue import Queue\\n\\nh, w = list(map(int, input().split()))\\nd = []\\nfor _ in range(h):\\n d.append(eval(input()))\\ncost = [[0] * w for _ in range(h)]\\nq = Queue()\\nq.put((0, 0))\\nwhile not q.empty():\\n hi, wi = q.get()\\n if hi == h - 1 and wi == w - 1:\\n break\\n for dh, dw in [[0, 1], [1, 0], [0, -1], [-1, 0]]:\\n if h > dh + hi >= 0 and w > dw + wi >= 0 and d[dh + hi][dw + wi] == \".\":\\n if cost[dh + hi][dw + wi] == 0 or cost[dh + hi][dw + wi] > cost[hi][wi] + 1:\\n cost[dh + hi][dw + wi] = cost[hi][wi] + 1\\n q.put((dh + hi, dw + wi))\\nif cost[h - 1][w - 1] == 0:\\n print((-1))\\n exit()\\nres = 0\\nfor hi in range(h):\\n for wi in range(w):\\n if (hi == 0 and wi == 0) or (hi == h - 1 and wi == -1):\\n continue\\n if d[hi][wi] == \".\":\\n res += 1\\nprint((res - cost[h - 1][w - 1]))\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nfrom collections import deque\\n\\nh, w = list(map(int, input().split()))\\nm = [\"#\" * (w + 2)] + [\"#\" + eval(input()) + \"#\" for _ in range(h)] + [\"#\" * (w + 2)]\\ncnt = 0\\nfor hi in range(1, h + 1):\\n for wi in range(1, w + 1):\\n if m[hi][wi] == \".\":\\n cnt += 1\\ninf = 10**9\\nd = [[inf] * (w + 2) for _ in range(h + 2)]\\nq = deque([(1, 1, 1)])\\nd[1][1] = 1\\nwhile len(q):\\n ch, cw, r = q.popleft()\\n for hi, wi in [[ch + 1, cw], [ch, cw + 1], [ch - 1, cw], [ch, cw - 1]]:\\n if m[hi][wi] == \".\" and d[hi][wi] > r + 1:\\n d[hi][wi] = r + 1\\n q.append((hi, wi, r + 1))\\nif d[h][w] == inf:\\n print((-1))\\nelse:\\n print((cnt - d[h][w]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.5882352941,\n", + " 'diff': ['-from queue import Queue',\n", + " '+from collections import deque',\n", + " '-d = []',\n", + " '-for _ in range(h):',\n", + " '- d.append(eval(input()))',\n", + " '-cost = [[0] * w for _ in range(h)]',\n", + " '-q = Queue()',\n", + " '-q.put((0, 0))',\n", + " '-while not q.empty():',\n", + " '- hi, wi = q.get()',\n", + " '- if hi == h - 1 and wi == w - 1:',\n", + " '- break',\n", + " '- for dh, dw in [[0, 1], [1, 0], [0, -1], [-1, 0]]:',\n", + " '- if h > dh + hi >= 0 and w > dw + wi >= 0 and d[dh + hi][dw + wi] == \".\":',\n", + " '- if cost[dh + hi][dw + wi] == 0 or cost[dh + hi][dw + wi] > cost[hi][wi] + 1:',\n", + " '- cost[dh + hi][dw + wi] = cost[hi][wi] + 1',\n", + " '- q.put((dh + hi, dw + wi))',\n", + " '-if cost[h - 1][w - 1] == 0:',\n", + " '+m = [\"#\" * (w + 2)] + [\"#\" + eval(input()) + \"#\" for _ in range(h)] + [\"#\" * (w + 2)]',\n", + " '+cnt = 0',\n", + " '+for hi in range(1, h + 1):',\n", + " '+ for wi in range(1, w + 1):',\n", + " '+ if m[hi][wi] == \".\":',\n", + " '+ cnt += 1',\n", + " '+inf = 10**9',\n", + " '+d = [[inf] * (w + 2) for _ in range(h + 2)]',\n", + " '+q = deque([(1, 1, 1)])',\n", + " '+d[1][1] = 1',\n", + " '+while len(q):',\n", + " '+ ch, cw, r = q.popleft()',\n", + " '+ for hi, wi in [[ch + 1, cw], [ch, cw + 1], [ch - 1, cw], [ch, cw - 1]]:',\n", + " '+ if m[hi][wi] == \".\" and d[hi][wi] > r + 1:',\n", + " '+ d[hi][wi] = r + 1',\n", + " '+ q.append((hi, wi, r + 1))',\n", + " '+if d[h][w] == inf:',\n", + " '- exit()',\n", + " '-res = 0',\n", + " '-for hi in range(h):',\n", + " '- for wi in range(w):',\n", + " '- if (hi == 0 and wi == 0) or (hi == h - 1 and wi == -1):',\n", + " '- continue',\n", + " '- if d[hi][wi] == \".\":',\n", + " '- res += 1',\n", + " '-print((res - cost[h - 1][w - 1]))',\n", + " '+else:',\n", + " '+ print((cnt - d[h][w]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.297110918,\n", + " 'measured_runtime_v1': 0.2054588807,\n", + " 'runtime_lift': 1.4460845745,\n", + " 'key': ['s808760844', 's833213139']},\n", + " {'user_id': 'u706929073',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's504662720',\n", + " 'submission_id_v1': 's470778572',\n", + " 'cpu_time_v0': 504,\n", + " 'cpu_time_v1': 137,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 72.82,\n", + " 'input': 'N = int(eval(input()))\\n\\n\\n\\n\\n\\ndef dist(i, j):\\n\\n return i + j - 2\\n\\n\\n\\n\\n\\nmin = 10 ** 24\\n\\ni = 1\\n\\nwhile (i ** 2) <= N:\\n\\n if 0 == N % i:\\n\\n j = N // i\\n\\n d = dist(i, j)\\n\\n if min > d:\\n\\n min = d\\n\\n i += 1\\n\\nprint(d)\\n',\n", + " 'target': 'import math\\n\\nn = int(eval(input()))\\n\\n\\n\\nans = 0\\n\\nfor i in range(math.ceil(math.sqrt(n) + 1))[:0:-1]:\\n\\n if 0 == n % i:\\n\\n ans = i\\n\\n break\\n\\nans_partner = n // ans\\n\\nprint((ans + ans_partner - 2))\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 237,\n", + " 'code_v1_num_chars': 200,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\n\\n\\ndef dist(i, j):\\n return i + j - 2\\n\\n\\nmin = 10**24\\ni = 1\\nwhile (i**2) <= N:\\n if 0 == N % i:\\n j = N // i\\n d = dist(i, j)\\n if min > d:\\n min = d\\n i += 1\\nprint(d)\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nans = 0\\nfor i in range(math.ceil(math.sqrt(n) + 1))[:0:-1]:\\n if 0 == n % i:\\n ans = i\\n break\\nans_partner = n // ans\\nprint((ans + ans_partner - 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.1764705882,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '+import math',\n", + " '-',\n", + " '-def dist(i, j):',\n", + " '- return i + j - 2',\n", + " '-',\n", + " '-',\n", + " '-min = 10**24',\n", + " '-i = 1',\n", + " '-while (i**2) <= N:',\n", + " '- if 0 == N % i:',\n", + " '- j = N // i',\n", + " '- d = dist(i, j)',\n", + " '- if min > d:',\n", + " '- min = d',\n", + " '- i += 1',\n", + " '-print(d)',\n", + " '+n = int(eval(input()))',\n", + " '+ans = 0',\n", + " '+for i in range(math.ceil(math.sqrt(n) + 1))[:0:-1]:',\n", + " '+ if 0 == n % i:',\n", + " '+ ans = i',\n", + " '+ break',\n", + " '+ans_partner = n // ans',\n", + " '+print((ans + ans_partner - 2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.327980933,\n", + " 'measured_runtime_v1': 0.2062122526,\n", + " 'runtime_lift': 1.5905016738,\n", + " 'key': ['s504662720', 's470778572']},\n", + " {'user_id': 'u887207211',\n", + " 'problem_id': 'p03425',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's819679830',\n", + " 'submission_id_v1': 's546088432',\n", + " 'cpu_time_v0': 172,\n", + " 'cpu_time_v1': 153,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 9752,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.05,\n", + " 'input': 'N = int(eval(input()))\\n\\nname = {\\'M\\':0, \\'A\\':0, \\'R\\':0, \\'C\\':0, \\'H\\':0}\\n\\nmarch = \"MARCH\"\\n\\nfor _ in range(N):\\n\\n S = eval(input())\\n\\n if(S[0] in name):\\n\\n name[S[0]] += 1\\n\\nans = 0\\n\\nfor i in range(3):\\n\\n for j in range(i+1,4):\\n\\n for k in range(j+1,5):\\n\\n ans += name[march[i]] * name[march[j]] * name[march[k]]\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\nS = [eval(input()) for _ in range(N)]\\n\\n\\n\\nhead = {\\'M\\':0, \\'A\\':0, \\'R\\':0, \\'C\\':0, \\'H\\':0}\\n\\nmarch = \"MARCH\"\\n\\nfor s in S:\\n\\n if(s[0] in head):\\n\\n head[s[0]] += 1\\n\\nans = 0\\n\\nfor i in range(3):\\n\\n for j in range(i+1,4):\\n\\n for k in range(j+1,5):\\n\\n ans += head[march[i]] * head[march[j]] * head[march[k]]\\n\\nprint(ans)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 312,\n", + " 'code_v1_num_chars': 325,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nname = {\"M\": 0, \"A\": 0, \"R\": 0, \"C\": 0, \"H\": 0}\\nmarch = \"MARCH\"\\nfor _ in range(N):\\n S = eval(input())\\n if S[0] in name:\\n name[S[0]] += 1\\nans = 0\\nfor i in range(3):\\n for j in range(i + 1, 4):\\n for k in range(j + 1, 5):\\n ans += name[march[i]] * name[march[j]] * name[march[k]]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nS = [eval(input()) for _ in range(N)]\\nhead = {\"M\": 0, \"A\": 0, \"R\": 0, \"C\": 0, \"H\": 0}\\nmarch = \"MARCH\"\\nfor s in S:\\n if s[0] in head:\\n head[s[0]] += 1\\nans = 0\\nfor i in range(3):\\n for j in range(i + 1, 4):\\n for k in range(j + 1, 5):\\n ans += head[march[i]] * head[march[j]] * head[march[k]]\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.1428571429,\n", + " 'diff': ['-name = {\"M\": 0, \"A\": 0, \"R\": 0, \"C\": 0, \"H\": 0}',\n", + " '+S = [eval(input()) for _ in range(N)]',\n", + " '+head = {\"M\": 0, \"A\": 0, \"R\": 0, \"C\": 0, \"H\": 0}',\n", + " '-for _ in range(N):',\n", + " '- S = eval(input())',\n", + " '- if S[0] in name:',\n", + " '- name[S[0]] += 1',\n", + " '+for s in S:',\n", + " '+ if s[0] in head:',\n", + " '+ head[s[0]] += 1',\n", + " '- ans += name[march[i]] * name[march[j]] * name[march[k]]',\n", + " '+ ans += head[march[i]] * head[march[j]] * head[march[k]]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4009393435,\n", + " 'measured_runtime_v1': 0.3106073449,\n", + " 'runtime_lift': 1.2908237686,\n", + " 'key': ['s819679830', 's546088432']},\n", + " {'user_id': 'u670180528',\n", + " 'problem_id': 'p03806',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's355426542',\n", + " 'submission_id_v1': 's468498336',\n", + " 'cpu_time_v0': 1133,\n", + " 'cpu_time_v1': 172,\n", + " 'memory_v0': 4980,\n", + " 'memory_v1': 4980,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.82,\n", + " 'input': 'def main():\\n\\n\\tn, ma, mb, *L = list(map(int, open(0).read().split()))\\n\\n\\tM = 1<<30\\n\\n\\tdp = [[M] * 420 for _ in range(420)]\\n\\n\\tdp[0][0] = 0\\n\\n\\tfor a, b, c in zip(*[iter(L)] * 3):\\n\\n\\t\\tfor i in range(400, -1, -1):\\n\\n\\t\\t\\tfor j in range(400, -1, -1):\\n\\n\\t\\t\\t\\tt = dp[i][j] + c\\n\\n\\t\\t\\t\\tif dp[i + a][j + b] > t:\\n\\n\\t\\t\\t\\t\\tdp[i + a][j + b] = t\\n\\n\\tans = M\\n\\n\\t_ma, _mb = ma, mb\\n\\n\\twhile _ma < 410 > _mb:\\n\\n\\t\\tans = min(ans, dp[_ma][_mb])\\n\\n\\t\\t_ma += ma\\n\\n\\t\\t_mb += mb\\n\\n\\tprint((ans if ans < M else -1))\\n\\n\\n\\nif __name__==\"__main__\":\\n\\n\\tmain()',\n", + " 'target': 'def main():\\n\\n\\tn, ma, mb, *L = list(map(int, open(0).read().split()))\\n\\n\\tM = 1 << 30\\n\\n\\tdp = [[M] * 420 for _ in range(420)]\\n\\n\\tdp[0][0] = 0\\n\\n\\tua = ub = 15\\n\\n\\tfor a, b, c in zip(*[iter(L)] * 3):\\n\\n\\t\\tfor i in range(ua, -1, -1):\\n\\n\\t\\t\\tfor j in range(ub, -1, -1):\\n\\n\\t\\t\\t\\tt = dp[i][j] + c\\n\\n\\t\\t\\t\\tif dp[i + a][j + b] > t:\\n\\n\\t\\t\\t\\t\\tdp[i + a][j + b] = t\\n\\n\\t\\t\\t\\t\\tif ua < i + a:\\n\\n\\t\\t\\t\\t\\t\\tua = i + a\\n\\n\\t\\t\\t\\t\\tif ub < j + b:\\n\\n\\t\\t\\t\\t\\t\\tub = j + b\\n\\n\\tans = M\\n\\n\\t_ma, _mb = ma, mb\\n\\n\\twhile _ma < 410 > _mb:\\n\\n\\t\\tans = min(ans, dp[_ma][_mb])\\n\\n\\t\\t_ma += ma\\n\\n\\t\\t_mb += mb\\n\\n\\tprint((ans if ans < M else -1))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n\\tmain()\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 492,\n", + " 'code_v1_num_chars': 590,\n", + " 'code_v0_no_empty_lines': 'def main():\\n n, ma, mb, *L = list(map(int, open(0).read().split()))\\n M = 1 << 30\\n dp = [[M] * 420 for _ in range(420)]\\n dp[0][0] = 0\\n for a, b, c in zip(*[iter(L)] * 3):\\n for i in range(400, -1, -1):\\n for j in range(400, -1, -1):\\n t = dp[i][j] + c\\n if dp[i + a][j + b] > t:\\n dp[i + a][j + b] = t\\n ans = M\\n _ma, _mb = ma, mb\\n while _ma < 410 > _mb:\\n ans = min(ans, dp[_ma][_mb])\\n _ma += ma\\n _mb += mb\\n print((ans if ans < M else -1))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n n, ma, mb, *L = list(map(int, open(0).read().split()))\\n M = 1 << 30\\n dp = [[M] * 420 for _ in range(420)]\\n dp[0][0] = 0\\n ua = ub = 15\\n for a, b, c in zip(*[iter(L)] * 3):\\n for i in range(ua, -1, -1):\\n for j in range(ub, -1, -1):\\n t = dp[i][j] + c\\n if dp[i + a][j + b] > t:\\n dp[i + a][j + b] = t\\n if ua < i + a:\\n ua = i + a\\n if ub < j + b:\\n ub = j + b\\n ans = M\\n _ma, _mb = ma, mb\\n while _ma < 410 > _mb:\\n ans = min(ans, dp[_ma][_mb])\\n _ma += ma\\n _mb += mb\\n print((ans if ans < M else -1))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['+ ua = ub = 15',\n", + " '- for i in range(400, -1, -1):',\n", + " '- for j in range(400, -1, -1):',\n", + " '+ for i in range(ua, -1, -1):',\n", + " '+ for j in range(ub, -1, -1):',\n", + " '+ if ua < i + a:',\n", + " '+ ua = i + a',\n", + " '+ if ub < j + b:',\n", + " '+ ub = j + b'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.1710306553,\n", + " 'measured_runtime_v1': 0.275720624,\n", + " 'runtime_lift': 4.2471638081,\n", + " 'key': ['s355426542', 's468498336']},\n", + " {'user_id': 'u286955577',\n", + " 'problem_id': 'p03074',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's853547546',\n", + " 'submission_id_v1': 's138697044',\n", + " 'cpu_time_v0': 74,\n", + " 'cpu_time_v1': 66,\n", + " 'memory_v0': 4596,\n", + " 'memory_v1': 4596,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.81,\n", + " 'input': \"def solve():\\n\\n N, K = list(map(int, input().split()))\\n\\n _S = eval(input())\\n\\n S = []\\n\\n b = _S[0]\\n\\n s = 0\\n\\n if b == '0': S.append(0)\\n\\n for _s in _S:\\n\\n if b == _s:\\n\\n s = s + 1\\n\\n else:\\n\\n b = _s\\n\\n S.append(s)\\n\\n s = 1\\n\\n S.append(s)\\n\\n if b == '0': S.append(0)\\n\\n\\n\\n num = min(len(S), 2 * K + 1)\\n\\n # n = sum(S[0:num if _S[0] == '1' else (num - 1)])\\n\\n n = sum(S[0:num])\\n\\n m = n\\n\\n # for i in range(0 if _S[0] == '1' else -1, len(S) - num, 2):\\n\\n for i in range(0, len(S) - num, 2):\\n\\n n = n - sum(S[i:i+2])\\n\\n n = n + sum(S[i + num:i + num + 2])\\n\\n m = max(m, n)\\n\\n\\n\\n return m\\n\\n\\n\\nprint((solve()))\",\n", + " 'target': \"def solve():\\n\\n N, K = list(map(int, input().split()))\\n\\n s = eval(input())\\n\\n S = []\\n\\n b = s[0]\\n\\n cnt = 0\\n\\n\\n\\n if s[0] == '0': S.append(0)\\n\\n for c in s:\\n\\n if b == c: cnt = cnt + 1\\n\\n else:\\n\\n b = c\\n\\n S.append(cnt)\\n\\n cnt = 1\\n\\n S.append(cnt)\\n\\n if s[-1] == '0': S.append(0)\\n\\n\\n\\n num = min(len(S), 2 * K + 1)\\n\\n part = sum(S[0:num])\\n\\n ans = part\\n\\n\\n\\n for i in range(0, len(S) - num, 2):\\n\\n part = part - sum(S[i:i+2]) + sum(S[i + num:i + num + 2])\\n\\n ans = max(ans, part)\\n\\n\\n\\n return ans\\n\\n\\n\\nprint((solve()))\\n\",\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 28,\n", + " 'code_v0_num_chars': 616,\n", + " 'code_v1_num_chars': 520,\n", + " 'code_v0_no_empty_lines': 'def solve():\\n N, K = list(map(int, input().split()))\\n _S = eval(input())\\n S = []\\n b = _S[0]\\n s = 0\\n if b == \"0\":\\n S.append(0)\\n for _s in _S:\\n if b == _s:\\n s = s + 1\\n else:\\n b = _s\\n S.append(s)\\n s = 1\\n S.append(s)\\n if b == \"0\":\\n S.append(0)\\n num = min(len(S), 2 * K + 1)\\n # n = sum(S[0:num if _S[0] == \\'1\\' else (num - 1)])\\n n = sum(S[0:num])\\n m = n\\n # for i in range(0 if _S[0] == \\'1\\' else -1, len(S) - num, 2):\\n for i in range(0, len(S) - num, 2):\\n n = n - sum(S[i : i + 2])\\n n = n + sum(S[i + num : i + num + 2])\\n m = max(m, n)\\n return m\\n\\n\\nprint((solve()))\\n',\n", + " 'code_v1_no_empty_lines': 'def solve():\\n N, K = list(map(int, input().split()))\\n s = eval(input())\\n S = []\\n b = s[0]\\n cnt = 0\\n if s[0] == \"0\":\\n S.append(0)\\n for c in s:\\n if b == c:\\n cnt = cnt + 1\\n else:\\n b = c\\n S.append(cnt)\\n cnt = 1\\n S.append(cnt)\\n if s[-1] == \"0\":\\n S.append(0)\\n num = min(len(S), 2 * K + 1)\\n part = sum(S[0:num])\\n ans = part\\n for i in range(0, len(S) - num, 2):\\n part = part - sum(S[i : i + 2]) + sum(S[i + num : i + num + 2])\\n ans = max(ans, part)\\n return ans\\n\\n\\nprint((solve()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['- _S = eval(input())',\n", + " '+ s = eval(input())',\n", + " '- b = _S[0]',\n", + " '- s = 0',\n", + " '- if b == \"0\":',\n", + " '+ b = s[0]',\n", + " '+ cnt = 0',\n", + " '+ if s[0] == \"0\":',\n", + " '- for _s in _S:',\n", + " '- if b == _s:',\n", + " '- s = s + 1',\n", + " '+ for c in s:',\n", + " '+ if b == c:',\n", + " '+ cnt = cnt + 1',\n", + " '- b = _s',\n", + " '- S.append(s)',\n", + " '- s = 1',\n", + " '- S.append(s)',\n", + " '- if b == \"0\":',\n", + " '+ b = c',\n", + " '+ S.append(cnt)',\n", + " '+ cnt = 1',\n", + " '+ S.append(cnt)',\n", + " '+ if s[-1] == \"0\":',\n", + " \"- # n = sum(S[0:num if _S[0] == '1' else (num - 1)])\",\n", + " '- n = sum(S[0:num])',\n", + " '- m = n',\n", + " \"- # for i in range(0 if _S[0] == '1' else -1, len(S) - num, 2):\",\n", + " '+ part = sum(S[0:num])',\n", + " '+ ans = part',\n", + " '- n = n - sum(S[i : i + 2])',\n", + " '- n = n + sum(S[i + num : i + num + 2])',\n", + " '- m = max(m, n)',\n", + " '- return m',\n", + " '+ part = part - sum(S[i : i + 2]) + sum(S[i + num : i + num + 2])',\n", + " '+ ans = max(ans, part)',\n", + " '+ return ans'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3473945413,\n", + " 'measured_runtime_v1': 0.2136866565,\n", + " 'runtime_lift': 1.625719392,\n", + " 'key': ['s853547546', 's138697044']},\n", + " {'user_id': 'u597455618',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's109141472',\n", + " 'submission_id_v1': 's852161134',\n", + " 'cpu_time_v0': 276,\n", + " 'cpu_time_v1': 208,\n", + " 'memory_v0': 28384,\n", + " 'memory_v1': 31520,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 24.64,\n", + " 'input': 'import sys\\n\\nfrom operator import itemgetter\\n\\n\\n\\nn, m = list(map(int, input().split()))\\n\\na = list(map(int, sys.stdin.readline().split()))\\n\\nbc = [ tuple(map(int, x.split())) for x in sys.stdin.readlines()]\\n\\nbc.sort(key = itemgetter(1), reverse=True)\\n\\nbc.append((n,0))\\n\\ndiff = []\\n\\nfor b, c in bc:\\n\\n diff += [c] * b\\n\\n if len(diff) > n:\\n\\n break\\n\\n\\n\\na += diff\\n\\na.sort()\\n\\nprint((sum(a[-n:])))\\n',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nfrom operator import itemgetter\\n\\n\\n\\nn, m = list(map(int, readline().split()))\\n\\na = list(map(int, readline().split()))\\n\\nm = list(map(int, read().split()))\\n\\nbc = list(zip(m,m))\\n\\n\\n\\nbc.sort(key = itemgetter(1), reverse=True)\\n\\nbc.append((n,0))\\n\\ndiff = []\\n\\nfor b, c in bc:\\n\\n diff += [c] * b\\n\\n if len(diff) > n:\\n\\n break\\n\\n\\n\\na += diff\\n\\na.sort()\\n\\nprint((sum(a[-n:])))\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 389,\n", + " 'code_v1_num_chars': 436,\n", + " 'code_v0_no_empty_lines': 'import sys\\nfrom operator import itemgetter\\n\\nn, m = list(map(int, input().split()))\\na = list(map(int, sys.stdin.readline().split()))\\nbc = [tuple(map(int, x.split())) for x in sys.stdin.readlines()]\\nbc.sort(key=itemgetter(1), reverse=True)\\nbc.append((n, 0))\\ndiff = []\\nfor b, c in bc:\\n diff += [c] * b\\n if len(diff) > n:\\n break\\na += diff\\na.sort()\\nprint((sum(a[-n:])))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nfrom operator import itemgetter\\n\\nn, m = list(map(int, readline().split()))\\na = list(map(int, readline().split()))\\nm = list(map(int, read().split()))\\nbc = list(zip(m, m))\\nbc.sort(key=itemgetter(1), reverse=True)\\nbc.append((n, 0))\\ndiff = []\\nfor b, c in bc:\\n diff += [c] * b\\n if len(diff) > n:\\n break\\na += diff\\na.sort()\\nprint((sum(a[-n:])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 19.0476190476,\n", + " 'diff': ['+',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '-n, m = list(map(int, input().split()))',\n", + " '-a = list(map(int, sys.stdin.readline().split()))',\n", + " '-bc = [tuple(map(int, x.split())) for x in sys.stdin.readlines()]',\n", + " '+n, m = list(map(int, readline().split()))',\n", + " '+a = list(map(int, readline().split()))',\n", + " '+m = list(map(int, read().split()))',\n", + " '+bc = list(zip(m, m))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2032662067,\n", + " 'measured_runtime_v1': 0.0066151552,\n", + " 'runtime_lift': 30.7273525221,\n", + " 'key': ['s109141472', 's852161134']},\n", + " {'user_id': 'u046592970',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's911937877',\n", + " 'submission_id_v1': 's225349134',\n", + " 'cpu_time_v0': 121,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.95,\n", + " 'input': 'a,b,c,x,y = list(map(int,input().split()))\\n\\nprice = 10**10\\n\\nfor k in range(10**5+1):\\n\\n re = 2*c*k + max(0,x-k)*a + max(0,y-k)*b\\n\\n price = min(re,price)\\n\\nprint(price)',\n", + " 'target': 'a,b,c,x,y = list(map(int,input().split()))\\n\\na1 = a*x + b*y\\n\\na2 = max(x,y) * 2*c\\n\\nif y >= x:\\n\\n a3 = 2*c*x + (y-x)*b\\n\\nelse:\\n\\n a3 = 2*c*y + (x-y)*a\\n\\nprint((min(a1,a2,a3)))',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 165,\n", + " 'code_v1_num_chars': 166,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nprice = 10**10\\nfor k in range(10**5 + 1):\\n re = 2 * c * k + max(0, x - k) * a + max(0, y - k) * b\\n price = min(re, price)\\nprint(price)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\na1 = a * x + b * y\\na2 = max(x, y) * 2 * c\\nif y >= x:\\n a3 = 2 * c * x + (y - x) * b\\nelse:\\n a3 = 2 * c * y + (x - y) * a\\nprint((min(a1, a2, a3)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-price = 10**10',\n", + " '-for k in range(10**5 + 1):',\n", + " '- re = 2 * c * k + max(0, x - k) * a + max(0, y - k) * b',\n", + " '- price = min(re, price)',\n", + " '-print(price)',\n", + " '+a1 = a * x + b * y',\n", + " '+a2 = max(x, y) * 2 * c',\n", + " '+if y >= x:',\n", + " '+ a3 = 2 * c * x + (y - x) * b',\n", + " '+else:',\n", + " '+ a3 = 2 * c * y + (x - y) * a',\n", + " '+print((min(a1, a2, a3)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4459569323,\n", + " 'measured_runtime_v1': 0.1564870899,\n", + " 'runtime_lift': 2.8498001506,\n", + " 'key': ['s911937877', 's225349134']},\n", + " {'user_id': 'u893063840',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's375368375',\n", + " 'submission_id_v1': 's846087139',\n", + " 'cpu_time_v0': 644,\n", + " 'cpu_time_v1': 545,\n", + " 'memory_v0': 26036,\n", + " 'memory_v1': 24420,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.37,\n", + " 'input': 'from collections import Counter\\n\\n\\n\\ns = eval(input())\\n\\nmod1 = 673\\n\\nmod2 = 3\\n\\n\\n\\nnum1 = 0\\n\\nnum2 = 0\\n\\nli1 = []\\n\\nli2 = []\\n\\npw1 = 10\\n\\npw2 = 10\\n\\nfor i, e in enumerate(s, 1):\\n\\n num1 *= 10\\n\\n num1 += int(e)\\n\\n num1 %= mod1\\n\\n inv = pow(pw1, mod1 - 2, mod1)\\n\\n li1.append(num1 * inv % mod1)\\n\\n\\n\\n num2 *= 10\\n\\n num2 += int(e)\\n\\n num2 %= mod2\\n\\n inv = pow(pw2, mod2 - 2, mod2)\\n\\n li2.append(num2 * inv % mod2)\\n\\n\\n\\n pw1 *= 10\\n\\n pw1 %= mod1\\n\\n pw2 *= 10\\n\\n pw2 %= mod2\\n\\n\\n\\nli = [0] + [10 * e1 + e2 for e1, e2 in zip(li1, li2)]\\n\\nc = Counter(li)\\n\\n\\n\\nans = 0\\n\\nfor v in list(c.values()):\\n\\n ans += v * (v - 1) // 2\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'from collections import Counter\\n\\n\\n\\n\\n\\ndef f(mod):\\n\\n ret = [0]\\n\\n power = 1\\n\\n num = 0\\n\\n for i, e in enumerate(s, 1):\\n\\n num *= 10\\n\\n num += int(e)\\n\\n num %= mod\\n\\n\\n\\n power *= 10\\n\\n power %= mod\\n\\n inv = pow(power, mod - 2, mod)\\n\\n\\n\\n ret.append(num * inv % mod)\\n\\n\\n\\n return ret\\n\\n\\n\\n\\n\\ns = eval(input())\\n\\n\\n\\nmod3 = f(3)\\n\\nmod673 = f(673)\\n\\n\\n\\nli = [10 * e673 + e3 for e3, e673 in zip(mod3, mod673)]\\n\\n\\n\\nc = Counter(li)\\n\\nans = 0\\n\\nfor v in list(c.values()):\\n\\n ans += v * (v - 1) // 2\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 38,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 629,\n", + " 'code_v1_num_chars': 529,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\n\\ns = eval(input())\\nmod1 = 673\\nmod2 = 3\\nnum1 = 0\\nnum2 = 0\\nli1 = []\\nli2 = []\\npw1 = 10\\npw2 = 10\\nfor i, e in enumerate(s, 1):\\n num1 *= 10\\n num1 += int(e)\\n num1 %= mod1\\n inv = pow(pw1, mod1 - 2, mod1)\\n li1.append(num1 * inv % mod1)\\n num2 *= 10\\n num2 += int(e)\\n num2 %= mod2\\n inv = pow(pw2, mod2 - 2, mod2)\\n li2.append(num2 * inv % mod2)\\n pw1 *= 10\\n pw1 %= mod1\\n pw2 *= 10\\n pw2 %= mod2\\nli = [0] + [10 * e1 + e2 for e1, e2 in zip(li1, li2)]\\nc = Counter(li)\\nans = 0\\nfor v in list(c.values()):\\n ans += v * (v - 1) // 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\n\\n\\ndef f(mod):\\n ret = [0]\\n power = 1\\n num = 0\\n for i, e in enumerate(s, 1):\\n num *= 10\\n num += int(e)\\n num %= mod\\n power *= 10\\n power %= mod\\n inv = pow(power, mod - 2, mod)\\n ret.append(num * inv % mod)\\n return ret\\n\\n\\ns = eval(input())\\nmod3 = f(3)\\nmod673 = f(673)\\nli = [10 * e673 + e3 for e3, e673 in zip(mod3, mod673)]\\nc = Counter(li)\\nans = 0\\nfor v in list(c.values()):\\n ans += v * (v - 1) // 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.1578947368,\n", + " 'diff': ['+',\n", + " '+def f(mod):',\n", + " '+ ret = [0]',\n", + " '+ power = 1',\n", + " '+ num = 0',\n", + " '+ for i, e in enumerate(s, 1):',\n", + " '+ num *= 10',\n", + " '+ num += int(e)',\n", + " '+ num %= mod',\n", + " '+ power *= 10',\n", + " '+ power %= mod',\n", + " '+ inv = pow(power, mod - 2, mod)',\n", + " '+ ret.append(num * inv % mod)',\n", + " '+ return ret',\n", + " '+',\n", + " '+',\n", + " '-mod1 = 673',\n", + " '-mod2 = 3',\n", + " '-num1 = 0',\n", + " '-num2 = 0',\n", + " '-li1 = []',\n", + " '-li2 = []',\n", + " '-pw1 = 10',\n", + " '-pw2 = 10',\n", + " '-for i, e in enumerate(s, 1):',\n", + " '- num1 *= 10',\n", + " '- num1 += int(e)',\n", + " '- num1 %= mod1',\n", + " '- inv = pow(pw1, mod1 - 2, mod1)',\n", + " '- li1.append(num1 * inv % mod1)',\n", + " '- num2 *= 10',\n", + " '- num2 += int(e)',\n", + " '- num2 %= mod2',\n", + " '- inv = pow(pw2, mod2 - 2, mod2)',\n", + " '- li2.append(num2 * inv % mod2)',\n", + " '- pw1 *= 10',\n", + " '- pw1 %= mod1',\n", + " '- pw2 *= 10',\n", + " '- pw2 %= mod2',\n", + " '-li = [0] + [10 * e1 + e2 for e1, e2 in zip(li1, li2)]',\n", + " '+mod3 = f(3)',\n", + " '+mod673 = f(673)',\n", + " '+li = [10 * e673 + e3 for e3, e673 in zip(mod3, mod673)]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4600284932,\n", + " 'measured_runtime_v1': 0.2683121743,\n", + " 'runtime_lift': 1.7145270963,\n", + " 'key': ['s375368375', 's846087139']},\n", + " {'user_id': 'u970197315',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's479618893',\n", + " 'submission_id_v1': 's899240371',\n", + " 'cpu_time_v0': 212,\n", + " 'cpu_time_v1': 187,\n", + " 'memory_v0': 9612,\n", + " 'memory_v1': 7848,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.79,\n", + " 'input': 'N, M = list(map(int, input().split()))\\n\\nA_ = [int(eval(input())) for _ in range(M)]\\n\\nA = [0] * (N+3)\\n\\nfor a in A_:\\n\\n A[a] = 1\\n\\ndp = [0] * (N+3)\\n\\ndp[0] = 1\\n\\n\\n\\nmod = 10**9+7\\n\\n\\n\\nfor i in range(1, N+1):\\n\\n if A[i-1] == 0:\\n\\n dp[i] += dp[i-1]\\n\\n if A[i-2] == 0:\\n\\n dp[i] += dp[i-2]\\n\\n dp[i] %= mod\\n\\nprint((dp[N]))',\n", + " 'target': 'n,m=list(map(int,input().split()))\\n\\ndp=[0]*(n+3)\\n\\na=[int(eval(input())) for i in range(m)]\\n\\nmod=10**9+7\\n\\nfor i in range(m):\\n\\n dp[a[i]]=-1\\n\\n\\n\\ndp[0]=1\\n\\nif dp[1]!=-1:\\n\\n dp[1]+=dp[0]\\n\\n\\n\\nfor i in range(n+1):\\n\\n if dp[i+2]==-1:\\n\\n continue\\n\\n if dp[i]!=-1:\\n\\n dp[i+2]+=dp[i]\\n\\n if dp[i+1]!=-1:\\n\\n dp[i+2]+=dp[i+1]\\n\\n dp[i+2]%=mod\\n\\nprint((dp[n]%mod))',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 315,\n", + " 'code_v1_num_chars': 361,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\nA_ = [int(eval(input())) for _ in range(M)]\\nA = [0] * (N + 3)\\nfor a in A_:\\n A[a] = 1\\ndp = [0] * (N + 3)\\ndp[0] = 1\\nmod = 10**9 + 7\\nfor i in range(1, N + 1):\\n if A[i - 1] == 0:\\n dp[i] += dp[i - 1]\\n if A[i - 2] == 0:\\n dp[i] += dp[i - 2]\\n dp[i] %= mod\\nprint((dp[N]))\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\ndp = [0] * (n + 3)\\na = [int(eval(input())) for i in range(m)]\\nmod = 10**9 + 7\\nfor i in range(m):\\n dp[a[i]] = -1\\ndp[0] = 1\\nif dp[1] != -1:\\n dp[1] += dp[0]\\nfor i in range(n + 1):\\n if dp[i + 2] == -1:\\n continue\\n if dp[i] != -1:\\n dp[i + 2] += dp[i]\\n if dp[i + 1] != -1:\\n dp[i + 2] += dp[i + 1]\\n dp[i + 2] %= mod\\nprint((dp[n] % mod))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.0,\n", + " 'diff': ['-N, M = list(map(int, input().split()))',\n", + " '-A_ = [int(eval(input())) for _ in range(M)]',\n", + " '-A = [0] * (N + 3)',\n", + " '-for a in A_:',\n", + " '- A[a] = 1',\n", + " '-dp = [0] * (N + 3)',\n", + " '+n, m = list(map(int, input().split()))',\n", + " '+dp = [0] * (n + 3)',\n", + " '+a = [int(eval(input())) for i in range(m)]',\n", + " '+mod = 10**9 + 7',\n", + " '+for i in range(m):',\n", + " '+ dp[a[i]] = -1',\n", + " '-mod = 10**9 + 7',\n", + " '-for i in range(1, N + 1):',\n", + " '- if A[i - 1] == 0:',\n", + " '- dp[i] += dp[i - 1]',\n", + " '- if A[i - 2] == 0:',\n", + " '- dp[i] += dp[i - 2]',\n", + " '- dp[i] %= mod',\n", + " '-print((dp[N]))',\n", + " '+if dp[1] != -1:',\n", + " '+ dp[1] += dp[0]',\n", + " '+for i in range(n + 1):',\n", + " '+ if dp[i + 2] == -1:',\n", + " '+ continue',\n", + " '+ if dp[i] != -1:',\n", + " '+ dp[i + 2] += dp[i]',\n", + " '+ if dp[i + 1] != -1:',\n", + " '+ dp[i + 2] += dp[i + 1]',\n", + " '+ dp[i + 2] %= mod',\n", + " '+print((dp[n] % mod))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2706730585,\n", + " 'measured_runtime_v1': 0.2065423949,\n", + " 'runtime_lift': 1.3104963688,\n", + " 'key': ['s479618893', 's899240371']},\n", + " {'user_id': 'u714300041',\n", + " 'problem_id': 'p03835',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's859897716',\n", + " 'submission_id_v1': 's908338086',\n", + " 'cpu_time_v0': 324,\n", + " 'cpu_time_v1': 265,\n", + " 'memory_v0': 40684,\n", + " 'memory_v1': 40684,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.21,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\nK, S = list(map(int, input().split()))\\n\\n\\n\\nans = 0\\n\\nfor z in range(K+1):\\n\\n for y in range(K+1):\\n\\n x = S - (z + y)\\n\\n if x >= 0 and x <= K:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\nK, S = list(map(int, input().split()))\\n\\n\\n\\nans = 0\\n\\nfor z in range(K+1):\\n\\n for y in range(K+1):\\n\\n x = S - (z + y)\\n\\n if 0 <= x <= K:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 255,\n", + " 'code_v1_num_chars': 249,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(10**7)\\nK, S = list(map(int, input().split()))\\nans = 0\\nfor z in range(K + 1):\\n for y in range(K + 1):\\n x = S - (z + y)\\n if x >= 0 and x <= K:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(10**7)\\nK, S = list(map(int, input().split()))\\nans = 0\\nfor z in range(K + 1):\\n for y in range(K + 1):\\n x = S - (z + y)\\n if 0 <= x <= K:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- if x >= 0 and x <= K:', '+ if 0 <= x <= K:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.450106571,\n", + " 'measured_runtime_v1': 0.2041984936,\n", + " 'runtime_lift': 2.2042599977,\n", + " 'key': ['s859897716', 's908338086']},\n", + " {'user_id': 'u488178971',\n", + " 'problem_id': 'p03000',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's335888065',\n", + " 'submission_id_v1': 's975287095',\n", + " 'cpu_time_v0': 287,\n", + " 'cpu_time_v1': 148,\n", + " 'memory_v0': 21148,\n", + " 'memory_v1': 12516,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.43,\n", + " 'input': '#ABC 130 B\\n\\nN,X=list(map(int,input().split()))\\n\\nL= [int(j) for j in input().split()]\\n\\ncnt=0\\n\\nimport numpy as np\\n\\njump = list(np.cumsum(L))\\n\\nfor j in jump:\\n\\n if j <= X:\\n\\n cnt+=1\\n\\nprint((cnt+1))',\n", + " 'target': '#ABC 130 B\\n\\nN,X=list(map(int,input().split()))\\n\\nL= [int(j) for j in input().split()]\\n\\ncnt=0\\n\\nimport numpy as np\\n\\njump = list(np.cumsum(L))\\n\\nfor j in jump:\\n\\n if j <= X:\\n\\n cnt+=1\\n\\n else:\\n\\n break\\n\\nprint((cnt+1))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 194,\n", + " 'code_v1_num_chars': 220,\n", + " 'code_v0_no_empty_lines': '# ABC 130 B\\nN, X = list(map(int, input().split()))\\nL = [int(j) for j in input().split()]\\ncnt = 0\\nimport numpy as np\\n\\njump = list(np.cumsum(L))\\nfor j in jump:\\n if j <= X:\\n cnt += 1\\nprint((cnt + 1))\\n',\n", + " 'code_v1_no_empty_lines': '# ABC 130 B\\nN, X = list(map(int, input().split()))\\nL = [int(j) for j in input().split()]\\ncnt = 0\\nimport numpy as np\\n\\njump = list(np.cumsum(L))\\nfor j in jump:\\n if j <= X:\\n cnt += 1\\n else:\\n break\\nprint((cnt + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.6666666667,\n", + " 'diff': ['+ else:', '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1490399387,\n", + " 'measured_runtime_v1': 1.4958784676,\n", + " 'runtime_lift': 1.4366407333,\n", + " 'key': ['s335888065', 's975287095']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p04021',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's472972485',\n", + " 'submission_id_v1': 's043283938',\n", + " 'cpu_time_v0': 176,\n", + " 'cpu_time_v1': 126,\n", + " 'memory_v0': 18796,\n", + " 'memory_v1': 21220,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.41,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\n\"\"\"\\n\\n奇数番目集合、偶数番目集合の中で自由にできるのが操作2．\\n\\n操作1で集合間のやりとりをする\\n\\n\"\"\"\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = np.fromstring(sys.stdin.read(),dtype=np.int64,sep=\\'\\\\n\\')\\n\\n\\n\\nB = np.sort(A)\\n\\n\\n\\nanswer = len(np.setdiff1d(A[::2],B[::2]))\\n\\nprint(answer)',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\n\"\"\"\\n\\n・偶数番号、奇数番号の中では入れ替え放題\\n\\n・偶、奇の間：並べてからスワップ。操作2を1回で、正しいものを2つ増やせる\\n\\n\"\"\"\\n\\n\\n\\nN,*A = list(map(int,read().split()))\\n\\n\\n\\nx_to_i = {x:i for i,x in enumerate(sorted(A))}\\n\\nrank = [x_to_i[x] for x in A]\\n\\n\\n\\nanswer = sum((x^i) & 1 for i,x in enumerate(rank)) // 2\\n\\nprint(answer)',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 310,\n", + " 'code_v1_num_chars': 380,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(10**7)\\n\"\"\"\\n奇数番目集合、偶数番目集合の中で自由にできるのが操作2．\\n操作1で集合間のやりとりをする\\n\"\"\"\\nimport numpy as np\\n\\nN = int(eval(input()))\\nA = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=\"\\\\n\")\\nB = np.sort(A)\\nanswer = len(np.setdiff1d(A[::2], B[::2]))\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\"\"\"\\n・偶数番号、奇数番号の中では入れ替え放題\\n・偶、奇の間：並べてからスワップ。操作2を1回で、正しいものを2つ増やせる\\n\"\"\"\\nN, *A = list(map(int, read().split()))\\nx_to_i = {x: i for i, x in enumerate(sorted(A))}\\nrank = [x_to_i[x] for x in A]\\nanswer = sum((x ^ i) & 1 for i, x in enumerate(rank)) // 2\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.5555555556,\n", + " 'diff': ['-input = sys.stdin.readline',\n", + " '-sys.setrecursionlimit(10**7)',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '-奇数番目集合、偶数番目集合の中で自由にできるのが操作2．',\n", + " '-操作1で集合間のやりとりをする',\n", + " '+・偶数番号、奇数番号の中では入れ替え放題',\n", + " '+・偶、奇の間：並べてからスワップ。操作2を1回で、正しいものを2つ増やせる',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '-A = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=\"\\\\n\")',\n", + " '-B = np.sort(A)',\n", + " '-answer = len(np.setdiff1d(A[::2], B[::2]))',\n", + " '+N, *A = list(map(int, read().split()))',\n", + " '+x_to_i = {x: i for i, x in enumerate(sorted(A))}',\n", + " '+rank = [x_to_i[x] for x in A]',\n", + " '+answer = sum((x ^ i) & 1 for i, x in enumerate(rank)) // 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8491418537,\n", + " 'measured_runtime_v1': 0.0781715259,\n", + " 'runtime_lift': 23.6549284766,\n", + " 'key': ['s472972485', 's043283938']},\n", + " {'user_id': 'u488636998',\n", + " 'problem_id': 'p02886',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's711137678',\n", + " 'submission_id_v1': 's721979470',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12496,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.67,\n", + " 'input': 'N=int(eval(input()))\\n\\nd=list(map(int, input().split()))\\n\\n\\n\\nimport numpy as np\\n\\nd = np.array(d)\\n\\n\\n\\nprint(( ( (np.sum(d))**2 - np.sum(d**2) ) // 2 ))\\n',\n", + " 'target': 'N=int(eval(input()))\\n\\nd=list(map(int, input().split()))\\n\\n\\n\\ncumsum = 0\\n\\nfor n in range(N):\\n\\n cumsum += d[n]\\n\\nsub_cumsum = 0\\n\\nans = 0\\n\\nfor n in range(N):\\n\\n sub_cumsum += d[n]\\n\\n ans += d[n] * (cumsum-sub_cumsum)\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 140,\n", + " 'code_v1_num_chars': 224,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nd = list(map(int, input().split()))\\nimport numpy as np\\n\\nd = np.array(d)\\nprint((((np.sum(d)) ** 2 - np.sum(d**2)) // 2))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nd = list(map(int, input().split()))\\ncumsum = 0\\nfor n in range(N):\\n cumsum += d[n]\\nsub_cumsum = 0\\nans = 0\\nfor n in range(N):\\n sub_cumsum += d[n]\\n ans += d[n] * (cumsum - sub_cumsum)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-d = np.array(d)',\n", + " '-print((((np.sum(d)) ** 2 - np.sum(d**2)) // 2))',\n", + " '+cumsum = 0',\n", + " '+for n in range(N):',\n", + " '+ cumsum += d[n]',\n", + " '+sub_cumsum = 0',\n", + " '+ans = 0',\n", + " '+for n in range(N):',\n", + " '+ sub_cumsum += d[n]',\n", + " '+ ans += d[n] * (cumsum - sub_cumsum)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6732356335,\n", + " 'measured_runtime_v1': 0.2734009403,\n", + " 'runtime_lift': 6.1200800239,\n", + " 'key': ['s711137678', 's721979470']},\n", + " {'user_id': 'u545368057',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's347160213',\n", + " 'submission_id_v1': 's313812634',\n", + " 'cpu_time_v0': 801,\n", + " 'cpu_time_v1': 714,\n", + " 'memory_v0': 32480,\n", + " 'memory_v1': 35572,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.86,\n", + " 'input': 'from collections import defaultdict\\n\\nN = int(eval(input()))\\n\\nd = defaultdict(int)\\n\\n\\n\\nfor i in range(N):\\n\\n S = eval(input())\\n\\n d[S] += 1\\n\\n\\n\\nm = 0\\n\\nfor k in list(d.keys()):\\n\\n m = max(d[k],m)\\n\\n\\n\\nli = []\\n\\nfor k in list(d.keys()):\\n\\n if d[k] == m:\\n\\n li.append(k)\\n\\n\\n\\nli.sort()\\n\\nfor l in li:\\n\\n print(l)',\n", + " 'target': 'from collections import defaultdict\\n\\nN = int(eval(input()))\\n\\nSs = [eval(input()) for i in range(N)]\\n\\n\\n\\nd = defaultdict(int)\\n\\nfor S in Ss:\\n\\n d[S] += 1\\n\\n\\n\\nmx = max([d[k] for k in list(d.keys())])\\n\\n\\n\\nans = []\\n\\nfor k in list(d.keys()):\\n\\n if d[k] == mx:\\n\\n ans.append(k)\\n\\n \\n\\nfor a in sorted(ans):\\n\\n print(a)',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 292,\n", + " 'code_v1_num_chars': 298,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\n\\nN = int(eval(input()))\\nd = defaultdict(int)\\nfor i in range(N):\\n S = eval(input())\\n d[S] += 1\\nm = 0\\nfor k in list(d.keys()):\\n m = max(d[k], m)\\nli = []\\nfor k in list(d.keys()):\\n if d[k] == m:\\n li.append(k)\\nli.sort()\\nfor l in li:\\n print(l)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\nN = int(eval(input()))\\nSs = [eval(input()) for i in range(N)]\\nd = defaultdict(int)\\nfor S in Ss:\\n d[S] += 1\\nmx = max([d[k] for k in list(d.keys())])\\nans = []\\nfor k in list(d.keys()):\\n if d[k] == mx:\\n ans.append(k)\\nfor a in sorted(ans):\\n print(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.0,\n", + " 'diff': ['+Ss = [eval(input()) for i in range(N)]',\n", + " '-for i in range(N):',\n", + " '- S = eval(input())',\n", + " '+for S in Ss:',\n", + " '-m = 0',\n", + " '+mx = max([d[k] for k in list(d.keys())])',\n", + " '+ans = []',\n", + " '- m = max(d[k], m)',\n", + " '-li = []',\n", + " '-for k in list(d.keys()):',\n", + " '- if d[k] == m:',\n", + " '- li.append(k)',\n", + " '-li.sort()',\n", + " '-for l in li:',\n", + " '- print(l)',\n", + " '+ if d[k] == mx:',\n", + " '+ ans.append(k)',\n", + " '+for a in sorted(ans):',\n", + " '+ print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1866922059,\n", + " 'measured_runtime_v1': 0.0060809708,\n", + " 'runtime_lift': 30.7010529798,\n", + " 'key': ['s347160213', 's313812634']},\n", + " {'user_id': 'u346812984',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's133823600',\n", + " 'submission_id_v1': 's446849062',\n", + " 'cpu_time_v0': 124,\n", + " 'cpu_time_v1': 97,\n", + " 'memory_v0': 26420,\n", + " 'memory_v1': 26444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.77,\n", + " 'input': 'K, N = list(map(int, input().split()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\ndiff = A[0] + K - A[-1]\\n\\nans = A[-1] - A[0]\\n\\nfor i in range(1, N):\\n\\n dist = K - A[i] + A[i - 1]\\n\\n if dist < ans:\\n\\n ans = dist\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'import sys\\n\\n\\n\\n\\n\\ndef input():\\n\\n return sys.stdin.readline().strip()\\n\\n\\n\\n\\n\\ndef main():\\n\\n K, N = list(map(int, input().split()))\\n\\n A = list(map(int, input().split()))\\n\\n\\n\\n ans = [K - A[i] + A[i - 1] for i in range(1, N)]\\n\\n print((min(min(ans), A[-1] - A[0])))\\n\\n\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 226,\n", + " 'code_v1_num_chars': 274,\n", + " 'code_v0_no_empty_lines': 'K, N = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\ndiff = A[0] + K - A[-1]\\nans = A[-1] - A[0]\\nfor i in range(1, N):\\n dist = K - A[i] + A[i - 1]\\n if dist < ans:\\n ans = dist\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n K, N = list(map(int, input().split()))\\n A = list(map(int, input().split()))\\n ans = [K - A[i] + A[i - 1] for i in range(1, N)]\\n print((min(min(ans), A[-1] - A[0])))\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.25,\n", + " 'diff': ['-K, N = list(map(int, input().split()))',\n", + " '-A = list(map(int, input().split()))',\n", + " '-diff = A[0] + K - A[-1]',\n", + " '-ans = A[-1] - A[0]',\n", + " '-for i in range(1, N):',\n", + " '- dist = K - A[i] + A[i - 1]',\n", + " '- if dist < ans:',\n", + " '- ans = dist',\n", + " '-print(ans)',\n", + " '+import sys',\n", + " '+',\n", + " '+',\n", + " '+def input():',\n", + " '+ return sys.stdin.readline().strip()',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ K, N = list(map(int, input().split()))',\n", + " '+ A = list(map(int, input().split()))',\n", + " '+ ans = [K - A[i] + A[i - 1] for i in range(1, N)]',\n", + " '+ print((min(min(ans), A[-1] - A[0])))',\n", + " '+',\n", + " '+',\n", + " '+main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2153115588,\n", + " 'measured_runtime_v1': 0.0063990955,\n", + " 'runtime_lift': 33.6471865365,\n", + " 'key': ['s133823600', 's446849062']},\n", + " {'user_id': 'u832039789',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's697210381',\n", + " 'submission_id_v1': 's891872184',\n", + " 'cpu_time_v0': 235,\n", + " 'cpu_time_v1': 207,\n", + " 'memory_v0': 11656,\n", + " 'memory_v1': 8592,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.91,\n", + " 'input': 'n,m = list(map(int, input().split()))\\n\\na = [-1] + [int(eval(input())) for _ in range(m)] + [n + 1]\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\nfib = [0, 1]\\n\\nfor i in range(100100):\\n\\n\\tfib.append((fib[i] + fib[i + 1] % MOD))\\n\\n\\n\\nres = 1\\n\\nfor i in range(m + 1):\\n\\n\\tp, q = a[i], a[i + 1]\\n\\n\\tres = (res * fib[q - p - 1]) % MOD\\n\\n\\n\\nprint(res)',\n", + " 'target': 'n,m = list(map(int, input().split()))\\n\\na = [int(eval(input())) for _ in range(m)]\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\n# broken[i] : i段目が壊れていたらTrue\\n\\nbroken = [False] * 100100\\n\\nfor i in a:\\n\\n\\tbroken[i] = True\\n\\n\\n\\n# dp[i] : i段目に行く通り数\\n\\ndp = [0] * 100100\\n\\n\\n\\n# 0段目に行く方法は1通り\\n\\ndp[0] = 1\\n\\n\\n\\n# 1段目からn段目について調べる\\n\\nfor i in range(1, n + 1):\\n\\n\\t# 壊れてるなら\\n\\n\\tif broken[i]:\\n\\n\\t\\t# その段には進めないので0通り\\n\\n\\t\\tdp[i] = 0\\n\\n\\t# 壊れてないなら\\n\\n\\telse:\\n\\n\\t\\t# i - 1段目から移動可能 (i - 1段目は, i == 0 のときにはないので分岐)\\n\\n\\t\\tif i > 0:\\n\\n\\t\\t\\tdp[i] += dp[i - 1]\\n\\n\\t\\t# i - 2段目から移動可能 (i - 2段目は, i == 0, 1 のときにはないので分岐)\\n\\n\\t\\tif i > 1:\\n\\n\\t\\t\\tdp[i] += dp[i - 2]\\n\\n\\tdp[i] %= MOD\\n\\n\\n\\nprint((dp[n]))',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 298,\n", + " 'code_v1_num_chars': 584,\n", + " 'code_v0_no_empty_lines': 'n, m = list(map(int, input().split()))\\na = [-1] + [int(eval(input())) for _ in range(m)] + [n + 1]\\nMOD = 10**9 + 7\\nfib = [0, 1]\\nfor i in range(100100):\\n fib.append((fib[i] + fib[i + 1] % MOD))\\nres = 1\\nfor i in range(m + 1):\\n p, q = a[i], a[i + 1]\\n res = (res * fib[q - p - 1]) % MOD\\nprint(res)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\na = [int(eval(input())) for _ in range(m)]\\nMOD = 10**9 + 7\\n# broken[i] : i段目が壊れていたらTrue\\nbroken = [False] * 100100\\nfor i in a:\\n broken[i] = True\\n# dp[i] : i段目に行く通り数\\ndp = [0] * 100100\\n# 0段目に行く方法は1通り\\ndp[0] = 1\\n# 1段目からn段目について調べる\\nfor i in range(1, n + 1):\\n # 壊れてるなら\\n if broken[i]:\\n # その段には進めないので0通り\\n dp[i] = 0\\n # 壊れてないなら\\n else:\\n # i - 1段目から移動可能 (i - 1段目は, i == 0 のときにはないので分岐)\\n if i > 0:\\n dp[i] += dp[i - 1]\\n # i - 2段目から移動可能 (i - 2段目は, i == 0, 1 のときにはないので分岐)\\n if i > 1:\\n dp[i] += dp[i - 2]\\n dp[i] %= MOD\\nprint((dp[n]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 56.25,\n", + " 'diff': ['-a = [-1] + [int(eval(input())) for _ in range(m)] + [n + 1]',\n", + " '+a = [int(eval(input())) for _ in range(m)]',\n", + " '-fib = [0, 1]',\n", + " '-for i in range(100100):',\n", + " '- fib.append((fib[i] + fib[i + 1] % MOD))',\n", + " '-res = 1',\n", + " '-for i in range(m + 1):',\n", + " '- p, q = a[i], a[i + 1]',\n", + " '- res = (res * fib[q - p - 1]) % MOD',\n", + " '-print(res)',\n", + " '+# broken[i] : i段目が壊れていたらTrue',\n", + " '+broken = [False] * 100100',\n", + " '+for i in a:',\n", + " '+ broken[i] = True',\n", + " '+# dp[i] : i段目に行く通り数',\n", + " '+dp = [0] * 100100',\n", + " '+# 0段目に行く方法は1通り',\n", + " '+dp[0] = 1',\n", + " '+# 1段目からn段目について調べる',\n", + " '+for i in range(1, n + 1):',\n", + " '+ # 壊れてるなら',\n", + " '+ if broken[i]:',\n", + " '+ # その段には進めないので0通り',\n", + " '+ dp[i] = 0',\n", + " '+ # 壊れてないなら',\n", + " '+ else:',\n", + " '+ # i - 1段目から移動可能 (i - 1段目は, i == 0 のときにはないので分岐)',\n", + " '+ if i > 0:',\n", + " '+ dp[i] += dp[i - 1]',\n", + " '+ # i - 2段目から移動可能 (i - 2段目は, i == 0, 1 のときにはないので分岐)',\n", + " '+ if i > 1:',\n", + " '+ dp[i] += dp[i - 2]',\n", + " '+ dp[i] %= MOD',\n", + " '+print((dp[n]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5020096426,\n", + " 'measured_runtime_v1': 0.2284468935,\n", + " 'runtime_lift': 2.197489469,\n", + " 'key': ['s697210381', 's891872184']},\n", + " {'user_id': 'u644907318',\n", + " 'problem_id': 'p03640',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's119147613',\n", + " 'submission_id_v1': 's968932958',\n", + " 'cpu_time_v0': 239,\n", + " 'cpu_time_v1': 124,\n", + " 'memory_v0': 45168,\n", + " 'memory_v1': 74520,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.12,\n", + " 'input': 'H,W = list(map(int,input().split()))\\n\\nN = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\nA.insert(0,0)\\n\\nC = [[0 for _ in range(W)] for _ in range(H)]\\n\\ncur = [0,0,\"R\"]\\n\\nfor k in range(1,N+1):\\n\\n# ipdb.set_trace()\\n\\n a = A[k]\\n\\n cnt = 0\\n\\n y,x,d = cur\\n\\n for i in range(y,H):\\n\\n y = i\\n\\n if d==\"R\":\\n\\n for j in range(x,W):\\n\\n C[i][j]=str(k)\\n\\n cnt += 1\\n\\n if j+1=1:\\n\\n x = j-1\\n\\n else:\\n\\n x = 0\\n\\n if cnt==a:break\\n\\n if cnt==a:break\\n\\n d=\"R\"\\n\\n if x==W-1:\\n\\n if C[y][x]!=0:\\n\\n y += 1\\n\\n d=\"L\"\\n\\n elif x==0:\\n\\n if C[y][x]!=0:\\n\\n y += 1\\n\\n d=\"R\"\\n\\n cur = [y,x,d] \\n\\nfor i in range(H):\\n\\n print((*C[i]))',\n", + " 'target': 'H,W = list(map(int,input().split()))\\n\\nN = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\nA.insert(0,0)\\n\\nB = [[0 for _ in range(W)] for _ in range(H)]\\n\\ncol = 1\\n\\ncnt = 0\\n\\ny = 0\\n\\nx = 0\\n\\nd = \"R\"\\n\\nwhile y0:\\n\\n x -= 1\\n\\n elif d==\"L\" and x==0:\\n\\n y += 1\\n\\n d = \"R\"\\n\\nfor i in range(H):\\n\\n print((*B[i]))',\n", + " 'code_v0_loc': 46,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 1123,\n", + " 'code_v1_num_chars': 591,\n", + " 'code_v0_no_empty_lines': 'H, W = list(map(int, input().split()))\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nA.insert(0, 0)\\nC = [[0 for _ in range(W)] for _ in range(H)]\\ncur = [0, 0, \"R\"]\\nfor k in range(1, N + 1):\\n # ipdb.set_trace()\\n a = A[k]\\n cnt = 0\\n y, x, d = cur\\n for i in range(y, H):\\n y = i\\n if d == \"R\":\\n for j in range(x, W):\\n C[i][j] = str(k)\\n cnt += 1\\n if j + 1 < W:\\n x = j + 1\\n else:\\n x = j\\n if cnt == a:\\n break\\n if cnt == a:\\n break\\n d = \"L\"\\n else:\\n for j in range(x, -1, -1):\\n C[i][j] = str(k)\\n cnt += 1\\n if j >= 1:\\n x = j - 1\\n else:\\n x = 0\\n if cnt == a:\\n break\\n if cnt == a:\\n break\\n d = \"R\"\\n if x == W - 1:\\n if C[y][x] != 0:\\n y += 1\\n d = \"L\"\\n elif x == 0:\\n if C[y][x] != 0:\\n y += 1\\n d = \"R\"\\n cur = [y, x, d]\\nfor i in range(H):\\n print((*C[i]))\\n',\n", + " 'code_v1_no_empty_lines': 'H, W = list(map(int, input().split()))\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nA.insert(0, 0)\\nB = [[0 for _ in range(W)] for _ in range(H)]\\ncol = 1\\ncnt = 0\\ny = 0\\nx = 0\\nd = \"R\"\\nwhile y < H:\\n if cnt < A[col]:\\n B[y][x] = col\\n cnt += 1\\n else:\\n col += 1\\n cnt = 0\\n B[y][x] = col\\n cnt += 1\\n if x < W - 1 and d == \"R\":\\n x += 1\\n elif x == W - 1 and d == \"R\":\\n y += 1\\n d = \"L\"\\n elif d == \"L\" and x > 0:\\n x -= 1\\n elif d == \"L\" and x == 0:\\n y += 1\\n d = \"R\"\\nfor i in range(H):\\n print((*B[i]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 32.6086956522,\n", + " 'diff': ['-C = [[0 for _ in range(W)] for _ in range(H)]',\n", + " '-cur = [0, 0, \"R\"]',\n", + " '-for k in range(1, N + 1):',\n", + " '- # ipdb.set_trace()',\n", + " '- a = A[k]',\n", + " '- cnt = 0',\n", + " '- y, x, d = cur',\n", + " '- for i in range(y, H):',\n", + " '- y = i',\n", + " '- if d == \"R\":',\n", + " '- for j in range(x, W):',\n", + " '- C[i][j] = str(k)',\n", + " '- cnt += 1',\n", + " '- if j + 1 < W:',\n", + " '- x = j + 1',\n", + " '- else:',\n", + " '- x = j',\n", + " '- if cnt == a:',\n", + " '- break',\n", + " '- if cnt == a:',\n", + " '- break',\n", + " '- d = \"L\"',\n", + " '- else:',\n", + " '- for j in range(x, -1, -1):',\n", + " '- C[i][j] = str(k)',\n", + " '- cnt += 1',\n", + " '- if j >= 1:',\n", + " '- x = j - 1',\n", + " '- else:',\n", + " '- x = 0',\n", + " '- if cnt == a:',\n", + " '- break',\n", + " '- if cnt == a:',\n", + " '- break',\n", + " '- d = \"R\"',\n", + " '- if x == W - 1:',\n", + " '- if C[y][x] != 0:',\n", + " '- y += 1',\n", + " '- d = \"L\"',\n", + " '- elif x == 0:',\n", + " '- if C[y][x] != 0:',\n", + " '- y += 1',\n", + " '- d = \"R\"',\n", + " '- cur = [y, x, d]',\n", + " '+B = [[0 for _ in range(W)] for _ in range(H)]',\n", + " '+col = 1',\n", + " '+cnt = 0',\n", + " '+y = 0',\n", + " '+x = 0',\n", + " '+d = \"R\"',\n", + " '+while y < H:',\n", + " '+ if cnt < A[col]:',\n", + " '+ B[y][x] = col',\n", + " '+ cnt += 1',\n", + " '+ else:',\n", + " '+ col += 1',\n", + " '+ cnt = 0',\n", + " '+ B[y][x] = col',\n", + " '+ cnt += 1',\n", + " '+ if x < W - 1 and d == \"R\":',\n", + " '+ x += 1',\n", + " '+ elif x == W - 1 and d == \"R\":',\n", + " '+ y += 1',\n", + " '+ d = \"L\"',\n", + " '+ elif d == \"L\" and x > 0:',\n", + " '+ x -= 1',\n", + " '+ elif d == \"L\" and x == 0:',\n", + " '+ y += 1',\n", + " '+ d = \"R\"',\n", + " '- print((*C[i]))',\n", + " '+ print((*B[i]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3307979391,\n", + " 'measured_runtime_v1': 0.2498238492,\n", + " 'runtime_lift': 1.3241247387,\n", + " 'key': ['s119147613', 's968932958']},\n", + " {'user_id': 'u390727364',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's052815695',\n", + " 'submission_id_v1': 's461844743',\n", + " 'cpu_time_v0': 103,\n", + " 'cpu_time_v1': 51,\n", + " 'memory_v0': 9116,\n", + " 'memory_v1': 9132,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.49,\n", + " 'input': 'x = int(eval(input()))\\n\\na = 0\\n\\nb = 0\\n\\nfor i in range(-200, 200):\\n\\n for j in range(-200, 200):\\n\\n if i ** 5 - j ** 5 == x:\\n\\n a = i\\n\\n b = j\\n\\nprint((a, b))\\n',\n", + " 'target': 'x = int(eval(input()))\\n\\na = 0\\n\\nb = 0\\n\\nfor i in range(-120, 120):\\n\\n for j in range(-120, 120):\\n\\n if i ** 5 - j ** 5 == x:\\n\\n a = i\\n\\n b = j\\n\\nprint((a, b))\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 176,\n", + " 'code_v1_num_chars': 176,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\na = 0\\nb = 0\\nfor i in range(-200, 200):\\n for j in range(-200, 200):\\n if i**5 - j**5 == x:\\n a = i\\n b = j\\nprint((a, b))\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\na = 0\\nb = 0\\nfor i in range(-120, 120):\\n for j in range(-120, 120):\\n if i**5 - j**5 == x:\\n a = i\\n b = j\\nprint((a, b))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in range(-200, 200):',\n", + " '- for j in range(-200, 200):',\n", + " '+for i in range(-120, 120):',\n", + " '+ for j in range(-120, 120):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.9439397931,\n", + " 'measured_runtime_v1': 0.4738806367,\n", + " 'runtime_lift': 1.9919357745,\n", + " 'key': ['s052815695', 's461844743']},\n", + " {'user_id': 'u033606236',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's645296559',\n", + " 'submission_id_v1': 's055332014',\n", + " 'cpu_time_v0': 229,\n", + " 'cpu_time_v1': 39,\n", + " 'memory_v0': 4020,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.97,\n", + " 'input': 'import math\\n\\nprint((math.factorial(int(eval(input())))%1000000007))',\n", + " 'target': 'num = int(eval(input()))\\n\\nresult = 1\\n\\nfor i in range(1,num+1):\\n\\n result = result *i % 1000000007\\n\\nprint(result)',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 59,\n", + " 'code_v1_num_chars': 108,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nprint((math.factorial(int(eval(input()))) % 1000000007))\\n',\n", + " 'code_v1_no_empty_lines': 'num = int(eval(input()))\\nresult = 1\\nfor i in range(1, num + 1):\\n result = result * i % 1000000007\\nprint(result)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 60.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(int(eval(input()))) % 1000000007))',\n", + " '+num = int(eval(input()))',\n", + " '+result = 1',\n", + " '+for i in range(1, num + 1):',\n", + " '+ result = result * i % 1000000007',\n", + " '+print(result)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7005937328,\n", + " 'measured_runtime_v1': 0.3298725822,\n", + " 'runtime_lift': 2.1238313537,\n", + " 'key': ['s645296559', 's055332014']},\n", + " {'user_id': 'u638795007',\n", + " 'problem_id': 'p04020',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's043977447',\n", + " 'submission_id_v1': 's372001933',\n", + " 'cpu_time_v0': 265,\n", + " 'cpu_time_v1': 111,\n", + " 'memory_v0': 44252,\n", + " 'memory_v1': 8004,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 58.11,\n", + " 'input': \"def examB():\\n\\n N = I(); A = [I() for _ in range(N)]\\n\\n ans = 0; cur= 0\\n\\n for i in A:\\n\\n if i==0:\\n\\n ans += cur//2\\n\\n cur = 0\\n\\n else:\\n\\n cur += i\\n\\n ans += cur // 2\\n\\n print(ans)\\n\\n return\\n\\n\\n\\nimport sys,copy,bisect,itertools,heapq,math\\n\\nfrom heapq import heappop,heappush,heapify\\n\\nfrom collections import Counter,defaultdict,deque\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LI(): return list(map(int,sys.stdin.readline().split()))\\n\\ndef LSI(): return list(map(str,sys.stdin.readline().split()))\\n\\ndef LS(): return sys.stdin.readline().split()\\n\\ndef SI(): return sys.stdin.readline().strip()\\n\\nmod = 10**9 + 7\\n\\ninf = float('inf')\\n\\n\\n\\nif __name__ == '__main__':\\n\\n examB()\\n\",\n", + " 'target': 'def examA():\\n\\n S = SI()\\n\\n if \"W\" in S and not \"E\" in S:\\n\\n print(\"No\")\\n\\n elif \"E\" in S and not \"W\" in S:\\n\\n print(\"No\")\\n\\n elif \"N\" in S and not \"S\" in S:\\n\\n print(\"No\")\\n\\n elif \"S\" in S and not \"N\" in S:\\n\\n print(\"No\")\\n\\n else:\\n\\n print(\"Yes\")\\n\\n return\\n\\n\\n\\ndef examB():\\n\\n N = I()\\n\\n A = [I()for _ in range(N)]\\n\\n ans = 0\\n\\n for i in range(N-1):\\n\\n ans += A[i]//2\\n\\n if A[i]%2 and A[i+1]>=1:\\n\\n ans += 1\\n\\n A[i+1] -= 1\\n\\n ans += A[N-1]//2\\n\\n print(ans)\\n\\n return\\n\\n\\n\\ndef examC():\\n\\n ans = 0\\n\\n print(ans)\\n\\n return\\n\\n\\n\\ndef examD():\\n\\n N = I()\\n\\n S = [I()for _ in range(N)]\\n\\n\\n\\n ans = 0\\n\\n print(ans)\\n\\n return\\n\\n\\n\\ndef examE():\\n\\n ans = 0\\n\\n print(ans)\\n\\n return\\n\\n\\n\\ndef examF():\\n\\n ans = 0\\n\\n print(ans)\\n\\n return\\n\\n\\n\\nimport sys,bisect,itertools,heapq,math,random\\n\\nfrom copy import deepcopy\\n\\nfrom heapq import heappop,heappush,heapify\\n\\nfrom collections import Counter,defaultdict,deque\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LI(): return list(map(int,sys.stdin.readline().split()))\\n\\ndef LSI(): return list(map(str,sys.stdin.readline().split()))\\n\\ndef LS(): return sys.stdin.readline().split()\\n\\ndef SI(): return sys.stdin.readline().strip()\\n\\nglobal mod,mod2,inf,alphabet,_ep\\n\\nmod = 10**9 + 7\\n\\nmod2 = 998244353\\n\\ninf = 10**18\\n\\n_ep = 10**(-12)\\n\\nalphabet = [chr(ord(\\'a\\') + i) for i in range(26)]\\n\\n\\n\\nsys.setrecursionlimit(10**6)\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n examB()\\n\\n\\n\\n\"\"\"\\n\\n\\n\\n\"\"\"',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 74,\n", + " 'code_v0_num_chars': 729,\n", + " 'code_v1_num_chars': 1504,\n", + " 'code_v0_no_empty_lines': 'def examB():\\n N = I()\\n A = [I() for _ in range(N)]\\n ans = 0\\n cur = 0\\n for i in A:\\n if i == 0:\\n ans += cur // 2\\n cur = 0\\n else:\\n cur += i\\n ans += cur // 2\\n print(ans)\\n return\\n\\n\\nimport sys, copy, bisect, itertools, heapq, math\\nfrom heapq import heappop, heappush, heapify\\nfrom collections import Counter, defaultdict, deque\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LSI():\\n return list(map(str, sys.stdin.readline().split()))\\n\\n\\ndef LS():\\n return sys.stdin.readline().split()\\n\\n\\ndef SI():\\n return sys.stdin.readline().strip()\\n\\n\\nmod = 10**9 + 7\\ninf = float(\"inf\")\\nif __name__ == \"__main__\":\\n examB()\\n',\n", + " 'code_v1_no_empty_lines': 'def examA():\\n S = SI()\\n if \"W\" in S and not \"E\" in S:\\n print(\"No\")\\n elif \"E\" in S and not \"W\" in S:\\n print(\"No\")\\n elif \"N\" in S and not \"S\" in S:\\n print(\"No\")\\n elif \"S\" in S and not \"N\" in S:\\n print(\"No\")\\n else:\\n print(\"Yes\")\\n return\\n\\n\\ndef examB():\\n N = I()\\n A = [I() for _ in range(N)]\\n ans = 0\\n for i in range(N - 1):\\n ans += A[i] // 2\\n if A[i] % 2 and A[i + 1] >= 1:\\n ans += 1\\n A[i + 1] -= 1\\n ans += A[N - 1] // 2\\n print(ans)\\n return\\n\\n\\ndef examC():\\n ans = 0\\n print(ans)\\n return\\n\\n\\ndef examD():\\n N = I()\\n S = [I() for _ in range(N)]\\n ans = 0\\n print(ans)\\n return\\n\\n\\ndef examE():\\n ans = 0\\n print(ans)\\n return\\n\\n\\ndef examF():\\n ans = 0\\n print(ans)\\n return\\n\\n\\nimport sys, bisect, itertools, heapq, math, random\\nfrom copy import deepcopy\\nfrom heapq import heappop, heappush, heapify\\nfrom collections import Counter, defaultdict, deque\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef LSI():\\n return list(map(str, sys.stdin.readline().split()))\\n\\n\\ndef LS():\\n return sys.stdin.readline().split()\\n\\n\\ndef SI():\\n return sys.stdin.readline().strip()\\n\\n\\nglobal mod, mod2, inf, alphabet, _ep\\nmod = 10**9 + 7\\nmod2 = 998244353\\ninf = 10**18\\n_ep = 10 ** (-12)\\nalphabet = [chr(ord(\"a\") + i) for i in range(26)]\\nsys.setrecursionlimit(10**6)\\nif __name__ == \"__main__\":\\n examB()\\n\"\"\"\\n\"\"\"\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 64.8648648649,\n", + " 'diff': ['+def examA():',\n", + " '+ S = SI()',\n", + " '+ if \"W\" in S and not \"E\" in S:',\n", + " '+ print(\"No\")',\n", + " '+ elif \"E\" in S and not \"W\" in S:',\n", + " '+ print(\"No\")',\n", + " '+ elif \"N\" in S and not \"S\" in S:',\n", + " '+ print(\"No\")',\n", + " '+ elif \"S\" in S and not \"N\" in S:',\n", + " '+ print(\"No\")',\n", + " '+ else:',\n", + " '+ print(\"Yes\")',\n", + " '+ return',\n", + " '+',\n", + " '+',\n", + " '- cur = 0',\n", + " '- for i in A:',\n", + " '- if i == 0:',\n", + " '- ans += cur // 2',\n", + " '- cur = 0',\n", + " '- else:',\n", + " '- cur += i',\n", + " '- ans += cur // 2',\n", + " '+ for i in range(N - 1):',\n", + " '+ ans += A[i] // 2',\n", + " '+ if A[i] % 2 and A[i + 1] >= 1:',\n", + " '+ ans += 1',\n", + " '+ A[i + 1] -= 1',\n", + " '+ ans += A[N - 1] // 2',\n", + " '-import sys, copy, bisect, itertools, heapq, math',\n", + " '+def examC():',\n", + " '+ ans = 0',\n", + " '+ print(ans)',\n", + " '+ return',\n", + " '+',\n", + " '+',\n", + " '+def examD():',\n", + " '+ N = I()',\n", + " '+ S = [I() for _ in range(N)]',\n", + " '+ ans = 0',\n", + " '+ print(ans)',\n", + " '+ return',\n", + " '+',\n", + " '+',\n", + " '+def examE():',\n", + " '+ ans = 0',\n", + " '+ print(ans)',\n", + " '+ return',\n", + " '+',\n", + " '+',\n", + " '+def examF():',\n", + " '+ ans = 0',\n", + " '+ print(ans)',\n", + " '+ return',\n", + " '+',\n", + " '+',\n", + " '+import sys, bisect, itertools, heapq, math, random',\n", + " '+from copy import deepcopy',\n", + " '+global mod, mod2, inf, alphabet, _ep',\n", + " '-inf = float(\"inf\")',\n", + " '+mod2 = 998244353',\n", + " '+inf = 10**18',\n", + " '+_ep = 10 ** (-12)',\n", + " '+alphabet = [chr(ord(\"a\") + i) for i in range(26)]',\n", + " '+sys.setrecursionlimit(10**6)',\n", + " '+\"\"\"',\n", + " '+\"\"\"'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1928541586,\n", + " 'measured_runtime_v1': 0.006450581,\n", + " 'runtime_lift': 29.8971764609,\n", + " 'key': ['s043977447', 's372001933']},\n", + " {'user_id': 'u634079249',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's319738471',\n", + " 'submission_id_v1': 's179019070',\n", + " 'cpu_time_v0': 343,\n", + " 'cpu_time_v1': 55,\n", + " 'memory_v0': 9820,\n", + " 'memory_v1': 9920,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.97,\n", + " 'input': 'import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array\\n\\n\\n\\n# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\\n\\n# from decimal import Decimal\\n\\n# from collections import defaultdict, deque\\n\\n\\n\\nsys.setrecursionlimit(10000000)\\n\\n\\n\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\n\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\n\\nfl = lambda: list(map(float, sys.stdin.buffer.readline().split()))\\n\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\n\\n\\n\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\n\\nsl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))\\n\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\n\\n\\n\\nlcm = lambda x, y: (x * y) // math.gcd(x, y)\\n\\n\\n\\nMOD = 10 ** 9 + 7\\n\\nINF = float(\\'inf\\')\\n\\n\\n\\n\\n\\ndef main():\\n\\n if os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"input.txt\", \"r\")\\n\\n\\n\\n S = ii()\\n\\n dp = [0] * (S + 1)\\n\\n\\n\\n dp[0] = 1\\n\\n # 0 <= i <= Sの範囲を探索\\n\\n for i in range(1, S + 1):\\n\\n # 0 <= j <= i - 3の範囲で、\\n\\n # 間仕切りを置くことができる個数の合計を集計\\n\\n for j in range(0, i - 3 + 1):\\n\\n dp[i] += dp[j]\\n\\n dp[i] %= MOD\\n\\n print((dp[-1]))\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': 'import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array\\n\\n\\n\\n# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\\n\\n# from decimal import Decimal\\n\\n# from collections import defaultdict, deque\\n\\n\\n\\nsys.setrecursionlimit(10000000)\\n\\n\\n\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\n\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\n\\nfl = lambda: list(map(float, sys.stdin.buffer.readline().split()))\\n\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\n\\n\\n\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\n\\nsl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))\\n\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\n\\n\\n\\nlcm = lambda x, y: (x * y) // math.gcd(x, y)\\n\\n\\n\\nMOD = 10 ** 9 + 7\\n\\nINF = float(\\'inf\\')\\n\\n\\n\\n\\n\\ndef main():\\n\\n if os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"input.txt\", \"r\")\\n\\n\\n\\n S = ii()\\n\\n dp = [0] * (S + 1)\\n\\n\\n\\n dp[0] = 1\\n\\n # 0 <= i <= Sの範囲を探索\\n\\n for i in range(1, S + 1):\\n\\n # 0 <= j <= i - 3の範囲で、\\n\\n # 間仕切りを置くことができる個数の合計を集計\\n\\n if i > 2:\\n\\n dp[i] = sum(dp[0:i - 2])\\n\\n dp[i] %= MOD\\n\\n print((dp[-1]))\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'code_v0_loc': 43,\n", + " 'code_v1_loc': 43,\n", + " 'code_v0_num_chars': 1269,\n", + " 'code_v1_num_chars': 1259,\n", + " 'code_v0_no_empty_lines': 'import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array\\n\\n# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\\n# from decimal import Decimal\\n# from collections import defaultdict, deque\\nsys.setrecursionlimit(10000000)\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\nfl = lambda: list(map(float, sys.stdin.buffer.readline().split()))\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\nsl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\nlcm = lambda x, y: (x * y) // math.gcd(x, y)\\nMOD = 10**9 + 7\\nINF = float(\"inf\")\\n\\n\\ndef main():\\n if os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"input.txt\", \"r\")\\n S = ii()\\n dp = [0] * (S + 1)\\n dp[0] = 1\\n # 0 <= i <= Sの範囲を探索\\n for i in range(1, S + 1):\\n # 0 <= j <= i - 3の範囲で、\\n # 間仕切りを置くことができる個数の合計を集計\\n for j in range(0, i - 3 + 1):\\n dp[i] += dp[j]\\n dp[i] %= MOD\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array\\n\\n# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\\n# from decimal import Decimal\\n# from collections import defaultdict, deque\\nsys.setrecursionlimit(10000000)\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\nfl = lambda: list(map(float, sys.stdin.buffer.readline().split()))\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\nsl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\nlcm = lambda x, y: (x * y) // math.gcd(x, y)\\nMOD = 10**9 + 7\\nINF = float(\"inf\")\\n\\n\\ndef main():\\n if os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"input.txt\", \"r\")\\n S = ii()\\n dp = [0] * (S + 1)\\n dp[0] = 1\\n # 0 <= i <= Sの範囲を探索\\n for i in range(1, S + 1):\\n # 0 <= j <= i - 3の範囲で、\\n # 間仕切りを置くことができる個数の合計を集計\\n if i > 2:\\n dp[i] = sum(dp[0 : i - 2])\\n dp[i] %= MOD\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- for j in range(0, i - 3 + 1):',\n", + " '- dp[i] += dp[j]',\n", + " '+ if i > 2:',\n", + " '+ dp[i] = sum(dp[0 : i - 2])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.530304636,\n", + " 'measured_runtime_v1': 0.2333806806,\n", + " 'runtime_lift': 2.2722730721,\n", + " 'key': ['s319738471', 's179019070']},\n", + " {'user_id': 'u186838327',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's155084707',\n", + " 'submission_id_v1': 's301395968',\n", + " 'cpu_time_v0': 231,\n", + " 'cpu_time_v1': 177,\n", + " 'memory_v0': 4104,\n", + " 'memory_v1': 38640,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.38,\n", + " 'input': 'import math\\n\\nn = int(eval(input()))\\n\\nprint((math.factorial(n)%(10**9+7)))',\n", + " 'target': 'n = int(eval(input()))\\n\\nans = 1\\n\\nmod = 10**9+7\\n\\nfor i in range(1, n+1):\\n\\n ans *= i\\n\\n ans %= mod\\n\\n\\n\\nans %= mod\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 65,\n", + " 'code_v1_num_chars': 122,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nprint((math.factorial(n) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 1\\nmod = 10**9 + 7\\nfor i in range(1, n + 1):\\n ans *= i\\n ans %= mod\\nans %= mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(n) % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+mod = 10**9 + 7',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= mod',\n", + " '+ans %= mod',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5786725054,\n", + " 'measured_runtime_v1': 0.2556207638,\n", + " 'runtime_lift': 2.2637930378,\n", + " 'key': ['s155084707', 's301395968']},\n", + " {'user_id': 'u238940874',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's425361145',\n", + " 'submission_id_v1': 's820245641',\n", + " 'cpu_time_v0': 183,\n", + " 'cpu_time_v1': 162,\n", + " 'memory_v0': 25840,\n", + " 'memory_v1': 25840,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.48,\n", + " 'input': 'k,n = list(map(int,input().split()))\\n\\na=list(map(int,input().split()))\\n\\na.append(a[0]+k)\\n\\nlongd=0\\n\\nfor i in range(n):\\n\\n tmp=abs(a[i+1]-a[i])\\n\\n longd=max(longd,tmp)\\n\\nprint((k-longd))',\n", + " 'target': 'k,n=list(map(int,input().split()))\\n\\na=list(map(int,input().split()))\\n\\na.append(a[0]+k)\\n\\n\\n\\nx=0\\n\\nfor i in range(len(a)-1):\\n\\n dis=abs(a[i+1]-a[i])\\n\\n x=max(x,dis)\\n\\n\\n\\nprint((k-x))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 179,\n", + " 'code_v1_num_chars': 172,\n", + " 'code_v0_no_empty_lines': 'k, n = list(map(int, input().split()))\\na = list(map(int, input().split()))\\na.append(a[0] + k)\\nlongd = 0\\nfor i in range(n):\\n tmp = abs(a[i + 1] - a[i])\\n longd = max(longd, tmp)\\nprint((k - longd))\\n',\n", + " 'code_v1_no_empty_lines': 'k, n = list(map(int, input().split()))\\na = list(map(int, input().split()))\\na.append(a[0] + k)\\nx = 0\\nfor i in range(len(a) - 1):\\n dis = abs(a[i + 1] - a[i])\\n x = max(x, dis)\\nprint((k - x))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-longd = 0',\n", + " '-for i in range(n):',\n", + " '- tmp = abs(a[i + 1] - a[i])',\n", + " '- longd = max(longd, tmp)',\n", + " '-print((k - longd))',\n", + " '+x = 0',\n", + " '+for i in range(len(a) - 1):',\n", + " '+ dis = abs(a[i + 1] - a[i])',\n", + " '+ x = max(x, dis)',\n", + " '+print((k - x))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2313908032,\n", + " 'measured_runtime_v1': 0.1406400898,\n", + " 'runtime_lift': 1.645269165,\n", + " 'key': ['s425361145', 's820245641']},\n", + " {'user_id': 'u617990214',\n", + " 'problem_id': 'p02412',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's470319892',\n", + " 'submission_id_v1': 's042746843',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 6348,\n", + " 'memory_v1': 6436,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.33,\n", + " 'input': 'while True:\\n\\n\\tk=list(map(int,input().split(\" \")))\\n\\n\\tif k[0]==k[1]==0:\\n\\n\\t\\tbreak\\n\\n\\tct=0\\n\\n\\ta=0\\n\\n\\tb=0\\n\\n\\tc=0\\t\\n\\n\\tmax=k[0]\\n\\n\\tsum=k[1]\\n\\n\\ta=max+1\\n\\n\\t\\n\\n\\twhile True:\\n\\n\\t\\ta-=1\\n\\n\\t\\tb=a-1\\n\\n\\t\\tc=sum-a-b\\n\\n\\t\\tif not a>b>c:\\n\\n\\t\\t\\tprint(ct)\\n\\n\\t\\t\\tbreak\\n\\n\\t\\twhile a>b>c:\\n\\n\\t\\t\\tif a>b>c>0:\\n\\n\\t\\t\\t\\tct+=1\\n\\n\\t\\t\\tb-=1\\n\\n\\t\\t\\tc+=1\\n\\n\\t\\t\\t',\n", + " 'target': 'while True:\\n\\n\\tk=list(map(int,input().split(\" \")))\\n\\n\\tif k[0]==k[1]==0:\\n\\n\\t\\tbreak\\n\\n\\tct=0\\n\\n\\ta=0\\n\\n\\tb=0\\n\\n\\tc=0\\t\\n\\n\\tmax=k[0]\\n\\n\\tsum=k[1]\\n\\n\\ta=max+1\\n\\n\\twhile True:\\n\\n\\t\\ta-=1\\n\\n\\t\\tb=a-1\\n\\n\\t\\tc=sum-a-b\\n\\n\\t\\tif not a>c:\\n\\n\\t\\t\\tprint(ct)\\n\\n\\t\\t\\tbreak\\n\\n\\t\\twhile b>c:\\n\\n\\t\\t\\tif c>0:\\n\\n\\t\\t\\t\\tct+=1\\n\\n\\t\\t\\tb-=1\\n\\n\\t\\t\\tc+=1',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 287,\n", + " 'code_v1_num_chars': 271,\n", + " 'code_v0_no_empty_lines': 'while True:\\n k = list(map(int, input().split(\" \")))\\n if k[0] == k[1] == 0:\\n break\\n ct = 0\\n a = 0\\n b = 0\\n c = 0\\n max = k[0]\\n sum = k[1]\\n a = max + 1\\n while True:\\n a -= 1\\n b = a - 1\\n c = sum - a - b\\n if not a > b > c:\\n print(ct)\\n break\\n while a > b > c:\\n if a > b > c > 0:\\n ct += 1\\n b -= 1\\n c += 1\\n',\n", + " 'code_v1_no_empty_lines': 'while True:\\n k = list(map(int, input().split(\" \")))\\n if k[0] == k[1] == 0:\\n break\\n ct = 0\\n a = 0\\n b = 0\\n c = 0\\n max = k[0]\\n sum = k[1]\\n a = max + 1\\n while True:\\n a -= 1\\n b = a - 1\\n c = sum - a - b\\n if not a > c:\\n print(ct)\\n break\\n while b > c:\\n if c > 0:\\n ct += 1\\n b -= 1\\n c += 1\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.0,\n", + " 'diff': ['- if not a > b > c:',\n", + " '+ if not a > c:',\n", + " '- while a > b > c:',\n", + " '- if a > b > c > 0:',\n", + " '+ while b > c:',\n", + " '+ if c > 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2289849162,\n", + " 'measured_runtime_v1': 0.1798006518,\n", + " 'runtime_lift': 1.273548866,\n", + " 'key': ['s470319892', 's042746843']},\n", + " {'user_id': 'u047178225',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's842823347',\n", + " 'submission_id_v1': 's836367972',\n", + " 'cpu_time_v0': 81,\n", + " 'cpu_time_v1': 27,\n", + " 'memory_v0': 9444,\n", + " 'memory_v1': 9444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 66.67,\n", + " 'input': 'X = int(eval(input()))\\n\\n#print(X)\\n\\nn = X\\n\\ndiv = []\\n\\nfor i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n div.append(i)\\n\\n if i != n // i:\\n\\n div.append(n//i)\\n\\n#print(div)\\n\\n\\n\\nfor i in div:\\n\\n for a in range(0, 10001): \\n\\n b = a - i\\n\\n #print(a, b)\\n\\n if a**5 - b**5 == X:\\n\\n print((a, b))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break\\n\\n \\n\\n ',\n", + " 'target': 'X = int(eval(input()))\\n\\n#print(X)\\n\\nn = X\\n\\ndiv = []\\n\\nfor i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n div.append(i)\\n\\n if i != n // i:\\n\\n div.append(n//i)\\n\\n#print(div)\\n\\n\\n\\nfor i in div:\\n\\n for a in range(0, 1001): \\n\\n b = a - i\\n\\n #print(a, b)\\n\\n if a**5 - b**5 == X:\\n\\n print((a, b))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 355,\n", + " 'code_v1_num_chars': 343,\n", + " 'code_v0_no_empty_lines': 'X = int(eval(input()))\\n# print(X)\\nn = X\\ndiv = []\\nfor i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n div.append(i)\\n if i != n // i:\\n div.append(n // i)\\n# print(div)\\nfor i in div:\\n for a in range(0, 10001):\\n b = a - i\\n # print(a, b)\\n if a**5 - b**5 == X:\\n print((a, b))\\n break\\n else:\\n continue\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'X = int(eval(input()))\\n# print(X)\\nn = X\\ndiv = []\\nfor i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n div.append(i)\\n if i != n // i:\\n div.append(n // i)\\n# print(div)\\nfor i in div:\\n for a in range(0, 1001):\\n b = a - i\\n # print(a, b)\\n if a**5 - b**5 == X:\\n print((a, b))\\n break\\n else:\\n continue\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.6956521739,\n", + " 'diff': ['- for a in range(0, 10001):', '+ for a in range(0, 1001):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4829796672,\n", + " 'measured_runtime_v1': 0.3715977311,\n", + " 'runtime_lift': 1.2997379336,\n", + " 'key': ['s842823347', 's836367972']},\n", + " {'user_id': 'u606045429',\n", + " 'problem_id': 'p02850',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's780367922',\n", + " 'submission_id_v1': 's062691036',\n", + " 'cpu_time_v0': 222,\n", + " 'cpu_time_v1': 198,\n", + " 'memory_v0': 25900,\n", + " 'memory_v1': 25900,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.81,\n", + " 'input': '\"\"\"\\n\\nchallenge case\\n\\n\\n\\nin:\\n\\n3\\n\\n1 3\\n\\n2 3\\n\\n\\n\\nout:\\n\\n1\\n\\n1\\n\\n1\\n\\n\"\"\"\\n\\n\\n\\nfrom collections import deque\\n\\n\\n\\ndef main():\\n\\n\\tN, *AB = list(map(int, open(0).read().split()))\\n\\n\\tB = AB[1::2]\\n\\n\\n\\n\\tE = [[] for _ in range(N + 1)]\\n\\n\\tfor a, b in zip(*[iter(AB)] * 2):\\n\\n\\t\\tE[a] += b,\\n\\n\\n\\n\\tQ = deque([1])\\n\\n\\tC = [0] * (N + 1)\\n\\n\\twhile Q:\\n\\n\\t\\tv = Q.popleft()\\n\\n\\t\\tc = 0\\n\\n\\t\\tfor u in E[v]:\\n\\n\\t\\t\\tc += 1 + (c + 1 == C[v])\\n\\n\\t\\t\\tC[u] = c\\n\\n\\t\\t\\tQ += u,\\n\\n\\n\\n\\tprint((max(C)))\\n\\n\\tfor b in B:\\n\\n\\t\\tprint((C[b]))\\n\\n\\n\\nmain()',\n", + " 'target': '\"\"\"\\n\\nchallenge case\\n\\n\\n\\nin:\\n\\n3\\n\\n1 3\\n\\n2 3\\n\\n\\n\\nout:\\n\\n1\\n\\n1\\n\\n1\\n\\n\"\"\"\\n\\n\\n\\nfrom collections import deque\\n\\n\\n\\ndef main():\\n\\n\\tN, *AB = list(map(int, open(0).read().split()))\\n\\n\\tB = AB[1::2]\\n\\n\\n\\n\\tE = [[] for _ in range(N + 1)]\\n\\n\\tfor a, b in zip(*[iter(AB)] * 2):\\n\\n\\t\\tE[a].append(b)\\n\\n\\n\\n\\tQ = deque([1])\\n\\n\\tC = [0] * (N + 1)\\n\\n\\twhile Q:\\n\\n\\t\\tv = Q.popleft()\\n\\n\\t\\tc = 0\\n\\n\\t\\tfor u in E[v]:\\n\\n\\t\\t\\tc += 1 + (c + 1 == C[v])\\n\\n\\t\\t\\tC[u] = c\\n\\n\\t\\t\\tQ.append(u)\\n\\n\\n\\n\\tprint((max(C)))\\n\\n\\tfor b in B:\\n\\n\\t\\tprint((C[b]))\\n\\n\\n\\nmain()',\n", + " 'code_v0_loc': 39,\n", + " 'code_v1_loc': 39,\n", + " 'code_v0_num_chars': 460,\n", + " 'code_v1_num_chars': 468,\n", + " 'code_v0_no_empty_lines': '\"\"\"\\nchallenge case\\nin:\\n3\\n1 3\\n2 3\\nout:\\n1\\n1\\n1\\n\"\"\"\\nfrom collections import deque\\n\\n\\ndef main():\\n N, *AB = list(map(int, open(0).read().split()))\\n B = AB[1::2]\\n E = [[] for _ in range(N + 1)]\\n for a, b in zip(*[iter(AB)] * 2):\\n E[a] += (b,)\\n Q = deque([1])\\n C = [0] * (N + 1)\\n while Q:\\n v = Q.popleft()\\n c = 0\\n for u in E[v]:\\n c += 1 + (c + 1 == C[v])\\n C[u] = c\\n Q += (u,)\\n print((max(C)))\\n for b in B:\\n print((C[b]))\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': '\"\"\"\\nchallenge case\\nin:\\n3\\n1 3\\n2 3\\nout:\\n1\\n1\\n1\\n\"\"\"\\nfrom collections import deque\\n\\n\\ndef main():\\n N, *AB = list(map(int, open(0).read().split()))\\n B = AB[1::2]\\n E = [[] for _ in range(N + 1)]\\n for a, b in zip(*[iter(AB)] * 2):\\n E[a].append(b)\\n Q = deque([1])\\n C = [0] * (N + 1)\\n while Q:\\n v = Q.popleft()\\n c = 0\\n for u in E[v]:\\n c += 1 + (c + 1 == C[v])\\n C[u] = c\\n Q.append(u)\\n print((max(C)))\\n for b in B:\\n print((C[b]))\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- E[a] += (b,)',\n", + " '+ E[a].append(b)',\n", + " '- Q += (u,)',\n", + " '+ Q.append(u)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2432860727,\n", + " 'measured_runtime_v1': 0.1842362597,\n", + " 'runtime_lift': 1.3205113538,\n", + " 'key': ['s780367922', 's062691036']},\n", + " {'user_id': 'u546285759',\n", + " 'problem_id': 'p00053',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's431311473',\n", + " 'submission_id_v1': 's975765781',\n", + " 'cpu_time_v0': 360,\n", + " 'cpu_time_v1': 100,\n", + " 'memory_v0': 8104,\n", + " 'memory_v1': 9480,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 72.22,\n", + " 'input': 'def isPrime(x):\\n\\n if x == 2:\\n\\n return True\\n\\n if x < 2 or x % 2 == 0:\\n\\n return False\\n\\n i, root_x = 3, int(pow(x, 0.5))\\n\\n while i <= root_x:\\n\\n if x % i == 0:\\n\\n return False\\n\\n i += 2\\n\\n return True\\n\\n\\n\\nprimes = [2]\\n\\nfor i in range(3, 104730):\\n\\n if isPrime(i):\\n\\n primes.append(primes[-1]+i)\\n\\nwhile True:\\n\\n n = int(eval(input()))\\n\\n if n == 0:\\n\\n break\\n\\n print((primes[n-1]))',\n", + " 'target': 'primes = [0, 0] + [1] * 150000\\n\\nfor i in range(2, 388):\\n\\n if primes[i]:\\n\\n for j in range(i*i, 150001, i):\\n\\n primes[j] = 0\\n\\n\\n\\nvalues = [i for i, v in enumerate(primes) if v]\\n\\nwhile True:\\n\\n n = int(eval(input()))\\n\\n if n == 0:\\n\\n break\\n\\n print((sum(values[:n])))',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 438,\n", + " 'code_v1_num_chars': 287,\n", + " 'code_v0_no_empty_lines': 'def isPrime(x):\\n if x == 2:\\n return True\\n if x < 2 or x % 2 == 0:\\n return False\\n i, root_x = 3, int(pow(x, 0.5))\\n while i <= root_x:\\n if x % i == 0:\\n return False\\n i += 2\\n return True\\n\\n\\nprimes = [2]\\nfor i in range(3, 104730):\\n if isPrime(i):\\n primes.append(primes[-1] + i)\\nwhile True:\\n n = int(eval(input()))\\n if n == 0:\\n break\\n print((primes[n - 1]))\\n',\n", + " 'code_v1_no_empty_lines': 'primes = [0, 0] + [1] * 150000\\nfor i in range(2, 388):\\n if primes[i]:\\n for j in range(i * i, 150001, i):\\n primes[j] = 0\\nvalues = [i for i, v in enumerate(primes) if v]\\nwhile True:\\n n = int(eval(input()))\\n if n == 0:\\n break\\n print((sum(values[:n])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.8571428571,\n", + " 'diff': ['-def isPrime(x):',\n", + " '- if x == 2:',\n", + " '- return True',\n", + " '- if x < 2 or x % 2 == 0:',\n", + " '- return False',\n", + " '- i, root_x = 3, int(pow(x, 0.5))',\n", + " '- while i <= root_x:',\n", + " '- if x % i == 0:',\n", + " '- return False',\n", + " '- i += 2',\n", + " '- return True',\n", + " '-',\n", + " '-',\n", + " '-primes = [2]',\n", + " '-for i in range(3, 104730):',\n", + " '- if isPrime(i):',\n", + " '- primes.append(primes[-1] + i)',\n", + " '+primes = [0, 0] + [1] * 150000',\n", + " '+for i in range(2, 388):',\n", + " '+ if primes[i]:',\n", + " '+ for j in range(i * i, 150001, i):',\n", + " '+ primes[j] = 0',\n", + " '+values = [i for i, v in enumerate(primes) if v]',\n", + " '- print((primes[n - 1]))',\n", + " '+ print((sum(values[:n])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4180367088,\n", + " 'measured_runtime_v1': 0.5017841969,\n", + " 'runtime_lift': 2.8259891756,\n", + " 'key': ['s431311473', 's975765781']},\n", + " {'user_id': 'u657913472',\n", + " 'problem_id': 'p03544',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's581568984',\n", + " 'submission_id_v1': 's775677409',\n", + " 'cpu_time_v0': 17,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2568,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 41.18,\n", + " 'input': 'a,b=2,1\\n\\nfor i in[0]*int(eval(input())):a,b=b,a+b\\n\\nprint(a)',\n", + " 'target': 'a,b=2,1\\n\\nfor i in[0]*eval(input()):a,b=b,a+b\\n\\nprint(a)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 53,\n", + " 'code_v1_num_chars': 47,\n", + " 'code_v0_no_empty_lines': 'a, b = 2, 1\\nfor i in [0] * int(eval(input())):\\n a, b = b, a + b\\nprint(a)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = 2, 1\\nfor i in [0] * eval(input()):\\n a, b = b, a + b\\nprint(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in [0] * int(eval(input())):',\n", + " '+for i in [0] * eval(input()):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2172925947,\n", + " 'measured_runtime_v1': 0.0059480793,\n", + " 'runtime_lift': 36.5315560885,\n", + " 'key': ['s581568984', 's775677409']},\n", + " {'user_id': 'u754022296',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's893557911',\n", + " 'submission_id_v1': 's686331748',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 48,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 9008,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.13,\n", + " 'input': 'from math import factorial as fc\\n\\na = int(eval(input()))\\n\\nprint((fc(a)%(10**9+7)))',\n", + " 'target': 'n = int(eval(input()))\\n\\nm = 10**9+7\\n\\nans = 1\\n\\nfor i in range(1, n+1):\\n\\n ans *= i\\n\\n ans %= m\\n\\nprint(ans)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 74,\n", + " 'code_v1_num_chars': 99,\n", + " 'code_v0_no_empty_lines': 'from math import factorial as fc\\n\\na = int(eval(input()))\\nprint((fc(a) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nm = 10**9 + 7\\nans = 1\\nfor i in range(1, n + 1):\\n ans *= i\\n ans %= m\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 57.1428571429,\n", + " 'diff': ['-from math import factorial as fc',\n", + " '-',\n", + " '-a = int(eval(input()))',\n", + " '-print((fc(a) % (10**9 + 7)))',\n", + " '+n = int(eval(input()))',\n", + " '+m = 10**9 + 7',\n", + " '+ans = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= m',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4826196883,\n", + " 'measured_runtime_v1': 0.2178869207,\n", + " 'runtime_lift': 2.2150007294,\n", + " 'key': ['s893557911', 's686331748']},\n", + " {'user_id': 'u047796752',\n", + " 'problem_id': 'p02693',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's690438210',\n", + " 'submission_id_v1': 's726211396',\n", + " 'cpu_time_v0': 69,\n", + " 'cpu_time_v1': 61,\n", + " 'memory_v0': 64680,\n", + " 'memory_v1': 61880,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.59,\n", + " 'input': \"import sys\\n\\ninput = sys.stdin.readline\\n\\nfrom collections import *\\n\\n\\n\\nK = int(eval(input()))\\n\\nA, B = list(map(int, input().split()))\\n\\n\\n\\nfor i in range(A, B+1):\\n\\n if i%K==0:\\n\\n print('OK')\\n\\n exit()\\n\\n \\n\\nprint('NG')\",\n", + " 'target': \"K = int(eval(input()))\\n\\nA, B = list(map(int, input().split()))\\n\\n\\n\\nif (A-1)//K!=B//K:\\n\\n print('OK')\\n\\nelse:\\n\\n print('NG')\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 218,\n", + " 'code_v1_num_chars': 113,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nfrom collections import *\\n\\nK = int(eval(input()))\\nA, B = list(map(int, input().split()))\\nfor i in range(A, B + 1):\\n if i % K == 0:\\n print(\"OK\")\\n exit()\\nprint(\"NG\")\\n',\n", + " 'code_v1_no_empty_lines': 'K = int(eval(input()))\\nA, B = list(map(int, input().split()))\\nif (A - 1) // K != B // K:\\n print(\"OK\")\\nelse:\\n print(\"NG\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 46.1538461538,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-input = sys.stdin.readline',\n", + " '-from collections import *',\n", + " '-',\n", + " '-for i in range(A, B + 1):',\n", + " '- if i % K == 0:',\n", + " '- print(\"OK\")',\n", + " '- exit()',\n", + " '-print(\"NG\")',\n", + " '+if (A - 1) // K != B // K:',\n", + " '+ print(\"OK\")',\n", + " '+else:',\n", + " '+ print(\"NG\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2312573931,\n", + " 'measured_runtime_v1': 0.006134352,\n", + " 'runtime_lift': 37.6987486082,\n", + " 'key': ['s690438210', 's726211396']},\n", + " {'user_id': 'u744114948',\n", + " 'problem_id': 'p00053',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's391855332',\n", + " 'submission_id_v1': 's612183692',\n", + " 'cpu_time_v0': 660,\n", + " 'cpu_time_v1': 70,\n", + " 'memory_v0': 7228,\n", + " 'memory_v1': 8024,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.39,\n", + " 'input': 'import math\\n\\ndef pri(n):\\n\\n if n < 2:\\n\\n return False\\n\\n elif n == 2:\\n\\n return True\\n\\n elif n % 2 == 0:\\n\\n return False\\n\\n\\n\\n i = 3\\n\\n while i <= math.sqrt(n):\\n\\n if n % i == 0:\\n\\n return False\\n\\n i += 2\\n\\n return True\\n\\n\\n\\nl=[i for i in range(110000)if pri(i) ]\\n\\n\\n\\nwhile True:\\n\\n n = int(eval(input()))\\n\\n if n == 0: break\\n\\n print((sum(l[:n])))',\n", + " 'target': 'import math\\n\\ndef pri(n):\\n\\n l =[True] * n\\n\\n l[0] = l[1] = False\\n\\n for i in range(2,n):\\n\\n if l[i]:\\n\\n for j in range(i*2, n, i):\\n\\n l[j] = False\\n\\n return l\\n\\nn=105000\\n\\ns=pri(n)\\n\\nl=[i for i in range(n) if s[i]]\\n\\nwhile True:\\n\\n n = int(eval(input()))\\n\\n if n == 0: break\\n\\n print((sum(l[:n])))',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 394,\n", + " 'code_v1_num_chars': 329,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\n\\ndef pri(n):\\n if n < 2:\\n return False\\n elif n == 2:\\n return True\\n elif n % 2 == 0:\\n return False\\n i = 3\\n while i <= math.sqrt(n):\\n if n % i == 0:\\n return False\\n i += 2\\n return True\\n\\n\\nl = [i for i in range(110000) if pri(i)]\\nwhile True:\\n n = int(eval(input()))\\n if n == 0:\\n break\\n print((sum(l[:n])))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\n\\ndef pri(n):\\n l = [True] * n\\n l[0] = l[1] = False\\n for i in range(2, n):\\n if l[i]:\\n for j in range(i * 2, n, i):\\n l[j] = False\\n return l\\n\\n\\nn = 105000\\ns = pri(n)\\nl = [i for i in range(n) if s[i]]\\nwhile True:\\n n = int(eval(input()))\\n if n == 0:\\n break\\n print((sum(l[:n])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.2727272727,\n", + " 'diff': ['- if n < 2:',\n", + " '- return False',\n", + " '- elif n == 2:',\n", + " '- return True',\n", + " '- elif n % 2 == 0:',\n", + " '- return False',\n", + " '- i = 3',\n", + " '- while i <= math.sqrt(n):',\n", + " '- if n % i == 0:',\n", + " '- return False',\n", + " '- i += 2',\n", + " '- return True',\n", + " '+ l = [True] * n',\n", + " '+ l[0] = l[1] = False',\n", + " '+ for i in range(2, n):',\n", + " '+ if l[i]:',\n", + " '+ for j in range(i * 2, n, i):',\n", + " '+ l[j] = False',\n", + " '+ return l',\n", + " '-l = [i for i in range(110000) if pri(i)]',\n", + " '+n = 105000',\n", + " '+s = pri(n)',\n", + " '+l = [i for i in range(n) if s[i]]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.8203961465,\n", + " 'measured_runtime_v1': 0.4705428715,\n", + " 'runtime_lift': 5.9939196138,\n", + " 'key': ['s391855332', 's612183692']},\n", + " {'user_id': 'u287132915',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's161079550',\n", + " 'submission_id_v1': 's476355973',\n", + " 'cpu_time_v0': 369,\n", + " 'cpu_time_v1': 198,\n", + " 'memory_v0': 46468,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 46.34,\n", + " 'input': 'n = int(eval(input()))\\n\\n\\n\\ncnt = 0\\n\\nfor i in range(1, n+1):\\n\\n i_str = str(i)\\n\\n if len(i_str) == 1:\\n\\n cnt += 1\\n\\n continue\\n\\n if len(i_str) == 2:\\n\\n if int(i_str[0]) == int(i_str[1]):\\n\\n cnt += 3\\n\\n elif int(i_str[1]) != 0 and int(i_str[0]) > int(i_str[1]):\\n\\n cnt += 2\\n\\n continue\\n\\n if len(i_str) == 3:\\n\\n if int(i_str[0]) == int(i_str[2]):\\n\\n cnt += 4 + (2 * (int(i_str[1])+1) - 1)\\n\\n elif int(i_str[2]) != 0 and int(i_str[0]) > int(i_str[2]):\\n\\n cnt += 22\\n\\n elif int(i_str[0]) < int(i_str[2]):\\n\\n cnt += 2\\n\\n continue\\n\\n if len(i_str) == 4:\\n\\n if int(i_str[0]) == int(i_str[3]):\\n\\n cnt += 24 + 20 * int(i_str[1]) + 2 * (int(i_str[2])+1) - 1\\n\\n elif int(i_str[3]) != 0 and int(i_str[0]) > int(i_str[3]):\\n\\n cnt += 222\\n\\n elif int(i_str[0]) < int(i_str[3]):\\n\\n cnt += 22\\n\\n continue\\n\\n if len(i_str) == 5:\\n\\n if int(i_str[0]) == int(i_str[4]):\\n\\n cnt += 224 + 200 * int(i_str[1]) + 20 * int(i_str[2]) + 2 * (int(i_str[3])+1) - 1\\n\\n elif int(i_str[4]) != 0 and int(i_str[0]) > int(i_str[4]):\\n\\n cnt += 2222\\n\\n elif int(i_str[0]) < int(i_str[4]):\\n\\n cnt += 222\\n\\n continue\\n\\n if len(i_str) == 6:\\n\\n if int(i_str[0]) == int(i_str[5]):\\n\\n cnt += 2224 + 2000 * int(i_str[1]) + 200 * int(i_str[2]) + 20 * int(i_str[3]) + 2 * (int(i_str[4])+1) - 1\\n\\n elif int(i_str[5]) != 0 and int(i_str[0]) > int(i_str[5]):\\n\\n cnt += 22222\\n\\n elif int(i_str[0]) < int(i_str[5]):\\n\\n cnt += 2222\\n\\n continue\\n\\n\\n\\nprint(cnt)',\n", + " 'target': 'n = int(eval(input()))\\n\\n\\n\\nc = [[0 for _ in range(10)] for __ in range(10)]\\n\\nfor i in range(1, n+1):\\n\\n str_i = str(i)\\n\\n head = int(str_i[0])\\n\\n tail = int(str_i[-1])\\n\\n c[head][tail] += 1\\n\\n\\n\\ncnt = 0\\n\\nfor i in range(10):\\n\\n for j in range(10):\\n\\n cnt += c[i][j] * c[j][i]\\n\\n\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 48,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 1676,\n", + " 'code_v1_num_chars': 295,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\ncnt = 0\\nfor i in range(1, n + 1):\\n i_str = str(i)\\n if len(i_str) == 1:\\n cnt += 1\\n continue\\n if len(i_str) == 2:\\n if int(i_str[0]) == int(i_str[1]):\\n cnt += 3\\n elif int(i_str[1]) != 0 and int(i_str[0]) > int(i_str[1]):\\n cnt += 2\\n continue\\n if len(i_str) == 3:\\n if int(i_str[0]) == int(i_str[2]):\\n cnt += 4 + (2 * (int(i_str[1]) + 1) - 1)\\n elif int(i_str[2]) != 0 and int(i_str[0]) > int(i_str[2]):\\n cnt += 22\\n elif int(i_str[0]) < int(i_str[2]):\\n cnt += 2\\n continue\\n if len(i_str) == 4:\\n if int(i_str[0]) == int(i_str[3]):\\n cnt += 24 + 20 * int(i_str[1]) + 2 * (int(i_str[2]) + 1) - 1\\n elif int(i_str[3]) != 0 and int(i_str[0]) > int(i_str[3]):\\n cnt += 222\\n elif int(i_str[0]) < int(i_str[3]):\\n cnt += 22\\n continue\\n if len(i_str) == 5:\\n if int(i_str[0]) == int(i_str[4]):\\n cnt += (\\n 224\\n + 200 * int(i_str[1])\\n + 20 * int(i_str[2])\\n + 2 * (int(i_str[3]) + 1)\\n - 1\\n )\\n elif int(i_str[4]) != 0 and int(i_str[0]) > int(i_str[4]):\\n cnt += 2222\\n elif int(i_str[0]) < int(i_str[4]):\\n cnt += 222\\n continue\\n if len(i_str) == 6:\\n if int(i_str[0]) == int(i_str[5]):\\n cnt += (\\n 2224\\n + 2000 * int(i_str[1])\\n + 200 * int(i_str[2])\\n + 20 * int(i_str[3])\\n + 2 * (int(i_str[4]) + 1)\\n - 1\\n )\\n elif int(i_str[5]) != 0 and int(i_str[0]) > int(i_str[5]):\\n cnt += 22222\\n elif int(i_str[0]) < int(i_str[5]):\\n cnt += 2222\\n continue\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nc = [[0 for _ in range(10)] for __ in range(10)]\\nfor i in range(1, n + 1):\\n str_i = str(i)\\n head = int(str_i[0])\\n tail = int(str_i[-1])\\n c[head][tail] += 1\\ncnt = 0\\nfor i in range(10):\\n for j in range(10):\\n cnt += c[i][j] * c[j][i]\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 68.75,\n", + " 'diff': ['+c = [[0 for _ in range(10)] for __ in range(10)]',\n", + " '+for i in range(1, n + 1):',\n", + " '+ str_i = str(i)',\n", + " '+ head = int(str_i[0])',\n", + " '+ tail = int(str_i[-1])',\n", + " '+ c[head][tail] += 1',\n", + " '-for i in range(1, n + 1):',\n", + " '- i_str = str(i)',\n", + " '- if len(i_str) == 1:',\n", + " '- cnt += 1',\n", + " '- continue',\n", + " '- if len(i_str) == 2:',\n", + " '- if int(i_str[0]) == int(i_str[1]):',\n", + " '- cnt += 3',\n", + " '- elif int(i_str[1]) != 0 and int(i_str[0]) > int(i_str[1]):',\n", + " '- cnt += 2',\n", + " '- continue',\n", + " '- if len(i_str) == 3:',\n", + " '- if int(i_str[0]) == int(i_str[2]):',\n", + " '- cnt += 4 + (2 * (int(i_str[1]) + 1) - 1)',\n", + " '- elif int(i_str[2]) != 0 and int(i_str[0]) > int(i_str[2]):',\n", + " '- cnt += 22',\n", + " '- elif int(i_str[0]) < int(i_str[2]):',\n", + " '- cnt += 2',\n", + " '- continue',\n", + " '- if len(i_str) == 4:',\n", + " '- if int(i_str[0]) == int(i_str[3]):',\n", + " '- cnt += 24 + 20 * int(i_str[1]) + 2 * (int(i_str[2]) + 1) - 1',\n", + " '- elif int(i_str[3]) != 0 and int(i_str[0]) > int(i_str[3]):',\n", + " '- cnt += 222',\n", + " '- elif int(i_str[0]) < int(i_str[3]):',\n", + " '- cnt += 22',\n", + " '- continue',\n", + " '- if len(i_str) == 5:',\n", + " '- if int(i_str[0]) == int(i_str[4]):',\n", + " '- cnt += (',\n", + " '- 224',\n", + " '- + 200 * int(i_str[1])',\n", + " '- + 20 * int(i_str[2])',\n", + " '- + 2 * (int(i_str[3]) + 1)',\n", + " '- - 1',\n", + " '- )',\n", + " '- elif int(i_str[4]) != 0 and int(i_str[0]) > int(i_str[4]):',\n", + " '- cnt += 2222',\n", + " '- elif int(i_str[0]) < int(i_str[4]):',\n", + " '- cnt += 222',\n", + " '- continue',\n", + " '- if len(i_str) == 6:',\n", + " '- if int(i_str[0]) == int(i_str[5]):',\n", + " '- cnt += (',\n", + " '- 2224',\n", + " '- + 2000 * int(i_str[1])',\n", + " '- + 200 * int(i_str[2])',\n", + " '- + 20 * int(i_str[3])',\n", + " '- + 2 * (int(i_str[4]) + 1)',\n", + " '- - 1',\n", + " '- )',\n", + " '- elif int(i_str[5]) != 0 and int(i_str[0]) > int(i_str[5]):',\n", + " '- cnt += 22222',\n", + " '- elif int(i_str[0]) < int(i_str[5]):',\n", + " '- cnt += 2222',\n", + " '- continue',\n", + " '+for i in range(10):',\n", + " '+ for j in range(10):',\n", + " '+ cnt += c[i][j] * c[j][i]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.528624272,\n", + " 'measured_runtime_v1': 0.3498814137,\n", + " 'runtime_lift': 1.5108669718,\n", + " 'key': ['s161079550', 's476355973']},\n", + " {'user_id': 'u150984829',\n", + " 'problem_id': 'p00447',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's670764208',\n", + " 'submission_id_v1': 's671843082',\n", + " 'cpu_time_v0': 80,\n", + " 'cpu_time_v1': 50,\n", + " 'memory_v0': 6096,\n", + " 'memory_v1': 6104,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.5,\n", + " 'input': \"import operator\\n\\nfor e in iter(input,'0'):\\n\\n target = [[*list(map(int,input().split()))]for _ in[0]*int(e)]\\n\\n bx, by = target[0]\\n\\n target = {(x - bx, y - by) for x, y in target}\\n\\n max_tx = max(list(map(operator.itemgetter(0), target)))\\n\\n b = {tuple(map(int,input().split()))for _ in[0]*int(eval(input()))}\\n\\n max_sx = max(list(map(operator.itemgetter(0), b)))\\n\\n lim_x = max_sx - max_tx\\n\\n for x,y in b:\\n\\n if x > lim_x:continue\\n\\n for u,v in target:\\n\\n if (x + u, y + v) not in b:break\\n\\n else:\\n\\n print((x - bx, y - by))\\n\\n break\\n\",\n", + " 'target': \"import operator\\n\\nfor e in iter(input,'0'):\\n\\n target = [[*list(map(int,input().split()))]for _ in[0]*int(e)]\\n\\n bx, by = min(target)\\n\\n target = {(x - bx, y - by) for x, y in target}\\n\\n max_tx = max(list(map(operator.itemgetter(0), target)))\\n\\n b = {tuple(map(int,input().split()))for _ in[0]*int(eval(input()))}\\n\\n max_sx = max(list(map(operator.itemgetter(0), b)))\\n\\n lim_x = max_sx - max_tx\\n\\n for x,y in b:\\n\\n if x > lim_x:continue\\n\\n for u,v in target:\\n\\n if (x + u, y + v) not in b:break\\n\\n else:\\n\\n print((x - bx, y - by))\\n\\n break\\n\",\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 575,\n", + " 'code_v1_num_chars': 577,\n", + " 'code_v0_no_empty_lines': 'import operator\\n\\nfor e in iter(input, \"0\"):\\n target = [[*list(map(int, input().split()))] for _ in [0] * int(e)]\\n bx, by = target[0]\\n target = {(x - bx, y - by) for x, y in target}\\n max_tx = max(list(map(operator.itemgetter(0), target)))\\n b = {tuple(map(int, input().split())) for _ in [0] * int(eval(input()))}\\n max_sx = max(list(map(operator.itemgetter(0), b)))\\n lim_x = max_sx - max_tx\\n for x, y in b:\\n if x > lim_x:\\n continue\\n for u, v in target:\\n if (x + u, y + v) not in b:\\n break\\n else:\\n print((x - bx, y - by))\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'import operator\\n\\nfor e in iter(input, \"0\"):\\n target = [[*list(map(int, input().split()))] for _ in [0] * int(e)]\\n bx, by = min(target)\\n target = {(x - bx, y - by) for x, y in target}\\n max_tx = max(list(map(operator.itemgetter(0), target)))\\n b = {tuple(map(int, input().split())) for _ in [0] * int(eval(input()))}\\n max_sx = max(list(map(operator.itemgetter(0), b)))\\n lim_x = max_sx - max_tx\\n for x, y in b:\\n if x > lim_x:\\n continue\\n for u, v in target:\\n if (x + u, y + v) not in b:\\n break\\n else:\\n print((x - bx, y - by))\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- bx, by = target[0]', '+ bx, by = min(target)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3549797328,\n", + " 'measured_runtime_v1': 0.2644668722,\n", + " 'runtime_lift': 1.3422464968,\n", + " 'key': ['s670764208', 's671843082']},\n", + " {'user_id': 'u670180528',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's289323588',\n", + " 'submission_id_v1': 's397757622',\n", + " 'cpu_time_v0': 97,\n", + " 'cpu_time_v1': 24,\n", + " 'memory_v0': 11252,\n", + " 'memory_v1': 3564,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.26,\n", + " 'input': 'from collections import Counter\\n\\ndef factorization(n) -> list:\\n\\n\\tif n==1:\\n\\n\\t\\treturn [1]\\n\\n\\tret = []\\n\\n\\ti = 2\\n\\n\\twhile i*i<=n:\\n\\n\\t\\twhile n%i==0:\\n\\n\\t\\t\\tn //= i\\n\\n\\t\\t\\tret.append(i)\\n\\n\\t\\ti += 1\\n\\n\\tif n!=1:\\n\\n\\t\\tret.append(n)\\n\\n\\treturn ret\\n\\n\\n\\nn,m = list(map(int,input().split()))\\n\\nmod = 10**9+7\\n\\nif m==1:\\n\\n\\tprint((1));exit()\\n\\n\\n\\nfactors = Counter(factorization(m))\\n\\nmx = n+max(factors.values())\\n\\n\\n\\nfac = [1]*(mx+1)\\n\\ninv = [1]*(mx+1)\\n\\nfor i in range(1,mx+1):\\n\\n\\tfac[i] = fac[i-1] * i % mod\\n\\ninv[-1] = pow(fac[-1], mod - 2, mod)\\n\\nfor i in range(mx-1, -1, -1):\\n\\n\\tinv[i] = inv[i+1] * (i+1) % mod\\n\\ndef cmb(n,r):\\n\\n\\tassert n >= r >= 0\\n\\n\\treturn fac[n] * inv[n-r] * inv[r] % mod\\n\\n\\t\\n\\nans=1\\n\\nfor v in list(factors.values()):\\n\\n\\tans*=cmb(n+v-1,v)\\n\\n\\tans%=mod\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'from collections import Counter\\n\\ndef factorization(n) -> list:\\n\\n\\tif n==1:return [1]\\n\\n\\tret = []\\n\\n\\ti = 2\\n\\n\\twhile i*i<=n:\\n\\n\\t\\twhile n%i==0:\\n\\n\\t\\t\\tn //= i\\n\\n\\t\\t\\tret.append(i)\\n\\n\\t\\ti += 1\\n\\n\\tif n!=1:ret.append(n)\\n\\n\\treturn ret\\n\\n\\t\\n\\nfrom operator import mul\\n\\nfrom functools import reduce\\n\\ndef cmb(n,r):\\n\\n\\tif n < r:return 0\\n\\n\\tr = min(n-r,r)\\n\\n\\tif r==0:return 1\\n\\n\\tu = reduce(mul, list(range(n, n-r, -1)))\\n\\n\\td = reduce(mul, list(range(1,r+1)))\\n\\n\\treturn u//d\\n\\n\\n\\ndef main():\\n\\n\\tn,m = list(map(int,input().split()))\\n\\n\\tmod = 10**9+7\\n\\n\\tif m==1:\\n\\n\\t\\tprint((1))\\n\\n\\t\\texit()\\n\\n\\tans=1\\n\\n\\tfor v in list(Counter(factorization(m)).values()):\\n\\n\\t\\tans*=cmb(n+v-1,v)\\n\\n\\t\\tans%=mod\\n\\n\\tprint(ans)\\n\\n\\t\\n\\nif __name__==\"__main__\":main()',\n", + " 'code_v0_loc': 40,\n", + " 'code_v1_loc': 36,\n", + " 'code_v0_num_chars': 723,\n", + " 'code_v1_num_chars': 658,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\n\\n\\ndef factorization(n) -> list:\\n if n == 1:\\n return [1]\\n ret = []\\n i = 2\\n while i * i <= n:\\n while n % i == 0:\\n n //= i\\n ret.append(i)\\n i += 1\\n if n != 1:\\n ret.append(n)\\n return ret\\n\\n\\nn, m = list(map(int, input().split()))\\nmod = 10**9 + 7\\nif m == 1:\\n print((1))\\n exit()\\nfactors = Counter(factorization(m))\\nmx = n + max(factors.values())\\nfac = [1] * (mx + 1)\\ninv = [1] * (mx + 1)\\nfor i in range(1, mx + 1):\\n fac[i] = fac[i - 1] * i % mod\\ninv[-1] = pow(fac[-1], mod - 2, mod)\\nfor i in range(mx - 1, -1, -1):\\n inv[i] = inv[i + 1] * (i + 1) % mod\\n\\n\\ndef cmb(n, r):\\n assert n >= r >= 0\\n return fac[n] * inv[n - r] * inv[r] % mod\\n\\n\\nans = 1\\nfor v in list(factors.values()):\\n ans *= cmb(n + v - 1, v)\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\n\\n\\ndef factorization(n) -> list:\\n if n == 1:\\n return [1]\\n ret = []\\n i = 2\\n while i * i <= n:\\n while n % i == 0:\\n n //= i\\n ret.append(i)\\n i += 1\\n if n != 1:\\n ret.append(n)\\n return ret\\n\\n\\nfrom operator import mul\\nfrom functools import reduce\\n\\n\\ndef cmb(n, r):\\n if n < r:\\n return 0\\n r = min(n - r, r)\\n if r == 0:\\n return 1\\n u = reduce(mul, list(range(n, n - r, -1)))\\n d = reduce(mul, list(range(1, r + 1)))\\n return u // d\\n\\n\\ndef main():\\n n, m = list(map(int, input().split()))\\n mod = 10**9 + 7\\n if m == 1:\\n print((1))\\n exit()\\n ans = 1\\n for v in list(Counter(factorization(m)).values()):\\n ans *= cmb(n + v - 1, v)\\n ans %= mod\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-n, m = list(map(int, input().split()))',\n", + " '-mod = 10**9 + 7',\n", + " '-if m == 1:',\n", + " '- print((1))',\n", + " '- exit()',\n", + " '-factors = Counter(factorization(m))',\n", + " '-mx = n + max(factors.values())',\n", + " '-fac = [1] * (mx + 1)',\n", + " '-inv = [1] * (mx + 1)',\n", + " '-for i in range(1, mx + 1):',\n", + " '- fac[i] = fac[i - 1] * i % mod',\n", + " '-inv[-1] = pow(fac[-1], mod - 2, mod)',\n", + " '-for i in range(mx - 1, -1, -1):',\n", + " '- inv[i] = inv[i + 1] * (i + 1) % mod',\n", + " '+from operator import mul',\n", + " '+from functools import reduce',\n", + " '- assert n >= r >= 0',\n", + " '- return fac[n] * inv[n - r] * inv[r] % mod',\n", + " '+ if n < r:',\n", + " '+ return 0',\n", + " '+ r = min(n - r, r)',\n", + " '+ if r == 0:',\n", + " '+ return 1',\n", + " '+ u = reduce(mul, list(range(n, n - r, -1)))',\n", + " '+ d = reduce(mul, list(range(1, r + 1)))',\n", + " '+ return u // d',\n", + " '-ans = 1',\n", + " '-for v in list(factors.values()):',\n", + " '- ans *= cmb(n + v - 1, v)',\n", + " '- ans %= mod',\n", + " '-print(ans)',\n", + " '+def main():',\n", + " '+ n, m = list(map(int, input().split()))',\n", + " '+ mod = 10**9 + 7',\n", + " '+ if m == 1:',\n", + " '+ print((1))',\n", + " '+ exit()',\n", + " '+ ans = 1',\n", + " '+ for v in list(Counter(factorization(m)).values()):',\n", + " '+ ans *= cmb(n + v - 1, v)',\n", + " '+ ans %= mod',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4340592513,\n", + " 'measured_runtime_v1': 0.2881658652,\n", + " 'runtime_lift': 1.5062826786,\n", + " 'key': ['s289323588', 's397757622']},\n", + " {'user_id': 'u428199834',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's731409863',\n", + " 'submission_id_v1': 's859547087',\n", + " 'cpu_time_v0': 78,\n", + " 'cpu_time_v1': 64,\n", + " 'memory_v0': 9088,\n", + " 'memory_v1': 9044,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.95,\n", + " 'input': \"X=int(eval(input()))\\n\\na=[]\\n\\nfor i in range(-100,200):\\n\\n for j in range(-100,200):\\n\\n if i**5-j**5==X:\\n\\n a.append(str(i))\\n\\n a.append(str(j))\\n\\n break\\n\\nprint((' '.join(a[0:2])))\\n\\n\\n\\n \",\n", + " 'target': \"X=int(eval(input()))\\n\\na=[]\\n\\nfor i in range(-100,200):\\n\\n for j in range(-100,200):\\n\\n if i**5-j**5==X:\\n\\n a.append(str(i))\\n\\n a.append(str(j))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break \\n\\nprint((' '.join(a[0:2])))\\n\\n\\n\\n \\n\",\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 192,\n", + " 'code_v1_num_chars': 227,\n", + " 'code_v0_no_empty_lines': 'X = int(eval(input()))\\na = []\\nfor i in range(-100, 200):\\n for j in range(-100, 200):\\n if i**5 - j**5 == X:\\n a.append(str(i))\\n a.append(str(j))\\n break\\nprint((\" \".join(a[0:2])))\\n',\n", + " 'code_v1_no_empty_lines': 'X = int(eval(input()))\\na = []\\nfor i in range(-100, 200):\\n for j in range(-100, 200):\\n if i**5 - j**5 == X:\\n a.append(str(i))\\n a.append(str(j))\\n break\\n else:\\n continue\\n break\\nprint((\" \".join(a[0:2])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['+ else:', '+ continue', '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2243127763,\n", + " 'measured_runtime_v1': 0.1643264433,\n", + " 'runtime_lift': 1.3650437011,\n", + " 'key': ['s731409863', 's859547087']},\n", + " {'user_id': 'u141786930',\n", + " 'problem_id': 'p02760',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's443014228',\n", + " 'submission_id_v1': 's169210240',\n", + " 'cpu_time_v0': 371,\n", + " 'cpu_time_v1': 319,\n", + " 'memory_v0': 21804,\n", + " 'memory_v1': 21720,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.02,\n", + " 'input': \"import numpy as np\\n\\n\\n\\nA = np.zeros((3,3),int)\\n\\nfor i in range(3):\\n\\n A[i,:] = np.array([int(x) for x in input().split()])\\n\\n \\n\\nN = int(eval(input()))\\n\\n\\n\\nfor _ in range(N):\\n\\n b = int(eval(input()))\\n\\n A[A==b] = 0\\n\\n\\n\\nans = 'No'\\n\\nif np.sum(A[0,:])==0 or np.sum(A[1,:])==0 or np.sum(A[2,:])==0 or np.sum(A[:,0])==0 or np.sum(A[:,1])==0 or np.sum(A[:,2])==0 or np.sum(A[0,0]+A[1,1]+A[2,2])==0 or np.sum(A[0,2]+A[1,1]+A[2,0])==0:\\n\\n ans = 'Yes'\\n\\n\\n\\nprint(ans)\\n\",\n", + " 'target': \"# B - Bingo\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\nA = np.zeros((3,3), dtype=np.int64)\\n\\n\\n\\nfor i in range(3):\\n\\n A[i] = [int(x) for x in input().split()]\\n\\n\\n\\nN = int(input())\\n\\n\\n\\nfor _ in range(N):\\n\\n b = int(input())\\n\\n A = np.where(A==b, 0, A)\\n\\n\\n\\nif sum(A[0])==0 or sum(A[1])==0 or sum(A[2])==0 or \\\\\\n\\n sum(A[:,0])==0 or sum(A[:,1])==0 or sum(A[:,2])==0 or \\\\\\n\\n A[0,0]+A[1,1]+A[2,2]==0 or \\\\\\n\\n A[2,0]+A[1,1]+A[0,2]==0:\\n\\n print('Yes')\\n\\nelse:\\n\\n print('No')\\n\",\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 451,\n", + " 'code_v1_num_chars': 457,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nA = np.zeros((3, 3), int)\\nfor i in range(3):\\n A[i, :] = np.array([int(x) for x in input().split()])\\nN = int(eval(input()))\\nfor _ in range(N):\\n b = int(eval(input()))\\n A[A == b] = 0\\nans = \"No\"\\nif (\\n np.sum(A[0, :]) == 0\\n or np.sum(A[1, :]) == 0\\n or np.sum(A[2, :]) == 0\\n or np.sum(A[:, 0]) == 0\\n or np.sum(A[:, 1]) == 0\\n or np.sum(A[:, 2]) == 0\\n or np.sum(A[0, 0] + A[1, 1] + A[2, 2]) == 0\\n or np.sum(A[0, 2] + A[1, 1] + A[2, 0]) == 0\\n):\\n ans = \"Yes\"\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# B - Bingo\\nimport numpy as np\\n\\nA = np.zeros((3, 3), dtype=np.int64)\\nfor i in range(3):\\n A[i] = [int(x) for x in input().split()]\\nN = int(input())\\nfor _ in range(N):\\n b = int(input())\\n A = np.where(A == b, 0, A)\\nif (\\n sum(A[0]) == 0\\n or sum(A[1]) == 0\\n or sum(A[2]) == 0\\n or sum(A[:, 0]) == 0\\n or sum(A[:, 1]) == 0\\n or sum(A[:, 2]) == 0\\n or A[0, 0] + A[1, 1] + A[2, 2] == 0\\n or A[2, 0] + A[1, 1] + A[0, 2] == 0\\n):\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.7272727273,\n", + " 'diff': ['+# B - Bingo',\n", + " '-A = np.zeros((3, 3), int)',\n", + " '+A = np.zeros((3, 3), dtype=np.int64)',\n", + " '- A[i, :] = np.array([int(x) for x in input().split()])',\n", + " '-N = int(eval(input()))',\n", + " '+ A[i] = [int(x) for x in input().split()]',\n", + " '+N = int(input())',\n", + " '- b = int(eval(input()))',\n", + " '- A[A == b] = 0',\n", + " '-ans = \"No\"',\n", + " '+ b = int(input())',\n", + " '+ A = np.where(A == b, 0, A)',\n", + " '- np.sum(A[0, :]) == 0',\n", + " '- or np.sum(A[1, :]) == 0',\n", + " '- or np.sum(A[2, :]) == 0',\n", + " '- or np.sum(A[:, 0]) == 0',\n", + " '- or np.sum(A[:, 1]) == 0',\n", + " '- or np.sum(A[:, 2]) == 0',\n", + " '- or np.sum(A[0, 0] + A[1, 1] + A[2, 2]) == 0',\n", + " '- or np.sum(A[0, 2] + A[1, 1] + A[2, 0]) == 0',\n", + " '+ sum(A[0]) == 0',\n", + " '+ or sum(A[1]) == 0',\n", + " '+ or sum(A[2]) == 0',\n", + " '+ or sum(A[:, 0]) == 0',\n", + " '+ or sum(A[:, 1]) == 0',\n", + " '+ or sum(A[:, 2]) == 0',\n", + " '+ or A[0, 0] + A[1, 1] + A[2, 2] == 0',\n", + " '+ or A[2, 0] + A[1, 1] + A[0, 2] == 0',\n", + " '- ans = \"Yes\"',\n", + " '-print(ans)',\n", + " '+ print(\"Yes\")',\n", + " '+else:',\n", + " '+ print(\"No\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.363245188,\n", + " 'measured_runtime_v1': 0.2093592176,\n", + " 'runtime_lift': 6.5115126206,\n", + " 'key': ['s443014228', 's169210240']},\n", + " {'user_id': 'u020390084',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's815945561',\n", + " 'submission_id_v1': 's404136326',\n", + " 'cpu_time_v0': 206,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 13852,\n", + " 'memory_v1': 3192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.81,\n", + " 'input': 'import sys\\n\\nfrom scipy.sparse import csr_matrix\\n\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\n\\n\\ndef solve(N: int, M: int, a: \"List[int]\", b: \"List[int]\"):\\n\\n answer = 0\\n\\n for i in range(M): ## iの辺を消す\\n\\n matrix = [[0]*(N) for _ in range(N)]\\n\\n for j in range(M):\\n\\n if j == i:\\n\\n continue\\n\\n aa = a[j]-1\\n\\n bb = b[j]-1\\n\\n matrix[aa][bb] = 1\\n\\n \\n\\n dist_matrix = floyd_warshall(csgraph=csr_matrix(matrix), directed=False)\\n\\n \\n\\n if dist_matrix[a[i]-1][b[i]-1] == float(\\'inf\\'):\\n\\n answer += 1\\n\\n \\n\\n print(answer)\\n\\n return\\n\\n\\n\\n\\n\\ndef main():\\n\\n def iterate_tokens():\\n\\n for line in sys.stdin:\\n\\n for word in line.split():\\n\\n yield word\\n\\n tokens = iterate_tokens()\\n\\n N = int(next(tokens)) # type: int\\n\\n M = int(next(tokens)) # type: int\\n\\n a = [int()] * (M) # type: \"List[int]\"\\n\\n b = [int()] * (M) # type: \"List[int]\"\\n\\n for i in range(M):\\n\\n a[i] = int(next(tokens))\\n\\n b[i] = int(next(tokens))\\n\\n solve(N, M, a, b)\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': \"#!/usr/bin/env python3\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int,input().split()))\\n\\ndef LI(): return list(map(int,input().split()))\\n\\n\\n\\nclass UnionFind():\\n\\n def __init__(self, n):\\n\\n self.n = n\\n\\n self.parents = [-1] * n\\n\\n \\n\\n def find(self, x): # 根を探す\\n\\n if self.parents[x] < 0:\\n\\n return x\\n\\n else:\\n\\n self.parents[x] = self.find(self.parents[x])\\n\\n return self.parents[x]\\n\\n \\n\\n def union(self, x, y):\\n\\n x = self.find(x)\\n\\n y = self.find(y)\\n\\n \\n\\n if x == y:\\n\\n return\\n\\n \\n\\n if self.parents[x] > self.parents[y]:\\n\\n x, y = y, x\\n\\n \\n\\n self.parents[x] += self.parents[y]\\n\\n self.parents[y] = x\\n\\n \\n\\n def size(self, x):\\n\\n return -self.parents[self.find(x)]\\n\\n \\n\\n def same(self, x, y):\\n\\n return self.find(x) == self.find(y)\\n\\n \\n\\n def members(self, x):\\n\\n root = self.find(x)\\n\\n return [i for i in range(self.n) if self.find(i) == root]\\n\\n \\n\\n def roots(self):\\n\\n return [i for i, x in enumerate(self.parents) if x < 0]\\n\\n\\n\\n def group_count(self):\\n\\n return len(self.roots())\\n\\n \\n\\n def all_group_members(self):\\n\\n return {r: self.members(r) for r in self.roots()}\\n\\n \\n\\n def __str__(self):\\n\\n return '\\\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\\n\\n\\n\\ndef main():\\n\\n N,M=MAP()\\n\\n \\n\\n edges = []\\n\\n for _ in range(M):\\n\\n a,b = MAP()\\n\\n edges.append((a-1,b-1))\\n\\n\\n\\n answer = 0\\n\\n for i in range(M): # i番目の辺を使わない\\n\\n uf = UnionFind(N)\\n\\n\\n\\n for j in range(M):\\n\\n if i == j:\\n\\n continue\\n\\n\\n\\n a,b = edges[j]\\n\\n uf.union(a,b)\\n\\n if uf.group_count() > 1:\\n\\n answer += 1\\n\\n print(answer)\\n\\n return\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 41,\n", + " 'code_v1_loc': 79,\n", + " 'code_v0_num_chars': 1146,\n", + " 'code_v1_num_chars': 1934,\n", + " 'code_v0_no_empty_lines': 'import sys\\nfrom scipy.sparse import csr_matrix\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\n\\ndef solve(N: int, M: int, a: \"List[int]\", b: \"List[int]\"):\\n answer = 0\\n for i in range(M): ## iの辺を消す\\n matrix = [[0] * (N) for _ in range(N)]\\n for j in range(M):\\n if j == i:\\n continue\\n aa = a[j] - 1\\n bb = b[j] - 1\\n matrix[aa][bb] = 1\\n dist_matrix = floyd_warshall(csgraph=csr_matrix(matrix), directed=False)\\n if dist_matrix[a[i] - 1][b[i] - 1] == float(\"inf\"):\\n answer += 1\\n print(answer)\\n return\\n\\n\\ndef main():\\n def iterate_tokens():\\n for line in sys.stdin:\\n for word in line.split():\\n yield word\\n\\n tokens = iterate_tokens()\\n N = int(next(tokens)) # type: int\\n M = int(next(tokens)) # type: int\\n a = [int()] * (M) # type: \"List[int]\"\\n b = [int()] * (M) # type: \"List[int]\"\\n for i in range(M):\\n a[i] = int(next(tokens))\\n b[i] = int(next(tokens))\\n solve(N, M, a, b)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\nclass UnionFind:\\n def __init__(self, n):\\n self.n = n\\n self.parents = [-1] * n\\n\\n def find(self, x): # 根を探す\\n if self.parents[x] < 0:\\n return x\\n else:\\n self.parents[x] = self.find(self.parents[x])\\n return self.parents[x]\\n\\n def union(self, x, y):\\n x = self.find(x)\\n y = self.find(y)\\n if x == y:\\n return\\n if self.parents[x] > self.parents[y]:\\n x, y = y, x\\n self.parents[x] += self.parents[y]\\n self.parents[y] = x\\n\\n def size(self, x):\\n return -self.parents[self.find(x)]\\n\\n def same(self, x, y):\\n return self.find(x) == self.find(y)\\n\\n def members(self, x):\\n root = self.find(x)\\n return [i for i in range(self.n) if self.find(i) == root]\\n\\n def roots(self):\\n return [i for i, x in enumerate(self.parents) if x < 0]\\n\\n def group_count(self):\\n return len(self.roots())\\n\\n def all_group_members(self):\\n return {r: self.members(r) for r in self.roots()}\\n\\n def __str__(self):\\n return \"\\\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())\\n\\n\\ndef main():\\n N, M = MAP()\\n edges = []\\n for _ in range(M):\\n a, b = MAP()\\n edges.append((a - 1, b - 1))\\n answer = 0\\n for i in range(M): # i番目の辺を使わない\\n uf = UnionFind(N)\\n for j in range(M):\\n if i == j:\\n continue\\n a, b = edges[j]\\n uf.union(a, b)\\n if uf.group_count() > 1:\\n answer += 1\\n print(answer)\\n return\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 48.1012658228,\n", + " 'diff': ['+#!/usr/bin/env python3',\n", + " '-from scipy.sparse import csr_matrix',\n", + " '-from scipy.sparse.csgraph import floyd_warshall',\n", + " '+',\n", + " '+input = sys.stdin.readline',\n", + " '-def solve(N: int, M: int, a: \"List[int]\", b: \"List[int]\"):',\n", + " '+def INT():',\n", + " '+ return int(eval(input()))',\n", + " '+',\n", + " '+',\n", + " '+def MAP():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+def LI():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+class UnionFind:',\n", + " '+ def __init__(self, n):',\n", + " '+ self.n = n',\n", + " '+ self.parents = [-1] * n',\n", + " '+',\n", + " '+ def find(self, x): # 根を探す',\n", + " '+ if self.parents[x] < 0:',\n", + " '+ return x',\n", + " '+ else:',\n", + " '+ self.parents[x] = self.find(self.parents[x])',\n", + " '+ return self.parents[x]',\n", + " '+',\n", + " '+ def union(self, x, y):',\n", + " '+ x = self.find(x)',\n", + " '+ y = self.find(y)',\n", + " '+ if x == y:',\n", + " '+ return',\n", + " '+ if self.parents[x] > self.parents[y]:',\n", + " '+ x, y = y, x',\n", + " '+ self.parents[x] += self.parents[y]',\n", + " '+ self.parents[y] = x',\n", + " '+',\n", + " '+ def size(self, x):',\n", + " '+ return -self.parents[self.find(x)]',\n", + " '+',\n", + " '+ def same(self, x, y):',\n", + " '+ return self.find(x) == self.find(y)',\n", + " '+',\n", + " '+ def members(self, x):',\n", + " '+ root = self.find(x)',\n", + " '+ return [i for i in range(self.n) if self.find(i) == root]',\n", + " '+',\n", + " '+ def roots(self):',\n", + " '+ return [i for i, x in enumerate(self.parents) if x < 0]',\n", + " '+',\n", + " '+ def group_count(self):',\n", + " '+ return len(self.roots())',\n", + " '+',\n", + " '+ def all_group_members(self):',\n", + " '+ return {r: self.members(r) for r in self.roots()}',\n", + " '+',\n", + " '+ def __str__(self):',\n", + " '+ return \"\\\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ N, M = MAP()',\n", + " '+ edges = []',\n", + " '+ for _ in range(M):',\n", + " '+ a, b = MAP()',\n", + " '+ edges.append((a - 1, b - 1))',\n", + " '- for i in range(M): ## iの辺を消す',\n", + " '- matrix = [[0] * (N) for _ in range(N)]',\n", + " '+ for i in range(M): # i番目の辺を使わない',\n", + " '+ uf = UnionFind(N)',\n", + " '- if j == i:',\n", + " '+ if i == j:',\n", + " '- aa = a[j] - 1',\n", + " '- bb = b[j] - 1',\n", + " '- matrix[aa][bb] = 1',\n", + " '- dist_matrix = floyd_warshall(csgraph=csr_matrix(matrix), directed=False)',\n", + " '- if dist_matrix[a[i] - 1][b[i] - 1] == float(\"inf\"):',\n", + " '+ a, b = edges[j]',\n", + " '+ uf.union(a, b)',\n", + " '+ if uf.group_count() > 1:',\n", + " '-def main():',\n", + " '- def iterate_tokens():',\n", + " '- for line in sys.stdin:',\n", + " '- for word in line.split():',\n", + " '- yield word',\n", + " '-',\n", + " '- tokens = iterate_tokens()',\n", + " '- N = int(next(tokens)) # type: int',\n", + " '- M = int(next(tokens)) # type: int',\n", + " '- a = [int()] * (M) # type: \"List[int]\"',\n", + " '- b = [int()] * (M) # type: \"List[int]\"',\n", + " '- for i in range(M):',\n", + " '- a[i] = int(next(tokens))',\n", + " '- b[i] = int(next(tokens))',\n", + " '- solve(N, M, a, b)',\n", + " '-',\n", + " '-'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0324458141,\n", + " 'measured_runtime_v1': 0.2175420785,\n", + " 'runtime_lift': 9.3427709623,\n", + " 'key': ['s815945561', 's404136326']},\n", + " {'user_id': 'u645250356',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's890208193',\n", + " 'submission_id_v1': 's797826633',\n", + " 'cpu_time_v0': 490,\n", + " 'cpu_time_v1': 431,\n", + " 'memory_v0': 71452,\n", + " 'memory_v1': 34916,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.04,\n", + " 'input': 'from collections import Counter,defaultdict,deque\\n\\nfrom heapq import heapify,heappop,heappush\\n\\nfrom bisect import bisect_left,bisect_right\\n\\nimport sys,math,itertools,string,queue\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef inpl_str(): return list(sys.stdin.readline().split())\\n\\ndef inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\n\\nn,m = inpl()\\n\\na = inpl()\\n\\nb = [0] * m\\n\\nfor i in range(m):\\n\\n x,y = inpl()\\n\\n b[i] = [x,y]\\n\\na.sort()\\n\\nb.sort(key=lambda x:x[1], reverse = True)\\n\\nres = sum(a)\\n\\ni = 0\\n\\nj = 0\\n\\nwhile True:\\n\\n # print(i,j)\\n\\n if a[i] < b[j][1]:\\n\\n res += b[j][1] - a[i]\\n\\n i += 1\\n\\n else:\\n\\n break\\n\\n b[j][0] -= 1\\n\\n if b[j][0] == 0:\\n\\n j += 1\\n\\n if i >= n or j >= m:\\n\\n break\\n\\nprint(res)\\n',\n", + " 'target': \"from collections import Counter,defaultdict,deque\\n\\nfrom heapq import heappop,heappush,heapify\\n\\nfrom bisect import bisect_left,bisect_right \\n\\nimport sys,math,itertools,fractions,pprint\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\nINF = float('inf')\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\nn,m = inpl()\\n\\na = inpl()\\n\\na.sort()\\n\\nbc = [inpl() for _ in range(m)]\\n\\nbc.sort(key = lambda x:x[1], reverse = True)\\n\\nlm = sum(x[1] for x in bc)\\n\\nnow = 0\\n\\nalt = 0\\n\\nwhile now < n and alt < m:\\n\\n c,b = bc[alt]\\n\\n if a[now] > b:\\n\\n break\\n\\n else:\\n\\n a[now] = b\\n\\n bc[alt][0] -= 1\\n\\n if bc[alt][0] == 0:\\n\\n alt += 1\\n\\n now += 1\\n\\nprint((sum(a)))\\n\",\n", + " 'code_v0_loc': 35,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 880,\n", + " 'code_v1_num_chars': 728,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nfrom heapq import heapify, heappop, heappush\\nfrom bisect import bisect_left, bisect_right\\nimport sys, math, itertools, string, queue\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef inpl_str():\\n return list(sys.stdin.readline().split())\\n\\n\\ndef inpln(n):\\n return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\nn, m = inpl()\\na = inpl()\\nb = [0] * m\\nfor i in range(m):\\n x, y = inpl()\\n b[i] = [x, y]\\na.sort()\\nb.sort(key=lambda x: x[1], reverse=True)\\nres = sum(a)\\ni = 0\\nj = 0\\nwhile True:\\n # print(i,j)\\n if a[i] < b[j][1]:\\n res += b[j][1] - a[i]\\n i += 1\\n else:\\n break\\n b[j][0] -= 1\\n if b[j][0] == 0:\\n j += 1\\n if i >= n or j >= m:\\n break\\nprint(res)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nfrom heapq import heappop, heappush, heapify\\nfrom bisect import bisect_left, bisect_right\\nimport sys, math, itertools, fractions, pprint\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\nINF = float(\"inf\")\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\nn, m = inpl()\\na = inpl()\\na.sort()\\nbc = [inpl() for _ in range(m)]\\nbc.sort(key=lambda x: x[1], reverse=True)\\nlm = sum(x[1] for x in bc)\\nnow = 0\\nalt = 0\\nwhile now < n and alt < m:\\n c, b = bc[alt]\\n if a[now] > b:\\n break\\n else:\\n a[now] = b\\n bc[alt][0] -= 1\\n if bc[alt][0] == 0:\\n alt += 1\\n now += 1\\nprint((sum(a)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.1428571429,\n", + " 'diff': ['-from heapq import heapify, heappop, heappush',\n", + " '+from heapq import heappop, heappush, heapify',\n", + " '-import sys, math, itertools, string, queue',\n", + " '+import sys, math, itertools, fractions, pprint',\n", + " '+INF = float(\"inf\")',\n", + " '-def inpl_str():',\n", + " '- return list(sys.stdin.readline().split())',\n", + " '-',\n", + " '-',\n", + " '-def inpln(n):',\n", + " '- return list(int(sys.stdin.readline()) for i in range(n))',\n", + " '-',\n", + " '-',\n", + " '-b = [0] * m',\n", + " '-for i in range(m):',\n", + " '- x, y = inpl()',\n", + " '- b[i] = [x, y]',\n", + " '-b.sort(key=lambda x: x[1], reverse=True)',\n", + " '-res = sum(a)',\n", + " '-i = 0',\n", + " '-j = 0',\n", + " '-while True:',\n", + " '- # print(i,j)',\n", + " '- if a[i] < b[j][1]:',\n", + " '- res += b[j][1] - a[i]',\n", + " '- i += 1',\n", + " '+bc = [inpl() for _ in range(m)]',\n", + " '+bc.sort(key=lambda x: x[1], reverse=True)',\n", + " '+lm = sum(x[1] for x in bc)',\n", + " '+now = 0',\n", + " '+alt = 0',\n", + " '+while now < n and alt < m:',\n", + " '+ c, b = bc[alt]',\n", + " '+ if a[now] > b:',\n", + " '+ break',\n", + " '- break',\n", + " '- b[j][0] -= 1',\n", + " '- if b[j][0] == 0:',\n", + " '- j += 1',\n", + " '- if i >= n or j >= m:',\n", + " '- break',\n", + " '-print(res)',\n", + " '+ a[now] = b',\n", + " '+ bc[alt][0] -= 1',\n", + " '+ if bc[alt][0] == 0:',\n", + " '+ alt += 1',\n", + " '+ now += 1',\n", + " '+print((sum(a)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.310756367,\n", + " 'measured_runtime_v1': 0.2053928638,\n", + " 'runtime_lift': 1.5129852191,\n", + " 'key': ['s890208193', 's797826633']},\n", + " {'user_id': 'u123942276',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's417323905',\n", + " 'submission_id_v1': 's556297736',\n", + " 'cpu_time_v0': 112,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 26812,\n", + " 'memory_v1': 9020,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.11,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nA = np.array(list(map(int, input().split())))\\n\\ncount = 0\\n\\nwhile True:\\n\\n if np.sum(A%2) > 0:\\n\\n break\\n\\n count +=1\\n\\n A = A//2\\n\\nprint(count)\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\n\\n\\nans = float(\"inf\")\\n\\n\\n\\nfor i in a:\\n\\n ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1) # (1)…2で割った回数が最小のものを探索\\n\\nprint(ans)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 191,\n", + " 'code_v1_num_chars': 182,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = np.array(list(map(int, input().split())))\\ncount = 0\\nwhile True:\\n if np.sum(A % 2) > 0:\\n break\\n count += 1\\n A = A // 2\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in a:\\n ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1) # (1)…2で割った回数が最小のものを探索\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '-A = np.array(list(map(int, input().split())))',\n", + " '-count = 0',\n", + " '-while True:',\n", + " '- if np.sum(A % 2) > 0:',\n", + " '- break',\n", + " '- count += 1',\n", + " '- A = A // 2',\n", + " '-print(count)',\n", + " '+n = int(eval(input()))',\n", + " '+a = list(map(int, input().split()))',\n", + " '+ans = float(\"inf\")',\n", + " '+for i in a:',\n", + " '+ ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1) # (1)…2で割った回数が最小のものを探索',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3099729173,\n", + " 'measured_runtime_v1': 0.2131767328,\n", + " 'runtime_lift': 6.1450088862,\n", + " 'key': ['s417323905', 's556297736']},\n", + " {'user_id': 'u805332733',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's317659277',\n", + " 'submission_id_v1': 's521440898',\n", + " 'cpu_time_v0': 89,\n", + " 'cpu_time_v1': 65,\n", + " 'memory_v0': 64652,\n", + " 'memory_v1': 63416,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.97,\n", + " 'input': 'def resolve():\\n\\n base = 10**9+7\\n\\n S = int(eval(input()))\\n\\n dp = [0] * (S+1)\\n\\n dp[0] = 1\\n\\n\\n\\n for i in range(1, S+1):\\n\\n for u in range(i-2):\\n\\n dp[i] += dp[u]\\n\\n dp[i] %= base\\n\\n # print(dp)\\n\\n print((dp[S]%base))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n resolve()\\n',\n", + " 'target': 'def resolve():\\n\\n base = 10**9+7\\n\\n S = int(eval(input()))\\n\\n dp = [0] * (S+1)\\n\\n dp[0] = 1\\n\\n\\n\\n for i in range(3, S+1):\\n\\n dp[i] = dp[i-1] + dp[i-3]\\n\\n # print(dp)\\n\\n print((dp[S]%base))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n resolve()',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 263,\n", + " 'code_v1_num_chars': 224,\n", + " 'code_v0_no_empty_lines': 'def resolve():\\n base = 10**9 + 7\\n S = int(eval(input()))\\n dp = [0] * (S + 1)\\n dp[0] = 1\\n for i in range(1, S + 1):\\n for u in range(i - 2):\\n dp[i] += dp[u]\\n dp[i] %= base\\n # print(dp)\\n print((dp[S] % base))\\n\\n\\nif __name__ == \"__main__\":\\n resolve()\\n',\n", + " 'code_v1_no_empty_lines': 'def resolve():\\n base = 10**9 + 7\\n S = int(eval(input()))\\n dp = [0] * (S + 1)\\n dp[0] = 1\\n for i in range(3, S + 1):\\n dp[i] = dp[i - 1] + dp[i - 3]\\n # print(dp)\\n print((dp[S] % base))\\n\\n\\nif __name__ == \"__main__\":\\n resolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.3333333333,\n", + " 'diff': ['- for i in range(1, S + 1):',\n", + " '- for u in range(i - 2):',\n", + " '- dp[i] += dp[u]',\n", + " '- dp[i] %= base',\n", + " '+ for i in range(3, S + 1):',\n", + " '+ dp[i] = dp[i - 1] + dp[i - 3]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5217176821,\n", + " 'measured_runtime_v1': 0.2045270953,\n", + " 'runtime_lift': 2.5508487337,\n", + " 'key': ['s317659277', 's521440898']},\n", + " {'user_id': 'u893063840',\n", + " 'problem_id': 'p03039',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's835548762',\n", + " 'submission_id_v1': 's860519661',\n", + " 'cpu_time_v0': 1667,\n", + " 'cpu_time_v1': 328,\n", + " 'memory_v0': 85236,\n", + " 'memory_v1': 18804,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.32,\n", + " 'input': 'n, m, k = list(map(int, input().split()))\\n\\nmod = 10 ** 9 + 7\\n\\nMAX = n * m\\n\\n\\n\\n\\n\\nclass ModInt:\\n\\n def __init__(self, num):\\n\\n self.num = num\\n\\n\\n\\n def __str__(self):\\n\\n return str(self.num)\\n\\n\\n\\n def __repr__(self):\\n\\n return \"ModInt(num: {}, mod: {}\".format(self.num, mod)\\n\\n\\n\\n def __add__(self, other):\\n\\n ret = self.num + other.num\\n\\n ret %= mod\\n\\n return ModInt(ret)\\n\\n\\n\\n def __sub__(self, other):\\n\\n ret = self.num - other.num\\n\\n ret %= mod\\n\\n return ModInt(ret)\\n\\n\\n\\n def __mul__(self, other):\\n\\n ret = self.num * other.num\\n\\n ret %= mod\\n\\n return ModInt(ret)\\n\\n\\n\\n def pow(self, times):\\n\\n pw = pow(self.num, times, mod)\\n\\n return ModInt(pw)\\n\\n\\n\\n def inverse(self):\\n\\n return ModInt(inv[self.num])\\n\\n\\n\\n def __truediv__(self, other):\\n\\n num = self * other.inverse()\\n\\n return ModInt(num)\\n\\n\\n\\n\\n\\ndef comb(n, k):\\n\\n return fact[n] * inv[n-k] * inv[k]\\n\\n\\n\\n\\n\\nfact = [None] * (MAX + 1)\\n\\nfact[0] = ModInt(1)\\n\\nfor i in range(1, MAX + 1):\\n\\n fact[i] = fact[i-1] * ModInt(i)\\n\\n\\n\\ninv = [None] * (MAX + 1)\\n\\ninv[MAX] = fact[MAX].pow(mod - 2)\\n\\nfor i in range(MAX, 0, -1):\\n\\n inv[i-1] = inv[i] * ModInt(i)\\n\\n\\n\\nans = ModInt(0)\\n\\nfor i in range(n):\\n\\n for j in range(m):\\n\\n add = ModInt(n - i) * ModInt(m - j) * ModInt(i + j)\\n\\n if i != 0 and j != 0:\\n\\n add *= ModInt(2)\\n\\n\\n\\n ans += add\\n\\n\\n\\nans *= comb(n * m - 2, k - 2)\\n\\nprint(ans)\\n',\n", + " 'target': 'n, m, k = list(map(int, input().split()))\\n\\n\\n\\nmod = 10 ** 9 + 7\\n\\nMAX = n * m\\n\\n\\n\\nfact = [1] * (MAX + 1)\\n\\nfor i in range(1, MAX + 1):\\n\\n fact[i] = (fact[i-1] * i) % mod\\n\\n\\n\\ninv = [1] * (MAX + 1)\\n\\ninv[MAX] = pow(fact[MAX], mod - 2, mod)\\n\\nfor i in range(MAX, 0, -1):\\n\\n inv[i-1] = (inv[i] * i) % mod\\n\\n\\n\\n\\n\\ndef comb(n, k):\\n\\n return fact[n] * inv[n-k] * inv[k] % mod\\n\\n\\n\\n\\n\\nans = 0\\n\\nfor i in range(n):\\n\\n for j in range(m):\\n\\n add = (n - i) * (m - j) * (i + j) % mod\\n\\n if i != 0 and j != 0:\\n\\n add *= 2\\n\\n add %= mod\\n\\n\\n\\n ans += add\\n\\n ans %= mod\\n\\n\\n\\nans *= comb(MAX - 2, k - 2)\\n\\nans %= mod\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 67,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 1460,\n", + " 'code_v1_num_chars': 639,\n", + " 'code_v0_no_empty_lines': 'n, m, k = list(map(int, input().split()))\\nmod = 10**9 + 7\\nMAX = n * m\\n\\n\\nclass ModInt:\\n def __init__(self, num):\\n self.num = num\\n\\n def __str__(self):\\n return str(self.num)\\n\\n def __repr__(self):\\n return \"ModInt(num: {}, mod: {}\".format(self.num, mod)\\n\\n def __add__(self, other):\\n ret = self.num + other.num\\n ret %= mod\\n return ModInt(ret)\\n\\n def __sub__(self, other):\\n ret = self.num - other.num\\n ret %= mod\\n return ModInt(ret)\\n\\n def __mul__(self, other):\\n ret = self.num * other.num\\n ret %= mod\\n return ModInt(ret)\\n\\n def pow(self, times):\\n pw = pow(self.num, times, mod)\\n return ModInt(pw)\\n\\n def inverse(self):\\n return ModInt(inv[self.num])\\n\\n def __truediv__(self, other):\\n num = self * other.inverse()\\n return ModInt(num)\\n\\n\\ndef comb(n, k):\\n return fact[n] * inv[n - k] * inv[k]\\n\\n\\nfact = [None] * (MAX + 1)\\nfact[0] = ModInt(1)\\nfor i in range(1, MAX + 1):\\n fact[i] = fact[i - 1] * ModInt(i)\\ninv = [None] * (MAX + 1)\\ninv[MAX] = fact[MAX].pow(mod - 2)\\nfor i in range(MAX, 0, -1):\\n inv[i - 1] = inv[i] * ModInt(i)\\nans = ModInt(0)\\nfor i in range(n):\\n for j in range(m):\\n add = ModInt(n - i) * ModInt(m - j) * ModInt(i + j)\\n if i != 0 and j != 0:\\n add *= ModInt(2)\\n ans += add\\nans *= comb(n * m - 2, k - 2)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m, k = list(map(int, input().split()))\\nmod = 10**9 + 7\\nMAX = n * m\\nfact = [1] * (MAX + 1)\\nfor i in range(1, MAX + 1):\\n fact[i] = (fact[i - 1] * i) % mod\\ninv = [1] * (MAX + 1)\\ninv[MAX] = pow(fact[MAX], mod - 2, mod)\\nfor i in range(MAX, 0, -1):\\n inv[i - 1] = (inv[i] * i) % mod\\n\\n\\ndef comb(n, k):\\n return fact[n] * inv[n - k] * inv[k] % mod\\n\\n\\nans = 0\\nfor i in range(n):\\n for j in range(m):\\n add = (n - i) * (m - j) * (i + j) % mod\\n if i != 0 and j != 0:\\n add *= 2\\n add %= mod\\n ans += add\\n ans %= mod\\nans *= comb(MAX - 2, k - 2)\\nans %= mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.7462686567,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-class ModInt:',\n", + " '- def __init__(self, num):',\n", + " '- self.num = num',\n", + " '-',\n", + " '- def __str__(self):',\n", + " '- return str(self.num)',\n", + " '-',\n", + " '- def __repr__(self):',\n", + " '- return \"ModInt(num: {}, mod: {}\".format(self.num, mod)',\n", + " '-',\n", + " '- def __add__(self, other):',\n", + " '- ret = self.num + other.num',\n", + " '- ret %= mod',\n", + " '- return ModInt(ret)',\n", + " '-',\n", + " '- def __sub__(self, other):',\n", + " '- ret = self.num - other.num',\n", + " '- ret %= mod',\n", + " '- return ModInt(ret)',\n", + " '-',\n", + " '- def __mul__(self, other):',\n", + " '- ret = self.num * other.num',\n", + " '- ret %= mod',\n", + " '- return ModInt(ret)',\n", + " '-',\n", + " '- def pow(self, times):',\n", + " '- pw = pow(self.num, times, mod)',\n", + " '- return ModInt(pw)',\n", + " '-',\n", + " '- def inverse(self):',\n", + " '- return ModInt(inv[self.num])',\n", + " '-',\n", + " '- def __truediv__(self, other):',\n", + " '- num = self * other.inverse()',\n", + " '- return ModInt(num)',\n", + " '+fact = [1] * (MAX + 1)',\n", + " '+for i in range(1, MAX + 1):',\n", + " '+ fact[i] = (fact[i - 1] * i) % mod',\n", + " '+inv = [1] * (MAX + 1)',\n", + " '+inv[MAX] = pow(fact[MAX], mod - 2, mod)',\n", + " '+for i in range(MAX, 0, -1):',\n", + " '+ inv[i - 1] = (inv[i] * i) % mod',\n", + " '- return fact[n] * inv[n - k] * inv[k]',\n", + " '+ return fact[n] * inv[n - k] * inv[k] % mod',\n", + " '-fact = [None] * (MAX + 1)',\n", + " '-fact[0] = ModInt(1)',\n", + " '-for i in range(1, MAX + 1):',\n", + " '- fact[i] = fact[i - 1] * ModInt(i)',\n", + " '-inv = [None] * (MAX + 1)',\n", + " '-inv[MAX] = fact[MAX].pow(mod - 2)',\n", + " '-for i in range(MAX, 0, -1):',\n", + " '- inv[i - 1] = inv[i] * ModInt(i)',\n", + " '-ans = ModInt(0)',\n", + " '+ans = 0',\n", + " '- add = ModInt(n - i) * ModInt(m - j) * ModInt(i + j)',\n", + " '+ add = (n - i) * (m - j) * (i + j) % mod',\n", + " '- add *= ModInt(2)',\n", + " '+ add *= 2',\n", + " '+ add %= mod',\n", + " '-ans *= comb(n * m - 2, k - 2)',\n", + " '+ ans %= mod',\n", + " '+ans *= comb(MAX - 2, k - 2)',\n", + " '+ans %= mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.0146762717,\n", + " 'measured_runtime_v1': 0.4959636457,\n", + " 'runtime_lift': 2.0458682415,\n", + " 'key': ['s835548762', 's860519661']},\n", + " {'user_id': 'u606045429',\n", + " 'problem_id': 'p03649',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's241047741',\n", + " 'submission_id_v1': 's915089659',\n", + " 'cpu_time_v0': 182,\n", + " 'cpu_time_v1': 44,\n", + " 'memory_v0': 12504,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.82,\n", + " 'input': 'from numpy import*\\n\\nN,*A=open(0)\\n\\nN,A,S,a=int(N),loadtxt(A,int),1,0\\n\\nwhile S:B=A//N;S=sum(B);a+=S;A+=S-B*-~N\\n\\nprint(a)',\n", + " 'target': 'N, *A = list(map(int, open(0).read().split()))\\n\\n\\n\\nans = 0\\n\\nS = -1\\n\\nwhile S:\\n\\n S = sum(a // N for a in A)\\n\\n ans += S\\n\\n A = [a % N + (S - a // N) for a in A]\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 118,\n", + " 'code_v1_num_chars': 173,\n", + " 'code_v0_no_empty_lines': 'from numpy import *\\n\\nN, *A = open(0)\\nN, A, S, a = int(N), loadtxt(A, int), 1, 0\\nwhile S:\\n B = A // N\\n S = sum(B)\\n a += S\\n A += S - B * -~N\\nprint(a)\\n',\n", + " 'code_v1_no_empty_lines': 'N, *A = list(map(int, open(0).read().split()))\\nans = 0\\nS = -1\\nwhile S:\\n S = sum(a // N for a in A)\\n ans += S\\n A = [a % N + (S - a // N) for a in A]\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-from numpy import *',\n", + " '-',\n", + " '-N, *A = open(0)',\n", + " '-N, A, S, a = int(N), loadtxt(A, int), 1, 0',\n", + " '+N, *A = list(map(int, open(0).read().split()))',\n", + " '+ans = 0',\n", + " '+S = -1',\n", + " '- B = A // N',\n", + " '- S = sum(B)',\n", + " '- a += S',\n", + " '- A += S - B * -~N',\n", + " '-print(a)',\n", + " '+ S = sum(a // N for a in A)',\n", + " '+ ans += S',\n", + " '+ A = [a % N + (S - a // N) for a in A]',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.776489467,\n", + " 'measured_runtime_v1': 0.278480018,\n", + " 'runtime_lift': 6.379234962,\n", + " 'key': ['s241047741', 's915089659']},\n", + " {'user_id': 'u754022296',\n", + " 'problem_id': 'p04021',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's724849949',\n", + " 'submission_id_v1': 's422278370',\n", + " 'cpu_time_v0': 219,\n", + " 'cpu_time_v1': 182,\n", + " 'memory_v0': 23552,\n", + " 'memory_v1': 23552,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.89,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nread = sys.stdin.read\\n\\n\\n\\nn = int(eval(input()))\\n\\nA = list(map(int, read().split()))\\n\\nL = sorted([(j, i) for i, j in enumerate(A)])\\n\\ncount = 0\\n\\nfor i in range(n):\\n\\n if (L[i][1]-i)%2:\\n\\n count += 1\\n\\nans = (count+1) // 2\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nread = sys.stdin.read\\n\\n\\n\\nn = int(eval(input()))\\n\\nA = list(map(int, read().split()))\\n\\nL = sorted([(j, i) for i, j in enumerate(A)])\\n\\ncount = 0\\n\\nfor i in range(n):\\n\\n count += (L[i][1]-i)%2\\n\\nans = (count+1) // 2\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 260,\n", + " 'code_v1_num_chars': 250,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nread = sys.stdin.read\\nn = int(eval(input()))\\nA = list(map(int, read().split()))\\nL = sorted([(j, i) for i, j in enumerate(A)])\\ncount = 0\\nfor i in range(n):\\n if (L[i][1] - i) % 2:\\n count += 1\\nans = (count + 1) // 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nread = sys.stdin.read\\nn = int(eval(input()))\\nA = list(map(int, read().split()))\\nL = sorted([(j, i) for i, j in enumerate(A)])\\ncount = 0\\nfor i in range(n):\\n count += (L[i][1] - i) % 2\\nans = (count + 1) // 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['- if (L[i][1] - i) % 2:',\n", + " '- count += 1',\n", + " '+ count += (L[i][1] - i) % 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2933020202,\n", + " 'measured_runtime_v1': 0.2201511685,\n", + " 'runtime_lift': 1.3322755547,\n", + " 'key': ['s724849949', 's422278370']},\n", + " {'user_id': 'u367130284',\n", + " 'problem_id': 'p03081',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's141729674',\n", + " 'submission_id_v1': 's328617225',\n", + " 'cpu_time_v0': 599,\n", + " 'cpu_time_v1': 524,\n", + " 'memory_v0': 40892,\n", + " 'memory_v1': 40892,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.52,\n", + " 'input': 'n,q=list(map(int,input().split()));s=\"_\"+eval(input())+\"_\";l,r=0,n+1\\n\\nfor(m,h)in[input().split()for i in range(q)][::-1]:L=h==\"L\";R=h==\"R\";l,r=[l,l-1,l+1][(m==s[l]and R)-(m==s[l+1]and L)],[r,r-1,r+1][(m==s[r-1]and R)-(m==s[r]and L)]\\n\\nprint((max(0,r-l-1)))',\n", + " 'target': 'n,q=list(map(int,input().split()));s=\"_\"+eval(input())+\"_\";l,r=0,n+1\\n\\nfor(m,h)in[input().split()for i in range(q)][::-1]:\\n\\n L=h==\"L\";R=h==\"R\";\\n\\n l+=(m==s[l+1]and L)-(m==s[l]and R)\\n\\n r+=(m==s[r]and L)-(m==s[r-1]and R)\\n\\nprint((max(0,r-l-1)))',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 241,\n", + " 'code_v1_num_chars': 234,\n", + " 'code_v0_no_empty_lines': 'n, q = list(map(int, input().split()))\\ns = \"_\" + eval(input()) + \"_\"\\nl, r = 0, n + 1\\nfor (m, h) in [input().split() for i in range(q)][::-1]:\\n L = h == \"L\"\\n R = h == \"R\"\\n l, r = [l, l - 1, l + 1][(m == s[l] and R) - (m == s[l + 1] and L)], [\\n r,\\n r - 1,\\n r + 1,\\n ][(m == s[r - 1] and R) - (m == s[r] and L)]\\nprint((max(0, r - l - 1)))\\n',\n", + " 'code_v1_no_empty_lines': 'n, q = list(map(int, input().split()))\\ns = \"_\" + eval(input()) + \"_\"\\nl, r = 0, n + 1\\nfor (m, h) in [input().split() for i in range(q)][::-1]:\\n L = h == \"L\"\\n R = h == \"R\"\\n l += (m == s[l + 1] and L) - (m == s[l] and R)\\n r += (m == s[r] and L) - (m == s[r - 1] and R)\\nprint((max(0, r - l - 1)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['- l, r = [l, l - 1, l + 1][(m == s[l] and R) - (m == s[l + 1] and L)], [',\n", + " '- r,',\n", + " '- r - 1,',\n", + " '- r + 1,',\n", + " '- ][(m == s[r - 1] and R) - (m == s[r] and L)]',\n", + " '+ l += (m == s[l + 1] and L) - (m == s[l] and R)',\n", + " '+ r += (m == s[r] and L) - (m == s[r - 1] and R)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2496840062,\n", + " 'measured_runtime_v1': 0.1505171778,\n", + " 'runtime_lift': 1.6588406042,\n", + " 'key': ['s141729674', 's328617225']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03553',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's825327687',\n", + " 'submission_id_v1': 's119429791',\n", + " 'cpu_time_v0': 227,\n", + " 'cpu_time_v1': 22,\n", + " 'memory_v0': 17084,\n", + " 'memory_v1': 3444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.31,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nfrom scipy.sparse.csgraph import dijkstra\\n\\nimport numpy as np\\n\\n\\n\\n\"\"\"\\n\\n最小カット\\n\\n\"\"\"\\n\\n\\n\\nN = int(eval(input()))\\n\\nstart = 0\\n\\ngoal = N+1\\n\\n\\n\\nA = [0] + [int(x) for x in input().split()]\\n\\n\\n\\nINF = 10 ** 12\\n\\ngraph = np.zeros((N+2,N+2),dtype=np.int64)\\n\\nfor i,a in enumerate(A[1:],1):\\n\\n if a >= 0:\\n\\n graph[start,i] = a\\n\\n else:\\n\\n graph[i,goal] = -a\\n\\nfor i in range(1,N+1):\\n\\n for j in range(2*i,N+1,i):\\n\\n if A[i] < 0 and A[j] > 0:\\n\\n graph[j][i] = INF\\n\\n\\n\\ndef max_flow(graph):\\n\\n flow = 0\\n\\n while True:\\n\\n dist,pred = dijkstra(graph, indices = start, return_predecessors = True, unweighted = True)\\n\\n if dist[goal] == np.inf:\\n\\n return flow\\n\\n path = []\\n\\n v = goal\\n\\n while True:\\n\\n path.append((pred[v],v))\\n\\n v = pred[v]\\n\\n if v == start:\\n\\n break\\n\\n add_flow = min(graph[x][y] for x,y in path)\\n\\n for x,y in path:\\n\\n graph[x][y] -= add_flow\\n\\n graph[y][x] += add_flow\\n\\n flow += add_flow\\n\\n\\n\\nanswer = sum(x for x in A if x > 0) - max_flow(graph)\\n\\nprint(answer)',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nfrom collections import deque\\n\\n\\n\\nN,*A = list(map(int,read().split()))\\n\\n\\n\\nclass Dinic:\\n\\n def __init__(self, N, source, sink):\\n\\n self.N = N\\n\\n self.G = [[] for _ in range(N)]\\n\\n self.source = source\\n\\n self.sink = sink\\n\\n\\n\\n def add_edge(self, fr, to, cap):\\n\\n n1 = len(self.G[fr])\\n\\n n2 = len(self.G[to])\\n\\n self.G[fr].append([to, cap, n2])\\n\\n self.G[to].append([fr, 0, n1]) # 逆辺を cap 0 で追加\\n\\n \\n\\n def add_edge_undirected(self, fr, to, cap):\\n\\n n1 = len(self.G[fr])\\n\\n n2 = len(self.G[to])\\n\\n self.G[fr].append([to, cap, n2])\\n\\n self.G[to].append([fr, cap, n1])\\n\\n \\n\\n def bfs(self):\\n\\n level = [0] * self.N\\n\\n G = self.G; source = self.source; sink = self.sink\\n\\n q = deque([source])\\n\\n level[source] = 1\\n\\n pop = q.popleft; append = q.append\\n\\n while q:\\n\\n v = pop()\\n\\n lv = level[v] + 1\\n\\n for to, cap, rev in G[v]:\\n\\n if not cap:\\n\\n continue\\n\\n if level[to]:\\n\\n continue\\n\\n level[to] = lv\\n\\n if to == sink:\\n\\n self.level = level\\n\\n return\\n\\n append(to)\\n\\n self.level = level\\n\\n \\n\\n def dfs(self,v,f):\\n\\n if v == self.sink:\\n\\n return f\\n\\n G = self.G\\n\\n prog = self.progress\\n\\n level = self.level\\n\\n lv = level[v]\\n\\n E = G[v]\\n\\n for i in range(prog[v],len(E)):\\n\\n to, cap, rev = E[i]\\n\\n prog[v] = i\\n\\n if not cap:\\n\\n continue\\n\\n if level[to] <= lv:\\n\\n continue\\n\\n x = f if f < cap else cap\\n\\n ff = self.dfs(to, x)\\n\\n if ff:\\n\\n E[i][1] -= ff\\n\\n G[to][rev][1] += ff\\n\\n return ff\\n\\n return 0\\n\\n \\n\\n def max_flow(self):\\n\\n INF = 10**18\\n\\n flow = 0\\n\\n while True:\\n\\n self.bfs()\\n\\n if not self.level[self.sink]:\\n\\n return flow\\n\\n self.progress = [0] * self.N\\n\\n while True:\\n\\n f = self.dfs(self.source, INF)\\n\\n if not f:\\n\\n break\\n\\n flow += f\\n\\n return flow\\n\\n\\n\\nsource = 0; sink = N+1; INF = 10 ** 18\\n\\ndinic = Dinic(N+2,source,sink)\\n\\nadd = dinic.add_edge\\n\\n\\n\\nfor i,x in enumerate(A,1):\\n\\n if x < 0:\\n\\n # source側：割るものを表現。sink側にうつすときにカット-xが必要。\\n\\n add(source,i,-x)\\n\\n else:\\n\\n # sink側：割らないものを表現。source側にうつすときにカットxが必要。\\n\\n add(i,sink,x)\\n\\n\\n\\nfor i in range(1,N+1):\\n\\n for j in range(i+i,N+1,i):\\n\\n # iを割るならjも割る。iを割ってjを割らないのは禁止\\n\\n # iがsourceでjがsinkなのは禁止\\n\\n add(i,j,INF)\\n\\n\\n\\nf = dinic.max_flow()\\n\\nx = sum(x for x in A if x >= 0)\\n\\nanswer = x - f\\n\\n\\n\\nprint(answer)',\n", + " 'code_v0_loc': 48,\n", + " 'code_v1_loc': 110,\n", + " 'code_v0_num_chars': 1147,\n", + " 'code_v1_num_chars': 2963,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nfrom scipy.sparse.csgraph import dijkstra\\nimport numpy as np\\n\\n\"\"\"\\n最小カット\\n\"\"\"\\nN = int(eval(input()))\\nstart = 0\\ngoal = N + 1\\nA = [0] + [int(x) for x in input().split()]\\nINF = 10**12\\ngraph = np.zeros((N + 2, N + 2), dtype=np.int64)\\nfor i, a in enumerate(A[1:], 1):\\n if a >= 0:\\n graph[start, i] = a\\n else:\\n graph[i, goal] = -a\\nfor i in range(1, N + 1):\\n for j in range(2 * i, N + 1, i):\\n if A[i] < 0 and A[j] > 0:\\n graph[j][i] = INF\\n\\n\\ndef max_flow(graph):\\n flow = 0\\n while True:\\n dist, pred = dijkstra(\\n graph, indices=start, return_predecessors=True, unweighted=True\\n )\\n if dist[goal] == np.inf:\\n return flow\\n path = []\\n v = goal\\n while True:\\n path.append((pred[v], v))\\n v = pred[v]\\n if v == start:\\n break\\n add_flow = min(graph[x][y] for x, y in path)\\n for x, y in path:\\n graph[x][y] -= add_flow\\n graph[y][x] += add_flow\\n flow += add_flow\\n\\n\\nanswer = sum(x for x in A if x > 0) - max_flow(graph)\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nfrom collections import deque\\n\\nN, *A = list(map(int, read().split()))\\n\\n\\nclass Dinic:\\n def __init__(self, N, source, sink):\\n self.N = N\\n self.G = [[] for _ in range(N)]\\n self.source = source\\n self.sink = sink\\n\\n def add_edge(self, fr, to, cap):\\n n1 = len(self.G[fr])\\n n2 = len(self.G[to])\\n self.G[fr].append([to, cap, n2])\\n self.G[to].append([fr, 0, n1]) # 逆辺を cap 0 で追加\\n\\n def add_edge_undirected(self, fr, to, cap):\\n n1 = len(self.G[fr])\\n n2 = len(self.G[to])\\n self.G[fr].append([to, cap, n2])\\n self.G[to].append([fr, cap, n1])\\n\\n def bfs(self):\\n level = [0] * self.N\\n G = self.G\\n source = self.source\\n sink = self.sink\\n q = deque([source])\\n level[source] = 1\\n pop = q.popleft\\n append = q.append\\n while q:\\n v = pop()\\n lv = level[v] + 1\\n for to, cap, rev in G[v]:\\n if not cap:\\n continue\\n if level[to]:\\n continue\\n level[to] = lv\\n if to == sink:\\n self.level = level\\n return\\n append(to)\\n self.level = level\\n\\n def dfs(self, v, f):\\n if v == self.sink:\\n return f\\n G = self.G\\n prog = self.progress\\n level = self.level\\n lv = level[v]\\n E = G[v]\\n for i in range(prog[v], len(E)):\\n to, cap, rev = E[i]\\n prog[v] = i\\n if not cap:\\n continue\\n if level[to] <= lv:\\n continue\\n x = f if f < cap else cap\\n ff = self.dfs(to, x)\\n if ff:\\n E[i][1] -= ff\\n G[to][rev][1] += ff\\n return ff\\n return 0\\n\\n def max_flow(self):\\n INF = 10**18\\n flow = 0\\n while True:\\n self.bfs()\\n if not self.level[self.sink]:\\n return flow\\n self.progress = [0] * self.N\\n while True:\\n f = self.dfs(self.source, INF)\\n if not f:\\n break\\n flow += f\\n return flow\\n\\n\\nsource = 0\\nsink = N + 1\\nINF = 10**18\\ndinic = Dinic(N + 2, source, sink)\\nadd = dinic.add_edge\\nfor i, x in enumerate(A, 1):\\n if x < 0:\\n # source側：割るものを表現。sink側にうつすときにカット-xが必要。\\n add(source, i, -x)\\n else:\\n # sink側：割らないものを表現。source側にうつすときにカットxが必要。\\n add(i, sink, x)\\nfor i in range(1, N + 1):\\n for j in range(i + i, N + 1, i):\\n # iを割るならjも割る。iを割ってjを割らないのは禁止\\n # iがsourceでjがsinkなのは禁止\\n add(i, j, INF)\\nf = dinic.max_flow()\\nx = sum(x for x in A if x >= 0)\\nanswer = x - f\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 56.3636363636,\n", + " 'diff': ['-input = sys.stdin.readline',\n", + " '-from scipy.sparse.csgraph import dijkstra',\n", + " '-import numpy as np',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '+from collections import deque',\n", + " '-\"\"\"',\n", + " '-最小カット',\n", + " '-\"\"\"',\n", + " '-N = int(eval(input()))',\n", + " '-start = 0',\n", + " '-goal = N + 1',\n", + " '-A = [0] + [int(x) for x in input().split()]',\n", + " '-INF = 10**12',\n", + " '-graph = np.zeros((N + 2, N + 2), dtype=np.int64)',\n", + " '-for i, a in enumerate(A[1:], 1):',\n", + " '- if a >= 0:',\n", + " '- graph[start, i] = a',\n", + " '- else:',\n", + " '- graph[i, goal] = -a',\n", + " '-for i in range(1, N + 1):',\n", + " '- for j in range(2 * i, N + 1, i):',\n", + " '- if A[i] < 0 and A[j] > 0:',\n", + " '- graph[j][i] = INF',\n", + " '+N, *A = list(map(int, read().split()))',\n", + " '-def max_flow(graph):',\n", + " '- flow = 0',\n", + " '- while True:',\n", + " '- dist, pred = dijkstra(',\n", + " '- graph, indices=start, return_predecessors=True, unweighted=True',\n", + " '- )',\n", + " '- if dist[goal] == np.inf:',\n", + " '- return flow',\n", + " '- path = []',\n", + " '- v = goal',\n", + " '+class Dinic:',\n", + " '+ def __init__(self, N, source, sink):',\n", + " '+ self.N = N',\n", + " '+ self.G = [[] for _ in range(N)]',\n", + " '+ self.source = source',\n", + " '+ self.sink = sink',\n", + " '+',\n", + " '+ def add_edge(self, fr, to, cap):',\n", + " '+ n1 = len(self.G[fr])',\n", + " '+ n2 = len(self.G[to])',\n", + " '+ self.G[fr].append([to, cap, n2])',\n", + " '+ self.G[to].append([fr, 0, n1]) # 逆辺を cap 0 で追加',\n", + " '+',\n", + " '+ def add_edge_undirected(self, fr, to, cap):',\n", + " '+ n1 = len(self.G[fr])',\n", + " '+ n2 = len(self.G[to])',\n", + " '+ self.G[fr].append([to, cap, n2])',\n", + " '+ self.G[to].append([fr, cap, n1])',\n", + " '+',\n", + " '+ def bfs(self):',\n", + " '+ level = [0] * self.N',\n", + " '+ G = self.G',\n", + " '+ source = self.source',\n", + " '+ sink = self.sink',\n", + " '+ q = deque([source])',\n", + " '+ level[source] = 1',\n", + " '+ pop = q.popleft',\n", + " '+ append = q.append',\n", + " '+ while q:',\n", + " '+ v = pop()',\n", + " '+ lv = level[v] + 1',\n", + " '+ for to, cap, rev in G[v]:',\n", + " '+ if not cap:',\n", + " '+ continue',\n", + " '+ if level[to]:',\n", + " '+ continue',\n", + " '+ level[to] = lv',\n", + " '+ if to == sink:',\n", + " '+ self.level = level',\n", + " '+ return',\n", + " '+ append(to)',\n", + " '+ self.level = level',\n", + " '+',\n", + " '+ def dfs(self, v, f):',\n", + " '+ if v == self.sink:',\n", + " '+ return f',\n", + " '+ G = self.G',\n", + " '+ prog = self.progress',\n", + " '+ level = self.level',\n", + " '+ lv = level[v]',\n", + " '+ E = G[v]',\n", + " '+ for i in range(prog[v], len(E)):',\n", + " '+ to, cap, rev = E[i]',\n", + " '+ prog[v] = i',\n", + " '+ if not cap:',\n", + " '+ continue',\n", + " '+ if level[to] <= lv:',\n", + " '+ continue',\n", + " '+ x = f if f < cap else cap',\n", + " '+ ff = self.dfs(to, x)',\n", + " '+ if ff:',\n", + " '+ E[i][1] -= ff',\n", + " '+ G[to][rev][1] += ff',\n", + " '+ return ff',\n", + " '+ return 0',\n", + " '+',\n", + " '+ def max_flow(self):',\n", + " '+ INF = 10**18',\n", + " '+ flow = 0',\n", + " '- path.append((pred[v], v))',\n", + " '- v = pred[v]',\n", + " '- if v == start:',\n", + " '- break',\n", + " '- add_flow = min(graph[x][y] for x, y in path)',\n", + " '- for x, y in path:',\n", + " '- graph[x][y] -= add_flow',\n", + " '- graph[y][x] += add_flow',\n", + " '- flow += add_flow',\n", + " '+ self.bfs()',\n", + " '+ if not self.level[self.sink]:',\n", + " '+ return flow',\n", + " '+ self.progress = [0] * self.N',\n", + " '+ while True:',\n", + " '+ f = self.dfs(self.source, INF)',\n", + " '+ if not f:',\n", + " '+ break',\n", + " '+ flow += f',\n", + " '+ return flow',\n", + " '-answer = sum(x for x in A if x > 0) - max_flow(graph)',\n", + " '+source = 0',\n", + " '+sink = N + 1',\n", + " '+INF = 10**18',\n", + " '+dinic = Dinic(N + 2, source, sink)',\n", + " '+add = dinic.add_edge',\n", + " '+for i, x in enumerate(A, 1):',\n", + " '+ if x < 0:',\n", + " '+ # source側：割るものを表現。sink側にうつすときにカット-xが必要。',\n", + " '+ add(source, i, -x)',\n", + " '+ else:',\n", + " '+ # sink側：割らないものを表現。source側にうつすときにカットxが必要。',\n", + " '+ add(i, sink, x)',\n", + " '+for i in range(1, N + 1):',\n", + " '+ for j in range(i + i, N + 1, i):',\n", + " '+ # iを割るならjも割る。iを割ってjを割らないのは禁止',\n", + " '+ # iがsourceでjがsinkなのは禁止',\n", + " '+ add(i, j, INF)',\n", + " '+f = dinic.max_flow()',\n", + " '+x = sum(x for x in A if x >= 0)',\n", + " '+answer = x - f'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1869269931,\n", + " 'measured_runtime_v1': 0.2612461398,\n", + " 'runtime_lift': 8.3711361057,\n", + " 'key': ['s825327687', 's119429791']},\n", + " {'user_id': 'u301624971',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's825153134',\n", + " 'submission_id_v1': 's210395809',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 3972,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.39,\n", + " 'input': \"from math import factorial\\n\\ndef myAnswer(N:int) ->int:\\n\\n ans =factorial(N)\\n\\n return ans % (10**9 + 7)\\n\\n\\n\\ndef modelAnswer():\\n\\n tmp=1\\n\\ndef main():\\n\\n N = int(eval(input()))\\n\\n print((myAnswer(N)))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"def modelAnswer(N:int) -> int:\\n\\n ans = 1\\n\\n for i in range(1,N+1):\\n\\n ans = (ans*i) % (10**9 + 7)\\n\\n return ans \\n\\ndef main():\\n\\n N = int(eval(input()))\\n\\n print((modelAnswer(N)))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 237,\n", + " 'code_v1_num_chars': 224,\n", + " 'code_v0_no_empty_lines': 'from math import factorial\\n\\n\\ndef myAnswer(N: int) -> int:\\n ans = factorial(N)\\n return ans % (10**9 + 7)\\n\\n\\ndef modelAnswer():\\n tmp = 1\\n\\n\\ndef main():\\n N = int(eval(input()))\\n print((myAnswer(N)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def modelAnswer(N: int) -> int:\\n ans = 1\\n for i in range(1, N + 1):\\n ans = (ans * i) % (10**9 + 7)\\n return ans\\n\\n\\ndef main():\\n N = int(eval(input()))\\n print((modelAnswer(N)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-from math import factorial',\n", + " '-',\n", + " '-',\n", + " '-def myAnswer(N: int) -> int:',\n", + " '- ans = factorial(N)',\n", + " '- return ans % (10**9 + 7)',\n", + " '-',\n", + " '-',\n", + " '-def modelAnswer():',\n", + " '- tmp = 1',\n", + " '+def modelAnswer(N: int) -> int:',\n", + " '+ ans = 1',\n", + " '+ for i in range(1, N + 1):',\n", + " '+ ans = (ans * i) % (10**9 + 7)',\n", + " '+ return ans',\n", + " '- print((myAnswer(N)))',\n", + " '+ print((modelAnswer(N)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7093277271,\n", + " 'measured_runtime_v1': 0.3704600389,\n", + " 'runtime_lift': 1.9147212994,\n", + " 'key': ['s825153134', 's210395809']},\n", + " {'user_id': 'u982896977',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's299972417',\n", + " 'submission_id_v1': 's929413776',\n", + " 'cpu_time_v0': 102,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.33,\n", + " 'input': 'a,b,c,x,y = list(map(int,input().split()))\\n\\nans = a*x + b*y\\n\\nfor i in range(max(x,y) + 1):\\n\\n\\tmoney = max(0,(x-i)*a) + max(0,(y-i)*b) + 2*i*c\\n\\n\\tif money <= ans:\\n\\n\\t\\tans = money\\n\\nprint(ans)',\n", + " 'target': 'a,b,c,x,y = list(map(int,input().split()))\\n\\nif a + b >= 2*c:\\n\\n\\tif x >= y:\\n\\n\\t\\tans = 2*y*c + (x-y)*min(a,2*c)\\n\\n\\telse:\\n\\n\\t\\tans = 2*x*c + (y-x)*min(b,2*c)\\n\\nelse:\\n\\n\\tans = (x*a + y*b)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 180,\n", + " 'code_v1_num_chars': 182,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = a * x + b * y\\nfor i in range(max(x, y) + 1):\\n money = max(0, (x - i) * a) + max(0, (y - i) * b) + 2 * i * c\\n if money <= ans:\\n ans = money\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nif a + b >= 2 * c:\\n if x >= y:\\n ans = 2 * y * c + (x - y) * min(a, 2 * c)\\n else:\\n ans = 2 * x * c + (y - x) * min(b, 2 * c)\\nelse:\\n ans = x * a + y * b\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['-ans = a * x + b * y',\n", + " '-for i in range(max(x, y) + 1):',\n", + " '- money = max(0, (x - i) * a) + max(0, (y - i) * b) + 2 * i * c',\n", + " '- if money <= ans:',\n", + " '- ans = money',\n", + " '+if a + b >= 2 * c:',\n", + " '+ if x >= y:',\n", + " '+ ans = 2 * y * c + (x - y) * min(a, 2 * c)',\n", + " '+ else:',\n", + " '+ ans = 2 * x * c + (y - x) * min(b, 2 * c)',\n", + " '+else:',\n", + " '+ ans = x * a + y * b'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3295188012,\n", + " 'measured_runtime_v1': 0.2310098734,\n", + " 'runtime_lift': 1.4264273486,\n", + " 'key': ['s299972417', 's929413776']},\n", + " {'user_id': 'u740909619',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's813753303',\n", + " 'submission_id_v1': 's285228953',\n", + " 'cpu_time_v0': 787,\n", + " 'cpu_time_v1': 104,\n", + " 'memory_v0': 23376,\n", + " 'memory_v1': 14008,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.79,\n", + " 'input': '# C - Go to School\\n\\ndef main():\\n\\n import numpy as np\\n\\n n = int(input())\\n\\n a = list(map(int, input().split()))\\n\\n a = np.array(a)\\n\\n a = np.argsort(a)\\n\\n for i in a:\\n\\n print(i+1,end=\" \")\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': '# C - Go to School\\n\\ndef main():\\n\\n n = int(eval(input()))\\n\\n a = list(map(int, input().split()))\\n\\n ans = [0] * n\\n\\n\\n\\n for i, o in enumerate(a):\\n\\n ans[o-1] = i + 1 \\n\\n \\n\\n print((*ans))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 250,\n", + " 'code_v1_num_chars': 239,\n", + " 'code_v0_no_empty_lines': '# C - Go to School\\ndef main():\\n import numpy as np\\n\\n n = int(input())\\n a = list(map(int, input().split()))\\n a = np.array(a)\\n a = np.argsort(a)\\n for i in a:\\n print(i + 1, end=\" \")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# C - Go to School\\ndef main():\\n n = int(eval(input()))\\n a = list(map(int, input().split()))\\n ans = [0] * n\\n for i, o in enumerate(a):\\n ans[o - 1] = i + 1\\n print((*ans))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['- import numpy as np',\n", + " '-',\n", + " '- n = int(input())',\n", + " '+ n = int(eval(input()))',\n", + " '- a = np.array(a)',\n", + " '- a = np.argsort(a)',\n", + " '- for i in a:',\n", + " '- print(i + 1, end=\" \")',\n", + " '+ ans = [0] * n',\n", + " '+ for i, o in enumerate(a):',\n", + " '+ ans[o - 1] = i + 1',\n", + " '+ print((*ans))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7626473089,\n", + " 'measured_runtime_v1': 0.1551200287,\n", + " 'runtime_lift': 4.9164979856,\n", + " 'key': ['s813753303', 's285228953']},\n", + " {'user_id': 'u186426563',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's658008469',\n", + " 'submission_id_v1': 's153128369',\n", + " 'cpu_time_v0': 69,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.91,\n", + " 'input': 'A, B = list(map(int, input().split()))\\n\\ncount = 0\\n\\nfor i in range(A, B+1):\\n\\n if(str(i) == str(i)[::-1]):\\n\\n count += 1\\n\\nprint(count)\\n',\n", + " 'target': 'A, B = list(map(int, input().split()))\\n\\ncount = 0\\n\\nfor i in range(10):\\n\\n for j in range(10):\\n\\n for k in range(10):\\n\\n if(A <= 10000*i + 1000*j + 100*k + 10*j +i <= B):\\n\\n count += 1\\n\\nprint(count)',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 136,\n", + " 'code_v1_num_chars': 223,\n", + " 'code_v0_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncount = 0\\nfor i in range(A, B + 1):\\n if str(i) == str(i)[::-1]:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncount = 0\\nfor i in range(10):\\n for j in range(10):\\n for k in range(10):\\n if A <= 10000 * i + 1000 * j + 100 * k + 10 * j + i <= B:\\n count += 1\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-for i in range(A, B + 1):',\n", + " '- if str(i) == str(i)[::-1]:',\n", + " '- count += 1',\n", + " '+for i in range(10):',\n", + " '+ for j in range(10):',\n", + " '+ for k in range(10):',\n", + " '+ if A <= 10000 * i + 1000 * j + 100 * k + 10 * j + i <= B:',\n", + " '+ count += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2767280417,\n", + " 'measured_runtime_v1': 0.2133212276,\n", + " 'runtime_lift': 1.2972363083,\n", + " 'key': ['s658008469', 's153128369']},\n", + " {'user_id': 'u762420987',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's906856884',\n", + " 'submission_id_v1': 's911933040',\n", + " 'cpu_time_v0': 571,\n", + " 'cpu_time_v1': 234,\n", + " 'memory_v0': 33780,\n", + " 'memory_v1': 25060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.02,\n", + " 'input': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\n\\nplist = list(map(int, input().split()))\\n\\nkitaiti = np.array([(0.5*(p+1)) for p in plist])\\n\\nans = 0\\n\\nval = sum(kitaiti[:K])\\n\\nans = max(ans, val)\\n\\nfor i in range(1, N-K+1):\\n\\n # print(i-1, i+K)\\n\\n val -= kitaiti[i-1]\\n\\n val += kitaiti[i+K-1]\\n\\n ans = max(ans, val)\\n\\nprint(ans)',\n", + " 'target': 'N, K = list(map(int, input().split()))\\n\\nplist = [((num*(num+1))//2)/num for num in list(map(int, input().split()))]\\n\\n# print(plist)\\n\\nans = 0\\n\\nfor i in range(K):\\n\\n ans += plist[i]\\n\\n_ = ans\\n\\nfor i in range(N-K):\\n\\n temp = _\\n\\n temp -= plist[i]\\n\\n temp += plist[i+K]\\n\\n # print(i, i+K, ans, temp)\\n\\n ans = max(ans, temp)\\n\\n _ = temp\\n\\nprint(ans)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 336,\n", + " 'code_v1_num_chars': 350,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\nplist = list(map(int, input().split()))\\nkitaiti = np.array([(0.5 * (p + 1)) for p in plist])\\nans = 0\\nval = sum(kitaiti[:K])\\nans = max(ans, val)\\nfor i in range(1, N - K + 1):\\n # print(i-1, i+K)\\n val -= kitaiti[i - 1]\\n val += kitaiti[i + K - 1]\\n ans = max(ans, val)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nplist = [((num * (num + 1)) // 2) / num for num in list(map(int, input().split()))]\\n# print(plist)\\nans = 0\\nfor i in range(K):\\n ans += plist[i]\\n_ = ans\\nfor i in range(N - K):\\n temp = _\\n temp -= plist[i]\\n temp += plist[i + K]\\n # print(i, i+K, ans, temp)\\n ans = max(ans, temp)\\n _ = temp\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-plist = list(map(int, input().split()))',\n", + " '-kitaiti = np.array([(0.5 * (p + 1)) for p in plist])',\n", + " '+plist = [((num * (num + 1)) // 2) / num for num in list(map(int, input().split()))]',\n", + " '+# print(plist)',\n", + " '-val = sum(kitaiti[:K])',\n", + " '-ans = max(ans, val)',\n", + " '-for i in range(1, N - K + 1):',\n", + " '- # print(i-1, i+K)',\n", + " '- val -= kitaiti[i - 1]',\n", + " '- val += kitaiti[i + K - 1]',\n", + " '- ans = max(ans, val)',\n", + " '+for i in range(K):',\n", + " '+ ans += plist[i]',\n", + " '+_ = ans',\n", + " '+for i in range(N - K):',\n", + " '+ temp = _',\n", + " '+ temp -= plist[i]',\n", + " '+ temp += plist[i + K]',\n", + " '+ # print(i, i+K, ans, temp)',\n", + " '+ ans = max(ans, temp)',\n", + " '+ _ = temp'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.2856271963,\n", + " 'measured_runtime_v1': 0.3424234481,\n", + " 'runtime_lift': 6.6748559686,\n", + " 'key': ['s906856884', 's911933040']},\n", + " {'user_id': 'u428397309',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's058389905',\n", + " 'submission_id_v1': 's302443687',\n", + " 'cpu_time_v0': 285,\n", + " 'cpu_time_v1': 131,\n", + " 'memory_v0': 10868,\n", + " 'memory_v1': 10868,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.04,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\nL, R = [None] * M, [None] * M\\n\\nfor i in range(M):\\n\\n L[i], R[i] = list(map(int, input().split()))\\n\\n\\n\\nl = max(L)\\n\\nr = min(R)\\n\\n\\n\\nans = max(r - l + 1, 0)\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\n\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\nL, R = [None] * M, [None] * M\\n\\nfor i in range(M):\\n\\n L[i], R[i] = list(map(int, input().split()))\\n\\n\\n\\nans = max(min(R) - max(L) + 1, 0)\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 222,\n", + " 'code_v1_num_chars': 248,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nN, M = list(map(int, input().split()))\\nL, R = [None] * M, [None] * M\\nfor i in range(M):\\n L[i], R[i] = list(map(int, input().split()))\\nl = max(L)\\nr = min(R)\\nans = max(r - l + 1, 0)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\n\\ninput = sys.stdin.readline\\nN, M = list(map(int, input().split()))\\nL, R = [None] * M, [None] * M\\nfor i in range(M):\\n L[i], R[i] = list(map(int, input().split()))\\nans = max(min(R) - max(L) + 1, 0)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '+input = sys.stdin.readline',\n", + " '-l = max(L)',\n", + " '-r = min(R)',\n", + " '-ans = max(r - l + 1, 0)',\n", + " '+ans = max(min(R) - max(L) + 1, 0)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2363609416,\n", + " 'measured_runtime_v1': 0.0060358713,\n", + " 'runtime_lift': 39.1593741465,\n", + " 'key': ['s058389905', 's302443687']},\n", + " {'user_id': 'u814986259',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's294020052',\n", + " 'submission_id_v1': 's579876547',\n", + " 'cpu_time_v0': 229,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 3968,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.53,\n", + " 'input': 'import math\\n\\nN=int(eval(input()))\\n\\nans=math.factorial(N)\\n\\nprint((ans%(10**9 +7)))',\n", + " 'target': 'mod=10**9+7\\n\\nN=int(eval(input()))\\n\\nans=1\\n\\nfor i in range(1,N+1):\\n\\n ans*=i\\n\\n ans%=mod\\n\\nprint(ans)',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 73,\n", + " 'code_v1_num_chars': 92,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nans = math.factorial(N)\\nprint((ans % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'mod = 10**9 + 7\\nN = int(eval(input()))\\nans = 1\\nfor i in range(1, N + 1):\\n ans *= i\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.8571428571,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '+mod = 10**9 + 7',\n", + " '-ans = math.factorial(N)',\n", + " '-print((ans % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+for i in range(1, N + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= mod',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3063099709,\n", + " 'measured_runtime_v1': 0.2071282012,\n", + " 'runtime_lift': 1.4788424222,\n", + " 'key': ['s294020052', 's579876547']},\n", + " {'user_id': 'u945405878',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's615780042',\n", + " 'submission_id_v1': 's374426185',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 119,\n", + " 'memory_v0': 30320,\n", + " 'memory_v1': 18956,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.26,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = [int(_) for _ in input().split(\" \")]\\n\\n\\n\\ntmp = np.argsort(A)\\n\\ntmp2= tmp + np.ones(N)\\n\\ntmp3 = [int(_) for _ in tmp2.tolist()]\\n\\nans = [str(_) for _ in tmp3]\\n\\n\\n\\nprint((\" \".join(ans)))',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = [int(_) for _ in input().split(\" \")]\\n\\n\\n\\ntmp = sorted(list(range(1, len(A) + 1)), key=lambda x:A[x - 1])\\n\\nans = [str(_) for _ in tmp]\\n\\nprint((\" \".join(ans)))',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 221,\n", + " 'code_v1_num_chars': 170,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = [int(_) for _ in input().split(\" \")]\\ntmp = np.argsort(A)\\ntmp2 = tmp + np.ones(N)\\ntmp3 = [int(_) for _ in tmp2.tolist()]\\nans = [str(_) for _ in tmp3]\\nprint((\" \".join(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [int(_) for _ in input().split(\" \")]\\ntmp = sorted(list(range(1, len(A) + 1)), key=lambda x: A[x - 1])\\nans = [str(_) for _ in tmp]\\nprint((\" \".join(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 45.4545454545,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-tmp = np.argsort(A)',\n", + " '-tmp2 = tmp + np.ones(N)',\n", + " '-tmp3 = [int(_) for _ in tmp2.tolist()]',\n", + " '-ans = [str(_) for _ in tmp3]',\n", + " '+tmp = sorted(list(range(1, len(A) + 1)), key=lambda x: A[x - 1])',\n", + " '+ans = [str(_) for _ in tmp]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.608368429,\n", + " 'measured_runtime_v1': 0.1298276195,\n", + " 'runtime_lift': 12.3884920241,\n", + " 'key': ['s615780042', 's374426185']},\n", + " {'user_id': 'u163320134',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's012458960',\n", + " 'submission_id_v1': 's740832114',\n", + " 'cpu_time_v0': 351,\n", + " 'cpu_time_v1': 278,\n", + " 'memory_v0': 6900,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.8,\n", + " 'input': 'n,m=list(map(int,input().split()))\\n\\nc=[0]*(n+2)\\n\\nfor i in range(m):\\n\\n l,r=list(map(int,input().split()))\\n\\n c[l-1]+=1\\n\\n c[r]-=1\\n\\nfor i in range(1,n+2):\\n\\n c[i]=c[i]+c[i-1]\\n\\nans=0\\n\\nfor i in range(n+2):\\n\\n if c[i]==m:\\n\\n ans+=1\\n\\nprint(ans)',\n", + " 'target': 'n,m=list(map(int,input().split()))\\n\\nl,r=list(map(int,input().split()))\\n\\nfor i in range(m-1):\\n\\n tl,tr=list(map(int,input().split()))\\n\\n if l 0:\\n\\n y %= modulo\\n\\n base *= base\\n\\n if modulo > 0:\\n\\n base %= modulo\\n\\n tmp //= 2\\n\\n return y\\n\\n\\n\\ndef inved(a, modulo=mod):\\n\\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\\n\\n while l != 0:\\n\\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\\n\\n k, l = l, k % l\\n\\n return x % modulo\\n\\n\\n\\nfact = [1 for _ in range(maxf+1)]\\n\\ninvf = [1 for _ in range(maxf+1)]\\n\\n\\n\\nfor i in range(maxf):\\n\\n fact[i+1] = (fact[i] * (i+1)) % mod\\n\\ninvf[-1] = inved(fact[-1])\\n\\nfor i in range(maxf, 0, -1):\\n\\n invf[i-1] = (invf[i] * i) % mod\\n\\n\\n\\nfor i in range(1, n+2):\\n\\n S = fact[n]*invf[i-1]*invf[n-i+1]%mod\\n\\n if i <= n-1:\\n\\n S += fact[n-1]*invf[i]*invf[n-1-i]%mod\\n\\n S %= mod\\n\\n if i <= n-M:\\n\\n S -= fact[n-1-M]*invf[i-1]*invf[n-M-i]%mod\\n\\n S %= mod\\n\\n if i <= n:\\n\\n S += fact[n-1]*invf[i-1]*invf[n-i]%mod\\n\\n S %= mod\\n\\n print(S)',\n", + " 'target': 'n = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nD = {i: [0] for i in range(1, n+1)}\\n\\nfor i in range(n+1):\\n\\n D[a[i]][0] += 1\\n\\n D[a[i]].append(i)\\n\\npl, pr = 0, 0\\n\\nfor i in D:\\n\\n if D[i][0] == 2:\\n\\n pl = D[i][1]\\n\\n pr = D[i][2]\\n\\n break\\n\\nL = pl\\n\\nM = pr - pl - 1\\n\\nN = n - pr\\n\\nmod = int(1e9) + 7 # <-- input modulo\\n\\nmaxf = n+11 # <-- input factional limitation\\n\\n\\n\\ndef make_fact(n, k):\\n\\n tmp = n\\n\\n perm = [i for i in range(k)]\\n\\n L = [0 for _ in range(k)]\\n\\n for i in range(k):\\n\\n L[i] = tmp % (i + 1)\\n\\n tmp //= i + 1\\n\\n LL = [0 for _ in range(k)]\\n\\n for i in range(k):\\n\\n LL[i] = perm[L[-i-1]]\\n\\n for j in range(L[-i-1]+1, k):\\n\\n perm[j-1] = perm[j]\\n\\n return LL\\n\\n\\n\\ndef doubling(n, m, modulo=mod):\\n\\n y = 1\\n\\n base = n\\n\\n tmp = m\\n\\n while tmp != 0:\\n\\n if tmp % 2 == 1:\\n\\n y *= base\\n\\n if modulo > 0:\\n\\n y %= modulo\\n\\n base *= base\\n\\n if modulo > 0:\\n\\n base %= modulo\\n\\n tmp //= 2\\n\\n return y\\n\\n\\n\\ndef inved(a, modulo=mod):\\n\\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\\n\\n while l != 0:\\n\\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\\n\\n k, l = l, k % l\\n\\n return x % modulo\\n\\n\\n\\nfact = [1 for _ in range(maxf+1)]\\n\\ninvf = [1 for _ in range(maxf+1)]\\n\\n\\n\\nfor i in range(maxf):\\n\\n fact[i+1] = (fact[i] * (i+1)) % mod\\n\\ninvf[-1] = inved(fact[-1])\\n\\nfor i in range(maxf, 0, -1):\\n\\n invf[i-1] = (invf[i] * i) % mod\\n\\n\\n\\nfor i in range(1, n+2):\\n\\n S = fact[n+1]*invf[i]*invf[n-i+1]%mod\\n\\n if i <= n-M:\\n\\n S -= fact[n-1-M]*invf[i-1]*invf[n-M-i]%mod\\n\\n S %= mod\\n\\n print(S)\\n',\n", + " 'code_v0_loc': 75,\n", + " 'code_v1_loc': 69,\n", + " 'code_v0_num_chars': 1780,\n", + " 'code_v1_num_chars': 1635,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nD = {i: [0] for i in range(1, n + 1)}\\nfor i in range(n + 1):\\n D[a[i]][0] += 1\\n D[a[i]].append(i)\\npl, pr = 0, 0\\nfor i in D:\\n if D[i][0] == 2:\\n pl = D[i][1]\\n pr = D[i][2]\\n break\\nL = pl\\nM = pr - pl - 1\\nN = n - pr\\nmod = int(1e9) + 7 # <-- input modulo\\nmaxf = n + 11 # <-- input factional limitation\\n\\n\\ndef make_fact(n, k):\\n tmp = n\\n perm = [i for i in range(k)]\\n L = [0 for _ in range(k)]\\n for i in range(k):\\n L[i] = tmp % (i + 1)\\n tmp //= i + 1\\n LL = [0 for _ in range(k)]\\n for i in range(k):\\n LL[i] = perm[L[-i - 1]]\\n for j in range(L[-i - 1] + 1, k):\\n perm[j - 1] = perm[j]\\n return LL\\n\\n\\ndef doubling(n, m, modulo=mod):\\n y = 1\\n base = n\\n tmp = m\\n while tmp != 0:\\n if tmp % 2 == 1:\\n y *= base\\n if modulo > 0:\\n y %= modulo\\n base *= base\\n if modulo > 0:\\n base %= modulo\\n tmp //= 2\\n return y\\n\\n\\ndef inved(a, modulo=mod):\\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\\n while l != 0:\\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\\n k, l = l, k % l\\n return x % modulo\\n\\n\\nfact = [1 for _ in range(maxf + 1)]\\ninvf = [1 for _ in range(maxf + 1)]\\nfor i in range(maxf):\\n fact[i + 1] = (fact[i] * (i + 1)) % mod\\ninvf[-1] = inved(fact[-1])\\nfor i in range(maxf, 0, -1):\\n invf[i - 1] = (invf[i] * i) % mod\\nfor i in range(1, n + 2):\\n S = fact[n] * invf[i - 1] * invf[n - i + 1] % mod\\n if i <= n - 1:\\n S += fact[n - 1] * invf[i] * invf[n - 1 - i] % mod\\n S %= mod\\n if i <= n - M:\\n S -= fact[n - 1 - M] * invf[i - 1] * invf[n - M - i] % mod\\n S %= mod\\n if i <= n:\\n S += fact[n - 1] * invf[i - 1] * invf[n - i] % mod\\n S %= mod\\n print(S)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nD = {i: [0] for i in range(1, n + 1)}\\nfor i in range(n + 1):\\n D[a[i]][0] += 1\\n D[a[i]].append(i)\\npl, pr = 0, 0\\nfor i in D:\\n if D[i][0] == 2:\\n pl = D[i][1]\\n pr = D[i][2]\\n break\\nL = pl\\nM = pr - pl - 1\\nN = n - pr\\nmod = int(1e9) + 7 # <-- input modulo\\nmaxf = n + 11 # <-- input factional limitation\\n\\n\\ndef make_fact(n, k):\\n tmp = n\\n perm = [i for i in range(k)]\\n L = [0 for _ in range(k)]\\n for i in range(k):\\n L[i] = tmp % (i + 1)\\n tmp //= i + 1\\n LL = [0 for _ in range(k)]\\n for i in range(k):\\n LL[i] = perm[L[-i - 1]]\\n for j in range(L[-i - 1] + 1, k):\\n perm[j - 1] = perm[j]\\n return LL\\n\\n\\ndef doubling(n, m, modulo=mod):\\n y = 1\\n base = n\\n tmp = m\\n while tmp != 0:\\n if tmp % 2 == 1:\\n y *= base\\n if modulo > 0:\\n y %= modulo\\n base *= base\\n if modulo > 0:\\n base %= modulo\\n tmp //= 2\\n return y\\n\\n\\ndef inved(a, modulo=mod):\\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\\n while l != 0:\\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\\n k, l = l, k % l\\n return x % modulo\\n\\n\\nfact = [1 for _ in range(maxf + 1)]\\ninvf = [1 for _ in range(maxf + 1)]\\nfor i in range(maxf):\\n fact[i + 1] = (fact[i] * (i + 1)) % mod\\ninvf[-1] = inved(fact[-1])\\nfor i in range(maxf, 0, -1):\\n invf[i - 1] = (invf[i] * i) % mod\\nfor i in range(1, n + 2):\\n S = fact[n + 1] * invf[i] * invf[n - i + 1] % mod\\n if i <= n - M:\\n S -= fact[n - 1 - M] * invf[i - 1] * invf[n - M - i] % mod\\n S %= mod\\n print(S)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.0,\n", + " 'diff': ['- S = fact[n] * invf[i - 1] * invf[n - i + 1] % mod',\n", + " '- if i <= n - 1:',\n", + " '- S += fact[n - 1] * invf[i] * invf[n - 1 - i] % mod',\n", + " '- S %= mod',\n", + " '+ S = fact[n + 1] * invf[i] * invf[n - i + 1] % mod',\n", + " '- if i <= n:',\n", + " '- S += fact[n - 1] * invf[i - 1] * invf[n - i] % mod',\n", + " '- S %= mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3162681131,\n", + " 'measured_runtime_v1': 0.0655883436,\n", + " 'runtime_lift': 4.8220170785,\n", + " 'key': ['s545310428', 's792744532']},\n", + " {'user_id': 'u562016607',\n", + " 'problem_id': 'p04021',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's141985189',\n", + " 'submission_id_v1': 's196716457',\n", + " 'cpu_time_v0': 455,\n", + " 'cpu_time_v1': 352,\n", + " 'memory_v0': 20612,\n", + " 'memory_v1': 18400,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.64,\n", + " 'input': 'import numpy as np\\n\\nN=int(eval(input()))\\n\\nA=[int(eval(input())) for i in range(N)]\\n\\nB=list(np.argsort(np.array(A)))\\n\\nX=[[0,0],[0,0]]\\n\\nfor i in range(N):\\n\\n X[i%2][B[i]%2]+=1\\n\\nprint((X[0][1]))\\n',\n", + " 'target': 'N=int(eval(input()))\\n\\nA=[int(eval(input())) for i in range(N)]\\n\\nAT=[(A[i],i) for i in range(N)]\\n\\nAT.sort()\\n\\nB=[AT[i][1] for i in range(N)]\\n\\nX=[[0,0],[0,0]]\\n\\nfor i in range(N):\\n\\n X[i%2][B[i]%2]+=1\\n\\nY=[X[0][1],X[1][0]]\\n\\nprint((min(Y)))\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 180,\n", + " 'code_v1_num_chars': 223,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = [int(eval(input())) for i in range(N)]\\nB = list(np.argsort(np.array(A)))\\nX = [[0, 0], [0, 0]]\\nfor i in range(N):\\n X[i % 2][B[i] % 2] += 1\\nprint((X[0][1]))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [int(eval(input())) for i in range(N)]\\nAT = [(A[i], i) for i in range(N)]\\nAT.sort()\\nB = [AT[i][1] for i in range(N)]\\nX = [[0, 0], [0, 0]]\\nfor i in range(N):\\n X[i % 2][B[i] % 2] += 1\\nY = [X[0][1], X[1][0]]\\nprint((min(Y)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-B = list(np.argsort(np.array(A)))',\n", + " '+AT = [(A[i], i) for i in range(N)]',\n", + " '+AT.sort()',\n", + " '+B = [AT[i][1] for i in range(N)]',\n", + " '-print((X[0][1]))',\n", + " '+Y = [X[0][1], X[1][0]]',\n", + " '+print((min(Y)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.1501710873,\n", + " 'measured_runtime_v1': 0.2093672077,\n", + " 'runtime_lift': 5.4935589007,\n", + " 'key': ['s141985189', 's196716457']},\n", + " {'user_id': 'u392319141',\n", + " 'problem_id': 'p03208',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's260498412',\n", + " 'submission_id_v1': 's755290756',\n", + " 'cpu_time_v0': 275,\n", + " 'cpu_time_v1': 243,\n", + " 'memory_v0': 7384,\n", + " 'memory_v1': 7484,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.64,\n", + " 'input': \"N, K = list(map(int, input().split()))\\n\\n\\n\\nheight = []\\n\\nfor _ in range(N) :\\n\\n height.append(int(eval(input())))\\n\\n\\n\\nheight.sort()\\n\\nans = float('inf')\\n\\n\\n\\nfor i in range(N-K+1) :\\n\\n diff = height[i + K - 1] - height[i]\\n\\n ans = min(ans, diff)\\n\\n\\n\\nprint(ans)\",\n", + " 'target': 'N, K = list(map(int, input().split()))\\n\\nH = [int(eval(input())) for _ in range(N)]\\n\\nH.sort()\\n\\n\\n\\nans = 10**18\\n\\nfor i in range(N - K + 1):\\n\\n ans = min(ans, H[i + K - 1] - H[i])\\n\\nprint(ans)',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 247,\n", + " 'code_v1_num_chars': 177,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\nheight = []\\nfor _ in range(N):\\n height.append(int(eval(input())))\\nheight.sort()\\nans = float(\"inf\")\\nfor i in range(N - K + 1):\\n diff = height[i + K - 1] - height[i]\\n ans = min(ans, diff)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nH = [int(eval(input())) for _ in range(N)]\\nH.sort()\\nans = 10**18\\nfor i in range(N - K + 1):\\n ans = min(ans, H[i + K - 1] - H[i])\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.8571428571,\n", + " 'diff': ['-height = []',\n", + " '-for _ in range(N):',\n", + " '- height.append(int(eval(input())))',\n", + " '-height.sort()',\n", + " '-ans = float(\"inf\")',\n", + " '+H = [int(eval(input())) for _ in range(N)]',\n", + " '+H.sort()',\n", + " '+ans = 10**18',\n", + " '- diff = height[i + K - 1] - height[i]',\n", + " '- ans = min(ans, diff)',\n", + " '+ ans = min(ans, H[i + K - 1] - H[i])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2545773742,\n", + " 'measured_runtime_v1': 0.0892174052,\n", + " 'runtime_lift': 2.8534496549,\n", + " 'key': ['s260498412', 's755290756']},\n", + " {'user_id': 'u638456847',\n", + " 'problem_id': 'p02685',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's295745028',\n", + " 'submission_id_v1': 's749223274',\n", + " 'cpu_time_v0': 1095,\n", + " 'cpu_time_v1': 852,\n", + " 'memory_v0': 32948,\n", + " 'memory_v1': 9220,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.19,\n", + " 'input': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\nfac = [1, 1] # 元テーブル\\n\\nf_inv = [1, 1] # 逆元テーブル\\n\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\n\\n\\ndef prepare(n, mod):\\n\\n for i in range(2, n+1):\\n\\n fac.append((fac[-1] * i) % mod)\\n\\n inv.append((-inv[mod % i] * (mod//i)) % mod)\\n\\n f_inv.append((f_inv[-1] * inv[-1]) % mod)\\n\\n\\n\\ndef cmb(n, r, mod):\\n\\n if n < 0 or r < 0:\\n\\n return 0\\n\\n if r > n:\\n\\n return 0\\n\\n\\n\\n return fac[n] * f_inv[r] * f_inv[n-r] % mod\\n\\n\\n\\n\\n\\ndef main():\\n\\n N,M,K = list(map(int, readline().split()))\\n\\n\\n\\n MOD = 998244353\\n\\n prepare(N + 10, MOD)\\n\\n\\n\\n if M == 1 and K == N - 1:\\n\\n print((1))\\n\\n exit()\\n\\n\\n\\n m = M\\n\\n for _ in range(N-1):\\n\\n m *= M - 1\\n\\n m %= MOD\\n\\n\\n\\n ans = 0\\n\\n for k in range(K+1):\\n\\n ans += (m * cmb(N-1, k, MOD)) % MOD\\n\\n ans %= MOD\\n\\n\\n\\n m *= pow(M-1, MOD-2, MOD)\\n\\n m %= MOD\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\n# 0^0 = 1\\n\\n\\n\\ndef main():\\n\\n N,M,K = list(map(int, readline().split()))\\n\\n\\n\\n MOD = 998244353\\n\\n\\n\\n if M == 1:\\n\\n if K == N - 1:\\n\\n print((1))\\n\\n else:\\n\\n print((0))\\n\\n exit()\\n\\n\\n\\n m = pow(M-1, N-1, MOD)\\n\\n m_1_inv = pow(M-1, MOD-2, MOD)\\n\\n comb = 1\\n\\n ans = comb * m\\n\\n for k in range(1,K+1):\\n\\n m *= m_1_inv\\n\\n m %= MOD\\n\\n comb *= N - k\\n\\n comb %= MOD\\n\\n comb *= pow(k, MOD-2, MOD)\\n\\n \\n\\n ans += (m * comb) % MOD\\n\\n ans %= MOD\\n\\n\\n\\n print((ans * M % MOD))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 52,\n", + " 'code_v1_loc': 38,\n", + " 'code_v0_num_chars': 1010,\n", + " 'code_v1_num_chars': 691,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nfac = [1, 1] # 元テーブル\\nf_inv = [1, 1] # 逆元テーブル\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\n\\ndef prepare(n, mod):\\n for i in range(2, n + 1):\\n fac.append((fac[-1] * i) % mod)\\n inv.append((-inv[mod % i] * (mod // i)) % mod)\\n f_inv.append((f_inv[-1] * inv[-1]) % mod)\\n\\n\\ndef cmb(n, r, mod):\\n if n < 0 or r < 0:\\n return 0\\n if r > n:\\n return 0\\n return fac[n] * f_inv[r] * f_inv[n - r] % mod\\n\\n\\ndef main():\\n N, M, K = list(map(int, readline().split()))\\n MOD = 998244353\\n prepare(N + 10, MOD)\\n if M == 1 and K == N - 1:\\n print((1))\\n exit()\\n m = M\\n for _ in range(N - 1):\\n m *= M - 1\\n m %= MOD\\n ans = 0\\n for k in range(K + 1):\\n ans += (m * cmb(N - 1, k, MOD)) % MOD\\n ans %= MOD\\n m *= pow(M - 1, MOD - 2, MOD)\\n m %= MOD\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\n# 0^0 = 1\\ndef main():\\n N, M, K = list(map(int, readline().split()))\\n MOD = 998244353\\n if M == 1:\\n if K == N - 1:\\n print((1))\\n else:\\n print((0))\\n exit()\\n m = pow(M - 1, N - 1, MOD)\\n m_1_inv = pow(M - 1, MOD - 2, MOD)\\n comb = 1\\n ans = comb * m\\n for k in range(1, K + 1):\\n m *= m_1_inv\\n m %= MOD\\n comb *= N - k\\n comb %= MOD\\n comb *= pow(k, MOD - 2, MOD)\\n ans += (m * comb) % MOD\\n ans %= MOD\\n print((ans * M % MOD))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.9230769231,\n", + " 'diff': ['-fac = [1, 1] # 元テーブル',\n", + " '-f_inv = [1, 1] # 逆元テーブル',\n", + " '-inv = [0, 1] # 逆元テーブル計算用テーブル',\n", + " '-',\n", + " '-',\n", + " '-def prepare(n, mod):',\n", + " '- for i in range(2, n + 1):',\n", + " '- fac.append((fac[-1] * i) % mod)',\n", + " '- inv.append((-inv[mod % i] * (mod // i)) % mod)',\n", + " '- f_inv.append((f_inv[-1] * inv[-1]) % mod)',\n", + " '-',\n", + " '-',\n", + " '-def cmb(n, r, mod):',\n", + " '- if n < 0 or r < 0:',\n", + " '- return 0',\n", + " '- if r > n:',\n", + " '- return 0',\n", + " '- return fac[n] * f_inv[r] * f_inv[n - r] % mod',\n", + " '-',\n", + " '-',\n", + " '+# 0^0 = 1',\n", + " '- prepare(N + 10, MOD)',\n", + " '- if M == 1 and K == N - 1:',\n", + " '- print((1))',\n", + " '+ if M == 1:',\n", + " '+ if K == N - 1:',\n", + " '+ print((1))',\n", + " '+ else:',\n", + " '+ print((0))',\n", + " '- m = M',\n", + " '- for _ in range(N - 1):',\n", + " '- m *= M - 1',\n", + " '+ m = pow(M - 1, N - 1, MOD)',\n", + " '+ m_1_inv = pow(M - 1, MOD - 2, MOD)',\n", + " '+ comb = 1',\n", + " '+ ans = comb * m',\n", + " '+ for k in range(1, K + 1):',\n", + " '+ m *= m_1_inv',\n", + " '- ans = 0',\n", + " '- for k in range(K + 1):',\n", + " '- ans += (m * cmb(N - 1, k, MOD)) % MOD',\n", + " '+ comb *= N - k',\n", + " '+ comb %= MOD',\n", + " '+ comb *= pow(k, MOD - 2, MOD)',\n", + " '+ ans += (m * comb) % MOD',\n", + " '- m *= pow(M - 1, MOD - 2, MOD)',\n", + " '- m %= MOD',\n", + " '- print(ans)',\n", + " '+ print((ans * M % MOD))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.9888417046,\n", + " 'measured_runtime_v1': 0.3609299815,\n", + " 'runtime_lift': 2.7397050823,\n", + " 'key': ['s295745028', 's749223274']},\n", + " {'user_id': 'u593934357',\n", + " 'problem_id': 'p02952',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's443742997',\n", + " 'submission_id_v1': 's952596957',\n", + " 'cpu_time_v0': 201,\n", + " 'cpu_time_v1': 89,\n", + " 'memory_v0': 51968,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.72,\n", + " 'input': 'n_str = eval(input())\\n\\nn_int = int(n_str)\\n\\n# 1 ~ 50000\\n\\n# 桁数が奇数= 1桁, 3桁, 5桁\\n\\n# 1 ~ 9, 100 ~ 999,10000 ~ 99999の90909個しかないので全探索いけるか?\\n\\nexs_list = []\\n\\nfor i in range(1, 100000):\\n\\n if len(str(i)) % 2 == 1:\\n\\n exs_list.append(i)\\n\\n\\n\\nexs = {i: i for i in exs_list}\\n\\n\\n\\nn_s = []\\n\\nans = 0\\n\\nfor i in range(1, n_int + 1):\\n\\n if len(str(i)) % 2 == 0:\\n\\n continue\\n\\n if i in exs:\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n',\n", + " 'target': 'def digit_sum(n):\\n\\n # 各桁の和を求める\\n\\n # 計算量: O(logN)\\n\\n ans = 0\\n\\n while n > 0:\\n\\n ans += 1\\n\\n n //= 10\\n\\n return ans\\n\\n\\n\\nn = int(eval(input()))\\n\\ncnt = 0\\n\\n\\n\\nfor i in range(1, n+1):\\n\\n cnt += digit_sum(i) % 2\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 420,\n", + " 'code_v1_num_chars': 236,\n", + " 'code_v0_no_empty_lines': 'n_str = eval(input())\\nn_int = int(n_str)\\n# 1 ~ 50000\\n# 桁数が奇数= 1桁, 3桁, 5桁\\n# 1 ~ 9, 100 ~ 999,10000 ~ 99999の90909個しかないので全探索いけるか?\\nexs_list = []\\nfor i in range(1, 100000):\\n if len(str(i)) % 2 == 1:\\n exs_list.append(i)\\nexs = {i: i for i in exs_list}\\nn_s = []\\nans = 0\\nfor i in range(1, n_int + 1):\\n if len(str(i)) % 2 == 0:\\n continue\\n if i in exs:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def digit_sum(n):\\n # 各桁の和を求める\\n # 計算量: O(logN)\\n ans = 0\\n while n > 0:\\n ans += 1\\n n //= 10\\n return ans\\n\\n\\nn = int(eval(input()))\\ncnt = 0\\nfor i in range(1, n + 1):\\n cnt += digit_sum(i) % 2\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 38.4615384615,\n", + " 'diff': ['-n_str = eval(input())',\n", + " '-n_int = int(n_str)',\n", + " '-# 1 ~ 50000',\n", + " '-# 桁数が奇数= 1桁, 3桁, 5桁',\n", + " '-# 1 ~ 9, 100 ~ 999,10000 ~ 99999の90909個しかないので全探索いけるか?',\n", + " '-exs_list = []',\n", + " '-for i in range(1, 100000):',\n", + " '- if len(str(i)) % 2 == 1:',\n", + " '- exs_list.append(i)',\n", + " '-exs = {i: i for i in exs_list}',\n", + " '-n_s = []',\n", + " '-ans = 0',\n", + " '-for i in range(1, n_int + 1):',\n", + " '- if len(str(i)) % 2 == 0:',\n", + " '- continue',\n", + " '- if i in exs:',\n", + " '+def digit_sum(n):',\n", + " '+ # 各桁の和を求める',\n", + " '+ # 計算量: O(logN)',\n", + " '+ ans = 0',\n", + " '+ while n > 0:',\n", + " '-print(ans)',\n", + " '+ n //= 10',\n", + " '+ return ans',\n", + " '+',\n", + " '+',\n", + " '+n = int(eval(input()))',\n", + " '+cnt = 0',\n", + " '+for i in range(1, n + 1):',\n", + " '+ cnt += digit_sum(i) % 2',\n", + " '+print(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.187838645,\n", + " 'measured_runtime_v1': 0.4033198857,\n", + " 'runtime_lift': 2.9451526864,\n", + " 'key': ['s443742997', 's952596957']},\n", + " {'user_id': 'u133936772',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's323963688',\n", + " 'submission_id_v1': 's220101257',\n", + " 'cpu_time_v0': 187,\n", + " 'cpu_time_v1': 70,\n", + " 'memory_v0': 3828,\n", + " 'memory_v1': 3828,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.57,\n", + " 'input': 'mod = 10**9+7\\n\\nn, m = list(map(int, input().split()))\\n\\nl = [0]*n\\n\\nfor _ in range(m):\\n\\n l[int(eval(input()))-1] = 1\\n\\n\\n\\ns = 0\\n\\nt = 1\\n\\n\\n\\nfor i in range(n):\\n\\n if l[i] > 0:\\n\\n t, s = 0, t\\n\\n else:\\n\\n t, s = (s+t)%mod, t\\n\\n\\n\\nprint(t)',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nmod = 10**9+7\\n\\nn, m = list(map(int, input().split()))\\n\\nl = [0]*n\\n\\nfor _ in range(m):\\n\\n l[int(eval(input()))-1] = 1\\n\\n\\n\\nt, s = 1, 0\\n\\n\\n\\nfor i in range(n):\\n\\n if l[i]:\\n\\n t, s = 0, t\\n\\n else:\\n\\n t, s = (s+t)%mod, t\\n\\n\\n\\nprint(t)',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 220,\n", + " 'code_v1_num_chars': 257,\n", + " 'code_v0_no_empty_lines': 'mod = 10**9 + 7\\nn, m = list(map(int, input().split()))\\nl = [0] * n\\nfor _ in range(m):\\n l[int(eval(input())) - 1] = 1\\ns = 0\\nt = 1\\nfor i in range(n):\\n if l[i] > 0:\\n t, s = 0, t\\n else:\\n t, s = (s + t) % mod, t\\nprint(t)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nmod = 10**9 + 7\\nn, m = list(map(int, input().split()))\\nl = [0] * n\\nfor _ in range(m):\\n l[int(eval(input())) - 1] = 1\\nt, s = 1, 0\\nfor i in range(n):\\n if l[i]:\\n t, s = 0, t\\n else:\\n t, s = (s + t) % mod, t\\nprint(t)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '+input = sys.stdin.readline',\n", + " '-s = 0',\n", + " '-t = 1',\n", + " '+t, s = 1, 0',\n", + " '- if l[i] > 0:',\n", + " '+ if l[i]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3071881404,\n", + " 'measured_runtime_v1': 0.1884790037,\n", + " 'runtime_lift': 1.6298268475,\n", + " 'key': ['s323963688', 's220101257']},\n", + " {'user_id': 'u671446913',\n", + " 'problem_id': 'p02916',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's992896151',\n", + " 'submission_id_v1': 's662353537',\n", + " 'cpu_time_v0': 309,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 21428,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 94.5,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nA = list(np.array(A) - 1)\\n\\nB = list(map(int, input().split()))\\n\\nC = list(map(int, input().split()))\\n\\n\\n\\nsum_ = 0\\n\\ndiff = list(np.array(A[1:]) - np.array(A[:-1]))\\n\\ndiff.insert(0, -1)\\n\\nfor i in range(N):\\n\\n sum_ += B[A[i]]\\n\\n \\n\\n if diff[i] == 1:\\n\\n sum_ += C[A[i-1]]\\n\\n \\n\\nprint(sum_)',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nB = list(map(int, input().split()))\\n\\nC = list(map(int, input().split()))\\n\\n\\n\\nans = 0\\n\\nfor i in range(len(A)):\\n\\n ans += B[A[i]-1]\\n\\n\\n\\n if i != 0:\\n\\n if A[i-1] + 1 == A[i]:\\n\\n ans += C[A[i-1]-1]\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 358,\n", + " 'code_v1_num_chars': 267,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nA = list(np.array(A) - 1)\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nsum_ = 0\\ndiff = list(np.array(A[1:]) - np.array(A[:-1]))\\ndiff.insert(0, -1)\\nfor i in range(N):\\n sum_ += B[A[i]]\\n if diff[i] == 1:\\n sum_ += C[A[i - 1]]\\nprint(sum_)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nans = 0\\nfor i in range(len(A)):\\n ans += B[A[i] - 1]\\n if i != 0:\\n if A[i - 1] + 1 == A[i]:\\n ans += C[A[i - 1] - 1]\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.6470588235,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = list(np.array(A) - 1)',\n", + " '-sum_ = 0',\n", + " '-diff = list(np.array(A[1:]) - np.array(A[:-1]))',\n", + " '-diff.insert(0, -1)',\n", + " '-for i in range(N):',\n", + " '- sum_ += B[A[i]]',\n", + " '- if diff[i] == 1:',\n", + " '- sum_ += C[A[i - 1]]',\n", + " '-print(sum_)',\n", + " '+ans = 0',\n", + " '+for i in range(len(A)):',\n", + " '+ ans += B[A[i] - 1]',\n", + " '+ if i != 0:',\n", + " '+ if A[i - 1] + 1 == A[i]:',\n", + " '+ ans += C[A[i - 1] - 1]',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4381271441,\n", + " 'measured_runtime_v1': 0.189556915,\n", + " 'runtime_lift': 7.5867828071,\n", + " 'key': ['s992896151', 's662353537']},\n", + " {'user_id': 'u025501820',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's746150122',\n", + " 'submission_id_v1': 's989284284',\n", + " 'cpu_time_v0': 318,\n", + " 'cpu_time_v1': 169,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 46.86,\n", + " 'input': 'N = int(eval(input()))\\n\\ncount = [[0 for _ in range(9)] for _ in range(9)]\\n\\nfor i in range(1, N + 1):\\n\\n if str(i)[0] != \"0\" and str(i)[-1] != \"0\":\\n\\n count[int(str(i)[0]) - 1][int(str(i)[-1]) - 1] += 1\\n\\nans = 0\\n\\nfor i in range(0, 9):\\n\\n for k in range(0, 9):\\n\\n ans += count[i][k] * count[k][i]\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\nnums = [0 for i in range(100)]\\n\\nfor i in range(1, N + 1):\\n\\n i = str(i)\\n\\n nums[int(i[0] + i[-1])] += 1\\n\\nans = 0\\n\\nfor i in range(1, 10):\\n\\n for j in range(i, 10):\\n\\n i = str(i)\\n\\n j = str(j)\\n\\n if i != j:\\n\\n ans += nums[int(i + j)] * nums[int(j + i)] * 2\\n\\n else:\\n\\n n = nums[int(i + j)]\\n\\n ans += n * (n - 1)\\n\\n ans += n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 316,\n", + " 'code_v1_num_chars': 421,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\ncount = [[0 for _ in range(9)] for _ in range(9)]\\nfor i in range(1, N + 1):\\n if str(i)[0] != \"0\" and str(i)[-1] != \"0\":\\n count[int(str(i)[0]) - 1][int(str(i)[-1]) - 1] += 1\\nans = 0\\nfor i in range(0, 9):\\n for k in range(0, 9):\\n ans += count[i][k] * count[k][i]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nnums = [0 for i in range(100)]\\nfor i in range(1, N + 1):\\n i = str(i)\\n nums[int(i[0] + i[-1])] += 1\\nans = 0\\nfor i in range(1, 10):\\n for j in range(i, 10):\\n i = str(i)\\n j = str(j)\\n if i != j:\\n ans += nums[int(i + j)] * nums[int(j + i)] * 2\\n else:\\n n = nums[int(i + j)]\\n ans += n * (n - 1)\\n ans += n\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.1764705882,\n", + " 'diff': ['-count = [[0 for _ in range(9)] for _ in range(9)]',\n", + " '+nums = [0 for i in range(100)]',\n", + " '- if str(i)[0] != \"0\" and str(i)[-1] != \"0\":',\n", + " '- count[int(str(i)[0]) - 1][int(str(i)[-1]) - 1] += 1',\n", + " '+ i = str(i)',\n", + " '+ nums[int(i[0] + i[-1])] += 1',\n", + " '-for i in range(0, 9):',\n", + " '- for k in range(0, 9):',\n", + " '- ans += count[i][k] * count[k][i]',\n", + " '+for i in range(1, 10):',\n", + " '+ for j in range(i, 10):',\n", + " '+ i = str(i)',\n", + " '+ j = str(j)',\n", + " '+ if i != j:',\n", + " '+ ans += nums[int(i + j)] * nums[int(j + i)] * 2',\n", + " '+ else:',\n", + " '+ n = nums[int(i + j)]',\n", + " '+ ans += n * (n - 1)',\n", + " '+ ans += n'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4702084679,\n", + " 'measured_runtime_v1': 0.3054097801,\n", + " 'runtime_lift': 1.5395985934,\n", + " 'key': ['s746150122', 's989284284']},\n", + " {'user_id': 'u922449550',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's475401488',\n", + " 'submission_id_v1': 's941984259',\n", + " 'cpu_time_v0': 197,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3188,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.37,\n", + " 'input': 'N = int(eval(input()))\\n\\n\\n\\ntable = [[0]*10 for i in range(10)]\\n\\n\\n\\nfor i in range(1, N+1):\\n\\n s = str(i)\\n\\n id1 = int(s[0])\\n\\n id2 = int(s[-1])\\n\\n table[id1][id2] += 1\\n\\n\\n\\nans = 0\\n\\nfor i in range(10):\\n\\n for j in range(10):\\n\\n ans += table[i][j]*table[j][i]\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'N = eval(input())\\n\\nm = len(N)\\n\\n\\n\\na0 = int(N[0])\\n\\na1 = int(N[-1])\\n\\n\\n\\nans = 0\\n\\nif m == 1:\\n\\n ans = int(N)\\n\\nelse:\\n\\n mid = (int(N[1:]) - a1)//10\\n\\n t = 10**(m-2)\\n\\n ans = 9\\n\\n ans += ((a0-1)*t) * 2\\n\\n ans += (mid + (a1>=a0)) * 2\\n\\n ans += ((a0-1)*t)**2\\n\\n ans += ((mid*(a0-1) + min(a0-1, a1))*t) * 2\\n\\n ans += (mid + (a1>=a0))**2\\n\\n if m >= 3:\\n\\n ans += (t - 1) * 2\\n\\n ans += ((a0-1)*(t - 1)*t) * 2\\n\\n ans += (mid * (t - 1)) * 2\\n\\n ans += (a1 * (t - 1)//9) * 2\\n\\n ans += (t - 1)**2\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 264,\n", + " 'code_v1_num_chars': 496,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\ntable = [[0] * 10 for i in range(10)]\\nfor i in range(1, N + 1):\\n s = str(i)\\n id1 = int(s[0])\\n id2 = int(s[-1])\\n table[id1][id2] += 1\\nans = 0\\nfor i in range(10):\\n for j in range(10):\\n ans += table[i][j] * table[j][i]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = eval(input())\\nm = len(N)\\na0 = int(N[0])\\na1 = int(N[-1])\\nans = 0\\nif m == 1:\\n ans = int(N)\\nelse:\\n mid = (int(N[1:]) - a1) // 10\\n t = 10 ** (m - 2)\\n ans = 9\\n ans += ((a0 - 1) * t) * 2\\n ans += (mid + (a1 >= a0)) * 2\\n ans += ((a0 - 1) * t) ** 2\\n ans += ((mid * (a0 - 1) + min(a0 - 1, a1)) * t) * 2\\n ans += (mid + (a1 >= a0)) ** 2\\n if m >= 3:\\n ans += (t - 1) * 2\\n ans += ((a0 - 1) * (t - 1) * t) * 2\\n ans += (mid * (t - 1)) * 2\\n ans += (a1 * (t - 1) // 9) * 2\\n ans += (t - 1) ** 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 38.4615384615,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-table = [[0] * 10 for i in range(10)]',\n", + " '-for i in range(1, N + 1):',\n", + " '- s = str(i)',\n", + " '- id1 = int(s[0])',\n", + " '- id2 = int(s[-1])',\n", + " '- table[id1][id2] += 1',\n", + " '+N = eval(input())',\n", + " '+m = len(N)',\n", + " '+a0 = int(N[0])',\n", + " '+a1 = int(N[-1])',\n", + " '-for i in range(10):',\n", + " '- for j in range(10):',\n", + " '- ans += table[i][j] * table[j][i]',\n", + " '+if m == 1:',\n", + " '+ ans = int(N)',\n", + " '+else:',\n", + " '+ mid = (int(N[1:]) - a1) // 10',\n", + " '+ t = 10 ** (m - 2)',\n", + " '+ ans = 9',\n", + " '+ ans += ((a0 - 1) * t) * 2',\n", + " '+ ans += (mid + (a1 >= a0)) * 2',\n", + " '+ ans += ((a0 - 1) * t) ** 2',\n", + " '+ ans += ((mid * (a0 - 1) + min(a0 - 1, a1)) * t) * 2',\n", + " '+ ans += (mid + (a1 >= a0)) ** 2',\n", + " '+ if m >= 3:',\n", + " '+ ans += (t - 1) * 2',\n", + " '+ ans += ((a0 - 1) * (t - 1) * t) * 2',\n", + " '+ ans += (mid * (t - 1)) * 2',\n", + " '+ ans += (a1 * (t - 1) // 9) * 2',\n", + " '+ ans += (t - 1) ** 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.589133962,\n", + " 'measured_runtime_v1': 0.3507217311,\n", + " 'runtime_lift': 1.6797760439,\n", + " 'key': ['s475401488', 's941984259']},\n", + " {'user_id': 'u298297089',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's106132375',\n", + " 'submission_id_v1': 's827937559',\n", + " 'cpu_time_v0': 122,\n", + " 'cpu_time_v1': 72,\n", + " 'memory_v0': 4148,\n", + " 'memory_v1': 3828,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.98,\n", + " 'input': 'N = int(eval(input()))\\n\\nx = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor i in x:\\n\\n while i % 2 == 0:\\n\\n cnt += 1\\n\\n i /= 2\\n\\nprint(cnt)',\n", + " 'target': 'n = int(eval(input()))\\n\\nans = 0\\n\\nfor i in map(int, input().split()):\\n\\n cnt = 0\\n\\n while i % 2 == 0:\\n\\n i >>= 1\\n\\n cnt += 1\\n\\n ans += cnt\\n\\nprint(ans)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 134,\n", + " 'code_v1_num_chars': 161,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nx = list(map(int, input().split()))\\ncnt = 0\\nfor i in x:\\n while i % 2 == 0:\\n cnt += 1\\n i /= 2\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 0\\nfor i in map(int, input().split()):\\n cnt = 0\\n while i % 2 == 0:\\n i >>= 1\\n cnt += 1\\n ans += cnt\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-x = list(map(int, input().split()))',\n", + " '-cnt = 0',\n", + " '-for i in x:',\n", + " '+n = int(eval(input()))',\n", + " '+ans = 0',\n", + " '+for i in map(int, input().split()):',\n", + " '+ cnt = 0',\n", + " '+ i >>= 1',\n", + " '- i /= 2',\n", + " '-print(cnt)',\n", + " '+ ans += cnt',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2336064763,\n", + " 'measured_runtime_v1': 0.0059840708,\n", + " 'runtime_lift': 39.0380536239,\n", + " 'key': ['s106132375', 's827937559']},\n", + " {'user_id': 'u545368057',\n", + " 'problem_id': 'p02537',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's842030357',\n", + " 'submission_id_v1': 's767194684',\n", + " 'cpu_time_v0': 1764,\n", + " 'cpu_time_v1': 1543,\n", + " 'memory_v0': 141700,\n", + " 'memory_v1': 111052,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.53,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nn,k = list(map(int, input().split()))\\n\\nAs = [int(eval(input())) for i in range(n)]\\n\\n\\n\\n# N: 処理する区間の長さ\\n\\n\\n\\nINF = 0\\n\\n\\n\\nmx = 300001\\n\\nLV = (mx-1).bit_length()\\n\\nN0 = 2**LV\\n\\ndata = [INF]*(2*N0)\\n\\nlazy = [None]*(2*N0)\\n\\n\\n\\n# 伝搬対象の区間を求める\\n\\ndef gindex(l, r):\\n\\n L = (l + N0) >> 1; R = (r + N0) >> 1\\n\\n lc = 0 if l & 1 else (L & -L).bit_length()\\n\\n rc = 0 if r & 1 else (R & -R).bit_length()\\n\\n for i in range(LV):\\n\\n if rc <= i:\\n\\n yield R\\n\\n if L < R and lc <= i:\\n\\n yield L\\n\\n L >>= 1; R >>= 1\\n\\n\\n\\n# 遅延伝搬処理\\n\\ndef propagates(*ids):\\n\\n for i in reversed(ids):\\n\\n v = lazy[i-1]\\n\\n if v is None:\\n\\n continue\\n\\n lazy[2*i-1] = data[2*i-1] = lazy[2*i] = data[2*i] = v\\n\\n lazy[i-1] = None\\n\\n\\n\\n# 区間[l, r)をxで更新\\n\\ndef update(l, r, x):\\n\\n *ids, = gindex(l, r)\\n\\n propagates(*ids)\\n\\n\\n\\n L = N0 + l; R = N0 + r\\n\\n while L < R:\\n\\n if R & 1:\\n\\n R -= 1\\n\\n lazy[R-1] = data[R-1] = x\\n\\n if L & 1:\\n\\n lazy[L-1] = data[L-1] = x\\n\\n L += 1\\n\\n L >>= 1; R >>= 1\\n\\n for i in ids:\\n\\n data[i-1] = max(data[2*i-1], data[2*i])\\n\\n\\n\\n# 区間[l, r)内の最小値を求める\\n\\ndef query(l, r):\\n\\n propagates(*gindex(l, r))\\n\\n L = N0 + l; R = N0 + r\\n\\n\\n\\n s = INF\\n\\n while L < R:\\n\\n if R & 1:\\n\\n R -= 1\\n\\n s = max(s, data[R-1])\\n\\n if L & 1:\\n\\n s = max(s, data[L-1])\\n\\n L += 1\\n\\n L >>= 1; R >>= 1\\n\\n return s\\n\\n\\n\\nupdate(As[0],As[0]+1,1)\\n\\nfor i, a in enumerate(As[1:]):\\n\\n l = max(0,a-k)\\n\\n r = min(mx,a+k)\\n\\n upd = query(l,r+1)\\n\\n if upd == -1:continue\\n\\n # print(\"i\",i,\"a\",a,\"upd\",upd,\"l\",l,\"r\",r)\\n\\n update(a, a+1, upd+1)\\n\\n\\n\\nans = 0\\n\\nfor a in set(As):\\n\\n ans = max(ans,query(a,a+1))\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nn,k = list(map(int, input().split()))\\n\\nAs = [int(eval(input())) for i in range(n)]\\n\\n\\n\\n# N: 処理する区間の長さ\\n\\n\\n\\nINF = 0\\n\\n\\n\\nmx = 300001\\n\\nLV = (mx-1).bit_length()\\n\\nN0 = 2**LV\\n\\ndata = [INF]*(2*N0)\\n\\nlazy = [None]*(2*N0)\\n\\n\\n\\n# 伝搬対象の区間を求める\\n\\ndef gindex(l, r):\\n\\n L = (l + N0) >> 1; R = (r + N0) >> 1\\n\\n lc = 0 if l & 1 else (L & -L).bit_length()\\n\\n rc = 0 if r & 1 else (R & -R).bit_length()\\n\\n for i in range(LV):\\n\\n if rc <= i:\\n\\n yield R\\n\\n if L < R and lc <= i:\\n\\n yield L\\n\\n L >>= 1; R >>= 1\\n\\n\\n\\n# 遅延伝搬処理\\n\\ndef propagates(*ids):\\n\\n for i in reversed(ids):\\n\\n v = lazy[i-1]\\n\\n if v is None:\\n\\n continue\\n\\n lazy[2*i-1] = data[2*i-1] = lazy[2*i] = data[2*i] = v\\n\\n lazy[i-1] = None\\n\\n\\n\\n# 区間[l, r)をxで更新\\n\\ndef update(l, r, x):\\n\\n *ids, = gindex(l, r)\\n\\n propagates(*ids)\\n\\n\\n\\n L = N0 + l; R = N0 + r\\n\\n while L < R:\\n\\n if R & 1:\\n\\n R -= 1\\n\\n lazy[R-1] = data[R-1] = x\\n\\n if L & 1:\\n\\n lazy[L-1] = data[L-1] = x\\n\\n L += 1\\n\\n L >>= 1; R >>= 1\\n\\n for i in ids:\\n\\n data[i-1] = max(data[2*i-1], data[2*i])\\n\\n\\n\\n# 区間[l, r)内の最小値を求める\\n\\ndef query(l, r):\\n\\n propagates(*gindex(l, r))\\n\\n L = N0 + l; R = N0 + r\\n\\n\\n\\n s = INF\\n\\n while L < R:\\n\\n if R & 1:\\n\\n R -= 1\\n\\n s = max(s, data[R-1])\\n\\n if L & 1:\\n\\n s = max(s, data[L-1])\\n\\n L += 1\\n\\n L >>= 1; R >>= 1\\n\\n return s\\n\\n\\n\\nans = 0\\n\\nupdate(As[0],As[0]+1,1)\\n\\nfor i, a in enumerate(As[1:]):\\n\\n l = max(0,a-k)\\n\\n r = min(mx,a+k)\\n\\n upd = query(l,r+1)\\n\\n if upd == -1:continue\\n\\n # print(\"i\",i,\"a\",a,\"upd\",upd,\"l\",l,\"r\",r)\\n\\n update(a, a+1, upd+1)\\n\\n ans = max(ans, upd+1)\\n\\nprint(ans)\\n\\n\\n',\n", + " 'code_v0_loc': 83,\n", + " 'code_v1_loc': 82,\n", + " 'code_v0_num_chars': 1786,\n", + " 'code_v1_num_chars': 1762,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nn, k = list(map(int, input().split()))\\nAs = [int(eval(input())) for i in range(n)]\\n# N: 処理する区間の長さ\\nINF = 0\\nmx = 300001\\nLV = (mx - 1).bit_length()\\nN0 = 2**LV\\ndata = [INF] * (2 * N0)\\nlazy = [None] * (2 * N0)\\n# 伝搬対象の区間を求める\\ndef gindex(l, r):\\n L = (l + N0) >> 1\\n R = (r + N0) >> 1\\n lc = 0 if l & 1 else (L & -L).bit_length()\\n rc = 0 if r & 1 else (R & -R).bit_length()\\n for i in range(LV):\\n if rc <= i:\\n yield R\\n if L < R and lc <= i:\\n yield L\\n L >>= 1\\n R >>= 1\\n\\n\\n# 遅延伝搬処理\\ndef propagates(*ids):\\n for i in reversed(ids):\\n v = lazy[i - 1]\\n if v is None:\\n continue\\n lazy[2 * i - 1] = data[2 * i - 1] = lazy[2 * i] = data[2 * i] = v\\n lazy[i - 1] = None\\n\\n\\n# 区間[l, r)をxで更新\\ndef update(l, r, x):\\n (*ids,) = gindex(l, r)\\n propagates(*ids)\\n L = N0 + l\\n R = N0 + r\\n while L < R:\\n if R & 1:\\n R -= 1\\n lazy[R - 1] = data[R - 1] = x\\n if L & 1:\\n lazy[L - 1] = data[L - 1] = x\\n L += 1\\n L >>= 1\\n R >>= 1\\n for i in ids:\\n data[i - 1] = max(data[2 * i - 1], data[2 * i])\\n\\n\\n# 区間[l, r)内の最小値を求める\\ndef query(l, r):\\n propagates(*gindex(l, r))\\n L = N0 + l\\n R = N0 + r\\n s = INF\\n while L < R:\\n if R & 1:\\n R -= 1\\n s = max(s, data[R - 1])\\n if L & 1:\\n s = max(s, data[L - 1])\\n L += 1\\n L >>= 1\\n R >>= 1\\n return s\\n\\n\\nupdate(As[0], As[0] + 1, 1)\\nfor i, a in enumerate(As[1:]):\\n l = max(0, a - k)\\n r = min(mx, a + k)\\n upd = query(l, r + 1)\\n if upd == -1:\\n continue\\n # print(\"i\",i,\"a\",a,\"upd\",upd,\"l\",l,\"r\",r)\\n update(a, a + 1, upd + 1)\\nans = 0\\nfor a in set(As):\\n ans = max(ans, query(a, a + 1))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nn, k = list(map(int, input().split()))\\nAs = [int(eval(input())) for i in range(n)]\\n# N: 処理する区間の長さ\\nINF = 0\\nmx = 300001\\nLV = (mx - 1).bit_length()\\nN0 = 2**LV\\ndata = [INF] * (2 * N0)\\nlazy = [None] * (2 * N0)\\n# 伝搬対象の区間を求める\\ndef gindex(l, r):\\n L = (l + N0) >> 1\\n R = (r + N0) >> 1\\n lc = 0 if l & 1 else (L & -L).bit_length()\\n rc = 0 if r & 1 else (R & -R).bit_length()\\n for i in range(LV):\\n if rc <= i:\\n yield R\\n if L < R and lc <= i:\\n yield L\\n L >>= 1\\n R >>= 1\\n\\n\\n# 遅延伝搬処理\\ndef propagates(*ids):\\n for i in reversed(ids):\\n v = lazy[i - 1]\\n if v is None:\\n continue\\n lazy[2 * i - 1] = data[2 * i - 1] = lazy[2 * i] = data[2 * i] = v\\n lazy[i - 1] = None\\n\\n\\n# 区間[l, r)をxで更新\\ndef update(l, r, x):\\n (*ids,) = gindex(l, r)\\n propagates(*ids)\\n L = N0 + l\\n R = N0 + r\\n while L < R:\\n if R & 1:\\n R -= 1\\n lazy[R - 1] = data[R - 1] = x\\n if L & 1:\\n lazy[L - 1] = data[L - 1] = x\\n L += 1\\n L >>= 1\\n R >>= 1\\n for i in ids:\\n data[i - 1] = max(data[2 * i - 1], data[2 * i])\\n\\n\\n# 区間[l, r)内の最小値を求める\\ndef query(l, r):\\n propagates(*gindex(l, r))\\n L = N0 + l\\n R = N0 + r\\n s = INF\\n while L < R:\\n if R & 1:\\n R -= 1\\n s = max(s, data[R - 1])\\n if L & 1:\\n s = max(s, data[L - 1])\\n L += 1\\n L >>= 1\\n R >>= 1\\n return s\\n\\n\\nans = 0\\nupdate(As[0], As[0] + 1, 1)\\nfor i, a in enumerate(As[1:]):\\n l = max(0, a - k)\\n r = min(mx, a + k)\\n upd = query(l, r + 1)\\n if upd == -1:\\n continue\\n # print(\"i\",i,\"a\",a,\"upd\",upd,\"l\",l,\"r\",r)\\n update(a, a + 1, upd + 1)\\n ans = max(ans, upd + 1)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 1.2048192771,\n", + " 'diff': ['+ans = 0',\n", + " '-ans = 0',\n", + " '-for a in set(As):',\n", + " '- ans = max(ans, query(a, a + 1))',\n", + " '+ ans = max(ans, upd + 1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.820688494,\n", + " 'measured_runtime_v1': 0.5116031129,\n", + " 'runtime_lift': 1.6041507043,\n", + " 'key': ['s842030357', 's767194684']},\n", + " {'user_id': 'u867826040',\n", + " 'problem_id': 'p03721',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's719602965',\n", + " 'submission_id_v1': 's173376033',\n", + " 'cpu_time_v0': 194,\n", + " 'cpu_time_v1': 151,\n", + " 'memory_v0': 76876,\n", + " 'memory_v1': 16524,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.16,\n", + " 'input': 'n,k = list(map(int,input().split()))\\n\\nl = [0]*(10**5+1)\\n\\nfor i in range(n):\\n\\n ai,bi = list(map(int,input().split()))\\n\\n l[ai]+=bi\\n\\nfor index,i in enumerate(l):\\n\\n if i:\\n\\n k-=i\\n\\n if k<=0:\\n\\n break\\n\\nprint(index)',\n", + " 'target': 'from collections import defaultdict\\n\\nfrom sys import stdin\\n\\ninput = stdin.readline\\n\\nd = defaultdict(int)\\n\\nn,k = list(map(int,input().split()))\\n\\nfor _ in range(n):\\n\\n a,b = list(map(int,input().split()))\\n\\n d[a]+=b\\n\\nfor key in sorted(d.keys()):\\n\\n v = d[key]\\n\\n k-=v\\n\\n if k <= 0:\\n\\n break\\n\\nprint(key)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 228,\n", + " 'code_v1_num_chars': 304,\n", + " 'code_v0_no_empty_lines': 'n, k = list(map(int, input().split()))\\nl = [0] * (10**5 + 1)\\nfor i in range(n):\\n ai, bi = list(map(int, input().split()))\\n l[ai] += bi\\nfor index, i in enumerate(l):\\n if i:\\n k -= i\\n if k <= 0:\\n break\\nprint(index)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\nfrom sys import stdin\\n\\ninput = stdin.readline\\nd = defaultdict(int)\\nn, k = list(map(int, input().split()))\\nfor _ in range(n):\\n a, b = list(map(int, input().split()))\\n d[a] += b\\nfor key in sorted(d.keys()):\\n v = d[key]\\n k -= v\\n if k <= 0:\\n break\\nprint(key)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['+from collections import defaultdict',\n", + " '+from sys import stdin',\n", + " '+',\n", + " '+input = stdin.readline',\n", + " '+d = defaultdict(int)',\n", + " '-l = [0] * (10**5 + 1)',\n", + " '-for i in range(n):',\n", + " '- ai, bi = list(map(int, input().split()))',\n", + " '- l[ai] += bi',\n", + " '-for index, i in enumerate(l):',\n", + " '- if i:',\n", + " '- k -= i',\n", + " '- if k <= 0:',\n", + " '- break',\n", + " '-print(index)',\n", + " '+for _ in range(n):',\n", + " '+ a, b = list(map(int, input().split()))',\n", + " '+ d[a] += b',\n", + " '+for key in sorted(d.keys()):',\n", + " '+ v = d[key]',\n", + " '+ k -= v',\n", + " '+ if k <= 0:',\n", + " '+ break',\n", + " '+print(key)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5501943195,\n", + " 'measured_runtime_v1': 0.4111647634,\n", + " 'runtime_lift': 1.3381358727,\n", + " 'key': ['s719602965', 's173376033']},\n", + " {'user_id': 'u349449706',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's796837031',\n", + " 'submission_id_v1': 's077713004',\n", + " 'cpu_time_v0': 96,\n", + " 'cpu_time_v1': 64,\n", + " 'memory_v0': 68168,\n", + " 'memory_v1': 63448,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.33,\n", + " 'input': 'S = int(eval(input()))\\n\\nf = [0]*(S+1)\\n\\nf[0] = 1\\n\\nif S >= 3: f[3] = 1\\n\\nif S >= 4: f[4] = 1\\n\\nif S >= 5: f[5] = 1\\n\\nfor i in range(6, S+1):\\n\\n f[i] = sum(f[i-j] for j in range(3, i+1))%(10**9+7)\\n\\nprint((f[S]))\\n',\n", + " 'target': 'S=int(eval(input()))\\n\\nf=[1,0,0]\\n\\nfor i in range(S-2):f.append(f[i]+f[i+2])\\n\\nprint((f[S]%(10**9+7)))\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 200,\n", + " 'code_v1_num_chars': 92,\n", + " 'code_v0_no_empty_lines': 'S = int(eval(input()))\\nf = [0] * (S + 1)\\nf[0] = 1\\nif S >= 3:\\n f[3] = 1\\nif S >= 4:\\n f[4] = 1\\nif S >= 5:\\n f[5] = 1\\nfor i in range(6, S + 1):\\n f[i] = sum(f[i - j] for j in range(3, i + 1)) % (10**9 + 7)\\nprint((f[S]))\\n',\n", + " 'code_v1_no_empty_lines': 'S = int(eval(input()))\\nf = [1, 0, 0]\\nfor i in range(S - 2):\\n f.append(f[i] + f[i + 2])\\nprint((f[S] % (10**9 + 7)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.5555555556,\n", + " 'diff': ['-f = [0] * (S + 1)',\n", + " '-f[0] = 1',\n", + " '-if S >= 3:',\n", + " '- f[3] = 1',\n", + " '-if S >= 4:',\n", + " '- f[4] = 1',\n", + " '-if S >= 5:',\n", + " '- f[5] = 1',\n", + " '-for i in range(6, S + 1):',\n", + " '- f[i] = sum(f[i - j] for j in range(3, i + 1)) % (10**9 + 7)',\n", + " '-print((f[S]))',\n", + " '+f = [1, 0, 0]',\n", + " '+for i in range(S - 2):',\n", + " '+ f.append(f[i] + f[i + 2])',\n", + " '+print((f[S] % (10**9 + 7)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5486869376,\n", + " 'measured_runtime_v1': 0.341561399,\n", + " 'runtime_lift': 1.6064079231,\n", + " 'key': ['s796837031', 's077713004']},\n", + " {'user_id': 'u982591663',\n", + " 'problem_id': 'p03107',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's749413264',\n", + " 'submission_id_v1': 's028114766',\n", + " 'cpu_time_v0': 22,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 3956,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.64,\n", + " 'input': 'S = list(eval(input()))\\n\\nnum_one = S.count(\"1\")\\n\\nnum_zero = S.count(\"0\")\\n\\nans = min(num_one, num_zero) *2\\n\\nprint(ans)\\n',\n", + " 'target': 'S = eval(input())\\n\\n\\n\\nans = min(S.count(\"0\"), S.count(\"1\")) * 2\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 112,\n", + " 'code_v1_num_chars': 69,\n", + " 'code_v0_no_empty_lines': 'S = list(eval(input()))\\nnum_one = S.count(\"1\")\\nnum_zero = S.count(\"0\")\\nans = min(num_one, num_zero) * 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nans = min(S.count(\"0\"), S.count(\"1\")) * 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-S = list(eval(input()))',\n", + " '-num_one = S.count(\"1\")',\n", + " '-num_zero = S.count(\"0\")',\n", + " '-ans = min(num_one, num_zero) * 2',\n", + " '+S = eval(input())',\n", + " '+ans = min(S.count(\"0\"), S.count(\"1\")) * 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2118026633,\n", + " 'measured_runtime_v1': 0.0063807995,\n", + " 'runtime_lift': 33.1937497698,\n", + " 'key': ['s749413264', 's028114766']},\n", + " {'user_id': 'u633068244',\n", + " 'problem_id': 'p00827',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's400923829',\n", + " 'submission_id_v1': 's127207739',\n", + " 'cpu_time_v0': 2670,\n", + " 'cpu_time_v1': 1630,\n", + " 'memory_v0': 4240,\n", + " 'memory_v1': 4240,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 38.95,\n", + " 'input': 'def judge(x,y):\\n\\n global xx,yy,xy,axby\\n\\n if min(x,y) >= 0 and x+y <= xy:\\n\\n if x+y < xy or (x+y == xy and a*x+b*y < axby):\\n\\n xy = x+y\\n\\n axby = a*x+b*y\\n\\n xx,yy = x,y\\n\\n \\n\\nwhile 1:\\n\\n a,b,d = list(map(int,input().split()))\\n\\n if a == 0: break\\n\\n xy = axby = 10**10\\n\\n for y in range(50001):\\n\\n if (d+b*y)%a == 0: judge((d+b*y)/a,y)\\n\\n if (b*y-d)%a == 0: judge((b*y-d)/a,y)\\n\\n if (d-b*y)%a == 0: judge((d-b*y)/a,y)\\n\\n print(xx,yy)',\n", + " 'target': 'def judge(x,y):\\n\\n global xx,yy,xy,axby\\n\\n if min(x,y) >= 0 and x+y <= xy:\\n\\n if x+y < xy or (x+y == xy and a*x+b*y < axby):\\n\\n xy = x+y\\n\\n axby = a*x+b*y\\n\\n xx,yy = x,y\\n\\n \\n\\nwhile 1:\\n\\n a,b,d = list(map(int,input().split()))\\n\\n if a == 0: break\\n\\n xy = axby = 10**10\\n\\n for y in range(30001):\\n\\n if (d+b*y)%a == 0: judge((d+b*y)/a,y)\\n\\n if (b*y-d)%a == 0: judge((b*y-d)/a,y)\\n\\n if (d-b*y)%a == 0: judge((d-b*y)/a,y)\\n\\n print(xx,yy)',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 500,\n", + " 'code_v1_num_chars': 500,\n", + " 'code_v0_no_empty_lines': 'def judge(x, y):\\n global xx, yy, xy, axby\\n if min(x, y) >= 0 and x + y <= xy:\\n if x + y < xy or (x + y == xy and a * x + b * y < axby):\\n xy = x + y\\n axby = a * x + b * y\\n xx, yy = x, y\\n\\n\\nwhile 1:\\n a, b, d = list(map(int, input().split()))\\n if a == 0:\\n break\\n xy = axby = 10**10\\n for y in range(50001):\\n if (d + b * y) % a == 0:\\n judge((d + b * y) / a, y)\\n if (b * y - d) % a == 0:\\n judge((b * y - d) / a, y)\\n if (d - b * y) % a == 0:\\n judge((d - b * y) / a, y)\\n print(xx, yy)\\n',\n", + " 'code_v1_no_empty_lines': 'def judge(x, y):\\n global xx, yy, xy, axby\\n if min(x, y) >= 0 and x + y <= xy:\\n if x + y < xy or (x + y == xy and a * x + b * y < axby):\\n xy = x + y\\n axby = a * x + b * y\\n xx, yy = x, y\\n\\n\\nwhile 1:\\n a, b, d = list(map(int, input().split()))\\n if a == 0:\\n break\\n xy = axby = 10**10\\n for y in range(30001):\\n if (d + b * y) % a == 0:\\n judge((d + b * y) / a, y)\\n if (b * y - d) % a == 0:\\n judge((b * y - d) / a, y)\\n if (d - b * y) % a == 0:\\n judge((d - b * y) / a, y)\\n print(xx, yy)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- for y in range(50001):', '+ for y in range(30001):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.061502672,\n", + " 'measured_runtime_v1': 1.2161544886,\n", + " 'runtime_lift': 1.6950993409,\n", + " 'key': ['s400923829', 's127207739']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03436',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's361663353',\n", + " 'submission_id_v1': 's061031658',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.67,\n", + " 'input': \"from collections import deque\\n\\n\\n\\nINF = float('inf')\\n\\n\\n\\ndr = (-1, 0, 0, 1)\\n\\ndc = (0, -1, 1, 0)\\n\\n\\n\\nH, W = list(map(int, input().split()))\\n\\n\\n\\ns = []\\n\\ntotal_white_count = 0\\n\\nfor _ in range(H):\\n\\n t = eval(input())\\n\\n s.append(t)\\n\\n total_white_count += t.count('.')\\n\\np = [[INF for _ in range(W)] for _ in range(H)]\\n\\n\\n\\nans = -1\\n\\n\\n\\ndq = deque()\\n\\ndq.append((0, 0, 1))\\n\\nwhile dq:\\n\\n r, c, d = dq.popleft() # 直した\\n\\n\\n\\n nd = d + 1\\n\\n for i in range(4):\\n\\n nr = r + dr[i]\\n\\n nc = c + dc[i]\\n\\n if not (0 <= nr < H and 0 <= nc < W): continue\\n\\n if s[nr][nc] == '#' : continue\\n\\n if p[nr][nc] <= nd: continue\\n\\n p[nr][nc] = nd\\n\\n if nr == H - 1 and nc == W - 1:\\n\\n ans = total_white_count - nd\\n\\n break\\n\\n dq.append((nr, nc, nd))\\n\\n else:\\n\\n continue\\n\\n break\\n\\n\\n\\nprint(ans)\\n\",\n", + " 'target': \"def main():\\n\\n from collections import deque\\n\\n import sys\\n\\n\\n\\n input = sys.stdin.readline\\n\\n\\n\\n h, w = list(map(int, input().split()))\\n\\n s = [eval(input()) for _ in range(h)]\\n\\n\\n\\n bk = 0\\n\\n for row in s:\\n\\n bk += row.count('#')\\n\\n\\n\\n def coods(r, c):\\n\\n if r > 0: yield r - 1, c\\n\\n if r < h - 1: yield r + 1, c\\n\\n if c > 0: yield r, c - 1\\n\\n if c < w - 1: yield r, c + 1\\n\\n\\n\\n q = deque()\\n\\n q.append((0, 0))\\n\\n count = [[-1] * w for _ in range(h)]\\n\\n count[0][0] = 1\\n\\n while q:\\n\\n r, c = q.popleft()\\n\\n k = count[r][c]\\n\\n for nr, nc in coods(r, c):\\n\\n nchar = s[nr][nc]\\n\\n if nchar == '#': continue\\n\\n if count[nr][nc] != -1: continue\\n\\n count[nr][nc] = k + 1\\n\\n if (nr, nc) == (h - 1, w - 1):\\n\\n print((h * w - (k + 1) - bk))\\n\\n return\\n\\n q.append((nr, nc))\\n\\n print((-1))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 41,\n", + " 'code_v1_loc': 40,\n", + " 'code_v0_num_chars': 837,\n", + " 'code_v1_num_chars': 967,\n", + " 'code_v0_no_empty_lines': 'from collections import deque\\n\\nINF = float(\"inf\")\\ndr = (-1, 0, 0, 1)\\ndc = (0, -1, 1, 0)\\nH, W = list(map(int, input().split()))\\ns = []\\ntotal_white_count = 0\\nfor _ in range(H):\\n t = eval(input())\\n s.append(t)\\n total_white_count += t.count(\".\")\\np = [[INF for _ in range(W)] for _ in range(H)]\\nans = -1\\ndq = deque()\\ndq.append((0, 0, 1))\\nwhile dq:\\n r, c, d = dq.popleft() # 直した\\n nd = d + 1\\n for i in range(4):\\n nr = r + dr[i]\\n nc = c + dc[i]\\n if not (0 <= nr < H and 0 <= nc < W):\\n continue\\n if s[nr][nc] == \"#\":\\n continue\\n if p[nr][nc] <= nd:\\n continue\\n p[nr][nc] = nd\\n if nr == H - 1 and nc == W - 1:\\n ans = total_white_count - nd\\n break\\n dq.append((nr, nc, nd))\\n else:\\n continue\\n break\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n from collections import deque\\n import sys\\n\\n input = sys.stdin.readline\\n h, w = list(map(int, input().split()))\\n s = [eval(input()) for _ in range(h)]\\n bk = 0\\n for row in s:\\n bk += row.count(\"#\")\\n\\n def coods(r, c):\\n if r > 0:\\n yield r - 1, c\\n if r < h - 1:\\n yield r + 1, c\\n if c > 0:\\n yield r, c - 1\\n if c < w - 1:\\n yield r, c + 1\\n\\n q = deque()\\n q.append((0, 0))\\n count = [[-1] * w for _ in range(h)]\\n count[0][0] = 1\\n while q:\\n r, c = q.popleft()\\n k = count[r][c]\\n for nr, nc in coods(r, c):\\n nchar = s[nr][nc]\\n if nchar == \"#\":\\n continue\\n if count[nr][nc] != -1:\\n continue\\n count[nr][nc] = k + 1\\n if (nr, nc) == (h - 1, w - 1):\\n print((h * w - (k + 1) - bk))\\n return\\n q.append((nr, nc))\\n print((-1))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.4390243902,\n", + " 'diff': ['-from collections import deque',\n", + " '+def main():',\n", + " '+ from collections import deque',\n", + " '+ import sys',\n", + " '-INF = float(\"inf\")',\n", + " '-dr = (-1, 0, 0, 1)',\n", + " '-dc = (0, -1, 1, 0)',\n", + " '-H, W = list(map(int, input().split()))',\n", + " '-s = []',\n", + " '-total_white_count = 0',\n", + " '-for _ in range(H):',\n", + " '- t = eval(input())',\n", + " '- s.append(t)',\n", + " '- total_white_count += t.count(\".\")',\n", + " '-p = [[INF for _ in range(W)] for _ in range(H)]',\n", + " '-ans = -1',\n", + " '-dq = deque()',\n", + " '-dq.append((0, 0, 1))',\n", + " '-while dq:',\n", + " '- r, c, d = dq.popleft() # 直した',\n", + " '- nd = d + 1',\n", + " '- for i in range(4):',\n", + " '- nr = r + dr[i]',\n", + " '- nc = c + dc[i]',\n", + " '- if not (0 <= nr < H and 0 <= nc < W):',\n", + " '- continue',\n", + " '- if s[nr][nc] == \"#\":',\n", + " '- continue',\n", + " '- if p[nr][nc] <= nd:',\n", + " '- continue',\n", + " '- p[nr][nc] = nd',\n", + " '- if nr == H - 1 and nc == W - 1:',\n", + " '- ans = total_white_count - nd',\n", + " '- break',\n", + " '- dq.append((nr, nc, nd))',\n", + " '- else:',\n", + " '- continue',\n", + " '- break',\n", + " '-print(ans)',\n", + " '+ input = sys.stdin.readline',\n", + " '+ h, w = list(map(int, input().split()))',\n", + " '+ s = [eval(input()) for _ in range(h)]',\n", + " '+ bk = 0',\n", + " '+ for row in s:',\n", + " '+ bk += row.count(\"#\")',\n", + " '+',\n", + " '+ def coods(r, c):',\n", + " '+ if r > 0:',\n", + " '+ yield r - 1, c',\n", + " '+ if r < h - 1:',\n", + " '+ yield r + 1, c',\n", + " '+ if c > 0:',\n", + " '+ yield r, c - 1',\n", + " '+ if c < w - 1:',\n", + " '+ yield r, c + 1',\n", + " '+',\n", + " '+ q = deque()',\n", + " '+ q.append((0, 0))',\n", + " '+ count = [[-1] * w for _ in range(h)]',\n", + " '+ count[0][0] = 1',\n", + " '+ while q:',\n", + " '+ r, c = q.popleft()',\n", + " '+ k = count[r][c]',\n", + " '+ for nr, nc in coods(r, c):',\n", + " '+ nchar = s[nr][nc]',\n", + " '+ if nchar == \"#\":',\n", + " '+ continue',\n", + " '+ if count[nr][nc] != -1:',\n", + " '+ continue',\n", + " '+ count[nr][nc] = k + 1',\n", + " '+ if (nr, nc) == (h - 1, w - 1):',\n", + " '+ print((h * w - (k + 1) - bk))',\n", + " '+ return',\n", + " '+ q.append((nr, nc))',\n", + " '+ print((-1))',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.172286804,\n", + " 'measured_runtime_v1': 0.0058592412,\n", + " 'runtime_lift': 29.4042857085,\n", + " 'key': ['s361663353', 's061031658']},\n", + " {'user_id': 'u542605091',\n", + " 'problem_id': 'p02880',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's300843143',\n", + " 'submission_id_v1': 's824414586',\n", + " 'cpu_time_v0': 148,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12496,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.51,\n", + " 'input': \"import numpy as np\\n\\nimport math\\n\\n\\n\\ndef bigger_devisor(n):\\n\\n s = np.sqrt(n)\\n\\n i = math.ceil(s)\\n\\n while(n % i != 0):\\n\\n i += 1\\n\\n return i\\n\\n\\n\\nn = int(eval(input()))\\n\\nif bigger_devisor(n) > 9:\\n\\n print('No')\\n\\nelse:\\n\\n print('Yes')\",\n", + " 'target': \"n = int(eval(input()))\\n\\nans = 0\\n\\nfor i in range(1, 10):\\n\\n if n % i == 0:\\n\\n if n / i < 10:\\n\\n ans = 1\\n\\nif ans == 0:\\n\\n print('No')\\n\\nelse:\\n\\n print('Yes')\",\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 226,\n", + " 'code_v1_num_chars': 154,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport math\\n\\n\\ndef bigger_devisor(n):\\n s = np.sqrt(n)\\n i = math.ceil(s)\\n while n % i != 0:\\n i += 1\\n return i\\n\\n\\nn = int(eval(input()))\\nif bigger_devisor(n) > 9:\\n print(\"No\")\\nelse:\\n print(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 0\\nfor i in range(1, 10):\\n if n % i == 0:\\n if n / i < 10:\\n ans = 1\\nif ans == 0:\\n print(\"No\")\\nelse:\\n print(\"Yes\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-import math',\n", + " '-',\n", + " '-',\n", + " '-def bigger_devisor(n):',\n", + " '- s = np.sqrt(n)',\n", + " '- i = math.ceil(s)',\n", + " '- while n % i != 0:',\n", + " '- i += 1',\n", + " '- return i',\n", + " '-',\n", + " '-',\n", + " '-if bigger_devisor(n) > 9:',\n", + " '+ans = 0',\n", + " '+for i in range(1, 10):',\n", + " '+ if n % i == 0:',\n", + " '+ if n / i < 10:',\n", + " '+ ans = 1',\n", + " '+if ans == 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5299629567,\n", + " 'measured_runtime_v1': 0.1968936365,\n", + " 'runtime_lift': 7.7705048475,\n", + " 'key': ['s300843143', 's824414586']},\n", + " {'user_id': 'u227082700',\n", + " 'problem_id': 'p02863',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's340691380',\n", + " 'submission_id_v1': 's390961057',\n", + " 'cpu_time_v0': 541,\n", + " 'cpu_time_v1': 362,\n", + " 'memory_v0': 216520,\n", + " 'memory_v1': 217248,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.09,\n", + " 'input': 'n,t=list(map(int,input().split()))\\n\\nab=[list(map(int,input().split()))for _ in range(n)]\\n\\nab.sort()\\n\\ndp=[(6007)*[0]for _ in range(n+1)]\\n\\ndp[0][0]=0\\n\\nans=0\\n\\nfor i in range(n):\\n\\n for j in range(6007):\\n\\n dp[i+1][j]=max(dp[i+1][j],dp[i][j])\\n\\n if j k:break\\n\\n dp[ii] = \"First\"\\n\\nprint((dp[-1]))\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 271,\n", + " 'code_v1_num_chars': 271,\n", + " 'code_v0_no_empty_lines': 'n, k = list(map(int, input().split()))\\na_s = list(map(int, input().split()))\\ndp = [\"Second\"] * (k + 1)\\nfor i in range(k + 1):\\n if dp[i] == \"Second\":\\n for a in a_s:\\n ii = i + a\\n if ii <= k:\\n dp[ii] = \"First\"\\nprint((dp[-1]))\\n',\n", + " 'code_v1_no_empty_lines': 'n, k = list(map(int, input().split()))\\na_s = list(map(int, input().split()))\\ndp = [\"Second\"] * (k + 1)\\nfor i in range(k + 1):\\n if dp[i] == \"Second\":\\n for a in a_s:\\n ii = i + a\\n if ii > k:\\n break\\n dp[ii] = \"First\"\\nprint((dp[-1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- if ii <= k:',\n", + " '- dp[ii] = \"First\"',\n", + " '+ if ii > k:',\n", + " '+ break',\n", + " '+ dp[ii] = \"First\"'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3611531999,\n", + " 'measured_runtime_v1': 0.2298232606,\n", + " 'runtime_lift': 1.5714388476,\n", + " 'key': ['s365373544', 's835744397']},\n", + " {'user_id': 'u884323674',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's486102959',\n", + " 'submission_id_v1': 's507293588',\n", + " 'cpu_time_v0': 228,\n", + " 'cpu_time_v1': 129,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.42,\n", + " 'input': 'A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\nmax_iter = max(X, Y) * 2\\n\\nans = float(\"inf\")\\n\\nfor i in range(max_iter):\\n\\n a = max(X - i, 0)\\n\\n b = max(Y - i, 0)\\n\\n price = 2*C * i + A * a + B * b\\n\\n ans = min(ans, price)\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\nans = float(\"inf\")\\n\\nfor i in range(max(X, Y)+1):\\n\\n x = max(X - i, 0)\\n\\n y = max(Y - i, 0)\\n\\n cost = 2*C * i + A * x + B * y\\n\\n ans = min(ans, cost)\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 240,\n", + " 'code_v1_num_chars': 215,\n", + " 'code_v0_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nmax_iter = max(X, Y) * 2\\nans = float(\"inf\")\\nfor i in range(max_iter):\\n a = max(X - i, 0)\\n b = max(Y - i, 0)\\n price = 2 * C * i + A * a + B * b\\n ans = min(ans, price)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in range(max(X, Y) + 1):\\n x = max(X - i, 0)\\n y = max(Y - i, 0)\\n cost = 2 * C * i + A * x + B * y\\n ans = min(ans, cost)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-max_iter = max(X, Y) * 2',\n", + " '-for i in range(max_iter):',\n", + " '- a = max(X - i, 0)',\n", + " '- b = max(Y - i, 0)',\n", + " '- price = 2 * C * i + A * a + B * b',\n", + " '- ans = min(ans, price)',\n", + " '+for i in range(max(X, Y) + 1):',\n", + " '+ x = max(X - i, 0)',\n", + " '+ y = max(Y - i, 0)',\n", + " '+ cost = 2 * C * i + A * x + B * y',\n", + " '+ ans = min(ans, cost)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4454369638,\n", + " 'measured_runtime_v1': 0.3371012073,\n", + " 'runtime_lift': 1.321374573,\n", + " 'key': ['s486102959', 's507293588']},\n", + " {'user_id': 'u060793972',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's517275230',\n", + " 'submission_id_v1': 's191136547',\n", + " 'cpu_time_v0': 69,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 9100,\n", + " 'memory_v1': 9100,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 46.38,\n", + " 'input': 'x = int(eval(input()))\\n\\nfor i in range(-200,201):\\n\\n for j in range(-200,201):\\n\\n if (i**5)-(j**5)==x:\\n\\n print((i,j))\\n\\n exit()\\n',\n", + " 'target': 'x = int(eval(input()))\\n\\nfor i in range(-120,121):\\n\\n for j in range(-120,121):\\n\\n if (i**5)-(j**5)==x:\\n\\n print((i,j))\\n\\n exit()\\n',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 149,\n", + " 'code_v1_num_chars': 149,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(-200, 201):\\n for j in range(-200, 201):\\n if (i**5) - (j**5) == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(-120, 121):\\n for j in range(-120, 121):\\n if (i**5) - (j**5) == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in range(-200, 201):',\n", + " '- for j in range(-200, 201):',\n", + " '+for i in range(-120, 121):',\n", + " '+ for j in range(-120, 121):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5919232865,\n", + " 'measured_runtime_v1': 0.3199627697,\n", + " 'runtime_lift': 1.8499755049,\n", + " 'key': ['s517275230', 's191136547']},\n", + " {'user_id': 'u460245024',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's770002751',\n", + " 'submission_id_v1': 's323286862',\n", + " 'cpu_time_v0': 51,\n", + " 'cpu_time_v1': 32,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.25,\n", + " 'input': 'A, B = list(map(int, input().split()))\\n\\n\\n\\ncnt = 0\\n\\nfor n in range(A, B+1):\\n\\n n_s = str(n)\\n\\n n_s_rvs = n_s[::-1]\\n\\n if n_s == n_s_rvs:\\n\\n cnt += 1\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'target': 'A, B = list(map(int, input().split()))\\n\\n\\n\\ncnt = 0\\n\\nfor n in range(A, B+1):\\n\\n if n//10000 == n%10 and (n//1000)%10 == (n//10)%10:\\n\\n cnt += 1\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 168,\n", + " 'code_v1_num_chars': 158,\n", + " 'code_v0_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncnt = 0\\nfor n in range(A, B + 1):\\n n_s = str(n)\\n n_s_rvs = n_s[::-1]\\n if n_s == n_s_rvs:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncnt = 0\\nfor n in range(A, B + 1):\\n if n // 10000 == n % 10 and (n // 1000) % 10 == (n // 10) % 10:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['- n_s = str(n)',\n", + " '- n_s_rvs = n_s[::-1]',\n", + " '- if n_s == n_s_rvs:',\n", + " '+ if n // 10000 == n % 10 and (n // 1000) % 10 == (n // 10) % 10:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3429904201,\n", + " 'measured_runtime_v1': 0.2179555298,\n", + " 'runtime_lift': 1.5736715671,\n", + " 'key': ['s770002751', 's323286862']},\n", + " {'user_id': 'u762420987',\n", + " 'problem_id': 'p03759',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's246152829',\n", + " 'submission_id_v1': 's501080791',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': 'a, b, c = list(map(int, input().split()))\\n\\nif (b - a) == (c - b):\\n\\n print(\"YES\")\\n\\nelse:\\n\\n print(\"NO\")',\n", + " 'target': 'a, b, c = list(map(int, input().split()))\\n\\nif b - a == c - b:\\n\\n print(\"YES\")\\n\\nelse:\\n\\n print(\"NO\")',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 101,\n", + " 'code_v1_num_chars': 97,\n", + " 'code_v0_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\nif (b - a) == (c - b):\\n print(\"YES\")\\nelse:\\n print(\"NO\")\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\nif b - a == c - b:\\n print(\"YES\")\\nelse:\\n print(\"NO\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-if (b - a) == (c - b):', '+if b - a == c - b:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1914725397,\n", + " 'measured_runtime_v1': 0.0060755644,\n", + " 'runtime_lift': 31.5151856242,\n", + " 'key': ['s246152829', 's501080791']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03634',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's143869460',\n", + " 'submission_id_v1': 's902304606',\n", + " 'cpu_time_v0': 731,\n", + " 'cpu_time_v1': 602,\n", + " 'memory_v0': 163764,\n", + " 'memory_v1': 59480,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.65,\n", + " 'input': \"# bellman_ford : O(V E)\\n\\n# dijkstra : O(E log V), 負辺は無理\\n\\n# warshall_floyd : O(V**3)\\n\\n\\n\\nimport sys\\n\\n\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef solve():\\n\\n inf = 10 ** 14 + 10\\n\\n\\n\\n def dfs(v: 'vertex_index, 0-indexed') -> None:\\n\\n for c, t in e[v]:\\n\\n if d[t] != inf:\\n\\n continue\\n\\n d[t] = d[v] + c\\n\\n dfs(t)\\n\\n\\n\\n n = int(eval(input()))\\n\\n e = tuple(set() for _ in range(n))\\n\\n for _ in range(n - 1):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n e[a].add((c, b))\\n\\n e[b].add((c, a))\\n\\n\\n\\n q, v = list(map(int, input().split()))\\n\\n v -= 1\\n\\n\\n\\n d = [inf] * n\\n\\n d[v] = 0\\n\\n\\n\\n dfs(v)\\n\\n\\n\\n for _ in range(q):\\n\\n x, y = list(map(int, input().split()))\\n\\n x -= 1\\n\\n y -= 1\\n\\n print((d[x] + d[y]))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n solve()\\n\",\n", + " 'target': \"# bellman_ford : O(V E)\\n\\n# dijkstra : O(E log V), 負辺は無理\\n\\n# warshall_floyd : O(V**3)\\n\\n# deque\\n\\n\\n\\nfrom collections import deque\\n\\nimport sys\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef solve():\\n\\n inf = 10 ** 14 + 10\\n\\n\\n\\n n = int(eval(input()))\\n\\n e = tuple(set() for _ in range(n))\\n\\n for _ in range(n - 1):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n e[a].add((c, b))\\n\\n e[b].add((c, a))\\n\\n\\n\\n q, v = list(map(int, input().split()))\\n\\n v -= 1\\n\\n\\n\\n d = [inf] * n\\n\\n d[v] = 0\\n\\n\\n\\n dq = deque()\\n\\n for cost, to in e[v]:\\n\\n dq.append((cost, to, v))\\n\\n # (cost, to, parent)\\n\\n\\n\\n while dq:\\n\\n c, v, p = dq.popleft()\\n\\n if d[v] != inf:\\n\\n continue\\n\\n d[v] = d[p] + c\\n\\n for cost, to in e[v]:\\n\\n if to == p:\\n\\n continue\\n\\n dq.append((cost, to, v))\\n\\n \\n\\n for _ in range(q):\\n\\n x, y = list(map(int, input().split()))\\n\\n x -= 1\\n\\n y -= 1\\n\\n print((d[x] + d[y]))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n solve()\\n\",\n", + " 'code_v0_loc': 46,\n", + " 'code_v1_loc': 53,\n", + " 'code_v0_num_chars': 883,\n", + " 'code_v1_num_chars': 1056,\n", + " 'code_v0_no_empty_lines': '# bellman_ford : O(V E)\\n# dijkstra : O(E log V), 負辺は無理\\n# warshall_floyd : O(V**3)\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\ninput = sys.stdin.readline\\n\\n\\ndef solve():\\n inf = 10**14 + 10\\n\\n def dfs(v: \"vertex_index, 0-indexed\") -> None:\\n for c, t in e[v]:\\n if d[t] != inf:\\n continue\\n d[t] = d[v] + c\\n dfs(t)\\n\\n n = int(eval(input()))\\n e = tuple(set() for _ in range(n))\\n for _ in range(n - 1):\\n a, b, c = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n e[a].add((c, b))\\n e[b].add((c, a))\\n q, v = list(map(int, input().split()))\\n v -= 1\\n d = [inf] * n\\n d[v] = 0\\n dfs(v)\\n for _ in range(q):\\n x, y = list(map(int, input().split()))\\n x -= 1\\n y -= 1\\n print((d[x] + d[y]))\\n\\n\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_v1_no_empty_lines': '# bellman_ford : O(V E)\\n# dijkstra : O(E log V), 負辺は無理\\n# warshall_floyd : O(V**3)\\n# deque\\nfrom collections import deque\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef solve():\\n inf = 10**14 + 10\\n n = int(eval(input()))\\n e = tuple(set() for _ in range(n))\\n for _ in range(n - 1):\\n a, b, c = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n e[a].add((c, b))\\n e[b].add((c, a))\\n q, v = list(map(int, input().split()))\\n v -= 1\\n d = [inf] * n\\n d[v] = 0\\n dq = deque()\\n for cost, to in e[v]:\\n dq.append((cost, to, v))\\n # (cost, to, parent)\\n while dq:\\n c, v, p = dq.popleft()\\n if d[v] != inf:\\n continue\\n d[v] = d[p] + c\\n for cost, to in e[v]:\\n if to == p:\\n continue\\n dq.append((cost, to, v))\\n for _ in range(q):\\n x, y = list(map(int, input().split()))\\n x -= 1\\n y -= 1\\n print((d[x] + d[y]))\\n\\n\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.2075471698,\n", + " 'diff': ['+# deque',\n", + " '+from collections import deque',\n", + " '-sys.setrecursionlimit(10**7)',\n", + " '-',\n", + " '- def dfs(v: \"vertex_index, 0-indexed\") -> None:',\n", + " '- for c, t in e[v]:',\n", + " '- if d[t] != inf:',\n", + " '- continue',\n", + " '- d[t] = d[v] + c',\n", + " '- dfs(t)',\n", + " '-',\n", + " '- dfs(v)',\n", + " '+ dq = deque()',\n", + " '+ for cost, to in e[v]:',\n", + " '+ dq.append((cost, to, v))',\n", + " '+ # (cost, to, parent)',\n", + " '+ while dq:',\n", + " '+ c, v, p = dq.popleft()',\n", + " '+ if d[v] != inf:',\n", + " '+ continue',\n", + " '+ d[v] = d[p] + c',\n", + " '+ for cost, to in e[v]:',\n", + " '+ if to == p:',\n", + " '+ continue',\n", + " '+ dq.append((cost, to, v))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3453437109,\n", + " 'measured_runtime_v1': 0.1126016858,\n", + " 'runtime_lift': 3.06694974,\n", + " 'key': ['s143869460', 's902304606']},\n", + " {'user_id': 'u506858457',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's008520493',\n", + " 'submission_id_v1': 's067462181',\n", + " 'cpu_time_v0': 1402,\n", + " 'cpu_time_v1': 232,\n", + " 'memory_v0': 34008,\n", + " 'memory_v1': 71792,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.45,\n", + " 'input': 'import numpy as np\\n\\nN,K=list(map(int,input().split()))\\n\\nP=list(map(int,input().split()))\\n\\nQ=[0]\\n\\ndef ex(A):\\n\\n return (1+A)/2.0\\n\\nfor i in range(N):\\n\\n Q.append(ex(P[i]))\\n\\nQ=np.array(Q)\\n\\nR=Q.cumsum()\\n\\nans=0\\n\\nfor i in range(K,N+1):\\n\\n S=R[i]-R[i-K]\\n\\n if ans 0):\\n\\n parent[v].append(u)\\n\\n queue.append(v)\\n\\n unvisited[v] = False\\n\\n return unvisited[goal]\\n\\n\\n\\n# DFS for level graph and construct blocking flow\\n\\ndef dfs(goal, path, parent, blocking_flow):\\n\\n v = path[-1]\\n\\n if v == goal:\\n\\n aug_path_flow = 10000\\n\\n for x, y in zip(path[1:], path[:-1]):\\n\\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\\n\\n for x, y in zip(path[1:], path[:-1]):\\n\\n adj_mat[x][y] -= aug_path_flow\\n\\n adj_mat[y][x] += aug_path_flow\\n\\n blocking_flow[0] += aug_path_flow\\n\\n else:\\n\\n for u in parent[v]:\\n\\n path.append(u)\\n\\n dfs(goal, path, parent, blocking_flow)\\n\\n path.pop()\\n\\n\\n\\ndef dinic(source, sink):\\n\\n max_flow = 0\\n\\n parent = [[] for i in range(v_num)]\\n\\n while not bfs(source, sink, parent):\\n\\n blocking_flow = [0]\\n\\n path = [sink]\\n\\n # search in reverse direction from sink\\n\\n dfs(source, path, parent, blocking_flow)\\n\\n max_flow += blocking_flow[0]\\n\\n parent = [[] for i in range(v_num)]\\n\\n return max_flow\\n\\n\\n\\n# output\\n\\nprint((dinic(s, t)))\",\n", + " 'target': \"# Acceptance of input\\n\\n\\n\\nimport sys\\n\\n\\n\\nfile_input = sys.stdin\\n\\n\\n\\nX, Y, E = list(map(int, file_input.readline().split()))\\n\\n\\n\\nv_num = X + Y + 2\\n\\n\\n\\nadj_mat = [[0] * (v_num) for i in range(v_num)]\\n\\n\\n\\nfor line in file_input:\\n\\n x, y = list(map(int, line.split()))\\n\\n adj_mat[x][X + y] = 1\\n\\n\\n\\ns = X + Y\\n\\nt = s + 1\\n\\n\\n\\nfor i in range(X):\\n\\n adj_mat[s][i] = 1\\n\\n\\n\\nfor i in range(X, s):\\n\\n adj_mat[i][t] = 1\\n\\n\\n\\n# Dinic's algorithm\\n\\n\\n\\nimport collections\\n\\n\\n\\n# BFS for residual capacity network to construct level graph\\n\\ndef bfs(start, goal, parent):\\n\\n level = [v_num] * v_num\\n\\n unvisited = [True] * v_num\\n\\n queue = collections.deque()\\n\\n queue.append(start)\\n\\n level[start] = 0\\n\\n unvisited[start] = False\\n\\n while queue:\\n\\n u = queue.popleft()\\n\\n next_level = level[u] + 1\\n\\n for v, r_capacity in enumerate(adj_mat[u]):\\n\\n if (level[v] >= next_level) and (r_capacity > 0):\\n\\n level[v] = next_level\\n\\n parent[v].append(u)\\n\\n if unvisited[v]:\\n\\n queue.append(v)\\n\\n unvisited[v] = False\\n\\n return level[goal]\\n\\n\\n\\n# DFS for level graph and construct blocking flow\\n\\ndef dfs(goal, path, parent, blocking_flow):\\n\\n v = path[-1]\\n\\n if v == goal:\\n\\n aug_path_flow = 10000\\n\\n for x, y in zip(path[1:], path[:-1]):\\n\\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\\n\\n for x, y in zip(path[1:], path[:-1]):\\n\\n adj_mat[x][y] -= aug_path_flow\\n\\n adj_mat[y][x] += aug_path_flow\\n\\n blocking_flow[0] += aug_path_flow\\n\\n else:\\n\\n for u in parent[v]:\\n\\n path.append(u)\\n\\n dfs(goal, path, parent, blocking_flow)\\n\\n path.pop()\\n\\n\\n\\ndef dinic(source, sink):\\n\\n max_flow = 0\\n\\n parent = [[] for i in range(v_num)]\\n\\n while bfs(source, sink, parent) != v_num:\\n\\n blocking_flow = [0]\\n\\n path = [sink]\\n\\n # search in reverse direction from sink\\n\\n dfs(source, path, parent, blocking_flow)\\n\\n max_flow += blocking_flow[0]\\n\\n parent = [[] for i in range(v_num)]\\n\\n return max_flow\\n\\n\\n\\n# output\\n\\nprint((dinic(s, t)))\",\n", + " 'code_v0_loc': 75,\n", + " 'code_v1_loc': 80,\n", + " 'code_v0_num_chars': 1953,\n", + " 'code_v1_num_chars': 2133,\n", + " 'code_v0_no_empty_lines': \"# Acceptance of input\\nimport sys\\n\\nfile_input = sys.stdin\\nX, Y, E = list(map(int, file_input.readline().split()))\\nv_num = X + Y + 2\\nadj_mat = [[0] * (v_num) for i in range(v_num)]\\nfor line in file_input:\\n x, y = list(map(int, line.split()))\\n adj_mat[x][X + y] = 1\\ns = X + Y\\nt = s + 1\\nfor i in range(X):\\n adj_mat[s][i] = 1\\nfor i in range(X, s):\\n adj_mat[i][t] = 1\\n# Dinic's algorithm\\nimport collections\\n\\n# BFS for residual capacity network to construct level graph\\ndef bfs(start, goal, parent):\\n unvisited = [True] * v_num\\n queue = collections.deque()\\n queue.append(start)\\n unvisited[start] = False\\n while queue:\\n u = queue.popleft()\\n for v, r_capacity in enumerate(adj_mat[u]):\\n if unvisited[v] and (r_capacity > 0):\\n parent[v].append(u)\\n queue.append(v)\\n unvisited[v] = False\\n return unvisited[goal]\\n\\n\\n# DFS for level graph and construct blocking flow\\ndef dfs(goal, path, parent, blocking_flow):\\n v = path[-1]\\n if v == goal:\\n aug_path_flow = 10000\\n for x, y in zip(path[1:], path[:-1]):\\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\\n for x, y in zip(path[1:], path[:-1]):\\n adj_mat[x][y] -= aug_path_flow\\n adj_mat[y][x] += aug_path_flow\\n blocking_flow[0] += aug_path_flow\\n else:\\n for u in parent[v]:\\n path.append(u)\\n dfs(goal, path, parent, blocking_flow)\\n path.pop()\\n\\n\\ndef dinic(source, sink):\\n max_flow = 0\\n parent = [[] for i in range(v_num)]\\n while not bfs(source, sink, parent):\\n blocking_flow = [0]\\n path = [sink]\\n # search in reverse direction from sink\\n dfs(source, path, parent, blocking_flow)\\n max_flow += blocking_flow[0]\\n parent = [[] for i in range(v_num)]\\n return max_flow\\n\\n\\n# output\\nprint((dinic(s, t)))\\n\",\n", + " 'code_v1_no_empty_lines': \"# Acceptance of input\\nimport sys\\n\\nfile_input = sys.stdin\\nX, Y, E = list(map(int, file_input.readline().split()))\\nv_num = X + Y + 2\\nadj_mat = [[0] * (v_num) for i in range(v_num)]\\nfor line in file_input:\\n x, y = list(map(int, line.split()))\\n adj_mat[x][X + y] = 1\\ns = X + Y\\nt = s + 1\\nfor i in range(X):\\n adj_mat[s][i] = 1\\nfor i in range(X, s):\\n adj_mat[i][t] = 1\\n# Dinic's algorithm\\nimport collections\\n\\n# BFS for residual capacity network to construct level graph\\ndef bfs(start, goal, parent):\\n level = [v_num] * v_num\\n unvisited = [True] * v_num\\n queue = collections.deque()\\n queue.append(start)\\n level[start] = 0\\n unvisited[start] = False\\n while queue:\\n u = queue.popleft()\\n next_level = level[u] + 1\\n for v, r_capacity in enumerate(adj_mat[u]):\\n if (level[v] >= next_level) and (r_capacity > 0):\\n level[v] = next_level\\n parent[v].append(u)\\n if unvisited[v]:\\n queue.append(v)\\n unvisited[v] = False\\n return level[goal]\\n\\n\\n# DFS for level graph and construct blocking flow\\ndef dfs(goal, path, parent, blocking_flow):\\n v = path[-1]\\n if v == goal:\\n aug_path_flow = 10000\\n for x, y in zip(path[1:], path[:-1]):\\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\\n for x, y in zip(path[1:], path[:-1]):\\n adj_mat[x][y] -= aug_path_flow\\n adj_mat[y][x] += aug_path_flow\\n blocking_flow[0] += aug_path_flow\\n else:\\n for u in parent[v]:\\n path.append(u)\\n dfs(goal, path, parent, blocking_flow)\\n path.pop()\\n\\n\\ndef dinic(source, sink):\\n max_flow = 0\\n parent = [[] for i in range(v_num)]\\n while bfs(source, sink, parent) != v_num:\\n blocking_flow = [0]\\n path = [sink]\\n # search in reverse direction from sink\\n dfs(source, path, parent, blocking_flow)\\n max_flow += blocking_flow[0]\\n parent = [[] for i in range(v_num)]\\n return max_flow\\n\\n\\n# output\\nprint((dinic(s, t)))\\n\",\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.25,\n", + " 'diff': ['+ level = [v_num] * v_num',\n", + " '+ level[start] = 0',\n", + " '+ next_level = level[u] + 1',\n", + " '- if unvisited[v] and (r_capacity > 0):',\n", + " '+ if (level[v] >= next_level) and (r_capacity > 0):',\n", + " '+ level[v] = next_level',\n", + " '- queue.append(v)',\n", + " '- unvisited[v] = False',\n", + " '- return unvisited[goal]',\n", + " '+ if unvisited[v]:',\n", + " '+ queue.append(v)',\n", + " '+ unvisited[v] = False',\n", + " '+ return level[goal]',\n", + " '- while not bfs(source, sink, parent):',\n", + " '+ while bfs(source, sink, parent) != v_num:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2959556043,\n", + " 'measured_runtime_v1': 0.2352844019,\n", + " 'runtime_lift': 1.2578632579,\n", + " 'key': ['s432486243', 's242092393']},\n", + " {'user_id': 'u072053884',\n", + " 'problem_id': 'p02282',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's375368636',\n", + " 'submission_id_v1': 's582750093',\n", + " 'cpu_time_v0': 40,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 7716,\n", + " 'memory_v1': 7752,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': \"def post_from_pre_in(preorder_elements, inorder_elements):\\n\\n if preorder_elements:\\n\\n global cnt\\n\\n root = preorder_elements[0]\\n\\n root_index = inorder_elements.index(root)\\n\\n preorder_left = preorder_elements[1:root_index+1]\\n\\n inorder_left = inorder_elements[:root_index]\\n\\n preorder_right = preorder_elements[root_index+1:]\\n\\n inorder_right = inorder_elements[root_index+1:]\\n\\n post_from_pre_in(preorder_left, inorder_left)\\n\\n post_from_pre_in(preorder_right, inorder_right)\\n\\n if cnt:\\n\\n print(root, end = ' ')\\n\\n cnt -= 1\\n\\n else:\\n\\n print(root)\\n\\n\\n\\n\\n\\ncnt = int(input()) - 1\\n\\n\\n\\na = list(map(int, input().split()))\\n\\nb = list(map(int, input().split()))\\n\\n\\n\\npost_from_pre_in(a, b)\\n\",\n", + " 'target': 'postorder_elements = []\\n\\n\\n\\ndef post_from_pre_in(preorder_elements, inorder_elements):\\n\\n if preorder_elements:\\n\\n root = preorder_elements[0]\\n\\n root_index = inorder_elements.index(root)\\n\\n preorder_left = preorder_elements[1:root_index+1]\\n\\n inorder_left = inorder_elements[:root_index]\\n\\n preorder_right = preorder_elements[root_index+1:]\\n\\n inorder_right = inorder_elements[root_index+1:]\\n\\n post_from_pre_in(preorder_left, inorder_left)\\n\\n post_from_pre_in(preorder_right, inorder_right)\\n\\n postorder_elements.append(root)\\n\\n\\n\\n\\n\\n\\n\\nn = int(eval(input()))\\n\\n\\n\\na = list(map(int, input().split()))\\n\\nb = list(map(int, input().split()))\\n\\n\\n\\npost_from_pre_in(a, b)\\n\\n\\n\\nprint((*postorder_elements))',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 779,\n", + " 'code_v1_num_chars': 738,\n", + " 'code_v0_no_empty_lines': 'def post_from_pre_in(preorder_elements, inorder_elements):\\n if preorder_elements:\\n global cnt\\n root = preorder_elements[0]\\n root_index = inorder_elements.index(root)\\n preorder_left = preorder_elements[1 : root_index + 1]\\n inorder_left = inorder_elements[:root_index]\\n preorder_right = preorder_elements[root_index + 1 :]\\n inorder_right = inorder_elements[root_index + 1 :]\\n post_from_pre_in(preorder_left, inorder_left)\\n post_from_pre_in(preorder_right, inorder_right)\\n if cnt:\\n print(root, end=\" \")\\n cnt -= 1\\n else:\\n print(root)\\n\\n\\ncnt = int(input()) - 1\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\npost_from_pre_in(a, b)\\n',\n", + " 'code_v1_no_empty_lines': 'postorder_elements = []\\n\\n\\ndef post_from_pre_in(preorder_elements, inorder_elements):\\n if preorder_elements:\\n root = preorder_elements[0]\\n root_index = inorder_elements.index(root)\\n preorder_left = preorder_elements[1 : root_index + 1]\\n inorder_left = inorder_elements[:root_index]\\n preorder_right = preorder_elements[root_index + 1 :]\\n inorder_right = inorder_elements[root_index + 1 :]\\n post_from_pre_in(preorder_left, inorder_left)\\n post_from_pre_in(preorder_right, inorder_right)\\n postorder_elements.append(root)\\n\\n\\nn = int(eval(input()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\npost_from_pre_in(a, b)\\nprint((*postorder_elements))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['+postorder_elements = []',\n", + " '+',\n", + " '+',\n", + " '- global cnt',\n", + " '- if cnt:',\n", + " '- print(root, end=\" \")',\n", + " '- cnt -= 1',\n", + " '- else:',\n", + " '- print(root)',\n", + " '+ postorder_elements.append(root)',\n", + " '-cnt = int(input()) - 1',\n", + " '+n = int(eval(input()))',\n", + " '+print((*postorder_elements))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2366878937,\n", + " 'measured_runtime_v1': 0.1182743947,\n", + " 'runtime_lift': 2.0011761158,\n", + " 'key': ['s375368636', 's582750093']},\n", + " {'user_id': 'u761320129',\n", + " 'problem_id': 'p03559',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's241549796',\n", + " 'submission_id_v1': 's763191935',\n", + " 'cpu_time_v0': 368,\n", + " 'cpu_time_v1': 263,\n", + " 'memory_v0': 23328,\n", + " 'memory_v1': 29344,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.53,\n", + " 'input': 'N = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\nB = list(map(int,input().split()))\\n\\nC = list(map(int,input().split()))\\n\\nA.sort()\\n\\nC.sort()\\n\\n\\n\\nans = 0\\n\\nfrom bisect import bisect, bisect_left\\n\\nfor b in B:\\n\\n i = bisect_left(A, b)\\n\\n j = bisect(C, b)\\n\\n ans += i * (N-j)\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\nB = list(map(int,input().split()))\\n\\nC = list(map(int,input().split()))\\n\\nA.sort()\\n\\nC.sort()\\n\\n\\n\\nfrom bisect import bisect_left, bisect\\n\\nans = 0\\n\\nfor b in B:\\n\\n i = bisect_left(A,b)\\n\\n j = bisect(C,b)\\n\\n ans += i * (N-j)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 291,\n", + " 'code_v1_num_chars': 289,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nA.sort()\\nC.sort()\\nans = 0\\nfrom bisect import bisect, bisect_left\\n\\nfor b in B:\\n i = bisect_left(A, b)\\n j = bisect(C, b)\\n ans += i * (N - j)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nA.sort()\\nC.sort()\\nfrom bisect import bisect_left, bisect\\n\\nans = 0\\nfor b in B:\\n i = bisect_left(A, b)\\n j = bisect(C, b)\\n ans += i * (N - j)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['+from bisect import bisect_left, bisect',\n", + " '+',\n", + " '-from bisect import bisect, bisect_left',\n", + " '-'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2898341594,\n", + " 'measured_runtime_v1': 0.1261365476,\n", + " 'runtime_lift': 2.2977809758,\n", + " 'key': ['s241549796', 's763191935']},\n", + " {'user_id': 'u046187684',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's670004614',\n", + " 'submission_id_v1': 's451570283',\n", + " 'cpu_time_v0': 341,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 19892,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 94.72,\n", + " 'input': 'from scipy.spatial import distance\\n\\n\\n\\n\\n\\ndef solve(string):\\n\\n n, d, *x = list(map(int, string.split()))\\n\\n x = [tuple(c) for c in zip(*[iter(x)] * d)]\\n\\n dist = distance.cdist(x, x)\\n\\n return str(((dist == dist.astype(\"int32\")).sum() - n) // 2)\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n n, m = list(map(int, input().split()))\\n\\n print((solve(\\'{} {}\\\\n\\'.format(n, m)+\\'\\\\n\\'.join([eval(input()) for _ in range(n)]))))\\n',\n", + " 'target': 'import math\\n\\nN,D = list(map(int,input().split()))\\n\\nX = [list(map(float, input().split())) for i in range(N)]\\n\\ncounter = 0\\n\\nfor i, x0 in enumerate(X): \\n\\n for x1 in X[i+1:]:\\n\\n if math.sqrt(sum([(a-b)**2 for a, b in zip(x0,x1)])).is_integer():\\n\\n counter+=1\\n\\nprint(counter)\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 398,\n", + " 'code_v1_num_chars': 285,\n", + " 'code_v0_no_empty_lines': 'from scipy.spatial import distance\\n\\n\\ndef solve(string):\\n n, d, *x = list(map(int, string.split()))\\n x = [tuple(c) for c in zip(*[iter(x)] * d)]\\n dist = distance.cdist(x, x)\\n return str(((dist == dist.astype(\"int32\")).sum() - n) // 2)\\n\\n\\nif __name__ == \"__main__\":\\n n, m = list(map(int, input().split()))\\n print(\\n (solve(\"{} {}\\\\n\".format(n, m) + \"\\\\n\".join([eval(input()) for _ in range(n)])))\\n )\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nN, D = list(map(int, input().split()))\\nX = [list(map(float, input().split())) for i in range(N)]\\ncounter = 0\\nfor i, x0 in enumerate(X):\\n for x1 in X[i + 1 :]:\\n if math.sqrt(sum([(a - b) ** 2 for a, b in zip(x0, x1)])).is_integer():\\n counter += 1\\nprint(counter)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.7692307692,\n", + " 'diff': ['-from scipy.spatial import distance',\n", + " '+import math',\n", + " '-',\n", + " '-def solve(string):',\n", + " '- n, d, *x = list(map(int, string.split()))',\n", + " '- x = [tuple(c) for c in zip(*[iter(x)] * d)]',\n", + " '- dist = distance.cdist(x, x)',\n", + " '- return str(((dist == dist.astype(\"int32\")).sum() - n) // 2)',\n", + " '-',\n", + " '-',\n", + " '-if __name__ == \"__main__\":',\n", + " '- n, m = list(map(int, input().split()))',\n", + " '- print(',\n", + " '- (solve(\"{} {}\\\\n\".format(n, m) + \"\\\\n\".join([eval(input()) for _ in range(n)])))',\n", + " '- )',\n", + " '+N, D = list(map(int, input().split()))',\n", + " '+X = [list(map(float, input().split())) for i in range(N)]',\n", + " '+counter = 0',\n", + " '+for i, x0 in enumerate(X):',\n", + " '+ for x1 in X[i + 1 :]:',\n", + " '+ if math.sqrt(sum([(a - b) ** 2 for a, b in zip(x0, x1)])).is_integer():',\n", + " '+ counter += 1',\n", + " '+print(counter)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.3489351194,\n", + " 'measured_runtime_v1': 0.198756752,\n", + " 'runtime_lift': 11.8181399901,\n", + " 'key': ['s670004614', 's451570283']},\n", + " {'user_id': 'u580697892',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's380388533',\n", + " 'submission_id_v1': 's555933357',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 12412,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.67,\n", + " 'input': '# coding: utf-8\\n\\nimport numpy as np\\n\\nn, d = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nX = []\\n\\nfor i in range(n):\\n\\n x = list(map(int, input().split()))\\n\\n X.append(x[:])\\n\\nX = np.array(X)\\n\\nfor i in range(n):\\n\\n X_tmp = X[:]\\n\\n X_tmp -= X[i]\\n\\n for i in range(n):\\n\\n x = X_tmp[i]\\n\\n x_sq = x**2\\n\\n x_sq = np.sqrt(sum(x_sq))\\n\\n if x_sq % 1 == 0:\\n\\n cnt += 1\\n\\nprint(((cnt-n)//2))',\n", + " 'target': '# coding: utf-8\\n\\nN, D = list(map(int, input().split()))\\n\\nX = []\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n X.append(list(map(int, input().split())))\\n\\nfor i in range(N):\\n\\n for j in range(N):\\n\\n dist = 0\\n\\n if i == j:\\n\\n continue\\n\\n for d in range(D):\\n\\n dist += ((X[i][d] - X[j][d])**2)\\n\\n if dist**0.5 == int(dist**0.5):\\n\\n ans += 1\\n\\nprint((ans//2))',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 411,\n", + " 'code_v1_num_chars': 389,\n", + " 'code_v0_no_empty_lines': '# coding: utf-8\\nimport numpy as np\\n\\nn, d = list(map(int, input().split()))\\ncnt = 0\\nX = []\\nfor i in range(n):\\n x = list(map(int, input().split()))\\n X.append(x[:])\\nX = np.array(X)\\nfor i in range(n):\\n X_tmp = X[:]\\n X_tmp -= X[i]\\n for i in range(n):\\n x = X_tmp[i]\\n x_sq = x**2\\n x_sq = np.sqrt(sum(x_sq))\\n if x_sq % 1 == 0:\\n cnt += 1\\nprint(((cnt - n) // 2))\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nN, D = list(map(int, input().split()))\\nX = []\\nans = 0\\nfor i in range(N):\\n X.append(list(map(int, input().split())))\\nfor i in range(N):\\n for j in range(N):\\n dist = 0\\n if i == j:\\n continue\\n for d in range(D):\\n dist += (X[i][d] - X[j][d]) ** 2\\n if dist**0.5 == int(dist**0.5):\\n ans += 1\\nprint((ans // 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.7894736842,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-n, d = list(map(int, input().split()))',\n", + " '-cnt = 0',\n", + " '+N, D = list(map(int, input().split()))',\n", + " '-for i in range(n):',\n", + " '- x = list(map(int, input().split()))',\n", + " '- X.append(x[:])',\n", + " '-X = np.array(X)',\n", + " '-for i in range(n):',\n", + " '- X_tmp = X[:]',\n", + " '- X_tmp -= X[i]',\n", + " '- for i in range(n):',\n", + " '- x = X_tmp[i]',\n", + " '- x_sq = x**2',\n", + " '- x_sq = np.sqrt(sum(x_sq))',\n", + " '- if x_sq % 1 == 0:',\n", + " '- cnt += 1',\n", + " '-print(((cnt - n) // 2))',\n", + " '+ans = 0',\n", + " '+for i in range(N):',\n", + " '+ X.append(list(map(int, input().split())))',\n", + " '+for i in range(N):',\n", + " '+ for j in range(N):',\n", + " '+ dist = 0',\n", + " '+ if i == j:',\n", + " '+ continue',\n", + " '+ for d in range(D):',\n", + " '+ dist += (X[i][d] - X[j][d]) ** 2',\n", + " '+ if dist**0.5 == int(dist**0.5):',\n", + " '+ ans += 1',\n", + " '+print((ans // 2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3454763293,\n", + " 'measured_runtime_v1': 0.2011937041,\n", + " 'runtime_lift': 6.6874673593,\n", + " 'key': ['s380388533', 's555933357']},\n", + " {'user_id': 'u453634104',\n", + " 'problem_id': 'p02552',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's410377980',\n", + " 'submission_id_v1': 's110616608',\n", + " 'cpu_time_v0': 126,\n", + " 'cpu_time_v1': 24,\n", + " 'memory_v0': 61640,\n", + " 'memory_v1': 9128,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.95,\n", + " 'input': 'x = int(eval(input()))\\n\\nif x == 0:\\n\\n print((1))\\n\\nelse:\\n\\n print((0))',\n", + " 'target': 'x = int(eval(input()))\\n\\nprint((x^1))\\n',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 2,\n", + " 'code_v0_num_chars': 59,\n", + " 'code_v1_num_chars': 29,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nif x == 0:\\n print((1))\\nelse:\\n print((0))\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nprint((x ^ 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 60.0,\n", + " 'diff': ['-if x == 0:',\n", + " '- print((1))',\n", + " '-else:',\n", + " '- print((0))',\n", + " '+print((x ^ 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3271924098,\n", + " 'measured_runtime_v1': 0.2133970539,\n", + " 'runtime_lift': 1.5332564526,\n", + " 'key': ['s410377980', 's110616608']},\n", + " {'user_id': 'u867826040',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's705992872',\n", + " 'submission_id_v1': 's870269222',\n", + " 'cpu_time_v0': 258,\n", + " 'cpu_time_v1': 223,\n", + " 'memory_v0': 9120,\n", + " 'memory_v1': 9160,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.57,\n", + " 'input': 'n = int(eval(input()))\\n\\nv = [[tuple(map(int, input().split()))for i in range(int(eval(input())))]\\n\\n for i in range(n)]\\n\\n\\n\\nans = 0\\n\\nfor i in range(2**n):\\n\\n f = [False] * n\\n\\n xy = []\\n\\n for j in range(n):\\n\\n if (i >> j) & 1:\\n\\n f[j] = True\\n\\n xy.append(v[j])\\n\\n flag = True\\n\\n for xyi in xy:\\n\\n for x, y in xyi:\\n\\n if f[x - 1] is not bool(y):\\n\\n flag = False\\n\\n break\\n\\n if flag:\\n\\n ans = max(ans, len(xy))\\n\\nprint(ans)\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\nv = [[tuple(map(int, input().split()))for i in range(int(eval(input())))]\\n\\n for i in range(n)]\\n\\n\\n\\nans = 0\\n\\nfor i in range(2**n):\\n\\n f = [0] * n\\n\\n xy = []\\n\\n for j in range(n):\\n\\n if (i >> j) & 1:\\n\\n f[j] = 1\\n\\n xy.append(v[j])\\n\\n flag = True\\n\\n for xyi in xy:\\n\\n for x, y in xyi:\\n\\n #print(f,x,y,bin(i))\\n\\n if (i>>(x-1))&1 != y:\\n\\n flag = False\\n\\n break\\n\\n if flag:\\n\\n ans = max(ans, len(xy))\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 499,\n", + " 'code_v1_num_chars': 520,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nv = [\\n [tuple(map(int, input().split())) for i in range(int(eval(input())))]\\n for i in range(n)\\n]\\nans = 0\\nfor i in range(2**n):\\n f = [False] * n\\n xy = []\\n for j in range(n):\\n if (i >> j) & 1:\\n f[j] = True\\n xy.append(v[j])\\n flag = True\\n for xyi in xy:\\n for x, y in xyi:\\n if f[x - 1] is not bool(y):\\n flag = False\\n break\\n if flag:\\n ans = max(ans, len(xy))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nv = [\\n [tuple(map(int, input().split())) for i in range(int(eval(input())))]\\n for i in range(n)\\n]\\nans = 0\\nfor i in range(2**n):\\n f = [0] * n\\n xy = []\\n for j in range(n):\\n if (i >> j) & 1:\\n f[j] = 1\\n xy.append(v[j])\\n flag = True\\n for xyi in xy:\\n for x, y in xyi:\\n # print(f,x,y,bin(i))\\n if (i >> (x - 1)) & 1 != y:\\n flag = False\\n break\\n if flag:\\n ans = max(ans, len(xy))\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['- f = [False] * n',\n", + " '+ f = [0] * n',\n", + " '- f[j] = True',\n", + " '+ f[j] = 1',\n", + " '- if f[x - 1] is not bool(y):',\n", + " '+ # print(f,x,y,bin(i))',\n", + " '+ if (i >> (x - 1)) & 1 != y:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.289290843,\n", + " 'measured_runtime_v1': 0.2134317408,\n", + " 'runtime_lift': 1.3554255893,\n", + " 'key': ['s705992872', 's870269222']},\n", + " {'user_id': 'u764956288',\n", + " 'problem_id': 'p02691',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's430506044',\n", + " 'submission_id_v1': 's372862352',\n", + " 'cpu_time_v0': 215,\n", + " 'cpu_time_v1': 188,\n", + " 'memory_v0': 57704,\n", + " 'memory_v1': 36612,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.56,\n", + " 'input': 'from collections import defaultdict\\n\\n\\n\\n\\n\\ndef main():\\n\\n _ = int(eval(input()))\\n\\n heights = list(map(int, input().split()))\\n\\n\\n\\n \"\"\"\\n\\n for j>i, j-i = Ai + Aj\\n\\n i + Ai = j -Aj\\n\\n \"\"\"\\n\\n\\n\\n L = defaultdict(int)\\n\\n R = defaultdict(int)\\n\\n\\n\\n for i, height in enumerate(heights):\\n\\n L[i + height] += 1\\n\\n R[i - height] += 1\\n\\n\\n\\n total_count = 0\\n\\n for x, count_l in list(L.items()):\\n\\n if x in R:\\n\\n count_r = R[x]\\n\\n total_count += count_l * count_r\\n\\n\\n\\n print(total_count)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'from collections import defaultdict\\n\\n\\n\\n\\n\\ndef main():\\n\\n N = int(eval(input()))\\n\\n heights = list(map(int, input().split()))\\n\\n\\n\\n \"\"\"\\n\\n for j>i, j-i = Ai + Aj\\n\\n i + Ai = j -Aj\\n\\n \"\"\"\\n\\n\\n\\n L = defaultdict(int)\\n\\n R = defaultdict(int)\\n\\n\\n\\n for i, height in enumerate(heights):\\n\\n if i + height < N:\\n\\n L[i + height] += 1\\n\\n \\n\\n if i - height > 0:\\n\\n R[i - height] += 1\\n\\n\\n\\n total_count = 0\\n\\n for x, count_l in list(L.items()):\\n\\n if x in R:\\n\\n count_r = R[x]\\n\\n total_count += count_l * count_r\\n\\n\\n\\n print(total_count)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 565,\n", + " 'code_v1_num_chars': 639,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\n\\n\\ndef main():\\n _ = int(eval(input()))\\n heights = list(map(int, input().split()))\\n \"\"\"\\n for j>i, j-i = Ai + Aj\\n i + Ai = j -Aj\\n \"\"\"\\n L = defaultdict(int)\\n R = defaultdict(int)\\n for i, height in enumerate(heights):\\n L[i + height] += 1\\n R[i - height] += 1\\n total_count = 0\\n for x, count_l in list(L.items()):\\n if x in R:\\n count_r = R[x]\\n total_count += count_l * count_r\\n print(total_count)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\n\\ndef main():\\n N = int(eval(input()))\\n heights = list(map(int, input().split()))\\n \"\"\"\\n for j>i, j-i = Ai + Aj\\n i + Ai = j -Aj\\n \"\"\"\\n L = defaultdict(int)\\n R = defaultdict(int)\\n for i, height in enumerate(heights):\\n if i + height < N:\\n L[i + height] += 1\\n if i - height > 0:\\n R[i - height] += 1\\n total_count = 0\\n for x, count_l in list(L.items()):\\n if x in R:\\n count_r = R[x]\\n total_count += count_l * count_r\\n print(total_count)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['- _ = int(eval(input()))',\n", + " '+ N = int(eval(input()))',\n", + " '- L[i + height] += 1',\n", + " '- R[i - height] += 1',\n", + " '+ if i + height < N:',\n", + " '+ L[i + height] += 1',\n", + " '+ if i - height > 0:',\n", + " '+ R[i - height] += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3616042199,\n", + " 'measured_runtime_v1': 0.2114392846,\n", + " 'runtime_lift': 1.7102035728,\n", + " 'key': ['s430506044', 's372862352']},\n", + " {'user_id': 'u263188345',\n", + " 'problem_id': 'p03126',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's215059135',\n", + " 'submission_id_v1': 's051824790',\n", + " 'cpu_time_v0': 163,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 13144,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.57,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\n\\n\\nlike_total = np.zeros(M)\\n\\ncnt = 0\\n\\nfor _ in range(N):\\n\\n l = [v for v in map(int, input().split())]\\n\\n #print(l)\\n\\n for i in range(1, l[0]+1, 1):\\n\\n like_total[l[i]-1] += 1\\n\\n\\n\\n#print(like_total, N)\\n\\n#print(like_total[4], like_total[9], like_total[-1])\\n\\nans = len(np.where(like_total==N)[0])\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'N, M = list(map(int, input().split()))\\n\\n\\n\\nlike_total = [0]*M\\n\\ncnt = 0\\n\\nfor _ in range(N):\\n\\n l = list(map(int, input().split()))\\n\\n for i in range(1, l[0]+1, 1):\\n\\n like_total[l[i]-1] += 1\\n\\n\\n\\nfor v in like_total:\\n\\n cnt += v==N\\n\\nprint(cnt)\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 375,\n", + " 'code_v1_num_chars': 246,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, M = list(map(int, input().split()))\\nlike_total = np.zeros(M)\\ncnt = 0\\nfor _ in range(N):\\n l = [v for v in map(int, input().split())]\\n # print(l)\\n for i in range(1, l[0] + 1, 1):\\n like_total[l[i] - 1] += 1\\n# print(like_total, N)\\n# print(like_total[4], like_total[9], like_total[-1])\\nans = len(np.where(like_total == N)[0])\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nlike_total = [0] * M\\ncnt = 0\\nfor _ in range(N):\\n l = list(map(int, input().split()))\\n for i in range(1, l[0] + 1, 1):\\n like_total[l[i] - 1] += 1\\nfor v in like_total:\\n cnt += v == N\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 29.4117647059,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-like_total = np.zeros(M)',\n", + " '+like_total = [0] * M',\n", + " '- l = [v for v in map(int, input().split())]',\n", + " '- # print(l)',\n", + " '+ l = list(map(int, input().split()))',\n", + " '-# print(like_total, N)',\n", + " '-# print(like_total[4], like_total[9], like_total[-1])',\n", + " '-ans = len(np.where(like_total == N)[0])',\n", + " '-print(ans)',\n", + " '+for v in like_total:',\n", + " '+ cnt += v == N',\n", + " '+print(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4440002892,\n", + " 'measured_runtime_v1': 0.2203136516,\n", + " 'runtime_lift': 6.5542932946,\n", + " 'key': ['s215059135', 's051824790']},\n", + " {'user_id': 'u228223940',\n", + " 'problem_id': 'p03634',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's279386500',\n", + " 'submission_id_v1': 's990337521',\n", + " 'cpu_time_v0': 1565,\n", + " 'cpu_time_v1': 1313,\n", + " 'memory_v0': 113180,\n", + " 'memory_v1': 156176,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.1,\n", + " 'input': 'import queue\\n\\nn = int(eval(input()))\\n\\n\\n\\nabc = [[] for i in range(n+1)]\\n\\n\\n\\nfor i in range(n-1):\\n\\n a,b,c = list(map(int,input().split()))\\n\\n abc[a].append([b,c])\\n\\n abc[b].append([a,c])\\n\\n\\n\\nQ,k = list(map(int,input().split()))\\n\\nxy = [[int(i) for i in input().split()] for j in range(Q)]\\n\\n\\n\\nq = queue.Queue()\\n\\n\\n\\nq.put(k)\\n\\n\\n\\npath = [-1]*(n+1)\\n\\npath[k] = 0\\n\\n\\n\\nwhile not q.empty():\\n\\n tmp = q.get()\\n\\n for i in range(len(abc[tmp])):\\n\\n #print(abc[tmp])\\n\\n #exit()\\n\\n num = abc[tmp][i][0]\\n\\n if path[num] != -1:\\n\\n continue\\n\\n else:\\n\\n path[num] = path[tmp] + abc[tmp][i][1]\\n\\n q.put(num)\\n\\n \\n\\nfor i in range(Q):\\n\\n print((path[xy[i][0]]+path[xy[i][1]]))',\n", + " 'target': 'import queue\\n\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\n\\nn = int(eval(input()))\\n\\n\\n\\nabc = [[] for i in range(n+1)]\\n\\n\\n\\nfor i in range(n-1):\\n\\n a,b,c = list(map(int,input().split()))\\n\\n abc[a].append([b,c])\\n\\n abc[b].append([a,c])\\n\\n\\n\\nQ,k = list(map(int,input().split()))\\n\\nxy = [[int(i) for i in input().split()] for j in range(Q)]\\n\\n\\n\\nq = queue.Queue()\\n\\n\\n\\nq.put(k)\\n\\n\\n\\npath = [-1]*(n+1)\\n\\npath[k] = 0\\n\\n\\n\\ndef dfs(p):\\n\\n for i in range(len(abc[p])):\\n\\n num = abc[p][i][0]\\n\\n if path[num] != -1:\\n\\n continue\\n\\n else:\\n\\n path[num] = path[p] + abc[p][i][1]\\n\\n dfs(num)\\n\\n\\n\\ndfs(k)\\n\\n\\n\\nfor i in range(Q):\\n\\n print((path[xy[i][0]]+path[xy[i][1]]))',\n", + " 'code_v0_loc': 34,\n", + " 'code_v1_loc': 35,\n", + " 'code_v0_num_chars': 709,\n", + " 'code_v1_num_chars': 668,\n", + " 'code_v0_no_empty_lines': 'import queue\\n\\nn = int(eval(input()))\\nabc = [[] for i in range(n + 1)]\\nfor i in range(n - 1):\\n a, b, c = list(map(int, input().split()))\\n abc[a].append([b, c])\\n abc[b].append([a, c])\\nQ, k = list(map(int, input().split()))\\nxy = [[int(i) for i in input().split()] for j in range(Q)]\\nq = queue.Queue()\\nq.put(k)\\npath = [-1] * (n + 1)\\npath[k] = 0\\nwhile not q.empty():\\n tmp = q.get()\\n for i in range(len(abc[tmp])):\\n # print(abc[tmp])\\n # exit()\\n num = abc[tmp][i][0]\\n if path[num] != -1:\\n continue\\n else:\\n path[num] = path[tmp] + abc[tmp][i][1]\\n q.put(num)\\nfor i in range(Q):\\n print((path[xy[i][0]] + path[xy[i][1]]))\\n',\n", + " 'code_v1_no_empty_lines': 'import queue\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\nn = int(eval(input()))\\nabc = [[] for i in range(n + 1)]\\nfor i in range(n - 1):\\n a, b, c = list(map(int, input().split()))\\n abc[a].append([b, c])\\n abc[b].append([a, c])\\nQ, k = list(map(int, input().split()))\\nxy = [[int(i) for i in input().split()] for j in range(Q)]\\nq = queue.Queue()\\nq.put(k)\\npath = [-1] * (n + 1)\\npath[k] = 0\\n\\n\\ndef dfs(p):\\n for i in range(len(abc[p])):\\n num = abc[p][i][0]\\n if path[num] != -1:\\n continue\\n else:\\n path[num] = path[p] + abc[p][i][1]\\n dfs(num)\\n\\n\\ndfs(k)\\nfor i in range(Q):\\n print((path[xy[i][0]] + path[xy[i][1]]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.8571428571,\n", + " 'diff': ['+import sys',\n", + " '+sys.setrecursionlimit(10**7)',\n", + " '-while not q.empty():',\n", + " '- tmp = q.get()',\n", + " '- for i in range(len(abc[tmp])):',\n", + " '- # print(abc[tmp])',\n", + " '- # exit()',\n", + " '- num = abc[tmp][i][0]',\n", + " '+',\n", + " '+',\n", + " '+def dfs(p):',\n", + " '+ for i in range(len(abc[p])):',\n", + " '+ num = abc[p][i][0]',\n", + " '- path[num] = path[tmp] + abc[tmp][i][1]',\n", + " '- q.put(num)',\n", + " '+ path[num] = path[p] + abc[p][i][1]',\n", + " '+ dfs(num)',\n", + " '+',\n", + " '+',\n", + " '+dfs(k)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3961623552,\n", + " 'measured_runtime_v1': 0.2607869017,\n", + " 'runtime_lift': 1.5191037302,\n", + " 'key': ['s279386500', 's990337521']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's031225874',\n", + " 'submission_id_v1': 's421873683',\n", + " 'cpu_time_v0': 349,\n", + " 'cpu_time_v1': 154,\n", + " 'memory_v0': 22780,\n", + " 'memory_v1': 12668,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.87,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = np.array(input().split(),dtype=np.int32)\\n\\n\\n\\ndef ord(n):\\n\\n cnt = 0\\n\\n while not n&1:\\n\\n n >>= 1\\n\\n cnt += 1\\n\\n return cnt\\n\\n\\n\\nnp_ord = np.frompyfunc(ord,1,1)\\n\\nanswer = np_ord(A).sum()\\n\\nprint(answer)',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\nN = int(readline())\\n\\nA = np.array(read().split(),np.int32)\\n\\n\\n\\nanswer = 0\\n\\nfor _ in range(32):\\n\\n A = A[A%2 == 0]\\n\\n answer += len(A)\\n\\n A >>= 1\\n\\n\\n\\nprint(answer)',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 245,\n", + " 'code_v1_num_chars': 310,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = np.array(input().split(), dtype=np.int32)\\n\\n\\ndef ord(n):\\n cnt = 0\\n while not n & 1:\\n n >>= 1\\n cnt += 1\\n return cnt\\n\\n\\nnp_ord = np.frompyfunc(ord, 1, 1)\\nanswer = np_ord(A).sum()\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nimport numpy as np\\n\\nN = int(readline())\\nA = np.array(read().split(), np.int32)\\nanswer = 0\\nfor _ in range(32):\\n A = A[A % 2 == 0]\\n answer += len(A)\\n A >>= 1\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.7647058824,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '-N = int(eval(input()))',\n", + " '-A = np.array(input().split(), dtype=np.int32)',\n", + " '-',\n", + " '-',\n", + " '-def ord(n):',\n", + " '- cnt = 0',\n", + " '- while not n & 1:',\n", + " '- n >>= 1',\n", + " '- cnt += 1',\n", + " '- return cnt',\n", + " '-',\n", + " '-',\n", + " '-np_ord = np.frompyfunc(ord, 1, 1)',\n", + " '-answer = np_ord(A).sum()',\n", + " '+N = int(readline())',\n", + " '+A = np.array(read().split(), np.int32)',\n", + " '+answer = 0',\n", + " '+for _ in range(32):',\n", + " '+ A = A[A % 2 == 0]',\n", + " '+ answer += len(A)',\n", + " '+ A >>= 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.014342514,\n", + " 'measured_runtime_v1': 0.210192055,\n", + " 'runtime_lift': 9.5833427865,\n", + " 'key': ['s031225874', 's421873683']},\n", + " {'user_id': 'u537976628',\n", + " 'problem_id': 'p03720',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's957846271',\n", + " 'submission_id_v1': 's235024999',\n", + " 'cpu_time_v0': 28,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 9128,\n", + " 'memory_v1': 9136,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.71,\n", + " 'input': 'n, m = list(map(int, input().split()))\\n\\nRD = list(list(map(int, input().split())) for _ in range(m))\\n\\nfor i in range(1, n + 1):\\n\\n ans = 0\\n\\n for j in RD:\\n\\n ans += j.count(i)\\n\\n print(ans)',\n", + " 'target': 'n, m = list(map(int, input().split()))\\n\\nNRD = list(0 for i in range(n))\\n\\nfor i in range(m):\\n\\n r1, r2 = list(map(int, input().split()))\\n\\n NRD[r1 - 1] += 1\\n\\n NRD[r2 - 1] += 1\\n\\nfor i in range(n):\\n\\n print((NRD[i]))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 195,\n", + " 'code_v1_num_chars': 208,\n", + " 'code_v0_no_empty_lines': 'n, m = list(map(int, input().split()))\\nRD = list(list(map(int, input().split())) for _ in range(m))\\nfor i in range(1, n + 1):\\n ans = 0\\n for j in RD:\\n ans += j.count(i)\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nNRD = list(0 for i in range(n))\\nfor i in range(m):\\n r1, r2 = list(map(int, input().split()))\\n NRD[r1 - 1] += 1\\n NRD[r2 - 1] += 1\\nfor i in range(n):\\n print((NRD[i]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-RD = list(list(map(int, input().split())) for _ in range(m))',\n", + " '-for i in range(1, n + 1):',\n", + " '- ans = 0',\n", + " '- for j in RD:',\n", + " '- ans += j.count(i)',\n", + " '- print(ans)',\n", + " '+NRD = list(0 for i in range(n))',\n", + " '+for i in range(m):',\n", + " '+ r1, r2 = list(map(int, input().split()))',\n", + " '+ NRD[r1 - 1] += 1',\n", + " '+ NRD[r2 - 1] += 1',\n", + " '+for i in range(n):',\n", + " '+ print((NRD[i]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2888841586,\n", + " 'measured_runtime_v1': 0.0609361191,\n", + " 'runtime_lift': 4.7407705467,\n", + " 'key': ['s957846271', 's235024999']},\n", + " {'user_id': 'u461833298',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's458295975',\n", + " 'submission_id_v1': 's339978019',\n", + " 'cpu_time_v0': 623,\n", + " 'cpu_time_v1': 111,\n", + " 'memory_v0': 29124,\n", + " 'memory_v1': 13880,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.18,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nA = [int(x) for x in input().split()]\\n\\n\\n\\ntmp = [x for x in zip(A, list(range(1, N+1)))]\\n\\ntmp = np.array(sorted(tmp))\\n\\nprint((*tmp[:,1]))',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = [int(x) for x in input().split()]\\n\\nB = [0 for _ in range(N)]\\n\\nfor i in range(N):\\n\\n B[A[i]-1] = i+1\\n\\nprint((*B))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 166,\n", + " 'code_v1_num_chars': 134,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = [int(x) for x in input().split()]\\ntmp = [x for x in zip(A, list(range(1, N + 1)))]\\ntmp = np.array(sorted(tmp))\\nprint((*tmp[:, 1]))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [int(x) for x in input().split()]\\nB = [0 for _ in range(N)]\\nfor i in range(N):\\n B[A[i] - 1] = i + 1\\nprint((*B))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-tmp = [x for x in zip(A, list(range(1, N + 1)))]',\n", + " '-tmp = np.array(sorted(tmp))',\n", + " '-print((*tmp[:, 1]))',\n", + " '+B = [0 for _ in range(N)]',\n", + " '+for i in range(N):',\n", + " '+ B[A[i] - 1] = i + 1',\n", + " '+print((*B))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9516685504,\n", + " 'measured_runtime_v1': 0.359870365,\n", + " 'runtime_lift': 5.4232544271,\n", + " 'key': ['s458295975', 's339978019']},\n", + " {'user_id': 'u231095456',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's968664754',\n", + " 'submission_id_v1': 's390670273',\n", + " 'cpu_time_v0': 89,\n", + " 'cpu_time_v1': 32,\n", + " 'memory_v0': 11252,\n", + " 'memory_v1': 9336,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 64.04,\n", + " 'input': 'from math import floor, sqrt\\n\\nfrom collections import defaultdict\\n\\ndef factors(n):\\n\\n d = defaultdict(int)\\n\\n for i in range(2,floor(sqrt(n))+1):\\n\\n while n % i == 0:\\n\\n n //= i\\n\\n d[i] += 1\\n\\n if n == 1:\\n\\n break\\n\\n if n != 1:\\n\\n d[n] += 1\\n\\n return d\\n\\ndef inv(x, mod):\\n\\n k = mod - 2\\n\\n ret = 1\\n\\n while k > 0:\\n\\n if k&1:\\n\\n ret = (ret*x) % mod\\n\\n x = (x*x) % mod\\n\\n k >>= 1\\n\\n return ret\\n\\nN, M = list(map(int,input().split()))\\n\\nmod = 10**9+7\\n\\ndic = factors(M)\\n\\nK = len(dic)\\n\\nSIZE = N+max(dic.values()) if list(dic.values()) else N\\n\\nfact = [None]*(SIZE+1)\\n\\nfinv = [None]*(SIZE+1)\\n\\nfact[0] = 1\\n\\nfor i in range(1,SIZE+1):\\n\\n fact[i] = (fact[i-1]*i) % mod\\n\\nfinv[SIZE] = inv(fact[SIZE], mod=mod)\\n\\nfor i in range(SIZE, 0, -1):\\n\\n finv[i-1] = (finv[i]*i) % mod\\n\\ndef comb(n,k):\\n\\n tmp = (finv[k]*finv[n-k]) % mod\\n\\n return (fact[n]*tmp) % mod\\n\\nans = 1\\n\\nfor p in dic:\\n\\n ans = (ans*comb(dic[p]+N-1, dic[p])) % mod\\n\\nprint(ans)',\n", + " 'target': 'from math import floor, sqrt\\n\\nfrom collections import defaultdict\\n\\nN,M = list(map(int,input().split()))\\n\\nd = defaultdict(int)\\n\\nfor i in range(2, floor(sqrt(M))+1):\\n\\n while M % i == 0:\\n\\n d[i] += 1\\n\\n M //= i\\n\\nif M != 1:\\n\\n d[M] += 1\\n\\ndef comb(n,k):\\n\\n if k == 0:\\n\\n return 1\\n\\n return comb(n-1,k-1) * n // k\\n\\nans = 1\\n\\nfor e in list(d.values()):\\n\\n ans *= comb(N+e-1, e)\\n\\nprint((ans % (10**9+7)))',\n", + " 'code_v0_loc': 42,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 1009,\n", + " 'code_v1_num_chars': 410,\n", + " 'code_v0_no_empty_lines': 'from math import floor, sqrt\\nfrom collections import defaultdict\\n\\n\\ndef factors(n):\\n d = defaultdict(int)\\n for i in range(2, floor(sqrt(n)) + 1):\\n while n % i == 0:\\n n //= i\\n d[i] += 1\\n if n == 1:\\n break\\n if n != 1:\\n d[n] += 1\\n return d\\n\\n\\ndef inv(x, mod):\\n k = mod - 2\\n ret = 1\\n while k > 0:\\n if k & 1:\\n ret = (ret * x) % mod\\n x = (x * x) % mod\\n k >>= 1\\n return ret\\n\\n\\nN, M = list(map(int, input().split()))\\nmod = 10**9 + 7\\ndic = factors(M)\\nK = len(dic)\\nSIZE = N + max(dic.values()) if list(dic.values()) else N\\nfact = [None] * (SIZE + 1)\\nfinv = [None] * (SIZE + 1)\\nfact[0] = 1\\nfor i in range(1, SIZE + 1):\\n fact[i] = (fact[i - 1] * i) % mod\\nfinv[SIZE] = inv(fact[SIZE], mod=mod)\\nfor i in range(SIZE, 0, -1):\\n finv[i - 1] = (finv[i] * i) % mod\\n\\n\\ndef comb(n, k):\\n tmp = (finv[k] * finv[n - k]) % mod\\n return (fact[n] * tmp) % mod\\n\\n\\nans = 1\\nfor p in dic:\\n ans = (ans * comb(dic[p] + N - 1, dic[p])) % mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from math import floor, sqrt\\nfrom collections import defaultdict\\n\\nN, M = list(map(int, input().split()))\\nd = defaultdict(int)\\nfor i in range(2, floor(sqrt(M)) + 1):\\n while M % i == 0:\\n d[i] += 1\\n M //= i\\nif M != 1:\\n d[M] += 1\\n\\n\\ndef comb(n, k):\\n if k == 0:\\n return 1\\n return comb(n - 1, k - 1) * n // k\\n\\n\\nans = 1\\nfor e in list(d.values()):\\n ans *= comb(N + e - 1, e)\\nprint((ans % (10**9 + 7)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 57.1428571429,\n", + " 'diff': ['-',\n", + " '-def factors(n):',\n", + " '- d = defaultdict(int)',\n", + " '- for i in range(2, floor(sqrt(n)) + 1):',\n", + " '- while n % i == 0:',\n", + " '- n //= i',\n", + " '- d[i] += 1',\n", + " '- if n == 1:',\n", + " '- break',\n", + " '- if n != 1:',\n", + " '- d[n] += 1',\n", + " '- return d',\n", + " '-',\n", + " '-',\n", + " '-def inv(x, mod):',\n", + " '- k = mod - 2',\n", + " '- ret = 1',\n", + " '- while k > 0:',\n", + " '- if k & 1:',\n", + " '- ret = (ret * x) % mod',\n", + " '- x = (x * x) % mod',\n", + " '- k >>= 1',\n", + " '- return ret',\n", + " '-',\n", + " '-',\n", + " '-mod = 10**9 + 7',\n", + " '-dic = factors(M)',\n", + " '-K = len(dic)',\n", + " '-SIZE = N + max(dic.values()) if list(dic.values()) else N',\n", + " '-fact = [None] * (SIZE + 1)',\n", + " '-finv = [None] * (SIZE + 1)',\n", + " '-fact[0] = 1',\n", + " '-for i in range(1, SIZE + 1):',\n", + " '- fact[i] = (fact[i - 1] * i) % mod',\n", + " '-finv[SIZE] = inv(fact[SIZE], mod=mod)',\n", + " '-for i in range(SIZE, 0, -1):',\n", + " '- finv[i - 1] = (finv[i] * i) % mod',\n", + " '+d = defaultdict(int)',\n", + " '+for i in range(2, floor(sqrt(M)) + 1):',\n", + " '+ while M % i == 0:',\n", + " '+ d[i] += 1',\n", + " '+ M //= i',\n", + " '+if M != 1:',\n", + " '+ d[M] += 1',\n", + " '- tmp = (finv[k] * finv[n - k]) % mod',\n", + " '- return (fact[n] * tmp) % mod',\n", + " '+ if k == 0:',\n", + " '+ return 1',\n", + " '+ return comb(n - 1, k - 1) * n // k',\n", + " '-for p in dic:',\n", + " '- ans = (ans * comb(dic[p] + N - 1, dic[p])) % mod',\n", + " '-print(ans)',\n", + " '+for e in list(d.values()):',\n", + " '+ ans *= comb(N + e - 1, e)',\n", + " '+print((ans % (10**9 + 7)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3098533685,\n", + " 'measured_runtime_v1': 0.2185445104,\n", + " 'runtime_lift': 1.4178044005,\n", + " 'key': ['s968664754', 's390670273']},\n", + " {'user_id': 'u047796752',\n", + " 'problem_id': 'p03197',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's531607176',\n", + " 'submission_id_v1': 's450058032',\n", + " 'cpu_time_v0': 356,\n", + " 'cpu_time_v1': 241,\n", + " 'memory_v0': 49496,\n", + " 'memory_v1': 43868,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 32.3,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nfrom collections import *\\n\\n\\n\\ndef dfs(x, y):\\n\\n if x==0 and y==0:\\n\\n t[x][y] = False\\n\\n return False\\n\\n \\n\\n if x>=1:\\n\\n t[x][y] |= not dfs(x-1, y)\\n\\n \\n\\n if y>=1:\\n\\n t[x][y] |= not dfs(x, y-1)\\n\\n \\n\\n if min(x, y)>=1:\\n\\n t[x][y] |= not dfs(x-1, y-1)\\n\\n \\n\\n return t[x][y]\\n\\n \\n\\nt = [[False]*7 for _ in range(7)]\\n\\n\\n\\nfor i in range(7):\\n\\n for j in range(7):\\n\\n dfs(i, j)\\n\\n\\n\\n\"\"\"\\n\\nfor ti in t:\\n\\n print(*ti)\\n\\n\"\"\"\\n\\n\\n\\nN = int(eval(input()))\\n\\nflag = True\\n\\n\\n\\nfor _ in range(N):\\n\\n a = int(eval(input()))\\n\\n \\n\\n if a%2==1:\\n\\n flag = False\\n\\n \\n\\nif flag:\\n\\n print(\\'second\\')\\n\\nelse:\\n\\n print(\\'first\\')',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\"\"\"\\n\\ndef dfs(x, y):\\n\\n if x==0 and y==0:\\n\\n return False\\n\\n \\n\\n res = False\\n\\n \\n\\n if x>0:\\n\\n res |= not dfs(x-1, y)\\n\\n \\n\\n if y>0:\\n\\n res |= not dfs(x, y-1)\\n\\n \\n\\n if min(x, y)>0:\\n\\n res |= not dfs(x-1, y-1)\\n\\n \\n\\n return res\\n\\n \\n\\nt = [[False]*5 for _ in range(5)]\\n\\n\\n\\nfor i in range(5):\\n\\n for j in range(5):\\n\\n t[i][j] = dfs(i, j)\\n\\n\\n\\nfor ti in t:\\n\\n print(*ti)\\n\\n\"\"\"\\n\\n\\n\\nN = int(eval(input()))\\n\\na = [int(eval(input())) for _ in range(N)]\\n\\n\\n\\nfor ai in a:\\n\\n if ai%2==1:\\n\\n print(\\'first\\')\\n\\n exit()\\n\\n\\n\\nprint(\\'second\\')',\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 40,\n", + " 'code_v0_num_chars': 701,\n", + " 'code_v1_num_chars': 621,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nfrom collections import *\\n\\n\\ndef dfs(x, y):\\n if x == 0 and y == 0:\\n t[x][y] = False\\n return False\\n if x >= 1:\\n t[x][y] |= not dfs(x - 1, y)\\n if y >= 1:\\n t[x][y] |= not dfs(x, y - 1)\\n if min(x, y) >= 1:\\n t[x][y] |= not dfs(x - 1, y - 1)\\n return t[x][y]\\n\\n\\nt = [[False] * 7 for _ in range(7)]\\nfor i in range(7):\\n for j in range(7):\\n dfs(i, j)\\n\"\"\"\\nfor ti in t:\\n print(*ti)\\n\"\"\"\\nN = int(eval(input()))\\nflag = True\\nfor _ in range(N):\\n a = int(eval(input()))\\n if a % 2 == 1:\\n flag = False\\nif flag:\\n print(\"second\")\\nelse:\\n print(\"first\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\"\"\"\\ndef dfs(x, y):\\n if x==0 and y==0:\\n return False\\n res = False\\n if x>0:\\n res |= not dfs(x-1, y)\\n if y>0:\\n res |= not dfs(x, y-1)\\n if min(x, y)>0:\\n res |= not dfs(x-1, y-1)\\n return res\\nt = [[False]*5 for _ in range(5)]\\nfor i in range(5):\\n for j in range(5):\\n t[i][j] = dfs(i, j)\\nfor ti in t:\\n print(*ti)\\n\"\"\"\\nN = int(eval(input()))\\na = [int(eval(input())) for _ in range(N)]\\nfor ai in a:\\n if ai % 2 == 1:\\n print(\"first\")\\n exit()\\nprint(\"second\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-from collections import *',\n", + " '-',\n", + " '-',\n", + " '+\"\"\"',\n", + " '- if x == 0 and y == 0:',\n", + " '- t[x][y] = False',\n", + " '+ if x==0 and y==0:',\n", + " '- if x >= 1:',\n", + " '- t[x][y] |= not dfs(x - 1, y)',\n", + " '- if y >= 1:',\n", + " '- t[x][y] |= not dfs(x, y - 1)',\n", + " '- if min(x, y) >= 1:',\n", + " '- t[x][y] |= not dfs(x - 1, y - 1)',\n", + " '- return t[x][y]',\n", + " '-',\n", + " '-',\n", + " '-t = [[False] * 7 for _ in range(7)]',\n", + " '-for i in range(7):',\n", + " '- for j in range(7):',\n", + " '- dfs(i, j)',\n", + " '-\"\"\"',\n", + " '+ res = False',\n", + " '+ if x>0:',\n", + " '+ res |= not dfs(x-1, y)',\n", + " '+ if y>0:',\n", + " '+ res |= not dfs(x, y-1)',\n", + " '+ if min(x, y)>0:',\n", + " '+ res |= not dfs(x-1, y-1)',\n", + " '+ return res',\n", + " '+t = [[False]*5 for _ in range(5)]',\n", + " '+for i in range(5):',\n", + " '+ for j in range(5):',\n", + " '+ t[i][j] = dfs(i, j)',\n", + " '-flag = True',\n", + " '-for _ in range(N):',\n", + " '- a = int(eval(input()))',\n", + " '- if a % 2 == 1:',\n", + " '- flag = False',\n", + " '-if flag:',\n", + " '- print(\"second\")',\n", + " '-else:',\n", + " '- print(\"first\")',\n", + " '+a = [int(eval(input())) for _ in range(N)]',\n", + " '+for ai in a:',\n", + " '+ if ai % 2 == 1:',\n", + " '+ print(\"first\")',\n", + " '+ exit()',\n", + " '+print(\"second\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4127988609,\n", + " 'measured_runtime_v1': 0.1956315268,\n", + " 'runtime_lift': 2.1100835213,\n", + " 'key': ['s531607176', 's450058032']},\n", + " {'user_id': 'u816872429',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's052587697',\n", + " 'submission_id_v1': 's157699880',\n", + " 'cpu_time_v0': 41,\n", + " 'cpu_time_v1': 28,\n", + " 'memory_v0': 4096,\n", + " 'memory_v1': 4460,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 31.71,\n", + " 'input': 'import heapq\\n\\n\\n\\nx, y, z, k = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nb = list(map(int, input().split()))\\n\\nc = list(map(int, input().split()))\\n\\n\\n\\ndef diff(l):\\n\\n m = max(l)\\n\\n return sorted(m - v for v in l)[1:]\\n\\n\\n\\ns = sum(map(max, [a, b, c]))\\n\\nsa, sb, sc = list(map(diff, [a, b, c]))\\n\\nda, db, dc = [0], [0], [0]\\n\\nq = [0]\\n\\nwhile k > 0:\\n\\n while True:\\n\\n if len(sa) > 0 and (len(q) == 0 or q[0] > sa[0]):\\n\\n for v in [sa[0] + bb + cc for bb in db for cc in dc]:\\n\\n heapq.heappush(q, v)\\n\\n da.append(sa[0])\\n\\n sa = sa[1:]\\n\\n elif len(sb) > 0 and (len(q) == 0 or q[0] > sb[0]):\\n\\n for v in [sb[0] + aa + cc for aa in da for cc in dc]:\\n\\n heapq.heappush(q, v)\\n\\n db.append(sb[0])\\n\\n sb = sb[1:]\\n\\n elif len(sc) > 0 and (len(q) == 0 or q[0] > sc[0]):\\n\\n for v in [sc[0] + aa + bb for aa in da for bb in db]:\\n\\n heapq.heappush(q, v)\\n\\n dc.append(sc[0])\\n\\n sc = sc[1:]\\n\\n else:\\n\\n break\\n\\n v = heapq.heappop(q)\\n\\n print(s - v)\\n\\n k -= 1\\n',\n", + " 'target': 'import heapq\\n\\n\\n\\nx, y, z, k = list(map(int, input().split()))\\n\\na = sorted(map(int, input().split()))\\n\\nb = sorted(map(int, input().split()))\\n\\nc = sorted(map(int, input().split()))\\n\\n\\n\\nq = []\\n\\nmemo = set()\\n\\ndef qpush(q, ai, bi, ci):\\n\\n t = (-(a[ai] + b[bi] + c[ci]), ai, bi, ci)\\n\\n if not t in memo:\\n\\n memo.add(t)\\n\\n heapq.heappush(q, t)\\n\\n\\n\\nqpush(q, len(a) - 1, len(b) - 1, len(c) - 1)\\n\\nfor _ in range(k):\\n\\n s, ai, bi, ci = heapq.heappop(q)\\n\\n if ai > 0:\\n\\n qpush(q, ai - 1, bi, ci)\\n\\n if bi > 0:\\n\\n qpush(q, ai, bi - 1, ci)\\n\\n if ci > 0:\\n\\n qpush(q, ai, bi, ci - 1)\\n\\n print(-s)\\n',\n", + " 'code_v0_loc': 37,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 1122,\n", + " 'code_v1_num_chars': 631,\n", + " 'code_v0_no_empty_lines': 'import heapq\\n\\nx, y, z, k = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nc = list(map(int, input().split()))\\n\\n\\ndef diff(l):\\n m = max(l)\\n return sorted(m - v for v in l)[1:]\\n\\n\\ns = sum(map(max, [a, b, c]))\\nsa, sb, sc = list(map(diff, [a, b, c]))\\nda, db, dc = [0], [0], [0]\\nq = [0]\\nwhile k > 0:\\n while True:\\n if len(sa) > 0 and (len(q) == 0 or q[0] > sa[0]):\\n for v in [sa[0] + bb + cc for bb in db for cc in dc]:\\n heapq.heappush(q, v)\\n da.append(sa[0])\\n sa = sa[1:]\\n elif len(sb) > 0 and (len(q) == 0 or q[0] > sb[0]):\\n for v in [sb[0] + aa + cc for aa in da for cc in dc]:\\n heapq.heappush(q, v)\\n db.append(sb[0])\\n sb = sb[1:]\\n elif len(sc) > 0 and (len(q) == 0 or q[0] > sc[0]):\\n for v in [sc[0] + aa + bb for aa in da for bb in db]:\\n heapq.heappush(q, v)\\n dc.append(sc[0])\\n sc = sc[1:]\\n else:\\n break\\n v = heapq.heappop(q)\\n print(s - v)\\n k -= 1\\n',\n", + " 'code_v1_no_empty_lines': 'import heapq\\n\\nx, y, z, k = list(map(int, input().split()))\\na = sorted(map(int, input().split()))\\nb = sorted(map(int, input().split()))\\nc = sorted(map(int, input().split()))\\nq = []\\nmemo = set()\\n\\n\\ndef qpush(q, ai, bi, ci):\\n t = (-(a[ai] + b[bi] + c[ci]), ai, bi, ci)\\n if not t in memo:\\n memo.add(t)\\n heapq.heappush(q, t)\\n\\n\\nqpush(q, len(a) - 1, len(b) - 1, len(c) - 1)\\nfor _ in range(k):\\n s, ai, bi, ci = heapq.heappop(q)\\n if ai > 0:\\n qpush(q, ai - 1, bi, ci)\\n if bi > 0:\\n qpush(q, ai, bi - 1, ci)\\n if ci > 0:\\n qpush(q, ai, bi, ci - 1)\\n print(-s)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 32.4324324324,\n", + " 'diff': ['-a = list(map(int, input().split()))',\n", + " '-b = list(map(int, input().split()))',\n", + " '-c = list(map(int, input().split()))',\n", + " '+a = sorted(map(int, input().split()))',\n", + " '+b = sorted(map(int, input().split()))',\n", + " '+c = sorted(map(int, input().split()))',\n", + " '+q = []',\n", + " '+memo = set()',\n", + " '-def diff(l):',\n", + " '- m = max(l)',\n", + " '- return sorted(m - v for v in l)[1:]',\n", + " '+def qpush(q, ai, bi, ci):',\n", + " '+ t = (-(a[ai] + b[bi] + c[ci]), ai, bi, ci)',\n", + " '+ if not t in memo:',\n", + " '+ memo.add(t)',\n", + " '+ heapq.heappush(q, t)',\n", + " '-s = sum(map(max, [a, b, c]))',\n", + " '-sa, sb, sc = list(map(diff, [a, b, c]))',\n", + " '-da, db, dc = [0], [0], [0]',\n", + " '-q = [0]',\n", + " '-while k > 0:',\n", + " '- while True:',\n", + " '- if len(sa) > 0 and (len(q) == 0 or q[0] > sa[0]):',\n", + " '- for v in [sa[0] + bb + cc for bb in db for cc in dc]:',\n", + " '- heapq.heappush(q, v)',\n", + " '- da.append(sa[0])',\n", + " '- sa = sa[1:]',\n", + " '- elif len(sb) > 0 and (len(q) == 0 or q[0] > sb[0]):',\n", + " '- for v in [sb[0] + aa + cc for aa in da for cc in dc]:',\n", + " '- heapq.heappush(q, v)',\n", + " '- db.append(sb[0])',\n", + " '- sb = sb[1:]',\n", + " '- elif len(sc) > 0 and (len(q) == 0 or q[0] > sc[0]):',\n", + " '- for v in [sc[0] + aa + bb for aa in da for bb in db]:',\n", + " '- heapq.heappush(q, v)',\n", + " '- dc.append(sc[0])',\n", + " '- sc = sc[1:]',\n", + " '- else:',\n", + " '- break',\n", + " '- v = heapq.heappop(q)',\n", + " '- print(s - v)',\n", + " '- k -= 1',\n", + " '+qpush(q, len(a) - 1, len(b) - 1, len(c) - 1)',\n", + " '+for _ in range(k):',\n", + " '+ s, ai, bi, ci = heapq.heappop(q)',\n", + " '+ if ai > 0:',\n", + " '+ qpush(q, ai - 1, bi, ci)',\n", + " '+ if bi > 0:',\n", + " '+ qpush(q, ai, bi - 1, ci)',\n", + " '+ if ci > 0:',\n", + " '+ qpush(q, ai, bi, ci - 1)',\n", + " '+ print(-s)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2304672,\n", + " 'measured_runtime_v1': 0.0062596636,\n", + " 'runtime_lift': 36.8178252168,\n", + " 'key': ['s052587697', 's157699880']},\n", + " {'user_id': 'u803617136',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's262574211',\n", + " 'submission_id_v1': 's998310124',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 3980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.91,\n", + " 'input': 'import math\\n\\n\\n\\nn = int(eval(input()))\\n\\nans = math.factorial(n) % (pow(10, 9) + 7)\\n\\nprint(ans)',\n", + " 'target': 'n = int(eval(input()))\\n\\nans = 1\\n\\nmod = 10 ** 9 + 7\\n\\nfor i in range(1, n + 1):\\n\\n ans = (ans * i % mod) % mod\\n\\nprint(ans)',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 87,\n", + " 'code_v1_num_chars': 116,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nans = math.factorial(n) % (pow(10, 9) + 7)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 1\\nmod = 10**9 + 7\\nfor i in range(1, n + 1):\\n ans = (ans * i % mod) % mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.6666666667,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-ans = math.factorial(n) % (pow(10, 9) + 7)',\n", + " '+ans = 1',\n", + " '+mod = 10**9 + 7',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans = (ans * i % mod) % mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5572224624,\n", + " 'measured_runtime_v1': 0.2586410534,\n", + " 'runtime_lift': 2.154423882,\n", + " 'key': ['s262574211', 's998310124']},\n", + " {'user_id': 'u696805736',\n", + " 'problem_id': 'p03837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's032580281',\n", + " 'submission_id_v1': 's724625000',\n", + " 'cpu_time_v0': 677,\n", + " 'cpu_time_v1': 276,\n", + " 'memory_v0': 62548,\n", + " 'memory_v1': 41072,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.23,\n", + " 'input': \"import queue\\n\\n\\n\\nINF = 123456789\\n\\n\\n\\ndef main():\\n\\n n,m = list(map(int,input().split()))\\n\\n\\n\\n G = [[] for _ in range(n)]\\n\\n for _ in range(m):\\n\\n a,b,c = list(map(int,input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n G[a].append((b,c))\\n\\n G[b].append((a,c))\\n\\n\\n\\n used = set()\\n\\n for i in range(n):\\n\\n d = [INF for _ in range(n)]\\n\\n par = [-1 for _ in range(n)]\\n\\n\\n\\n # dijkstra\\n\\n que = queue.PriorityQueue()\\n\\n d[i] = 0\\n\\n que.put((0,i))\\n\\n while not que.empty():\\n\\n p = que.get()\\n\\n v = p[1]\\n\\n if d[v] < p[0]:\\n\\n continue\\n\\n for (to,cost) in G[v]:\\n\\n if d[to] > d[v]+cost:\\n\\n d[to] = d[v]+cost\\n\\n par[to] = v\\n\\n que.put((d[to],to))\\n\\n\\n\\n for j in range(n):\\n\\n if i != j:\\n\\n a,b = j,par[j]\\n\\n if a>b:\\n\\n a,b = b,a\\n\\n used.add((a,b))\\n\\n\\n\\n print((m - len(used)))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"INF = 123456789\\n\\n\\n\\ndef main():\\n\\n n,m = list(map(int,input().split()))\\n\\n\\n\\n d = [ [INF for i in range(n)] for j in range(n) ]\\n\\n for i in range(n):\\n\\n d[i][i] = 0\\n\\n\\n\\n a = [0 for _ in range(m)]\\n\\n b = [0 for _ in range(m)]\\n\\n c = [0 for _ in range(m)]\\n\\n for i in range(m):\\n\\n a[i],b[i],c[i] = list(map(int,input().split()))\\n\\n a[i] -= 1\\n\\n b[i] -= 1\\n\\n d[a[i]][b[i]] = min(d[a[i]][b[i]], c[i])\\n\\n d[b[i]][a[i]] = min(d[b[i]][a[i]], c[i])\\n\\n\\n\\n # Warshall-Floyd\\n\\n for k in range(n):\\n\\n for i in range(n):\\n\\n for j in range(n):\\n\\n d[i][j] = min(d[i][j], d[i][k]+d[k][j])\\n\\n\\n\\n ans = 0\\n\\n for i in range(m):\\n\\n found = 1\\n\\n for j in range(n):\\n\\n if d[j][a[i]] + c[i] == d[j][b[i]]:\\n\\n found = 0\\n\\n break\\n\\n ans += found\\n\\n print(ans)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 46,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 1060,\n", + " 'code_v1_num_chars': 907,\n", + " 'code_v0_no_empty_lines': 'import queue\\n\\nINF = 123456789\\n\\n\\ndef main():\\n n, m = list(map(int, input().split()))\\n G = [[] for _ in range(n)]\\n for _ in range(m):\\n a, b, c = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n G[a].append((b, c))\\n G[b].append((a, c))\\n used = set()\\n for i in range(n):\\n d = [INF for _ in range(n)]\\n par = [-1 for _ in range(n)]\\n # dijkstra\\n que = queue.PriorityQueue()\\n d[i] = 0\\n que.put((0, i))\\n while not que.empty():\\n p = que.get()\\n v = p[1]\\n if d[v] < p[0]:\\n continue\\n for (to, cost) in G[v]:\\n if d[to] > d[v] + cost:\\n d[to] = d[v] + cost\\n par[to] = v\\n que.put((d[to], to))\\n for j in range(n):\\n if i != j:\\n a, b = j, par[j]\\n if a > b:\\n a, b = b, a\\n used.add((a, b))\\n print((m - len(used)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'INF = 123456789\\n\\n\\ndef main():\\n n, m = list(map(int, input().split()))\\n d = [[INF for i in range(n)] for j in range(n)]\\n for i in range(n):\\n d[i][i] = 0\\n a = [0 for _ in range(m)]\\n b = [0 for _ in range(m)]\\n c = [0 for _ in range(m)]\\n for i in range(m):\\n a[i], b[i], c[i] = list(map(int, input().split()))\\n a[i] -= 1\\n b[i] -= 1\\n d[a[i]][b[i]] = min(d[a[i]][b[i]], c[i])\\n d[b[i]][a[i]] = min(d[b[i]][a[i]], c[i])\\n # Warshall-Floyd\\n for k in range(n):\\n for i in range(n):\\n for j in range(n):\\n d[i][j] = min(d[i][j], d[i][k] + d[k][j])\\n ans = 0\\n for i in range(m):\\n found = 1\\n for j in range(n):\\n if d[j][a[i]] + c[i] == d[j][b[i]]:\\n found = 0\\n break\\n ans += found\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 19.5652173913,\n", + " 'diff': ['-import queue',\n", + " '-',\n", + " '- G = [[] for _ in range(n)]',\n", + " '- for _ in range(m):',\n", + " '- a, b, c = list(map(int, input().split()))',\n", + " '- a -= 1',\n", + " '- b -= 1',\n", + " '- G[a].append((b, c))',\n", + " '- G[b].append((a, c))',\n", + " '- used = set()',\n", + " '+ d = [[INF for i in range(n)] for j in range(n)]',\n", + " '- d = [INF for _ in range(n)]',\n", + " '- par = [-1 for _ in range(n)]',\n", + " '- # dijkstra',\n", + " '- que = queue.PriorityQueue()',\n", + " '- d[i] = 0',\n", + " '- que.put((0, i))',\n", + " '- while not que.empty():',\n", + " '- p = que.get()',\n", + " '- v = p[1]',\n", + " '- if d[v] < p[0]:',\n", + " '- continue',\n", + " '- for (to, cost) in G[v]:',\n", + " '- if d[to] > d[v] + cost:',\n", + " '- d[to] = d[v] + cost',\n", + " '- par[to] = v',\n", + " '- que.put((d[to], to))',\n", + " '+ d[i][i] = 0',\n", + " '+ a = [0 for _ in range(m)]',\n", + " '+ b = [0 for _ in range(m)]',\n", + " '+ c = [0 for _ in range(m)]',\n", + " '+ for i in range(m):',\n", + " '+ a[i], b[i], c[i] = list(map(int, input().split()))',\n", + " '+ a[i] -= 1',\n", + " '+ b[i] -= 1',\n", + " '+ d[a[i]][b[i]] = min(d[a[i]][b[i]], c[i])',\n", + " '+ d[b[i]][a[i]] = min(d[b[i]][a[i]], c[i])',\n", + " '+ # Warshall-Floyd',\n", + " '+ for k in range(n):',\n", + " '+ for i in range(n):',\n", + " '+ for j in range(n):',\n", + " '+ d[i][j] = min(d[i][j], d[i][k] + d[k][j])',\n", + " '+ ans = 0',\n", + " '+ for i in range(m):',\n", + " '+ found = 1',\n", + " '- if i != j:',\n", + " '- a, b = j, par[j]',\n", + " '- if a > b:',\n", + " '- a, b = b, a',\n", + " '- used.add((a, b))',\n", + " '- print((m - len(used)))',\n", + " '+ if d[j][a[i]] + c[i] == d[j][b[i]]:',\n", + " '+ found = 0',\n", + " '+ break',\n", + " '+ ans += found',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3167709551,\n", + " 'measured_runtime_v1': 0.2522355395,\n", + " 'runtime_lift': 1.2558537773,\n", + " 'key': ['s032580281', 's724625000']},\n", + " {'user_id': 'u580697892',\n", + " 'problem_id': 'p03126',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's815650621',\n", + " 'submission_id_v1': 's504616042',\n", + " 'cpu_time_v0': 326,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 20760,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 94.48,\n", + " 'input': 'import numpy as np\\n\\nN, M = list(map(int, input().split()))\\n\\nmenu = np.array([])\\n\\nfor i in range(N):\\n\\n a = np.array(input().split())\\n\\n menu = np.append(menu, a[1:])\\n\\nmenu = np.array(menu).astype(int).ravel()\\n\\ncount = 0\\n\\nfor i in range(1, M+1):\\n\\n if np.sum(menu == i) == N:\\n\\n count += 1\\n\\nprint(count)',\n", + " 'target': '# coding: utf-8\\n\\nn, m = list(map(int, input().split()))\\n\\nll = [0] * m\\n\\nfor i in range(n):\\n\\n l = list(map(int, input().split()))\\n\\n for j in range(l[0]):\\n\\n ll[l[j+1] - 1] += 1\\n\\nprint((ll.count(max(ll)) if max(ll)==n else 0))',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 298,\n", + " 'code_v1_num_chars': 227,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, M = list(map(int, input().split()))\\nmenu = np.array([])\\nfor i in range(N):\\n a = np.array(input().split())\\n menu = np.append(menu, a[1:])\\nmenu = np.array(menu).astype(int).ravel()\\ncount = 0\\nfor i in range(1, M + 1):\\n if np.sum(menu == i) == N:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nn, m = list(map(int, input().split()))\\nll = [0] * m\\nfor i in range(n):\\n l = list(map(int, input().split()))\\n for j in range(l[0]):\\n ll[l[j + 1] - 1] += 1\\nprint((ll.count(max(ll)) if max(ll) == n else 0))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-N, M = list(map(int, input().split()))',\n", + " '-menu = np.array([])',\n", + " '-for i in range(N):',\n", + " '- a = np.array(input().split())',\n", + " '- menu = np.append(menu, a[1:])',\n", + " '-menu = np.array(menu).astype(int).ravel()',\n", + " '-count = 0',\n", + " '-for i in range(1, M + 1):',\n", + " '- if np.sum(menu == i) == N:',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+# coding: utf-8',\n", + " '+n, m = list(map(int, input().split()))',\n", + " '+ll = [0] * m',\n", + " '+for i in range(n):',\n", + " '+ l = list(map(int, input().split()))',\n", + " '+ for j in range(l[0]):',\n", + " '+ ll[l[j + 1] - 1] += 1',\n", + " '+print((ll.count(max(ll)) if max(ll) == n else 0))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4087881777,\n", + " 'measured_runtime_v1': 0.1976648209,\n", + " 'runtime_lift': 7.1271568263,\n", + " 'key': ['s815650621', 's504616042']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's653342727',\n", + " 'submission_id_v1': 's579349204',\n", + " 'cpu_time_v0': 535,\n", + " 'cpu_time_v1': 476,\n", + " 'memory_v0': 31964,\n", + " 'memory_v1': 42656,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.03,\n", + " 'input': 'from heapq import heappop, heappush\\n\\n\\n\\nn, m = list(map(int, input().split()))\\n\\na = tuple(map(int, input().split()))\\n\\n\\n\\nhq = []\\n\\nfor aa in a:\\n\\n heappush(hq, (-aa, 1))\\n\\n\\n\\nfor _ in range(m):\\n\\n b, c = list(map(int, input().split()))\\n\\n heappush(hq, (-c, b))\\n\\n\\n\\nrest = n\\n\\nans = 0\\n\\nwhile rest > 0:\\n\\n num, cnt = heappop(hq)\\n\\n\\n\\n num *= (-1)\\n\\n use = min(rest, cnt)\\n\\n ans += use * num\\n\\n rest -= use\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': \"def main():\\n\\n from collections import Counter\\n\\n from operator import itemgetter\\n\\n\\n\\n import sys\\n\\n input = sys.stdin.readline\\n\\n\\n\\n N, M = list(map(int, input().split()))\\n\\n a = list(map(int, input().split()))\\n\\n\\n\\n ctr = Counter(a)\\n\\n for _ in range(M):\\n\\n b, c = list(map(int, input().split()))\\n\\n ctr[c] += b\\n\\n\\n\\n ans = 0\\n\\n rest = N\\n\\n for integer, count in sorted(list(ctr.items()), key=itemgetter(0), reverse=True):\\n\\n take = min(rest, count)\\n\\n ans += take * integer\\n\\n rest -= take\\n\\n if not rest:\\n\\n break\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\\n\\n\\n# import sys\\n\\n# input = sys.stdin.readline\\n\\n# \\n\\n# sys.setrecursionlimit(10 ** 7)\\n\\n# \\n\\n# (int(x)-1 for x in input().split())\\n\\n# rstrip()\\n\",\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 414,\n", + " 'code_v1_num_chars': 760,\n", + " 'code_v0_no_empty_lines': 'from heapq import heappop, heappush\\n\\nn, m = list(map(int, input().split()))\\na = tuple(map(int, input().split()))\\nhq = []\\nfor aa in a:\\n heappush(hq, (-aa, 1))\\nfor _ in range(m):\\n b, c = list(map(int, input().split()))\\n heappush(hq, (-c, b))\\nrest = n\\nans = 0\\nwhile rest > 0:\\n num, cnt = heappop(hq)\\n num *= -1\\n use = min(rest, cnt)\\n ans += use * num\\n rest -= use\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n from collections import Counter\\n from operator import itemgetter\\n import sys\\n\\n input = sys.stdin.readline\\n N, M = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n ctr = Counter(a)\\n for _ in range(M):\\n b, c = list(map(int, input().split()))\\n ctr[c] += b\\n ans = 0\\n rest = N\\n for integer, count in sorted(list(ctr.items()), key=itemgetter(0), reverse=True):\\n take = min(rest, count)\\n ans += take * integer\\n rest -= take\\n if not rest:\\n break\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n# import sys\\n# input = sys.stdin.readline\\n#\\n# sys.setrecursionlimit(10 ** 7)\\n#\\n# (int(x)-1 for x in input().split())\\n# rstrip()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.1351351351,\n", + " 'diff': ['-from heapq import heappop, heappush',\n", + " '+def main():',\n", + " '+ from collections import Counter',\n", + " '+ from operator import itemgetter',\n", + " '+ import sys',\n", + " '-n, m = list(map(int, input().split()))',\n", + " '-a = tuple(map(int, input().split()))',\n", + " '-hq = []',\n", + " '-for aa in a:',\n", + " '- heappush(hq, (-aa, 1))',\n", + " '-for _ in range(m):',\n", + " '- b, c = list(map(int, input().split()))',\n", + " '- heappush(hq, (-c, b))',\n", + " '-rest = n',\n", + " '-ans = 0',\n", + " '-while rest > 0:',\n", + " '- num, cnt = heappop(hq)',\n", + " '- num *= -1',\n", + " '- use = min(rest, cnt)',\n", + " '- ans += use * num',\n", + " '- rest -= use',\n", + " '-print(ans)',\n", + " '+ input = sys.stdin.readline',\n", + " '+ N, M = list(map(int, input().split()))',\n", + " '+ a = list(map(int, input().split()))',\n", + " '+ ctr = Counter(a)',\n", + " '+ for _ in range(M):',\n", + " '+ b, c = list(map(int, input().split()))',\n", + " '+ ctr[c] += b',\n", + " '+ ans = 0',\n", + " '+ rest = N',\n", + " '+ for integer, count in sorted(list(ctr.items()), key=itemgetter(0), reverse=True):',\n", + " '+ take = min(rest, count)',\n", + " '+ ans += take * integer',\n", + " '+ rest -= take',\n", + " '+ if not rest:',\n", + " '+ break',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()',\n", + " '+# import sys',\n", + " '+# input = sys.stdin.readline',\n", + " '+#',\n", + " '+# sys.setrecursionlimit(10 ** 7)',\n", + " '+#',\n", + " '+# (int(x)-1 for x in input().split())',\n", + " '+# rstrip()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3003652287,\n", + " 'measured_runtime_v1': 0.218658349,\n", + " 'runtime_lift': 1.3736737242,\n", + " 'key': ['s653342727', 's579349204']},\n", + " {'user_id': 'u272075541',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's628544873',\n", + " 'submission_id_v1': 's617455512',\n", + " 'cpu_time_v0': 325,\n", + " 'cpu_time_v1': 158,\n", + " 'memory_v0': 21516,\n", + " 'memory_v1': 13284,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 51.38,\n", + " 'input': 'import numpy as np\\n\\nn = int(eval(input()))\\n\\na = np.array(input().split(), np.int)\\n\\na.sort()\\n\\n\\n\\nans = []\\n\\nfor x in range(a[0], a[-1]+1):\\n\\n ans.append(np.sum((a - x) ** 2))\\n\\n\\n\\nprint((min(ans)))',\n", + " 'target': 'from decimal import Decimal, ROUND_HALF_UP\\n\\nimport numpy as np\\n\\nn = int(eval(input()))\\n\\nx = np.array(input().split(), int)\\n\\n\\n\\nm = Decimal(np.sum(x) / n)\\n\\nmq = int(m.quantize(0, rounding=ROUND_HALF_UP))\\n\\n\\n\\ns = np.sum((x-mq)**2)\\n\\nprint(s)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 186,\n", + " 'code_v1_num_chars': 230,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\na = np.array(input().split(), np.int)\\na.sort()\\nans = []\\nfor x in range(a[0], a[-1] + 1):\\n ans.append(np.sum((a - x) ** 2))\\nprint((min(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'from decimal import Decimal, ROUND_HALF_UP\\nimport numpy as np\\n\\nn = int(eval(input()))\\nx = np.array(input().split(), int)\\nm = Decimal(np.sum(x) / n)\\nmq = int(m.quantize(0, rounding=ROUND_HALF_UP))\\ns = np.sum((x - mq) ** 2)\\nprint(s)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['+from decimal import Decimal, ROUND_HALF_UP',\n", + " '-a = np.array(input().split(), np.int)',\n", + " '-a.sort()',\n", + " '-ans = []',\n", + " '-for x in range(a[0], a[-1] + 1):',\n", + " '- ans.append(np.sum((a - x) ** 2))',\n", + " '-print((min(ans)))',\n", + " '+x = np.array(input().split(), int)',\n", + " '+m = Decimal(np.sum(x) / n)',\n", + " '+mq = int(m.quantize(0, rounding=ROUND_HALF_UP))',\n", + " '+s = np.sum((x - mq) ** 2)',\n", + " '+print(s)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.7178692944,\n", + " 'measured_runtime_v1': 2.1309513599,\n", + " 'runtime_lift': 1.2754253079,\n", + " 'key': ['s628544873', 's617455512']},\n", + " {'user_id': 'u285891772',\n", + " 'problem_id': 'p02760',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's467740941',\n", + " 'submission_id_v1': 's972156170',\n", + " 'cpu_time_v0': 157,\n", + " 'cpu_time_v1': 38,\n", + " 'memory_v0': 13684,\n", + " 'memory_v1': 5204,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.8,\n", + " 'input': 'import sys, re\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\n\\nfrom itertools import accumulate, permutations, combinations, product, groupby\\n\\nfrom operator import itemgetter, mul\\n\\nfrom copy import deepcopy\\n\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\n\\nfrom bisect import bisect, bisect_left\\n\\nfrom fractions import gcd\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import reduce\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\ndef ZIP(n): return list(zip(*(MAP() for _ in range(n))))\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float(\\'inf\\')\\n\\nmod = 10 ** 9 + 7\\n\\nimport numpy as np\\n\\n\\n\\nA1 = LIST()\\n\\nA2 = LIST()\\n\\nA3 = LIST()\\n\\nN = INT()\\n\\nB = np.ones(N)\\n\\nfor i in range(N):\\n\\n B[i] = INT()\\n\\n \\n\\nB = list(B)\\n\\n\\n\\ndef bingo_array(A, B):\\n\\n for i in range(3):\\n\\n for x in B:\\n\\n if A[i] == x:\\n\\n A[i] *= 0\\n\\n \\n\\nbingo_array(A1, B)\\n\\nbingo_array(A2, B)\\n\\nbingo_array(A3, B)\\n\\n\\n\\nif sum(A1) == 0 or sum(A2) == 0 or sum(A3) == 0:\\n\\n print(\"Yes\")\\n\\nelif A1[0]+A2[0]+A3[0] == 0 or A1[1]+A2[1]+A3[1] == 0 or A1[2]+A2[2]+A3[2] == 0:\\n\\n print(\"Yes\")\\n\\nelif A1[0]+A2[1]+A3[2] == 0 or A1[2]+A2[1]+A3[0] == 0:\\n\\n print(\"Yes\")\\n\\nelse:\\n\\n print(\"No\")',\n", + " 'target': 'import sys, re\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\n\\nfrom itertools import accumulate, permutations, combinations, product\\n\\nfrom operator import itemgetter, mul\\n\\nfrom copy import deepcopy\\n\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\n\\nfrom bisect import bisect, bisect_left\\n\\nfrom fractions import gcd\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import reduce\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float(\\'inf\\')\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\nA = [LIST() for _ in range(3)]\\n\\nN = INT()\\n\\nb = [INT() for _ in range(N)]\\n\\n\\n\\ncheck = [[0]*3 for _ in range(3)]\\n\\n\\n\\nfor n in b:\\n\\n for i in range(3):\\n\\n for j in range(3):\\n\\n if A[i][j] == n:\\n\\n check[i][j] = 1\\n\\n\\n\\nfor i in range(3):\\n\\n if sum(check[i]) == 3:\\n\\n print(\"Yes\")\\n\\n exit()\\n\\n\\n\\nfor i in range(3):\\n\\n if check[0][i] and check[1][i] and check[2][i]:\\n\\n print(\"Yes\")\\n\\n exit()\\n\\n \\n\\nif check[0][0] and check[1][1] and check[2][2]:\\n\\n print(\"Yes\")\\n\\n exit()\\n\\n \\n\\nif check[0][2] and check[1][1] and check[2][0]:\\n\\n print(\"Yes\")\\n\\n exit()\\n\\n \\n\\nprint(\"No\")',\n", + " 'code_v0_loc': 49,\n", + " 'code_v1_loc': 50,\n", + " 'code_v0_num_chars': 1354,\n", + " 'code_v1_num_chars': 1299,\n", + " 'code_v0_no_empty_lines': 'import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\nfrom itertools import accumulate, permutations, combinations, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left\\nfrom fractions import gcd\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST():\\n return list(map(int, input().split()))\\n\\n\\ndef ZIP(n):\\n return list(zip(*(MAP() for _ in range(n))))\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nmod = 10**9 + 7\\nimport numpy as np\\n\\nA1 = LIST()\\nA2 = LIST()\\nA3 = LIST()\\nN = INT()\\nB = np.ones(N)\\nfor i in range(N):\\n B[i] = INT()\\nB = list(B)\\n\\n\\ndef bingo_array(A, B):\\n for i in range(3):\\n for x in B:\\n if A[i] == x:\\n A[i] *= 0\\n\\n\\nbingo_array(A1, B)\\nbingo_array(A2, B)\\nbingo_array(A3, B)\\nif sum(A1) == 0 or sum(A2) == 0 or sum(A3) == 0:\\n print(\"Yes\")\\nelif (\\n A1[0] + A2[0] + A3[0] == 0\\n or A1[1] + A2[1] + A3[1] == 0\\n or A1[2] + A2[2] + A3[2] == 0\\n):\\n print(\"Yes\")\\nelif A1[0] + A2[1] + A3[2] == 0 or A1[2] + A2[1] + A3[0] == 0:\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\nfrom itertools import accumulate, permutations, combinations, product\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left\\nfrom fractions import gcd\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST():\\n return list(map(int, input().split()))\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nmod = 10**9 + 7\\nA = [LIST() for _ in range(3)]\\nN = INT()\\nb = [INT() for _ in range(N)]\\ncheck = [[0] * 3 for _ in range(3)]\\nfor n in b:\\n for i in range(3):\\n for j in range(3):\\n if A[i][j] == n:\\n check[i][j] = 1\\nfor i in range(3):\\n if sum(check[i]) == 3:\\n print(\"Yes\")\\n exit()\\nfor i in range(3):\\n if check[0][i] and check[1][i] and check[2][i]:\\n print(\"Yes\")\\n exit()\\nif check[0][0] and check[1][1] and check[2][2]:\\n print(\"Yes\")\\n exit()\\nif check[0][2] and check[1][1] and check[2][0]:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.0,\n", + " 'diff': ['-from itertools import accumulate, permutations, combinations, product, groupby',\n", + " '+from itertools import accumulate, permutations, combinations, product',\n", + " '-def ZIP(n):',\n", + " '- return list(zip(*(MAP() for _ in range(n))))',\n", + " '-',\n", + " '-',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-A1 = LIST()',\n", + " '-A2 = LIST()',\n", + " '-A3 = LIST()',\n", + " '+A = [LIST() for _ in range(3)]',\n", + " '-B = np.ones(N)',\n", + " '-for i in range(N):',\n", + " '- B[i] = INT()',\n", + " '-B = list(B)',\n", + " '-',\n", + " '-',\n", + " '-def bingo_array(A, B):',\n", + " '+b = [INT() for _ in range(N)]',\n", + " '+check = [[0] * 3 for _ in range(3)]',\n", + " '+for n in b:',\n", + " '- for x in B:',\n", + " '- if A[i] == x:',\n", + " '- A[i] *= 0',\n", + " '-',\n", + " '-',\n", + " '-bingo_array(A1, B)',\n", + " '-bingo_array(A2, B)',\n", + " '-bingo_array(A3, B)',\n", + " '-if sum(A1) == 0 or sum(A2) == 0 or sum(A3) == 0:',\n", + " '+ for j in range(3):',\n", + " '+ if A[i][j] == n:',\n", + " '+ check[i][j] = 1',\n", + " '+for i in range(3):',\n", + " '+ if sum(check[i]) == 3:',\n", + " '+ print(\"Yes\")',\n", + " '+ exit()',\n", + " '+for i in range(3):',\n", + " '+ if check[0][i] and check[1][i] and check[2][i]:',\n", + " '+ print(\"Yes\")',\n", + " '+ exit()',\n", + " '+if check[0][0] and check[1][1] and check[2][2]:',\n", + " '-elif (',\n", + " '- A1[0] + A2[0] + A3[0] == 0',\n", + " '- or A1[1] + A2[1] + A3[1] == 0',\n", + " '- or A1[2] + A2[2] + A3[2] == 0',\n", + " '-):',\n", + " '+ exit()',\n", + " '+if check[0][2] and check[1][1] and check[2][0]:',\n", + " '-elif A1[0] + A2[1] + A3[2] == 0 or A1[2] + A2[1] + A3[0] == 0:',\n", + " '- print(\"Yes\")',\n", + " '-else:',\n", + " '- print(\"No\")',\n", + " '+ exit()',\n", + " '+print(\"No\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2329144027,\n", + " 'measured_runtime_v1': 0.183397862,\n", + " 'runtime_lift': 6.7226214608,\n", + " 'key': ['s467740941', 's972156170']},\n", + " {'user_id': 'u442877951',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's498895748',\n", + " 'submission_id_v1': 's605488454',\n", + " 'cpu_time_v0': 574,\n", + " 'cpu_time_v1': 295,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.61,\n", + " 'input': 'import math\\n\\nN = int(eval(input()))\\n\\nans = 10**12\\n\\nfor i in range(1,10**6+1):\\n\\n j = math.ceil(N/(i+1))\\n\\n if (1+i)*j == N:\\n\\n ans = min(i+j-1,ans)\\n\\n if i == 10**6 and ans == 10**12:\\n\\n ans = N-1\\n\\n break\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\nans = 10**12\\n\\nfor i in range(1,10**6+1):\\n\\n j = N//i\\n\\n if i*j == N:\\n\\n ans = min(i+j-2,ans)\\n\\n if i == 10**6 and ans == 10**12:\\n\\n ans = N-1\\n\\n break\\n\\nprint(ans)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 217,\n", + " 'code_v1_num_chars': 186,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nans = 10**12\\nfor i in range(1, 10**6 + 1):\\n j = math.ceil(N / (i + 1))\\n if (1 + i) * j == N:\\n ans = min(i + j - 1, ans)\\n if i == 10**6 and ans == 10**12:\\n ans = N - 1\\n break\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nans = 10**12\\nfor i in range(1, 10**6 + 1):\\n j = N // i\\n if i * j == N:\\n ans = min(i + j - 2, ans)\\n if i == 10**6 and ans == 10**12:\\n ans = N - 1\\n break\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '- j = math.ceil(N / (i + 1))',\n", + " '- if (1 + i) * j == N:',\n", + " '- ans = min(i + j - 1, ans)',\n", + " '+ j = N // i',\n", + " '+ if i * j == N:',\n", + " '+ ans = min(i + j - 2, ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 3.3566168053,\n", + " 'measured_runtime_v1': 2.0076369724,\n", + " 'runtime_lift': 1.6719241832,\n", + " 'key': ['s498895748', 's605488454']},\n", + " {'user_id': 'u133936772',\n", + " 'problem_id': 'p02685',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's693454638',\n", + " 'submission_id_v1': 's088786085',\n", + " 'cpu_time_v0': 1252,\n", + " 'cpu_time_v1': 782,\n", + " 'memory_v0': 9184,\n", + " 'memory_v1': 9192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.54,\n", + " 'input': 'M=998244353\\n\\nn,m,k=list(map(int,input().split()))\\n\\na=0\\n\\nc=1\\n\\nfor i in range(k+1):\\n\\n a+=c*m*pow(m-1,n-i-1,M)\\n\\n c=c*(n-i-1)*pow(i+1,M-2,M)%M\\n\\nprint((a%M))',\n", + " 'target': 'M=998244353\\n\\nn,m,k=list(map(int,input().split()))\\n\\na,c=0,1\\n\\nfor i in range(k+1):\\n\\n a+=c*m*pow(m-1,n+~i,M)\\n\\n c=c*(n+~i)*pow(i+1,-1,M)%M\\n\\nprint((a%M))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 146,\n", + " 'code_v1_num_chars': 142,\n", + " 'code_v0_no_empty_lines': 'M = 998244353\\nn, m, k = list(map(int, input().split()))\\na = 0\\nc = 1\\nfor i in range(k + 1):\\n a += c * m * pow(m - 1, n - i - 1, M)\\n c = c * (n - i - 1) * pow(i + 1, M - 2, M) % M\\nprint((a % M))\\n',\n", + " 'code_v1_no_empty_lines': 'M = 998244353\\nn, m, k = list(map(int, input().split()))\\na, c = 0, 1\\nfor i in range(k + 1):\\n a += c * m * pow(m - 1, n + ~i, M)\\n c = c * (n + ~i) * pow(i + 1, -1, M) % M\\nprint((a % M))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-a = 0',\n", + " '-c = 1',\n", + " '+a, c = 0, 1',\n", + " '- a += c * m * pow(m - 1, n - i - 1, M)',\n", + " '- c = c * (n - i - 1) * pow(i + 1, M - 2, M) % M',\n", + " '+ a += c * m * pow(m - 1, n + ~i, M)',\n", + " '+ c = c * (n + ~i) * pow(i + 1, -1, M) % M'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5053028598,\n", + " 'measured_runtime_v1': 0.3381624324,\n", + " 'runtime_lift': 1.4942607792,\n", + " 'key': ['s693454638', 's088786085']},\n", + " {'user_id': 'u622570247',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's074380513',\n", + " 'submission_id_v1': 's228830644',\n", + " 'cpu_time_v0': 1054,\n", + " 'cpu_time_v1': 898,\n", + " 'memory_v0': 45492,\n", + " 'memory_v1': 47732,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.8,\n", + " 'input': 'from collections import Counter\\n\\nimport heapq\\n\\n\\n\\nn = int(eval(input()))\\n\\nss = []\\n\\nfor _ in range(n):\\n\\n ss.append(input().rstrip())\\n\\nctr = Counter(ss)\\n\\nheap = [(-v, k) for k, v in list(ctr.items())]\\n\\nheapq.heapify(heap)\\n\\nmaxv = heap[0][0]\\n\\nwhile heap:\\n\\n c = heapq.heappop(heap)\\n\\n if c[0] != maxv:\\n\\n break\\n\\n print((c[1]))\\n',\n", + " 'target': 'from collections import Counter\\n\\n\\n\\nn = int(eval(input()))\\n\\nss = []\\n\\nfor _ in range(n):\\n\\n ss.append(input().rstrip())\\n\\nctr = Counter(ss)\\n\\n\\n\\na = sorted([(-v, k) for k, v in list(ctr.items())])\\n\\nmaxv = a[0][0]\\n\\nfor i in range(len(a)):\\n\\n if a[i][0] != maxv:\\n\\n break\\n\\n print((a[i][1]))',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 325,\n", + " 'code_v1_num_chars': 282,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\nimport heapq\\n\\nn = int(eval(input()))\\nss = []\\nfor _ in range(n):\\n ss.append(input().rstrip())\\nctr = Counter(ss)\\nheap = [(-v, k) for k, v in list(ctr.items())]\\nheapq.heapify(heap)\\nmaxv = heap[0][0]\\nwhile heap:\\n c = heapq.heappop(heap)\\n if c[0] != maxv:\\n break\\n print((c[1]))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\n\\nn = int(eval(input()))\\nss = []\\nfor _ in range(n):\\n ss.append(input().rstrip())\\nctr = Counter(ss)\\na = sorted([(-v, k) for k, v in list(ctr.items())])\\nmaxv = a[0][0]\\nfor i in range(len(a)):\\n if a[i][0] != maxv:\\n break\\n print((a[i][1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-import heapq',\n", + " '-heap = [(-v, k) for k, v in list(ctr.items())]',\n", + " '-heapq.heapify(heap)',\n", + " '-maxv = heap[0][0]',\n", + " '-while heap:',\n", + " '- c = heapq.heappop(heap)',\n", + " '- if c[0] != maxv:',\n", + " '+a = sorted([(-v, k) for k, v in list(ctr.items())])',\n", + " '+maxv = a[0][0]',\n", + " '+for i in range(len(a)):',\n", + " '+ if a[i][0] != maxv:',\n", + " '- print((c[1]))',\n", + " '+ print((a[i][1]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3121475418,\n", + " 'measured_runtime_v1': 0.0064239368,\n", + " 'runtime_lift': 48.5913153977,\n", + " 'key': ['s074380513', 's228830644']},\n", + " {'user_id': 'u919633157',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's593917202',\n", + " 'submission_id_v1': 's901232961',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 42,\n", + " 'memory_v0': 3980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.74,\n", + " 'input': 'import math\\n\\nprint((math.factorial(int(eval(input())))%(10**9+7)))',\n", + " 'target': 'n=int(eval(input()))\\n\\nans=1\\n\\nfor i in range(1,n+1):\\n\\n ans*=i\\n\\n ans%=10**9+7\\n\\nprint(ans)',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 58,\n", + " 'code_v1_num_chars': 87,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nprint((math.factorial(int(eval(input()))) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 1\\nfor i in range(1, n + 1):\\n ans *= i\\n ans %= 10**9 + 7\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(int(eval(input()))) % (10**9 + 7)))',\n", + " '+n = int(eval(input()))',\n", + " '+ans = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= 10**9 + 7',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.9124054093,\n", + " 'measured_runtime_v1': 0.4053284261,\n", + " 'runtime_lift': 2.2510274398,\n", + " 'key': ['s593917202', 's901232961']},\n", + " {'user_id': 'u550574002',\n", + " 'problem_id': 'p03126',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's757696098',\n", + " 'submission_id_v1': 's038854174',\n", + " 'cpu_time_v0': 23,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 3572,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.39,\n", + " 'input': 'import functools\\n\\nprint((len(functools.reduce(lambda x, y: x&y,[set(input().split()[1:]) for _ in [0]*int(input().split()[0])]))))',\n", + " 'target': 'print((len(set.intersection(*[set(input().split()[1:]) for _ in [0]*int(input().split()[0])]))))',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 1,\n", + " 'code_v0_num_chars': 128,\n", + " 'code_v1_num_chars': 94,\n", + " 'code_v0_no_empty_lines': 'import functools\\n\\nprint(\\n (\\n len(\\n functools.reduce(\\n lambda x, y: x & y,\\n [set(input().split()[1:]) for _ in [0] * int(input().split()[0])],\\n )\\n )\\n )\\n)\\n',\n", + " 'code_v1_no_empty_lines': 'print(\\n (\\n len(\\n set.intersection(\\n *[set(input().split()[1:]) for _ in [0] * int(input().split()[0])]\\n )\\n )\\n )\\n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-import functools',\n", + " '-',\n", + " '- functools.reduce(',\n", + " '- lambda x, y: x & y,',\n", + " '- [set(input().split()[1:]) for _ in [0] * int(input().split()[0])],',\n", + " '+ set.intersection(',\n", + " '+ *[set(input().split()[1:]) for _ in [0] * int(input().split()[0])]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2541026509,\n", + " 'measured_runtime_v1': 0.0938221338,\n", + " 'runtime_lift': 2.7083444025,\n", + " 'key': ['s757696098', 's038854174']},\n", + " {'user_id': 'u983918956',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's018952102',\n", + " 'submission_id_v1': 's778219351',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 49.15,\n", + " 'input': 'A,B = list(map(int,input().split()))\\n\\nj = 0\\n\\nfor i in range(A,B+1):\\n\\n l = list(str(i))\\n\\n l_reverse = list(reversed(l))\\n\\n if l == l_reverse:\\n\\n j += 1\\n\\nprint(j)',\n", + " 'target': 'A, B = list(map(int,input().split()))\\n\\n\\n\\nans = 0\\n\\nfor n in range(A, B+1):\\n\\n n = str(n)\\n\\n if n == n[::-1]:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 158,\n", + " 'code_v1_num_chars': 135,\n", + " 'code_v0_no_empty_lines': 'A, B = list(map(int, input().split()))\\nj = 0\\nfor i in range(A, B + 1):\\n l = list(str(i))\\n l_reverse = list(reversed(l))\\n if l == l_reverse:\\n j += 1\\nprint(j)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\nans = 0\\nfor n in range(A, B + 1):\\n n = str(n)\\n if n == n[::-1]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-j = 0',\n", + " '-for i in range(A, B + 1):',\n", + " '- l = list(str(i))',\n", + " '- l_reverse = list(reversed(l))',\n", + " '- if l == l_reverse:',\n", + " '- j += 1',\n", + " '-print(j)',\n", + " '+ans = 0',\n", + " '+for n in range(A, B + 1):',\n", + " '+ n = str(n)',\n", + " '+ if n == n[::-1]:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4538340874,\n", + " 'measured_runtime_v1': 0.3384370139,\n", + " 'runtime_lift': 1.340970605,\n", + " 'key': ['s018952102', 's778219351']},\n", + " {'user_id': 'u536034761',\n", + " 'problem_id': 'p04044',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's161300550',\n", + " 'submission_id_v1': 's718856768',\n", + " 'cpu_time_v0': 29,\n", + " 'cpu_time_v1': 24,\n", + " 'memory_v0': 9032,\n", + " 'memory_v1': 9016,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.24,\n", + " 'input': 'n, l = list(map(int, input().split()))\\n\\nS = [eval(input()) for i in range(n)]\\n\\nS.sort()\\n\\nprint((\"\".join(S)))',\n", + " 'target': 'n, l = list(map(int, input().split()))\\n\\nA = [eval(input()) for _ in range(n)]\\n\\nA.sort()\\n\\nprint((\"\".join(A)))\\n',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 94,\n", + " 'code_v1_num_chars': 95,\n", + " 'code_v0_no_empty_lines': 'n, l = list(map(int, input().split()))\\nS = [eval(input()) for i in range(n)]\\nS.sort()\\nprint((\"\".join(S)))\\n',\n", + " 'code_v1_no_empty_lines': 'n, l = list(map(int, input().split()))\\nA = [eval(input()) for _ in range(n)]\\nA.sort()\\nprint((\"\".join(A)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-S = [eval(input()) for i in range(n)]',\n", + " '-S.sort()',\n", + " '-print((\"\".join(S)))',\n", + " '+A = [eval(input()) for _ in range(n)]',\n", + " '+A.sort()',\n", + " '+print((\"\".join(A)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3658422339,\n", + " 'measured_runtime_v1': 0.2564776862,\n", + " 'runtime_lift': 1.4264096006,\n", + " 'key': ['s161300550', 's718856768']},\n", + " {'user_id': 'u285121325',\n", + " 'problem_id': 'p03060',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's176163369',\n", + " 'submission_id_v1': 's307096938',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': 'n = int(eval(input()))\\n\\nv = list(map(int, input().split()))\\n\\nc = list(map(int, input().split()))\\n\\nresult = 0\\n\\nfor i in range(n):\\n\\n if v[i] > c[i]:\\n\\n result += v[i] - c[i]\\n\\nprint(result)',\n", + " 'target': 'N = int(eval(input()))\\n\\nV = list(map(int, input().split()))\\n\\nC = list(map(int, input().split()))\\n\\nprint((sum([V[i] - C[i] for i in range(N) if V[i] > C[i]])))\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 183,\n", + " 'code_v1_num_chars': 151,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nv = list(map(int, input().split()))\\nc = list(map(int, input().split()))\\nresult = 0\\nfor i in range(n):\\n if v[i] > c[i]:\\n result += v[i] - c[i]\\nprint(result)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nV = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nprint((sum([V[i] - C[i] for i in range(N) if V[i] > C[i]])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-n = int(eval(input()))',\n", + " '-v = list(map(int, input().split()))',\n", + " '-c = list(map(int, input().split()))',\n", + " '-result = 0',\n", + " '-for i in range(n):',\n", + " '- if v[i] > c[i]:',\n", + " '- result += v[i] - c[i]',\n", + " '-print(result)',\n", + " '+N = int(eval(input()))',\n", + " '+V = list(map(int, input().split()))',\n", + " '+C = list(map(int, input().split()))',\n", + " '+print((sum([V[i] - C[i] for i in range(N) if V[i] > C[i]])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1697382522,\n", + " 'measured_runtime_v1': 0.0057968805,\n", + " 'runtime_lift': 29.2809645377,\n", + " 'key': ['s176163369', 's307096938']},\n", + " {'user_id': 'u888092736',\n", + " 'problem_id': 'p03721',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's705162733',\n", + " 'submission_id_v1': 's360654843',\n", + " 'cpu_time_v0': 281,\n", + " 'cpu_time_v1': 145,\n", + " 'memory_v0': 28552,\n", + " 'memory_v1': 31636,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 48.4,\n", + " 'input': '(N, K), *AB = [list(map(int, s.split())) for s in open(0)]\\n\\nfor a, b in sorted(AB):\\n\\n K -= b\\n\\n if K <= 0:\\n\\n print(a)\\n\\n break\\n',\n", + " 'target': 'N, K, *AB = list(map(int, open(0).read().split()))\\n\\nli = [(a, b) for a, b in zip(*[iter(AB)] * 2)]\\n\\nli.sort()\\n\\nfor a, b in li:\\n\\n if K > b:\\n\\n K -= b\\n\\n else:\\n\\n print(a)\\n\\n break\\n',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 145,\n", + " 'code_v1_num_chars': 196,\n", + " 'code_v0_no_empty_lines': '(N, K), *AB = [list(map(int, s.split())) for s in open(0)]\\nfor a, b in sorted(AB):\\n K -= b\\n if K <= 0:\\n print(a)\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'N, K, *AB = list(map(int, open(0).read().split()))\\nli = [(a, b) for a, b in zip(*[iter(AB)] * 2)]\\nli.sort()\\nfor a, b in li:\\n if K > b:\\n K -= b\\n else:\\n print(a)\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-(N, K), *AB = [list(map(int, s.split())) for s in open(0)]',\n", + " '-for a, b in sorted(AB):',\n", + " '- K -= b',\n", + " '- if K <= 0:',\n", + " '+N, K, *AB = list(map(int, open(0).read().split()))',\n", + " '+li = [(a, b) for a, b in zip(*[iter(AB)] * 2)]',\n", + " '+li.sort()',\n", + " '+for a, b in li:',\n", + " '+ if K > b:',\n", + " '+ K -= b',\n", + " '+ else:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2949739402,\n", + " 'measured_runtime_v1': 0.0817868489,\n", + " 'runtime_lift': 3.6066182276,\n", + " 'key': ['s705162733', 's360654843']},\n", + " {'user_id': 'u634079249',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's671057519',\n", + " 'submission_id_v1': 's116621872',\n", + " 'cpu_time_v0': 992,\n", + " 'cpu_time_v1': 126,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.3,\n", + " 'input': 'import sys\\n\\nimport os\\n\\nimport math\\n\\n\\n\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\n\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\n\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\n\\n\\n\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\n\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\n\\n\\n\\n\\n\\ndef main():\\n\\n if os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"input.txt\", \"r\")\\n\\n\\n\\n N = ii()\\n\\n ret = float(\\'inf\\')\\n\\n I = int(math.sqrt(N)) * 10\\n\\n for i in range(1, I):\\n\\n if N%i == 0:\\n\\n j = N//i\\n\\n ret = min(ret, j + i - 2)\\n\\n\\n\\n print(ret)\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\nimport os\\n\\n\\n\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\n\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\n\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\n\\n\\n\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\n\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\n\\n\\n\\n\\n\\ndef main():\\n\\n if os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"input.txt\", \"r\")\\n\\n\\n\\n N = ii()\\n\\n m = int(N ** .5)\\n\\n while N % m != 0:\\n\\n m -= 1\\n\\n else:\\n\\n print((int(N / m + m - 2)))\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 717,\n", + " 'code_v1_num_chars': 627,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport os\\nimport math\\n\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\n\\n\\ndef main():\\n if os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"input.txt\", \"r\")\\n N = ii()\\n ret = float(\"inf\")\\n I = int(math.sqrt(N)) * 10\\n for i in range(1, I):\\n if N % i == 0:\\n j = N // i\\n ret = min(ret, j + i - 2)\\n print(ret)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport os\\n\\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\\n\\n\\ndef main():\\n if os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"input.txt\", \"r\")\\n N = ii()\\n m = int(N**0.5)\\n while N % m != 0:\\n m -= 1\\n else:\\n print((int(N / m + m - 2)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.7931034483,\n", + " 'diff': ['-import math',\n", + " '- ret = float(\"inf\")',\n", + " '- I = int(math.sqrt(N)) * 10',\n", + " '- for i in range(1, I):',\n", + " '- if N % i == 0:',\n", + " '- j = N // i',\n", + " '- ret = min(ret, j + i - 2)',\n", + " '- print(ret)',\n", + " '+ m = int(N**0.5)',\n", + " '+ while N % m != 0:',\n", + " '+ m -= 1',\n", + " '+ else:',\n", + " '+ print((int(N / m + m - 2)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3067429993,\n", + " 'measured_runtime_v1': 0.2119246759,\n", + " 'runtime_lift': 1.4474152099,\n", + " 'key': ['s671057519', 's116621872']},\n", + " {'user_id': 'u219494936',\n", + " 'problem_id': 'p02615',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's106486265',\n", + " 'submission_id_v1': 's107268546',\n", + " 'cpu_time_v0': 790,\n", + " 'cpu_time_v1': 143,\n", + " 'memory_v0': 70788,\n", + " 'memory_v1': 31436,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.9,\n", + " 'input': 'import numpy as np\\n\\nimport heapq\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = np.sort([int(x) for x in input().split(\" \")])[::-1]\\n\\n\\n\\nq = [(-A[1], (0, 1)), (-A[1], (0, 1))]\\n\\nconfort = A[0]\\n\\nheapq.heapify(q)\\n\\n\\n\\ni = 2\\n\\nwhile N > i:\\n\\n m = heapq.heappop(q)\\n\\n # print(f\"{m[1][0]}と{m[1][1]}の間に割り込む. 気持ち良さ {-m[0]}\")\\n\\n confort -= m[0]\\n\\n heapq.heappush(q, (-A[i], (i, m[1][0])))\\n\\n heapq.heappush(q, (-A[i], (i, m[1][1])))\\n\\n i += 1\\n\\nprint(confort)\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = sorted([int(x) for x in input().split(\" \")])[::-1]\\n\\n\\n\\nN -= 2\\n\\nS = A[0]\\n\\n\\n\\ni = 1\\n\\nwhile 1:\\n\\n if N == 0:\\n\\n break \\n\\n if N == 1:\\n\\n S += A[i]\\n\\n break\\n\\n S += 2 * A[i]\\n\\n N -= 2\\n\\n i += 1\\n\\nprint(S)',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 436,\n", + " 'code_v1_num_chars': 246,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport heapq\\n\\nN = int(eval(input()))\\nA = np.sort([int(x) for x in input().split(\" \")])[::-1]\\nq = [(-A[1], (0, 1)), (-A[1], (0, 1))]\\nconfort = A[0]\\nheapq.heapify(q)\\ni = 2\\nwhile N > i:\\n m = heapq.heappop(q)\\n # print(f\"{m[1][0]}と{m[1][1]}の間に割り込む. 気持ち良さ {-m[0]}\")\\n confort -= m[0]\\n heapq.heappush(q, (-A[i], (i, m[1][0])))\\n heapq.heappush(q, (-A[i], (i, m[1][1])))\\n i += 1\\nprint(confort)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = sorted([int(x) for x in input().split(\" \")])[::-1]\\nN -= 2\\nS = A[0]\\ni = 1\\nwhile 1:\\n if N == 0:\\n break\\n if N == 1:\\n S += A[i]\\n break\\n S += 2 * A[i]\\n N -= 2\\n i += 1\\nprint(S)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.5263157895,\n", + " 'diff': ['-import numpy as np',\n", + " '-import heapq',\n", + " '-',\n", + " '-A = np.sort([int(x) for x in input().split(\" \")])[::-1]',\n", + " '-q = [(-A[1], (0, 1)), (-A[1], (0, 1))]',\n", + " '-confort = A[0]',\n", + " '-heapq.heapify(q)',\n", + " '-i = 2',\n", + " '-while N > i:',\n", + " '- m = heapq.heappop(q)',\n", + " '- # print(f\"{m[1][0]}と{m[1][1]}の間に割り込む. 気持ち良さ {-m[0]}\")',\n", + " '- confort -= m[0]',\n", + " '- heapq.heappush(q, (-A[i], (i, m[1][0])))',\n", + " '- heapq.heappush(q, (-A[i], (i, m[1][1])))',\n", + " '+A = sorted([int(x) for x in input().split(\" \")])[::-1]',\n", + " '+N -= 2',\n", + " '+S = A[0]',\n", + " '+i = 1',\n", + " '+while 1:',\n", + " '+ if N == 0:',\n", + " '+ break',\n", + " '+ if N == 1:',\n", + " '+ S += A[i]',\n", + " '+ break',\n", + " '+ S += 2 * A[i]',\n", + " '+ N -= 2',\n", + " '-print(confort)',\n", + " '+print(S)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.866351433,\n", + " 'measured_runtime_v1': 0.2910247389,\n", + " 'runtime_lift': 6.4130336141,\n", + " 'key': ['s106486265', 's107268546']},\n", + " {'user_id': 'u821284362',\n", + " 'problem_id': 'p02959',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's294034147',\n", + " 'submission_id_v1': 's880787880',\n", + " 'cpu_time_v0': 443,\n", + " 'cpu_time_v1': 280,\n", + " 'memory_v0': 23968,\n", + " 'memory_v1': 85468,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 36.79,\n", + " 'input': '\\n\\nimport numpy as np\\n\\nN = int(eval(input()))\\n\\n\\n\\nA_ls = np.array(list(map(int,input().split(\" \"))))\\n\\nB_ls = np.array(list(map(int,input().split(\" \"))))\\n\\n\\n\\nS = 0\\n\\n\\n\\nfor i,b in enumerate(B_ls):\\n\\n if b > A_ls[i]:\\n\\n b -= A_ls[i]\\n\\n S += A_ls[i]\\n\\n if A_ls[i+1] >= b:\\n\\n A_ls[i+1] -=b\\n\\n S+=b\\n\\n else:\\n\\n S+=A_ls[i+1]\\n\\n A_ls[i+1] = 0 \\n\\n else:\\n\\n S += b\\n\\n\\n\\nprint(S)\\n',\n", + " 'target': '\\n\\nN = int(eval(input()))\\n\\n\\n\\nA_ls = list(map(int,input().split(\" \")))\\n\\nB_ls = list(map(int,input().split(\" \")))\\n\\n\\n\\nS = 0\\n\\n\\n\\nfor i,b in enumerate(B_ls):\\n\\n if b > A_ls[i]:\\n\\n b -= A_ls[i]\\n\\n S += A_ls[i]\\n\\n if A_ls[i+1] >= b:\\n\\n A_ls[i+1] -=b\\n\\n S+=b\\n\\n else:\\n\\n S+=A_ls[i+1]\\n\\n A_ls[i+1] = 0 \\n\\n else:\\n\\n S += b\\n\\n\\n\\nprint(S)\\n',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 431,\n", + " 'code_v1_num_chars': 391,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA_ls = np.array(list(map(int, input().split(\" \"))))\\nB_ls = np.array(list(map(int, input().split(\" \"))))\\nS = 0\\nfor i, b in enumerate(B_ls):\\n if b > A_ls[i]:\\n b -= A_ls[i]\\n S += A_ls[i]\\n if A_ls[i + 1] >= b:\\n A_ls[i + 1] -= b\\n S += b\\n else:\\n S += A_ls[i + 1]\\n A_ls[i + 1] = 0\\n else:\\n S += b\\nprint(S)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA_ls = list(map(int, input().split(\" \")))\\nB_ls = list(map(int, input().split(\" \")))\\nS = 0\\nfor i, b in enumerate(B_ls):\\n if b > A_ls[i]:\\n b -= A_ls[i]\\n S += A_ls[i]\\n if A_ls[i + 1] >= b:\\n A_ls[i + 1] -= b\\n S += b\\n else:\\n S += A_ls[i + 1]\\n A_ls[i + 1] = 0\\n else:\\n S += b\\nprint(S)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.347826087,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A_ls = np.array(list(map(int, input().split(\" \"))))',\n", + " '-B_ls = np.array(list(map(int, input().split(\" \"))))',\n", + " '+A_ls = list(map(int, input().split(\" \")))',\n", + " '+B_ls = list(map(int, input().split(\" \")))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4409986854,\n", + " 'measured_runtime_v1': 0.2063152339,\n", + " 'runtime_lift': 6.9844512096,\n", + " 'key': ['s294034147', 's880787880']},\n", + " {'user_id': 'u733814820',\n", + " 'problem_id': 'p03107',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's607050481',\n", + " 'submission_id_v1': 's627055692',\n", + " 'cpu_time_v0': 41,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 3956,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.63,\n", + " 'input': \"# ABC 120 C\\n\\n\\n\\nimport re\\n\\n\\n\\nS = eval(input())\\n\\n\\n\\nl0 = 0\\n\\nl1 = 0\\n\\n\\n\\nfor i in range(len(S)):\\n\\n if S[i] == '0':\\n\\n l0 += 1\\n\\n elif S[i] == '1':\\n\\n l1 += 1\\n\\n\\n\\nprint((min(l0, l1) * 2))\\n\",\n", + " 'target': 'def resolve():\\n\\n S = eval(input())\\n\\n arr = []\\n\\n for s in S:\\n\\n if len(arr) != 0 and arr[-1] != s:\\n\\n arr.pop()\\n\\n else:\\n\\n arr.append(s)\\n\\n\\n\\n print((len(S) - len(arr)))\\n\\n return\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n resolve()\\n',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 189,\n", + " 'code_v1_num_chars': 229,\n", + " 'code_v0_no_empty_lines': '# ABC 120 C\\nimport re\\n\\nS = eval(input())\\nl0 = 0\\nl1 = 0\\nfor i in range(len(S)):\\n if S[i] == \"0\":\\n l0 += 1\\n elif S[i] == \"1\":\\n l1 += 1\\nprint((min(l0, l1) * 2))\\n',\n", + " 'code_v1_no_empty_lines': 'def resolve():\\n S = eval(input())\\n arr = []\\n for s in S:\\n if len(arr) != 0 and arr[-1] != s:\\n arr.pop()\\n else:\\n arr.append(s)\\n print((len(S) - len(arr)))\\n return\\n\\n\\nif __name__ == \"__main__\":\\n resolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-# ABC 120 C',\n", + " '-import re',\n", + " '+def resolve():',\n", + " '+ S = eval(input())',\n", + " '+ arr = []',\n", + " '+ for s in S:',\n", + " '+ if len(arr) != 0 and arr[-1] != s:',\n", + " '+ arr.pop()',\n", + " '+ else:',\n", + " '+ arr.append(s)',\n", + " '+ print((len(S) - len(arr)))',\n", + " '+ return',\n", + " '-S = eval(input())',\n", + " '-l0 = 0',\n", + " '-l1 = 0',\n", + " '-for i in range(len(S)):',\n", + " '- if S[i] == \"0\":',\n", + " '- l0 += 1',\n", + " '- elif S[i] == \"1\":',\n", + " '- l1 += 1',\n", + " '-print((min(l0, l1) * 2))',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ resolve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4207458491,\n", + " 'measured_runtime_v1': 0.3073607309,\n", + " 'runtime_lift': 1.3688991691,\n", + " 'key': ['s607050481', 's627055692']},\n", + " {'user_id': 'u790710233',\n", + " 'problem_id': 'p02627',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's724454634',\n", + " 'submission_id_v1': 's209300808',\n", + " 'cpu_time_v0': 29,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 9064,\n", + " 'memory_v1': 9076,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.79,\n", + " 'input': \"a = eval(input())\\n\\nprint(('A' if not a.islower() else 'a'))\\n\",\n", + " 'target': \"print(('A' if input().isupper() else 'a'))\\n\",\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 1,\n", + " 'code_v0_num_chars': 52,\n", + " 'code_v1_num_chars': 41,\n", + " 'code_v0_no_empty_lines': 'a = eval(input())\\nprint((\"A\" if not a.islower() else \"a\"))\\n',\n", + " 'code_v1_no_empty_lines': 'print((\"A\" if input().isupper() else \"a\"))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-a = eval(input())',\n", + " '-print((\"A\" if not a.islower() else \"a\"))',\n", + " '+print((\"A\" if input().isupper() else \"a\"))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3926431958,\n", + " 'measured_runtime_v1': 0.2988653038,\n", + " 'runtime_lift': 1.3137797892,\n", + " 'key': ['s724454634', 's209300808']},\n", + " {'user_id': 'u029315034',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's594579996',\n", + " 'submission_id_v1': 's281376329',\n", + " 'cpu_time_v0': 178,\n", + " 'cpu_time_v1': 23,\n", + " 'memory_v0': 14168,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.08,\n", + " 'input': 'from math import sqrt\\n\\nfrom scipy.misc import comb\\n\\n\\n\\ndef cal_factors(num):\\n\\n factors = {}\\n\\n maxmod = int(sqrt(num)) + 1\\n\\n for mod in range(2, maxmod):\\n\\n i = 0\\n\\n while True:\\n\\n d, q = divmod(num, mod)\\n\\n if q == 0:\\n\\n num = d\\n\\n i += 1\\n\\n factors[mod] = i\\n\\n else:\\n\\n break\\n\\n\\n\\n if num > 1:\\n\\n factors[num] = 1\\n\\n\\n\\n return factors\\n\\n\\n\\n\\n\\nn, m = [int(v) for v in input().split()]\\n\\n\\n\\nmod = 1000000000 + 7\\n\\nfactors = cal_factors(m)\\n\\nans = 1\\n\\nfor v in list(factors.values()):\\n\\n ans *= comb(v + n - 1, v, exact=True) % mod\\n\\n ans %= mod\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'from math import sqrt\\n\\n\\n\\ndef cal_factors(num):\\n\\n factors = {}\\n\\n maxmod = int(sqrt(num)) + 1\\n\\n for mod in range(2, maxmod):\\n\\n i = 0\\n\\n while True:\\n\\n d, q = divmod(num, mod)\\n\\n if q == 0:\\n\\n num = d\\n\\n i += 1\\n\\n factors[mod] = i\\n\\n else:\\n\\n break\\n\\n\\n\\n if num > 1:\\n\\n factors[num] = 1\\n\\n\\n\\n return factors\\n\\n\\n\\n\\n\\ndef comb(n, r, mod):\\n\\n result = 1\\n\\n r = min(r, n-r)\\n\\n for i in range(n, n-r, -1):\\n\\n result *= i\\n\\n for i in range(2, r+1):\\n\\n result //= i\\n\\n\\n\\n return result % mod\\n\\n\\n\\n\\n\\nn, m = [int(v) for v in input().split()]\\n\\n\\n\\nmod = 1000000000 + 7\\n\\nfactors = cal_factors(m)\\n\\nans = 1\\n\\nfor v in list(factors.values()):\\n\\n ans *= comb(v + n - 1, v, mod)\\n\\n ans %= mod\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 33,\n", + " 'code_v1_loc': 43,\n", + " 'code_v0_num_chars': 661,\n", + " 'code_v1_num_chars': 814,\n", + " 'code_v0_no_empty_lines': 'from math import sqrt\\nfrom scipy.misc import comb\\n\\n\\ndef cal_factors(num):\\n factors = {}\\n maxmod = int(sqrt(num)) + 1\\n for mod in range(2, maxmod):\\n i = 0\\n while True:\\n d, q = divmod(num, mod)\\n if q == 0:\\n num = d\\n i += 1\\n factors[mod] = i\\n else:\\n break\\n if num > 1:\\n factors[num] = 1\\n return factors\\n\\n\\nn, m = [int(v) for v in input().split()]\\nmod = 1000000000 + 7\\nfactors = cal_factors(m)\\nans = 1\\nfor v in list(factors.values()):\\n ans *= comb(v + n - 1, v, exact=True) % mod\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from math import sqrt\\n\\n\\ndef cal_factors(num):\\n factors = {}\\n maxmod = int(sqrt(num)) + 1\\n for mod in range(2, maxmod):\\n i = 0\\n while True:\\n d, q = divmod(num, mod)\\n if q == 0:\\n num = d\\n i += 1\\n factors[mod] = i\\n else:\\n break\\n if num > 1:\\n factors[num] = 1\\n return factors\\n\\n\\ndef comb(n, r, mod):\\n result = 1\\n r = min(r, n - r)\\n for i in range(n, n - r, -1):\\n result *= i\\n for i in range(2, r + 1):\\n result //= i\\n return result % mod\\n\\n\\nn, m = [int(v) for v in input().split()]\\nmod = 1000000000 + 7\\nfactors = cal_factors(m)\\nans = 1\\nfor v in list(factors.values()):\\n ans *= comb(v + n - 1, v, mod)\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.2558139535,\n", + " 'diff': ['-from scipy.misc import comb',\n", + " '+def comb(n, r, mod):',\n", + " '+ result = 1',\n", + " '+ r = min(r, n - r)',\n", + " '+ for i in range(n, n - r, -1):',\n", + " '+ result *= i',\n", + " '+ for i in range(2, r + 1):',\n", + " '+ result //= i',\n", + " '+ return result % mod',\n", + " '+',\n", + " '+',\n", + " '- ans *= comb(v + n - 1, v, exact=True) % mod',\n", + " '+ ans *= comb(v + n - 1, v, mod)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6768635447,\n", + " 'measured_runtime_v1': 0.1470470848,\n", + " 'runtime_lift': 4.6030395335,\n", + " 'key': ['s594579996', 's281376329']},\n", + " {'user_id': 'u296150111',\n", + " 'problem_id': 'p02937',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's421754829',\n", + " 'submission_id_v1': 's024807040',\n", + " 'cpu_time_v0': 1985,\n", + " 'cpu_time_v1': 360,\n", + " 'memory_v0': 114612,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.86,\n", + " 'input': 's=eval(input())\\n\\nt=eval(input())\\n\\ns*=2\\n\\nnext=[[-1]*26 for _ in range(len(s))]\\n\\nalph=[[]for _ in range(26)]\\n\\nfor i in range(len(s)):\\n\\n\\talph[ord(s[i])-ord(\"a\")].append(i)\\n\\nfrom bisect import bisect_right\\n\\nfor i in range(len(s)//2):\\n\\n\\tfor j in range(26):\\n\\n\\t\\tif len(alph[j])>bisect_right(alph[j],i):\\n\\n\\t\\t\\tnext[i][j]=alph[j][bisect_right(alph[j],i)]\\n\\nans=1\\n\\nnow=len(s)//2-1\\n\\nfor x in t:\\n\\n\\tr=ord(x)-ord(\"a\")\\n\\n\\tnow=next[now][r]\\n\\n\\tif now==-1:\\n\\n\\t\\tprint((-1))\\n\\n\\t\\texit()\\n\\n\\tif now>=len(s)//2:\\n\\n\\t\\tans+=len(s)//2\\n\\n\\t\\tnow-=len(s)//2\\n\\nprint((ans+now-len(s)//2))',\n", + " 'target': \"#O(|S|log|s|)\\n\\ndef main():\\n\\n\\ts=eval(input())\\n\\n\\tt=eval(input())\\n\\n\\tn=len(s)\\n\\n\\tnow=-1\\n\\n\\tans=1\\n\\n\\tif not set(t)<=set(s):#tがsの部分集合でない\\n\\n\\t\\tprint((-1))\\n\\n\\t\\texit()\\n\\n\\tfor x in t:\\n\\n\\t\\tnow=s.find(x,now+1)#nowより大きいところからxを探す\\n\\n\\t\\tif now==-1:#nowより大きいところでxが見つからなかったら\\n\\n\\t\\t\\tans+=n\\n\\n\\t\\t\\tnow=s.find(x)\\n\\n\\tprint((ans+now))\\n\\nif __name__ == '__main__':\\n\\n\\tmain()\",\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 527,\n", + " 'code_v1_num_chars': 315,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\nt = eval(input())\\ns *= 2\\nnext = [[-1] * 26 for _ in range(len(s))]\\nalph = [[] for _ in range(26)]\\nfor i in range(len(s)):\\n alph[ord(s[i]) - ord(\"a\")].append(i)\\nfrom bisect import bisect_right\\n\\nfor i in range(len(s) // 2):\\n for j in range(26):\\n if len(alph[j]) > bisect_right(alph[j], i):\\n next[i][j] = alph[j][bisect_right(alph[j], i)]\\nans = 1\\nnow = len(s) // 2 - 1\\nfor x in t:\\n r = ord(x) - ord(\"a\")\\n now = next[now][r]\\n if now == -1:\\n print((-1))\\n exit()\\n if now >= len(s) // 2:\\n ans += len(s) // 2\\n now -= len(s) // 2\\nprint((ans + now - len(s) // 2))\\n',\n", + " 'code_v1_no_empty_lines': '# O(|S|log|s|)\\ndef main():\\n s = eval(input())\\n t = eval(input())\\n n = len(s)\\n now = -1\\n ans = 1\\n if not set(t) <= set(s): # tがsの部分集合でない\\n print((-1))\\n exit()\\n for x in t:\\n now = s.find(x, now + 1) # nowより大きいところからxを探す\\n if now == -1: # nowより大きいところでxが見つからなかったら\\n ans += n\\n now = s.find(x)\\n print((ans + now))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-s = eval(input())',\n", + " '-t = eval(input())',\n", + " '-s *= 2',\n", + " '-next = [[-1] * 26 for _ in range(len(s))]',\n", + " '-alph = [[] for _ in range(26)]',\n", + " '-for i in range(len(s)):',\n", + " '- alph[ord(s[i]) - ord(\"a\")].append(i)',\n", + " '-from bisect import bisect_right',\n", + " '-',\n", + " '-for i in range(len(s) // 2):',\n", + " '- for j in range(26):',\n", + " '- if len(alph[j]) > bisect_right(alph[j], i):',\n", + " '- next[i][j] = alph[j][bisect_right(alph[j], i)]',\n", + " '-ans = 1',\n", + " '-now = len(s) // 2 - 1',\n", + " '-for x in t:',\n", + " '- r = ord(x) - ord(\"a\")',\n", + " '- now = next[now][r]',\n", + " '- if now == -1:',\n", + " '+# O(|S|log|s|)',\n", + " '+def main():',\n", + " '+ s = eval(input())',\n", + " '+ t = eval(input())',\n", + " '+ n = len(s)',\n", + " '+ now = -1',\n", + " '+ ans = 1',\n", + " '+ if not set(t) <= set(s): # tがsの部分集合でない',\n", + " '- if now >= len(s) // 2:',\n", + " '- ans += len(s) // 2',\n", + " '- now -= len(s) // 2',\n", + " '-print((ans + now - len(s) // 2))',\n", + " '+ for x in t:',\n", + " '+ now = s.find(x, now + 1) # nowより大きいところからxを探す',\n", + " '+ if now == -1: # nowより大きいところでxが見つからなかったら',\n", + " '+ ans += n',\n", + " '+ now = s.find(x)',\n", + " '+ print((ans + now))',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2948810172,\n", + " 'measured_runtime_v1': 0.1485264051,\n", + " 'runtime_lift': 1.9853777313,\n", + " 'key': ['s421754829', 's024807040']},\n", + " {'user_id': 'u840247626',\n", + " 'problem_id': 'p02264',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's571730090',\n", + " 'submission_id_v1': 's740509038',\n", + " 'cpu_time_v0': 620,\n", + " 'cpu_time_v1': 400,\n", + " 'memory_v0': 13012,\n", + " 'memory_v1': 12536,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.48,\n", + " 'input': 'n,q = list(map(int,input().split()))\\n\\nqueue = []\\n\\nfor i in range(n):\\n\\n\\tname,time = input().split()\\n\\n\\tqueue.append([name, int(time)])\\n\\n\\n\\nt = 0\\n\\ni = 0\\n\\nwhile queue:\\n\\n\\ti %= len(queue)\\n\\n\\tp = queue[i]\\n\\n\\tt += min(q, p[1])\\n\\n\\tif p[1] > q:\\n\\n\\t\\tp[1] -= q\\n\\n\\t\\ti += 1\\n\\n\\telse:\\n\\n\\t\\tprint((p[0], t))\\n\\n\\t\\tqueue.pop(i)\\n',\n", + " 'target': 'from collections import deque\\n\\n\\n\\nn,q = list(map(int,input().split()))\\n\\nqueue = deque()\\n\\nfor i in range(n):\\n\\n\\tname,time = input().split()\\n\\n\\tqueue.append((name, int(time)))\\n\\n\\n\\nt = 0\\n\\nwhile queue:\\n\\n\\tname,time = queue.popleft()\\n\\n\\tt += min(q, time)\\n\\n\\tif time > q:\\n\\n\\t\\tqueue.append((name, time-q))\\n\\n\\telse:\\n\\n\\t\\tprint((name,t))\\n',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 290,\n", + " 'code_v1_num_chars': 310,\n", + " 'code_v0_no_empty_lines': 'n, q = list(map(int, input().split()))\\nqueue = []\\nfor i in range(n):\\n name, time = input().split()\\n queue.append([name, int(time)])\\nt = 0\\ni = 0\\nwhile queue:\\n i %= len(queue)\\n p = queue[i]\\n t += min(q, p[1])\\n if p[1] > q:\\n p[1] -= q\\n i += 1\\n else:\\n print((p[0], t))\\n queue.pop(i)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque\\n\\nn, q = list(map(int, input().split()))\\nqueue = deque()\\nfor i in range(n):\\n name, time = input().split()\\n queue.append((name, int(time)))\\nt = 0\\nwhile queue:\\n name, time = queue.popleft()\\n t += min(q, time)\\n if time > q:\\n queue.append((name, time - q))\\n else:\\n print((name, t))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['+from collections import deque',\n", + " '+',\n", + " '-queue = []',\n", + " '+queue = deque()',\n", + " '- queue.append([name, int(time)])',\n", + " '+ queue.append((name, int(time)))',\n", + " '-i = 0',\n", + " '- i %= len(queue)',\n", + " '- p = queue[i]',\n", + " '- t += min(q, p[1])',\n", + " '- if p[1] > q:',\n", + " '- p[1] -= q',\n", + " '- i += 1',\n", + " '+ name, time = queue.popleft()',\n", + " '+ t += min(q, time)',\n", + " '+ if time > q:',\n", + " '+ queue.append((name, time - q))',\n", + " '- print((p[0], t))',\n", + " '- queue.pop(i)',\n", + " '+ print((name, t))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3202849953,\n", + " 'measured_runtime_v1': 0.2467377391,\n", + " 'runtime_lift': 1.2980786664,\n", + " 'key': ['s571730090', 's740509038']},\n", + " {'user_id': 'u670180528',\n", + " 'problem_id': 'p02937',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's126195271',\n", + " 'submission_id_v1': 's641311638',\n", + " 'cpu_time_v0': 161,\n", + " 'cpu_time_v1': 122,\n", + " 'memory_v0': 12200,\n", + " 'memory_v1': 12072,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 24.22,\n", + " 'input': 'from collections import defaultdict\\n\\nfrom bisect import bisect_left\\n\\n\\n\\ns = eval(input())\\n\\nn = len(s)\\n\\ns = s + s\\n\\nt = eval(input())\\n\\nif set(t) - set(s):\\n\\n\\tprint((-1))\\n\\n\\texit()\\n\\nd = defaultdict(list)\\n\\nfor i in range(2 * n):\\n\\n\\td[s[i]] += [i]\\n\\ncur = tot = 0\\n\\nfor c in t:\\n\\n\\tx = d[c][bisect_left(d[c], cur)]\\n\\n\\tif x < n:\\n\\n\\t\\tcur = x + 1\\n\\n\\telse:\\n\\n\\t\\tcur = x - n + 1\\n\\n\\t\\ttot += n\\n\\ntot += cur\\n\\nprint(tot)\\n',\n", + " 'target': 'from collections import defaultdict\\n\\nfrom bisect import bisect_left\\n\\n\\n\\n\\n\\ndef main():\\n\\n\\ts = eval(input())\\n\\n\\tn = len(s)\\n\\n\\ts = s + s\\n\\n\\tt = eval(input())\\n\\n\\tif set(t) - set(s):\\n\\n\\t\\tprint((-1))\\n\\n\\t\\texit()\\n\\n\\td = defaultdict(list)\\n\\n\\tfor i in range(2 * n):\\n\\n\\t\\td[s[i]] += [i]\\n\\n\\tcur = ncnt = 0\\n\\n\\n\\n\\tfor c in t:\\n\\n\\t\\tx = d[c][bisect_left(d[c], cur)]\\n\\n\\t\\tif x < n:\\n\\n\\t\\t\\tcur = x + 1\\n\\n\\t\\telse:\\n\\n\\t\\t\\tcur = x - n + 1\\n\\n\\t\\t\\tncnt += 1\\n\\n\\tprint((ncnt*n + cur))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n\\tmain()',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 378,\n", + " 'code_v1_num_chars': 453,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\nfrom bisect import bisect_left\\n\\ns = eval(input())\\nn = len(s)\\ns = s + s\\nt = eval(input())\\nif set(t) - set(s):\\n print((-1))\\n exit()\\nd = defaultdict(list)\\nfor i in range(2 * n):\\n d[s[i]] += [i]\\ncur = tot = 0\\nfor c in t:\\n x = d[c][bisect_left(d[c], cur)]\\n if x < n:\\n cur = x + 1\\n else:\\n cur = x - n + 1\\n tot += n\\ntot += cur\\nprint(tot)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\nfrom bisect import bisect_left\\n\\n\\ndef main():\\n s = eval(input())\\n n = len(s)\\n s = s + s\\n t = eval(input())\\n if set(t) - set(s):\\n print((-1))\\n exit()\\n d = defaultdict(list)\\n for i in range(2 * n):\\n d[s[i]] += [i]\\n cur = ncnt = 0\\n for c in t:\\n x = d[c][bisect_left(d[c], cur)]\\n if x < n:\\n cur = x + 1\\n else:\\n cur = x - n + 1\\n ncnt += 1\\n print((ncnt * n + cur))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.6896551724,\n", + " 'diff': ['-s = eval(input())',\n", + " '-n = len(s)',\n", + " '-s = s + s',\n", + " '-t = eval(input())',\n", + " '-if set(t) - set(s):',\n", + " '- print((-1))',\n", + " '- exit()',\n", + " '-d = defaultdict(list)',\n", + " '-for i in range(2 * n):',\n", + " '- d[s[i]] += [i]',\n", + " '-cur = tot = 0',\n", + " '-for c in t:',\n", + " '- x = d[c][bisect_left(d[c], cur)]',\n", + " '- if x < n:',\n", + " '- cur = x + 1',\n", + " '- else:',\n", + " '- cur = x - n + 1',\n", + " '- tot += n',\n", + " '-tot += cur',\n", + " '-print(tot)',\n", + " '+',\n", + " '+def main():',\n", + " '+ s = eval(input())',\n", + " '+ n = len(s)',\n", + " '+ s = s + s',\n", + " '+ t = eval(input())',\n", + " '+ if set(t) - set(s):',\n", + " '+ print((-1))',\n", + " '+ exit()',\n", + " '+ d = defaultdict(list)',\n", + " '+ for i in range(2 * n):',\n", + " '+ d[s[i]] += [i]',\n", + " '+ cur = ncnt = 0',\n", + " '+ for c in t:',\n", + " '+ x = d[c][bisect_left(d[c], cur)]',\n", + " '+ if x < n:',\n", + " '+ cur = x + 1',\n", + " '+ else:',\n", + " '+ cur = x - n + 1',\n", + " '+ ncnt += 1',\n", + " '+ print((ncnt * n + cur))',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2683695219,\n", + " 'measured_runtime_v1': 0.0063027716,\n", + " 'runtime_lift': 42.5796046267,\n", + " 'key': ['s126195271', 's641311638']},\n", + " {'user_id': 'u253681061',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's618901729',\n", + " 'submission_id_v1': 's057938516',\n", + " 'cpu_time_v0': 49,\n", + " 'cpu_time_v1': 34,\n", + " 'memory_v0': 6900,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.61,\n", + " 'input': 'n = int(eval(input()))\\n\\n\\n\\nINF = 10**9 + 7\\n\\n\\n\\nans = [0] * (10**5 + 1)\\n\\nans[0] = 1\\n\\n\\n\\nfor i in range(1,10**5 + 1):\\n\\n ans[i] = ans[i-1] * i % INF\\n\\n\\n\\nprint((ans[n]))\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\nmod = 10**9 + 7\\n\\n\\n\\nans = 1\\n\\n\\n\\nfor i in range(1,n+1):\\n\\n ans = ans * i % mod\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 157,\n", + " 'code_v1_num_chars': 109,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nINF = 10**9 + 7\\nans = [0] * (10**5 + 1)\\nans[0] = 1\\nfor i in range(1, 10**5 + 1):\\n ans[i] = ans[i - 1] * i % INF\\nprint((ans[n]))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nmod = 10**9 + 7\\nans = 1\\nfor i in range(1, n + 1):\\n ans = ans * i % mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['-INF = 10**9 + 7',\n", + " '-ans = [0] * (10**5 + 1)',\n", + " '-ans[0] = 1',\n", + " '-for i in range(1, 10**5 + 1):',\n", + " '- ans[i] = ans[i - 1] * i % INF',\n", + " '-print((ans[n]))',\n", + " '+mod = 10**9 + 7',\n", + " '+ans = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans = ans * i % mod',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8708683834,\n", + " 'measured_runtime_v1': 0.4576160941,\n", + " 'runtime_lift': 1.9030545354,\n", + " 'key': ['s618901729', 's057938516']},\n", + " {'user_id': 'u609061751',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's992799348',\n", + " 'submission_id_v1': 's715280512',\n", + " 'cpu_time_v0': 181,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 13552,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.4,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nH, W = [int(x) for x in input().split()]\\n\\na = []\\n\\nfor _ in range(H):\\n\\n a.append(list(input().rstrip()))\\n\\nimport numpy as np\\n\\na = np.array(a, np.object)\\n\\na = a.T\\n\\nretsu = []\\n\\ngyou = []\\n\\nfor i in range(W):\\n\\n if \"#\" not in a[i]:\\n\\n retsu.append(i)\\n\\na = a.T\\n\\nfor i in range(H):\\n\\n if \"#\" not in a[i]:\\n\\n gyou.append(i)\\n\\na = np.delete(a, retsu, 1)\\n\\na = np.delete(a, gyou, 0)\\n\\nfor j in a:\\n\\n j = list(j)\\n\\n print((\"\".join(j)))',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nh, w = [int(x) for x in input().split()]\\n\\na = []\\n\\nfor _ in range(h):\\n\\n b = list(input().rstrip())\\n\\n if \\'#\\' in b:\\n\\n a.append(b)\\n\\nh = len(a)\\n\\nc = [1]*w\\n\\nfor i in range(w):\\n\\n flag = 1\\n\\n for j in range(h):\\n\\n if a[j][i] == \"#\":\\n\\n flag = 0\\n\\n break\\n\\n if flag:\\n\\n c[i] = 0\\n\\nans = []\\n\\nfor i in range(h):\\n\\n res = []\\n\\n for j in range(w):\\n\\n if c[j]:\\n\\n res.append(a[i][j])\\n\\n ans.append(\"\".join(res))\\n\\nfor i in ans:\\n\\n print(i)\\n\\n\\n',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 482,\n", + " 'code_v1_num_chars': 544,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nH, W = [int(x) for x in input().split()]\\na = []\\nfor _ in range(H):\\n a.append(list(input().rstrip()))\\nimport numpy as np\\n\\na = np.array(a, np.object)\\na = a.T\\nretsu = []\\ngyou = []\\nfor i in range(W):\\n if \"#\" not in a[i]:\\n retsu.append(i)\\na = a.T\\nfor i in range(H):\\n if \"#\" not in a[i]:\\n gyou.append(i)\\na = np.delete(a, retsu, 1)\\na = np.delete(a, gyou, 0)\\nfor j in a:\\n j = list(j)\\n print((\"\".join(j)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nh, w = [int(x) for x in input().split()]\\na = []\\nfor _ in range(h):\\n b = list(input().rstrip())\\n if \"#\" in b:\\n a.append(b)\\nh = len(a)\\nc = [1] * w\\nfor i in range(w):\\n flag = 1\\n for j in range(h):\\n if a[j][i] == \"#\":\\n flag = 0\\n break\\n if flag:\\n c[i] = 0\\nans = []\\nfor i in range(h):\\n res = []\\n for j in range(w):\\n if c[j]:\\n res.append(a[i][j])\\n ans.append(\"\".join(res))\\nfor i in ans:\\n print(i)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.6896551724,\n", + " 'diff': ['-H, W = [int(x) for x in input().split()]',\n", + " '+h, w = [int(x) for x in input().split()]',\n", + " '-for _ in range(H):',\n", + " '- a.append(list(input().rstrip()))',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-a = np.array(a, np.object)',\n", + " '-a = a.T',\n", + " '-retsu = []',\n", + " '-gyou = []',\n", + " '-for i in range(W):',\n", + " '- if \"#\" not in a[i]:',\n", + " '- retsu.append(i)',\n", + " '-a = a.T',\n", + " '-for i in range(H):',\n", + " '- if \"#\" not in a[i]:',\n", + " '- gyou.append(i)',\n", + " '-a = np.delete(a, retsu, 1)',\n", + " '-a = np.delete(a, gyou, 0)',\n", + " '-for j in a:',\n", + " '- j = list(j)',\n", + " '- print((\"\".join(j)))',\n", + " '+for _ in range(h):',\n", + " '+ b = list(input().rstrip())',\n", + " '+ if \"#\" in b:',\n", + " '+ a.append(b)',\n", + " '+h = len(a)',\n", + " '+c = [1] * w',\n", + " '+for i in range(w):',\n", + " '+ flag = 1',\n", + " '+ for j in range(h):',\n", + " '+ if a[j][i] == \"#\":',\n", + " '+ flag = 0',\n", + " '+ break',\n", + " '+ if flag:',\n", + " '+ c[i] = 0',\n", + " '+ans = []',\n", + " '+for i in range(h):',\n", + " '+ res = []',\n", + " '+ for j in range(w):',\n", + " '+ if c[j]:',\n", + " '+ res.append(a[i][j])',\n", + " '+ ans.append(\"\".join(res))',\n", + " '+for i in ans:',\n", + " '+ print(i)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.198312089,\n", + " 'measured_runtime_v1': 0.1897079278,\n", + " 'runtime_lift': 6.316615773,\n", + " 'key': ['s992799348', 's715280512']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's535465245',\n", + " 'submission_id_v1': 's657178579',\n", + " 'cpu_time_v0': 830,\n", + " 'cpu_time_v1': 146,\n", + " 'memory_v0': 3572,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.41,\n", + " 'input': \"from functools import lru_cache\\n\\nimport sys\\n\\n\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\n\\n\\n\\n\\n@lru_cache(maxsize=None)\\n\\ndef check(l, r, n, k=1):\\n\\n t = l + '0' * k + r\\n\\n e = l + '9' * k + r\\n\\n\\n\\n if int(e) <= n:\\n\\n return pow(10, k) + check(l, r, n, k + 1)\\n\\n\\n\\n if int(t) <= n < int(e):\\n\\n x = int(str(n)[1:-1])\\n\\n if int(str(n)[-1]) < int(r):\\n\\n x -= 1\\n\\n return x + 1\\n\\n\\n\\n if n < int(t):\\n\\n return 0\\n\\n\\n\\n\\n\\ndef main():\\n\\n n = int(eval(input()))\\n\\n\\n\\n ret = 0\\n\\n for x in range(1, n + 1):\\n\\n if x % 10 == 0:\\n\\n continue\\n\\n s = str(x)\\n\\n t = s[-1] + s[0]\\n\\n if s[0] == s[-1]:\\n\\n ret += 1\\n\\n if int(t) <= n:\\n\\n ret += 1\\n\\n ret += check(s[-1], s[0], n, k=1)\\n\\n\\n\\n print(ret)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"# 解説放送\\n\\n\\n\\ndef main():\\n\\n from collections import defaultdict\\n\\n\\n\\n n = int(eval(input()))\\n\\n\\n\\n d = defaultdict(int)\\n\\n for x in range(1, n + 1):\\n\\n if x % 10 == 0:\\n\\n continue\\n\\n\\n\\n tail = x % 10\\n\\n head = 0\\n\\n while x:\\n\\n head = x\\n\\n x //= 10\\n\\n\\n\\n d[head, tail] += 1\\n\\n\\n\\n ret = 0\\n\\n for (head, tail), cnt in tuple(d.items()):\\n\\n # RuntimeError: dictionary changed size during iteration\\n\\n # defaultdictの未定義(?)のkeyにアクセスするせいで、REになる\\n\\n # d.items()をtuple化して回避\\n\\n ret += d[head, tail] * d[tail, head]\\n\\n # (head,tail)の出現数を辞書で管理する\\n\\n # (head,tail)*(tail,head)の組み合わせがある\\n\\n\\n\\n print(ret)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 34,\n", + " 'code_v0_num_chars': 820,\n", + " 'code_v1_num_chars': 726,\n", + " 'code_v0_no_empty_lines': 'from functools import lru_cache\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\n\\n\\n@lru_cache(maxsize=None)\\ndef check(l, r, n, k=1):\\n t = l + \"0\" * k + r\\n e = l + \"9\" * k + r\\n if int(e) <= n:\\n return pow(10, k) + check(l, r, n, k + 1)\\n if int(t) <= n < int(e):\\n x = int(str(n)[1:-1])\\n if int(str(n)[-1]) < int(r):\\n x -= 1\\n return x + 1\\n if n < int(t):\\n return 0\\n\\n\\ndef main():\\n n = int(eval(input()))\\n ret = 0\\n for x in range(1, n + 1):\\n if x % 10 == 0:\\n continue\\n s = str(x)\\n t = s[-1] + s[0]\\n if s[0] == s[-1]:\\n ret += 1\\n if int(t) <= n:\\n ret += 1\\n ret += check(s[-1], s[0], n, k=1)\\n print(ret)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# 解説放送\\ndef main():\\n from collections import defaultdict\\n\\n n = int(eval(input()))\\n d = defaultdict(int)\\n for x in range(1, n + 1):\\n if x % 10 == 0:\\n continue\\n tail = x % 10\\n head = 0\\n while x:\\n head = x\\n x //= 10\\n d[head, tail] += 1\\n ret = 0\\n for (head, tail), cnt in tuple(d.items()):\\n # RuntimeError: dictionary changed size during iteration\\n # defaultdictの未定義(?)のkeyにアクセスするせいで、REになる\\n # d.items()をtuple化して回避\\n ret += d[head, tail] * d[tail, head]\\n # (head,tail)の出現数を辞書で管理する\\n # (head,tail)*(tail,head)の組み合わせがある\\n print(ret)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.7272727273,\n", + " 'diff': ['-from functools import lru_cache',\n", + " '-import sys',\n", + " '+# 解説放送',\n", + " '+def main():',\n", + " '+ from collections import defaultdict',\n", + " '-sys.setrecursionlimit(10**7)',\n", + " '-',\n", + " '-',\n", + " '-@lru_cache(maxsize=None)',\n", + " '-def check(l, r, n, k=1):',\n", + " '- t = l + \"0\" * k + r',\n", + " '- e = l + \"9\" * k + r',\n", + " '- if int(e) <= n:',\n", + " '- return pow(10, k) + check(l, r, n, k + 1)',\n", + " '- if int(t) <= n < int(e):',\n", + " '- x = int(str(n)[1:-1])',\n", + " '- if int(str(n)[-1]) < int(r):',\n", + " '- x -= 1',\n", + " '- return x + 1',\n", + " '- if n < int(t):',\n", + " '- return 0',\n", + " '-',\n", + " '-',\n", + " '-def main():',\n", + " '- ret = 0',\n", + " '+ d = defaultdict(int)',\n", + " '- s = str(x)',\n", + " '- t = s[-1] + s[0]',\n", + " '- if s[0] == s[-1]:',\n", + " '- ret += 1',\n", + " '- if int(t) <= n:',\n", + " '- ret += 1',\n", + " '- ret += check(s[-1], s[0], n, k=1)',\n", + " '+ tail = x % 10',\n", + " '+ head = 0',\n", + " '+ while x:',\n", + " '+ head = x',\n", + " '+ x //= 10',\n", + " '+ d[head, tail] += 1',\n", + " '+ ret = 0',\n", + " '+ for (head, tail), cnt in tuple(d.items()):',\n", + " '+ # RuntimeError: dictionary changed size during iteration',\n", + " '+ # defaultdictの未定義(?)のkeyにアクセスするせいで、REになる',\n", + " '+ # d.items()をtuple化して回避',\n", + " '+ ret += d[head, tail] * d[tail, head]',\n", + " '+ # (head,tail)の出現数を辞書で管理する',\n", + " '+ # (head,tail)*(tail,head)の組み合わせがある'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5728231148,\n", + " 'measured_runtime_v1': 0.440412906,\n", + " 'runtime_lift': 1.3006501557,\n", + " 'key': ['s535465245', 's657178579']},\n", + " {'user_id': 'u259738923',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's911512169',\n", + " 'submission_id_v1': 's353747803',\n", + " 'cpu_time_v0': 231,\n", + " 'cpu_time_v1': 41,\n", + " 'memory_v0': 3972,\n", + " 'memory_v1': 7396,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.25,\n", + " 'input': 'import math\\n\\nN = int(eval(input()))\\n\\nans = math.factorial(N) % (10 ** 9 + 7)\\n\\nprint(ans)',\n", + " 'target': 'n = int(eval(input()))\\n\\nfrom functools import reduce\\n\\nprint((reduce(lambda x,y:x*y%1000000007,list(range(1,n+1)))))',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 82,\n", + " 'code_v1_num_chars': 107,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nans = math.factorial(N) % (10**9 + 7)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nfrom functools import reduce\\n\\nprint((reduce(lambda x, y: x * y % 1000000007, list(range(1, n + 1)))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-import math',\n", + " '+n = int(eval(input()))',\n", + " '+from functools import reduce',\n", + " '-N = int(eval(input()))',\n", + " '-ans = math.factorial(N) % (10**9 + 7)',\n", + " '-print(ans)',\n", + " '+print((reduce(lambda x, y: x * y % 1000000007, list(range(1, n + 1)))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5315986769,\n", + " 'measured_runtime_v1': 0.2369310765,\n", + " 'runtime_lift': 2.2436848922,\n", + " 'key': ['s911512169', 's353747803']},\n", + " {'user_id': 'u530383736',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's540635335',\n", + " 'submission_id_v1': 's335532444',\n", + " 'cpu_time_v0': 50,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 8964,\n", + " 'memory_v1': 9188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.0,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\nimport sys\\n\\n\\n\\nX = int(input().strip())\\n\\n#-----\\n\\n\\n\\nfor a in range(-118,120):\\n\\n for b in range(-118,120):\\n\\n if (a**5 - b**5) == X:\\n\\n print((a,b))\\n\\n sys.exit()\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\nimport sys\\n\\n\\n\\nX = int(input().strip())\\n\\n#-----\\n\\ncalc = {}\\n\\n\\n\\nfor i in range(-118,120):\\n\\n calc[i] = i**5\\n\\n\\n\\n\\n\\nfor a in range(-118,120):\\n\\n for b in range(-118,120):\\n\\n if (calc[a] - calc[b]) == X:\\n\\n print((a,b))\\n\\n sys.exit()\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 212,\n", + " 'code_v1_num_chars': 280,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\n\\nX = int(input().strip())\\n# -----\\nfor a in range(-118, 120):\\n for b in range(-118, 120):\\n if (a**5 - b**5) == X:\\n print((a, b))\\n sys.exit()\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\n\\nX = int(input().strip())\\n# -----\\ncalc = {}\\nfor i in range(-118, 120):\\n calc[i] = i**5\\nfor a in range(-118, 120):\\n for b in range(-118, 120):\\n if (calc[a] - calc[b]) == X:\\n print((a, b))\\n sys.exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.25,\n", + " 'diff': ['+calc = {}',\n", + " '+for i in range(-118, 120):',\n", + " '+ calc[i] = i**5',\n", + " '- if (a**5 - b**5) == X:',\n", + " '+ if (calc[a] - calc[b]) == X:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4712231378,\n", + " 'measured_runtime_v1': 0.3317169825,\n", + " 'runtime_lift': 1.4205577724,\n", + " 'key': ['s540635335', 's335532444']},\n", + " {'user_id': 'u784022244',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's740817012',\n", + " 'submission_id_v1': 's743309565',\n", + " 'cpu_time_v0': 819,\n", + " 'cpu_time_v1': 165,\n", + " 'memory_v0': 23368,\n", + " 'memory_v1': 13880,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.85,\n", + " 'input': \"import numpy as np\\n\\n\\n\\n\\n\\nN=int(input())\\n\\n\\n\\nA=np.array([list(map(int, input().split()))])\\n\\n\\n\\n\\n\\nB=np.argsort(A[0,:])\\n\\nfor b in B:\\n\\n print(b+1, end=' ')\\n\",\n", + " 'target': 'N=int(input())\\n\\n\\n\\nA=list(map(int, input().split()))\\n\\nB=[-1]*N\\n\\nfor i in range(N):\\n\\n B[A[i]-1]=i+1\\n\\n \\n\\nfor b in B:\\n\\n print(b, end=\" \")\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 149,\n", + " 'code_v1_num_chars': 136,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(input())\\nA = np.array([list(map(int, input().split()))])\\nB = np.argsort(A[0, :])\\nfor b in B:\\n print(b + 1, end=\" \")\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(input())\\nA = list(map(int, input().split()))\\nB = [-1] * N\\nfor i in range(N):\\n B[A[i] - 1] = i + 1\\nfor b in B:\\n print(b, end=\" \")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.array([list(map(int, input().split()))])',\n", + " '-B = np.argsort(A[0, :])',\n", + " '+A = list(map(int, input().split()))',\n", + " '+B = [-1] * N',\n", + " '+for i in range(N):',\n", + " '+ B[A[i] - 1] = i + 1',\n", + " '- print(b + 1, end=\" \")',\n", + " '+ print(b, end=\" \")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8078299961,\n", + " 'measured_runtime_v1': 0.2674438229,\n", + " 'runtime_lift': 6.7596625581,\n", + " 'key': ['s740817012', 's743309565']},\n", + " {'user_id': 'u072053884',\n", + " 'problem_id': 'p02278',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's595158290',\n", + " 'submission_id_v1': 's757741528',\n", + " 'cpu_time_v0': 80,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 7788,\n", + " 'memory_v1': 7812,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 25.0,\n", + " 'input': '\"\"\"Minimum cost Sort.\"\"\"\\n\\n\\n\\ndef min_cost_sort(A):\\n\\n \"\"\"Sort list A in ascending order.\\n\\n \\n\\n And return the switching cost in sorting.\\n\\n \"\"\"\\n\\n B = list(A)\\n\\n B.sort()\\n\\n cost = 0\\n\\n min_w = B[0]\\n\\n for i, b in enumerate(B):\\n\\n tmp_cost = 0\\n\\n bi = A.index(b)\\n\\n n = 1\\n\\n while bi != i:\\n\\n n += 1\\n\\n st = B[bi]\\n\\n si = A.index(st)\\n\\n tmp_cost += b + st\\n\\n A[bi], A[si] = st, b\\n\\n bi = si\\n\\n dec = (n - 1) * (b - min_w)\\n\\n inc = 2 * (min_w + b)\\n\\n if dec < inc:\\n\\n cost += tmp_cost\\n\\n else:\\n\\n cost += tmp_cost - dec + inc\\n\\n return cost\\n\\n\\n\\n\\n\\nn = eval(input())\\n\\n\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nans = min_cost_sort(A)\\n\\n\\n\\nprint(ans)',\n", + " 'target': '\"\"\"Minimum cost Sort.\"\"\"\\n\\n\\n\\ndef min_cost_sort(A):\\n\\n \"\"\"Sort list A in ascending order.\\n\\n \\n\\n And return the switching cost in sorting.\\n\\n \"\"\"\\n\\n B = list(A)\\n\\n B.sort()\\n\\n cost = 0\\n\\n min_w = B[0]\\n\\n for i, b in enumerate(B):\\n\\n tmp_cost = 0\\n\\n bi = A.index(b)\\n\\n cnt = 0\\n\\n while bi != i:\\n\\n cnt += 1\\n\\n st = B[bi]\\n\\n si = A.index(st)\\n\\n tmp_cost += b + st\\n\\n A[bi], A[si] = st, b\\n\\n bi = si\\n\\n if cnt:\\n\\n dec = cnt * (b - min_w)\\n\\n inc = 2 * (min_w + b)\\n\\n if dec < inc:\\n\\n cost += tmp_cost\\n\\n else:\\n\\n cost += tmp_cost - dec + inc\\n\\n return cost\\n\\n\\n\\n\\n\\nn = eval(input())\\n\\n\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nans = min_cost_sort(A)\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 38,\n", + " 'code_v1_loc': 39,\n", + " 'code_v0_num_chars': 780,\n", + " 'code_v1_num_chars': 821,\n", + " 'code_v0_no_empty_lines': '\"\"\"Minimum cost Sort.\"\"\"\\n\\n\\ndef min_cost_sort(A):\\n \"\"\"Sort list A in ascending order.\\n And return the switching cost in sorting.\\n \"\"\"\\n B = list(A)\\n B.sort()\\n cost = 0\\n min_w = B[0]\\n for i, b in enumerate(B):\\n tmp_cost = 0\\n bi = A.index(b)\\n n = 1\\n while bi != i:\\n n += 1\\n st = B[bi]\\n si = A.index(st)\\n tmp_cost += b + st\\n A[bi], A[si] = st, b\\n bi = si\\n dec = (n - 1) * (b - min_w)\\n inc = 2 * (min_w + b)\\n if dec < inc:\\n cost += tmp_cost\\n else:\\n cost += tmp_cost - dec + inc\\n return cost\\n\\n\\nn = eval(input())\\nA = list(map(int, input().split()))\\nans = min_cost_sort(A)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '\"\"\"Minimum cost Sort.\"\"\"\\n\\n\\ndef min_cost_sort(A):\\n \"\"\"Sort list A in ascending order.\\n And return the switching cost in sorting.\\n \"\"\"\\n B = list(A)\\n B.sort()\\n cost = 0\\n min_w = B[0]\\n for i, b in enumerate(B):\\n tmp_cost = 0\\n bi = A.index(b)\\n cnt = 0\\n while bi != i:\\n cnt += 1\\n st = B[bi]\\n si = A.index(st)\\n tmp_cost += b + st\\n A[bi], A[si] = st, b\\n bi = si\\n if cnt:\\n dec = cnt * (b - min_w)\\n inc = 2 * (min_w + b)\\n if dec < inc:\\n cost += tmp_cost\\n else:\\n cost += tmp_cost - dec + inc\\n return cost\\n\\n\\nn = eval(input())\\nA = list(map(int, input().split()))\\nans = min_cost_sort(A)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.5641025641,\n", + " 'diff': ['- n = 1',\n", + " '+ cnt = 0',\n", + " '- n += 1',\n", + " '+ cnt += 1',\n", + " '- dec = (n - 1) * (b - min_w)',\n", + " '- inc = 2 * (min_w + b)',\n", + " '- if dec < inc:',\n", + " '- cost += tmp_cost',\n", + " '- else:',\n", + " '- cost += tmp_cost - dec + inc',\n", + " '+ if cnt:',\n", + " '+ dec = cnt * (b - min_w)',\n", + " '+ inc = 2 * (min_w + b)',\n", + " '+ if dec < inc:',\n", + " '+ cost += tmp_cost',\n", + " '+ else:',\n", + " '+ cost += tmp_cost - dec + inc'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3540196879,\n", + " 'measured_runtime_v1': 0.1982511323,\n", + " 'runtime_lift': 1.7857133208,\n", + " 'key': ['s595158290', 's757741528']},\n", + " {'user_id': 'u324314500',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's506003546',\n", + " 'submission_id_v1': 's782884160',\n", + " 'cpu_time_v0': 751,\n", + " 'cpu_time_v1': 520,\n", + " 'memory_v0': 49756,\n", + " 'memory_v1': 66776,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.76,\n", + " 'input': \"import sys\\n\\n#import numpy as np\\n\\n\\n\\ns2nn = lambda s: [int(c) for c in s.split(' ')]\\n\\nss2nn = lambda ss: [int(s) for s in ss]\\n\\nss2nnn = lambda ss: [s2nn(s) for s in ss]\\n\\ni2s = lambda: sys.stdin.readline().rstrip()\\n\\ni2n = lambda: int(i2s())\\n\\ni2nn = lambda: s2nn(i2s())\\n\\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\\n\\nii2nn = lambda n: ss2nn(ii2ss(n))\\n\\nii2nnn = lambda n: ss2nnn(ii2ss(n))\\n\\n\\n\\nN = 10000\\n\\ndef tokey(i, j, k):\\n\\n return i*N*N + j*N + k\\n\\ndef dekey(n):\\n\\n i = int(n / N / N)\\n\\n j = int(n / N) % N\\n\\n k = n % N\\n\\n return i, j, k\\n\\n\\n\\ndef main():\\n\\n X, Y, Z, K = i2nn()\\n\\n A = i2nn()\\n\\n B = i2nn()\\n\\n C = i2nn()\\n\\n A.sort()\\n\\n A.reverse()\\n\\n B.sort()\\n\\n B.reverse()\\n\\n C.sort()\\n\\n C.reverse()\\n\\n Q = [(A[0] + B[0] + C[0], 0, 0, 0)]\\n\\n loop = 0\\n\\n stored = set()\\n\\n def next(i, j, k):\\n\\n if i >= X or j >= Y or k >= Z:\\n\\n return\\n\\n key = tokey(i, j, k)\\n\\n if key not in stored:\\n\\n stored.add(key)\\n\\n n = A[i] + B[j] + C[k]\\n\\n Q.append((n, i, j, k))\\n\\n while True:\\n\\n v = max(Q, key=lambda v: v[0])\\n\\n Q.remove(v)\\n\\n print((v[0]))\\n\\n loop += 1\\n\\n if loop >= K:\\n\\n break\\n\\n next(v[1]+1, v[2], v[3])\\n\\n next(v[1], v[2]+1, v[3])\\n\\n next(v[1], v[2], v[3]+1)\\n\\n\\n\\nmain()\\n\",\n", + " 'target': \"import sys\\n\\nfrom collections import deque # 双方向キュー\\n\\nfrom collections import defaultdict # 初期化済み辞書\\n\\nfrom heapq import heapify, heappush, heappop, heappushpop # プライオリティキュー\\n\\nfrom bisect import bisect_left, bisect_right # 二分探索\\n\\n#import numpy as np # 1.8.2\\n\\n#import scipy # 0.13.3\\n\\n#sys.setrecursionlimit(int(1e+6))\\n\\ns2nn = lambda s: [int(c) for c in s.split(' ')]\\n\\nss2nn = lambda ss: [int(s) for s in ss]\\n\\nss2nnn = lambda ss: [s2nn(s) for s in ss]\\n\\ni2s = lambda: sys.stdin.readline().rstrip()\\n\\ni2n = lambda: int(i2s())\\n\\ni2nn = lambda: s2nn(i2s())\\n\\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\\n\\nii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]\\n\\nii2nn = lambda n: ss2nn(ii2ss(n))\\n\\nii2nnn = lambda n: ss2nnn(ii2ss(n))\\n\\nMOD = int(1e+9) + 7\\n\\n\\n\\ndef main():\\n\\n X, Y, Z, K = i2nn()\\n\\n A = i2nn()\\n\\n B = i2nn()\\n\\n C = i2nn()\\n\\n A.sort()\\n\\n A.reverse()\\n\\n B.sort()\\n\\n B.reverse()\\n\\n C.sort()\\n\\n C.reverse()\\n\\n s = set()\\n\\n hq = []\\n\\n n = 0\\n\\n heappush(hq, ((A[0] + B[0] + C[0]) * -1, (0, 0, 0)))\\n\\n while n < K:\\n\\n t, abc = heappop(hq)\\n\\n if abc in s:\\n\\n continue\\n\\n s.add(abc)\\n\\n (a, b, c) = abc\\n\\n if a+1 < X:\\n\\n heappush(hq, ((A[a+1] + B[b] + C[c]) * -1, (a+1, b, c)))\\n\\n if b+1 < Y:\\n\\n heappush(hq, ((A[a] + B[b+1] + C[c]) * -1, (a, b+1, c)))\\n\\n if c+1 < Z:\\n\\n heappush(hq, ((A[a] + B[b] + C[c+1]) * -1, (a, b, c+1)))\\n\\n print((-t))\\n\\n n += 1\\n\\n\\n\\nmain()\\n\",\n", + " 'code_v0_loc': 56,\n", + " 'code_v1_loc': 51,\n", + " 'code_v0_num_chars': 1341,\n", + " 'code_v1_num_chars': 1520,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\n# import numpy as np\\ns2nn = lambda s: [int(c) for c in s.split(\" \")]\\nss2nn = lambda ss: [int(s) for s in ss]\\nss2nnn = lambda ss: [s2nn(s) for s in ss]\\ni2s = lambda: sys.stdin.readline().rstrip()\\ni2n = lambda: int(i2s())\\ni2nn = lambda: s2nn(i2s())\\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\\nii2nn = lambda n: ss2nn(ii2ss(n))\\nii2nnn = lambda n: ss2nnn(ii2ss(n))\\nN = 10000\\n\\n\\ndef tokey(i, j, k):\\n return i * N * N + j * N + k\\n\\n\\ndef dekey(n):\\n i = int(n / N / N)\\n j = int(n / N) % N\\n k = n % N\\n return i, j, k\\n\\n\\ndef main():\\n X, Y, Z, K = i2nn()\\n A = i2nn()\\n B = i2nn()\\n C = i2nn()\\n A.sort()\\n A.reverse()\\n B.sort()\\n B.reverse()\\n C.sort()\\n C.reverse()\\n Q = [(A[0] + B[0] + C[0], 0, 0, 0)]\\n loop = 0\\n stored = set()\\n\\n def next(i, j, k):\\n if i >= X or j >= Y or k >= Z:\\n return\\n key = tokey(i, j, k)\\n if key not in stored:\\n stored.add(key)\\n n = A[i] + B[j] + C[k]\\n Q.append((n, i, j, k))\\n\\n while True:\\n v = max(Q, key=lambda v: v[0])\\n Q.remove(v)\\n print((v[0]))\\n loop += 1\\n if loop >= K:\\n break\\n next(v[1] + 1, v[2], v[3])\\n next(v[1], v[2] + 1, v[3])\\n next(v[1], v[2], v[3] + 1)\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom collections import deque # 双方向キュー\\nfrom collections import defaultdict # 初期化済み辞書\\nfrom heapq import heapify, heappush, heappop, heappushpop # プライオリティキュー\\nfrom bisect import bisect_left, bisect_right # 二分探索\\n\\n# import numpy as np # 1.8.2\\n# import scipy # 0.13.3\\n# sys.setrecursionlimit(int(1e+6))\\ns2nn = lambda s: [int(c) for c in s.split(\" \")]\\nss2nn = lambda ss: [int(s) for s in ss]\\nss2nnn = lambda ss: [s2nn(s) for s in ss]\\ni2s = lambda: sys.stdin.readline().rstrip()\\ni2n = lambda: int(i2s())\\ni2nn = lambda: s2nn(i2s())\\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\\nii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]\\nii2nn = lambda n: ss2nn(ii2ss(n))\\nii2nnn = lambda n: ss2nnn(ii2ss(n))\\nMOD = int(1e9) + 7\\n\\n\\ndef main():\\n X, Y, Z, K = i2nn()\\n A = i2nn()\\n B = i2nn()\\n C = i2nn()\\n A.sort()\\n A.reverse()\\n B.sort()\\n B.reverse()\\n C.sort()\\n C.reverse()\\n s = set()\\n hq = []\\n n = 0\\n heappush(hq, ((A[0] + B[0] + C[0]) * -1, (0, 0, 0)))\\n while n < K:\\n t, abc = heappop(hq)\\n if abc in s:\\n continue\\n s.add(abc)\\n (a, b, c) = abc\\n if a + 1 < X:\\n heappush(hq, ((A[a + 1] + B[b] + C[c]) * -1, (a + 1, b, c)))\\n if b + 1 < Y:\\n heappush(hq, ((A[a] + B[b + 1] + C[c]) * -1, (a, b + 1, c)))\\n if c + 1 < Z:\\n heappush(hq, ((A[a] + B[b] + C[c + 1]) * -1, (a, b, c + 1)))\\n print((-t))\\n n += 1\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.9285714286,\n", + " 'diff': ['+from collections import deque # 双方向キュー',\n", + " '+from collections import defaultdict # 初期化済み辞書',\n", + " '+from heapq import heapify, heappush, heappop, heappushpop # プライオリティキュー',\n", + " '+from bisect import bisect_left, bisect_right # 二分探索',\n", + " '-# import numpy as np',\n", + " '+# import numpy as np # 1.8.2',\n", + " '+# import scipy # 0.13.3',\n", + " '+# sys.setrecursionlimit(int(1e+6))',\n", + " '+ii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]',\n", + " '-N = 10000',\n", + " '-',\n", + " '-',\n", + " '-def tokey(i, j, k):',\n", + " '- return i * N * N + j * N + k',\n", + " '-',\n", + " '-',\n", + " '-def dekey(n):',\n", + " '- i = int(n / N / N)',\n", + " '- j = int(n / N) % N',\n", + " '- k = n % N',\n", + " '- return i, j, k',\n", + " '+MOD = int(1e9) + 7',\n", + " '- Q = [(A[0] + B[0] + C[0], 0, 0, 0)]',\n", + " '- loop = 0',\n", + " '- stored = set()',\n", + " '-',\n", + " '- def next(i, j, k):',\n", + " '- if i >= X or j >= Y or k >= Z:',\n", + " '- return',\n", + " '- key = tokey(i, j, k)',\n", + " '- if key not in stored:',\n", + " '- stored.add(key)',\n", + " '- n = A[i] + B[j] + C[k]',\n", + " '- Q.append((n, i, j, k))',\n", + " '-',\n", + " '- while True:',\n", + " '- v = max(Q, key=lambda v: v[0])',\n", + " '- Q.remove(v)',\n", + " '- print((v[0]))',\n", + " '- loop += 1',\n", + " '- if loop >= K:',\n", + " '- break',\n", + " '- next(v[1] + 1, v[2], v[3])',\n", + " '- next(v[1], v[2] + 1, v[3])',\n", + " '- next(v[1], v[2], v[3] + 1)',\n", + " '+ s = set()',\n", + " '+ hq = []',\n", + " '+ n = 0',\n", + " '+ heappush(hq, ((A[0] + B[0] + C[0]) * -1, (0, 0, 0)))',\n", + " '+ while n < K:',\n", + " '+ t, abc = heappop(hq)',\n", + " '+ if abc in s:',\n", + " '+ continue',\n", + " '+ s.add(abc)',\n", + " '+ (a, b, c) = abc',\n", + " '+ if a + 1 < X:',\n", + " '+ heappush(hq, ((A[a + 1] + B[b] + C[c]) * -1, (a + 1, b, c)))',\n", + " '+ if b + 1 < Y:',\n", + " '+ heappush(hq, ((A[a] + B[b + 1] + C[c]) * -1, (a, b + 1, c)))',\n", + " '+ if c + 1 < Z:',\n", + " '+ heappush(hq, ((A[a] + B[b] + C[c + 1]) * -1, (a, b, c + 1)))',\n", + " '+ print((-t))',\n", + " '+ n += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2744265182,\n", + " 'measured_runtime_v1': 0.1831091979,\n", + " 'runtime_lift': 1.4987041689,\n", + " 'key': ['s506003546', 's782884160']},\n", + " {'user_id': 'u224353074',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's119181910',\n", + " 'submission_id_v1': 's673450457',\n", + " 'cpu_time_v0': 1121,\n", + " 'cpu_time_v1': 611,\n", + " 'memory_v0': 41852,\n", + " 'memory_v1': 60888,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 45.5,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\n\\n\\nabc = np.array([list(map(int, input().split())) for i in range(N)])\\n\\n\\n\\ndp = [[0]*3 for i in range(N+1)]\\n\\n\\n\\nfor i in range(1, N+1):\\n\\n dp[i][0] = max(dp[i - 1][1] + abc[i - 1][1], dp[i - 1][2] + abc[i - 1][2])\\n\\n dp[i][1] = max(dp[i - 1][0] + abc[i - 1][0], dp[i - 1][2] + abc[i - 1][2])\\n\\n dp[i][2] = max(dp[i - 1][1] + abc[i - 1][1], dp[i - 1][0] + abc[i - 1][0])\\n\\n\\n\\nprint((max(dp[-1])))\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\n\\n\\nA = [0] * (N + 1)\\n\\nB = [0] * (N + 1)\\n\\nC = [0] * (N + 1)\\n\\n\\n\\nfor i in range(1, N + 1):\\n\\n A[i], B[i], C[i] = list(map(int, input().split()))\\n\\n\\n\\ndp = [[0] * 3 for _ in range(N + 1)]\\n\\nfor i in range(1, N + 1):\\n\\n dp[i][0] = A[i] + max(dp[i-1][1], dp[i-1][2])\\n\\n dp[i][1] = B[i] + max(dp[i-1][2], dp[i-1][0])\\n\\n dp[i][2] = C[i] + max(dp[i-1][0], dp[i-1][1])\\n\\n\\n\\nprint((max(dp[N])))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 433,\n", + " 'code_v1_num_chars': 395,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nabc = np.array([list(map(int, input().split())) for i in range(N)])\\ndp = [[0] * 3 for i in range(N + 1)]\\nfor i in range(1, N + 1):\\n dp[i][0] = max(dp[i - 1][1] + abc[i - 1][1], dp[i - 1][2] + abc[i - 1][2])\\n dp[i][1] = max(dp[i - 1][0] + abc[i - 1][0], dp[i - 1][2] + abc[i - 1][2])\\n dp[i][2] = max(dp[i - 1][1] + abc[i - 1][1], dp[i - 1][0] + abc[i - 1][0])\\nprint((max(dp[-1])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [0] * (N + 1)\\nB = [0] * (N + 1)\\nC = [0] * (N + 1)\\nfor i in range(1, N + 1):\\n A[i], B[i], C[i] = list(map(int, input().split()))\\ndp = [[0] * 3 for _ in range(N + 1)]\\nfor i in range(1, N + 1):\\n dp[i][0] = A[i] + max(dp[i - 1][1], dp[i - 1][2])\\n dp[i][1] = B[i] + max(dp[i - 1][2], dp[i - 1][0])\\n dp[i][2] = C[i] + max(dp[i - 1][0], dp[i - 1][1])\\nprint((max(dp[N])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.75,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-abc = np.array([list(map(int, input().split())) for i in range(N)])',\n", + " '-dp = [[0] * 3 for i in range(N + 1)]',\n", + " '+A = [0] * (N + 1)',\n", + " '+B = [0] * (N + 1)',\n", + " '+C = [0] * (N + 1)',\n", + " '- dp[i][0] = max(dp[i - 1][1] + abc[i - 1][1], dp[i - 1][2] + abc[i - 1][2])',\n", + " '- dp[i][1] = max(dp[i - 1][0] + abc[i - 1][0], dp[i - 1][2] + abc[i - 1][2])',\n", + " '- dp[i][2] = max(dp[i - 1][1] + abc[i - 1][1], dp[i - 1][0] + abc[i - 1][0])',\n", + " '-print((max(dp[-1])))',\n", + " '+ A[i], B[i], C[i] = list(map(int, input().split()))',\n", + " '+dp = [[0] * 3 for _ in range(N + 1)]',\n", + " '+for i in range(1, N + 1):',\n", + " '+ dp[i][0] = A[i] + max(dp[i - 1][1], dp[i - 1][2])',\n", + " '+ dp[i][1] = B[i] + max(dp[i - 1][2], dp[i - 1][0])',\n", + " '+ dp[i][2] = C[i] + max(dp[i - 1][0], dp[i - 1][1])',\n", + " '+print((max(dp[N])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7828589861,\n", + " 'measured_runtime_v1': 0.2997257252,\n", + " 'runtime_lift': 5.9483015181,\n", + " 'key': ['s119181910', 's673450457']},\n", + " {'user_id': 'u175590965',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's837964487',\n", + " 'submission_id_v1': 's558772824',\n", + " 'cpu_time_v0': 232,\n", + " 'cpu_time_v1': 167,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.02,\n", + " 'input': 'n = int(eval(input()))\\n\\nl = []\\n\\nfor i in range(1,1000001):\\n\\n a = n / i\\n\\n if a.is_integer():\\n\\n l.append(i+n/i)\\n\\nprint((int(min(l)-2)))',\n", + " 'target': 'n = int(eval(input()))\\n\\na = 10**20\\n\\nfor i in range(1,int(n**0.5)+1):\\n\\n if n%i==0:\\n\\n a = min(a,i+n//i)\\n\\nprint((a-2))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 138,\n", + " 'code_v1_num_chars': 117,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nl = []\\nfor i in range(1, 1000001):\\n a = n / i\\n if a.is_integer():\\n l.append(i + n / i)\\nprint((int(min(l) - 2)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = 10**20\\nfor i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n a = min(a, i + n // i)\\nprint((a - 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-l = []',\n", + " '-for i in range(1, 1000001):',\n", + " '- a = n / i',\n", + " '- if a.is_integer():',\n", + " '- l.append(i + n / i)',\n", + " '-print((int(min(l) - 2)))',\n", + " '+a = 10**20',\n", + " '+for i in range(1, int(n**0.5) + 1):',\n", + " '+ if n % i == 0:',\n", + " '+ a = min(a, i + n // i)',\n", + " '+print((a - 2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3549120984,\n", + " 'measured_runtime_v1': 0.219868273,\n", + " 'runtime_lift': 6.1623811373,\n", + " 'key': ['s837964487', 's558772824']},\n", + " {'user_id': 'u912650255',\n", + " 'problem_id': 'p02983',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's074902378',\n", + " 'submission_id_v1': 's358904585',\n", + " 'cpu_time_v0': 618,\n", + " 'cpu_time_v1': 67,\n", + " 'memory_v0': 75568,\n", + " 'memory_v1': 6888,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.16,\n", + " 'input': 'L ,R = list(map(int,input().split()))\\n\\n\\n\\nans =[]\\n\\nif R - L <= 2019:\\n\\n for i in range(L,R+1):\\n\\n for j in range(i+1,R+1):\\n\\n ans.append(i*j%2019)\\n\\n\\n\\nelse:\\n\\n for i in range(R-L-1010,R-L+1010):\\n\\n for j in range(i,R-L+1010):\\n\\n ans.append(i*j%2019)\\n\\n\\n\\nprint((min(ans)))\\n',\n", + " 'target': 'L ,R = list(map(int,input().split()))\\n\\n\\n\\nans =[]\\n\\nfor i in range(L,R+1):\\n\\n for j in range(i+1,R+1):\\n\\n ans.append(i*j%2019)\\n\\n if (i * j % 2019) == 0:\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break\\n\\n\\n\\nprint((min(ans)))',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 297,\n", + " 'code_v1_num_chars': 237,\n", + " 'code_v0_no_empty_lines': 'L, R = list(map(int, input().split()))\\nans = []\\nif R - L <= 2019:\\n for i in range(L, R + 1):\\n for j in range(i + 1, R + 1):\\n ans.append(i * j % 2019)\\nelse:\\n for i in range(R - L - 1010, R - L + 1010):\\n for j in range(i, R - L + 1010):\\n ans.append(i * j % 2019)\\nprint((min(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'L, R = list(map(int, input().split()))\\nans = []\\nfor i in range(L, R + 1):\\n for j in range(i + 1, R + 1):\\n ans.append(i * j % 2019)\\n if (i * j % 2019) == 0:\\n break\\n else:\\n continue\\n break\\nprint((min(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.1428571429,\n", + " 'diff': ['-if R - L <= 2019:',\n", + " '- for i in range(L, R + 1):',\n", + " '- for j in range(i + 1, R + 1):',\n", + " '- ans.append(i * j % 2019)',\n", + " '-else:',\n", + " '- for i in range(R - L - 1010, R - L + 1010):',\n", + " '- for j in range(i, R - L + 1010):',\n", + " '- ans.append(i * j % 2019)',\n", + " '+for i in range(L, R + 1):',\n", + " '+ for j in range(i + 1, R + 1):',\n", + " '+ ans.append(i * j % 2019)',\n", + " '+ if (i * j % 2019) == 0:',\n", + " '+ break',\n", + " '+ else:',\n", + " '+ continue',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3668963638,\n", + " 'measured_runtime_v1': 0.2102679547,\n", + " 'runtime_lift': 1.7448990943,\n", + " 'key': ['s074902378', 's358904585']},\n", + " {'user_id': 'u588341295',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's622309249',\n", + " 'submission_id_v1': 's171509372',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 8728,\n", + " 'memory_v1': 4976,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 68.64,\n", + " 'input': \"# -*- coding: utf-8 -*-\\n\\n\\n\\nimport sys\\n\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\\n\\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\\n\\ndef ceil(x, y=1): return int(-(-x // y))\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\ndef Yes(): print('Yes')\\n\\ndef No(): print('No')\\n\\ndef YES(): print('YES')\\n\\ndef NO(): print('NO')\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float('inf')\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\nX,Y,Z,K=MAP()\\n\\nA=sorted(LIST(), reverse=True)\\n\\nB=sorted(LIST(), reverse=True)\\n\\nC=sorted(LIST(), reverse=True)\\n\\n\\n\\nABC=[]\\n\\nfor i in range(X):\\n\\n for j in range(Y):\\n\\n if (i+1)*(j+1)>K:\\n\\n break\\n\\n for k in range(Z):\\n\\n if (i+1)*(j+1)*(k+1)>K:\\n\\n break\\n\\n ABC.append(A[i]+B[j]+C[k])\\n\\nABC.sort(reverse=True)\\n\\nfor i in range(K):\\n\\n print((ABC[i]))\\n\\n\\n\",\n", + " 'target': \"# -*- coding: utf-8 -*-\\n\\n\\n\\nimport sys\\n\\nfrom heapq import heappush, heappop\\n\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\\n\\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\\n\\ndef ceil(x, y=1): return int(-(-x // y))\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\ndef Yes(): print('Yes')\\n\\ndef No(): print('No')\\n\\ndef YES(): print('YES')\\n\\ndef NO(): print('NO')\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float('inf')\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\nX,Y,Z,K=MAP()\\n\\nA=sorted(LIST(), reverse=True)\\n\\nB=sorted(LIST(), reverse=True)\\n\\nC=sorted(LIST(), reverse=True)\\n\\n\\n\\n\\n\\nque=[]\\n\\nheappush(que, (-(A[0]+B[0]+C[0]), 0, 0, 0))\\n\\nS={(0,0,0)}\\n\\nfor i in range(K):\\n\\n ans=heappop(que)\\n\\n print((-ans[0]))\\n\\n a,b,c=ans[1:]\\n\\n if a+1 K:\\n break\\n for k in range(Z):\\n if (i + 1) * (j + 1) * (k + 1) > K:\\n break\\n ABC.append(A[i] + B[j] + C[k])\\nABC.sort(reverse=True)\\nfor i in range(K):\\n print((ABC[i]))\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\nfrom heapq import heappush, heappop\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef list2d(a, b, c):\\n return [[c] * b for i in range(a)]\\n\\n\\ndef list3d(a, b, c, d):\\n return [[[d] * c for j in range(b)] for i in range(a)]\\n\\n\\ndef ceil(x, y=1):\\n return int(-(-x // y))\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST():\\n return list(map(int, input().split()))\\n\\n\\ndef Yes():\\n print(\"Yes\")\\n\\n\\ndef No():\\n print(\"No\")\\n\\n\\ndef YES():\\n print(\"YES\")\\n\\n\\ndef NO():\\n print(\"NO\")\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nMOD = 10**9 + 7\\nX, Y, Z, K = MAP()\\nA = sorted(LIST(), reverse=True)\\nB = sorted(LIST(), reverse=True)\\nC = sorted(LIST(), reverse=True)\\nque = []\\nheappush(que, (-(A[0] + B[0] + C[0]), 0, 0, 0))\\nS = {(0, 0, 0)}\\nfor i in range(K):\\n ans = heappop(que)\\n print((-ans[0]))\\n a, b, c = ans[1:]\\n if a + 1 < X and (a + 1, b, c) not in S:\\n heappush(que, (-(A[a + 1] + B[b] + C[c]), a + 1, b, c))\\n S.add((a + 1, b, c))\\n if b + 1 < Y and (a, b + 1, c) not in S:\\n heappush(que, (-(A[a] + B[b + 1] + C[c]), a, b + 1, c))\\n S.add((a, b + 1, c))\\n if c + 1 < Z and (a, b, c + 1) not in S:\\n heappush(que, (-(A[a] + B[b] + C[c + 1]), a, b, c + 1))\\n S.add((a, b, c + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.9047619048,\n", + " 'diff': ['+from heapq import heappush, heappop',\n", + " '-ABC = []',\n", + " '-for i in range(X):',\n", + " '- for j in range(Y):',\n", + " '- if (i + 1) * (j + 1) > K:',\n", + " '- break',\n", + " '- for k in range(Z):',\n", + " '- if (i + 1) * (j + 1) * (k + 1) > K:',\n", + " '- break',\n", + " '- ABC.append(A[i] + B[j] + C[k])',\n", + " '-ABC.sort(reverse=True)',\n", + " '+que = []',\n", + " '+heappush(que, (-(A[0] + B[0] + C[0]), 0, 0, 0))',\n", + " '+S = {(0, 0, 0)}',\n", + " '- print((ABC[i]))',\n", + " '+ ans = heappop(que)',\n", + " '+ print((-ans[0]))',\n", + " '+ a, b, c = ans[1:]',\n", + " '+ if a + 1 < X and (a + 1, b, c) not in S:',\n", + " '+ heappush(que, (-(A[a + 1] + B[b] + C[c]), a + 1, b, c))',\n", + " '+ S.add((a + 1, b, c))',\n", + " '+ if b + 1 < Y and (a, b + 1, c) not in S:',\n", + " '+ heappush(que, (-(A[a] + B[b + 1] + C[c]), a, b + 1, c))',\n", + " '+ S.add((a, b + 1, c))',\n", + " '+ if c + 1 < Z and (a, b, c + 1) not in S:',\n", + " '+ heappush(que, (-(A[a] + B[b] + C[c + 1]), a, b, c + 1))',\n", + " '+ S.add((a, b, c + 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2840606916,\n", + " 'measured_runtime_v1': 0.2124910862,\n", + " 'runtime_lift': 1.3368122711,\n", + " 'key': ['s622309249', 's171509372']},\n", + " {'user_id': 'u072053884',\n", + " 'problem_id': 'p02245',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's696240934',\n", + " 'submission_id_v1': 's480327836',\n", + " 'cpu_time_v0': 120,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 10724,\n", + " 'memory_v1': 13476,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': \"import sys\\n\\n\\n\\ninit = ''.join(sys.stdin.read().split())\\n\\n\\n\\n# Bidirectional search using breadth-first search\\n\\ndef solve(start, goal):\\n\\n if start == goal:\\n\\n return 0\\n\\n generated_state = {start: 0, goal: 1} # 0: foreward, 1: backward\\n\\n step = {start: 0, goal: 0}\\n\\n s = 0\\n\\n c_d = [(start, 0), (goal, 1)] # configure and direction\\n\\n while True:\\n\\n q = iter(c_d)\\n\\n c_d = []\\n\\n s += 1\\n\\n for c, d in q:\\n\\n i = c.find('0')\\n\\n if 0 <= i <= 5:\\n\\n t = str.maketrans('0' + c[i+3], c[i+3] + '0')\\n\\n t_c = c.translate(t)\\n\\n if t_c in generated_state:\\n\\n if generated_state[t_c] != d:\\n\\n return s + step[t_c]\\n\\n else:\\n\\n generated_state[t_c] = d\\n\\n step[t_c] = s\\n\\n c_d.append((t_c, d))\\n\\n if i >= 3:\\n\\n t = str.maketrans('0' + c[i-3], c[i-3] + '0')\\n\\n t_c = c.translate(t)\\n\\n if t_c in generated_state:\\n\\n if generated_state[t_c] != d:\\n\\n return s + step[t_c]\\n\\n else:\\n\\n generated_state[t_c] = d\\n\\n step[t_c] = s\\n\\n c_d.append((t_c, d))\\n\\n if i == 0 or i == 1 or i == 3 or i == 4 or i == 6 or i == 7:\\n\\n t = str.maketrans('0' + c[i+1], c[i+1] + '0')\\n\\n t_c = c.translate(t)\\n\\n if t_c in generated_state:\\n\\n if generated_state[t_c] != d:\\n\\n return s + step[t_c]\\n\\n else:\\n\\n generated_state[t_c] = d\\n\\n step[t_c] = s\\n\\n c_d.append((t_c, d))\\n\\n if i == 1 or i == 2 or i == 4 or i == 5 or i == 7 or i == 8:\\n\\n t = str.maketrans('0' + c[i-1], c[i-1] + '0')\\n\\n t_c = c.translate(t)\\n\\n if t_c in generated_state:\\n\\n if generated_state[t_c] != d:\\n\\n return s + step[t_c]\\n\\n else:\\n\\n generated_state[t_c] = d\\n\\n step[t_c] = s\\n\\n c_d.append((t_c, d))\\n\\n\\n\\nprint((solve(init, '123456780')))\",\n", + " 'target': 'adjacent = (\\n\\n (1, 3), # 0\\n\\n (0, 2, 4), # 1\\n\\n (1, 5), # 2\\n\\n (0, 4, 6), # 3\\n\\n (1, 3, 5, 7), # 4\\n\\n (2, 4, 8), # 5\\n\\n (3, 7), # 6\\n\\n (4, 6, 8), # 7\\n\\n (5, 7) # 8\\n\\n)\\n\\n\\n\\nimport collections\\n\\n\\n\\nGOAL = [1, 2, 3, 4, 5, 6, 7, 8, 0]\\n\\n\\n\\n# Bidirectional search using breadth-first search\\n\\ndef solve(start):\\n\\n if start == GOAL:\\n\\n return 0\\n\\n # 0: forward, 1: backward\\n\\n generated_state = {tuple(start): 0, tuple(GOAL): 1}\\n\\n step = {tuple(start): 0, tuple(GOAL): 0}\\n\\n s = 0\\n\\n state1 = [(start, 0), (GOAL, 1)]\\n\\n while state1:\\n\\n state2 = state1[:]\\n\\n state1 = []\\n\\n s += 1\\n\\n for s2, d in state2:\\n\\n i = s2.index(0)\\n\\n for p in adjacent[i]:\\n\\n s1 = s2[:]\\n\\n s1[i], s1[p] = s1[p], 0\\n\\n key = tuple(s1)\\n\\n if key in generated_state:\\n\\n if generated_state[key] != d:\\n\\n return s + step[key]\\n\\n continue\\n\\n state1.append((s1, d))\\n\\n generated_state[key] = d\\n\\n step[key] = s\\n\\n\\n\\nimport sys\\n\\n\\n\\nstart = list(map(int, sys.stdin.read().split()))\\n\\n\\n\\nprint((solve(start)))',\n", + " 'code_v0_loc': 60,\n", + " 'code_v1_loc': 48,\n", + " 'code_v0_num_chars': 2264,\n", + " 'code_v1_num_chars': 1231,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninit = \"\".join(sys.stdin.read().split())\\n# Bidirectional search using breadth-first search\\ndef solve(start, goal):\\n if start == goal:\\n return 0\\n generated_state = {start: 0, goal: 1} # 0: foreward, 1: backward\\n step = {start: 0, goal: 0}\\n s = 0\\n c_d = [(start, 0), (goal, 1)] # configure and direction\\n while True:\\n q = iter(c_d)\\n c_d = []\\n s += 1\\n for c, d in q:\\n i = c.find(\"0\")\\n if 0 <= i <= 5:\\n t = str.maketrans(\"0\" + c[i + 3], c[i + 3] + \"0\")\\n t_c = c.translate(t)\\n if t_c in generated_state:\\n if generated_state[t_c] != d:\\n return s + step[t_c]\\n else:\\n generated_state[t_c] = d\\n step[t_c] = s\\n c_d.append((t_c, d))\\n if i >= 3:\\n t = str.maketrans(\"0\" + c[i - 3], c[i - 3] + \"0\")\\n t_c = c.translate(t)\\n if t_c in generated_state:\\n if generated_state[t_c] != d:\\n return s + step[t_c]\\n else:\\n generated_state[t_c] = d\\n step[t_c] = s\\n c_d.append((t_c, d))\\n if i == 0 or i == 1 or i == 3 or i == 4 or i == 6 or i == 7:\\n t = str.maketrans(\"0\" + c[i + 1], c[i + 1] + \"0\")\\n t_c = c.translate(t)\\n if t_c in generated_state:\\n if generated_state[t_c] != d:\\n return s + step[t_c]\\n else:\\n generated_state[t_c] = d\\n step[t_c] = s\\n c_d.append((t_c, d))\\n if i == 1 or i == 2 or i == 4 or i == 5 or i == 7 or i == 8:\\n t = str.maketrans(\"0\" + c[i - 1], c[i - 1] + \"0\")\\n t_c = c.translate(t)\\n if t_c in generated_state:\\n if generated_state[t_c] != d:\\n return s + step[t_c]\\n else:\\n generated_state[t_c] = d\\n step[t_c] = s\\n c_d.append((t_c, d))\\n\\n\\nprint((solve(init, \"123456780\")))\\n',\n", + " 'code_v1_no_empty_lines': 'adjacent = (\\n (1, 3), # 0\\n (0, 2, 4), # 1\\n (1, 5), # 2\\n (0, 4, 6), # 3\\n (1, 3, 5, 7), # 4\\n (2, 4, 8), # 5\\n (3, 7), # 6\\n (4, 6, 8), # 7\\n (5, 7), # 8\\n)\\nimport collections\\n\\nGOAL = [1, 2, 3, 4, 5, 6, 7, 8, 0]\\n# Bidirectional search using breadth-first search\\ndef solve(start):\\n if start == GOAL:\\n return 0\\n # 0: forward, 1: backward\\n generated_state = {tuple(start): 0, tuple(GOAL): 1}\\n step = {tuple(start): 0, tuple(GOAL): 0}\\n s = 0\\n state1 = [(start, 0), (GOAL, 1)]\\n while state1:\\n state2 = state1[:]\\n state1 = []\\n s += 1\\n for s2, d in state2:\\n i = s2.index(0)\\n for p in adjacent[i]:\\n s1 = s2[:]\\n s1[i], s1[p] = s1[p], 0\\n key = tuple(s1)\\n if key in generated_state:\\n if generated_state[key] != d:\\n return s + step[key]\\n continue\\n state1.append((s1, d))\\n generated_state[key] = d\\n step[key] = s\\n\\n\\nimport sys\\n\\nstart = list(map(int, sys.stdin.read().split()))\\nprint((solve(start)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['+adjacent = (',\n", + " '+ (1, 3), # 0',\n", + " '+ (0, 2, 4), # 1',\n", + " '+ (1, 5), # 2',\n", + " '+ (0, 4, 6), # 3',\n", + " '+ (1, 3, 5, 7), # 4',\n", + " '+ (2, 4, 8), # 5',\n", + " '+ (3, 7), # 6',\n", + " '+ (4, 6, 8), # 7',\n", + " '+ (5, 7), # 8',\n", + " '+)',\n", + " '+import collections',\n", + " '+',\n", + " '+GOAL = [1, 2, 3, 4, 5, 6, 7, 8, 0]',\n", + " '+# Bidirectional search using breadth-first search',\n", + " '+def solve(start):',\n", + " '+ if start == GOAL:',\n", + " '+ return 0',\n", + " '+ # 0: forward, 1: backward',\n", + " '+ generated_state = {tuple(start): 0, tuple(GOAL): 1}',\n", + " '+ step = {tuple(start): 0, tuple(GOAL): 0}',\n", + " '+ s = 0',\n", + " '+ state1 = [(start, 0), (GOAL, 1)]',\n", + " '+ while state1:',\n", + " '+ state2 = state1[:]',\n", + " '+ state1 = []',\n", + " '+ s += 1',\n", + " '+ for s2, d in state2:',\n", + " '+ i = s2.index(0)',\n", + " '+ for p in adjacent[i]:',\n", + " '+ s1 = s2[:]',\n", + " '+ s1[i], s1[p] = s1[p], 0',\n", + " '+ key = tuple(s1)',\n", + " '+ if key in generated_state:',\n", + " '+ if generated_state[key] != d:',\n", + " '+ return s + step[key]',\n", + " '+ continue',\n", + " '+ state1.append((s1, d))',\n", + " '+ generated_state[key] = d',\n", + " '+ step[key] = s',\n", + " '+',\n", + " '+',\n", + " '-init = \"\".join(sys.stdin.read().split())',\n", + " '-# Bidirectional search using breadth-first search',\n", + " '-def solve(start, goal):',\n", + " '- if start == goal:',\n", + " '- return 0',\n", + " '- generated_state = {start: 0, goal: 1} # 0: foreward, 1: backward',\n", + " '- step = {start: 0, goal: 0}',\n", + " '- s = 0',\n", + " '- c_d = [(start, 0), (goal, 1)] # configure and direction',\n", + " '- while True:',\n", + " '- q = iter(c_d)',\n", + " '- c_d = []',\n", + " '- s += 1',\n", + " '- for c, d in q:',\n", + " '- i = c.find(\"0\")',\n", + " '- if 0 <= i <= 5:',\n", + " '- t = str.maketrans(\"0\" + c[i + 3], c[i + 3] + \"0\")',\n", + " '- t_c = c.translate(t)',\n", + " '- if t_c in generated_state:',\n", + " '- if generated_state[t_c] != d:',\n", + " '- return s + step[t_c]',\n", + " '- else:',\n", + " '- generated_state[t_c] = d',\n", + " '- step[t_c] = s',\n", + " '- c_d.append((t_c, d))',\n", + " '- if i >= 3:',\n", + " '- t = str.maketrans(\"0\" + c[i - 3], c[i - 3] + \"0\")',\n", + " '- t_c = c.translate(t)',\n", + " '- if t_c in generated_state:',\n", + " '- if generated_state[t_c] != d:',\n", + " '- return s + step[t_c]',\n", + " '- else:',\n", + " '- generated_state[t_c] = d',\n", + " '- step[t_c] = s',\n", + " '- c_d.append((t_c, d))',\n", + " '- if i == 0 or i == 1 or i == 3 or i == 4 or i == 6 or i == 7:',\n", + " '- t = str.maketrans(\"0\" + c[i + 1], c[i + 1] + \"0\")',\n", + " '- t_c = c.translate(t)',\n", + " '- if t_c in generated_state:',\n", + " '- if generated_state[t_c] != d:',\n", + " '- return s + step[t_c]',\n", + " '- else:',\n", + " '- generated_state[t_c] = d',\n", + " '- step[t_c] = s',\n", + " '- c_d.append((t_c, d))',\n", + " '- if i == 1 or i == 2 or i == 4 or i == 5 or i == 7 or i == 8:',\n", + " '- t = str.maketrans(\"0\" + c[i - 1], c[i - 1] + \"0\")',\n", + " '- t_c = c.translate(t)',\n", + " '- if t_c in generated_state:',\n", + " '- if generated_state[t_c] != d:',\n", + " '- return s + step[t_c]',\n", + " '- else:',\n", + " '- generated_state[t_c] = d',\n", + " '- step[t_c] = s',\n", + " '- c_d.append((t_c, d))',\n", + " '-',\n", + " '-',\n", + " '-print((solve(init, \"123456780\")))',\n", + " '+start = list(map(int, sys.stdin.read().split()))',\n", + " '+print((solve(start)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3218115091,\n", + " 'measured_runtime_v1': 0.2098443508,\n", + " 'runtime_lift': 1.533572421,\n", + " 'key': ['s696240934', 's480327836']},\n", + " {'user_id': 'u961683878',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's650878996',\n", + " 'submission_id_v1': 's172963527',\n", + " 'cpu_time_v0': 1976,\n", + " 'cpu_time_v1': 198,\n", + " 'memory_v0': 165028,\n", + " 'memory_v1': 9244,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.98,\n", + " 'input': '#! /usr/bin/env python3\\n\\n\\n\\nimport sys\\n\\nint1 = lambda x: int(x) - 1\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\nsys.setrecursionlimit(500000)\\n\\n\\n\\n\\n\\ndef isMultiple(s, m):\\n\\n tmp = 0\\n\\n for i in range(len(s)):\\n\\n tmp = (tmp * 10 + int(s[i])) % m\\n\\n if tmp == 0:\\n\\n return i\\n\\n return -1\\n\\n\\n\\n\\n\\nk = int(readline())\\n\\nacc = \"7\" * 50000000\\n\\nif k % 2 == 0:\\n\\n ans = -1\\n\\nelse:\\n\\n\\n\\n ans = isMultiple(acc, k)\\n\\n if ans != -1:\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': '#! /usr/bin/env python3\\n\\n\\n\\nimport sys\\n\\nint1 = lambda x: int(x) - 1\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\nsys.setrecursionlimit(500000)\\n\\n\\n\\nk = int(readline())\\n\\n\\n\\nans = -1\\n\\nacc = 7 % k\\n\\nfor n in range(1, k + 10):\\n\\n if acc == 0:\\n\\n ans = n\\n\\n break\\n\\n acc = (10 * acc + 7) % k\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 543,\n", + " 'code_v1_num_chars': 376,\n", + " 'code_v0_no_empty_lines': '#! /usr/bin/env python3\\nimport sys\\n\\nint1 = lambda x: int(x) - 1\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nsys.setrecursionlimit(500000)\\n\\n\\ndef isMultiple(s, m):\\n tmp = 0\\n for i in range(len(s)):\\n tmp = (tmp * 10 + int(s[i])) % m\\n if tmp == 0:\\n return i\\n return -1\\n\\n\\nk = int(readline())\\nacc = \"7\" * 50000000\\nif k % 2 == 0:\\n ans = -1\\nelse:\\n ans = isMultiple(acc, k)\\n if ans != -1:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '#! /usr/bin/env python3\\nimport sys\\n\\nint1 = lambda x: int(x) - 1\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nsys.setrecursionlimit(500000)\\nk = int(readline())\\nans = -1\\nacc = 7 % k\\nfor n in range(1, k + 10):\\n if acc == 0:\\n ans = n\\n break\\n acc = (10 * acc + 7) % k\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def isMultiple(s, m):',\n", + " '- tmp = 0',\n", + " '- for i in range(len(s)):',\n", + " '- tmp = (tmp * 10 + int(s[i])) % m',\n", + " '- if tmp == 0:',\n", + " '- return i',\n", + " '- return -1',\n", + " '-',\n", + " '-',\n", + " '-acc = \"7\" * 50000000',\n", + " '-if k % 2 == 0:',\n", + " '- ans = -1',\n", + " '-else:',\n", + " '- ans = isMultiple(acc, k)',\n", + " '- if ans != -1:',\n", + " '- ans += 1',\n", + " '+ans = -1',\n", + " '+acc = 7 % k',\n", + " '+for n in range(1, k + 10):',\n", + " '+ if acc == 0:',\n", + " '+ ans = n',\n", + " '+ break',\n", + " '+ acc = (10 * acc + 7) % k'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8533027549,\n", + " 'measured_runtime_v1': 0.4769769247,\n", + " 'runtime_lift': 1.788981208,\n", + " 'key': ['s650878996', 's172963527']},\n", + " {'user_id': 'u716530146',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's839494003',\n", + " 'submission_id_v1': 's928697183',\n", + " 'cpu_time_v0': 613,\n", + " 'cpu_time_v1': 410,\n", + " 'memory_v0': 89216,\n", + " 'memory_v1': 43704,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.12,\n", + " 'input': 'import sys\\n\\ninput = lambda: sys.stdin.readline()[:-1]\\n\\nn,m=list(map(int,input().split()))\\n\\na0=list(map(int,input().split()))\\n\\ndata=[list(map(int,input().split())) for i in range(m)]\\n\\nfor i in a0:\\n\\n\\tdata.append([1,i])\\n\\ndata.sort(key=lambda tup:-tup[1])\\n\\nans=0\\n\\nfor num,val in data:\\n\\n\\tif n>=num:\\n\\n\\t\\tn-=num\\n\\n\\t\\tans+=val*num\\n\\n\\telse:\\n\\n\\t\\tans+=val*n\\n\\n\\t\\tbreak\\n\\nprint(ans)\\n',\n", + " 'target': '#!/usr/bin/env python3\\n\\nimport sys\\n\\nfrom collections import Counter\\n\\ninput = lambda: sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(10**8)\\n\\n\\n\\nans=0\\n\\nn,m=list(map(int,input().split()))\\n\\nA=list(map(int,input().split()))\\n\\nbc=[]\\n\\nfor i in range(m):\\n\\n b,c=list(map(int,input().split()))\\n\\n bc.append((c,b))\\n\\nC=Counter(A)\\n\\nbc+=list(C.items())\\n\\nbc.sort(key=lambda tup:-tup[0])\\n\\n# print(bc)\\n\\nfor c,b in bc:\\n\\n if n>=b:\\n\\n n-=b\\n\\n ans+=c*b\\n\\n else:\\n\\n ans+=c*n\\n\\n break\\n\\nprint(ans)\\n\\n\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 357,\n", + " 'code_v1_num_chars': 498,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = lambda: sys.stdin.readline()[:-1]\\nn, m = list(map(int, input().split()))\\na0 = list(map(int, input().split()))\\ndata = [list(map(int, input().split())) for i in range(m)]\\nfor i in a0:\\n data.append([1, i])\\ndata.sort(key=lambda tup: -tup[1])\\nans = 0\\nfor num, val in data:\\n if n >= num:\\n n -= num\\n ans += val * num\\n else:\\n ans += val * n\\n break\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\nfrom collections import Counter\\n\\ninput = lambda: sys.stdin.readline()[:-1]\\nsys.setrecursionlimit(10**8)\\nans = 0\\nn, m = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nbc = []\\nfor i in range(m):\\n b, c = list(map(int, input().split()))\\n bc.append((c, b))\\nC = Counter(A)\\nbc += list(C.items())\\nbc.sort(key=lambda tup: -tup[0])\\n# print(bc)\\nfor c, b in bc:\\n if n >= b:\\n n -= b\\n ans += c * b\\n else:\\n ans += c * n\\n break\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 34.6153846154,\n", + " 'diff': ['+#!/usr/bin/env python3',\n", + " '+from collections import Counter',\n", + " '+sys.setrecursionlimit(10**8)',\n", + " '+ans = 0',\n", + " '-a0 = list(map(int, input().split()))',\n", + " '-data = [list(map(int, input().split())) for i in range(m)]',\n", + " '-for i in a0:',\n", + " '- data.append([1, i])',\n", + " '-data.sort(key=lambda tup: -tup[1])',\n", + " '-ans = 0',\n", + " '-for num, val in data:',\n", + " '- if n >= num:',\n", + " '- n -= num',\n", + " '- ans += val * num',\n", + " '+A = list(map(int, input().split()))',\n", + " '+bc = []',\n", + " '+for i in range(m):',\n", + " '+ b, c = list(map(int, input().split()))',\n", + " '+ bc.append((c, b))',\n", + " '+C = Counter(A)',\n", + " '+bc += list(C.items())',\n", + " '+bc.sort(key=lambda tup: -tup[0])',\n", + " '+# print(bc)',\n", + " '+for c, b in bc:',\n", + " '+ if n >= b:',\n", + " '+ n -= b',\n", + " '+ ans += c * b',\n", + " '- ans += val * n',\n", + " '+ ans += c * n'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2703684399,\n", + " 'measured_runtime_v1': 0.1342513988,\n", + " 'runtime_lift': 2.013896632,\n", + " 'key': ['s839494003', 's928697183']},\n", + " {'user_id': 'u369133448',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's601267167',\n", + " 'submission_id_v1': 's993032779',\n", + " 'cpu_time_v0': 855,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 21024,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 98.01,\n", + " 'input': 'import numpy as np\\n\\nn,d=list(map(int,input().split()))\\n\\nnda=np.empty((0,d),int)\\n\\nans=0\\n\\nfor i in range(0,n):\\n\\n a=np.array([list(map(int,input().split()))])\\n\\n for j in range(i):\\n\\n chklen=np.linalg.norm(a-nda[j])\\n\\n if chklen==chklen//1:\\n\\n ans+=1\\n\\n nda=np.append(nda,a,axis=0)\\n\\nprint(ans)',\n", + " 'target': 'import math\\n\\nn,d=list(map(int,input().split()))\\n\\na=[0]*n\\n\\nfor i in range(n):\\n\\n a[i]=list(map(int,input().split()))\\n\\nans=0\\n\\nfor i in range(n-1):\\n\\n for j in range(i+1,n):\\n\\n chklen=0\\n\\n wk=0\\n\\n for k in range(d):\\n\\n wk+=abs(a[i][k]-a[j][k])**2\\n\\n chklen=math.sqrt(wk)\\n\\n if chklen==chklen//1:\\n\\n ans+=1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 293,\n", + " 'code_v1_num_chars': 326,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, d = list(map(int, input().split()))\\nnda = np.empty((0, d), int)\\nans = 0\\nfor i in range(0, n):\\n a = np.array([list(map(int, input().split()))])\\n for j in range(i):\\n chklen = np.linalg.norm(a - nda[j])\\n if chklen == chklen // 1:\\n ans += 1\\n nda = np.append(nda, a, axis=0)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nn, d = list(map(int, input().split()))\\na = [0] * n\\nfor i in range(n):\\n a[i] = list(map(int, input().split()))\\nans = 0\\nfor i in range(n - 1):\\n for j in range(i + 1, n):\\n chklen = 0\\n wk = 0\\n for k in range(d):\\n wk += abs(a[i][k] - a[j][k]) ** 2\\n chklen = math.sqrt(wk)\\n if chklen == chklen // 1:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-import numpy as np',\n", + " '+import math',\n", + " '-nda = np.empty((0, d), int)',\n", + " '+a = [0] * n',\n", + " '+for i in range(n):',\n", + " '+ a[i] = list(map(int, input().split()))',\n", + " '-for i in range(0, n):',\n", + " '- a = np.array([list(map(int, input().split()))])',\n", + " '- for j in range(i):',\n", + " '- chklen = np.linalg.norm(a - nda[j])',\n", + " '+for i in range(n - 1):',\n", + " '+ for j in range(i + 1, n):',\n", + " '+ chklen = 0',\n", + " '+ wk = 0',\n", + " '+ for k in range(d):',\n", + " '+ wk += abs(a[i][k] - a[j][k]) ** 2',\n", + " '+ chklen = math.sqrt(wk)',\n", + " '- nda = np.append(nda, a, axis=0)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8428332808,\n", + " 'measured_runtime_v1': 0.3216582146,\n", + " 'runtime_lift': 5.7291659198,\n", + " 'key': ['s601267167', 's993032779']},\n", + " {'user_id': 'u074220993',\n", + " 'problem_id': 'p03436',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's307409656',\n", + " 'submission_id_v1': 's939897094',\n", + " 'cpu_time_v0': 134,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 26588,\n", + " 'memory_v1': 9536,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 72.39,\n", + " 'input': \"H, W = list(map(int, input().split()))\\n\\nimport numpy as np\\n\\nGrid = np.array([[0 if x == '.' else -1 for x in eval(input())] for _ in range(H)],dtype='int64')\\n\\n\\n\\ndef solveMase(Grid, start, goal): #bfsで迷路を解き、スタート-ゴール間の最低必要白マス数を返す\\n\\n seen = {start}\\n\\n V = [start]\\n\\n while len(V) != 0: #bfs\\n\\n v = V.pop(0)\\n\\n if v == goal:\\n\\n return Grid[goal]\\n\\n #移動先nvをリストにまとめる\\n\\n y,x = v\\n\\n nV = []\\n\\n if x > 0: nV.append((y,x-1))\\n\\n if y > 0: nV.append((y-1,x))\\n\\n if x < W-1: nV.append((y,x+1))\\n\\n if y < H-1: nV.append((y+1,x))\\n\\n #bfs\\n\\n for nv in nV:\\n\\n if Grid[nv] == -1 or nv in seen:\\n\\n continue\\n\\n Grid[nv] = Grid[v] + 1\\n\\n V.append(nv)\\n\\n seen.add(nv)\\n\\n return 0\\n\\n\\n\\nwhite = len(Grid[Grid == 0])-1\\n\\nnes_white = solveMase(Grid, (0,0), (H-1,W-1))\\n\\nprint((white-nes_white if nes_white > 0 else -1))\",\n", + " 'target': \"from collections import deque, Counter\\n\\n\\n\\ndef main():\\n\\n with open(0) as f:\\n\\n H, W = list(map(int, f.readline().split()))\\n\\n maze = [list(line) for line in f.readlines()]\\n\\n\\n\\n rank = [[None]*W for _ in range(H)]\\n\\n rank[0][0] = 0\\n\\n #bfs\\n\\n reserved = deque([(0,0)])\\n\\n while len(reserved) > 0:\\n\\n x, y = reserved.popleft()\\n\\n for u,v in [(s,t) for s,t in [(x-1,y), (x+1,y), (x,y-1), (x,y+1)] if 0<=s 0:\\n nV.append((y, x - 1))\\n if y > 0:\\n nV.append((y - 1, x))\\n if x < W - 1:\\n nV.append((y, x + 1))\\n if y < H - 1:\\n nV.append((y + 1, x))\\n # bfs\\n for nv in nV:\\n if Grid[nv] == -1 or nv in seen:\\n continue\\n Grid[nv] = Grid[v] + 1\\n V.append(nv)\\n seen.add(nv)\\n return 0\\n\\n\\nwhite = len(Grid[Grid == 0]) - 1\\nnes_white = solveMase(Grid, (0, 0), (H - 1, W - 1))\\nprint((white - nes_white if nes_white > 0 else -1))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque, Counter\\n\\n\\ndef main():\\n with open(0) as f:\\n H, W = list(map(int, f.readline().split()))\\n maze = [list(line) for line in f.readlines()]\\n rank = [[None] * W for _ in range(H)]\\n rank[0][0] = 0\\n # bfs\\n reserved = deque([(0, 0)])\\n while len(reserved) > 0:\\n x, y = reserved.popleft()\\n for u, v in [\\n (s, t)\\n for s, t in [(x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)]\\n if 0 <= s < H and 0 <= t < W\\n ]:\\n if rank[u][v] is not None:\\n continue\\n if maze[u][v] == \".\":\\n rank[u][v] = rank[x][y] + 1\\n reserved.append((u, v))\\n if rank[H - 1][W - 1] is None:\\n print((-1))\\n else:\\n counter = Counter()\\n for line in maze:\\n counter.update(line)\\n print((counter[\".\"] - rank[H - 1][W - 1] - 1))\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.3333333333,\n", + " 'diff': ['-H, W = list(map(int, input().split()))',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-Grid = np.array(',\n", + " '- [[0 if x == \".\" else -1 for x in eval(input())] for _ in range(H)], dtype=\"int64\"',\n", + " '-)',\n", + " '+from collections import deque, Counter',\n", + " '-def solveMase(Grid, start, goal): # bfsで迷路を解き、スタート-ゴール間の最低必要白マス数を返す',\n", + " '- seen = {start}',\n", + " '- V = [start]',\n", + " '- while len(V) != 0: # bfs',\n", + " '- v = V.pop(0)',\n", + " '- if v == goal:',\n", + " '- return Grid[goal]',\n", + " '- # 移動先nvをリストにまとめる',\n", + " '- y, x = v',\n", + " '- nV = []',\n", + " '- if x > 0:',\n", + " '- nV.append((y, x - 1))',\n", + " '- if y > 0:',\n", + " '- nV.append((y - 1, x))',\n", + " '- if x < W - 1:',\n", + " '- nV.append((y, x + 1))',\n", + " '- if y < H - 1:',\n", + " '- nV.append((y + 1, x))',\n", + " '- # bfs',\n", + " '- for nv in nV:',\n", + " '- if Grid[nv] == -1 or nv in seen:',\n", + " '+def main():',\n", + " '+ with open(0) as f:',\n", + " '+ H, W = list(map(int, f.readline().split()))',\n", + " '+ maze = [list(line) for line in f.readlines()]',\n", + " '+ rank = [[None] * W for _ in range(H)]',\n", + " '+ rank[0][0] = 0',\n", + " '+ # bfs',\n", + " '+ reserved = deque([(0, 0)])',\n", + " '+ while len(reserved) > 0:',\n", + " '+ x, y = reserved.popleft()',\n", + " '+ for u, v in [',\n", + " '+ (s, t)',\n", + " '+ for s, t in [(x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)]',\n", + " '+ if 0 <= s < H and 0 <= t < W',\n", + " '+ ]:',\n", + " '+ if rank[u][v] is not None:',\n", + " '- Grid[nv] = Grid[v] + 1',\n", + " '- V.append(nv)',\n", + " '- seen.add(nv)',\n", + " '- return 0',\n", + " '+ if maze[u][v] == \".\":',\n", + " '+ rank[u][v] = rank[x][y] + 1',\n", + " '+ reserved.append((u, v))',\n", + " '+ if rank[H - 1][W - 1] is None:',\n", + " '+ print((-1))',\n", + " '+ else:',\n", + " '+ counter = Counter()',\n", + " '+ for line in maze:',\n", + " '+ counter.update(line)',\n", + " '+ print((counter[\".\"] - rank[H - 1][W - 1] - 1))',\n", + " '-white = len(Grid[Grid == 0]) - 1',\n", + " '-nes_white = solveMase(Grid, (0, 0), (H - 1, W - 1))',\n", + " '-print((white - nes_white if nes_white > 0 else -1))',\n", + " '+main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0024964819,\n", + " 'measured_runtime_v1': 0.2990579379,\n", + " 'runtime_lift': 6.6960151473,\n", + " 'key': ['s307409656', 's939897094']},\n", + " {'user_id': 'u438662618',\n", + " 'problem_id': 'p03086',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's956521892',\n", + " 'submission_id_v1': 's325345686',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3188,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': \"import re\\n\\n\\n\\nS = eval(input())\\n\\nmax = 0\\n\\n\\n\\nfor i in range(len(S)) :\\n\\n for j in range(i + 1, len(S) + 1) :\\n\\n pattern = re.compile(r'[A|T|C|G]{%d}' % int(j - i))\\n\\n subStr = S[i:j]\\n\\n\\n\\n if pattern.match(subStr) and j - i > max :\\n\\n max = j - i\\n\\n\\n\\nprint(max)\\n\",\n", + " 'target': \"S = eval(input())\\n\\n\\n\\nans = 0\\n\\n\\n\\nfor i in range(len(S)) :\\n\\n for j in range(i, len(S)) :\\n\\n if all('ACGT'.count(c) == 1 for c in S[i : j + 1]) :\\n\\n ans = max(ans, j - i + 1)\\n\\n\\n\\n\\n\\nprint(ans)\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 282,\n", + " 'code_v1_num_chars': 201,\n", + " 'code_v0_no_empty_lines': 'import re\\n\\nS = eval(input())\\nmax = 0\\nfor i in range(len(S)):\\n for j in range(i + 1, len(S) + 1):\\n pattern = re.compile(r\"[A|T|C|G]{%d}\" % int(j - i))\\n subStr = S[i:j]\\n if pattern.match(subStr) and j - i > max:\\n max = j - i\\nprint(max)\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nans = 0\\nfor i in range(len(S)):\\n for j in range(i, len(S)):\\n if all(\"ACGT\".count(c) == 1 for c in S[i : j + 1]):\\n ans = max(ans, j - i + 1)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['-import re',\n", + " '-',\n", + " '-max = 0',\n", + " '+ans = 0',\n", + " '- for j in range(i + 1, len(S) + 1):',\n", + " '- pattern = re.compile(r\"[A|T|C|G]{%d}\" % int(j - i))',\n", + " '- subStr = S[i:j]',\n", + " '- if pattern.match(subStr) and j - i > max:',\n", + " '- max = j - i',\n", + " '-print(max)',\n", + " '+ for j in range(i, len(S)):',\n", + " '+ if all(\"ACGT\".count(c) == 1 for c in S[i : j + 1]):',\n", + " '+ ans = max(ans, j - i + 1)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3271781678,\n", + " 'measured_runtime_v1': 0.2537176473,\n", + " 'runtime_lift': 1.2895365036,\n", + " 'key': ['s956521892', 's325345686']},\n", + " {'user_id': 'u046187684',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's340270167',\n", + " 'submission_id_v1': 's097893502',\n", + " 'cpu_time_v0': 67,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.45,\n", + " 'input': 'a, b = list(map(int, input().strip().split(\" \")))\\n\\ncount = 0\\n\\nfor i in range(a, b + 1):\\n\\n if str(i) == str(i)[::-1]:\\n\\n count += 1\\n\\nprint(count)\\n',\n", + " 'target': \"def solve(string):\\n\\n a, b = list(map(int, string.split()))\\n\\n count = 0\\n\\n for i in range(a, b + 1):\\n\\n if str(i) == str(i)[::-1]:\\n\\n count += 1\\n\\n return str(count)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n print((solve(eval(input()))))\\n\",\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 148,\n", + " 'code_v1_num_chars': 244,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().strip().split(\" \")))\\ncount = 0\\nfor i in range(a, b + 1):\\n if str(i) == str(i)[::-1]:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'def solve(string):\\n a, b = list(map(int, string.split()))\\n count = 0\\n for i in range(a, b + 1):\\n if str(i) == str(i)[::-1]:\\n count += 1\\n return str(count)\\n\\n\\nif __name__ == \"__main__\":\\n print((solve(eval(input()))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 45.4545454545,\n", + " 'diff': ['-a, b = list(map(int, input().strip().split(\" \")))',\n", + " '-count = 0',\n", + " '-for i in range(a, b + 1):',\n", + " '- if str(i) == str(i)[::-1]:',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+def solve(string):',\n", + " '+ a, b = list(map(int, string.split()))',\n", + " '+ count = 0',\n", + " '+ for i in range(a, b + 1):',\n", + " '+ if str(i) == str(i)[::-1]:',\n", + " '+ count += 1',\n", + " '+ return str(count)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ print((solve(eval(input()))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2889559059,\n", + " 'measured_runtime_v1': 0.2039610577,\n", + " 'runtime_lift': 1.4167209624,\n", + " 'key': ['s340270167', 's097893502']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p02624',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's573473634',\n", + " 'submission_id_v1': 's100010005',\n", + " 'cpu_time_v0': 791,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 266304,\n", + " 'memory_v1': 9168,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 95.58,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\ndef prime_table(N):\\n\\n is_prime = np.zeros(N, np.int64)\\n\\n is_prime[2:3] = 1\\n\\n is_prime[3::2] = 1\\n\\n for p in range(3, N, 2):\\n\\n if p * p >= N:\\n\\n break\\n\\n if is_prime[p]:\\n\\n is_prime[p * p::p + p] = 0\\n\\n return is_prime, np.where(is_prime)[0]\\n\\n\\n\\ndef main(N, primes):\\n\\n div = np.ones(N + 1, dtype=np.int64)\\n\\n for p in primes:\\n\\n for i in range(N // p + 1):\\n\\n div[p * i] += div[i]\\n\\n div *= np.arange(N + 1)\\n\\n return div.sum()\\n\\n\\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n import numba\\n\\n from numba.pycc import CC\\n\\n i8 = numba.int64\\n\\n cc = CC('my_module')\\n\\n\\n\\n def cc_export(f, signature):\\n\\n cc.export(f.__name__, signature)(f)\\n\\n return numba.njit(f)\\n\\n\\n\\n main = cc_export(main, (i8, i8[:]))\\n\\n cc.compile()\\n\\n\\n\\nfrom my_module import main\\n\\n\\n\\nN = int(read())\\n\\nis_prime, primes = prime_table(N + 1)\\n\\nprint((main(N, primes)))\",\n", + " 'target': 'N = int(eval(input()))\\n\\n\\n\\ndef f(x):\\n\\n return x * (x+1) // 2\\n\\n\\n\\nans = 0\\n\\nfor x in range(1, N+1):\\n\\n if x * x > N:\\n\\n break\\n\\n # x = y\\n\\n ans += x * x\\n\\n # x < y の 2 倍\\n\\n y_high = N//x\\n\\n ans += 2 * x * (f(y_high) - f(x))\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 1059,\n", + " 'code_v1_num_chars': 230,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\ndef prime_table(N):\\n is_prime = np.zeros(N, np.int64)\\n is_prime[2:3] = 1\\n is_prime[3::2] = 1\\n for p in range(3, N, 2):\\n if p * p >= N:\\n break\\n if is_prime[p]:\\n is_prime[p * p :: p + p] = 0\\n return is_prime, np.where(is_prime)[0]\\n\\n\\ndef main(N, primes):\\n div = np.ones(N + 1, dtype=np.int64)\\n for p in primes:\\n for i in range(N // p + 1):\\n div[p * i] += div[i]\\n div *= np.arange(N + 1)\\n return div.sum()\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n import numba\\n from numba.pycc import CC\\n\\n i8 = numba.int64\\n cc = CC(\"my_module\")\\n\\n def cc_export(f, signature):\\n cc.export(f.__name__, signature)(f)\\n return numba.njit(f)\\n\\n main = cc_export(main, (i8, i8[:]))\\n cc.compile()\\nfrom my_module import main\\n\\nN = int(read())\\nis_prime, primes = prime_table(N + 1)\\nprint((main(N, primes)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\n\\n\\ndef f(x):\\n return x * (x + 1) // 2\\n\\n\\nans = 0\\nfor x in range(1, N + 1):\\n if x * x > N:\\n break\\n # x = y\\n ans += x * x\\n # x < y の 2 倍\\n y_high = N // x\\n ans += 2 * x * (f(y_high) - f(x))\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 63.6363636364,\n", + " 'diff': ['-import sys',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-read = sys.stdin.buffer.read',\n", + " '-readline = sys.stdin.buffer.readline',\n", + " '-readlines = sys.stdin.buffer.readlines',\n", + " '+N = int(eval(input()))',\n", + " '-def prime_table(N):',\n", + " '- is_prime = np.zeros(N, np.int64)',\n", + " '- is_prime[2:3] = 1',\n", + " '- is_prime[3::2] = 1',\n", + " '- for p in range(3, N, 2):',\n", + " '- if p * p >= N:',\n", + " '- break',\n", + " '- if is_prime[p]:',\n", + " '- is_prime[p * p :: p + p] = 0',\n", + " '- return is_prime, np.where(is_prime)[0]',\n", + " '+def f(x):',\n", + " '+ return x * (x + 1) // 2',\n", + " '-def main(N, primes):',\n", + " '- div = np.ones(N + 1, dtype=np.int64)',\n", + " '- for p in primes:',\n", + " '- for i in range(N // p + 1):',\n", + " '- div[p * i] += div[i]',\n", + " '- div *= np.arange(N + 1)',\n", + " '- return div.sum()',\n", + " '-',\n", + " '-',\n", + " '-if sys.argv[-1] == \"ONLINE_JUDGE\":',\n", + " '- import numba',\n", + " '- from numba.pycc import CC',\n", + " '-',\n", + " '- i8 = numba.int64',\n", + " '- cc = CC(\"my_module\")',\n", + " '-',\n", + " '- def cc_export(f, signature):',\n", + " '- cc.export(f.__name__, signature)(f)',\n", + " '- return numba.njit(f)',\n", + " '-',\n", + " '- main = cc_export(main, (i8, i8[:]))',\n", + " '- cc.compile()',\n", + " '-from my_module import main',\n", + " '-',\n", + " '-N = int(read())',\n", + " '-is_prime, primes = prime_table(N + 1)',\n", + " '-print((main(N, primes)))',\n", + " '+ans = 0',\n", + " '+for x in range(1, N + 1):',\n", + " '+ if x * x > N:',\n", + " '+ break',\n", + " '+ # x = y',\n", + " '+ ans += x * x',\n", + " '+ # x < y の 2 倍',\n", + " '+ y_high = N // x',\n", + " '+ ans += 2 * x * (f(y_high) - f(x))',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4964172101,\n", + " 'measured_runtime_v1': 0.255015204,\n", + " 'runtime_lift': 5.8679529175,\n", + " 'key': ['s573473634', 's100010005']},\n", + " {'user_id': 'u821588465',\n", + " 'problem_id': 'p02886',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's336470673',\n", + " 'submission_id_v1': 's316957674',\n", + " 'cpu_time_v0': 117,\n", + " 'cpu_time_v1': 30,\n", + " 'memory_v0': 27116,\n", + " 'memory_v1': 9044,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.36,\n", + " 'input': 'from itertools import combinations\\n\\nimport numpy as np\\n\\nN = int(eval(input()))\\n\\nD = list(map(int, input().split()))\\n\\nList = np.array(list(combinations(D,2)))\\n\\nprint((sum(np.product(List, axis = 1))))\\n\\n\\n\\n\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nD = list(map(int, input().split()))\\n\\nfrom itertools import accumulate\\n\\nprint((sum(list(d*c for d, c in zip(D[1:], accumulate(D))))))\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 196,\n", + " 'code_v1_num_chars': 149,\n", + " 'code_v0_no_empty_lines': 'from itertools import combinations\\nimport numpy as np\\n\\nN = int(eval(input()))\\nD = list(map(int, input().split()))\\nList = np.array(list(combinations(D, 2)))\\nprint((sum(np.product(List, axis=1))))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nD = list(map(int, input().split()))\\nfrom itertools import accumulate\\n\\nprint((sum(list(d * c for d, c in zip(D[1:], accumulate(D))))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-from itertools import combinations',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-List = np.array(list(combinations(D, 2)))',\n", + " '-print((sum(np.product(List, axis=1))))',\n", + " '+from itertools import accumulate',\n", + " '+',\n", + " '+print((sum(list(d * c for d, c in zip(D[1:], accumulate(D))))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3450187897,\n", + " 'measured_runtime_v1': 0.2237710453,\n", + " 'runtime_lift': 6.0106918118,\n", + " 'key': ['s336470673', 's316957674']},\n", + " {'user_id': 'u912237403',\n", + " 'problem_id': 'p00145',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's120507501',\n", + " 'submission_id_v1': 's768605614',\n", + " 'cpu_time_v0': 160,\n", + " 'cpu_time_v1': 130,\n", + " 'memory_v0': 4524,\n", + " 'memory_v1': 4520,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.75,\n", + " 'input': 'from functools import reduce\\ndef f(a,b): return [Card[a][0], Card[b][1]]\\n\\nn = int(input())\\n\\nCard = [[] for _ in [0]*n]\\n\\nCost = {}\\n\\nfor i in range(n):\\n\\n Card[i] = list(map(int, input().split()))\\n\\n Cost[(i, i)] = 0\\n\\nfor i in range(1, n):\\n\\n for j in range(0, n-i):\\n\\n a = j+i\\n\\n Cost[(j, a)] = min([reduce(lambda a,b: a*b, f(j, k) + f(k+1, a)) + Cost[(j, k)] + Cost[(k+1, a)] for k in range(j, j+i)])\\n\\nprint(Cost[0, n-1])',\n", + " 'target': 'from functools import reduce\\nn = int(input())\\n\\nCard = [[] for _ in [0]*n]\\n\\nCost = {}\\n\\nfor i in range(n):\\n\\n Card[i] = list(map(int, input().split()))\\n\\n Cost[(i, i)] = 0\\n\\nfor i in range(1, n):\\n\\n for j in range(0, n-i):\\n\\n a = j+i\\n\\n Cost[(j, a)] = min([reduce(lambda a,b: a*b, [Card[j][0],Card[k][1],Card[k+1][0],Card[a][1]]) + Cost[(j, k)] + Cost[(k+1, a)] for k in range(j, j+i)])\\n\\nprint(Cost[0, n-1])',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 397,\n", + " 'code_v1_num_chars': 380,\n", + " 'code_v0_no_empty_lines': 'from functools import reduce\\n\\n\\ndef f(a, b):\\n return [Card[a][0], Card[b][1]]\\n\\n\\nn = int(input())\\nCard = [[] for _ in [0] * n]\\nCost = {}\\nfor i in range(n):\\n Card[i] = list(map(int, input().split()))\\n Cost[(i, i)] = 0\\nfor i in range(1, n):\\n for j in range(0, n - i):\\n a = j + i\\n Cost[(j, a)] = min(\\n [\\n reduce(lambda a, b: a * b, f(j, k) + f(k + 1, a))\\n + Cost[(j, k)]\\n + Cost[(k + 1, a)]\\n for k in range(j, j + i)\\n ]\\n )\\nprint(Cost[0, n - 1])\\n',\n", + " 'code_v1_no_empty_lines': 'from functools import reduce\\n\\nn = int(input())\\nCard = [[] for _ in [0] * n]\\nCost = {}\\nfor i in range(n):\\n Card[i] = list(map(int, input().split()))\\n Cost[(i, i)] = 0\\nfor i in range(1, n):\\n for j in range(0, n - i):\\n a = j + i\\n Cost[(j, a)] = min(\\n [\\n reduce(\\n lambda a, b: a * b,\\n [Card[j][0], Card[k][1], Card[k + 1][0], Card[a][1]],\\n )\\n + Cost[(j, k)]\\n + Cost[(k + 1, a)]\\n for k in range(j, j + i)\\n ]\\n )\\nprint(Cost[0, n - 1])\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def f(a, b):',\n", + " '- return [Card[a][0], Card[b][1]]',\n", + " '-',\n", + " '- reduce(lambda a, b: a * b, f(j, k) + f(k + 1, a))',\n", + " '+ reduce(',\n", + " '+ lambda a, b: a * b,',\n", + " '+ [Card[j][0], Card[k][1], Card[k + 1][0], Card[a][1]],',\n", + " '+ )'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2898506114,\n", + " 'measured_runtime_v1': 0.2096236434,\n", + " 'runtime_lift': 1.3827190804,\n", + " 'key': ['s120507501', 's768605614']},\n", + " {'user_id': 'u260980560',\n", + " 'problem_id': 'p02248',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's637132288',\n", + " 'submission_id_v1': 's753981495',\n", + " 'cpu_time_v0': 4740,\n", + " 'cpu_time_v1': 2100,\n", + " 'memory_v0': 92616,\n", + " 'memory_v1': 49584,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.7,\n", + " 'input': 'import random, math\\n\\nrandom.seed()\\n\\ndef gen(a, b, num):\\n\\n result = set()\\n\\n while 1:\\n\\n while 1:\\n\\n v = random.randint(a, b)//2*2+1\\n\\n if v not in result:\\n\\n break\\n\\n for x in range(3, int(math.sqrt(v))+1, 2):\\n\\n if v % x == 0:\\n\\n break\\n\\n else:\\n\\n result.add(v)\\n\\n if len(result) == num:\\n\\n break\\n\\n return result\\n\\nclass RH():\\n\\n def __init__(self, s, base, mod):\\n\\n self.base = base\\n\\n self.mod = mod\\n\\n self.rev = pow(base, mod-2, mod)\\n\\n\\n\\n l = len(s)\\n\\n self.h = h = [0]*(l+1)\\n\\n tmp = 0\\n\\n for i in range(l):\\n\\n num = ord(s[i])\\n\\n tmp = (tmp*base + num) % mod\\n\\n h[i+1] = tmp\\n\\n def calc(self, l, r):\\n\\n return (self.h[r] - self.h[l] * pow(self.base, r-l, self.mod)) % self.mod\\n\\n def fixed(self, length):\\n\\n v = pow(self.base, length, self.mod)\\n\\n h = self.h; mod = self.mod\\n\\n def fixed_calc(l):\\n\\n return (h[length+l] - h[l] * v) % mod\\n\\n return fixed_calc\\n\\nclass RRH():\\n\\n def __init__(self, s, num=10, primes=None):\\n\\n primes = primes or gen(2, 10**3, num)\\n\\n MOD = 10**9+7\\n\\n self.rhs = [RH(s, p, MOD) for p in primes]\\n\\n def calc(self, l, r):\\n\\n return [rh.calc(l, r) for rh in self.rhs]\\n\\n def fixed(self, length):\\n\\n fs = [rh.fixed(length) for rh in self.rhs]\\n\\n def multi_fixed_calc(l):\\n\\n return list(f(l) for f in fs)\\n\\n return multi_fixed_calc\\n\\n\\n\\nT = eval(input()); P = eval(input())\\n\\nprimes = gen(2, 10**3, 2)\\n\\nHT = RRH(T, primes=primes)\\n\\nHP = RRH(P, primes=primes)\\n\\n\\n\\npv = HP.calc(0, len(P))\\n\\ncalc = HT.fixed(len(P))\\n\\nfor i in range(len(T)-len(P)+1):\\n\\n if calc(i) == pv:\\n\\n print(i)',\n", + " 'target': 'class RH():\\n\\n def __init__(self, s, base, mod):\\n\\n self.base = base\\n\\n self.mod = mod\\n\\n self.rev = pow(base, mod-2, mod)\\n\\n\\n\\n l = len(s)\\n\\n self.h = h = [0]*(l+1)\\n\\n tmp = 0\\n\\n for i in range(l):\\n\\n num = ord(s[i])\\n\\n tmp = (tmp*base + num) % mod\\n\\n h[i+1] = tmp\\n\\n def calc(self, l, r):\\n\\n return (self.h[r] - self.h[l] * pow(self.base, r-l, self.mod)) % self.mod\\n\\n def fixed(self, length):\\n\\n v = pow(self.base, length, self.mod)\\n\\n h = self.h; mod = self.mod\\n\\n def fixed_calc(l):\\n\\n return (h[length+l] - h[l] * v) % mod\\n\\n return fixed_calc\\n\\nT = eval(input()); P = eval(input())\\n\\nMOD = 10**18+9\\n\\nHT = RH(T, 11, MOD)\\n\\nHP = RH(P, 11, MOD)\\n\\n\\n\\npv = HP.calc(0, len(P))\\n\\ncalc = HT.fixed(len(P))\\n\\nfor i in range(len(T)-len(P)+1):\\n\\n if calc(i) == pv:\\n\\n print(i)',\n", + " 'code_v0_loc': 61,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 1792,\n", + " 'code_v1_num_chars': 877,\n", + " 'code_v0_no_empty_lines': 'import random, math\\n\\nrandom.seed()\\n\\n\\ndef gen(a, b, num):\\n result = set()\\n while 1:\\n while 1:\\n v = random.randint(a, b) // 2 * 2 + 1\\n if v not in result:\\n break\\n for x in range(3, int(math.sqrt(v)) + 1, 2):\\n if v % x == 0:\\n break\\n else:\\n result.add(v)\\n if len(result) == num:\\n break\\n return result\\n\\n\\nclass RH:\\n def __init__(self, s, base, mod):\\n self.base = base\\n self.mod = mod\\n self.rev = pow(base, mod - 2, mod)\\n l = len(s)\\n self.h = h = [0] * (l + 1)\\n tmp = 0\\n for i in range(l):\\n num = ord(s[i])\\n tmp = (tmp * base + num) % mod\\n h[i + 1] = tmp\\n\\n def calc(self, l, r):\\n return (self.h[r] - self.h[l] * pow(self.base, r - l, self.mod)) % self.mod\\n\\n def fixed(self, length):\\n v = pow(self.base, length, self.mod)\\n h = self.h\\n mod = self.mod\\n\\n def fixed_calc(l):\\n return (h[length + l] - h[l] * v) % mod\\n\\n return fixed_calc\\n\\n\\nclass RRH:\\n def __init__(self, s, num=10, primes=None):\\n primes = primes or gen(2, 10**3, num)\\n MOD = 10**9 + 7\\n self.rhs = [RH(s, p, MOD) for p in primes]\\n\\n def calc(self, l, r):\\n return [rh.calc(l, r) for rh in self.rhs]\\n\\n def fixed(self, length):\\n fs = [rh.fixed(length) for rh in self.rhs]\\n\\n def multi_fixed_calc(l):\\n return list(f(l) for f in fs)\\n\\n return multi_fixed_calc\\n\\n\\nT = eval(input())\\nP = eval(input())\\nprimes = gen(2, 10**3, 2)\\nHT = RRH(T, primes=primes)\\nHP = RRH(P, primes=primes)\\npv = HP.calc(0, len(P))\\ncalc = HT.fixed(len(P))\\nfor i in range(len(T) - len(P) + 1):\\n if calc(i) == pv:\\n print(i)\\n',\n", + " 'code_v1_no_empty_lines': 'class RH:\\n def __init__(self, s, base, mod):\\n self.base = base\\n self.mod = mod\\n self.rev = pow(base, mod - 2, mod)\\n l = len(s)\\n self.h = h = [0] * (l + 1)\\n tmp = 0\\n for i in range(l):\\n num = ord(s[i])\\n tmp = (tmp * base + num) % mod\\n h[i + 1] = tmp\\n\\n def calc(self, l, r):\\n return (self.h[r] - self.h[l] * pow(self.base, r - l, self.mod)) % self.mod\\n\\n def fixed(self, length):\\n v = pow(self.base, length, self.mod)\\n h = self.h\\n mod = self.mod\\n\\n def fixed_calc(l):\\n return (h[length + l] - h[l] * v) % mod\\n\\n return fixed_calc\\n\\n\\nT = eval(input())\\nP = eval(input())\\nMOD = 10**18 + 9\\nHT = RH(T, 11, MOD)\\nHP = RH(P, 11, MOD)\\npv = HP.calc(0, len(P))\\ncalc = HT.fixed(len(P))\\nfor i in range(len(T) - len(P) + 1):\\n if calc(i) == pv:\\n print(i)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 49.1803278689,\n", + " 'diff': ['-import random, math',\n", + " '-',\n", + " '-random.seed()',\n", + " '-',\n", + " '-',\n", + " '-def gen(a, b, num):',\n", + " '- result = set()',\n", + " '- while 1:',\n", + " '- while 1:',\n", + " '- v = random.randint(a, b) // 2 * 2 + 1',\n", + " '- if v not in result:',\n", + " '- break',\n", + " '- for x in range(3, int(math.sqrt(v)) + 1, 2):',\n", + " '- if v % x == 0:',\n", + " '- break',\n", + " '- else:',\n", + " '- result.add(v)',\n", + " '- if len(result) == num:',\n", + " '- break',\n", + " '- return result',\n", + " '-',\n", + " '-',\n", + " '-class RRH:',\n", + " '- def __init__(self, s, num=10, primes=None):',\n", + " '- primes = primes or gen(2, 10**3, num)',\n", + " '- MOD = 10**9 + 7',\n", + " '- self.rhs = [RH(s, p, MOD) for p in primes]',\n", + " '-',\n", + " '- def calc(self, l, r):',\n", + " '- return [rh.calc(l, r) for rh in self.rhs]',\n", + " '-',\n", + " '- def fixed(self, length):',\n", + " '- fs = [rh.fixed(length) for rh in self.rhs]',\n", + " '-',\n", + " '- def multi_fixed_calc(l):',\n", + " '- return list(f(l) for f in fs)',\n", + " '-',\n", + " '- return multi_fixed_calc',\n", + " '-',\n", + " '-',\n", + " '-primes = gen(2, 10**3, 2)',\n", + " '-HT = RRH(T, primes=primes)',\n", + " '-HP = RRH(P, primes=primes)',\n", + " '+MOD = 10**18 + 9',\n", + " '+HT = RH(T, 11, MOD)',\n", + " '+HP = RH(P, 11, MOD)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3681170704,\n", + " 'measured_runtime_v1': 0.2052954846,\n", + " 'runtime_lift': 1.7931084603,\n", + " 'key': ['s637132288', 's753981495']},\n", + " {'user_id': 'u157020659',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's547554870',\n", + " 'submission_id_v1': 's193607306',\n", + " 'cpu_time_v0': 585,\n", + " 'cpu_time_v1': 283,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 18356,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 51.62,\n", + " 'input': 'def check(x, y):\\n\\n for a, b in zip(x, y):\\n\\n if a != b and b != -1:\\n\\n return False\\n\\n else:\\n\\n return True\\n\\n\\n\\n\\n\\nn = int(eval(input()))\\n\\nremarks = []\\n\\ncnt_max = 0\\n\\nfor _ in range(n):\\n\\n a = int(eval(input()))\\n\\n x = [tuple(map(int, input().split())) for i in range(a)]\\n\\n r = [-1] * n\\n\\n for i, j in x:\\n\\n r[i - 1] = j\\n\\n remarks.append(r)\\n\\nfor r in range(2 ** n):\\n\\n r = list(bin(r)[2:].zfill(n))\\n\\n r = [int(i) for i in r[:]]\\n\\n cnt = 0\\n\\n for i in range(n):\\n\\n if r[i] == 1:\\n\\n flag = check(r, remarks[i])\\n\\n cnt += 1\\n\\n if not flag:\\n\\n cnt = 0\\n\\n break\\n\\n cnt_max = max(cnt, cnt_max)\\n\\nprint(cnt_max)',\n", + " 'target': 'import numpy as np\\n\\nimport itertools\\n\\n\\n\\nn = int(eval(input()))\\n\\ninfo = []\\n\\nfor i in range(n):\\n\\n a = int(eval(input()))\\n\\n for _ in range(a):\\n\\n x, y = list(map(int, input().split()))\\n\\n info.append((i, x - 1, y))\\n\\n\\n\\na = np.array(list(itertools.product([0, 1], repeat=n)), dtype=np.bool)\\n\\nfor i, x, y in info:\\n\\n bl = (~a[:, i]) | (a[:, x] == bool(y))\\n\\n a = a[bl]\\n\\n\\n\\nans = a.sum(axis=1).max()\\n\\nprint(ans)',\n", + " 'code_v0_loc': 31,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 708,\n", + " 'code_v1_num_chars': 407,\n", + " 'code_v0_no_empty_lines': 'def check(x, y):\\n for a, b in zip(x, y):\\n if a != b and b != -1:\\n return False\\n else:\\n return True\\n\\n\\nn = int(eval(input()))\\nremarks = []\\ncnt_max = 0\\nfor _ in range(n):\\n a = int(eval(input()))\\n x = [tuple(map(int, input().split())) for i in range(a)]\\n r = [-1] * n\\n for i, j in x:\\n r[i - 1] = j\\n remarks.append(r)\\nfor r in range(2**n):\\n r = list(bin(r)[2:].zfill(n))\\n r = [int(i) for i in r[:]]\\n cnt = 0\\n for i in range(n):\\n if r[i] == 1:\\n flag = check(r, remarks[i])\\n cnt += 1\\n if not flag:\\n cnt = 0\\n break\\n cnt_max = max(cnt, cnt_max)\\nprint(cnt_max)\\n',\n", + " 'code_v1_no_empty_lines': 'import numpy as np\\nimport itertools\\n\\nn = int(eval(input()))\\ninfo = []\\nfor i in range(n):\\n a = int(eval(input()))\\n for _ in range(a):\\n x, y = list(map(int, input().split()))\\n info.append((i, x - 1, y))\\na = np.array(list(itertools.product([0, 1], repeat=n)), dtype=np.bool)\\nfor i, x, y in info:\\n bl = (~a[:, i]) | (a[:, x] == bool(y))\\n a = a[bl]\\nans = a.sum(axis=1).max()\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.935483871,\n", + " 'diff': ['-def check(x, y):',\n", + " '- for a, b in zip(x, y):',\n", + " '- if a != b and b != -1:',\n", + " '- return False',\n", + " '- else:',\n", + " '- return True',\n", + " '-',\n", + " '+import numpy as np',\n", + " '+import itertools',\n", + " '-remarks = []',\n", + " '-cnt_max = 0',\n", + " '-for _ in range(n):',\n", + " '+info = []',\n", + " '+for i in range(n):',\n", + " '- x = [tuple(map(int, input().split())) for i in range(a)]',\n", + " '- r = [-1] * n',\n", + " '- for i, j in x:',\n", + " '- r[i - 1] = j',\n", + " '- remarks.append(r)',\n", + " '-for r in range(2**n):',\n", + " '- r = list(bin(r)[2:].zfill(n))',\n", + " '- r = [int(i) for i in r[:]]',\n", + " '- cnt = 0',\n", + " '- for i in range(n):',\n", + " '- if r[i] == 1:',\n", + " '- flag = check(r, remarks[i])',\n", + " '- cnt += 1',\n", + " '- if not flag:',\n", + " '- cnt = 0',\n", + " '- break',\n", + " '- cnt_max = max(cnt, cnt_max)',\n", + " '-print(cnt_max)',\n", + " '+ for _ in range(a):',\n", + " '+ x, y = list(map(int, input().split()))',\n", + " '+ info.append((i, x - 1, y))',\n", + " '+a = np.array(list(itertools.product([0, 1], repeat=n)), dtype=np.bool)',\n", + " '+for i, x, y in info:',\n", + " '+ bl = (~a[:, i]) | (a[:, x] == bool(y))',\n", + " '+ a = a[bl]',\n", + " '+ans = a.sum(axis=1).max()',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1805458875,\n", + " 'measured_runtime_v1': 0.0064015586,\n", + " 'runtime_lift': 28.2034262917,\n", + " 'key': ['s547554870', 's193607306']},\n", + " {'user_id': 'u729939940',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's286517602',\n", + " 'submission_id_v1': 's316820501',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': \"N = int(eval(input()))\\n\\nX = list(map(int, input().split()))\\n\\nX = list(sorted(X))\\n\\nif N == 1:\\n\\n print((0))\\n\\n exit()\\n\\nans = float('inf')\\n\\nfor p in range(X[0], X[N - 1] + 1):\\n\\n sum = 0\\n\\n for x in X:\\n\\n sum += (x - p) ** 2\\n\\n ans = min(sum, ans)\\n\\nprint(ans)\",\n", + " 'target': 'N = int(eval(input()))\\n\\nX = list(map(int, input().split()))\\n\\navg = round(sum(X) / N)\\n\\nprint((sum([(x - avg) ** 2 for x in X])))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 251,\n", + " 'code_v1_num_chars': 119,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nX = list(map(int, input().split()))\\nX = list(sorted(X))\\nif N == 1:\\n print((0))\\n exit()\\nans = float(\"inf\")\\nfor p in range(X[0], X[N - 1] + 1):\\n sum = 0\\n for x in X:\\n sum += (x - p) ** 2\\n ans = min(sum, ans)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nX = list(map(int, input().split()))\\navg = round(sum(X) / N)\\nprint((sum([(x - avg) ** 2 for x in X])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 69.2307692308,\n", + " 'diff': ['-X = list(sorted(X))',\n", + " '-if N == 1:',\n", + " '- print((0))',\n", + " '- exit()',\n", + " '-ans = float(\"inf\")',\n", + " '-for p in range(X[0], X[N - 1] + 1):',\n", + " '- sum = 0',\n", + " '- for x in X:',\n", + " '- sum += (x - p) ** 2',\n", + " '- ans = min(sum, ans)',\n", + " '-print(ans)',\n", + " '+avg = round(sum(X) / N)',\n", + " '+print((sum([(x - avg) ** 2 for x in X])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2590025333,\n", + " 'measured_runtime_v1': 0.1089487125,\n", + " 'runtime_lift': 2.3772886094,\n", + " 'key': ['s286517602', 's316820501']},\n", + " {'user_id': 'u880730787',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's669686668',\n", + " 'submission_id_v1': 's427616795',\n", + " 'cpu_time_v0': 487,\n", + " 'cpu_time_v1': 297,\n", + " 'memory_v0': 9116,\n", + " 'memory_v1': 9128,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.01,\n", + " 'input': 'S = int(eval(input()))\\n\\nmod = 10**9+7\\n\\n\\n\\ndp = [0]*(S+1)\\n\\ndp[0] = 1\\n\\nfor i in range(1,S+1):\\n\\n for j in range(0,(i-3)+1):\\n\\n dp[i] += dp[j]\\n\\n dp[i] %= mod\\n\\nprint((dp[S]))',\n", + " 'target': 'S = int(eval(input()))\\n\\nmod = 10**9+7\\n\\n\\n\\ndp = [0]*(S+1)\\n\\ndp[0] = 1\\n\\nfor i in range(1,S+1):\\n\\n for j in range(0,(i-3)+1):\\n\\n dp[i] += dp[j]\\n\\n dp[i] %= mod\\n\\nprint((dp[S]))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 176,\n", + " 'code_v1_num_chars': 172,\n", + " 'code_v0_no_empty_lines': 'S = int(eval(input()))\\nmod = 10**9 + 7\\ndp = [0] * (S + 1)\\ndp[0] = 1\\nfor i in range(1, S + 1):\\n for j in range(0, (i - 3) + 1):\\n dp[i] += dp[j]\\n dp[i] %= mod\\nprint((dp[S]))\\n',\n", + " 'code_v1_no_empty_lines': 'S = int(eval(input()))\\nmod = 10**9 + 7\\ndp = [0] * (S + 1)\\ndp[0] = 1\\nfor i in range(1, S + 1):\\n for j in range(0, (i - 3) + 1):\\n dp[i] += dp[j]\\n dp[i] %= mod\\nprint((dp[S]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- dp[i] %= mod', '+ dp[i] %= mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6781705019,\n", + " 'measured_runtime_v1': 0.481741133,\n", + " 'runtime_lift': 1.4077488002,\n", + " 'key': ['s669686668', 's427616795']},\n", + " {'user_id': 'u761320129',\n", + " 'problem_id': 'p03806',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's128261336',\n", + " 'submission_id_v1': 's895482909',\n", + " 'cpu_time_v0': 493,\n", + " 'cpu_time_v1': 263,\n", + " 'memory_v0': 4852,\n", + " 'memory_v1': 4852,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 46.65,\n", + " 'input': 'N,MA,MB = list(map(int,input().split()))\\n\\nsrc = [tuple(map(int,input().split())) for i in range(N)]\\n\\n\\n\\nINF = 10**9\\n\\ndp = [[INF for j in range(401)] for i in range(401)]\\n\\ndp[0][0] = 0\\n\\nmaxa = maxb = 0\\n\\nfor a,b,c in src:\\n\\n for ai in range(maxa,-1,-1):\\n\\n for bi in range(maxb,-1,-1):\\n\\n dp[ai+a][bi+b] = min(dp[ai+a][bi+b], dp[ai][bi] + c)\\n\\n maxa += a\\n\\n maxb += b\\n\\n\\n\\nans = INF\\n\\nfor i in range(1,401):\\n\\n if MA*i > 400 or MB*i > 400: break\\n\\n ans = min(ans, dp[MA*i][MB*i])\\n\\nprint((-1 if ans == INF else ans))',\n", + " 'target': 'N,MA,MB = list(map(int,input().split()))\\n\\nsrc = [tuple(map(int,input().split())) for i in range(N)]\\n\\n\\n\\nINF = 10**9\\n\\nMAX = 401\\n\\ndp = [[INF] * MAX for i in range(MAX)]\\n\\ndp[0][0] = 0\\n\\namax = bmax = 0\\n\\nfor a,b,n in src:\\n\\n for i in reversed(list(range(bmax+1))):\\n\\n for j in range(amax+1):\\n\\n if dp[i][j] == INF: continue\\n\\n dp[i+b][j+a] = min(dp[i+b][j+a], dp[i][j] + n)\\n\\n amax += a\\n\\n bmax += b\\n\\n\\n\\nans = INF\\n\\nfor i in range(1,MAX):\\n\\n if i*MA >= MAX or i*MB >= MAX: break\\n\\n ans = min(ans, dp[i*MB][i*MA])\\n\\nprint((-1 if ans == INF else ans))',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 527,\n", + " 'code_v1_num_chars': 562,\n", + " 'code_v0_no_empty_lines': 'N, MA, MB = list(map(int, input().split()))\\nsrc = [tuple(map(int, input().split())) for i in range(N)]\\nINF = 10**9\\ndp = [[INF for j in range(401)] for i in range(401)]\\ndp[0][0] = 0\\nmaxa = maxb = 0\\nfor a, b, c in src:\\n for ai in range(maxa, -1, -1):\\n for bi in range(maxb, -1, -1):\\n dp[ai + a][bi + b] = min(dp[ai + a][bi + b], dp[ai][bi] + c)\\n maxa += a\\n maxb += b\\nans = INF\\nfor i in range(1, 401):\\n if MA * i > 400 or MB * i > 400:\\n break\\n ans = min(ans, dp[MA * i][MB * i])\\nprint((-1 if ans == INF else ans))\\n',\n", + " 'code_v1_no_empty_lines': 'N, MA, MB = list(map(int, input().split()))\\nsrc = [tuple(map(int, input().split())) for i in range(N)]\\nINF = 10**9\\nMAX = 401\\ndp = [[INF] * MAX for i in range(MAX)]\\ndp[0][0] = 0\\namax = bmax = 0\\nfor a, b, n in src:\\n for i in reversed(list(range(bmax + 1))):\\n for j in range(amax + 1):\\n if dp[i][j] == INF:\\n continue\\n dp[i + b][j + a] = min(dp[i + b][j + a], dp[i][j] + n)\\n amax += a\\n bmax += b\\nans = INF\\nfor i in range(1, MAX):\\n if i * MA >= MAX or i * MB >= MAX:\\n break\\n ans = min(ans, dp[i * MB][i * MA])\\nprint((-1 if ans == INF else ans))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.5238095238,\n", + " 'diff': ['-dp = [[INF for j in range(401)] for i in range(401)]',\n", + " '+MAX = 401',\n", + " '+dp = [[INF] * MAX for i in range(MAX)]',\n", + " '-maxa = maxb = 0',\n", + " '-for a, b, c in src:',\n", + " '- for ai in range(maxa, -1, -1):',\n", + " '- for bi in range(maxb, -1, -1):',\n", + " '- dp[ai + a][bi + b] = min(dp[ai + a][bi + b], dp[ai][bi] + c)',\n", + " '- maxa += a',\n", + " '- maxb += b',\n", + " '+amax = bmax = 0',\n", + " '+for a, b, n in src:',\n", + " '+ for i in reversed(list(range(bmax + 1))):',\n", + " '+ for j in range(amax + 1):',\n", + " '+ if dp[i][j] == INF:',\n", + " '+ continue',\n", + " '+ dp[i + b][j + a] = min(dp[i + b][j + a], dp[i][j] + n)',\n", + " '+ amax += a',\n", + " '+ bmax += b',\n", + " '-for i in range(1, 401):',\n", + " '- if MA * i > 400 or MB * i > 400:',\n", + " '+for i in range(1, MAX):',\n", + " '+ if i * MA >= MAX or i * MB >= MAX:',\n", + " '- ans = min(ans, dp[MA * i][MB * i])',\n", + " '+ ans = min(ans, dp[i * MB][i * MA])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4613628248,\n", + " 'measured_runtime_v1': 0.3376750898,\n", + " 'runtime_lift': 1.3662921511,\n", + " 'key': ['s128261336', 's895482909']},\n", + " {'user_id': 'u315485238',\n", + " 'problem_id': 'p03945',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's413240170',\n", + " 'submission_id_v1': 's770974666',\n", + " 'cpu_time_v0': 334,\n", + " 'cpu_time_v1': 28,\n", + " 'memory_v0': 22828,\n", + " 'memory_v1': 3956,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.62,\n", + " 'input': \"import numpy as np\\n\\n\\n\\nS=eval(input())\\n\\nS=np.array([1 if s=='B' else 0 for s in S])\\n\\n\\n\\nprint((np.abs(np.diff(S)).sum()))\\n\",\n", + " 'target': 'from itertools import groupby\\n\\n\\n\\nS=eval(input())\\n\\nanswer = sum([1 for _ in groupby(S)]) -1\\n\\n\\n\\nprint(answer)',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 112,\n", + " 'code_v1_num_chars': 101,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nS = eval(input())\\nS = np.array([1 if s == \"B\" else 0 for s in S])\\nprint((np.abs(np.diff(S)).sum()))\\n',\n", + " 'code_v1_no_empty_lines': 'from itertools import groupby\\n\\nS = eval(input())\\nanswer = sum([1 for _ in groupby(S)]) - 1\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import numpy as np',\n", + " '+from itertools import groupby',\n", + " '-S = np.array([1 if s == \"B\" else 0 for s in S])',\n", + " '-print((np.abs(np.diff(S)).sum()))',\n", + " '+answer = sum([1 for _ in groupby(S)]) - 1',\n", + " '+print(answer)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3748412957,\n", + " 'measured_runtime_v1': 0.214818702,\n", + " 'runtime_lift': 6.400007462,\n", + " 'key': ['s413240170', 's770974666']},\n", + " {'user_id': 'u033272694',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's079823927',\n", + " 'submission_id_v1': 's432379861',\n", + " 'cpu_time_v0': 247,\n", + " 'cpu_time_v1': 215,\n", + " 'memory_v0': 34212,\n", + " 'memory_v1': 34216,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.96,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nlist_ai = list(map(int,input().split()))\\n\\nlist1 = [x-(i+1) for i,x in enumerate(list_ai)]\\n\\na1 = np.array(list1)\\n\\nmedian1 = int(np.floor(np.median(a1)))\\n\\nans = np.sum(np.abs(a1-median1))\\n\\nprint(ans)',\n", + " 'target': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nlist_ai = list(map(int,input().split()))\\n\\na1 = np.array(list_ai)-np.arange(1,N+1)\\n\\nmedian1 = int(np.floor(np.median(a1)))\\n\\nans = np.sum(np.abs(a1-median1))\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 235,\n", + " 'code_v1_num_chars': 206,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nlist_ai = list(map(int, input().split()))\\nlist1 = [x - (i + 1) for i, x in enumerate(list_ai)]\\na1 = np.array(list1)\\nmedian1 = int(np.floor(np.median(a1)))\\nans = np.sum(np.abs(a1 - median1))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nlist_ai = list(map(int, input().split()))\\na1 = np.array(list_ai) - np.arange(1, N + 1)\\nmedian1 = int(np.floor(np.median(a1)))\\nans = np.sum(np.abs(a1 - median1))\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-list1 = [x - (i + 1) for i, x in enumerate(list_ai)]',\n", + " '-a1 = np.array(list1)',\n", + " '+a1 = np.array(list_ai) - np.arange(1, N + 1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.879177295,\n", + " 'measured_runtime_v1': 0.625532125,\n", + " 'runtime_lift': 3.0041259591,\n", + " 'key': ['s079823927', 's432379861']},\n", + " {'user_id': 'u486297080',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's015826115',\n", + " 'submission_id_v1': 's256698183',\n", + " 'cpu_time_v0': 231,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 4020,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.98,\n", + " 'input': 'import math\\n\\n\\n\\nN = int(eval(input()))\\n\\nans = 0\\n\\n\\n\\nans =math.factorial(N) % (10**9 +7)\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\npower = 1\\n\\n\\n\\nfor i in range(N):\\n\\n power = ((i+1) * power) % 1000000007\\n\\n\\n\\nprint(power)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 93,\n", + " 'code_v1_num_chars': 107,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nans = 0\\nans = math.factorial(N) % (10**9 + 7)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\npower = 1\\nfor i in range(N):\\n power = ((i + 1) * power) % 1000000007\\nprint(power)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-ans = 0',\n", + " '-ans = math.factorial(N) % (10**9 + 7)',\n", + " '-print(ans)',\n", + " '+power = 1',\n", + " '+for i in range(N):',\n", + " '+ power = ((i + 1) * power) % 1000000007',\n", + " '+print(power)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5450858786,\n", + " 'measured_runtime_v1': 0.2547745125,\n", + " 'runtime_lift': 2.1394835503,\n", + " 'key': ['s015826115', 's256698183']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p03086',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's827296868',\n", + " 'submission_id_v1': 's358574733',\n", + " 'cpu_time_v0': 604,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 102680,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 97.02,\n", + " 'input': '# 2019-11-12 22:21:08(JST)\\n\\nimport sys\\n\\n# import collections\\n\\n# import math\\n\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\n\\nimport itertools\\n\\n# from functools import reduce\\n\\n# import operator as op\\n\\n# from scipy.misc import comb # float\\n\\n# import numpy as np \\n\\n\\n\\ndef main():\\n\\n s = sys.stdin.readline().rstrip()\\n\\n \\n\\n all_words = []\\n\\n for i in range(1, len(s) + 1):\\n\\n for letters in itertools.product(\\'ATCG\\', repeat=i):\\n\\n word = \\'\\'.join(letters)\\n\\n all_words.append(word)\\n\\n \\n\\n for i in range(len(all_words)-1, 0-1, -1):\\n\\n if all_words[i] in s:\\n\\n print((len(all_words[i])))\\n\\n sys.exit()\\n\\n print((0))\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': '# 2019-11-12 22:21:08(JST)\\n\\nimport sys\\n\\n# import collections\\n\\n# import math\\n\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\n\\n# import itertools\\n\\n# from functools import reduce\\n\\n# import operator as op\\n\\n# from scipy.misc import comb # float\\n\\n# import numpy as np \\n\\n\\n\\ndef main():\\n\\n s = sys.stdin.readline().rstrip()\\n\\n \\n\\n permitted = \\'ACGT\\'\\n\\n continuous_count = []\\n\\n count = 0\\n\\n\\n\\n for i in range(len(s)):\\n\\n char = s[i]\\n\\n if char in permitted:\\n\\n count += 1\\n\\n else:\\n\\n continuous_count.append(count)\\n\\n count = 0\\n\\n if i == len(s) - 1:\\n\\n continuous_count.append(count)\\n\\n \\n\\n if not continuous_count:\\n\\n print((len(s)))\\n\\n else:\\n\\n print((max(continuous_count)))\\n\\n\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 38,\n", + " 'code_v0_num_chars': 799,\n", + " 'code_v1_num_chars': 884,\n", + " 'code_v0_no_empty_lines': '# 2019-11-12 22:21:08(JST)\\nimport sys\\n\\n# import collections\\n# import math\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\nimport itertools\\n\\n# from functools import reduce\\n# import operator as op\\n# from scipy.misc import comb # float\\n# import numpy as np\\ndef main():\\n s = sys.stdin.readline().rstrip()\\n all_words = []\\n for i in range(1, len(s) + 1):\\n for letters in itertools.product(\"ATCG\", repeat=i):\\n word = \"\".join(letters)\\n all_words.append(word)\\n for i in range(len(all_words) - 1, 0 - 1, -1):\\n if all_words[i] in s:\\n print((len(all_words[i])))\\n sys.exit()\\n print((0))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# 2019-11-12 22:21:08(JST)\\nimport sys\\n\\n# import collections\\n# import math\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\n# import itertools\\n# from functools import reduce\\n# import operator as op\\n# from scipy.misc import comb # float\\n# import numpy as np\\ndef main():\\n s = sys.stdin.readline().rstrip()\\n permitted = \"ACGT\"\\n continuous_count = []\\n count = 0\\n for i in range(len(s)):\\n char = s[i]\\n if char in permitted:\\n count += 1\\n else:\\n continuous_count.append(count)\\n count = 0\\n if i == len(s) - 1:\\n continuous_count.append(count)\\n if not continuous_count:\\n print((len(s)))\\n else:\\n print((max(continuous_count)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.7894736842,\n", + " 'diff': ['-import itertools',\n", + " '-',\n", + " '+# import itertools',\n", + " '- all_words = []',\n", + " '- for i in range(1, len(s) + 1):',\n", + " '- for letters in itertools.product(\"ATCG\", repeat=i):',\n", + " '- word = \"\".join(letters)',\n", + " '- all_words.append(word)',\n", + " '- for i in range(len(all_words) - 1, 0 - 1, -1):',\n", + " '- if all_words[i] in s:',\n", + " '- print((len(all_words[i])))',\n", + " '- sys.exit()',\n", + " '- print((0))',\n", + " '+ permitted = \"ACGT\"',\n", + " '+ continuous_count = []',\n", + " '+ count = 0',\n", + " '+ for i in range(len(s)):',\n", + " '+ char = s[i]',\n", + " '+ if char in permitted:',\n", + " '+ count += 1',\n", + " '+ else:',\n", + " '+ continuous_count.append(count)',\n", + " '+ count = 0',\n", + " '+ if i == len(s) - 1:',\n", + " '+ continuous_count.append(count)',\n", + " '+ if not continuous_count:',\n", + " '+ print((len(s)))',\n", + " '+ else:',\n", + " '+ print((max(continuous_count)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4624249086,\n", + " 'measured_runtime_v1': 0.2736470122,\n", + " 'runtime_lift': 1.6898591541,\n", + " 'key': ['s827296868', 's358574733']},\n", + " {'user_id': 'u977193988',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's390092370',\n", + " 'submission_id_v1': 's517686236',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 12508,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.0,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nX = np.array(list(map(int, input().split())))\\n\\ncost = float(\"inf\")\\n\\nfor i in range(max(X) - min(X) + 1):\\n\\n p = min(X) + i\\n\\n cost = min(np.sum((X - p) ** 2), cost)\\n\\nprint(cost)',\n", + " 'target': 'N = int(eval(input()))\\n\\nX = sorted(list(map(int, input().split())))\\n\\nif N == 1:\\n\\n print((0))\\n\\nelse:\\n\\n r = X[-1] - X[0]\\n\\n ans = float(\"inf\")\\n\\n for i in range(r + 1):\\n\\n R = X[0] + i\\n\\n hp = 0\\n\\n for j in range(N):\\n\\n hp = hp + (R - X[j]) ** 2\\n\\n\\n\\n ans = min(hp, ans)\\n\\n\\n\\n print(ans)\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 221,\n", + " 'code_v1_num_chars': 322,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nX = np.array(list(map(int, input().split())))\\ncost = float(\"inf\")\\nfor i in range(max(X) - min(X) + 1):\\n p = min(X) + i\\n cost = min(np.sum((X - p) ** 2), cost)\\nprint(cost)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nX = sorted(list(map(int, input().split())))\\nif N == 1:\\n print((0))\\nelse:\\n r = X[-1] - X[0]\\n ans = float(\"inf\")\\n for i in range(r + 1):\\n R = X[0] + i\\n hp = 0\\n for j in range(N):\\n hp = hp + (R - X[j]) ** 2\\n ans = min(hp, ans)\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 43.75,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-X = np.array(list(map(int, input().split())))',\n", + " '-cost = float(\"inf\")',\n", + " '-for i in range(max(X) - min(X) + 1):',\n", + " '- p = min(X) + i',\n", + " '- cost = min(np.sum((X - p) ** 2), cost)',\n", + " '-print(cost)',\n", + " '+X = sorted(list(map(int, input().split())))',\n", + " '+if N == 1:',\n", + " '+ print((0))',\n", + " '+else:',\n", + " '+ r = X[-1] - X[0]',\n", + " '+ ans = float(\"inf\")',\n", + " '+ for i in range(r + 1):',\n", + " '+ R = X[0] + i',\n", + " '+ hp = 0',\n", + " '+ for j in range(N):',\n", + " '+ hp = hp + (R - X[j]) ** 2',\n", + " '+ ans = min(hp, ans)',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.2545192011,\n", + " 'measured_runtime_v1': 0.3218237295,\n", + " 'runtime_lift': 7.0054473747,\n", + " 'key': ['s390092370', 's517686236']},\n", + " {'user_id': 'u645250356',\n", + " 'problem_id': 'p03559',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's643210131',\n", + " 'submission_id_v1': 's973528764',\n", + " 'cpu_time_v0': 585,\n", + " 'cpu_time_v1': 431,\n", + " 'memory_v0': 124300,\n", + " 'memory_v1': 30272,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.32,\n", + " 'input': \"from collections import Counter,defaultdict,deque\\n\\nfrom heapq import heappop,heappush,heapify\\n\\nimport sys,bisect,math,itertools,fractions,pprint\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\nINF = float('inf')\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\nn = inp()\\n\\nA = sorted(inpl())\\n\\nB = sorted(inpl())\\n\\nC = sorted(inpl())\\n\\ncnt = [0] * n\\n\\nres = 0\\n\\nfor i,b in enumerate(B):\\n\\n c = bisect.bisect_left(C,b+1)\\n\\n cnt[i] = n-c\\n\\n\\n\\nacc = [0]\\n\\nfor x in cnt:\\n\\n acc += [acc[-1] + x]\\n\\nsu = sum(cnt) \\n\\nfor i,a in enumerate(A):\\n\\n c = bisect.bisect_left(B,a+1)\\n\\n res += su - acc[c]\\n\\nprint(res)\",\n", + " 'target': \"from collections import Counter,defaultdict,deque\\n\\nfrom heapq import heappop,heappush,heapify\\n\\nimport sys,bisect,math,itertools,fractions,pprint\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\nINF = float('inf')\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\nn = inp()\\n\\na = inpl()\\n\\nb = inpl()\\n\\nc = inpl()\\n\\na.sort()\\n\\nb.sort()\\n\\nc.sort()\\n\\nlb = [0] * n\\n\\nres = 0\\n\\nfor i in range(n):\\n\\n tmp = bisect.bisect_right(b,a[i])\\n\\n if tmp == n: continue\\n\\n lb[tmp] += 1\\n\\nllb = list(itertools.accumulate(lb))\\n\\n# print(lb,llb)\\n\\nrr = [0] * n\\n\\nfor i in range(n):\\n\\n tmp = bisect.bisect_right(c,b[i])\\n\\n if tmp == n: continue\\n\\n rr[tmp] += llb[i]\\n\\nprint((sum(list(itertools.accumulate(rr)))))\",\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 662,\n", + " 'code_v1_num_chars': 747,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nfrom heapq import heappop, heappush, heapify\\nimport sys, bisect, math, itertools, fractions, pprint\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\nINF = float(\"inf\")\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\nn = inp()\\nA = sorted(inpl())\\nB = sorted(inpl())\\nC = sorted(inpl())\\ncnt = [0] * n\\nres = 0\\nfor i, b in enumerate(B):\\n c = bisect.bisect_left(C, b + 1)\\n cnt[i] = n - c\\nacc = [0]\\nfor x in cnt:\\n acc += [acc[-1] + x]\\nsu = sum(cnt)\\nfor i, a in enumerate(A):\\n c = bisect.bisect_left(B, a + 1)\\n res += su - acc[c]\\nprint(res)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nfrom heapq import heappop, heappush, heapify\\nimport sys, bisect, math, itertools, fractions, pprint\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\nINF = float(\"inf\")\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\nn = inp()\\na = inpl()\\nb = inpl()\\nc = inpl()\\na.sort()\\nb.sort()\\nc.sort()\\nlb = [0] * n\\nres = 0\\nfor i in range(n):\\n tmp = bisect.bisect_right(b, a[i])\\n if tmp == n:\\n continue\\n lb[tmp] += 1\\nllb = list(itertools.accumulate(lb))\\n# print(lb,llb)\\nrr = [0] * n\\nfor i in range(n):\\n tmp = bisect.bisect_right(c, b[i])\\n if tmp == n:\\n continue\\n rr[tmp] += llb[i]\\nprint((sum(list(itertools.accumulate(rr)))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-A = sorted(inpl())',\n", + " '-B = sorted(inpl())',\n", + " '-C = sorted(inpl())',\n", + " '-cnt = [0] * n',\n", + " '+a = inpl()',\n", + " '+b = inpl()',\n", + " '+c = inpl()',\n", + " '+a.sort()',\n", + " '+b.sort()',\n", + " '+c.sort()',\n", + " '+lb = [0] * n',\n", + " '-for i, b in enumerate(B):',\n", + " '- c = bisect.bisect_left(C, b + 1)',\n", + " '- cnt[i] = n - c',\n", + " '-acc = [0]',\n", + " '-for x in cnt:',\n", + " '- acc += [acc[-1] + x]',\n", + " '-su = sum(cnt)',\n", + " '-for i, a in enumerate(A):',\n", + " '- c = bisect.bisect_left(B, a + 1)',\n", + " '- res += su - acc[c]',\n", + " '-print(res)',\n", + " '+for i in range(n):',\n", + " '+ tmp = bisect.bisect_right(b, a[i])',\n", + " '+ if tmp == n:',\n", + " '+ continue',\n", + " '+ lb[tmp] += 1',\n", + " '+llb = list(itertools.accumulate(lb))',\n", + " '+# print(lb,llb)',\n", + " '+rr = [0] * n',\n", + " '+for i in range(n):',\n", + " '+ tmp = bisect.bisect_right(c, b[i])',\n", + " '+ if tmp == n:',\n", + " '+ continue',\n", + " '+ rr[tmp] += llb[i]',\n", + " '+print((sum(list(itertools.accumulate(rr)))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2585086877,\n", + " 'measured_runtime_v1': 0.0062210422,\n", + " 'runtime_lift': 41.5539198783,\n", + " 'key': ['s643210131', 's973528764']},\n", + " {'user_id': 'u476068053',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's269976358',\n", + " 'submission_id_v1': 's000228897',\n", + " 'cpu_time_v0': 91,\n", + " 'cpu_time_v1': 66,\n", + " 'memory_v0': 64552,\n", + " 'memory_v1': 62952,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.47,\n", + " 'input': 'def main():\\n\\n s = int(eval(input()))\\n\\n mod = 10**9 + 7\\n\\n\\n\\n dp = [0] * (s+1)\\n\\n dp[0] = 1\\n\\n for i in range(1, s+1):\\n\\n for j in range(0, (i-3)+1):\\n\\n dp[i] += dp[j]\\n\\n dp[i] %= mod\\n\\n print((dp[-1]))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'def main():\\n\\n s = int(eval(input()))\\n\\n mod = 10**9 + 7\\n\\n\\n\\n dp = [0] * (s+1)\\n\\n dp[0] = 1\\n\\n# for i in range(1, s+1):\\n\\n# for j in range(0, (i-3)+1):\\n\\n# dp[i] += dp[j]\\n\\n# dp[i] %= mod\\n\\n for i in range(1, s+1):\\n\\n if i < 3:\\n\\n dp[i] = 0\\n\\n else:\\n\\n dp[i] = dp[i-1] + dp[i-3]\\n\\n dp[i] %= mod\\n\\n\\n\\n print((dp[-1]))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 277,\n", + " 'code_v1_num_chars': 434,\n", + " 'code_v0_no_empty_lines': 'def main():\\n s = int(eval(input()))\\n mod = 10**9 + 7\\n dp = [0] * (s + 1)\\n dp[0] = 1\\n for i in range(1, s + 1):\\n for j in range(0, (i - 3) + 1):\\n dp[i] += dp[j]\\n dp[i] %= mod\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n s = int(eval(input()))\\n mod = 10**9 + 7\\n dp = [0] * (s + 1)\\n dp[0] = 1\\n # for i in range(1, s+1):\\n # for j in range(0, (i-3)+1):\\n # dp[i] += dp[j]\\n # dp[i] %= mod\\n for i in range(1, s + 1):\\n if i < 3:\\n dp[i] = 0\\n else:\\n dp[i] = dp[i - 1] + dp[i - 3]\\n dp[i] %= mod\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.8181818182,\n", + " 'diff': ['+ # for i in range(1, s+1):',\n", + " '+ # for j in range(0, (i-3)+1):',\n", + " '+ # dp[i] += dp[j]',\n", + " '+ # dp[i] %= mod',\n", + " '- for j in range(0, (i - 3) + 1):',\n", + " '- dp[i] += dp[j]',\n", + " '+ if i < 3:',\n", + " '+ dp[i] = 0',\n", + " '+ else:',\n", + " '+ dp[i] = dp[i - 1] + dp[i - 3]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5094247258,\n", + " 'measured_runtime_v1': 0.2087815866,\n", + " 'runtime_lift': 2.4399887649,\n", + " 'key': ['s269976358', 's000228897']},\n", + " {'user_id': 'u860002137',\n", + " 'problem_id': 'p03254',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's707896844',\n", + " 'submission_id_v1': 's627798423',\n", + " 'cpu_time_v0': 154,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 12392,\n", + " 'memory_v1': 9160,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.17,\n", + " 'input': 'import numpy as np\\n\\nN, x = list(map(int, input().split()))\\n\\na = np.array(list(map(int, input().split())))\\n\\n\\n\\ncs = np.sort(a).cumsum()\\n\\n\\n\\nif cs[-1] 1:\\n\\n i //= 2\\n\\n node[i] = self.__dot(node[2 * i], node[2 * i + 1])\\n\\n\\n\\n def get(self, l, r):\\n\\n vl, vr = self.__e, self.__e\\n\\n l += self.__n\\n\\n r += self.__n\\n\\n while (l < r):\\n\\n if l & 1:\\n\\n vl = self.__dot(vl, self.__node[l])\\n\\n l += 1\\n\\n l //= 2\\n\\n if r & 1:\\n\\n r -= 1\\n\\n vr = self.__dot(vr, self.__node[r])\\n\\n r //= 2\\n\\n return self.__dot(vl, vr)\\n\\n\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\nA = [int(eval(input())) for _ in range(N)]\\n\\nmax_A = max(A)\\n\\n\\n\\nst = SegmentTree([N] * (max_A + 1), min, N)\\n\\nedge = [set() for _ in range(N)]\\n\\nfor i, a in enumerate(reversed(A)):\\n\\n j = N - 1 - i\\n\\n p1 = st.get(a, min(max_A + 1, a + K + 1))\\n\\n if p1 < N:\\n\\n edge[j].add(p1)\\n\\n p2 = st.get(max(0, a - K), a)\\n\\n if p2 < N:\\n\\n edge[j].add(p2)\\n\\n p0 = st.get(a, a + 1)\\n\\n if p0 < N:\\n\\n edge[j].add(p0)\\n\\n st.update(a, j)\\n\\n\\n\\ndp = [1] * N\\n\\nfor i in range(N - 1):\\n\\n here = dp[i]\\n\\n for ni in edge[i]:\\n\\n if ni < N:\\n\\n dp[ni] = max(dp[ni], dp[i] + 1)\\n\\n\\n\\nprint((max(dp)))\\n',\n", + " 'target': 'class SegmentTree():\\n\\n \"\"\"\\n\\n update, get を提供するSegmentTree\\n\\n\\n\\n Attributes\\n\\n ----------\\n\\n __n : int\\n\\n 葉の数。2 ^ i - 1\\n\\n __dot :\\n\\n Segment function\\n\\n __e: int\\n\\n 単位元\\n\\n __node: list\\n\\n Segment Tree\\n\\n \"\"\"\\n\\n def __init__(self, A, dot, e):\\n\\n \"\"\"\\n\\n Parameters\\n\\n ----------\\n\\n A : list\\n\\n 対象の配列\\n\\n dot :\\n\\n Segment function\\n\\n e : int\\n\\n 単位元\\n\\n \"\"\"\\n\\n n = 2 ** (len(A) - 1).bit_length()\\n\\n self.__n = n\\n\\n self.__dot = dot\\n\\n self.__e = e\\n\\n self.__node = [e] * (2 * n)\\n\\n for i in range(len(A)):\\n\\n self.__node[i + n] = A[i]\\n\\n for i in range(n - 1, 0, -1):\\n\\n self.__node[i] = self.__dot(self.__node[2 * i], self.__node[2 * i + 1])\\n\\n \\n\\n def update(self, i, c):\\n\\n i += self.__n\\n\\n node = self.__node\\n\\n node[i] = c\\n\\n while i > 1:\\n\\n i //= 2\\n\\n node[i] = self.__dot(node[2 * i], node[2 * i + 1])\\n\\n\\n\\n def get(self, l, r):\\n\\n vl, vr = self.__e, self.__e\\n\\n l += self.__n\\n\\n r += self.__n\\n\\n while (l < r):\\n\\n if l & 1:\\n\\n vl = self.__dot(vl, self.__node[l])\\n\\n l += 1\\n\\n l //= 2\\n\\n if r & 1:\\n\\n r -= 1\\n\\n vr = self.__dot(vr, self.__node[r])\\n\\n r //= 2\\n\\n return self.__dot(vl, vr)\\n\\n\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\nA = [int(eval(input())) for _ in range(N)]\\n\\nmax_A = max(A)\\n\\n\\n\\nst = SegmentTree([N] * (max_A + 1), min, N)\\n\\nedge = [set() for _ in range(N)]\\n\\nfor i, a in enumerate(reversed(A)):\\n\\n j = N - 1 - i\\n\\n p1 = st.get(a, min(max_A + 1, a + K + 1))\\n\\n if p1 < N:\\n\\n edge[j].add(p1)\\n\\n p2 = st.get(max(0, a - K), a)\\n\\n if p2 < N:\\n\\n edge[j].add(p2)\\n\\n st.update(a, j)\\n\\n\\n\\ndp = [1] * N\\n\\nfor i in range(N - 1):\\n\\n here = dp[i]\\n\\n for ni in edge[i]:\\n\\n if ni < N:\\n\\n dp[ni] = max(dp[ni], dp[i] + 1)\\n\\n\\n\\nprint((max(dp)))\\n',\n", + " 'code_v0_loc': 87,\n", + " 'code_v1_loc': 84,\n", + " 'code_v0_num_chars': 2089,\n", + " 'code_v1_num_chars': 2021,\n", + " 'code_v0_no_empty_lines': 'class SegmentTree:\\n \"\"\"\\n update, get を提供するSegmentTree\\n Attributes\\n ----------\\n __n : int\\n 葉の数。2 ^ i - 1\\n __dot :\\n Segment function\\n __e: int\\n 単位元\\n __node: list\\n Segment Tree\\n \"\"\"\\n\\n def __init__(self, A, dot, e):\\n \"\"\"\\n Parameters\\n ----------\\n A : list\\n 対象の配列\\n dot :\\n Segment function\\n e : int\\n 単位元\\n \"\"\"\\n n = 2 ** (len(A) - 1).bit_length()\\n self.__n = n\\n self.__dot = dot\\n self.__e = e\\n self.__node = [e] * (2 * n)\\n for i in range(len(A)):\\n self.__node[i + n] = A[i]\\n for i in range(n - 1, 0, -1):\\n self.__node[i] = self.__dot(self.__node[2 * i], self.__node[2 * i + 1])\\n\\n def update(self, i, c):\\n i += self.__n\\n node = self.__node\\n node[i] = c\\n while i > 1:\\n i //= 2\\n node[i] = self.__dot(node[2 * i], node[2 * i + 1])\\n\\n def get(self, l, r):\\n vl, vr = self.__e, self.__e\\n l += self.__n\\n r += self.__n\\n while l < r:\\n if l & 1:\\n vl = self.__dot(vl, self.__node[l])\\n l += 1\\n l //= 2\\n if r & 1:\\n r -= 1\\n vr = self.__dot(vr, self.__node[r])\\n r //= 2\\n return self.__dot(vl, vr)\\n\\n\\nN, K = list(map(int, input().split()))\\nA = [int(eval(input())) for _ in range(N)]\\nmax_A = max(A)\\nst = SegmentTree([N] * (max_A + 1), min, N)\\nedge = [set() for _ in range(N)]\\nfor i, a in enumerate(reversed(A)):\\n j = N - 1 - i\\n p1 = st.get(a, min(max_A + 1, a + K + 1))\\n if p1 < N:\\n edge[j].add(p1)\\n p2 = st.get(max(0, a - K), a)\\n if p2 < N:\\n edge[j].add(p2)\\n p0 = st.get(a, a + 1)\\n if p0 < N:\\n edge[j].add(p0)\\n st.update(a, j)\\ndp = [1] * N\\nfor i in range(N - 1):\\n here = dp[i]\\n for ni in edge[i]:\\n if ni < N:\\n dp[ni] = max(dp[ni], dp[i] + 1)\\nprint((max(dp)))\\n',\n", + " 'code_v1_no_empty_lines': 'class SegmentTree:\\n \"\"\"\\n update, get を提供するSegmentTree\\n Attributes\\n ----------\\n __n : int\\n 葉の数。2 ^ i - 1\\n __dot :\\n Segment function\\n __e: int\\n 単位元\\n __node: list\\n Segment Tree\\n \"\"\"\\n\\n def __init__(self, A, dot, e):\\n \"\"\"\\n Parameters\\n ----------\\n A : list\\n 対象の配列\\n dot :\\n Segment function\\n e : int\\n 単位元\\n \"\"\"\\n n = 2 ** (len(A) - 1).bit_length()\\n self.__n = n\\n self.__dot = dot\\n self.__e = e\\n self.__node = [e] * (2 * n)\\n for i in range(len(A)):\\n self.__node[i + n] = A[i]\\n for i in range(n - 1, 0, -1):\\n self.__node[i] = self.__dot(self.__node[2 * i], self.__node[2 * i + 1])\\n\\n def update(self, i, c):\\n i += self.__n\\n node = self.__node\\n node[i] = c\\n while i > 1:\\n i //= 2\\n node[i] = self.__dot(node[2 * i], node[2 * i + 1])\\n\\n def get(self, l, r):\\n vl, vr = self.__e, self.__e\\n l += self.__n\\n r += self.__n\\n while l < r:\\n if l & 1:\\n vl = self.__dot(vl, self.__node[l])\\n l += 1\\n l //= 2\\n if r & 1:\\n r -= 1\\n vr = self.__dot(vr, self.__node[r])\\n r //= 2\\n return self.__dot(vl, vr)\\n\\n\\nN, K = list(map(int, input().split()))\\nA = [int(eval(input())) for _ in range(N)]\\nmax_A = max(A)\\nst = SegmentTree([N] * (max_A + 1), min, N)\\nedge = [set() for _ in range(N)]\\nfor i, a in enumerate(reversed(A)):\\n j = N - 1 - i\\n p1 = st.get(a, min(max_A + 1, a + K + 1))\\n if p1 < N:\\n edge[j].add(p1)\\n p2 = st.get(max(0, a - K), a)\\n if p2 < N:\\n edge[j].add(p2)\\n st.update(a, j)\\ndp = [1] * N\\nfor i in range(N - 1):\\n here = dp[i]\\n for ni in edge[i]:\\n if ni < N:\\n dp[ni] = max(dp[ni], dp[i] + 1)\\nprint((max(dp)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.4482758621,\n", + " 'diff': ['- p0 = st.get(a, a + 1)',\n", + " '- if p0 < N:',\n", + " '- edge[j].add(p0)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3663016255,\n", + " 'measured_runtime_v1': 0.2110150833,\n", + " 'runtime_lift': 1.7359025702,\n", + " 'key': ['s645565645', 's012232464']},\n", + " {'user_id': 'u381572531',\n", + " 'problem_id': 'p02891',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's581989830',\n", + " 'submission_id_v1': 's729822755',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n \\n\\ns = input().rstrip()\\n\\nk = int(eval(input()))\\n\\n \\n\\ndef check_count(s):\\n\\n cnt_list = [1]\\n\\n cnt = 1\\n\\n for i in range(1, len(s)):\\n\\n if s[i-1] == s[i]:\\n\\n cnt_list[-1] += 1\\n\\n else:\\n\\n cnt_list.append(1)\\n\\n return cnt_list\\n\\n\\n\\ndef calc_ans(cnt_list, k):\\n\\n _ans = 0\\n\\n for c in cnt_list:\\n\\n _ans += c//2\\n\\n return(_ans * k)\\n\\n\\n\\nif len(s)==1:\\n\\n ans = k//2\\n\\nelse:\\n\\n cnt_list = check_count(s)\\n\\n if len(cnt_list)==1:\\n\\n ans = (len(s)*k)//2\\n\\n else:\\n\\n ans = calc_ans(cnt_list, k)\\n\\n if s[0]==s[-1]:\\n\\n if cnt_list[0]%2==1 and cnt_list[-1]%2==1:\\n\\n ans += k - 1\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n \\n\\ns = input().rstrip()\\n\\nk = int(eval(input()))\\n\\n\\n\\ndef check_count(s):\\n\\n cnt_list = []\\n\\n cnt = 1\\n\\n for i in range(1, len(s)):\\n\\n if s[i-1] == s[i]:\\n\\n cnt += 1\\n\\n else:\\n\\n cnt_list.append(cnt)\\n\\n cnt = 1\\n\\n if cnt>1:\\n\\n cnt_list.append(cnt)\\n\\n return cnt_list\\n\\n\\n\\ndef calc_ans(cnt_list, k):\\n\\n _ans = 0\\n\\n for c in cnt_list:\\n\\n _ans += c//2\\n\\n return(_ans * k)\\n\\n\\n\\nif len(s)==1:\\n\\n ans = k//2\\n\\nelse:\\n\\n cnt_list = check_count(s)\\n\\n if len(cnt_list)==1:\\n\\n ans = (len(s)*k)//2\\n\\n else:\\n\\n ans = calc_ans(cnt_list, k)\\n\\n if s[0]==s[-1]:\\n\\n if cnt_list[0]%2==1 and cnt_list[-1]%2==1:\\n\\n ans += k - 1\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 35,\n", + " 'code_v1_loc': 38,\n", + " 'code_v0_num_chars': 711,\n", + " 'code_v1_num_chars': 765,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\ns = input().rstrip()\\nk = int(eval(input()))\\n\\n\\ndef check_count(s):\\n cnt_list = [1]\\n cnt = 1\\n for i in range(1, len(s)):\\n if s[i - 1] == s[i]:\\n cnt_list[-1] += 1\\n else:\\n cnt_list.append(1)\\n return cnt_list\\n\\n\\ndef calc_ans(cnt_list, k):\\n _ans = 0\\n for c in cnt_list:\\n _ans += c // 2\\n return _ans * k\\n\\n\\nif len(s) == 1:\\n ans = k // 2\\nelse:\\n cnt_list = check_count(s)\\n if len(cnt_list) == 1:\\n ans = (len(s) * k) // 2\\n else:\\n ans = calc_ans(cnt_list, k)\\n if s[0] == s[-1]:\\n if cnt_list[0] % 2 == 1 and cnt_list[-1] % 2 == 1:\\n ans += k - 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\ns = input().rstrip()\\nk = int(eval(input()))\\n\\n\\ndef check_count(s):\\n cnt_list = []\\n cnt = 1\\n for i in range(1, len(s)):\\n if s[i - 1] == s[i]:\\n cnt += 1\\n else:\\n cnt_list.append(cnt)\\n cnt = 1\\n if cnt > 1:\\n cnt_list.append(cnt)\\n return cnt_list\\n\\n\\ndef calc_ans(cnt_list, k):\\n _ans = 0\\n for c in cnt_list:\\n _ans += c // 2\\n return _ans * k\\n\\n\\nif len(s) == 1:\\n ans = k // 2\\nelse:\\n cnt_list = check_count(s)\\n if len(cnt_list) == 1:\\n ans = (len(s) * k) // 2\\n else:\\n ans = calc_ans(cnt_list, k)\\n if s[0] == s[-1]:\\n if cnt_list[0] % 2 == 1 and cnt_list[-1] % 2 == 1:\\n ans += k - 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.8947368421,\n", + " 'diff': ['- cnt_list = [1]',\n", + " '+ cnt_list = []',\n", + " '- cnt_list[-1] += 1',\n", + " '+ cnt += 1',\n", + " '- cnt_list.append(1)',\n", + " '+ cnt_list.append(cnt)',\n", + " '+ cnt = 1',\n", + " '+ if cnt > 1:',\n", + " '+ cnt_list.append(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3312115214,\n", + " 'measured_runtime_v1': 0.249056649,\n", + " 'runtime_lift': 1.3298642006,\n", + " 'key': ['s581989830', 's729822755']},\n", + " {'user_id': 'u933622697',\n", + " 'problem_id': 'p03434',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's339676301',\n", + " 'submission_id_v1': 's687508322',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12388,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.0,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn = int(eval(input()))\\n\\na_list = list(map(int, input().split()))\\n\\n\\n\\nalice_point = 0\\n\\nbob_point = 0\\n\\nfor i in range(n):\\n\\n argmax_a = np.argmax(a_list)\\n\\n max_a = np.max(a_list)\\n\\n if i % 2 == 0: # If Alice takes a card\\n\\n alice_point += max_a\\n\\n else: # If Bob takes a card\\n\\n bob_point += max_a\\n\\n del a_list[argmax_a] # No confidence -> Review how to delete list element!\\n\\n\\n\\nprint((alice_point - bob_point))',\n", + " 'target': 'n = int(eval(input()))\\n\\na_list = list(map(int, input().split()))\\n\\na_list = sorted(a_list, reverse=True)\\n\\n\\n\\nalice_point = 0\\n\\nbob_point = 0\\n\\nfor i in range(n):\\n\\n if i % 2 == 0:\\n\\n alice_point += a_list[i]\\n\\n else:\\n\\n bob_point += a_list[i]\\n\\n\\n\\nprint((alice_point - bob_point))',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 445,\n", + " 'code_v1_num_chars': 282,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\na_list = list(map(int, input().split()))\\nalice_point = 0\\nbob_point = 0\\nfor i in range(n):\\n argmax_a = np.argmax(a_list)\\n max_a = np.max(a_list)\\n if i % 2 == 0: # If Alice takes a card\\n alice_point += max_a\\n else: # If Bob takes a card\\n bob_point += max_a\\n del a_list[argmax_a] # No confidence -> Review how to delete list element!\\nprint((alice_point - bob_point))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na_list = list(map(int, input().split()))\\na_list = sorted(a_list, reverse=True)\\nalice_point = 0\\nbob_point = 0\\nfor i in range(n):\\n if i % 2 == 0:\\n alice_point += a_list[i]\\n else:\\n bob_point += a_list[i]\\nprint((alice_point - bob_point))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.5294117647,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '+a_list = sorted(a_list, reverse=True)',\n", + " '- argmax_a = np.argmax(a_list)',\n", + " '- max_a = np.max(a_list)',\n", + " '- if i % 2 == 0: # If Alice takes a card',\n", + " '- alice_point += max_a',\n", + " '- else: # If Bob takes a card',\n", + " '- bob_point += max_a',\n", + " '- del a_list[argmax_a] # No confidence -> Review how to delete list element!',\n", + " '+ if i % 2 == 0:',\n", + " '+ alice_point += a_list[i]',\n", + " '+ else:',\n", + " '+ bob_point += a_list[i]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5290555863,\n", + " 'measured_runtime_v1': 0.1577071764,\n", + " 'runtime_lift': 9.6955358703,\n", + " 'key': ['s339676301', 's687508322']},\n", + " {'user_id': 'u801359367',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's586527827',\n", + " 'submission_id_v1': 's564078636',\n", + " 'cpu_time_v0': 89,\n", + " 'cpu_time_v1': 80,\n", + " 'memory_v0': 4148,\n", + " 'memory_v1': 4148,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.11,\n", + " 'input': 'N = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\n\\n\\nSUM = 0\\n\\nfor i in A:\\n\\n count = 0\\n\\n while i%2 == 0:\\n\\n i//=2\\n\\n count += 1\\n\\n SUM+=count\\n\\nprint(SUM)',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\nSUM = 0\\n\\nfor i in A:\\n\\n while i%2 == 0:\\n\\n i//=2\\n\\n SUM += 1\\n\\nprint(SUM)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 175,\n", + " 'code_v1_num_chars': 140,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nSUM = 0\\nfor i in A:\\n count = 0\\n while i % 2 == 0:\\n i //= 2\\n count += 1\\n SUM += count\\nprint(SUM)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nSUM = 0\\nfor i in A:\\n while i % 2 == 0:\\n i //= 2\\n SUM += 1\\nprint(SUM)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.2727272727,\n", + " 'diff': ['- count = 0',\n", + " '- count += 1',\n", + " '- SUM += count',\n", + " '+ SUM += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3107097435,\n", + " 'measured_runtime_v1': 0.2124449382,\n", + " 'runtime_lift': 1.4625424646,\n", + " 'key': ['s586527827', 's564078636']},\n", + " {'user_id': 'u883040023',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's988075401',\n", + " 'submission_id_v1': 's958750940',\n", + " 'cpu_time_v0': 151,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 12504,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.09,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn = int(eval(input()))\\n\\nx = list(map(int,input().split()))\\n\\nx2 = np.power(x,2)\\n\\n\\n\\np1 = sum(x)//n\\n\\np2 = -(-sum(x)//n)\\n\\n\\n\\nw1 = n*(p1**2) -2*sum(x)*p1 +sum(x2)\\n\\nw2 = n*(p2**2) -2*sum(x)*p2 +sum(x2)\\n\\n\\n\\nprint((min(w1,w2)))',\n", + " 'target': 'n = int(eval(input()))\\n\\nX = sorted(map(int,input().split()))\\n\\nans = 10**6\\n\\n\\n\\nfor i in range(X[0],X[-1]+1):\\n\\n HP = 0\\n\\n \\n\\n for j in X:\\n\\n HP += (j - i) ** 2\\n\\n \\n\\n ans = min(ans,HP)\\n\\n \\n\\nprint(ans)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 231,\n", + " 'code_v1_num_chars': 214,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nx = list(map(int, input().split()))\\nx2 = np.power(x, 2)\\np1 = sum(x) // n\\np2 = -(-sum(x) // n)\\nw1 = n * (p1**2) - 2 * sum(x) * p1 + sum(x2)\\nw2 = n * (p2**2) - 2 * sum(x) * p2 + sum(x2)\\nprint((min(w1, w2)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nX = sorted(map(int, input().split()))\\nans = 10**6\\nfor i in range(X[0], X[-1] + 1):\\n HP = 0\\n for j in X:\\n HP += (j - i) ** 2\\n ans = min(ans, HP)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-x = list(map(int, input().split()))',\n", + " '-x2 = np.power(x, 2)',\n", + " '-p1 = sum(x) // n',\n", + " '-p2 = -(-sum(x) // n)',\n", + " '-w1 = n * (p1**2) - 2 * sum(x) * p1 + sum(x2)',\n", + " '-w2 = n * (p2**2) - 2 * sum(x) * p2 + sum(x2)',\n", + " '-print((min(w1, w2)))',\n", + " '+X = sorted(map(int, input().split()))',\n", + " '+ans = 10**6',\n", + " '+for i in range(X[0], X[-1] + 1):',\n", + " '+ HP = 0',\n", + " '+ for j in X:',\n", + " '+ HP += (j - i) ** 2',\n", + " '+ ans = min(ans, HP)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3939440961,\n", + " 'measured_runtime_v1': 0.2004205168,\n", + " 'runtime_lift': 6.9550968045,\n", + " 'key': ['s988075401', 's958750940']},\n", + " {'user_id': 'u843175622',\n", + " 'problem_id': 'p03298',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's154354411',\n", + " 'submission_id_v1': 's298686601',\n", + " 'cpu_time_v0': 1580,\n", + " 'cpu_time_v1': 641,\n", + " 'memory_v0': 300724,\n", + " 'memory_v1': 222320,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.43,\n", + " 'input': 'from collections import defaultdict\\n\\nn = int(eval(input()))\\n\\ns = eval(input())\\n\\n\\n\\na = s[:n]\\n\\nb = s[n:][::-1]\\n\\nd = defaultdict(int)\\n\\ne = defaultdict(int)\\n\\n\\n\\ndef cnt(c, d):\\n\\n for bit in range(1 << n):\\n\\n x = []\\n\\n y = []\\n\\n for i in range(n):\\n\\n if bit >> i & 1:\\n\\n x.append(c[i])\\n\\n else:\\n\\n y.append(c[i])\\n\\n d[(str(x), str(y))] += 1\\n\\n\\n\\n\\n\\ncnt(a, d)\\n\\ncnt(b, e)\\n\\n\\n\\nans = 0\\n\\nfor k, v in list(d.items()):\\n\\n ans += e[k] * v\\n\\nprint(ans)\\n',\n", + " 'target': 'from collections import defaultdict\\n\\nn = int(eval(input()))\\n\\ns = eval(input())\\n\\n\\n\\na = s[:n]\\n\\nb = s[n:][::-1]\\n\\nd = defaultdict(int)\\n\\ne = defaultdict(int)\\n\\n\\n\\nfor bit in range(1 << n):\\n\\n x = \"\"\\n\\n y = \"\"\\n\\n z = \"\"\\n\\n w = \"\"\\n\\n for i in range(n):\\n\\n if bit >> i & 1:\\n\\n x += a[i]\\n\\n z += b[i]\\n\\n else:\\n\\n y += a[i]\\n\\n w += b[i]\\n\\n d[x+\\'ω\\'+y] += 1\\n\\n e[z+\\'ω\\'+w] += 1\\n\\n\\n\\nprint((sum([e[k] * v for k, v in list(d.items())])))\\n',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 491,\n", + " 'code_v1_num_chars': 465,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\n\\nn = int(eval(input()))\\ns = eval(input())\\na = s[:n]\\nb = s[n:][::-1]\\nd = defaultdict(int)\\ne = defaultdict(int)\\n\\n\\ndef cnt(c, d):\\n for bit in range(1 << n):\\n x = []\\n y = []\\n for i in range(n):\\n if bit >> i & 1:\\n x.append(c[i])\\n else:\\n y.append(c[i])\\n d[(str(x), str(y))] += 1\\n\\n\\ncnt(a, d)\\ncnt(b, e)\\nans = 0\\nfor k, v in list(d.items()):\\n ans += e[k] * v\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\nn = int(eval(input()))\\ns = eval(input())\\na = s[:n]\\nb = s[n:][::-1]\\nd = defaultdict(int)\\ne = defaultdict(int)\\nfor bit in range(1 << n):\\n x = \"\"\\n y = \"\"\\n z = \"\"\\n w = \"\"\\n for i in range(n):\\n if bit >> i & 1:\\n x += a[i]\\n z += b[i]\\n else:\\n y += a[i]\\n w += b[i]\\n d[x + \"ω\" + y] += 1\\n e[z + \"ω\" + w] += 1\\nprint((sum([e[k] * v for k, v in list(d.items())])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.7142857143,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def cnt(c, d):',\n", + " '- for bit in range(1 << n):',\n", + " '- x = []',\n", + " '- y = []',\n", + " '- for i in range(n):',\n", + " '- if bit >> i & 1:',\n", + " '- x.append(c[i])',\n", + " '- else:',\n", + " '- y.append(c[i])',\n", + " '- d[(str(x), str(y))] += 1',\n", + " '-',\n", + " '-',\n", + " '-cnt(a, d)',\n", + " '-cnt(b, e)',\n", + " '-ans = 0',\n", + " '-for k, v in list(d.items()):',\n", + " '- ans += e[k] * v',\n", + " '-print(ans)',\n", + " '+for bit in range(1 << n):',\n", + " '+ x = \"\"',\n", + " '+ y = \"\"',\n", + " '+ z = \"\"',\n", + " '+ w = \"\"',\n", + " '+ for i in range(n):',\n", + " '+ if bit >> i & 1:',\n", + " '+ x += a[i]',\n", + " '+ z += b[i]',\n", + " '+ else:',\n", + " '+ y += a[i]',\n", + " '+ w += b[i]',\n", + " '+ d[x + \"ω\" + y] += 1',\n", + " '+ e[z + \"ω\" + w] += 1',\n", + " '+print((sum([e[k] * v for k, v in list(d.items())])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2700868397,\n", + " 'measured_runtime_v1': 0.1086692932,\n", + " 'runtime_lift': 2.4854016418,\n", + " 'key': ['s154354411', 's298686601']},\n", + " {'user_id': 'u186206732',\n", + " 'problem_id': 'p03060',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's984369136',\n", + " 'submission_id_v1': 's748536221',\n", + " 'cpu_time_v0': 260,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 17204,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 93.08,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn = int(eval(input()))\\n\\n\\n\\nv_list = np.array(list(map(int,input().split())))\\n\\nc_list = np.array(list(map(int,input().split())))\\n\\ne_list = list(v_list - c_list)\\n\\n\\n\\nans = 0\\n\\n\\n\\nfor i in range(n):\\n\\n if e_list[i] > 0:\\n\\n ans += e_list[i]\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\n\\n\\nv_list = list(map(int,input().split()))\\n\\nc_list = list(map(int,input().split()))\\n\\n\\n\\ne_list = [v-c if (v-c > 0) else 0 for v,c in zip(v_list, c_list)]\\n\\n\\n\\nprint((sum(e_list)))\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 271,\n", + " 'code_v1_num_chars': 192,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nv_list = np.array(list(map(int, input().split())))\\nc_list = np.array(list(map(int, input().split())))\\ne_list = list(v_list - c_list)\\nans = 0\\nfor i in range(n):\\n if e_list[i] > 0:\\n ans += e_list[i]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nv_list = list(map(int, input().split()))\\nc_list = list(map(int, input().split()))\\ne_list = [v - c if (v - c > 0) else 0 for v, c in zip(v_list, c_list)]\\nprint((sum(e_list)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 46.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-v_list = np.array(list(map(int, input().split())))',\n", + " '-c_list = np.array(list(map(int, input().split())))',\n", + " '-e_list = list(v_list - c_list)',\n", + " '-ans = 0',\n", + " '-for i in range(n):',\n", + " '- if e_list[i] > 0:',\n", + " '- ans += e_list[i]',\n", + " '-print(ans)',\n", + " '+v_list = list(map(int, input().split()))',\n", + " '+c_list = list(map(int, input().split()))',\n", + " '+e_list = [v - c if (v - c > 0) else 0 for v, c in zip(v_list, c_list)]',\n", + " '+print((sum(e_list)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8478024924,\n", + " 'measured_runtime_v1': 0.3072949107,\n", + " 'runtime_lift': 6.0131242925,\n", + " 'key': ['s984369136', 's748536221']},\n", + " {'user_id': 'u188827677',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's698380012',\n", + " 'submission_id_v1': 's714478978',\n", + " 'cpu_time_v0': 302,\n", + " 'cpu_time_v1': 221,\n", + " 'memory_v0': 11020,\n", + " 'memory_v1': 9144,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.82,\n", + " 'input': 'N,M = list(map(int, input().split()))\\n\\nL = []\\n\\nR = []\\n\\nfor _ in range(M):\\n\\n l,r = list(map(int, input().split()))\\n\\n L.append(l)\\n\\n R.append(r)\\n\\n\\n\\nans = min(R)-max(L)+1\\n\\nif ans < 0:\\n\\n print((0))\\n\\nelse:\\n\\n print(ans)\\n\\n ',\n", + " 'target': 'n,m = list(map(int, input().split()))\\n\\nmax_l = float(\"-inf\")\\n\\nmin_r = float(\"inf\")\\n\\nfor _ in range(m):\\n\\n l,r = list(map(int, input().split()))\\n\\n max_l = max(max_l, l)\\n\\n min_r = min(min_r, r)\\n\\nans = min_r - max_l + 1\\n\\nif ans > 0:\\n\\n print(ans)\\n\\nelse:\\n\\n print((0))',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 207,\n", + " 'code_v1_num_chars': 252,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\nL = []\\nR = []\\nfor _ in range(M):\\n l, r = list(map(int, input().split()))\\n L.append(l)\\n R.append(r)\\nans = min(R) - max(L) + 1\\nif ans < 0:\\n print((0))\\nelse:\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nmax_l = float(\"-inf\")\\nmin_r = float(\"inf\")\\nfor _ in range(m):\\n l, r = list(map(int, input().split()))\\n max_l = max(max_l, l)\\n min_r = min(min_r, r)\\nans = min_r - max_l + 1\\nif ans > 0:\\n print(ans)\\nelse:\\n print((0))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-N, M = list(map(int, input().split()))',\n", + " '-L = []',\n", + " '-R = []',\n", + " '-for _ in range(M):',\n", + " '+n, m = list(map(int, input().split()))',\n", + " '+max_l = float(\"-inf\")',\n", + " '+min_r = float(\"inf\")',\n", + " '+for _ in range(m):',\n", + " '- L.append(l)',\n", + " '- R.append(r)',\n", + " '-ans = min(R) - max(L) + 1',\n", + " '-if ans < 0:',\n", + " '+ max_l = max(max_l, l)',\n", + " '+ min_r = min(min_r, r)',\n", + " '+ans = min_r - max_l + 1',\n", + " '+if ans > 0:',\n", + " '+ print(ans)',\n", + " '+else:',\n", + " '-else:',\n", + " '- print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2637555127,\n", + " 'measured_runtime_v1': 0.1756164875,\n", + " 'runtime_lift': 1.5018835444,\n", + " 'key': ['s698380012', 's714478978']},\n", + " {'user_id': 'u923662841',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's523337024',\n", + " 'submission_id_v1': 's427570436',\n", + " 'cpu_time_v0': 160,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 12484,\n", + " 'memory_v1': 9180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.75,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nA = np.array(A)\\n\\ncounter = 0\\n\\nwhile True:\\n\\n if all( i%2==0 for i in A):\\n\\n counter += 1\\n\\n A = A/2\\n\\n else:\\n\\n print(counter)\\n\\n break',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nc = 0\\n\\nwhile True:\\n\\n if all(a% 2 ==0 for a in A):\\n\\n c += 1\\n\\n A = list([x//2 for x in A])\\n\\n else:\\n\\n break\\n\\nprint(c)',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 243,\n", + " 'code_v1_num_chars': 202,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nA = np.array(A)\\ncounter = 0\\nwhile True:\\n if all(i % 2 == 0 for i in A):\\n counter += 1\\n A = A / 2\\n else:\\n print(counter)\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nc = 0\\nwhile True:\\n if all(a % 2 == 0 for a in A):\\n c += 1\\n A = list([x // 2 for x in A])\\n else:\\n break\\nprint(c)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.array(A)',\n", + " '-counter = 0',\n", + " '+c = 0',\n", + " '- if all(i % 2 == 0 for i in A):',\n", + " '- counter += 1',\n", + " '- A = A / 2',\n", + " '+ if all(a % 2 == 0 for a in A):',\n", + " '+ c += 1',\n", + " '+ A = list([x // 2 for x in A])',\n", + " '- print(counter)',\n", + " '+print(c)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3790119479,\n", + " 'measured_runtime_v1': 0.2145438817,\n", + " 'runtime_lift': 6.4276451846,\n", + " 'key': ['s523337024', 's427570436']},\n", + " {'user_id': 'u617203831',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's015060265',\n", + " 'submission_id_v1': 's192076282',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 3980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.61,\n", + " 'input': 'import math\\n\\nprint((math.factorial(int(eval(input())))%(10**9+7)))',\n", + " 'target': 'ans=1\\n\\nn=int(eval(input()))\\n\\nfor i in range(1,n+1):\\n\\n ans*=i\\n\\n ans=ans%(10**9+7)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 58,\n", + " 'code_v1_num_chars': 88,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nprint((math.factorial(int(eval(input()))) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'ans = 1\\nn = int(eval(input()))\\nfor i in range(1, n + 1):\\n ans *= i\\n ans = ans % (10**9 + 7)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(int(eval(input()))) % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+n = int(eval(input()))',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans = ans % (10**9 + 7)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7955839839,\n", + " 'measured_runtime_v1': 0.4261377716,\n", + " 'runtime_lift': 1.866964247,\n", + " 'key': ['s015060265', 's192076282']},\n", + " {'user_id': 'u766684188',\n", + " 'problem_id': 'p02821',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's756543404',\n", + " 'submission_id_v1': 's283463453',\n", + " 'cpu_time_v0': 1684,\n", + " 'cpu_time_v1': 1054,\n", + " 'memory_v0': 58816,\n", + " 'memory_v1': 60104,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.41,\n", + " 'input': \"#E\\n\\nfrom itertools import accumulate\\n\\nfrom bisect import bisect_left\\n\\ndef main():\\n\\n n,m=list(map(int,input().split()))\\n\\n A=list(map(int,input().split()))\\n\\n A.sort()\\n\\n \\n\\n def count(k):\\n\\n cnt=0\\n\\n for a in A:\\n\\n cnt+=bisect_left(A,k-a)\\n\\n return cnt\\n\\n \\n\\n ok=0\\n\\n ng=10**10+1\\n\\n while ng-ok>1:\\n\\n mid=(ok+ng)//2\\n\\n if count(mid)1:\\n\\n mid=(ok+ng)//2\\n\\n if count(mid) 1:\\n mid = (ok + ng) // 2\\n if count(mid) < n**2 - m:\\n ok = mid\\n else:\\n ng = mid\\n border = ok\\n k = n**2 - count(border)\\n Acc = [0] + list(accumulate(A))\\n s = Acc[-1]\\n ans = 0\\n for a in A:\\n idx = bisect_left(A, border - a)\\n ans += a * (n - idx) + (s - Acc[idx])\\n ans -= border * (k - m)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from itertools import accumulate\\nfrom bisect import bisect_left\\n\\n\\ndef main():\\n n, m = list(map(int, input().split()))\\n A = list(map(int, input().split()))\\n A.sort()\\n\\n def count(k):\\n cnt = 0\\n for a in A:\\n cnt += bisect_left(A, k - a)\\n return cnt\\n\\n ok = 0\\n ng = 2 * 10**5 + 1\\n while ng - ok > 1:\\n mid = (ok + ng) // 2\\n if count(mid) < n**2 - m:\\n ok = mid\\n else:\\n ng = mid\\n border = ok\\n k = n**2 - count(border)\\n Acc = [0] + list(accumulate(A))\\n s = Acc[-1]\\n ans = 0\\n for a in A:\\n idx = bisect_left(A, border - a)\\n ans += a * (n - idx) + (s - Acc[idx])\\n ans -= border * (k - m)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.7777777778,\n", + " 'diff': ['-# E', '- ng = 10**10 + 1', '+ ng = 2 * 10**5 + 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.329581742,\n", + " 'measured_runtime_v1': 0.2004272747,\n", + " 'runtime_lift': 1.6443956668,\n", + " 'key': ['s756543404', 's283463453']},\n", + " {'user_id': 'u561083515',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's270393964',\n", + " 'submission_id_v1': 's470107269',\n", + " 'cpu_time_v0': 111,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.68,\n", + " 'input': '# https://atcoder.jp/contests/abc095/tasks/arc096_a\\n\\n\"\"\"\\n\\n別解(定数時間)\\n\\nhttps://atcoder.jp/contests/abc095/submissions/10226556\\n\\n\"\"\"\\n\\n\\n\\nA,B,C,X,Y = list(map(int,input().split()))\\n\\n\\n\\nans = float(\"inf\")\\n\\n\\n\\n# ABピザを2枚1組で考える -> ABセット\\n\\n# i: ABセットの個数\\n\\nfor i in range(10**5 + 1):\\n\\n ans = min(ans, i*(2*C) + max(0, X-i)*A + max(0, Y-i)*B)\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'A,B,C,X,Y = list(map(int,input().split()))\\n\\n\\n\\nAB_set = C * 2\\n\\n\\n\\nans = min(A*X + B*Y, AB_set*max(X,Y), AB_set*min(X,Y) + A*abs(X-min(X,Y)) + B*abs(Y-min(X,Y)))\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 336,\n", + " 'code_v1_num_chars': 166,\n", + " 'code_v0_no_empty_lines': '# https://atcoder.jp/contests/abc095/tasks/arc096_a\\n\"\"\"\\n別解(定数時間)\\nhttps://atcoder.jp/contests/abc095/submissions/10226556\\n\"\"\"\\nA, B, C, X, Y = list(map(int, input().split()))\\nans = float(\"inf\")\\n# ABピザを2枚1組で考える -> ABセット\\n# i: ABセットの個数\\nfor i in range(10**5 + 1):\\n ans = min(ans, i * (2 * C) + max(0, X - i) * A + max(0, Y - i) * B)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nAB_set = C * 2\\nans = min(\\n A * X + B * Y,\\n AB_set * max(X, Y),\\n AB_set * min(X, Y) + A * abs(X - min(X, Y)) + B * abs(Y - min(X, Y)),\\n)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 56.25,\n", + " 'diff': ['-# https://atcoder.jp/contests/abc095/tasks/arc096_a',\n", + " '-\"\"\"',\n", + " '-別解(定数時間)',\n", + " '-https://atcoder.jp/contests/abc095/submissions/10226556',\n", + " '-\"\"\"',\n", + " '-ans = float(\"inf\")',\n", + " '-# ABピザを2枚1組で考える -> ABセット',\n", + " '-# i: ABセットの個数',\n", + " '-for i in range(10**5 + 1):',\n", + " '- ans = min(ans, i * (2 * C) + max(0, X - i) * A + max(0, Y - i) * B)',\n", + " '+AB_set = C * 2',\n", + " '+ans = min(',\n", + " '+ A * X + B * Y,',\n", + " '+ AB_set * max(X, Y),',\n", + " '+ AB_set * min(X, Y) + A * abs(X - min(X, Y)) + B * abs(Y - min(X, Y)),',\n", + " '+)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.801804817,\n", + " 'measured_runtime_v1': 0.1832828865,\n", + " 'runtime_lift': 4.3746845775,\n", + " 'key': ['s270393964', 's470107269']},\n", + " {'user_id': 'u624475441',\n", + " 'problem_id': 'p03457',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's302891502',\n", + " 'submission_id_v1': 's171916715',\n", + " 'cpu_time_v0': 228,\n", + " 'cpu_time_v1': 146,\n", + " 'memory_v0': 28148,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.96,\n", + " 'input': \"import sys\\n\\ncan = True; eval(input())\\n\\ne = [[0, 0, 0]] + [list(map(int, e.split())) for e in sys.stdin]\\n\\nfor a, b in zip(e[1:], e):\\n\\n t = a[0] - b[0] - abs(a[1] - b[1]) - abs(a[2] - b[2])\\n\\n if t < 0 or t % 2 == 1: can = False; break\\n\\nprint((['No', 'Yes'][can]))\",\n", + " 'target': \"import sys\\n\\nans = 'Yes'; eval(input())\\n\\nfor e in sys.stdin:\\n\\n t, x, y = list(map(int, e.split()))\\n\\n t = t - x - y\\n\\n if t < 0 or t % 2 == 1: ans = 'No'; break\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 259,\n", + " 'code_v1_num_chars': 166,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ncan = True\\neval(input())\\ne = [[0, 0, 0]] + [list(map(int, e.split())) for e in sys.stdin]\\nfor a, b in zip(e[1:], e):\\n t = a[0] - b[0] - abs(a[1] - b[1]) - abs(a[2] - b[2])\\n if t < 0 or t % 2 == 1:\\n can = False\\n break\\nprint(([\"No\", \"Yes\"][can]))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nans = \"Yes\"\\neval(input())\\nfor e in sys.stdin:\\n t, x, y = list(map(int, e.split()))\\n t = t - x - y\\n if t < 0 or t % 2 == 1:\\n ans = \"No\"\\n break\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-can = True',\n", + " '+ans = \"Yes\"',\n", + " '-e = [[0, 0, 0]] + [list(map(int, e.split())) for e in sys.stdin]',\n", + " '-for a, b in zip(e[1:], e):',\n", + " '- t = a[0] - b[0] - abs(a[1] - b[1]) - abs(a[2] - b[2])',\n", + " '+for e in sys.stdin:',\n", + " '+ t, x, y = list(map(int, e.split()))',\n", + " '+ t = t - x - y',\n", + " '- can = False',\n", + " '+ ans = \"No\"',\n", + " '-print(([\"No\", \"Yes\"][can]))',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2223628902,\n", + " 'measured_runtime_v1': 0.1447919474,\n", + " 'runtime_lift': 1.5357407251,\n", + " 'key': ['s302891502', 's171916715']},\n", + " {'user_id': 'u936985471',\n", + " 'problem_id': 'p02901',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's462370890',\n", + " 'submission_id_v1': 's446448975',\n", + " 'cpu_time_v0': 1278,\n", + " 'cpu_time_v1': 790,\n", + " 'memory_v0': 9056,\n", + " 'memory_v1': 9192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 38.18,\n", + " 'input': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\n\\n\\nN,M = list(map(int,readline().split()))\\n\\nINF = 10 ** 10\\n\\ndp = [INF] * (2 ** N)\\n\\ndp[0] = 0\\n\\n\\n\\nfor i in range(M):\\n\\n a,b = list(map(int,readline().split()))\\n\\n c = list(map(int,readline().split()))\\n\\n key = 0\\n\\n for j in range(len(c)):\\n\\n key += (1 << (c[j] - 1))\\n\\n for j in range(len(dp)):\\n\\n if dp[j] == INF:\\n\\n continue\\n\\n if j | key == j:\\n\\n continue\\n\\n dp[j | key] = min(dp[j | key], dp[j] + a)\\n\\n\\n\\nif dp[-1] == INF:\\n\\n print((-1))\\n\\nelse:\\n\\n print((dp[-1]))',\n", + " 'target': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\n\\n\\nN,M = list(map(int,readline().split()))\\n\\nINF = 10 ** 10\\n\\ndp = [INF] * (2 ** N)\\n\\ndp[0] = 0\\n\\n\\n\\nfor i in range(M):\\n\\n a,b = list(map(int,readline().split()))\\n\\n c = list(map(int,readline().split()))\\n\\n key = 0\\n\\n for j in range(len(c)):\\n\\n key += (1 << (c[j] - 1))\\n\\n for j in range(len(dp)):\\n\\n if dp[j] == INF:\\n\\n continue\\n\\n if j | key == j:\\n\\n continue\\n\\n if dp[j | key] > dp[j] + a:\\n\\n dp[j | key] = dp[j] + a\\n\\n\\n\\nif dp[-1] == INF:\\n\\n print((-1))\\n\\nelse:\\n\\n print((dp[-1]))',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 505,\n", + " 'code_v1_num_chars': 522,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nN, M = list(map(int, readline().split()))\\nINF = 10**10\\ndp = [INF] * (2**N)\\ndp[0] = 0\\nfor i in range(M):\\n a, b = list(map(int, readline().split()))\\n c = list(map(int, readline().split()))\\n key = 0\\n for j in range(len(c)):\\n key += 1 << (c[j] - 1)\\n for j in range(len(dp)):\\n if dp[j] == INF:\\n continue\\n if j | key == j:\\n continue\\n dp[j | key] = min(dp[j | key], dp[j] + a)\\nif dp[-1] == INF:\\n print((-1))\\nelse:\\n print((dp[-1]))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nN, M = list(map(int, readline().split()))\\nINF = 10**10\\ndp = [INF] * (2**N)\\ndp[0] = 0\\nfor i in range(M):\\n a, b = list(map(int, readline().split()))\\n c = list(map(int, readline().split()))\\n key = 0\\n for j in range(len(c)):\\n key += 1 << (c[j] - 1)\\n for j in range(len(dp)):\\n if dp[j] == INF:\\n continue\\n if j | key == j:\\n continue\\n if dp[j | key] > dp[j] + a:\\n dp[j | key] = dp[j] + a\\nif dp[-1] == INF:\\n print((-1))\\nelse:\\n print((dp[-1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.8461538462,\n", + " 'diff': ['- dp[j | key] = min(dp[j | key], dp[j] + a)',\n", + " '+ if dp[j | key] > dp[j] + a:',\n", + " '+ dp[j | key] = dp[j] + a'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2747366824,\n", + " 'measured_runtime_v1': 0.0058527424,\n", + " 'runtime_lift': 46.941529559,\n", + " 'key': ['s462370890', 's446448975']},\n", + " {'user_id': 'u952708174',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's416996588',\n", + " 'submission_id_v1': 's856754977',\n", + " 'cpu_time_v0': 161,\n", + " 'cpu_time_v1': 106,\n", + " 'memory_v0': 9088,\n", + " 'memory_v1': 9192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 34.16,\n", + " 'input': 'def c_repsept():\\n\\n K = int(eval(input()))\\n\\n\\n\\n if (K % 2 == 0 or K % 5 == 0):\\n\\n return -1 # repsept の因数に 2, 5 はない\\n\\n\\n\\n repsept = 7 % K\\n\\n count = 1\\n\\n while repsept % K !=0:\\n\\n repsept = ((repsept * 10) + 7) % K\\n\\n count += 1\\n\\n return count\\n\\n\\n\\nprint((c_repsept()))',\n", + " 'target': 'def c_repsept():\\n\\n K = int(eval(input()))\\n\\n\\n\\n L = 9 * K // 7 if K % 7 == 0 else 9 * K\\n\\n if L % 2 == 0 or L % 5 == 0:\\n\\n return -1\\n\\n\\n\\n remainder = 1\\n\\n for n in range(1, L + 1):\\n\\n remainder = (10 * remainder) % L\\n\\n if remainder == 1:\\n\\n return n\\n\\n return -1\\n\\n\\n\\nprint((c_repsept()))',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 290,\n", + " 'code_v1_num_chars': 319,\n", + " 'code_v0_no_empty_lines': 'def c_repsept():\\n K = int(eval(input()))\\n if K % 2 == 0 or K % 5 == 0:\\n return -1 # repsept の因数に 2, 5 はない\\n repsept = 7 % K\\n count = 1\\n while repsept % K != 0:\\n repsept = ((repsept * 10) + 7) % K\\n count += 1\\n return count\\n\\n\\nprint((c_repsept()))\\n',\n", + " 'code_v1_no_empty_lines': 'def c_repsept():\\n K = int(eval(input()))\\n L = 9 * K // 7 if K % 7 == 0 else 9 * K\\n if L % 2 == 0 or L % 5 == 0:\\n return -1\\n remainder = 1\\n for n in range(1, L + 1):\\n remainder = (10 * remainder) % L\\n if remainder == 1:\\n return n\\n return -1\\n\\n\\nprint((c_repsept()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['- if K % 2 == 0 or K % 5 == 0:',\n", + " '- return -1 # repsept の因数に 2, 5 はない',\n", + " '- repsept = 7 % K',\n", + " '- count = 1',\n", + " '- while repsept % K != 0:',\n", + " '- repsept = ((repsept * 10) + 7) % K',\n", + " '- count += 1',\n", + " '- return count',\n", + " '+ L = 9 * K // 7 if K % 7 == 0 else 9 * K',\n", + " '+ if L % 2 == 0 or L % 5 == 0:',\n", + " '+ return -1',\n", + " '+ remainder = 1',\n", + " '+ for n in range(1, L + 1):',\n", + " '+ remainder = (10 * remainder) % L',\n", + " '+ if remainder == 1:',\n", + " '+ return n',\n", + " '+ return -1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4354579542,\n", + " 'measured_runtime_v1': 0.338304636,\n", + " 'runtime_lift': 1.2871770228,\n", + " 'key': ['s416996588', 's856754977']},\n", + " {'user_id': 'u296518383',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's558724347',\n", + " 'submission_id_v1': 's377057284',\n", + " 'cpu_time_v0': 137,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 4148,\n", + " 'memory_v1': 3956,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 56.2,\n", + " 'input': 'N=int(eval(input()))\\n\\na=list(map(int,input().split()))\\n\\nfor i in range(N):\\n\\n for j in range(1,31):\\n\\n if a[i]%(2**j)!=0:\\n\\n a[i]=j-1\\n\\n break\\n\\nprint((sum(a)))',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\ndef f(n):\\n\\n res = 0\\n\\n while n % 2 == 0:\\n\\n n //= 2\\n\\n res += 1\\n\\n return res\\n\\n\\n\\nanswer = 0\\n\\nfor a in A:\\n\\n answer += f(a)\\n\\n\\n\\nprint(answer)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 161,\n", + " 'code_v1_num_chars': 250,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\na = list(map(int, input().split()))\\nfor i in range(N):\\n for j in range(1, 31):\\n if a[i] % (2**j) != 0:\\n a[i] = j - 1\\n break\\nprint((sum(a)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\n\\n\\ndef f(n):\\n res = 0\\n while n % 2 == 0:\\n n //= 2\\n res += 1\\n return res\\n\\n\\nanswer = 0\\nfor a in A:\\n answer += f(a)\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.5555555556,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '+input = sys.stdin.buffer.readline',\n", + " '-a = list(map(int, input().split()))',\n", + " '-for i in range(N):',\n", + " '- for j in range(1, 31):',\n", + " '- if a[i] % (2**j) != 0:',\n", + " '- a[i] = j - 1',\n", + " '- break',\n", + " '-print((sum(a)))',\n", + " '+A = list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+def f(n):',\n", + " '+ res = 0',\n", + " '+ while n % 2 == 0:',\n", + " '+ n //= 2',\n", + " '+ res += 1',\n", + " '+ return res',\n", + " '+',\n", + " '+',\n", + " '+answer = 0',\n", + " '+for a in A:',\n", + " '+ answer += f(a)',\n", + " '+print(answer)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4158020542,\n", + " 'measured_runtime_v1': 0.3166491349,\n", + " 'runtime_lift': 1.313131818,\n", + " 'key': ['s558724347', 's377057284']},\n", + " {'user_id': 'u977389981',\n", + " 'problem_id': 'p03945',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's766452702',\n", + " 'submission_id_v1': 's266627272',\n", + " 'cpu_time_v0': 58,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 3188,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.1,\n", + " 'input': \"s = eval(input())\\n\\ncnt = 0\\n\\nfor i in range(len(s) - 1):\\n\\n if s[i] == 'W' and s[i + 1] == 'B':\\n\\n cnt += 1\\n\\n if s[i] == 'B' and s[i + 1] == 'W':\\n\\n cnt += 1\\n\\nprint(cnt)\",\n", + " 'target': 'S = eval(input())\\n\\n\\n\\ntmp = S[0]\\n\\ncnt = 0\\n\\nfor s in S[1:]:\\n\\n if tmp != s:\\n\\n cnt += 1\\n\\n tmp = s\\n\\n \\n\\nprint(cnt)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 179,\n", + " 'code_v1_num_chars': 126,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\ncnt = 0\\nfor i in range(len(s) - 1):\\n if s[i] == \"W\" and s[i + 1] == \"B\":\\n cnt += 1\\n if s[i] == \"B\" and s[i + 1] == \"W\":\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\ntmp = S[0]\\ncnt = 0\\nfor s in S[1:]:\\n if tmp != s:\\n cnt += 1\\n tmp = s\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-s = eval(input())',\n", + " '+S = eval(input())',\n", + " '+tmp = S[0]',\n", + " '-for i in range(len(s) - 1):',\n", + " '- if s[i] == \"W\" and s[i + 1] == \"B\":',\n", + " '+for s in S[1:]:',\n", + " '+ if tmp != s:',\n", + " '- if s[i] == \"B\" and s[i + 1] == \"W\":',\n", + " '- cnt += 1',\n", + " '+ tmp = s'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2203695748,\n", + " 'measured_runtime_v1': 0.0064766238,\n", + " 'runtime_lift': 34.0253783683,\n", + " 'key': ['s766452702', 's266627272']},\n", + " {'user_id': 'u227438830',\n", + " 'problem_id': 'p02394',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's015330345',\n", + " 'submission_id_v1': 's144446421',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 7644,\n", + " 'memory_v1': 5592,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.33,\n", + " 'input': 'W,H,x,y,r = [int(i) for i in input().split()]\\n\\nif x - r >= 0 and x + r <= W and y - r >= 0 and y + r <= H:\\n\\n print(\"Yes\")\\n\\nelse:\\n\\n print(\"No\")',\n", + " 'target': \"W, H, x, y, r = list(map(int, input().split()))\\n\\nif r <= x <= W-r and r <= y <= H-r:\\n\\n print('Yes')\\n\\nelse:\\n\\n print('No')\\n\",\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 148,\n", + " 'code_v1_num_chars': 121,\n", + " 'code_v0_no_empty_lines': 'W, H, x, y, r = [int(i) for i in input().split()]\\nif x - r >= 0 and x + r <= W and y - r >= 0 and y + r <= H:\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 'W, H, x, y, r = list(map(int, input().split()))\\nif r <= x <= W - r and r <= y <= H - r:\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-W, H, x, y, r = [int(i) for i in input().split()]',\n", + " '-if x - r >= 0 and x + r <= W and y - r >= 0 and y + r <= H:',\n", + " '+W, H, x, y, r = list(map(int, input().split()))',\n", + " '+if r <= x <= W - r and r <= y <= H - r:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1765992579,\n", + " 'measured_runtime_v1': 0.0064357525,\n", + " 'runtime_lift': 27.44034336,\n", + " 'key': ['s015330345', 's144446421']},\n", + " {'user_id': 'u094191970',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's196951264',\n", + " 'submission_id_v1': 's755826464',\n", + " 'cpu_time_v0': 127,\n", + " 'cpu_time_v1': 57,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 9184,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.12,\n", + " 'input': 'a,b=list(map(int, input().split()))\\n\\ncnt=0\\n\\nfor i in range(a,b+1):\\n\\n n=list(str(i))\\n\\n if n==list(reversed(n)):\\n\\n cnt+=1\\n\\nprint(cnt)',\n", + " 'target': 'from sys import stdin\\n\\nnii=lambda:list(map(int,stdin.readline().split()))\\n\\nlnii=lambda:list(map(int,stdin.readline().split()))\\n\\n\\n\\na,b=nii()\\n\\nans=0\\n\\nfor i in range(a,b+1):\\n\\n s=str(i)\\n\\n if s==s[::-1]:\\n\\n ans+=1\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 138,\n", + " 'code_v1_num_chars': 220,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(a, b + 1):\\n n = list(str(i))\\n if n == list(reversed(n)):\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'from sys import stdin\\n\\nnii = lambda: list(map(int, stdin.readline().split()))\\nlnii = lambda: list(map(int, stdin.readline().split()))\\na, b = nii()\\nans = 0\\nfor i in range(a, b + 1):\\n s = str(i)\\n if s == s[::-1]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.6666666667,\n", + " 'diff': ['-a, b = list(map(int, input().split()))',\n", + " '-cnt = 0',\n", + " '+from sys import stdin',\n", + " '+',\n", + " '+nii = lambda: list(map(int, stdin.readline().split()))',\n", + " '+lnii = lambda: list(map(int, stdin.readline().split()))',\n", + " '+a, b = nii()',\n", + " '+ans = 0',\n", + " '- n = list(str(i))',\n", + " '- if n == list(reversed(n)):',\n", + " '- cnt += 1',\n", + " '-print(cnt)',\n", + " '+ s = str(i)',\n", + " '+ if s == s[::-1]:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4537812017,\n", + " 'measured_runtime_v1': 0.1270140123,\n", + " 'runtime_lift': 3.5726861437,\n", + " 'key': ['s196951264', 's755826464']},\n", + " {'user_id': 'u318414416',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's337419843',\n", + " 'submission_id_v1': 's763303888',\n", + " 'cpu_time_v0': 672,\n", + " 'cpu_time_v1': 308,\n", + " 'memory_v0': 47336,\n", + " 'memory_v1': 30580,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.17,\n", + " 'input': '# coding: utf-8\\n\\n\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef f(n, abc):\\n\\n dp = [[0] * 3 for _ in range(n + 1)]\\n\\n for i in range(1, n + 1):\\n\\n for j in range(3):\\n\\n dp[i][j] = max(dp[i - 1][k] + abc[i - 1][j] \\\\\\n\\n for k in range(3) if k != j)\\n\\n return(max(dp[n]))\\n\\n\\n\\nn = int(eval(input())) # 1 <= n <= 10^5\\n\\nabc = [list(map(int, input().rstrip().split())) for _ in range(n)]\\n\\n\\n\\nprint((f(n, abc)))\\n',\n", + " 'target': '# coding: utf-8\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef f(n, abc):\\n\\n dp = [0] * 3\\n\\n for i in range(1, n + 1):\\n\\n a, b, c = abc[i - 1]\\n\\n dp = [ max(dp[1] + a, dp[2] + a), \\\\\\n\\n max(dp[0] + b, dp[2] + b), \\\\\\n\\n max(dp[0] + c, dp[1] + c) ]\\n\\n return(max(dp))\\n\\n\\n\\nn = int(eval(input())) # 1 <= n <= 10^5\\n\\nabc = [list(map(int, input().rstrip().split())) for _ in range(n)]\\n\\n\\n\\nprint((f(n, abc)))\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 434,\n", + " 'code_v1_num_chars': 436,\n", + " 'code_v0_no_empty_lines': '# coding: utf-8\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef f(n, abc):\\n dp = [[0] * 3 for _ in range(n + 1)]\\n for i in range(1, n + 1):\\n for j in range(3):\\n dp[i][j] = max(dp[i - 1][k] + abc[i - 1][j] for k in range(3) if k != j)\\n return max(dp[n])\\n\\n\\nn = int(eval(input())) # 1 <= n <= 10^5\\nabc = [list(map(int, input().rstrip().split())) for _ in range(n)]\\nprint((f(n, abc)))\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef f(n, abc):\\n dp = [0] * 3\\n for i in range(1, n + 1):\\n a, b, c = abc[i - 1]\\n dp = [\\n max(dp[1] + a, dp[2] + a),\\n max(dp[0] + b, dp[2] + b),\\n max(dp[0] + c, dp[1] + c),\\n ]\\n return max(dp)\\n\\n\\nn = int(eval(input())) # 1 <= n <= 10^5\\nabc = [list(map(int, input().rstrip().split())) for _ in range(n)]\\nprint((f(n, abc)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- dp = [[0] * 3 for _ in range(n + 1)]',\n", + " '+ dp = [0] * 3',\n", + " '- for j in range(3):',\n", + " '- dp[i][j] = max(dp[i - 1][k] + abc[i - 1][j] for k in range(3) if k != j)',\n", + " '- return max(dp[n])',\n", + " '+ a, b, c = abc[i - 1]',\n", + " '+ dp = [',\n", + " '+ max(dp[1] + a, dp[2] + a),',\n", + " '+ max(dp[0] + b, dp[2] + b),',\n", + " '+ max(dp[0] + c, dp[1] + c),',\n", + " '+ ]',\n", + " '+ return max(dp)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2527067475,\n", + " 'measured_runtime_v1': 0.1473037755,\n", + " 'runtime_lift': 1.7155483393,\n", + " 'key': ['s337419843', 's763303888']},\n", + " {'user_id': 'u597374218',\n", + " 'problem_id': 'p03035',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's085289040',\n", + " 'submission_id_v1': 's328762084',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'a,b=list(map(int,input().split()))\\n\\nprint((b if 13<=a else b//2 if 6<=a else 0))',\n", + " 'target': 'a,b=list(map(int,input().split()))\\n\\nprint((b if 12= 0:\\n\\n\\t\\t\\tans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'K, S = list(map(int,input().split(\" \")))\\n\\nans = 0\\n\\nfor X in range(K+1):\\n\\n for Y in range(K+1):\\n\\n if 0 <= (S - X - Y) <= K:\\n\\n ans += 1\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 156,\n", + " 'code_v1_num_chars': 162,\n", + " 'code_v0_no_empty_lines': 'K, S = list(map(int, input().split(\" \")))\\nans = 0\\nfor i in range(K + 1):\\n for j in range(K + 1):\\n if (S - i - j) <= K and (S - i - j) >= 0:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'K, S = list(map(int, input().split(\" \")))\\nans = 0\\nfor X in range(K + 1):\\n for Y in range(K + 1):\\n if 0 <= (S - X - Y) <= K:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in range(K + 1):',\n", + " '- for j in range(K + 1):',\n", + " '- if (S - i - j) <= K and (S - i - j) >= 0:',\n", + " '+for X in range(K + 1):',\n", + " '+ for Y in range(K + 1):',\n", + " '+ if 0 <= (S - X - Y) <= K:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.441297763,\n", + " 'measured_runtime_v1': 0.3279348275,\n", + " 'runtime_lift': 1.3456873926,\n", + " 'key': ['s889927917', 's987244986']},\n", + " {'user_id': 'u021019433',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's475579950',\n", + " 'submission_id_v1': 's165212154',\n", + " 'cpu_time_v0': 219,\n", + " 'cpu_time_v1': 58,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.52,\n", + " 'input': 'def popcount(x):\\n\\n r = 0\\n\\n while x:\\n\\n if x & 1:\\n\\n r += 1\\n\\n x >>= 1\\n\\n return r\\n\\n\\n\\nn = int(eval(input()))\\n\\nr = list(range(n))\\n\\na = [[0, 0] for _ in r]\\n\\nfor i in r:\\n\\n for _ in range(int(eval(input()))):\\n\\n x, y = list(map(int, input().split()))\\n\\n a[i][y] |= 1 << (x - 1)\\n\\n\\n\\nm = 0\\n\\nl = (1 << n) - 1\\n\\nfor x in range(1, l + 1):\\n\\n if all(a[i][0] & x == a[i][1] & l - x == 0 for i in r if x >> i & 1):\\n\\n m = max(m, popcount(x))\\n\\nprint(m)\\n',\n", + " 'target': 'from itertools import combinations\\n\\n \\n\\nn = int(eval(input()))\\n\\nr = list(range(n))\\n\\na = [(set(), set()) for _ in r]\\n\\nfor i in r:\\n\\n for _ in range(int(eval(input()))):\\n\\n x, y = list(map(int, input().split()))\\n\\n a[i][y].add(x - 1)\\n\\n \\n\\nfail = lambda x: not all(a[i][0].isdisjoint(x) and a[i][1] < x for i in x)\\n\\n \\n\\nwhile all(map(fail, list(map(set, combinations(r, n))))):\\n\\n n -= 1\\n\\nprint(n)',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 430,\n", + " 'code_v1_num_chars': 365,\n", + " 'code_v0_no_empty_lines': 'def popcount(x):\\n r = 0\\n while x:\\n if x & 1:\\n r += 1\\n x >>= 1\\n return r\\n\\n\\nn = int(eval(input()))\\nr = list(range(n))\\na = [[0, 0] for _ in r]\\nfor i in r:\\n for _ in range(int(eval(input()))):\\n x, y = list(map(int, input().split()))\\n a[i][y] |= 1 << (x - 1)\\nm = 0\\nl = (1 << n) - 1\\nfor x in range(1, l + 1):\\n if all(a[i][0] & x == a[i][1] & l - x == 0 for i in r if x >> i & 1):\\n m = max(m, popcount(x))\\nprint(m)\\n',\n", + " 'code_v1_no_empty_lines': 'from itertools import combinations\\n\\nn = int(eval(input()))\\nr = list(range(n))\\na = [(set(), set()) for _ in r]\\nfor i in r:\\n for _ in range(int(eval(input()))):\\n x, y = list(map(int, input().split()))\\n a[i][y].add(x - 1)\\nfail = lambda x: not all(a[i][0].isdisjoint(x) and a[i][1] < x for i in x)\\nwhile all(map(fail, list(map(set, combinations(r, n))))):\\n n -= 1\\nprint(n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.8181818182,\n", + " 'diff': ['-def popcount(x):',\n", + " '- r = 0',\n", + " '- while x:',\n", + " '- if x & 1:',\n", + " '- r += 1',\n", + " '- x >>= 1',\n", + " '- return r',\n", + " '-',\n", + " '+from itertools import combinations',\n", + " '-a = [[0, 0] for _ in r]',\n", + " '+a = [(set(), set()) for _ in r]',\n", + " '- a[i][y] |= 1 << (x - 1)',\n", + " '-m = 0',\n", + " '-l = (1 << n) - 1',\n", + " '-for x in range(1, l + 1):',\n", + " '- if all(a[i][0] & x == a[i][1] & l - x == 0 for i in r if x >> i & 1):',\n", + " '- m = max(m, popcount(x))',\n", + " '-print(m)',\n", + " '+ a[i][y].add(x - 1)',\n", + " '+fail = lambda x: not all(a[i][0].isdisjoint(x) and a[i][1] < x for i in x)',\n", + " '+while all(map(fail, list(map(set, combinations(r, n))))):',\n", + " '+ n -= 1',\n", + " '+print(n)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2279194756,\n", + " 'measured_runtime_v1': 0.0067682672,\n", + " 'runtime_lift': 33.6747161436,\n", + " 'key': ['s475579950', 's165212154']},\n", + " {'user_id': 'u800534567',\n", + " 'problem_id': 'p02245',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's424620538',\n", + " 'submission_id_v1': 's007973982',\n", + " 'cpu_time_v0': 3310,\n", + " 'cpu_time_v1': 2340,\n", + " 'memory_v0': 34416,\n", + " 'memory_v1': 34452,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 29.31,\n", + " 'input': \"import sys\\n\\nimport queue\\n\\n\\n\\nN = 3\\n\\nf= ''.join(sys.stdin.readline().split())\\n\\nf+= ''.join(sys.stdin.readline().split())\\n\\nf+= ''.join(sys.stdin.readline().split())\\n\\n\\n\\ndd = [[-1, 0], [0, -1], [1, 0], [0, 1]]\\n\\n\\n\\nQ = queue.Queue()\\n\\nV = dict()\\n\\n\\n\\nQ.put([f,f.index('0'),0])\\n\\nV[f] = True\\n\\n\\n\\nwhile not Q.empty():\\n\\n u = Q.get()\\n\\n if u[0] == '123456780': break\\n\\n sx, sy = u[1]//N, u[1]%N\\n\\n for dx, dy in dd:\\n\\n tx, ty = sx+dx, sy+dy\\n\\n if tx<0 or ty<0 or tx>=N or ty>=N: continue\\n\\n v = u[:]\\n\\n n1, n2 = u[1], tx*N+ty\\n\\n v[1] = n2\\n\\n if n1>n2: n1, n2 = n2, n1\\n\\n v[0] = v[0][0:n1]+v[0][n2]+v[0][n1+1:n2]+v[0][n1]+v[0][n2+1:]\\n\\n if not V.get(v[0], False):\\n\\n V[v[0]] = True\\n\\n v[2] += 1 \\n\\n Q.put(v)\\n\\n\\n\\nprint((u[2]))\\n\",\n", + " 'target': \"import sys\\n\\nimport queue\\n\\n\\n\\nN = 3\\n\\n\\n\\nf = ''.join(sys.stdin.readline().split())\\n\\nf += ''.join(sys.stdin.readline().split())\\n\\nf += ''.join(sys.stdin.readline().split())\\n\\n\\n\\ndd = [[-1, 0], [0, -1], [1, 0], [0, 1]]\\n\\n\\n\\nQ = [[f,f.index('0'),0]]\\n\\nV = { f: True }\\n\\n\\n\\nwhile len(Q)>0:\\n\\n u = Q.pop(0)\\n\\n if u[0] == '123456780': break\\n\\n sx, sy = u[1]//N, u[1]%N\\n\\n for dx, dy in dd:\\n\\n tx, ty = sx+dx, sy+dy\\n\\n if tx<0 or ty<0 or tx>=N or ty>=N: continue\\n\\n v = u[:]\\n\\n n1, n2 = u[1], tx*N+ty\\n\\n v[1] = n2\\n\\n if n1>n2: n1, n2 = n2, n1\\n\\n v[0] = v[0][0:n1]+v[0][n2]+v[0][n1+1:n2]+v[0][n1]+v[0][n2+1:]\\n\\n if not V.get(v[0], False):\\n\\n V[v[0]] = True\\n\\n v[2] += 1 # dir[r] \\n\\n Q.append(v)\\n\\n\\n\\nprint((u[2]))\\n\",\n", + " 'code_v0_loc': 34,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 845,\n", + " 'code_v1_num_chars': 831,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport queue\\n\\nN = 3\\nf = \"\".join(sys.stdin.readline().split())\\nf += \"\".join(sys.stdin.readline().split())\\nf += \"\".join(sys.stdin.readline().split())\\ndd = [[-1, 0], [0, -1], [1, 0], [0, 1]]\\nQ = queue.Queue()\\nV = dict()\\nQ.put([f, f.index(\"0\"), 0])\\nV[f] = True\\nwhile not Q.empty():\\n u = Q.get()\\n if u[0] == \"123456780\":\\n break\\n sx, sy = u[1] // N, u[1] % N\\n for dx, dy in dd:\\n tx, ty = sx + dx, sy + dy\\n if tx < 0 or ty < 0 or tx >= N or ty >= N:\\n continue\\n v = u[:]\\n n1, n2 = u[1], tx * N + ty\\n v[1] = n2\\n if n1 > n2:\\n n1, n2 = n2, n1\\n v[0] = v[0][0:n1] + v[0][n2] + v[0][n1 + 1 : n2] + v[0][n1] + v[0][n2 + 1 :]\\n if not V.get(v[0], False):\\n V[v[0]] = True\\n v[2] += 1\\n Q.put(v)\\nprint((u[2]))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport queue\\n\\nN = 3\\nf = \"\".join(sys.stdin.readline().split())\\nf += \"\".join(sys.stdin.readline().split())\\nf += \"\".join(sys.stdin.readline().split())\\ndd = [[-1, 0], [0, -1], [1, 0], [0, 1]]\\nQ = [[f, f.index(\"0\"), 0]]\\nV = {f: True}\\nwhile len(Q) > 0:\\n u = Q.pop(0)\\n if u[0] == \"123456780\":\\n break\\n sx, sy = u[1] // N, u[1] % N\\n for dx, dy in dd:\\n tx, ty = sx + dx, sy + dy\\n if tx < 0 or ty < 0 or tx >= N or ty >= N:\\n continue\\n v = u[:]\\n n1, n2 = u[1], tx * N + ty\\n v[1] = n2\\n if n1 > n2:\\n n1, n2 = n2, n1\\n v[0] = v[0][0:n1] + v[0][n2] + v[0][n1 + 1 : n2] + v[0][n1] + v[0][n2 + 1 :]\\n if not V.get(v[0], False):\\n V[v[0]] = True\\n v[2] += 1 # dir[r]\\n Q.append(v)\\nprint((u[2]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.8823529412,\n", + " 'diff': ['-Q = queue.Queue()',\n", + " '-V = dict()',\n", + " '-Q.put([f, f.index(\"0\"), 0])',\n", + " '-V[f] = True',\n", + " '-while not Q.empty():',\n", + " '- u = Q.get()',\n", + " '+Q = [[f, f.index(\"0\"), 0]]',\n", + " '+V = {f: True}',\n", + " '+while len(Q) > 0:',\n", + " '+ u = Q.pop(0)',\n", + " '- v[2] += 1',\n", + " '- Q.put(v)',\n", + " '+ v[2] += 1 # dir[r]',\n", + " '+ Q.append(v)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5507428885,\n", + " 'measured_runtime_v1': 0.3782181978,\n", + " 'runtime_lift': 1.4561512154,\n", + " 'key': ['s424620538', 's007973982']},\n", + " {'user_id': 'u305366205',\n", + " 'problem_id': 'p03307',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's023207655',\n", + " 'submission_id_v1': 's158622460',\n", + " 'cpu_time_v0': 36,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 5176,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 52.78,\n", + " 'input': 'import fractions\\n\\n\\n\\n\\n\\ndef lcm(x, y):\\n\\n return (x * y) // fractions.gcd(x, y)\\n\\n\\n\\n\\n\\nN = int(eval(input()))\\n\\nprint((lcm(N, 2)))',\n", + " 'target': 'N = int(eval(input()))\\n\\nif N % 2 == 0:\\n\\n print(N)\\n\\nelse:\\n\\n print((2 * N))',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 119,\n", + " 'code_v1_num_chars': 71,\n", + " 'code_v0_no_empty_lines': 'import fractions\\n\\n\\ndef lcm(x, y):\\n return (x * y) // fractions.gcd(x, y)\\n\\n\\nN = int(eval(input()))\\nprint((lcm(N, 2)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nif N % 2 == 0:\\n print(N)\\nelse:\\n print((2 * N))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 44.4444444444,\n", + " 'diff': ['-import fractions',\n", + " '-',\n", + " '-',\n", + " '-def lcm(x, y):',\n", + " '- return (x * y) // fractions.gcd(x, y)',\n", + " '-',\n", + " '-',\n", + " '-print((lcm(N, 2)))',\n", + " '+if N % 2 == 0:',\n", + " '+ print(N)',\n", + " '+else:',\n", + " '+ print((2 * N))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2764545197,\n", + " 'measured_runtime_v1': 0.1953277736,\n", + " 'runtime_lift': 1.4153364608,\n", + " 'key': ['s023207655', 's158622460']},\n", + " {'user_id': 'u604839890',\n", + " 'problem_id': 'p02622',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's830524393',\n", + " 'submission_id_v1': 's723518358',\n", + " 'cpu_time_v0': 83,\n", + " 'cpu_time_v1': 70,\n", + " 'memory_v0': 85616,\n", + " 'memory_v1': 73748,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.66,\n", + " 'input': 'S, T = [list(eval(input())) for _ in range(2)]\\n\\ncnt = 0\\n\\nfor i in range(len(S)):\\n\\n if S[i] != T[i]:\\n\\n cnt += 1\\n\\nprint(cnt)\\n',\n", + " 'target': 's, t = [eval(input()) for i in range(2)]\\n\\nans = 0\\n\\nfor i in range(len(s)):\\n\\n if s[i] != t[i]:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 127,\n", + " 'code_v1_num_chars': 114,\n", + " 'code_v0_no_empty_lines': 'S, T = [list(eval(input())) for _ in range(2)]\\ncnt = 0\\nfor i in range(len(S)):\\n if S[i] != T[i]:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 's, t = [eval(input()) for i in range(2)]\\nans = 0\\nfor i in range(len(s)):\\n if s[i] != t[i]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-S, T = [list(eval(input())) for _ in range(2)]',\n", + " '-cnt = 0',\n", + " '-for i in range(len(S)):',\n", + " '- if S[i] != T[i]:',\n", + " '- cnt += 1',\n", + " '-print(cnt)',\n", + " '+s, t = [eval(input()) for i in range(2)]',\n", + " '+ans = 0',\n", + " '+for i in range(len(s)):',\n", + " '+ if s[i] != t[i]:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2683959379,\n", + " 'measured_runtime_v1': 0.2054475396,\n", + " 'runtime_lift': 1.3063964576,\n", + " 'key': ['s830524393', 's723518358']},\n", + " {'user_id': 'u190086340',\n", + " 'problem_id': 'p03854',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's952373499',\n", + " 'submission_id_v1': 's487524594',\n", + " 'cpu_time_v0': 320,\n", + " 'cpu_time_v1': 262,\n", + " 'memory_v0': 79600,\n", + " 'memory_v1': 58480,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.12,\n", + " 'input': 'import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\n\\n\\n\\n\\ndef solve():\\n\\n S = eval(input())\\n\\n # print(S, len(S))\\n\\n\\n\\n words = {0: \"dream\", 1: \"dreamer\", 2: \"erase\", 3: \"eraser\"}\\n\\n\\n\\n TABLE = [[-1 for x in range(len(S) + 1)] for y in range(len(words) + 1)]\\n\\n\\n\\n def recur(i, w):\\n\\n if not TABLE[w][i] == -1:\\n\\n return TABLE[w][i]\\n\\n\\n\\n if i >= len(S):\\n\\n # print(\"jey\", log)\\n\\n return True\\n\\n\\n\\n r1, r2, r3, r4 = False, False, False, False\\n\\n if S[i:i + 5] == words[0]:\\n\\n r1 = recur(i + 5, 0)\\n\\n if S[i:i + 7] == words[1]:\\n\\n r2 = recur(i + 7, 1)\\n\\n if S[i:i + 5] == words[2]:\\n\\n r3 = recur(i + 5, 2)\\n\\n if S[i:i + 6] == words[3]:\\n\\n r4 = recur(i + 6, 3)\\n\\n\\n\\n TABLE[w][i] = r1 or r2 or r3 or r4 or False\\n\\n\\n\\n return TABLE[w][i]\\n\\n\\n\\n ans = recur(0, 0)\\n\\n\\n\\n return ans\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n res = solve()\\n\\n if res:\\n\\n print(\"YES\")\\n\\n else:\\n\\n print(\"NO\")\\n',\n", + " 'target': 'import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\n\\n\\ndef solve():\\n\\n S = eval(input())\\n\\n # print(S, len(S))\\n\\n\\n\\n S = S[::-1]\\n\\n words = (\"dream\"[::-1], \"dreamer\"[::-1], \"erase\"[::-1], \"eraser\"[::-1])\\n\\n\\n\\n def recur(i):\\n\\n if i >= len(S):\\n\\n return True\\n\\n\\n\\n for word in words:\\n\\n if S[i:i + len(word)] == word:\\n\\n if recur(i + len(word)):\\n\\n return True\\n\\n return False\\n\\n\\n\\n ans = recur(0)\\n\\n\\n\\n return ans\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n res = solve()\\n\\n if res:\\n\\n print(\"YES\")\\n\\n else:\\n\\n print(\"NO\")\\n',\n", + " 'code_v0_loc': 45,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 1006,\n", + " 'code_v1_num_chars': 596,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\n\\n\\ndef solve():\\n S = eval(input())\\n # print(S, len(S))\\n words = {0: \"dream\", 1: \"dreamer\", 2: \"erase\", 3: \"eraser\"}\\n TABLE = [[-1 for x in range(len(S) + 1)] for y in range(len(words) + 1)]\\n\\n def recur(i, w):\\n if not TABLE[w][i] == -1:\\n return TABLE[w][i]\\n if i >= len(S):\\n # print(\"jey\", log)\\n return True\\n r1, r2, r3, r4 = False, False, False, False\\n if S[i : i + 5] == words[0]:\\n r1 = recur(i + 5, 0)\\n if S[i : i + 7] == words[1]:\\n r2 = recur(i + 7, 1)\\n if S[i : i + 5] == words[2]:\\n r3 = recur(i + 5, 2)\\n if S[i : i + 6] == words[3]:\\n r4 = recur(i + 6, 3)\\n TABLE[w][i] = r1 or r2 or r3 or r4 or False\\n return TABLE[w][i]\\n\\n ans = recur(0, 0)\\n return ans\\n\\n\\nif __name__ == \"__main__\":\\n res = solve()\\n if res:\\n print(\"YES\")\\n else:\\n print(\"NO\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\n\\n\\ndef solve():\\n S = eval(input())\\n # print(S, len(S))\\n S = S[::-1]\\n words = (\"dream\"[::-1], \"dreamer\"[::-1], \"erase\"[::-1], \"eraser\"[::-1])\\n\\n def recur(i):\\n if i >= len(S):\\n return True\\n for word in words:\\n if S[i : i + len(word)] == word:\\n if recur(i + len(word)):\\n return True\\n return False\\n\\n ans = recur(0)\\n return ans\\n\\n\\nif __name__ == \"__main__\":\\n res = solve()\\n if res:\\n print(\"YES\")\\n else:\\n print(\"NO\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.1111111111,\n", + " 'diff': ['- words = {0: \"dream\", 1: \"dreamer\", 2: \"erase\", 3: \"eraser\"}',\n", + " '- TABLE = [[-1 for x in range(len(S) + 1)] for y in range(len(words) + 1)]',\n", + " '+ S = S[::-1]',\n", + " '+ words = (\"dream\"[::-1], \"dreamer\"[::-1], \"erase\"[::-1], \"eraser\"[::-1])',\n", + " '- def recur(i, w):',\n", + " '- if not TABLE[w][i] == -1:',\n", + " '- return TABLE[w][i]',\n", + " '+ def recur(i):',\n", + " '- # print(\"jey\", log)',\n", + " '- r1, r2, r3, r4 = False, False, False, False',\n", + " '- if S[i : i + 5] == words[0]:',\n", + " '- r1 = recur(i + 5, 0)',\n", + " '- if S[i : i + 7] == words[1]:',\n", + " '- r2 = recur(i + 7, 1)',\n", + " '- if S[i : i + 5] == words[2]:',\n", + " '- r3 = recur(i + 5, 2)',\n", + " '- if S[i : i + 6] == words[3]:',\n", + " '- r4 = recur(i + 6, 3)',\n", + " '- TABLE[w][i] = r1 or r2 or r3 or r4 or False',\n", + " '- return TABLE[w][i]',\n", + " '+ for word in words:',\n", + " '+ if S[i : i + len(word)] == word:',\n", + " '+ if recur(i + len(word)):',\n", + " '+ return True',\n", + " '+ return False',\n", + " '- ans = recur(0, 0)',\n", + " '+ ans = recur(0)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3275957136,\n", + " 'measured_runtime_v1': 0.2137343092,\n", + " 'runtime_lift': 1.5327240387,\n", + " 'key': ['s952373499', 's487524594']},\n", + " {'user_id': 'u732061897',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's699773211',\n", + " 'submission_id_v1': 's064206410',\n", + " 'cpu_time_v0': 21,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.29,\n", + " 'input': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nanswer = 10 ** 9\\n\\nfor i in range(1,101):\\n\\n tmp = 0\\n\\n for a in A:\\n\\n tmp += abs(a-i) ** 2\\n\\n answer = min(answer,tmp)\\n\\nprint(answer)',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nchushin = sum(A)//N\\n\\nchushin_1 = sum(A)//N +1\\n\\nanswer = 0\\n\\nanswer_1 = 0\\n\\nfor a in A:\\n\\n answer += abs(a-chushin) ** 2\\n\\n answer_1 += abs(a-chushin_1) ** 2\\n\\nprint((min(answer,answer_1)))',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 200,\n", + " 'code_v1_num_chars': 242,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nanswer = 10**9\\nfor i in range(1, 101):\\n tmp = 0\\n for a in A:\\n tmp += abs(a - i) ** 2\\n answer = min(answer, tmp)\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nchushin = sum(A) // N\\nchushin_1 = sum(A) // N + 1\\nanswer = 0\\nanswer_1 = 0\\nfor a in A:\\n answer += abs(a - chushin) ** 2\\n answer_1 += abs(a - chushin_1) ** 2\\nprint((min(answer, answer_1)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-answer = 10**9',\n", + " '-for i in range(1, 101):',\n", + " '- tmp = 0',\n", + " '- for a in A:',\n", + " '- tmp += abs(a - i) ** 2',\n", + " '- answer = min(answer, tmp)',\n", + " '-print(answer)',\n", + " '+chushin = sum(A) // N',\n", + " '+chushin_1 = sum(A) // N + 1',\n", + " '+answer = 0',\n", + " '+answer_1 = 0',\n", + " '+for a in A:',\n", + " '+ answer += abs(a - chushin) ** 2',\n", + " '+ answer_1 += abs(a - chushin_1) ** 2',\n", + " '+print((min(answer, answer_1)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3756797752,\n", + " 'measured_runtime_v1': 0.2943871524,\n", + " 'runtime_lift': 1.2761418836,\n", + " 'key': ['s699773211', 's064206410']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's471284270',\n", + " 'submission_id_v1': 's058926350',\n", + " 'cpu_time_v0': 98,\n", + " 'cpu_time_v1': 81,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.35,\n", + " 'input': \"def main():\\n\\n A, B, AB, X, Y = list(map(int, input().split()))\\n\\n M = max(X, Y)\\n\\n\\n\\n k = 0\\n\\n ans = A * X + B * Y\\n\\n while True:\\n\\n ans = min(\\n\\n ans,\\n\\n AB * k * 2 + max(0, X - k) * A + max(0, Y - k) * B\\n\\n )\\n\\n\\n\\n if k >= M: break\\n\\n k += 1\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"def main():\\n\\n A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\n ans = 1 << 30\\n\\n c = 0 # even\\n\\n while True:\\n\\n j = c // 2\\n\\n t = A * max(0, X - j) + B * max(0, Y - j) + C * c\\n\\n if ans <= t: break\\n\\n ans = t\\n\\n c += 2\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 353,\n", + " 'code_v1_num_chars': 318,\n", + " 'code_v0_no_empty_lines': 'def main():\\n A, B, AB, X, Y = list(map(int, input().split()))\\n M = max(X, Y)\\n k = 0\\n ans = A * X + B * Y\\n while True:\\n ans = min(ans, AB * k * 2 + max(0, X - k) * A + max(0, Y - k) * B)\\n if k >= M:\\n break\\n k += 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n A, B, C, X, Y = list(map(int, input().split()))\\n ans = 1 << 30\\n c = 0 # even\\n while True:\\n j = c // 2\\n t = A * max(0, X - j) + B * max(0, Y - j) + C * c\\n if ans <= t:\\n break\\n ans = t\\n c += 2\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.0,\n", + " 'diff': ['- A, B, AB, X, Y = list(map(int, input().split()))',\n", + " '- M = max(X, Y)',\n", + " '- k = 0',\n", + " '- ans = A * X + B * Y',\n", + " '+ A, B, C, X, Y = list(map(int, input().split()))',\n", + " '+ ans = 1 << 30',\n", + " '+ c = 0 # even',\n", + " '- ans = min(ans, AB * k * 2 + max(0, X - k) * A + max(0, Y - k) * B)',\n", + " '- if k >= M:',\n", + " '+ j = c // 2',\n", + " '+ t = A * max(0, X - j) + B * max(0, Y - j) + C * c',\n", + " '+ if ans <= t:',\n", + " '- k += 1',\n", + " '+ ans = t',\n", + " '+ c += 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3021148317,\n", + " 'measured_runtime_v1': 0.1545656888,\n", + " 'runtime_lift': 1.9546047633,\n", + " 'key': ['s471284270', 's058926350']},\n", + " {'user_id': 'u775681539',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's986639109',\n", + " 'submission_id_v1': 's095330807',\n", + " 'cpu_time_v0': 186,\n", + " 'cpu_time_v1': 89,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 52.15,\n", + " 'input': '#python3\\n\\nINF = int(1e9)\\n\\ndef main():\\n\\n a, b, c, x, y = list(map(int, input().split()))\\n\\n ans = INF\\n\\n for i in range(2*10**5+100):\\n\\n t = 2*c*i + max(x-i, 0) * a + max(y-i, 0) * b\\n\\n ans = min(ans, t)\\n\\n print(ans)\\n\\nmain()',\n", + " 'target': 'INF = int(1e5)+5\\n\\n\\n\\ndef main():\\n\\n a, b, c, x, y = list(map(int, input().split()))\\n\\n ans = INF*INF\\n\\n for i in range(INF):\\n\\n tmp = 2*i*c + a*max(x-i, 0) + b*max(y-i, 0) \\n\\n ans = min(tmp, ans)\\n\\n print(ans)\\n\\nmain()\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 239,\n", + " 'code_v1_num_chars': 231,\n", + " 'code_v0_no_empty_lines': '# python3\\nINF = int(1e9)\\n\\n\\ndef main():\\n a, b, c, x, y = list(map(int, input().split()))\\n ans = INF\\n for i in range(2 * 10**5 + 100):\\n t = 2 * c * i + max(x - i, 0) * a + max(y - i, 0) * b\\n ans = min(ans, t)\\n print(ans)\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'INF = int(1e5) + 5\\n\\n\\ndef main():\\n a, b, c, x, y = list(map(int, input().split()))\\n ans = INF * INF\\n for i in range(INF):\\n tmp = 2 * i * c + a * max(x - i, 0) + b * max(y - i, 0)\\n ans = min(tmp, ans)\\n print(ans)\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-# python3',\n", + " '-INF = int(1e9)',\n", + " '+INF = int(1e5) + 5',\n", + " '- ans = INF',\n", + " '- for i in range(2 * 10**5 + 100):',\n", + " '- t = 2 * c * i + max(x - i, 0) * a + max(y - i, 0) * b',\n", + " '- ans = min(ans, t)',\n", + " '+ ans = INF * INF',\n", + " '+ for i in range(INF):',\n", + " '+ tmp = 2 * i * c + a * max(x - i, 0) + b * max(y - i, 0)',\n", + " '+ ans = min(tmp, ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3276309614,\n", + " 'measured_runtime_v1': 0.7168484554,\n", + " 'runtime_lift': 1.8520385325,\n", + " 'key': ['s986639109', 's095330807']},\n", + " {'user_id': 'u987846648',\n", + " 'problem_id': 'p02627',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's793826721',\n", + " 'submission_id_v1': 's875451520',\n", + " 'cpu_time_v0': 75,\n", + " 'cpu_time_v1': 67,\n", + " 'memory_v0': 61796,\n", + " 'memory_v1': 61608,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.67,\n", + " 'input': 'alph = eval(input())\\n\\nif alph.isupper():\\n\\n print(\"A\")\\n\\nelse:\\n\\n print(\"a\")\\n',\n", + " 'target': 'a = eval(input())\\n\\n\\n\\nif a.isupper():\\n\\n print(\"A\")\\n\\nelse:\\n\\n print(\"a\")',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 74,\n", + " 'code_v1_num_chars': 69,\n", + " 'code_v0_no_empty_lines': 'alph = eval(input())\\nif alph.isupper():\\n print(\"A\")\\nelse:\\n print(\"a\")\\n',\n", + " 'code_v1_no_empty_lines': 'a = eval(input())\\nif a.isupper():\\n print(\"A\")\\nelse:\\n print(\"a\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.6666666667,\n", + " 'diff': ['-alph = eval(input())',\n", + " '-if alph.isupper():',\n", + " '+a = eval(input())',\n", + " '+if a.isupper():'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1834881261,\n", + " 'measured_runtime_v1': 0.0064039894,\n", + " 'runtime_lift': 28.6521595413,\n", + " 'key': ['s793826721', 's875451520']},\n", + " {'user_id': 'u094191970',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's464229180',\n", + " 'submission_id_v1': 's820370642',\n", + " 'cpu_time_v0': 152,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12540,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.82,\n", + " 'input': 'import numpy as np\\n\\nimport itertools\\n\\n\\n\\nn, d = list(map(int, input().split()))\\n\\nx = [list(map(int, input().split())) for i in range(n)]\\n\\n\\n\\ncnt = 0\\n\\nfor i1, i2 in itertools.product(list(range(n)), list(range(n))):\\n\\n if i1 == i2:\\n\\n continue\\n\\n x1 = np.array(x[i1])\\n\\n x2 = np.array(x[i2])\\n\\n d = sum(list([x ** 2 for x in list(x1 - x2)])) ** 0.5\\n\\n if d == int(d):\\n\\n cnt += 1\\n\\n\\n\\nprint((int(cnt / 2)))',\n", + " 'target': 'n,d=list(map(int,input().split()))\\n\\nl=[list(map(int,input().split())) for i in range(n)]\\n\\n\\n\\ncnt=0\\n\\nfor i in range(n-1):\\n\\n for j in range(i+1,n):\\n\\n l1=l[i]\\n\\n l2=l[j]\\n\\n sum=0\\n\\n for y,z in zip(l1,l2):\\n\\n sum+=(y-z)**2\\n\\n dist=sum**0.5\\n\\n if dist==int(dist):\\n\\n cnt+=1\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 409,\n", + " 'code_v1_num_chars': 276,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport itertools\\n\\nn, d = list(map(int, input().split()))\\nx = [list(map(int, input().split())) for i in range(n)]\\ncnt = 0\\nfor i1, i2 in itertools.product(list(range(n)), list(range(n))):\\n if i1 == i2:\\n continue\\n x1 = np.array(x[i1])\\n x2 = np.array(x[i2])\\n d = sum(list([x**2 for x in list(x1 - x2)])) ** 0.5\\n if d == int(d):\\n cnt += 1\\nprint((int(cnt / 2)))\\n',\n", + " 'code_v1_no_empty_lines': 'n, d = list(map(int, input().split()))\\nl = [list(map(int, input().split())) for i in range(n)]\\ncnt = 0\\nfor i in range(n - 1):\\n for j in range(i + 1, n):\\n l1 = l[i]\\n l2 = l[j]\\n sum = 0\\n for y, z in zip(l1, l2):\\n sum += (y - z) ** 2\\n dist = sum**0.5\\n if dist == int(dist):\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.7647058824,\n", + " 'diff': ['-import numpy as np',\n", + " '-import itertools',\n", + " '-',\n", + " '-x = [list(map(int, input().split())) for i in range(n)]',\n", + " '+l = [list(map(int, input().split())) for i in range(n)]',\n", + " '-for i1, i2 in itertools.product(list(range(n)), list(range(n))):',\n", + " '- if i1 == i2:',\n", + " '- continue',\n", + " '- x1 = np.array(x[i1])',\n", + " '- x2 = np.array(x[i2])',\n", + " '- d = sum(list([x**2 for x in list(x1 - x2)])) ** 0.5',\n", + " '- if d == int(d):',\n", + " '- cnt += 1',\n", + " '-print((int(cnt / 2)))',\n", + " '+for i in range(n - 1):',\n", + " '+ for j in range(i + 1, n):',\n", + " '+ l1 = l[i]',\n", + " '+ l2 = l[j]',\n", + " '+ sum = 0',\n", + " '+ for y, z in zip(l1, l2):',\n", + " '+ sum += (y - z) ** 2',\n", + " '+ dist = sum**0.5',\n", + " '+ if dist == int(dist):',\n", + " '+ cnt += 1',\n", + " '+print(cnt)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3349185867,\n", + " 'measured_runtime_v1': 0.2063240778,\n", + " 'runtime_lift': 6.4700087387,\n", + " 'key': ['s464229180', 's820370642']},\n", + " {'user_id': 'u883040023',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's336365694',\n", + " 'submission_id_v1': 's043859026',\n", + " 'cpu_time_v0': 170,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 13596,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.0,\n", + " 'input': 'N , L = list(map(int , input().split()))\\n\\n\\n\\napple_taste = []\\n\\n\\n\\nfor i in range(N):\\n\\n taste = L + i + 1 - 1\\n\\n apple_taste.append(taste)\\n\\n \\n\\nimport numpy as np\\n\\n\\n\\nabs_apple_taste = np.abs(apple_taste)\\n\\nm = min(abs_apple_taste)\\n\\n\\n\\nfor j in range(N):\\n\\n if m == abs_apple_taste[j]:\\n\\n apple_taste.remove(apple_taste[j])\\n\\n\\n\\npie_taste = 0 \\n\\n\\n\\nfor k in range(N-1):\\n\\n pie_taste += apple_taste[k]\\n\\n \\n\\nprint(pie_taste)',\n", + " 'target': 'n,l = list(map(int,input().split()))\\n\\nans = l\\n\\neat = l\\n\\n\\n\\nfor i in range(n-1):\\n\\n l += 1\\n\\n ans += l\\n\\n \\n\\n if abs(l) < abs(eat):\\n\\n eat = l\\n\\n \\n\\nprint((ans-eat))',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 431,\n", + " 'code_v1_num_chars': 174,\n", + " 'code_v0_no_empty_lines': 'N, L = list(map(int, input().split()))\\napple_taste = []\\nfor i in range(N):\\n taste = L + i + 1 - 1\\n apple_taste.append(taste)\\nimport numpy as np\\n\\nabs_apple_taste = np.abs(apple_taste)\\nm = min(abs_apple_taste)\\nfor j in range(N):\\n if m == abs_apple_taste[j]:\\n apple_taste.remove(apple_taste[j])\\npie_taste = 0\\nfor k in range(N - 1):\\n pie_taste += apple_taste[k]\\nprint(pie_taste)\\n',\n", + " 'code_v1_no_empty_lines': 'n, l = list(map(int, input().split()))\\nans = l\\neat = l\\nfor i in range(n - 1):\\n l += 1\\n ans += l\\n if abs(l) < abs(eat):\\n eat = l\\nprint((ans - eat))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 47.8260869565,\n", + " 'diff': ['-N, L = list(map(int, input().split()))',\n", + " '-apple_taste = []',\n", + " '-for i in range(N):',\n", + " '- taste = L + i + 1 - 1',\n", + " '- apple_taste.append(taste)',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-abs_apple_taste = np.abs(apple_taste)',\n", + " '-m = min(abs_apple_taste)',\n", + " '-for j in range(N):',\n", + " '- if m == abs_apple_taste[j]:',\n", + " '- apple_taste.remove(apple_taste[j])',\n", + " '-pie_taste = 0',\n", + " '-for k in range(N - 1):',\n", + " '- pie_taste += apple_taste[k]',\n", + " '-print(pie_taste)',\n", + " '+n, l = list(map(int, input().split()))',\n", + " '+ans = l',\n", + " '+eat = l',\n", + " '+for i in range(n - 1):',\n", + " '+ l += 1',\n", + " '+ ans += l',\n", + " '+ if abs(l) < abs(eat):',\n", + " '+ eat = l',\n", + " '+print((ans - eat))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8756559513,\n", + " 'measured_runtime_v1': 0.2713351281,\n", + " 'runtime_lift': 6.9126911968,\n", + " 'key': ['s336365694', 's043859026']},\n", + " {'user_id': 'u775681539',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's313172456',\n", + " 'submission_id_v1': 's731114638',\n", + " 'cpu_time_v0': 533,\n", + " 'cpu_time_v1': 247,\n", + " 'memory_v0': 3444,\n", + " 'memory_v1': 40556,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 53.66,\n", + " 'input': \"#python3\\n\\nfrom collections import defaultdict\\n\\nfrom collections import namedtuple\\n\\n\\n\\nP = namedtuple('P', ['front', 'end'])\\n\\n\\n\\ndef f(x):\\n\\n return P(str(x)[0], str(x)[-1]) \\n\\n\\n\\ndef main():\\n\\n\\n\\n n = int(eval(input()))\\n\\n freq = defaultdict(int)\\n\\n\\n\\n for i in range(1, n+1):\\n\\n p = f(i)\\n\\n freq[p]+=1\\n\\n\\n\\n\\n\\n ans = 0\\n\\n for i in range(1, n + 1):\\n\\n p = f(i)\\n\\n q = (p.end, p.front)\\n\\n ans += freq[q]\\n\\n\\n\\n print(ans)\\n\\n\\n\\nmain()\",\n", + " 'target': \"import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nfrom collections import defaultdict\\n\\n\\n\\ndef f(x):\\n\\n return (int(str(x)[0]), int(str(x)[-1])) \\n\\ndef main():\\n\\n N = int(readline())\\n\\n df = defaultdict(int)\\n\\n for i in range(1, N+1):\\n\\n df[f(i)] += 1\\n\\n ans = 0\\n\\n for i in range(1, 10):\\n\\n for j in range(1, 10):\\n\\n ans += df[(i, j)]*df[(j, i)]\\n\\n print(ans)\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 458,\n", + " 'code_v1_num_chars': 507,\n", + " 'code_v0_no_empty_lines': '# python3\\nfrom collections import defaultdict\\nfrom collections import namedtuple\\n\\nP = namedtuple(\"P\", [\"front\", \"end\"])\\n\\n\\ndef f(x):\\n return P(str(x)[0], str(x)[-1])\\n\\n\\ndef main():\\n n = int(eval(input()))\\n freq = defaultdict(int)\\n for i in range(1, n + 1):\\n p = f(i)\\n freq[p] += 1\\n ans = 0\\n for i in range(1, n + 1):\\n p = f(i)\\n q = (p.end, p.front)\\n ans += freq[q]\\n print(ans)\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nfrom collections import defaultdict\\n\\n\\ndef f(x):\\n return (int(str(x)[0]), int(str(x)[-1]))\\n\\n\\ndef main():\\n N = int(readline())\\n df = defaultdict(int)\\n for i in range(1, N + 1):\\n df[f(i)] += 1\\n ans = 0\\n for i in range(1, 10):\\n for j in range(1, 10):\\n ans += df[(i, j)] * df[(j, i)]\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-# python3',\n", + " '+import sys',\n", + " '+',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '-from collections import namedtuple',\n", + " '-',\n", + " '-P = namedtuple(\"P\", [\"front\", \"end\"])',\n", + " '- return P(str(x)[0], str(x)[-1])',\n", + " '+ return (int(str(x)[0]), int(str(x)[-1]))',\n", + " '- n = int(eval(input()))',\n", + " '- freq = defaultdict(int)',\n", + " '- for i in range(1, n + 1):',\n", + " '- p = f(i)',\n", + " '- freq[p] += 1',\n", + " '+ N = int(readline())',\n", + " '+ df = defaultdict(int)',\n", + " '+ for i in range(1, N + 1):',\n", + " '+ df[f(i)] += 1',\n", + " '- for i in range(1, n + 1):',\n", + " '- p = f(i)',\n", + " '- q = (p.end, p.front)',\n", + " '- ans += freq[q]',\n", + " '+ for i in range(1, 10):',\n", + " '+ for j in range(1, 10):',\n", + " '+ ans += df[(i, j)] * df[(j, i)]',\n", + " '-main()',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4672443939,\n", + " 'measured_runtime_v1': 0.3355342689,\n", + " 'runtime_lift': 1.3925385189,\n", + " 'key': ['s313172456', 's731114638']},\n", + " {'user_id': 'u624475441',\n", + " 'problem_id': 'p03548',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's161926153',\n", + " 'submission_id_v1': 's067842786',\n", + " 'cpu_time_v0': 36,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': 'X, Y, Z = list(map(int, input().split()))\\n\\nfor n in range(10 ** 5, 0, -1):\\n\\n if X >= n * (Y + Z) + Z:\\n\\n break\\n\\nprint(n)',\n", + " 'target': 'X, Y, Z = list(map(int, input().split()))\\n\\nprint(((X - Z) // (Y + Z)))',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 2,\n", + " 'code_v0_num_chars': 123,\n", + " 'code_v1_num_chars': 62,\n", + " 'code_v0_no_empty_lines': 'X, Y, Z = list(map(int, input().split()))\\nfor n in range(10**5, 0, -1):\\n if X >= n * (Y + Z) + Z:\\n break\\nprint(n)\\n',\n", + " 'code_v1_no_empty_lines': 'X, Y, Z = list(map(int, input().split()))\\nprint(((X - Z) // (Y + Z)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 60.0,\n", + " 'diff': ['-for n in range(10**5, 0, -1):',\n", + " '- if X >= n * (Y + Z) + Z:',\n", + " '- break',\n", + " '-print(n)',\n", + " '+print(((X - Z) // (Y + Z)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4167550103,\n", + " 'measured_runtime_v1': 0.2488601058,\n", + " 'runtime_lift': 1.6746557624,\n", + " 'key': ['s161926153', 's067842786']},\n", + " {'user_id': 'u761529120',\n", + " 'problem_id': 'p03806',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's948329967',\n", + " 'submission_id_v1': 's910945254',\n", + " 'cpu_time_v0': 1465,\n", + " 'cpu_time_v1': 943,\n", + " 'memory_v0': 59504,\n", + " 'memory_v1': 59504,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.63,\n", + " 'input': 'N,Ma,Mb = list(map(int, input().split()))\\n\\narr=[list(map(int,input().split())) for _ in range(N)]\\n\\ndp=[[[5000]*401 for _ in range(401)] for _ in range(41)]\\n\\ndp[0][0][0] = 0\\n\\nfor i in range(N):\\n\\n a,b,c=arr[i]\\n\\n for j in range(10*N+1):\\n\\n for k in range(10*N+1):\\n\\n if dp[i][j][k] == 5000:\\n\\n continue\\n\\n dp[i+1][j][k]=min(dp[i+1][j][k],dp[i][j][k])\\n\\n dp[i+1][j+a][k+b]=min(dp[i+1][j+a][k+b],dp[i][j][k]+c)\\n\\n\\n\\nans=5000\\n\\nfor i in range(1,401):\\n\\n if i*Ma>400 or i*Mb>400:\\n\\n break\\n\\n ans = min(ans, dp[N][i*Ma][i*Mb])\\n\\nif ans == 5000:\\n\\n print((-1))\\n\\nelse:\\n\\n print(ans)',\n", + " 'target': 'def calc():\\n\\n N,Ma,Mb = list(map(int, input().split()))\\n\\n arr=[list(map(int,input().split())) for _ in range(N)]\\n\\n dp=[[[5000]*401 for _ in range(401)] for _ in range(41)]\\n\\n dp[0][0][0] = 0\\n\\n for i in range(N):\\n\\n a,b,c=arr[i]\\n\\n for j in range(10*N+1):\\n\\n for k in range(10*N+1):\\n\\n if dp[i][j][k] == 5000:\\n\\n continue\\n\\n dp[i+1][j][k]=min(dp[i+1][j][k],dp[i][j][k])\\n\\n dp[i+1][j+a][k+b]=min(dp[i+1][j+a][k+b],dp[i][j][k]+c)\\n\\n\\n\\n ans=5000\\n\\n for i in range(1,401):\\n\\n if i*Ma>400 or i*Mb>400:\\n\\n break\\n\\n ans = min(ans, dp[N][i*Ma][i*Mb])\\n\\n if ans == 5000:\\n\\n print((-1))\\n\\n else:\\n\\n print(ans)\\n\\n\\n\\ncalc()',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 642,\n", + " 'code_v1_num_chars': 749,\n", + " 'code_v0_no_empty_lines': 'N, Ma, Mb = list(map(int, input().split()))\\narr = [list(map(int, input().split())) for _ in range(N)]\\ndp = [[[5000] * 401 for _ in range(401)] for _ in range(41)]\\ndp[0][0][0] = 0\\nfor i in range(N):\\n a, b, c = arr[i]\\n for j in range(10 * N + 1):\\n for k in range(10 * N + 1):\\n if dp[i][j][k] == 5000:\\n continue\\n dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k])\\n dp[i + 1][j + a][k + b] = min(dp[i + 1][j + a][k + b], dp[i][j][k] + c)\\nans = 5000\\nfor i in range(1, 401):\\n if i * Ma > 400 or i * Mb > 400:\\n break\\n ans = min(ans, dp[N][i * Ma][i * Mb])\\nif ans == 5000:\\n print((-1))\\nelse:\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def calc():\\n N, Ma, Mb = list(map(int, input().split()))\\n arr = [list(map(int, input().split())) for _ in range(N)]\\n dp = [[[5000] * 401 for _ in range(401)] for _ in range(41)]\\n dp[0][0][0] = 0\\n for i in range(N):\\n a, b, c = arr[i]\\n for j in range(10 * N + 1):\\n for k in range(10 * N + 1):\\n if dp[i][j][k] == 5000:\\n continue\\n dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k])\\n dp[i + 1][j + a][k + b] = min(dp[i + 1][j + a][k + b], dp[i][j][k] + c)\\n ans = 5000\\n for i in range(1, 401):\\n if i * Ma > 400 or i * Mb > 400:\\n break\\n ans = min(ans, dp[N][i * Ma][i * Mb])\\n if ans == 5000:\\n print((-1))\\n else:\\n print(ans)\\n\\n\\ncalc()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.0,\n", + " 'diff': ['-N, Ma, Mb = list(map(int, input().split()))',\n", + " '-arr = [list(map(int, input().split())) for _ in range(N)]',\n", + " '-dp = [[[5000] * 401 for _ in range(401)] for _ in range(41)]',\n", + " '-dp[0][0][0] = 0',\n", + " '-for i in range(N):',\n", + " '- a, b, c = arr[i]',\n", + " '- for j in range(10 * N + 1):',\n", + " '- for k in range(10 * N + 1):',\n", + " '- if dp[i][j][k] == 5000:',\n", + " '- continue',\n", + " '- dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k])',\n", + " '- dp[i + 1][j + a][k + b] = min(dp[i + 1][j + a][k + b], dp[i][j][k] + c)',\n", + " '-ans = 5000',\n", + " '-for i in range(1, 401):',\n", + " '- if i * Ma > 400 or i * Mb > 400:',\n", + " '- break',\n", + " '- ans = min(ans, dp[N][i * Ma][i * Mb])',\n", + " '-if ans == 5000:',\n", + " '- print((-1))',\n", + " '-else:',\n", + " '- print(ans)',\n", + " '+def calc():',\n", + " '+ N, Ma, Mb = list(map(int, input().split()))',\n", + " '+ arr = [list(map(int, input().split())) for _ in range(N)]',\n", + " '+ dp = [[[5000] * 401 for _ in range(401)] for _ in range(41)]',\n", + " '+ dp[0][0][0] = 0',\n", + " '+ for i in range(N):',\n", + " '+ a, b, c = arr[i]',\n", + " '+ for j in range(10 * N + 1):',\n", + " '+ for k in range(10 * N + 1):',\n", + " '+ if dp[i][j][k] == 5000:',\n", + " '+ continue',\n", + " '+ dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k])',\n", + " '+ dp[i + 1][j + a][k + b] = min(dp[i + 1][j + a][k + b], dp[i][j][k] + c)',\n", + " '+ ans = 5000',\n", + " '+ for i in range(1, 401):',\n", + " '+ if i * Ma > 400 or i * Mb > 400:',\n", + " '+ break',\n", + " '+ ans = min(ans, dp[N][i * Ma][i * Mb])',\n", + " '+ if ans == 5000:',\n", + " '+ print((-1))',\n", + " '+ else:',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+calc()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7420692999,\n", + " 'measured_runtime_v1': 1.3671779791,\n", + " 'runtime_lift': 1.2742081328,\n", + " 'key': ['s948329967', 's910945254']},\n", + " {'user_id': 'u247830763',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's099094742',\n", + " 'submission_id_v1': 's047523250',\n", + " 'cpu_time_v0': 119,\n", + " 'cpu_time_v1': 62,\n", + " 'memory_v0': 9192,\n", + " 'memory_v1': 63452,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 47.9,\n", + " 'input': 'n = int(eval(input()))\\n\\nmx = n//3\\n\\nans = 0\\n\\nmod = 10**9+7\\n\\nimport math\\n\\ndef combinations_count(n, r): #組み合わせ(nCr)\\n\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\nfor i in range(1,mx+1):\\n\\n if i == 1:\\n\\n ans += 1\\n\\n else:\\n\\n ans += combinations_count(n-2*i-1,i-1) % mod\\n\\nprint((ans%mod))',\n", + " 'target': 's = int(eval(input()))\\n\\ndp = [0]*(2001)\\n\\ndp[3] = 1\\n\\nmod = 10**9+7\\n\\nfor i in range(4,s+1):\\n\\n dp[i] = (dp[i-1] + dp[i-3]) % mod\\n\\nprint((dp[s]))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 324,\n", + " 'code_v1_num_chars': 136,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nmx = n // 3\\nans = 0\\nmod = 10**9 + 7\\nimport math\\n\\n\\ndef combinations_count(n, r): # 組み合わせ(nCr)\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\n\\nfor i in range(1, mx + 1):\\n if i == 1:\\n ans += 1\\n else:\\n ans += combinations_count(n - 2 * i - 1, i - 1) % mod\\nprint((ans % mod))\\n',\n", + " 'code_v1_no_empty_lines': 's = int(eval(input()))\\ndp = [0] * (2001)\\ndp[3] = 1\\nmod = 10**9 + 7\\nfor i in range(4, s + 1):\\n dp[i] = (dp[i - 1] + dp[i - 3]) % mod\\nprint((dp[s]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 46.1538461538,\n", + " 'diff': ['-n = int(eval(input()))',\n", + " '-mx = n // 3',\n", + " '-ans = 0',\n", + " '+s = int(eval(input()))',\n", + " '+dp = [0] * (2001)',\n", + " '+dp[3] = 1',\n", + " '-import math',\n", + " '-',\n", + " '-',\n", + " '-def combinations_count(n, r): # 組み合わせ(nCr)',\n", + " '- return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))',\n", + " '-',\n", + " '-',\n", + " '-for i in range(1, mx + 1):',\n", + " '- if i == 1:',\n", + " '- ans += 1',\n", + " '- else:',\n", + " '- ans += combinations_count(n - 2 * i - 1, i - 1) % mod',\n", + " '-print((ans % mod))',\n", + " '+for i in range(4, s + 1):',\n", + " '+ dp[i] = (dp[i - 1] + dp[i - 3]) % mod',\n", + " '+print((dp[s]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2684851468,\n", + " 'measured_runtime_v1': 0.2075273387,\n", + " 'runtime_lift': 1.2937338684,\n", + " 'key': ['s099094742', 's047523250']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03254',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's442957356',\n", + " 'submission_id_v1': 's444535945',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 14444,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.92,\n", + " 'input': 'import numpy as np\\n\\nN,x = list(map(int,input().split()))\\n\\nA = np.array(input().split(), dtype = np.int64)\\n\\nA.sort()\\n\\nnp.cumsum(A, out = A)\\n\\nanswer = (A <= x).sum()\\n\\n\\n\\nif answer == N and A[-1] != x:\\n\\n answer -= 1\\n\\nprint(answer)\\n',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nfrom bisect import bisect_right\\n\\nimport itertools\\n\\n\\n\\nN,X,*A = list(map(int,read().split()))\\n\\n\\n\\nA.sort()\\n\\nAcum = list(itertools.accumulate(A))\\n\\n\\n\\nanswer = bisect_right(Acum,X)\\n\\nif answer == N:\\n\\n if Acum[-1] < X:\\n\\n answer -= 1\\n\\nprint(answer)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 222,\n", + " 'code_v1_num_chars': 365,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, x = list(map(int, input().split()))\\nA = np.array(input().split(), dtype=np.int64)\\nA.sort()\\nnp.cumsum(A, out=A)\\nanswer = (A <= x).sum()\\nif answer == N and A[-1] != x:\\n answer -= 1\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nfrom bisect import bisect_right\\nimport itertools\\n\\nN, X, *A = list(map(int, read().split()))\\nA.sort()\\nAcum = list(itertools.accumulate(A))\\nanswer = bisect_right(Acum, X)\\nif answer == N:\\n if Acum[-1] < X:\\n answer -= 1\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 44.4444444444,\n", + " 'diff': ['-import numpy as np',\n", + " '+import sys',\n", + " '-N, x = list(map(int, input().split()))',\n", + " '-A = np.array(input().split(), dtype=np.int64)',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '+from bisect import bisect_right',\n", + " '+import itertools',\n", + " '+',\n", + " '+N, X, *A = list(map(int, read().split()))',\n", + " '-np.cumsum(A, out=A)',\n", + " '-answer = (A <= x).sum()',\n", + " '-if answer == N and A[-1] != x:',\n", + " '- answer -= 1',\n", + " '+Acum = list(itertools.accumulate(A))',\n", + " '+answer = bisect_right(Acum, X)',\n", + " '+if answer == N:',\n", + " '+ if Acum[-1] < X:',\n", + " '+ answer -= 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3272022178,\n", + " 'measured_runtime_v1': 0.2483567362,\n", + " 'runtime_lift': 5.3439348502,\n", + " 'key': ['s442957356', 's444535945']},\n", + " {'user_id': 'u127499732',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's031191514',\n", + " 'submission_id_v1': 's488102802',\n", + " 'cpu_time_v0': 214,\n", + " 'cpu_time_v1': 169,\n", + " 'memory_v0': 27212,\n", + " 'memory_v1': 25180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.03,\n", + " 'input': \"def main():\\n\\n from statistics import median\\n\\n\\n\\n n, *a, = list(map(int, open(0).read().split()))\\n\\n a = [x - i for i, x in enumerate(a, 1)]\\n\\n a.sort()\\n\\n m = int(median(a))\\n\\n\\n\\n ans = sum([abs(x - m) for x in a])\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"def main():\\n\\n n, *a, = list(map(int, open(0).read().split()))\\n\\n a = [x - i for i, x in enumerate(a, 1)]\\n\\n a.sort()\\n\\n if n % 2 == 0:\\n\\n ans = sum(a[n // 2:]) - sum(a[:n // 2])\\n\\n else:\\n\\n ans = sum(a[n // 2 + 1:]) - sum(a[:n // 2])\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 281,\n", + " 'code_v1_num_chars': 311,\n", + " 'code_v0_no_empty_lines': 'def main():\\n from statistics import median\\n\\n (\\n n,\\n *a,\\n ) = list(map(int, open(0).read().split()))\\n a = [x - i for i, x in enumerate(a, 1)]\\n a.sort()\\n m = int(median(a))\\n ans = sum([abs(x - m) for x in a])\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n (\\n n,\\n *a,\\n ) = list(map(int, open(0).read().split()))\\n a = [x - i for i, x in enumerate(a, 1)]\\n a.sort()\\n if n % 2 == 0:\\n ans = sum(a[n // 2 :]) - sum(a[: n // 2])\\n else:\\n ans = sum(a[n // 2 + 1 :]) - sum(a[: n // 2])\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.1428571429,\n", + " 'diff': ['- from statistics import median',\n", + " '-',\n", + " '- m = int(median(a))',\n", + " '- ans = sum([abs(x - m) for x in a])',\n", + " '+ if n % 2 == 0:',\n", + " '+ ans = sum(a[n // 2 :]) - sum(a[: n // 2])',\n", + " '+ else:',\n", + " '+ ans = sum(a[n // 2 + 1 :]) - sum(a[: n // 2])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2784859991,\n", + " 'measured_runtime_v1': 0.2092100859,\n", + " 'runtime_lift': 1.3311308484,\n", + " 'key': ['s031191514', 's488102802']},\n", + " {'user_id': 'u222668979',\n", + " 'problem_id': 'p02552',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's235847366',\n", + " 'submission_id_v1': 's896909207',\n", + " 'cpu_time_v0': 81,\n", + " 'cpu_time_v1': 70,\n", + " 'memory_v0': 61596,\n", + " 'memory_v1': 61788,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.58,\n", + " 'input': 'n = int(eval(input()))\\n\\nprint((1 if n == 0 else 0))\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\nprint((0 if n else 1))\\n',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 2,\n", + " 'code_v0_num_chars': 44,\n", + " 'code_v1_num_chars': 39,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nprint((1 if n == 0 else 0))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nprint((0 if n else 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-print((1 if n == 0 else 0))', '+print((0 if n else 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.340472885,\n", + " 'measured_runtime_v1': 0.2658090671,\n", + " 'runtime_lift': 1.2808926674,\n", + " 'key': ['s235847366', 's896909207']},\n", + " {'user_id': 'u813098295',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's187757761',\n", + " 'submission_id_v1': 's900380040',\n", + " 'cpu_time_v0': 568,\n", + " 'cpu_time_v1': 432,\n", + " 'memory_v0': 111624,\n", + " 'memory_v1': 111624,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.94,\n", + " 'input': 'class SegmentTree:\\n\\n seg_len = 1\\n\\n node = []\\n\\n def __init__(self, n):\\n\\n while self.seg_len < n:\\n\\n self.seg_len <<= 1\\n\\n self.node = [ 0 for _ in range(self.seg_len*2) ]\\n\\n\\n\\n def add(self, idx, v):\\n\\n idx += self.seg_len\\n\\n self.node[idx] += v\\n\\n while True:\\n\\n idx //= 2\\n\\n if idx == 0:\\n\\n break\\n\\n self.node[idx] = self.node[idx*2] + self.node[idx*2+1]\\n\\n\\n\\n def sum(self, l, r):\\n\\n l += self.seg_len\\n\\n r += self.seg_len\\n\\n ret = 0\\n\\n while l < r:\\n\\n if l & 1 == 1:\\n\\n ret += self.node[l]\\n\\n l += 1\\n\\n if r & 1 == 1:\\n\\n ret += self.node[r-1]\\n\\n r -= 1\\n\\n l //= 2; r //= 2;\\n\\n return ret\\n\\n\\n\\n\\n\\nn, k = list(map(int, input().split()))\\n\\np = [ int(x) for x in input().split() ]\\n\\n\\n\\nseg_tree = SegmentTree(n)\\n\\nfor i in range(n):\\n\\n seg_tree.add(i, (1+p[i])/2)\\n\\n\\n\\nans = 0\\n\\nfor i in range(n-k+1):\\n\\n ans = max(ans, seg_tree.sum(i, i+k))\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'class SegmentTree:\\n\\n seg_len = 1\\n\\n node = []\\n\\n def __init__(self, n):\\n\\n while self.seg_len < n:\\n\\n self.seg_len <<= 1\\n\\n self.node = [ 0 for _ in range(self.seg_len*2) ]\\n\\n\\n\\n def add(self, idx, v):\\n\\n idx += self.seg_len\\n\\n self.node[idx] += v\\n\\n while True:\\n\\n idx >>= 1\\n\\n if idx == 0:\\n\\n break\\n\\n self.node[idx] = self.node[idx*2] + self.node[idx*2+1]\\n\\n\\n\\n def sum(self, l, r):\\n\\n l += self.seg_len\\n\\n r += self.seg_len\\n\\n ret = 0\\n\\n while l < r:\\n\\n if l & 1 == 1:\\n\\n ret += self.node[l]\\n\\n l += 1\\n\\n if r & 1 == 1:\\n\\n ret += self.node[r-1]\\n\\n r -= 1\\n\\n l >>= 1; r >>= 1;\\n\\n return ret\\n\\n\\n\\n\\n\\nn, k = list(map(int, input().split()))\\n\\np = [ int(x) for x in input().split() ]\\n\\n\\n\\nseg_tree = SegmentTree(n)\\n\\nfor i in range(n):\\n\\n seg_tree.add(i, (1+p[i])/2)\\n\\n\\n\\nans = 0\\n\\nfor i in range(n-k+1):\\n\\n ans = max(ans, seg_tree.sum(i, i+k))\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 44,\n", + " 'code_v0_num_chars': 1055,\n", + " 'code_v1_num_chars': 1055,\n", + " 'code_v0_no_empty_lines': 'class SegmentTree:\\n seg_len = 1\\n node = []\\n\\n def __init__(self, n):\\n while self.seg_len < n:\\n self.seg_len <<= 1\\n self.node = [0 for _ in range(self.seg_len * 2)]\\n\\n def add(self, idx, v):\\n idx += self.seg_len\\n self.node[idx] += v\\n while True:\\n idx //= 2\\n if idx == 0:\\n break\\n self.node[idx] = self.node[idx * 2] + self.node[idx * 2 + 1]\\n\\n def sum(self, l, r):\\n l += self.seg_len\\n r += self.seg_len\\n ret = 0\\n while l < r:\\n if l & 1 == 1:\\n ret += self.node[l]\\n l += 1\\n if r & 1 == 1:\\n ret += self.node[r - 1]\\n r -= 1\\n l //= 2\\n r //= 2\\n return ret\\n\\n\\nn, k = list(map(int, input().split()))\\np = [int(x) for x in input().split()]\\nseg_tree = SegmentTree(n)\\nfor i in range(n):\\n seg_tree.add(i, (1 + p[i]) / 2)\\nans = 0\\nfor i in range(n - k + 1):\\n ans = max(ans, seg_tree.sum(i, i + k))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'class SegmentTree:\\n seg_len = 1\\n node = []\\n\\n def __init__(self, n):\\n while self.seg_len < n:\\n self.seg_len <<= 1\\n self.node = [0 for _ in range(self.seg_len * 2)]\\n\\n def add(self, idx, v):\\n idx += self.seg_len\\n self.node[idx] += v\\n while True:\\n idx >>= 1\\n if idx == 0:\\n break\\n self.node[idx] = self.node[idx * 2] + self.node[idx * 2 + 1]\\n\\n def sum(self, l, r):\\n l += self.seg_len\\n r += self.seg_len\\n ret = 0\\n while l < r:\\n if l & 1 == 1:\\n ret += self.node[l]\\n l += 1\\n if r & 1 == 1:\\n ret += self.node[r - 1]\\n r -= 1\\n l >>= 1\\n r >>= 1\\n return ret\\n\\n\\nn, k = list(map(int, input().split()))\\np = [int(x) for x in input().split()]\\nseg_tree = SegmentTree(n)\\nfor i in range(n):\\n seg_tree.add(i, (1 + p[i]) / 2)\\nans = 0\\nfor i in range(n - k + 1):\\n ans = max(ans, seg_tree.sum(i, i + k))\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- idx //= 2',\n", + " '+ idx >>= 1',\n", + " '- l //= 2',\n", + " '- r //= 2',\n", + " '+ l >>= 1',\n", + " '+ r >>= 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3662393868,\n", + " 'measured_runtime_v1': 0.2843342848,\n", + " 'runtime_lift': 1.2880591838,\n", + " 'key': ['s187757761', 's900380040']},\n", + " {'user_id': 'u556594202',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's386053727',\n", + " 'submission_id_v1': 's802119805',\n", + " 'cpu_time_v0': 120,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 27180,\n", + " 'memory_v1': 9224,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.17,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn = int(eval(input()))\\n\\na = np.array(list(map(int,input().split())))\\n\\n\\n\\ncount = 0\\n\\nwhile np.all(a%2==0):\\n\\n count+=1\\n\\n a=a/2\\n\\nprint(count)\\n',\n", + " 'target': 'N=int(eval(input()))\\n\\na = [int(i) for i in input().split()]\\n\\n\\n\\ncount=0\\n\\nwhile 1:\\n\\n if sum([i%2 for i in a]) == 0:\\n\\n a = [i/2 for i in a]\\n\\n count=count+1\\n\\n else:\\n\\n print(count)\\n\\n break\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 160,\n", + " 'code_v1_num_chars': 212,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\na = np.array(list(map(int, input().split())))\\ncount = 0\\nwhile np.all(a % 2 == 0):\\n count += 1\\n a = a / 2\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\na = [int(i) for i in input().split()]\\ncount = 0\\nwhile 1:\\n if sum([i % 2 for i in a]) == 0:\\n a = [i / 2 for i in a]\\n count = count + 1\\n else:\\n print(count)\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-n = int(eval(input()))',\n", + " '-a = np.array(list(map(int, input().split())))',\n", + " '+N = int(eval(input()))',\n", + " '+a = [int(i) for i in input().split()]',\n", + " '-while np.all(a % 2 == 0):',\n", + " '- count += 1',\n", + " '- a = a / 2',\n", + " '-print(count)',\n", + " '+while 1:',\n", + " '+ if sum([i % 2 for i in a]) == 0:',\n", + " '+ a = [i / 2 for i in a]',\n", + " '+ count = count + 1',\n", + " '+ else:',\n", + " '+ print(count)',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1324696655,\n", + " 'measured_runtime_v1': 0.2760572641,\n", + " 'runtime_lift': 7.7247366501,\n", + " 'key': ['s386053727', 's802119805']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p02983',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's140577970',\n", + " 'submission_id_v1': 's371672772',\n", + " 'cpu_time_v0': 591,\n", + " 'cpu_time_v1': 74,\n", + " 'memory_v0': 40556,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.48,\n", + " 'input': 'l,r=list(map(int,input().split()))\\n\\ns=list(range(l,r+1))[:2019]\\n\\nprint((min(i*j%2019for i in s for j in s if i672:\\n\\n\\tp=0\\n\\nelse:\\n\\n\\tp=2019\\n\\n\\tfor i in range(l, r):\\n\\n\\t\\tfor j in range(i+1, r+1):\\n\\n\\t\\t\\tp=min(p, (((i%2019)*(j%2019))%2019))\\n\\n\\t\\t\\tif not p:\\n\\n\\t\\t\\t\\tbreak\\n\\n\\t\\tif not p:\\n\\n\\t\\t\\tbreak\\n\\nprint(p)',\n", + " 'target': 'l, r=list(map(int, input().split()))\\n\\nif r-l>672:\\n\\n\\tp=0\\n\\nelse:\\n\\n\\tp=2019\\n\\n\\tfor i in range(l, r):\\n\\n\\t\\tfor j in range(i+1, r+1):\\n\\n\\t\\t\\tp=min(p, (i*j%2019))\\n\\n\\t\\t\\tif not p:\\n\\n\\t\\t\\t\\tbreak\\n\\n\\t\\tif not p:\\n\\n\\t\\t\\tbreak\\n\\nprint(p)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 217,\n", + " 'code_v1_num_chars': 201,\n", + " 'code_v0_no_empty_lines': 'l, r = list(map(int, input().split()))\\nif r - l > 672:\\n p = 0\\nelse:\\n p = 2019\\n for i in range(l, r):\\n for j in range(i + 1, r + 1):\\n p = min(p, (((i % 2019) * (j % 2019)) % 2019))\\n if not p:\\n break\\n if not p:\\n break\\nprint(p)\\n',\n", + " 'code_v1_no_empty_lines': 'l, r = list(map(int, input().split()))\\nif r - l > 672:\\n p = 0\\nelse:\\n p = 2019\\n for i in range(l, r):\\n for j in range(i + 1, r + 1):\\n p = min(p, (i * j % 2019))\\n if not p:\\n break\\n if not p:\\n break\\nprint(p)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- p = min(p, (((i % 2019) * (j % 2019)) % 2019))',\n", + " '+ p = min(p, (i * j % 2019))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3854847456,\n", + " 'measured_runtime_v1': 0.191389215,\n", + " 'runtime_lift': 2.0141403766,\n", + " 'key': ['s965697641', 's560038811']},\n", + " {'user_id': 'u282228874',\n", + " 'problem_id': 'p03293',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's664706993',\n", + " 'submission_id_v1': 's616247709',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': \"s = eval(input())\\n\\nt = eval(input())\\n\\nfor i in range(len(s)):\\n\\n if s[i:]+s[:i]==t:\\n\\n print('Yes')\\n\\n exit()\\n\\nprint('No')\",\n", + " 'target': 's = eval(input())\\n\\nt = eval(input())\\n\\n\\n\\nfor i in range(len(s)):\\n\\n s = s[1:] + s[0]\\n\\n if s == t:\\n\\n print(\"Yes\")\\n\\n exit()\\n\\nprint(\"No\")',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 144,\n", + " 'code_v1_num_chars': 140,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\nt = eval(input())\\nfor i in range(len(s)):\\n if s[i:] + s[:i] == t:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nt = eval(input())\\nfor i in range(len(s)):\\n s = s[1:] + s[0]\\n if s == t:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['- if s[i:] + s[:i] == t:',\n", + " '+ s = s[1:] + s[0]',\n", + " '+ if s == t:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1894659722,\n", + " 'measured_runtime_v1': 0.0060859642,\n", + " 'runtime_lift': 31.1316277188,\n", + " 'key': ['s664706993', 's616247709']},\n", + " {'user_id': 'u179169725',\n", + " 'problem_id': 'p02574',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's667619941',\n", + " 'submission_id_v1': 's202036773',\n", + " 'cpu_time_v0': 600,\n", + " 'cpu_time_v1': 355,\n", + " 'memory_v0': 203704,\n", + " 'memory_v1': 215292,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.83,\n", + " 'input': \"import sys\\n\\nsys.setrecursionlimit(1 << 25)\\n\\nreadline = sys.stdin.buffer.readline\\n\\nread = sys.stdin.readline # 文字列読み込む時はこっち\\n\\nra = range\\n\\nenu = enumerate\\n\\n\\n\\n\\n\\ndef exit(*argv, **kwarg):\\n\\n print(*argv, **kwarg)\\n\\n sys.exit()\\n\\n\\n\\n\\n\\ndef mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))\\n\\n# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと\\n\\n\\n\\n\\n\\ndef a_int(): return int(readline())\\n\\n\\n\\n\\n\\ndef ints(): return list(map(int, readline().split()))\\n\\n\\n\\n\\n\\ndef _make_minimum_prime(N: int):\\n\\n # xの最小の素因数表を作成\\n\\n min_prime = [x for x in range(N + 1)]\\n\\n # min_prime[0] = 0 # 0と1は素数ではない\\n\\n # min_prime[1] = 1\\n\\n for i in range(2, int(N ** 0.5) + 1):\\n\\n if min_prime[i] == i: # 素数だったら更新\\n\\n for j in range(2 * i, N + 1, i): # iの倍数は素数でない\\n\\n if min_prime[j] == j:\\n\\n min_prime[j] = i\\n\\n return min_prime\\n\\n\\n\\n\\n\\nmin_prime = _make_minimum_prime(10**6)\\n\\n\\n\\n\\n\\nfrom collections import Counter\\n\\n\\n\\n\\n\\ndef fast_factorization(N: int):\\n\\n # -> List[Tuple[int,int]] (素数,冪数)を格納\\n\\n # 最小素数配列min_primeを使ってO(log N)で因数分解\\n\\n if N == 1:\\n\\n return Counter() # 1は素数ではない\\n\\n # 素因数分解\\n\\n arr = []\\n\\n tmp = N\\n\\n while tmp != 1:\\n\\n p = min_prime[tmp]\\n\\n tmp //= p\\n\\n arr.append(p)\\n\\n\\n\\n return Counter(arr)\\n\\n\\n\\n\\n\\nMOD = 10**9 + 7\\n\\nINF = 2**31 # 2147483648 > 10**9\\n\\n# default import\\n\\nfrom collections import defaultdict, Counter, deque\\n\\nimport random\\n\\nfrom math import gcd\\n\\n\\n\\n\\n\\nN = a_int()\\n\\nA = ints()\\n\\nrandom.shuffle(A)\\n\\n\\n\\n# setかはすぐわかる\\n\\n# setでなければ not coprime\\n\\n# pairは互いに素かをみればいいのか\\n\\n# つまり因数分解して足してったときにすべての素数のべき数が1以下であれば良い\\n\\n\\n\\ng_set = 0\\n\\ncnt = defaultdict(lambda: 0)\\n\\nflg = 1 # pairwiseであるフラグ\\n\\nfor a in A:\\n\\n g_set = gcd(g_set, a)\\n\\n if flg:\\n\\n for p, n in fast_factorization(a).items():\\n\\n if cnt[p] != 0:\\n\\n flg = 0\\n\\n cnt[p] += n\\n\\n\\n\\n\\n\\n# print(cnt)\\n\\n# for v in cnt.values():\\n\\n# if v > 1:\\n\\n# flg = 0\\n\\n# break\\n\\n\\n\\nif g_set > 1:\\n\\n print('not coprime')\\n\\nelif flg:\\n\\n print('pairwise coprime')\\n\\nelse:\\n\\n print('setwise coprime')\\n\",\n", + " 'target': \"import sys\\n\\nsys.setrecursionlimit(1 << 25)\\n\\nreadline = sys.stdin.buffer.readline\\n\\nread = sys.stdin.readline # 文字列読み込む時はこっち\\n\\nra = range\\n\\nenu = enumerate\\n\\n\\n\\n\\n\\ndef exit(*argv, **kwarg):\\n\\n print(*argv, **kwarg)\\n\\n sys.exit()\\n\\n\\n\\n\\n\\ndef mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))\\n\\n# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと\\n\\n\\n\\n\\n\\ndef a_int(): return int(readline())\\n\\n\\n\\n\\n\\ndef ints(): return list(map(int, readline().split()))\\n\\n\\n\\n\\n\\nfrom collections import Counter\\n\\n\\n\\n\\n\\nclass FastFactorization:\\n\\n def __init__(self, N: int):\\n\\n '''構築O(NloglogN)、クエリO(logN)'''\\n\\n self.N = N\\n\\n self.min_prime = self._make_minimum_prime()\\n\\n\\n\\n def _make_minimum_prime(self):\\n\\n # xの最小の素因数表を作成\\n\\n min_prime = [x for x in range(self.N + 1)]\\n\\n # min_prime[0] = 0 # 0と1は素数ではない\\n\\n # min_prime[1] = 1\\n\\n for i in range(2, int(self.N ** 0.5) + 1):\\n\\n if min_prime[i] == i: # 素数だったら更新\\n\\n for j in range(2 * i, self.N + 1, i): # iの倍数は素数でない\\n\\n if min_prime[j] == j:\\n\\n min_prime[j] = i\\n\\n return min_prime\\n\\n\\n\\n def query(self, x: int):\\n\\n # -> Counter[p,n] (素数,冪数) を格納\\n\\n # 最小素数配列min_primeを使ってO(log N)で因数分解\\n\\n if x == 1:\\n\\n return Counter() # 1は素数ではない\\n\\n\\n\\n # 素因数分解\\n\\n arr = []\\n\\n tmp = x\\n\\n while tmp != 1:\\n\\n p = self.min_prime[tmp]\\n\\n tmp //= p\\n\\n arr.append(p)\\n\\n return Counter(arr)\\n\\n\\n\\n\\n\\nMOD = 10**9 + 7\\n\\nINF = 2**31 # 2147483648 > 10**9\\n\\n# default import\\n\\nfrom collections import defaultdict, Counter, deque\\n\\nfrom math import gcd\\n\\n\\n\\n\\n\\nN = a_int()\\n\\nA = ints()\\n\\n\\n\\nfact = FastFactorization(max(A))\\n\\n\\n\\n# setかはすぐわかる\\n\\n# setでなければ not coprime\\n\\n# pairは互いに素かをみればいいのか\\n\\n# つまり因数分解して足してったときにすべての素数のべき数が1以下であれば良い\\n\\n\\n\\ng_set = 0\\n\\ncnt = defaultdict(lambda: 0)\\n\\nflg = 1 # pairwiseであるフラグ\\n\\nfor a in A:\\n\\n g_set = gcd(g_set, a)\\n\\n if flg:\\n\\n for p, n in fact.query(a).items():\\n\\n if cnt[p] != 0:\\n\\n flg = 0\\n\\n cnt[p] += n\\n\\n\\n\\n\\n\\n# print(cnt)\\n\\n# for v in cnt.values():\\n\\n# if v > 1:\\n\\n# flg = 0\\n\\n# break\\n\\n\\n\\nif g_set > 1:\\n\\n print('not coprime')\\n\\nelif flg:\\n\\n print('pairwise coprime')\\n\\nelse:\\n\\n print('setwise coprime')\\n\",\n", + " 'code_v0_loc': 99,\n", + " 'code_v1_loc': 101,\n", + " 'code_v0_num_chars': 2049,\n", + " 'code_v1_num_chars': 2271,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(1 << 25)\\nreadline = sys.stdin.buffer.readline\\nread = sys.stdin.readline # 文字列読み込む時はこっち\\nra = range\\nenu = enumerate\\n\\n\\ndef exit(*argv, **kwarg):\\n print(*argv, **kwarg)\\n sys.exit()\\n\\n\\ndef mina(*argv, sub=1):\\n return list(map(lambda x: x - sub, argv))\\n\\n\\n# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと\\ndef a_int():\\n return int(readline())\\n\\n\\ndef ints():\\n return list(map(int, readline().split()))\\n\\n\\ndef _make_minimum_prime(N: int):\\n # xの最小の素因数表を作成\\n min_prime = [x for x in range(N + 1)]\\n # min_prime[0] = 0 # 0と1は素数ではない\\n # min_prime[1] = 1\\n for i in range(2, int(N**0.5) + 1):\\n if min_prime[i] == i: # 素数だったら更新\\n for j in range(2 * i, N + 1, i): # iの倍数は素数でない\\n if min_prime[j] == j:\\n min_prime[j] = i\\n return min_prime\\n\\n\\nmin_prime = _make_minimum_prime(10**6)\\nfrom collections import Counter\\n\\n\\ndef fast_factorization(N: int):\\n # -> List[Tuple[int,int]] (素数,冪数)を格納\\n # 最小素数配列min_primeを使ってO(log N)で因数分解\\n if N == 1:\\n return Counter() # 1は素数ではない\\n # 素因数分解\\n arr = []\\n tmp = N\\n while tmp != 1:\\n p = min_prime[tmp]\\n tmp //= p\\n arr.append(p)\\n return Counter(arr)\\n\\n\\nMOD = 10**9 + 7\\nINF = 2**31 # 2147483648 > 10**9\\n# default import\\nfrom collections import defaultdict, Counter, deque\\nimport random\\nfrom math import gcd\\n\\nN = a_int()\\nA = ints()\\nrandom.shuffle(A)\\n# setかはすぐわかる\\n# setでなければ not coprime\\n# pairは互いに素かをみればいいのか\\n# つまり因数分解して足してったときにすべての素数のべき数が1以下であれば良い\\ng_set = 0\\ncnt = defaultdict(lambda: 0)\\nflg = 1 # pairwiseであるフラグ\\nfor a in A:\\n g_set = gcd(g_set, a)\\n if flg:\\n for p, n in fast_factorization(a).items():\\n if cnt[p] != 0:\\n flg = 0\\n cnt[p] += n\\n# print(cnt)\\n# for v in cnt.values():\\n# if v > 1:\\n# flg = 0\\n# break\\nif g_set > 1:\\n print(\"not coprime\")\\nelif flg:\\n print(\"pairwise coprime\")\\nelse:\\n print(\"setwise coprime\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(1 << 25)\\nreadline = sys.stdin.buffer.readline\\nread = sys.stdin.readline # 文字列読み込む時はこっち\\nra = range\\nenu = enumerate\\n\\n\\ndef exit(*argv, **kwarg):\\n print(*argv, **kwarg)\\n sys.exit()\\n\\n\\ndef mina(*argv, sub=1):\\n return list(map(lambda x: x - sub, argv))\\n\\n\\n# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと\\ndef a_int():\\n return int(readline())\\n\\n\\ndef ints():\\n return list(map(int, readline().split()))\\n\\n\\nfrom collections import Counter\\n\\n\\nclass FastFactorization:\\n def __init__(self, N: int):\\n \"\"\"構築O(NloglogN)、クエリO(logN)\"\"\"\\n self.N = N\\n self.min_prime = self._make_minimum_prime()\\n\\n def _make_minimum_prime(self):\\n # xの最小の素因数表を作成\\n min_prime = [x for x in range(self.N + 1)]\\n # min_prime[0] = 0 # 0と1は素数ではない\\n # min_prime[1] = 1\\n for i in range(2, int(self.N**0.5) + 1):\\n if min_prime[i] == i: # 素数だったら更新\\n for j in range(2 * i, self.N + 1, i): # iの倍数は素数でない\\n if min_prime[j] == j:\\n min_prime[j] = i\\n return min_prime\\n\\n def query(self, x: int):\\n # -> Counter[p,n] (素数,冪数) を格納\\n # 最小素数配列min_primeを使ってO(log N)で因数分解\\n if x == 1:\\n return Counter() # 1は素数ではない\\n # 素因数分解\\n arr = []\\n tmp = x\\n while tmp != 1:\\n p = self.min_prime[tmp]\\n tmp //= p\\n arr.append(p)\\n return Counter(arr)\\n\\n\\nMOD = 10**9 + 7\\nINF = 2**31 # 2147483648 > 10**9\\n# default import\\nfrom collections import defaultdict, Counter, deque\\nfrom math import gcd\\n\\nN = a_int()\\nA = ints()\\nfact = FastFactorization(max(A))\\n# setかはすぐわかる\\n# setでなければ not coprime\\n# pairは互いに素かをみればいいのか\\n# つまり因数分解して足してったときにすべての素数のべき数が1以下であれば良い\\ng_set = 0\\ncnt = defaultdict(lambda: 0)\\nflg = 1 # pairwiseであるフラグ\\nfor a in A:\\n g_set = gcd(g_set, a)\\n if flg:\\n for p, n in fact.query(a).items():\\n if cnt[p] != 0:\\n flg = 0\\n cnt[p] += n\\n# print(cnt)\\n# for v in cnt.values():\\n# if v > 1:\\n# flg = 0\\n# break\\nif g_set > 1:\\n print(\"not coprime\")\\nelif flg:\\n print(\"pairwise coprime\")\\nelse:\\n print(\"setwise coprime\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 1.9801980198,\n", + " 'diff': ['-def _make_minimum_prime(N: int):',\n", + " '- # xの最小の素因数表を作成',\n", + " '- min_prime = [x for x in range(N + 1)]',\n", + " '- # min_prime[0] = 0 # 0と1は素数ではない',\n", + " '- # min_prime[1] = 1',\n", + " '- for i in range(2, int(N**0.5) + 1):',\n", + " '- if min_prime[i] == i: # 素数だったら更新',\n", + " '- for j in range(2 * i, N + 1, i): # iの倍数は素数でない',\n", + " '- if min_prime[j] == j:',\n", + " '- min_prime[j] = i',\n", + " '- return min_prime',\n", + " '-',\n", + " '-',\n", + " '-min_prime = _make_minimum_prime(10**6)',\n", + " '-def fast_factorization(N: int):',\n", + " '- # -> List[Tuple[int,int]] (素数,冪数)を格納',\n", + " '- # 最小素数配列min_primeを使ってO(log N)で因数分解',\n", + " '- if N == 1:',\n", + " '- return Counter() # 1は素数ではない',\n", + " '- # 素因数分解',\n", + " '- arr = []',\n", + " '- tmp = N',\n", + " '- while tmp != 1:',\n", + " '- p = min_prime[tmp]',\n", + " '- tmp //= p',\n", + " '- arr.append(p)',\n", + " '- return Counter(arr)',\n", + " '+class FastFactorization:',\n", + " '+ def __init__(self, N: int):',\n", + " '+ \"\"\"構築O(NloglogN)、クエリO(logN)\"\"\"',\n", + " '+ self.N = N',\n", + " '+ self.min_prime = self._make_minimum_prime()',\n", + " '+',\n", + " '+ def _make_minimum_prime(self):',\n", + " '+ # xの最小の素因数表を作成',\n", + " '+ min_prime = [x for x in range(self.N + 1)]',\n", + " '+ # min_prime[0] = 0 # 0と1は素数ではない',\n", + " '+ # min_prime[1] = 1',\n", + " '+ for i in range(2, int(self.N**0.5) + 1):',\n", + " '+ if min_prime[i] == i: # 素数だったら更新',\n", + " '+ for j in range(2 * i, self.N + 1, i): # iの倍数は素数でない',\n", + " '+ if min_prime[j] == j:',\n", + " '+ min_prime[j] = i',\n", + " '+ return min_prime',\n", + " '+',\n", + " '+ def query(self, x: int):',\n", + " '+ # -> Counter[p,n] (素数,冪数) を格納',\n", + " '+ # 最小素数配列min_primeを使ってO(log N)で因数分解',\n", + " '+ if x == 1:',\n", + " '+ return Counter() # 1は素数ではない',\n", + " '+ # 素因数分解',\n", + " '+ arr = []',\n", + " '+ tmp = x',\n", + " '+ while tmp != 1:',\n", + " '+ p = self.min_prime[tmp]',\n", + " '+ tmp //= p',\n", + " '+ arr.append(p)',\n", + " '+ return Counter(arr)',\n", + " '-import random',\n", + " '-random.shuffle(A)',\n", + " '+fact = FastFactorization(max(A))',\n", + " '- for p, n in fast_factorization(a).items():',\n", + " '+ for p, n in fact.query(a).items():'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 3.5886808305,\n", + " 'measured_runtime_v1': 0.2258392296,\n", + " 'runtime_lift': 15.8904227442,\n", + " 'key': ['s667619941', 's202036773']},\n", + " {'user_id': 'u347640436',\n", + " 'problem_id': 'p03854',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's259161069',\n", + " 'submission_id_v1': 's688102427',\n", + " 'cpu_time_v0': 1216,\n", + " 'cpu_time_v1': 697,\n", + " 'memory_v0': 3420,\n", + " 'memory_v1': 3992,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 42.68,\n", + " 'input': \"import sys\\n\\ns = input()\\n\\nts = ['']\\n\\nwhile True:\\n\\n nts= []\\n\\n for t in ts:\\n\\n for w in ['dreamer', 'eraser', 'dream', 'erase']:\\n\\n if s == t + w:\\n\\n print('YES')\\n\\n sys.exit()\\n\\n if s.startswith(t + w):\\n\\n nts.append(t + w)\\n\\n if len(nts) == 0:\\n\\n print('NO')\\n\\n sys.exit()\\n\\n ts = nts\\n\",\n", + " 'target': \"from sys import exit\\n\\ns = eval(input())\\n\\nts = ['']\\n\\nwhile True:\\n\\n nts= []\\n\\n for t in ts:\\n\\n for w in ['dreamer', 'eraser', 'dream', 'erase']:\\n\\n tw = t + w\\n\\n if s == tw:\\n\\n print('YES')\\n\\n exit()\\n\\n if s.startswith(tw):\\n\\n nts.append(tw)\\n\\n if len(nts) == 0:\\n\\n print('NO')\\n\\n exit()\\n\\n ts = nts\\n\",\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 320,\n", + " 'code_v1_num_chars': 329,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ns = input()\\nts = [\"\"]\\nwhile True:\\n nts = []\\n for t in ts:\\n for w in [\"dreamer\", \"eraser\", \"dream\", \"erase\"]:\\n if s == t + w:\\n print(\"YES\")\\n sys.exit()\\n if s.startswith(t + w):\\n nts.append(t + w)\\n if len(nts) == 0:\\n print(\"NO\")\\n sys.exit()\\n ts = nts\\n',\n", + " 'code_v1_no_empty_lines': 'from sys import exit\\n\\ns = eval(input())\\nts = [\"\"]\\nwhile True:\\n nts = []\\n for t in ts:\\n for w in [\"dreamer\", \"eraser\", \"dream\", \"erase\"]:\\n tw = t + w\\n if s == tw:\\n print(\"YES\")\\n exit()\\n if s.startswith(tw):\\n nts.append(tw)\\n if len(nts) == 0:\\n print(\"NO\")\\n exit()\\n ts = nts\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.8823529412,\n", + " 'diff': ['-import sys',\n", + " '+from sys import exit',\n", + " '-s = input()',\n", + " '+s = eval(input())',\n", + " '- if s == t + w:',\n", + " '+ tw = t + w',\n", + " '+ if s == tw:',\n", + " '- sys.exit()',\n", + " '- if s.startswith(t + w):',\n", + " '- nts.append(t + w)',\n", + " '+ exit()',\n", + " '+ if s.startswith(tw):',\n", + " '+ nts.append(tw)',\n", + " '- sys.exit()',\n", + " '+ exit()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2929967599,\n", + " 'measured_runtime_v1': 0.1979754126,\n", + " 'runtime_lift': 1.4799653958,\n", + " 'key': ['s259161069', 's688102427']},\n", + " {'user_id': 'u754022296',\n", + " 'problem_id': 'p03819',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's951638556',\n", + " 'submission_id_v1': 's089571448',\n", + " 'cpu_time_v0': 1762,\n", + " 'cpu_time_v1': 852,\n", + " 'memory_v0': 127784,\n", + " 'memory_v1': 82324,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 51.65,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef main():\\n\\n n, m = map(int, input().split())\\n\\n LR = [list(map(int, input().split())) for _ in range(n)]\\n\\n \\n\\n BIT = [0]*(m+2)\\n\\n def add(i, a):\\n\\n while i <= m+1:\\n\\n BIT[i] += a\\n\\n i += i&(-i)\\n\\n def bit_sum(i):\\n\\n res = 0\\n\\n while i > 0:\\n\\n res += BIT[i]\\n\\n i -= i&(-i)\\n\\n return res\\n\\n \\n\\n S = sorted([(r-l+1, l, r) for l, r in LR], reverse=True)\\n\\n cnt = n\\n\\n L = []\\n\\n for i in range(1, m+1):\\n\\n while S and S[-1][0] == i:\\n\\n c, l, r = S.pop()\\n\\n cnt -= 1\\n\\n add(l, 1)\\n\\n add(r+1, -1)\\n\\n res = cnt\\n\\n for j in range(0, m+1, i):\\n\\n res += bit_sum(j)\\n\\n L.append(res)\\n\\n print(*L, sep=\"\\\\n\")\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef main():\\n\\n n, m = list(map(int, input().split()))\\n\\n S = [[] for _ in range(m+1)]\\n\\n for _ in range(n):\\n\\n l, r = list(map(int, input().split()))\\n\\n S[r-l+1].append((l, r))\\n\\n \\n\\n BIT = [0]*(m+2)\\n\\n def add(i, a):\\n\\n while i <= m+1:\\n\\n BIT[i] += a\\n\\n i += i&(-i)\\n\\n def bit_sum(i):\\n\\n res = 0\\n\\n while i > 0:\\n\\n res += BIT[i]\\n\\n i -= i&(-i)\\n\\n return res\\n\\n cnt = n\\n\\n for i in range(1, m+1):\\n\\n for l, r in S[i]:\\n\\n cnt -= 1\\n\\n add(l, 1)\\n\\n add(r+1, -1)\\n\\n res = cnt\\n\\n for j in range(0, m+1, i):\\n\\n res += bit_sum(j)\\n\\n print(res)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 36,\n", + " 'code_v1_loc': 34,\n", + " 'code_v0_num_chars': 731,\n", + " 'code_v1_num_chars': 658,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n n, m = map(int, input().split())\\n LR = [list(map(int, input().split())) for _ in range(n)]\\n BIT = [0] * (m + 2)\\n\\n def add(i, a):\\n while i <= m + 1:\\n BIT[i] += a\\n i += i & (-i)\\n\\n def bit_sum(i):\\n res = 0\\n while i > 0:\\n res += BIT[i]\\n i -= i & (-i)\\n return res\\n\\n S = sorted([(r - l + 1, l, r) for l, r in LR], reverse=True)\\n cnt = n\\n L = []\\n for i in range(1, m + 1):\\n while S and S[-1][0] == i:\\n c, l, r = S.pop()\\n cnt -= 1\\n add(l, 1)\\n add(r + 1, -1)\\n res = cnt\\n for j in range(0, m + 1, i):\\n res += bit_sum(j)\\n L.append(res)\\n print(*L, sep=\"\\\\n\")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n n, m = list(map(int, input().split()))\\n S = [[] for _ in range(m + 1)]\\n for _ in range(n):\\n l, r = list(map(int, input().split()))\\n S[r - l + 1].append((l, r))\\n BIT = [0] * (m + 2)\\n\\n def add(i, a):\\n while i <= m + 1:\\n BIT[i] += a\\n i += i & (-i)\\n\\n def bit_sum(i):\\n res = 0\\n while i > 0:\\n res += BIT[i]\\n i -= i & (-i)\\n return res\\n\\n cnt = n\\n for i in range(1, m + 1):\\n for l, r in S[i]:\\n cnt -= 1\\n add(l, 1)\\n add(r + 1, -1)\\n res = cnt\\n for j in range(0, m + 1, i):\\n res += bit_sum(j)\\n print(res)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.5555555556,\n", + " 'diff': ['- n, m = map(int, input().split())',\n", + " '- LR = [list(map(int, input().split())) for _ in range(n)]',\n", + " '+ n, m = list(map(int, input().split()))',\n", + " '+ S = [[] for _ in range(m + 1)]',\n", + " '+ for _ in range(n):',\n", + " '+ l, r = list(map(int, input().split()))',\n", + " '+ S[r - l + 1].append((l, r))',\n", + " '- S = sorted([(r - l + 1, l, r) for l, r in LR], reverse=True)',\n", + " '- L = []',\n", + " '- while S and S[-1][0] == i:',\n", + " '- c, l, r = S.pop()',\n", + " '+ for l, r in S[i]:',\n", + " '- L.append(res)',\n", + " '- print(*L, sep=\"\\\\n\")',\n", + " '+ print(res)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3067650649,\n", + " 'measured_runtime_v1': 0.0989195189,\n", + " 'runtime_lift': 3.1011580763,\n", + " 'key': ['s951638556', 's089571448']},\n", + " {'user_id': 'u057109575',\n", + " 'problem_id': 'p02851',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's203769987',\n", + " 'submission_id_v1': 's522861811',\n", + " 'cpu_time_v0': 293,\n", + " 'cpu_time_v1': 166,\n", + " 'memory_v0': 103224,\n", + " 'memory_v1': 144972,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.34,\n", + " 'input': 'from collections import defaultdict\\n\\n\\n\\nN, K, *A = list(map(int, open(0).read().split()))\\n\\n\\n\\nS = [0] * (N + 1)\\n\\nfor i in range(N):\\n\\n S[i + 1] = S[i] + A[i]\\n\\n\\n\\nd = defaultdict(int)\\n\\nans = 0\\n\\nfor j in range(N + 1):\\n\\n v = (S[j] - j) % K\\n\\n ans += d[v]\\n\\n d[v] += 1\\n\\n if j >= K - 1:\\n\\n d[(S[j - K + 1] - (j - K + 1)) % K] -= 1\\n\\n \\n\\nprint(ans)\\n',\n", + " 'target': 'from collections import defaultdict\\n\\n\\n\\nN, K, *A = list(map(int, open(0).read().split()))\\n\\n\\n\\nx = [0] * (N + 1)\\n\\nfor i in range(N):\\n\\n x[i + 1] = x[i] + A[i]\\n\\n \\n\\ny = [(x[i] - i) % K for i in range(N + 1)]\\n\\n\\n\\nctr = defaultdict(int)\\n\\nans = 0\\n\\nfor j in range(N + 1):\\n\\n ans += ctr[y[j]]\\n\\n ctr[y[j]] += 1\\n\\n if j - K + 1 >= 0:\\n\\n ctr[y[j - K + 1]] -= 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 357,\n", + " 'code_v1_num_chars': 371,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\n\\nN, K, *A = list(map(int, open(0).read().split()))\\nS = [0] * (N + 1)\\nfor i in range(N):\\n S[i + 1] = S[i] + A[i]\\nd = defaultdict(int)\\nans = 0\\nfor j in range(N + 1):\\n v = (S[j] - j) % K\\n ans += d[v]\\n d[v] += 1\\n if j >= K - 1:\\n d[(S[j - K + 1] - (j - K + 1)) % K] -= 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\nN, K, *A = list(map(int, open(0).read().split()))\\nx = [0] * (N + 1)\\nfor i in range(N):\\n x[i + 1] = x[i] + A[i]\\ny = [(x[i] - i) % K for i in range(N + 1)]\\nctr = defaultdict(int)\\nans = 0\\nfor j in range(N + 1):\\n ans += ctr[y[j]]\\n ctr[y[j]] += 1\\n if j - K + 1 >= 0:\\n ctr[y[j - K + 1]] -= 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-S = [0] * (N + 1)',\n", + " '+x = [0] * (N + 1)',\n", + " '- S[i + 1] = S[i] + A[i]',\n", + " '-d = defaultdict(int)',\n", + " '+ x[i + 1] = x[i] + A[i]',\n", + " '+y = [(x[i] - i) % K for i in range(N + 1)]',\n", + " '+ctr = defaultdict(int)',\n", + " '- v = (S[j] - j) % K',\n", + " '- ans += d[v]',\n", + " '- d[v] += 1',\n", + " '- if j >= K - 1:',\n", + " '- d[(S[j - K + 1] - (j - K + 1)) % K] -= 1',\n", + " '+ ans += ctr[y[j]]',\n", + " '+ ctr[y[j]] += 1',\n", + " '+ if j - K + 1 >= 0:',\n", + " '+ ctr[y[j - K + 1]] -= 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2436300242,\n", + " 'measured_runtime_v1': 0.1409657106,\n", + " 'runtime_lift': 1.7282928102,\n", + " 'key': ['s203769987', 's522861811']},\n", + " {'user_id': 'u572142121',\n", + " 'problem_id': 'p03363',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's475305567',\n", + " 'submission_id_v1': 's723214591',\n", + " 'cpu_time_v0': 418,\n", + " 'cpu_time_v1': 188,\n", + " 'memory_v0': 34640,\n", + " 'memory_v1': 31600,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.02,\n", + " 'input': 'import numpy\\n\\nN=int(eval(input()))\\n\\nA=list(map(int,input().split()))\\n\\nB=list(numpy.cumsum(A))+[0]\\n\\nC=sorted(B)\\n\\nd=C[0]\\n\\ncnt=1\\n\\nans=0\\n\\nfor i in range(N):\\n\\n if C[i+1]==d:\\n\\n cnt+=1\\n\\n else:\\n\\n ans+=cnt*(cnt-1)//2\\n\\n cnt=1\\n\\n d=C[i+1]\\n\\nans+=cnt*(cnt-1)//2\\n\\nprint(ans) ',\n", + " 'target': 'N=int(eval(input()))\\n\\nA=list(map(int, input().split()))\\n\\nD=[0]\\n\\nd=0\\n\\nfor i in A:\\n\\n d+=i\\n\\n D.append(d)\\n\\nD=sorted(D)\\n\\nans=0\\n\\nd=-10**9+1\\n\\nD.append(10**9+1)\\n\\ncnt=0\\n\\nfor i in range(N+2):\\n\\n if D[i]==d:\\n\\n cnt+=1\\n\\n else:\\n\\n if cnt>1:\\n\\n ans+=cnt*(cnt-1)//2\\n\\n cnt=1\\n\\n else:\\n\\n cnt=1\\n\\n d=D[i]\\n\\nprint(ans)',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 271,\n", + " 'code_v1_num_chars': 316,\n", + " 'code_v0_no_empty_lines': 'import numpy\\n\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nB = list(numpy.cumsum(A)) + [0]\\nC = sorted(B)\\nd = C[0]\\ncnt = 1\\nans = 0\\nfor i in range(N):\\n if C[i + 1] == d:\\n cnt += 1\\n else:\\n ans += cnt * (cnt - 1) // 2\\n cnt = 1\\n d = C[i + 1]\\nans += cnt * (cnt - 1) // 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nD = [0]\\nd = 0\\nfor i in A:\\n d += i\\n D.append(d)\\nD = sorted(D)\\nans = 0\\nd = -(10**9) + 1\\nD.append(10**9 + 1)\\ncnt = 0\\nfor i in range(N + 2):\\n if D[i] == d:\\n cnt += 1\\n else:\\n if cnt > 1:\\n ans += cnt * (cnt - 1) // 2\\n cnt = 1\\n else:\\n cnt = 1\\n d = D[i]\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.0869565217,\n", + " 'diff': ['-import numpy',\n", + " '-',\n", + " '-B = list(numpy.cumsum(A)) + [0]',\n", + " '-C = sorted(B)',\n", + " '-d = C[0]',\n", + " '-cnt = 1',\n", + " '+D = [0]',\n", + " '+d = 0',\n", + " '+for i in A:',\n", + " '+ d += i',\n", + " '+ D.append(d)',\n", + " '+D = sorted(D)',\n", + " '-for i in range(N):',\n", + " '- if C[i + 1] == d:',\n", + " '+d = -(10**9) + 1',\n", + " '+D.append(10**9 + 1)',\n", + " '+cnt = 0',\n", + " '+for i in range(N + 2):',\n", + " '+ if D[i] == d:',\n", + " '- ans += cnt * (cnt - 1) // 2',\n", + " '- cnt = 1',\n", + " '- d = C[i + 1]',\n", + " '-ans += cnt * (cnt - 1) // 2',\n", + " '+ if cnt > 1:',\n", + " '+ ans += cnt * (cnt - 1) // 2',\n", + " '+ cnt = 1',\n", + " '+ else:',\n", + " '+ cnt = 1',\n", + " '+ d = D[i]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3420555761,\n", + " 'measured_runtime_v1': 0.3643712389,\n", + " 'runtime_lift': 3.6832094101,\n", + " 'key': ['s475305567', 's723214591']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's168362535',\n", + " 'submission_id_v1': 's471284270',\n", + " 'cpu_time_v0': 242,\n", + " 'cpu_time_v1': 98,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.5,\n", + " 'input': 'inf = (5000 * 10 ** 5) * 3\\n\\n\\n\\na, b, c, x, y = list(map(int, input().split()))\\n\\n\\n\\nret = inf\\n\\nfor cnt_ab in range(max(x, y) * 2 + 1):\\n\\n d = cnt_ab // 2\\n\\n\\n\\n cnt_a = max(0, x - d)\\n\\n cnt_b = max(0, y - d)\\n\\n\\n\\n t = cnt_ab * c + cnt_a * a + cnt_b * b\\n\\n ret = min(ret, t)\\n\\nprint(ret)\\n',\n", + " 'target': \"def main():\\n\\n A, B, AB, X, Y = list(map(int, input().split()))\\n\\n M = max(X, Y)\\n\\n\\n\\n k = 0\\n\\n ans = A * X + B * Y\\n\\n while True:\\n\\n ans = min(\\n\\n ans,\\n\\n AB * k * 2 + max(0, X - k) * A + max(0, Y - k) * B\\n\\n )\\n\\n\\n\\n if k >= M: break\\n\\n k += 1\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 284,\n", + " 'code_v1_num_chars': 353,\n", + " 'code_v0_no_empty_lines': 'inf = (5000 * 10**5) * 3\\na, b, c, x, y = list(map(int, input().split()))\\nret = inf\\nfor cnt_ab in range(max(x, y) * 2 + 1):\\n d = cnt_ab // 2\\n cnt_a = max(0, x - d)\\n cnt_b = max(0, y - d)\\n t = cnt_ab * c + cnt_a * a + cnt_b * b\\n ret = min(ret, t)\\nprint(ret)\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n A, B, AB, X, Y = list(map(int, input().split()))\\n M = max(X, Y)\\n k = 0\\n ans = A * X + B * Y\\n while True:\\n ans = min(ans, AB * k * 2 + max(0, X - k) * A + max(0, Y - k) * B)\\n if k >= M:\\n break\\n k += 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.0,\n", + " 'diff': ['-inf = (5000 * 10**5) * 3',\n", + " '-a, b, c, x, y = list(map(int, input().split()))',\n", + " '-ret = inf',\n", + " '-for cnt_ab in range(max(x, y) * 2 + 1):',\n", + " '- d = cnt_ab // 2',\n", + " '- cnt_a = max(0, x - d)',\n", + " '- cnt_b = max(0, y - d)',\n", + " '- t = cnt_ab * c + cnt_a * a + cnt_b * b',\n", + " '- ret = min(ret, t)',\n", + " '-print(ret)',\n", + " '+def main():',\n", + " '+ A, B, AB, X, Y = list(map(int, input().split()))',\n", + " '+ M = max(X, Y)',\n", + " '+ k = 0',\n", + " '+ ans = A * X + B * Y',\n", + " '+ while True:',\n", + " '+ ans = min(ans, AB * k * 2 + max(0, X - k) * A + max(0, Y - k) * B)',\n", + " '+ if k >= M:',\n", + " '+ break',\n", + " '+ k += 1',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4937371187,\n", + " 'measured_runtime_v1': 0.3021148317,\n", + " 'runtime_lift': 1.6342697111,\n", + " 'key': ['s168362535', 's471284270']},\n", + " {'user_id': 'u347600233',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's661845965',\n", + " 'submission_id_v1': 's817506416',\n", + " 'cpu_time_v0': 279,\n", + " 'cpu_time_v1': 195,\n", + " 'memory_v0': 7088,\n", + " 'memory_v1': 16564,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.11,\n", + " 'input': 'n, m = list(map(int, input().split()))\\n\\ngate = []\\n\\nl, r = list(map(int, input().split()))\\n\\nfor i in range(1, m):\\n\\n m, s = list(map(int, input().split()))\\n\\n if l < m:\\n\\n l = m\\n\\n if s < r:\\n\\n r = s\\n\\nprint((len([i for i in range(l, r + 1)])))',\n", + " 'target': 'n, m = list(map(int, input().split()))\\n\\nl, r = [0] * m, [0] * m\\n\\nfor i in range(m):\\n\\n l[i], r[i] = list(map(int, input().split()))\\n\\nprint((max(min(r) - max(l) + 1, 0)))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 240,\n", + " 'code_v1_num_chars': 157,\n", + " 'code_v0_no_empty_lines': 'n, m = list(map(int, input().split()))\\ngate = []\\nl, r = list(map(int, input().split()))\\nfor i in range(1, m):\\n m, s = list(map(int, input().split()))\\n if l < m:\\n l = m\\n if s < r:\\n r = s\\nprint((len([i for i in range(l, r + 1)])))\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nl, r = [0] * m, [0] * m\\nfor i in range(m):\\n l[i], r[i] = list(map(int, input().split()))\\nprint((max(min(r) - max(l) + 1, 0)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-gate = []',\n", + " '-l, r = list(map(int, input().split()))',\n", + " '-for i in range(1, m):',\n", + " '- m, s = list(map(int, input().split()))',\n", + " '- if l < m:',\n", + " '- l = m',\n", + " '- if s < r:',\n", + " '- r = s',\n", + " '-print((len([i for i in range(l, r + 1)])))',\n", + " '+l, r = [0] * m, [0] * m',\n", + " '+for i in range(m):',\n", + " '+ l[i], r[i] = list(map(int, input().split()))',\n", + " '+print((max(min(r) - max(l) + 1, 0)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.317712152,\n", + " 'measured_runtime_v1': 0.2449507949,\n", + " 'runtime_lift': 1.2970447884,\n", + " 'key': ['s661845965', 's817506416']},\n", + " {'user_id': 'u038408819',\n", + " 'problem_id': 'p02691',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's116716284',\n", + " 'submission_id_v1': 's825945845',\n", + " 'cpu_time_v0': 328,\n", + " 'cpu_time_v1': 178,\n", + " 'memory_v0': 73948,\n", + " 'memory_v1': 132600,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 45.73,\n", + " 'input': 'n = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\na_index = []\\n\\nfor i in range(n):\\n\\n a_index.append((i, a[i]))\\n\\ndic1 = {}\\n\\ndic2 = {}\\n\\nfor i in range(n):\\n\\n one = a_index[i][0] + a_index[i][1]\\n\\n two = a_index[i][0] - a_index[i][1]\\n\\n if one not in dic1:\\n\\n dic1[one] = 1\\n\\n else:\\n\\n dic1[one] += 1\\n\\n if two not in dic2:\\n\\n dic2[two] = 1\\n\\n else:\\n\\n dic2[two] += 1\\n\\nans = 0\\n\\nfor i in list(dic1.keys()):\\n\\n if i in dic2:\\n\\n ans += dic2[i] * dic1[i]\\n\\nfor i in list(dic2.keys()):\\n\\n if i in dic1:\\n\\n ans += dic1[i] * dic2[i]\\n\\n #print(i)\\n\\nprint((ans // 2))\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nimport collections\\n\\nans = 0\\n\\ndic = collections.defaultdict(int)\\n\\nfor i in range(1, n + 1):\\n\\n ans += dic[i - a[i - 1]]\\n\\n dic[i + a[i - 1]] += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 606,\n", + " 'code_v1_num_chars': 215,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\na_index = []\\nfor i in range(n):\\n a_index.append((i, a[i]))\\ndic1 = {}\\ndic2 = {}\\nfor i in range(n):\\n one = a_index[i][0] + a_index[i][1]\\n two = a_index[i][0] - a_index[i][1]\\n if one not in dic1:\\n dic1[one] = 1\\n else:\\n dic1[one] += 1\\n if two not in dic2:\\n dic2[two] = 1\\n else:\\n dic2[two] += 1\\nans = 0\\nfor i in list(dic1.keys()):\\n if i in dic2:\\n ans += dic2[i] * dic1[i]\\nfor i in list(dic2.keys()):\\n if i in dic1:\\n ans += dic1[i] * dic2[i]\\n # print(i)\\nprint((ans // 2))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nimport collections\\n\\nans = 0\\ndic = collections.defaultdict(int)\\nfor i in range(1, n + 1):\\n ans += dic[i - a[i - 1]]\\n dic[i + a[i - 1]] += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-a_index = []',\n", + " '-for i in range(n):',\n", + " '- a_index.append((i, a[i]))',\n", + " '-dic1 = {}',\n", + " '-dic2 = {}',\n", + " '-for i in range(n):',\n", + " '- one = a_index[i][0] + a_index[i][1]',\n", + " '- two = a_index[i][0] - a_index[i][1]',\n", + " '- if one not in dic1:',\n", + " '- dic1[one] = 1',\n", + " '- else:',\n", + " '- dic1[one] += 1',\n", + " '- if two not in dic2:',\n", + " '- dic2[two] = 1',\n", + " '- else:',\n", + " '- dic2[two] += 1',\n", + " '+import collections',\n", + " '+',\n", + " '-for i in list(dic1.keys()):',\n", + " '- if i in dic2:',\n", + " '- ans += dic2[i] * dic1[i]',\n", + " '-for i in list(dic2.keys()):',\n", + " '- if i in dic1:',\n", + " '- ans += dic1[i] * dic2[i]',\n", + " '- # print(i)',\n", + " '-print((ans // 2))',\n", + " '+dic = collections.defaultdict(int)',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans += dic[i - a[i - 1]]',\n", + " '+ dic[i + a[i - 1]] += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3792731187,\n", + " 'measured_runtime_v1': 0.2976846831,\n", + " 'runtime_lift': 1.2740767002,\n", + " 'key': ['s116716284', 's825945845']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's802702568',\n", + " 'submission_id_v1': 's939867576',\n", + " 'cpu_time_v0': 372,\n", + " 'cpu_time_v1': 200,\n", + " 'memory_v0': 27268,\n", + " 'memory_v1': 25180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 46.24,\n", + " 'input': '# author: kagemeka \\n\\n# created: 2019-11-08 14:51:29(JST)\\n\\n## internal modules\\n\\nimport sys\\n\\n# import collections\\n\\n# import math\\n\\n# import string\\n\\n# import bisect\\n\\n# import re\\n\\n# import itertools\\n\\nimport statistics\\n\\n# import functools\\n\\n# import operator\\n\\n## external modules\\n\\n# import scipy.special # if use comb function on AtCoder, \\n\\n# import scipy.misc # select scipy.misc.comb (old version) \\n\\n\\n\\ndef main():\\n\\n n, *a = (int(x) for x in sys.stdin.read().split())\\n\\n \\n\\n for i in range(n):\\n\\n a[i] -= (i + 1)\\n\\n\\n\\n if n % 2 != 0:\\n\\n b = statistics.median(a)\\n\\n else:\\n\\n if a.count(statistics.median_high(a)) >= a.count(statistics.median_low(a)):\\n\\n b = statistics.median_high(a)\\n\\n else:\\n\\n b = statistics.median_low(a)\\n\\n \\n\\n ans = sum([abs(a[i] - b) for i in range(n)])\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n # execute only if run as a script\\n\\n main()\\n\\n\\n\\n\\n',\n", + " 'target': \"import sys\\n\\n\\n\\nn, *a = list(map(int, sys.stdin.read().split()))\\n\\n\\n\\ndef main():\\n\\n for i in range(n):\\n\\n a[i] -= (i + 1)\\n\\n a.sort()\\n\\n b = a[n // 2]\\n\\n res = 0\\n\\n for i in range(n):\\n\\n res += abs(a[i] - b)\\n\\n \\n\\n return res\\n\\n \\n\\nif __name__ == '__main__':\\n\\n ans = main()\\n\\n print(ans)\",\n", + " 'code_v0_loc': 40,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 987,\n", + " 'code_v1_num_chars': 310,\n", + " 'code_v0_no_empty_lines': '# author: kagemeka\\n# created: 2019-11-08 14:51:29(JST)\\n## internal modules\\nimport sys\\n\\n# import collections\\n# import math\\n# import string\\n# import bisect\\n# import re\\n# import itertools\\nimport statistics\\n\\n# import functools\\n# import operator\\n## external modules\\n# import scipy.special # if use comb function on AtCoder,\\n# import scipy.misc # select scipy.misc.comb (old version)\\ndef main():\\n n, *a = (int(x) for x in sys.stdin.read().split())\\n for i in range(n):\\n a[i] -= i + 1\\n if n % 2 != 0:\\n b = statistics.median(a)\\n else:\\n if a.count(statistics.median_high(a)) >= a.count(statistics.median_low(a)):\\n b = statistics.median_high(a)\\n else:\\n b = statistics.median_low(a)\\n ans = sum([abs(a[i] - b) for i in range(n)])\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n # execute only if run as a script\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nn, *a = list(map(int, sys.stdin.read().split()))\\n\\n\\ndef main():\\n for i in range(n):\\n a[i] -= i + 1\\n a.sort()\\n b = a[n // 2]\\n res = 0\\n for i in range(n):\\n res += abs(a[i] - b)\\n return res\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.0,\n", + " 'diff': ['-# author: kagemeka',\n", + " '-# created: 2019-11-08 14:51:29(JST)',\n", + " '-## internal modules',\n", + " '-# import collections',\n", + " '-# import math',\n", + " '-# import string',\n", + " '-# import bisect',\n", + " '-# import re',\n", + " '-# import itertools',\n", + " '-import statistics',\n", + " '+n, *a = list(map(int, sys.stdin.read().split()))',\n", + " '-# import functools',\n", + " '-# import operator',\n", + " '-## external modules',\n", + " '-# import scipy.special # if use comb function on AtCoder,',\n", + " '-# import scipy.misc # select scipy.misc.comb (old version)',\n", + " '+',\n", + " '- n, *a = (int(x) for x in sys.stdin.read().split())',\n", + " '- if n % 2 != 0:',\n", + " '- b = statistics.median(a)',\n", + " '- else:',\n", + " '- if a.count(statistics.median_high(a)) >= a.count(statistics.median_low(a)):',\n", + " '- b = statistics.median_high(a)',\n", + " '- else:',\n", + " '- b = statistics.median_low(a)',\n", + " '- ans = sum([abs(a[i] - b) for i in range(n)])',\n", + " '- print(ans)',\n", + " '+ a.sort()',\n", + " '+ b = a[n // 2]',\n", + " '+ res = 0',\n", + " '+ for i in range(n):',\n", + " '+ res += abs(a[i] - b)',\n", + " '+ return res',\n", + " '- # execute only if run as a script',\n", + " '- main()',\n", + " '+ ans = main()',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2726693273,\n", + " 'measured_runtime_v1': 0.2052652476,\n", + " 'runtime_lift': 1.3283755066,\n", + " 'key': ['s802702568', 's939867576']},\n", + " {'user_id': 'u806976856',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's550500681',\n", + " 'submission_id_v1': 's439989437',\n", + " 'cpu_time_v0': 123,\n", + " 'cpu_time_v1': 70,\n", + " 'memory_v0': 9160,\n", + " 'memory_v1': 64844,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.09,\n", + " 'input': 's=int(eval(input()))\\n\\np=10**9+7\\n\\nif s<=2:\\n\\n print((0))\\n\\n exit()\\n\\nn=s//3\\n\\nans=0\\n\\ndef f(n,k,p):\\n\\n if k==0:\\n\\n return 1\\n\\n elif k%2==0:\\n\\n return (f(n,k//2,p)**2)%p\\n\\n else:\\n\\n return (n*f(n,k-1,p))%p\\n\\n\\n\\nfor k in range(1,n+1):\\n\\n a=1\\n\\n b=1\\n\\n for j in range(k-1):\\n\\n a=(a*(s-3*k+1+j))%p\\n\\n b=(b*(j+1))%p\\n\\n ans=(ans+a*f(b,p-2,p))%p\\n\\n\\n\\nprint((ans%p))\\n\\n\\n',\n", + " 'target': 's=int(eval(input()))\\n\\np=10**9+7\\n\\nif s<=2:\\n\\n print((0))\\n\\n exit()\\n\\nn=s//3\\n\\nans=0\\n\\nx=[0]*(s+1)\\n\\nx[0]=1\\n\\nx[1]=1\\n\\ny=[0]*(s+1)\\n\\n\\n\\nfor i in range(2,s+1):\\n\\n x[i]=x[i-1]*i%p\\n\\n\\n\\ny[s]=pow(x[s],p-2,p)\\n\\nfor i in range(s):\\n\\n y[s-1-i]=y[s-i]*(s-i)%p\\n\\n\\n\\nfor k in range(1,n+1):\\n\\n ans+=x[s-2*k-1]*y[k-1]*y[s-3*k]%p\\n\\n\\n\\nprint((ans%p))\\n\\n\\n',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 391,\n", + " 'code_v1_num_chars': 322,\n", + " 'code_v0_no_empty_lines': 's = int(eval(input()))\\np = 10**9 + 7\\nif s <= 2:\\n print((0))\\n exit()\\nn = s // 3\\nans = 0\\n\\n\\ndef f(n, k, p):\\n if k == 0:\\n return 1\\n elif k % 2 == 0:\\n return (f(n, k // 2, p) ** 2) % p\\n else:\\n return (n * f(n, k - 1, p)) % p\\n\\n\\nfor k in range(1, n + 1):\\n a = 1\\n b = 1\\n for j in range(k - 1):\\n a = (a * (s - 3 * k + 1 + j)) % p\\n b = (b * (j + 1)) % p\\n ans = (ans + a * f(b, p - 2, p)) % p\\nprint((ans % p))\\n',\n", + " 'code_v1_no_empty_lines': 's = int(eval(input()))\\np = 10**9 + 7\\nif s <= 2:\\n print((0))\\n exit()\\nn = s // 3\\nans = 0\\nx = [0] * (s + 1)\\nx[0] = 1\\nx[1] = 1\\ny = [0] * (s + 1)\\nfor i in range(2, s + 1):\\n x[i] = x[i - 1] * i % p\\ny[s] = pow(x[s], p - 2, p)\\nfor i in range(s):\\n y[s - 1 - i] = y[s - i] * (s - i) % p\\nfor k in range(1, n + 1):\\n ans += x[s - 2 * k - 1] * y[k - 1] * y[s - 3 * k] % p\\nprint((ans % p))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.0,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def f(n, k, p):',\n", + " '- if k == 0:',\n", + " '- return 1',\n", + " '- elif k % 2 == 0:',\n", + " '- return (f(n, k // 2, p) ** 2) % p',\n", + " '- else:',\n", + " '- return (n * f(n, k - 1, p)) % p',\n", + " '-',\n", + " '-',\n", + " '+x = [0] * (s + 1)',\n", + " '+x[0] = 1',\n", + " '+x[1] = 1',\n", + " '+y = [0] * (s + 1)',\n", + " '+for i in range(2, s + 1):',\n", + " '+ x[i] = x[i - 1] * i % p',\n", + " '+y[s] = pow(x[s], p - 2, p)',\n", + " '+for i in range(s):',\n", + " '+ y[s - 1 - i] = y[s - i] * (s - i) % p',\n", + " '- a = 1',\n", + " '- b = 1',\n", + " '- for j in range(k - 1):',\n", + " '- a = (a * (s - 3 * k + 1 + j)) % p',\n", + " '- b = (b * (j + 1)) % p',\n", + " '- ans = (ans + a * f(b, p - 2, p)) % p',\n", + " '+ ans += x[s - 2 * k - 1] * y[k - 1] * y[s - 3 * k] % p'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3091425891,\n", + " 'measured_runtime_v1': 0.216736346,\n", + " 'runtime_lift': 1.4263532387,\n", + " 'key': ['s550500681', 's439989437']},\n", + " {'user_id': 'u252828980',\n", + " 'problem_id': 'p03568',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's580844178',\n", + " 'submission_id_v1': 's651852186',\n", + " 'cpu_time_v0': 306,\n", + " 'cpu_time_v1': 168,\n", + " 'memory_v0': 27248,\n", + " 'memory_v1': 8704,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 45.1,\n", + " 'input': 'import numpy as np\\n\\nfrom itertools import product\\n\\n\\n\\nn = int(eval(input()))\\n\\na = list(map(int,input().split()))\\n\\n\\n\\na = np.array(a)\\n\\n\\n\\nli = [-1,0,1]\\n\\ncnt = 0\\n\\nfor v in product(li,repeat = n):\\n\\n v = np.array(v)\\n\\n L =a+v\\n\\n cum = L.cumprod()\\n\\n if cum[-1]%2 ==0 :\\n\\n cnt +=1\\n\\nprint(cnt)\\n\\n ',\n", + " 'target': 'n = int(eval(input()))\\n\\na = list(map(int,input().split()))\\n\\n\\n\\nfrom itertools import product\\n\\n\\n\\nli = [-1,0,1]\\n\\ncnt = 0\\n\\nfor v in product(li,repeat = n):\\n\\n L = []\\n\\n for i in range(n):\\n\\n L.append(v[i]+a[i])\\n\\n if any(x%2==0 for x in L):\\n\\n cnt +=1\\n\\n\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 303,\n", + " 'code_v1_num_chars': 273,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nfrom itertools import product\\n\\nn = int(eval(input()))\\na = list(map(int, input().split()))\\na = np.array(a)\\nli = [-1, 0, 1]\\ncnt = 0\\nfor v in product(li, repeat=n):\\n v = np.array(v)\\n L = a + v\\n cum = L.cumprod()\\n if cum[-1] % 2 == 0:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nfrom itertools import product\\n\\nli = [-1, 0, 1]\\ncnt = 0\\nfor v in product(li, repeat=n):\\n L = []\\n for i in range(n):\\n L.append(v[i] + a[i])\\n if any(x % 2 == 0 for x in L):\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '+n = int(eval(input()))',\n", + " '+a = list(map(int, input().split()))',\n", + " '-n = int(eval(input()))',\n", + " '-a = list(map(int, input().split()))',\n", + " '-a = np.array(a)',\n", + " '- v = np.array(v)',\n", + " '- L = a + v',\n", + " '- cum = L.cumprod()',\n", + " '- if cum[-1] % 2 == 0:',\n", + " '+ L = []',\n", + " '+ for i in range(n):',\n", + " '+ L.append(v[i] + a[i])',\n", + " '+ if any(x % 2 == 0 for x in L):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8323921626,\n", + " 'measured_runtime_v1': 0.5995062318,\n", + " 'runtime_lift': 3.056502277,\n", + " 'key': ['s580844178', 's651852186']},\n", + " {'user_id': 'u645250356',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's106501170',\n", + " 'submission_id_v1': 's046181145',\n", + " 'cpu_time_v0': 232,\n", + " 'cpu_time_v1': 205,\n", + " 'memory_v0': 43632,\n", + " 'memory_v1': 40808,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.64,\n", + " 'input': \"from collections import Counter,defaultdict,deque\\n\\nimport sys,bisect,math,itertools,string,queue\\n\\nfrom heapq import heappop, heappush\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef inpl_str(): return list(sys.stdin.readline().split())\\n\\ndef inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\n\\nn = inp()\\n\\nres = float('inf')\\n\\nfor i in range(1,2*10**6):\\n\\n if (n/i).is_integer():\\n\\n res = min(res, i + n/i)\\n\\nprint((int(res-2)))\\n\",\n", + " 'target': \"from collections import Counter,defaultdict,deque\\n\\nimport sys,bisect,math,itertools,string,queue\\n\\nfrom heapq import heappop, heappush\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\ndef inp(): return int(sys.stdin.readline())\\n\\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef inpl_str(): return list(sys.stdin.readline().split())\\n\\ndef inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\n\\nn = inp()\\n\\nres = float('inf')\\n\\nfor i in range(1,int(math.sqrt(n))+1):\\n\\n if n%i == 0:\\n\\n res = min(res, i + n/i)\\n\\nprint((int(res-2)))\\n\",\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 561,\n", + " 'code_v1_num_chars': 563,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nimport sys, bisect, math, itertools, string, queue\\nfrom heapq import heappop, heappush\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef inpl_str():\\n return list(sys.stdin.readline().split())\\n\\n\\ndef inpln(n):\\n return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\nn = inp()\\nres = float(\"inf\")\\nfor i in range(1, 2 * 10**6):\\n if (n / i).is_integer():\\n res = min(res, i + n / i)\\nprint((int(res - 2)))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter, defaultdict, deque\\nimport sys, bisect, math, itertools, string, queue\\nfrom heapq import heappop, heappush\\n\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n\\n\\ndef inp():\\n return int(sys.stdin.readline())\\n\\n\\ndef inpl():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef inpl_str():\\n return list(sys.stdin.readline().split())\\n\\n\\ndef inpln(n):\\n return list(int(sys.stdin.readline()) for i in range(n))\\n\\n\\nn = inp()\\nres = float(\"inf\")\\nfor i in range(1, int(math.sqrt(n)) + 1):\\n if n % i == 0:\\n res = min(res, i + n / i)\\nprint((int(res - 2)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in range(1, 2 * 10**6):',\n", + " '- if (n / i).is_integer():',\n", + " '+for i in range(1, int(math.sqrt(n)) + 1):',\n", + " '+ if n % i == 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4036093347,\n", + " 'measured_runtime_v1': 0.1584749897,\n", + " 'runtime_lift': 8.856976976,\n", + " 'key': ['s106501170', 's046181145']},\n", + " {'user_id': 'u683134447',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's609480946',\n", + " 'submission_id_v1': 's469579435',\n", + " 'cpu_time_v0': 529,\n", + " 'cpu_time_v1': 230,\n", + " 'memory_v0': 34168,\n", + " 'memory_v1': 27248,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 56.52,\n", + " 'input': 'import numpy as np\\n\\nn = int(eval(input()))\\n\\nal = list(map(int,input().split()))\\n\\n\\n\\nfor i in range(n):\\n\\n al[i] -= i + 1\\n\\n\\n\\nmed = np.median(np.array(al))\\n\\n\\n\\nans = 0\\n\\nfor a in al:\\n\\n ans += abs(a-med)\\n\\nprint((int(ans)))',\n", + " 'target': 'import statistics\\n\\nn = int(eval(input()))\\n\\nal = list(map(int,input().split()))\\n\\n\\n\\nfor i in range(n):\\n\\n al[i] -= i + 1\\n\\n\\n\\nmedian = statistics.median(al)\\n\\n\\n\\nans = 0\\n\\nfor a in al:\\n\\n ans += abs(median - a)\\n\\n\\n\\nprint((int(ans)))\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 213,\n", + " 'code_v1_num_chars': 221,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nal = list(map(int, input().split()))\\nfor i in range(n):\\n al[i] -= i + 1\\nmed = np.median(np.array(al))\\nans = 0\\nfor a in al:\\n ans += abs(a - med)\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'import statistics\\n\\nn = int(eval(input()))\\nal = list(map(int, input().split()))\\nfor i in range(n):\\n al[i] -= i + 1\\nmedian = statistics.median(al)\\nans = 0\\nfor a in al:\\n ans += abs(median - a)\\nprint((int(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.1428571429,\n", + " 'diff': ['-import numpy as np',\n", + " '+import statistics',\n", + " '-med = np.median(np.array(al))',\n", + " '+median = statistics.median(al)',\n", + " '- ans += abs(a - med)',\n", + " '+ ans += abs(median - a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7668625765,\n", + " 'measured_runtime_v1': 0.4307871597,\n", + " 'runtime_lift': 4.1014745605,\n", + " 'key': ['s609480946', 's469579435']},\n", + " {'user_id': 'u808806124',\n", + " 'problem_id': 'p03837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's131974158',\n", + " 'submission_id_v1': 's793289076',\n", + " 'cpu_time_v0': 1652,\n", + " 'cpu_time_v1': 347,\n", + " 'memory_v0': 14552,\n", + " 'memory_v1': 3556,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.0,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn, m = list(map(int, input().split()))\\n\\n\\n\\nd = np.ones((n, n)) * 1001\\n\\n\\n\\nes = []\\n\\nfor i in range(m):\\n\\n es.append(list(map(int, input().split())))\\n\\n\\n\\nfor (i, j, w) in es:\\n\\n d[i - 1][j - 1] = w\\n\\n d[j - 1][i - 1] = w\\n\\n\\n\\n\\n\\nfor k in range(n):\\n\\n for i in range(n):\\n\\n for j in range(n):\\n\\n l = d[i][k] + d[k][j]\\n\\n if d[i][j] > l:\\n\\n d[i][j] = l\\n\\n\\n\\nc = 0\\n\\nfor (i, j, w) in es:\\n\\n if d[i - 1][j - 1] < w:\\n\\n c += 1\\n\\n\\n\\nprint(c)\\n',\n", + " 'target': 'n, m = list(map(int, input().split()))\\n\\n\\n\\nd = [[1001] * n for i in range(n)]\\n\\n\\n\\nes = []\\n\\nfor i in range(m):\\n\\n es.append(list(map(int, input().split())))\\n\\n\\n\\nfor (i, j, w) in es:\\n\\n d[i - 1][j - 1] = w\\n\\n d[j - 1][i - 1] = w\\n\\n\\n\\n\\n\\nfor k in range(n):\\n\\n for i in range(n):\\n\\n for j in range(n):\\n\\n l = d[i][k] + d[k][j]\\n\\n if d[i][j] > l:\\n\\n d[i][j] = l\\n\\n\\n\\nc = 0\\n\\nfor (i, j, w) in es:\\n\\n if d[i - 1][j - 1] < w:\\n\\n c += 1\\n\\n\\n\\nprint(c)',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 495,\n", + " 'code_v1_num_chars': 480,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, m = list(map(int, input().split()))\\nd = np.ones((n, n)) * 1001\\nes = []\\nfor i in range(m):\\n es.append(list(map(int, input().split())))\\nfor (i, j, w) in es:\\n d[i - 1][j - 1] = w\\n d[j - 1][i - 1] = w\\nfor k in range(n):\\n for i in range(n):\\n for j in range(n):\\n l = d[i][k] + d[k][j]\\n if d[i][j] > l:\\n d[i][j] = l\\nc = 0\\nfor (i, j, w) in es:\\n if d[i - 1][j - 1] < w:\\n c += 1\\nprint(c)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nd = [[1001] * n for i in range(n)]\\nes = []\\nfor i in range(m):\\n es.append(list(map(int, input().split())))\\nfor (i, j, w) in es:\\n d[i - 1][j - 1] = w\\n d[j - 1][i - 1] = w\\nfor k in range(n):\\n for i in range(n):\\n for j in range(n):\\n l = d[i][k] + d[k][j]\\n if d[i][j] > l:\\n d[i][j] = l\\nc = 0\\nfor (i, j, w) in es:\\n if d[i - 1][j - 1] < w:\\n c += 1\\nprint(c)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.1428571429,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-d = np.ones((n, n)) * 1001',\n", + " '+d = [[1001] * n for i in range(n)]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1350366999,\n", + " 'measured_runtime_v1': 0.2769060681,\n", + " 'runtime_lift': 7.710328324,\n", + " 'key': ['s131974158', 's793289076']},\n", + " {'user_id': 'u648881683',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's824836675',\n", + " 'submission_id_v1': 's558243892',\n", + " 'cpu_time_v0': 799,\n", + " 'cpu_time_v1': 244,\n", + " 'memory_v0': 24192,\n", + " 'memory_v1': 16272,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 69.46,\n", + " 'input': 'from functools import reduce\\n\\nimport fractions\\n\\nimport numpy as np\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\na = np.array(list(map(int, input().split())))\\n\\n\\n\\na = a // 2\\n\\n\\n\\ndef lcm_base(x, y):\\n\\n return (x * y) // fractions.gcd(x, y)\\n\\n\\n\\ndef lcm(*numbers):\\n\\n return reduce(lcm_base, numbers, 1)\\n\\n\\n\\nl = lcm(*a)\\n\\nexist = not 0 in ((l//a)%2)\\n\\n\\n\\nif exist:\\n\\n print(((M // l + 1 ) // 2))\\n\\nelse:\\n\\n print((0))',\n", + " 'target': \"import sys, fractions, functools\\n\\ninput = lambda: sys.stdin.readline().rstrip() \\n\\nsys.setrecursionlimit(10**7)\\n\\nINF = 10**20\\n\\ndef I(): return int(eval(input()))\\n\\ndef F(): return float(eval(input()))\\n\\ndef S(): return eval(input())\\n\\ndef LI(): return [int(x) for x in input().split()]\\n\\ndef LI_(): return [int(x)-1 for x in input().split()]\\n\\ndef LF(): return [float(x) for x in input().split()]\\n\\ndef LS(): return input().split()\\n\\n\\n\\ndef lcm_base(x, y):\\n\\n return (x * y) // fractions.gcd(x, y)\\n\\n\\n\\ndef lcm_list(numbers):\\n\\n return functools.reduce(lcm_base, numbers, 1)\\n\\n\\n\\ndef resolve():\\n\\n N, M = LI()\\n\\n a = LI()\\n\\n\\n\\n a_half = [i//2 for i in a]\\n\\n a_half_lcm = lcm_list(a_half)\\n\\n has_scm = not 0 in [a_half_lcm//i%2 for i in a_half]\\n\\n\\n\\n if has_scm:\\n\\n print(((M-a_half_lcm)//(2*a_half_lcm)+1))\\n\\n else:\\n\\n print((0))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n resolve()\",\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 401,\n", + " 'code_v1_num_chars': 867,\n", + " 'code_v0_no_empty_lines': 'from functools import reduce\\nimport fractions\\nimport numpy as np\\n\\nN, M = list(map(int, input().split()))\\na = np.array(list(map(int, input().split())))\\na = a // 2\\n\\n\\ndef lcm_base(x, y):\\n return (x * y) // fractions.gcd(x, y)\\n\\n\\ndef lcm(*numbers):\\n return reduce(lcm_base, numbers, 1)\\n\\n\\nl = lcm(*a)\\nexist = not 0 in ((l // a) % 2)\\nif exist:\\n print(((M // l + 1) // 2))\\nelse:\\n print((0))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys, fractions, functools\\n\\ninput = lambda: sys.stdin.readline().rstrip()\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\n\\n\\ndef I():\\n return int(eval(input()))\\n\\n\\ndef F():\\n return float(eval(input()))\\n\\n\\ndef S():\\n return eval(input())\\n\\n\\ndef LI():\\n return [int(x) for x in input().split()]\\n\\n\\ndef LI_():\\n return [int(x) - 1 for x in input().split()]\\n\\n\\ndef LF():\\n return [float(x) for x in input().split()]\\n\\n\\ndef LS():\\n return input().split()\\n\\n\\ndef lcm_base(x, y):\\n return (x * y) // fractions.gcd(x, y)\\n\\n\\ndef lcm_list(numbers):\\n return functools.reduce(lcm_base, numbers, 1)\\n\\n\\ndef resolve():\\n N, M = LI()\\n a = LI()\\n a_half = [i // 2 for i in a]\\n a_half_lcm = lcm_list(a_half)\\n has_scm = not 0 in [a_half_lcm // i % 2 for i in a_half]\\n if has_scm:\\n print(((M - a_half_lcm) // (2 * a_half_lcm) + 1))\\n else:\\n print((0))\\n\\n\\nif __name__ == \"__main__\":\\n resolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-from functools import reduce',\n", + " '-import fractions',\n", + " '-import numpy as np',\n", + " '+import sys, fractions, functools',\n", + " '-N, M = list(map(int, input().split()))',\n", + " '-a = np.array(list(map(int, input().split())))',\n", + " '-a = a // 2',\n", + " '+input = lambda: sys.stdin.readline().rstrip()',\n", + " '+sys.setrecursionlimit(10**7)',\n", + " '+INF = 10**20',\n", + " '+',\n", + " '+',\n", + " '+def I():',\n", + " '+ return int(eval(input()))',\n", + " '+',\n", + " '+',\n", + " '+def F():',\n", + " '+ return float(eval(input()))',\n", + " '+',\n", + " '+',\n", + " '+def S():',\n", + " '+ return eval(input())',\n", + " '+',\n", + " '+',\n", + " '+def LI():',\n", + " '+ return [int(x) for x in input().split()]',\n", + " '+',\n", + " '+',\n", + " '+def LI_():',\n", + " '+ return [int(x) - 1 for x in input().split()]',\n", + " '+',\n", + " '+',\n", + " '+def LF():',\n", + " '+ return [float(x) for x in input().split()]',\n", + " '+',\n", + " '+',\n", + " '+def LS():',\n", + " '+ return input().split()',\n", + " '-def lcm(*numbers):',\n", + " '- return reduce(lcm_base, numbers, 1)',\n", + " '+def lcm_list(numbers):',\n", + " '+ return functools.reduce(lcm_base, numbers, 1)',\n", + " '-l = lcm(*a)',\n", + " '-exist = not 0 in ((l // a) % 2)',\n", + " '-if exist:',\n", + " '- print(((M // l + 1) // 2))',\n", + " '-else:',\n", + " '- print((0))',\n", + " '+def resolve():',\n", + " '+ N, M = LI()',\n", + " '+ a = LI()',\n", + " '+ a_half = [i // 2 for i in a]',\n", + " '+ a_half_lcm = lcm_list(a_half)',\n", + " '+ has_scm = not 0 in [a_half_lcm // i % 2 for i in a_half]',\n", + " '+ if has_scm:',\n", + " '+ print(((M - a_half_lcm) // (2 * a_half_lcm) + 1))',\n", + " '+ else:',\n", + " '+ print((0))',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ resolve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2936481755,\n", + " 'measured_runtime_v1': 0.2801775889,\n", + " 'runtime_lift': 4.6172435859,\n", + " 'key': ['s824836675', 's558243892']},\n", + " {'user_id': 'u023958502',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's601919152',\n", + " 'submission_id_v1': 's937084523',\n", + " 'cpu_time_v0': 140,\n", + " 'cpu_time_v1': 86,\n", + " 'memory_v0': 19300,\n", + " 'memory_v1': 15588,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 38.57,\n", + " 'input': \"n = int(eval(input()))\\n\\na = list(map(int,input().split()))\\n\\nans = [i for i in range(n)]\\n\\na1 = sorted(a)\\n\\nfor i in range(n):\\n\\n num = a[i]\\n\\n ans[num - 1] = str(i + 1)\\n\\n \\n\\nprint((' '.join(ans)))\",\n", + " 'target': 'n = int(eval(input()))\\n\\n# n,k = map(int,input().split())\\n\\na = list(map(int,input().split()))\\n\\nans = [0 for _ in range(n)]\\n\\nfor i in range(n):\\n\\n ans[a[i] - 1] = str(i + 1)\\n\\nprint((\" \".join(ans)))',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 192,\n", + " 'code_v1_num_chars': 187,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nans = [i for i in range(n)]\\na1 = sorted(a)\\nfor i in range(n):\\n num = a[i]\\n ans[num - 1] = str(i + 1)\\nprint((\" \".join(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\n# n,k = map(int,input().split())\\na = list(map(int, input().split()))\\nans = [0 for _ in range(n)]\\nfor i in range(n):\\n ans[a[i] - 1] = str(i + 1)\\nprint((\" \".join(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['+# n,k = map(int,input().split())',\n", + " '-ans = [i for i in range(n)]',\n", + " '-a1 = sorted(a)',\n", + " '+ans = [0 for _ in range(n)]',\n", + " '- num = a[i]',\n", + " '- ans[num - 1] = str(i + 1)',\n", + " '+ ans[a[i] - 1] = str(i + 1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2984062884,\n", + " 'measured_runtime_v1': 0.2260574257,\n", + " 'runtime_lift': 1.3200463887,\n", + " 'key': ['s601919152', 's937084523']},\n", + " {'user_id': 'u777923818',\n", + " 'problem_id': 'p03425',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's258539301',\n", + " 'submission_id_v1': 's541501179',\n", + " 'cpu_time_v0': 165,\n", + " 'cpu_time_v1': 142,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 9336,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.94,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\nfrom collections import defaultdict\\n\\nfrom itertools import combinations\\n\\nN = int(eval(input()))\\n\\nC = [0, 0, 0, 0, 0, 0]\\n\\nD = defaultdict(int)\\n\\nfor i, m in enumerate(\"MARCH\", start=1):\\n\\n D[m] = i\\n\\n\\n\\nfor _ in range(N):\\n\\n C[D[input()[0]]] += 1\\n\\n\\n\\nans = 0\\n\\nfor a, b, c in combinations(list(range(1, 6)), r=3):\\n\\n ans += C[a]*C[b]*C[c]\\n\\nprint(ans)',\n", + " 'target': 'from collections import defaultdict\\n\\nfrom itertools import combinations\\n\\ndef inpl(): return list(map(int, input().split()))\\n\\n\\n\\nC = defaultdict(int)\\n\\nN = int(eval(input()))\\n\\nfor _ in range(N):\\n\\n C[input()[0]] += 1\\n\\n\\n\\nres = 0\\n\\nfor H in combinations(\"MARCH\", r=3):\\n\\n res += C[H[0]] * C[H[1]] * C[H[2]]\\n\\nprint(res)',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 363,\n", + " 'code_v1_num_chars': 310,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nfrom collections import defaultdict\\nfrom itertools import combinations\\n\\nN = int(eval(input()))\\nC = [0, 0, 0, 0, 0, 0]\\nD = defaultdict(int)\\nfor i, m in enumerate(\"MARCH\", start=1):\\n D[m] = i\\nfor _ in range(N):\\n C[D[input()[0]]] += 1\\nans = 0\\nfor a, b, c in combinations(list(range(1, 6)), r=3):\\n ans += C[a] * C[b] * C[c]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\nfrom itertools import combinations\\n\\n\\ndef inpl():\\n return list(map(int, input().split()))\\n\\n\\nC = defaultdict(int)\\nN = int(eval(input()))\\nfor _ in range(N):\\n C[input()[0]] += 1\\nres = 0\\nfor H in combinations(\"MARCH\", r=3):\\n res += C[H[0]] * C[H[1]] * C[H[2]]\\nprint(res)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.75,\n", + " 'diff': ['-# -*- coding: utf-8 -*-',\n", + " '+',\n", + " '+def inpl():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+C = defaultdict(int)',\n", + " '-C = [0, 0, 0, 0, 0, 0]',\n", + " '-D = defaultdict(int)',\n", + " '-for i, m in enumerate(\"MARCH\", start=1):',\n", + " '- D[m] = i',\n", + " '- C[D[input()[0]]] += 1',\n", + " '-ans = 0',\n", + " '-for a, b, c in combinations(list(range(1, 6)), r=3):',\n", + " '- ans += C[a] * C[b] * C[c]',\n", + " '-print(ans)',\n", + " '+ C[input()[0]] += 1',\n", + " '+res = 0',\n", + " '+for H in combinations(\"MARCH\", r=3):',\n", + " '+ res += C[H[0]] * C[H[1]] * C[H[2]]',\n", + " '+print(res)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.388673193,\n", + " 'measured_runtime_v1': 0.2150466468,\n", + " 'runtime_lift': 1.8073901578,\n", + " 'key': ['s258539301', 's541501179']},\n", + " {'user_id': 'u297574184',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's609062581',\n", + " 'submission_id_v1': 's989407304',\n", + " 'cpu_time_v0': 358,\n", + " 'cpu_time_v1': 258,\n", + " 'memory_v0': 35944,\n", + " 'memory_v1': 38716,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.93,\n", + " 'input': \"from collections import Counter\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef solve():\\n\\n N = int(eval(input()))\\n\\n Sss = [input().rstrip() for _ in range(N)]\\n\\n\\n\\n cnt = Counter(Sss)\\n\\n #print('cnt:', cnt)\\n\\n\\n\\n maxNum = max(cnt.values())\\n\\n #print('maxNum:', maxNum)\\n\\n\\n\\n anss = []\\n\\n for key, value in list(cnt.items()):\\n\\n if value == maxNum:\\n\\n anss.append(key)\\n\\n #print('anss:', anss)\\n\\n\\n\\n anss.sort()\\n\\n\\n\\n print(('\\\\n'.join(anss)))\\n\\n\\n\\n\\n\\nsolve()\\n\",\n", + " 'target': \"from collections import Counter\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nN = int(eval(input()))\\n\\nSss = [input().rstrip() for _ in range(N)]\\n\\n\\n\\ncnt = Counter(Sss)\\n\\n\\n\\nnum = max(cnt.values())\\n\\n\\n\\nanss = []\\n\\nfor key in sorted(cnt.keys()):\\n\\n if cnt[key] == num:\\n\\n anss.append(key)\\n\\n\\n\\nprint(('\\\\n'.join(anss)))\\n\",\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 475,\n", + " 'code_v1_num_chars': 307,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef solve():\\n N = int(eval(input()))\\n Sss = [input().rstrip() for _ in range(N)]\\n cnt = Counter(Sss)\\n # print(\\'cnt:\\', cnt)\\n maxNum = max(cnt.values())\\n # print(\\'maxNum:\\', maxNum)\\n anss = []\\n for key, value in list(cnt.items()):\\n if value == maxNum:\\n anss.append(key)\\n # print(\\'anss:\\', anss)\\n anss.sort()\\n print((\"\\\\n\".join(anss)))\\n\\n\\nsolve()\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\nimport sys\\n\\ninput = sys.stdin.readline\\nN = int(eval(input()))\\nSss = [input().rstrip() for _ in range(N)]\\ncnt = Counter(Sss)\\nnum = max(cnt.values())\\nanss = []\\nfor key in sorted(cnt.keys()):\\n if cnt[key] == num:\\n anss.append(key)\\nprint((\"\\\\n\".join(anss)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 34.6153846154,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def solve():',\n", + " '- N = int(eval(input()))',\n", + " '- Sss = [input().rstrip() for _ in range(N)]',\n", + " '- cnt = Counter(Sss)',\n", + " \"- # print('cnt:', cnt)\",\n", + " '- maxNum = max(cnt.values())',\n", + " \"- # print('maxNum:', maxNum)\",\n", + " '- anss = []',\n", + " '- for key, value in list(cnt.items()):',\n", + " '- if value == maxNum:',\n", + " '- anss.append(key)',\n", + " \"- # print('anss:', anss)\",\n", + " '- anss.sort()',\n", + " '- print((\"\\\\n\".join(anss)))',\n", + " '-',\n", + " '-',\n", + " '-solve()',\n", + " '+N = int(eval(input()))',\n", + " '+Sss = [input().rstrip() for _ in range(N)]',\n", + " '+cnt = Counter(Sss)',\n", + " '+num = max(cnt.values())',\n", + " '+anss = []',\n", + " '+for key in sorted(cnt.keys()):',\n", + " '+ if cnt[key] == num:',\n", + " '+ anss.append(key)',\n", + " '+print((\"\\\\n\".join(anss)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2647752221,\n", + " 'measured_runtime_v1': 0.1462080963,\n", + " 'runtime_lift': 1.8109477437,\n", + " 'key': ['s609062581', 's989407304']},\n", + " {'user_id': 'u186206732',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's935693074',\n", + " 'submission_id_v1': 's530388872',\n", + " 'cpu_time_v0': 399,\n", + " 'cpu_time_v1': 352,\n", + " 'memory_v0': 14996,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.78,\n", + " 'input': 'def main():\\n\\n n = int(eval(input()))\\n\\n a = [0]\\n\\n b = [0]\\n\\n c = [0]\\n\\n\\n\\n for i in range(n):\\n\\n aa,bb,cc = list(map(int,input().split()))\\n\\n a.append(max(b[i] + aa, c[i] + aa))\\n\\n b.append(max(a[i] + bb, c[i] + bb))\\n\\n c.append(max(a[i] + cc, b[i] + cc))\\n\\n\\n\\n print((max(a[-1], b[-1], c[-1])))\\n\\n\\n\\nmain()',\n", + " 'target': 'def main():\\n\\n n = int(eval(input()))\\n\\n a = 0\\n\\n b = 0\\n\\n c = 0\\n\\n\\n\\n for i in range(n):\\n\\n aa,bb,cc = list(map(int,input().split()))\\n\\n a,b,c = max(b,c)+aa, max(a,c)+bb, max(a,b)+cc\\n\\n\\n\\n print((max(a,b,c)))\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 307,\n", + " 'code_v1_num_chars': 228,\n", + " 'code_v0_no_empty_lines': 'def main():\\n n = int(eval(input()))\\n a = [0]\\n b = [0]\\n c = [0]\\n for i in range(n):\\n aa, bb, cc = list(map(int, input().split()))\\n a.append(max(b[i] + aa, c[i] + aa))\\n b.append(max(a[i] + bb, c[i] + bb))\\n c.append(max(a[i] + cc, b[i] + cc))\\n print((max(a[-1], b[-1], c[-1])))\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n n = int(eval(input()))\\n a = 0\\n b = 0\\n c = 0\\n for i in range(n):\\n aa, bb, cc = list(map(int, input().split()))\\n a, b, c = max(b, c) + aa, max(a, c) + bb, max(a, b) + cc\\n print((max(a, b, c)))\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.3333333333,\n", + " 'diff': ['- a = [0]',\n", + " '- b = [0]',\n", + " '- c = [0]',\n", + " '+ a = 0',\n", + " '+ b = 0',\n", + " '+ c = 0',\n", + " '- a.append(max(b[i] + aa, c[i] + aa))',\n", + " '- b.append(max(a[i] + bb, c[i] + bb))',\n", + " '- c.append(max(a[i] + cc, b[i] + cc))',\n", + " '- print((max(a[-1], b[-1], c[-1])))',\n", + " '+ a, b, c = max(b, c) + aa, max(a, c) + bb, max(a, b) + cc',\n", + " '+ print((max(a, b, c)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2658671594,\n", + " 'measured_runtime_v1': 0.1864644525,\n", + " 'runtime_lift': 1.4258329445,\n", + " 'key': ['s935693074', 's530388872']},\n", + " {'user_id': 'u861466636',\n", + " 'problem_id': 'p03074',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's859028171',\n", + " 'submission_id_v1': 's566775006',\n", + " 'cpu_time_v0': 328,\n", + " 'cpu_time_v1': 144,\n", + " 'memory_v0': 17700,\n", + " 'memory_v1': 7440,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 56.1,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\nS = eval(input())\\n\\n\\n\\nl = [[], []]\\n\\nans = []\\n\\nk = [int(s) for s in S]\\n\\nif k[0] == 0:\\n\\n l[1].append(0)\\n\\nv0 = 1 if k[0] == 0 else 0\\n\\nv1 = 1 if k[0] == 1 else 0\\n\\nfor i in range(1, N):\\n\\n if (k[i]==0) & (k[i-1]==0):\\n\\n v0 += 1\\n\\n elif (k[i]==1) & (k[i-1]==0):\\n\\n l[0].append(v0)\\n\\n v0 = 0\\n\\n v1 += 1\\n\\n elif (k[i]==0) & (k[i-1]==1):\\n\\n l[1].append(v1)\\n\\n v0 += 1\\n\\n v1 = 0 \\n\\n else:\\n\\n v1 += 1\\n\\n \\n\\nfor i, v in enumerate([v0, v1]):\\n\\n if v > 0:\\n\\n l[i].append(v)\\n\\n \\n\\nif k[0] == 0:\\n\\n l[1].append(0)\\n\\n\\n\\nif len(l[0]) <= K:\\n\\n print(N)\\n\\n\\n\\nelse:\\n\\n l[0].extend(np.repeat(0,K+1))\\n\\n l[1].extend(np.repeat(0,K+1))\\n\\n a = sum(l[0][:K]) + sum(l[1][:K+1])\\n\\n ans.append(a)\\n\\n for i in range(1, len(l[0])-K-1):\\n\\n a -= l[0][i-1] + l[1][i-1]\\n\\n a += l[0][i+K-1] + l[1][i+K]\\n\\n ans.append(a)\\n\\n print((max(ans)))',\n", + " 'target': 'N, K = list(map(int, input().split()))\\n\\nS = eval(input())\\n\\n \\n\\nl = [[], []]\\n\\nans = []\\n\\nk = [int(s) for s in S]\\n\\nif k[0] == 0:\\n\\n l[1].append(0)\\n\\nv0 = 1 if k[0] == 0 else 0\\n\\nv1 = 1 if k[0] == 1 else 0\\n\\nfor i in range(1, N):\\n\\n if (k[i]==0) & (k[i-1]==0):\\n\\n v0 += 1\\n\\n elif (k[i]==1) & (k[i-1]==0):\\n\\n l[0].append(v0)\\n\\n v0 = 0\\n\\n v1 += 1\\n\\n elif (k[i]==0) & (k[i-1]==1):\\n\\n l[1].append(v1)\\n\\n v0 += 1\\n\\n v1 = 0 \\n\\n else:\\n\\n v1 += 1\\n\\n \\n\\nfor i, v in enumerate([v0, v1]):\\n\\n if v > 0:\\n\\n l[i].append(v)\\n\\n \\n\\nif k[0] == 0:\\n\\n l[1].append(0)\\n\\n \\n\\nl[0] += [0]*(K+1)\\n\\nl[1] += [0]*(K+1)\\n\\na = sum(l[0][:K]) + sum(l[1][:K+1])\\n\\nans.append(a)\\n\\nfor i in range(1, len(l[0])-K-1):\\n\\n a -= l[0][i-1] + l[1][i-1]\\n\\n a += l[0][i+K-1] + l[1][i+K]\\n\\n ans.append(a)\\n\\nprint((max(ans)))',\n", + " 'code_v0_loc': 46,\n", + " 'code_v1_loc': 40,\n", + " 'code_v0_num_chars': 957,\n", + " 'code_v1_num_chars': 837,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\nS = eval(input())\\nl = [[], []]\\nans = []\\nk = [int(s) for s in S]\\nif k[0] == 0:\\n l[1].append(0)\\nv0 = 1 if k[0] == 0 else 0\\nv1 = 1 if k[0] == 1 else 0\\nfor i in range(1, N):\\n if (k[i] == 0) & (k[i - 1] == 0):\\n v0 += 1\\n elif (k[i] == 1) & (k[i - 1] == 0):\\n l[0].append(v0)\\n v0 = 0\\n v1 += 1\\n elif (k[i] == 0) & (k[i - 1] == 1):\\n l[1].append(v1)\\n v0 += 1\\n v1 = 0\\n else:\\n v1 += 1\\nfor i, v in enumerate([v0, v1]):\\n if v > 0:\\n l[i].append(v)\\nif k[0] == 0:\\n l[1].append(0)\\nif len(l[0]) <= K:\\n print(N)\\nelse:\\n l[0].extend(np.repeat(0, K + 1))\\n l[1].extend(np.repeat(0, K + 1))\\n a = sum(l[0][:K]) + sum(l[1][: K + 1])\\n ans.append(a)\\n for i in range(1, len(l[0]) - K - 1):\\n a -= l[0][i - 1] + l[1][i - 1]\\n a += l[0][i + K - 1] + l[1][i + K]\\n ans.append(a)\\n print((max(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nS = eval(input())\\nl = [[], []]\\nans = []\\nk = [int(s) for s in S]\\nif k[0] == 0:\\n l[1].append(0)\\nv0 = 1 if k[0] == 0 else 0\\nv1 = 1 if k[0] == 1 else 0\\nfor i in range(1, N):\\n if (k[i] == 0) & (k[i - 1] == 0):\\n v0 += 1\\n elif (k[i] == 1) & (k[i - 1] == 0):\\n l[0].append(v0)\\n v0 = 0\\n v1 += 1\\n elif (k[i] == 0) & (k[i - 1] == 1):\\n l[1].append(v1)\\n v0 += 1\\n v1 = 0\\n else:\\n v1 += 1\\nfor i, v in enumerate([v0, v1]):\\n if v > 0:\\n l[i].append(v)\\nif k[0] == 0:\\n l[1].append(0)\\nl[0] += [0] * (K + 1)\\nl[1] += [0] * (K + 1)\\na = sum(l[0][:K]) + sum(l[1][: K + 1])\\nans.append(a)\\nfor i in range(1, len(l[0]) - K - 1):\\n a -= l[0][i - 1] + l[1][i - 1]\\n a += l[0][i + K - 1] + l[1][i + K]\\n ans.append(a)\\nprint((max(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.0434782609,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-if len(l[0]) <= K:',\n", + " '- print(N)',\n", + " '-else:',\n", + " '- l[0].extend(np.repeat(0, K + 1))',\n", + " '- l[1].extend(np.repeat(0, K + 1))',\n", + " '- a = sum(l[0][:K]) + sum(l[1][: K + 1])',\n", + " '+l[0] += [0] * (K + 1)',\n", + " '+l[1] += [0] * (K + 1)',\n", + " '+a = sum(l[0][:K]) + sum(l[1][: K + 1])',\n", + " '+ans.append(a)',\n", + " '+for i in range(1, len(l[0]) - K - 1):',\n", + " '+ a -= l[0][i - 1] + l[1][i - 1]',\n", + " '+ a += l[0][i + K - 1] + l[1][i + K]',\n", + " '- for i in range(1, len(l[0]) - K - 1):',\n", + " '- a -= l[0][i - 1] + l[1][i - 1]',\n", + " '- a += l[0][i + K - 1] + l[1][i + K]',\n", + " '- ans.append(a)',\n", + " '- print((max(ans)))',\n", + " '+print((max(ans)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3263938189,\n", + " 'measured_runtime_v1': 0.209388869,\n", + " 'runtime_lift': 6.3345956489,\n", + " 'key': ['s859028171', 's566775006']},\n", + " {'user_id': 'u159994501',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's060142514',\n", + " 'submission_id_v1': 's502871070',\n", + " 'cpu_time_v0': 326,\n", + " 'cpu_time_v1': 290,\n", + " 'memory_v0': 10996,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.04,\n", + " 'input': \"N, M = list(map(int, input().split()))\\n\\nL, R = [], []\\n\\nlow = -float('INF')\\n\\nhigh = float('INF')\\n\\nfor i in range(M):\\n\\n l, r = list(map(int, input().split()))\\n\\n L.append(l)\\n\\n R.append(r)\\n\\n if l > low:\\n\\n low = l\\n\\n if r < high:\\n\\n high = r\\n\\nprint((max(0, high - low + 1)))\\n\",\n", + " 'target': \"N, M = list(map(int, input().split()))\\n\\nlow = -float('INF')\\n\\nhigh = float('INF')\\n\\nfor i in range(M):\\n\\n l, r = list(map(int, input().split()))\\n\\n if l > low:\\n\\n low = l\\n\\n if r < high:\\n\\n high = r\\n\\nprint((max(0, high - low + 1)))\\n\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 283,\n", + " 'code_v1_num_chars': 234,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\nL, R = [], []\\nlow = -float(\"INF\")\\nhigh = float(\"INF\")\\nfor i in range(M):\\n l, r = list(map(int, input().split()))\\n L.append(l)\\n R.append(r)\\n if l > low:\\n low = l\\n if r < high:\\n high = r\\nprint((max(0, high - low + 1)))\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nlow = -float(\"INF\")\\nhigh = float(\"INF\")\\nfor i in range(M):\\n l, r = list(map(int, input().split()))\\n if l > low:\\n low = l\\n if r < high:\\n high = r\\nprint((max(0, high - low + 1)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-L, R = [], []', '- L.append(l)', '- R.append(r)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2778050728,\n", + " 'measured_runtime_v1': 0.0913613791,\n", + " 'runtime_lift': 3.0407276614,\n", + " 'key': ['s060142514', 's502871070']},\n", + " {'user_id': 'u416758623',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's698254896',\n", + " 'submission_id_v1': 's209236188',\n", + " 'cpu_time_v0': 210,\n", + " 'cpu_time_v1': 54,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 9152,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.29,\n", + " 'input': 'def findSumDigit(num):\\n\\n global total\\n\\n total = \"\"\\n\\n while num > 0:\\n\\n total += str(num % 10)\\n\\n num //= 10\\n\\n return total\\n\\n\\n\\ndef main():\\n\\n a,b = list(map(int, input().split()))\\n\\n ans = 0\\n\\n for i in range(a,b+1):\\n\\n tmp = str(findSumDigit(i))\\n\\n if tmp == str(i):\\n\\n ans += 1\\n\\n print(ans)\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()',\n", + " 'target': 'a, b = list(map(int, input().split()))\\n\\nans = 0\\n\\n\\n\\nfor i in range(a,b+1):\\n\\n seki_gyaku = str(i)\\n\\n if seki_gyaku == seki_gyaku[::-1]:\\n\\n ans += 1\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 382,\n", + " 'code_v1_num_chars': 165,\n", + " 'code_v0_no_empty_lines': 'def findSumDigit(num):\\n global total\\n total = \"\"\\n while num > 0:\\n total += str(num % 10)\\n num //= 10\\n return total\\n\\n\\ndef main():\\n a, b = list(map(int, input().split()))\\n ans = 0\\n for i in range(a, b + 1):\\n tmp = str(findSumDigit(i))\\n if tmp == str(i):\\n ans += 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = list(map(int, input().split()))\\nans = 0\\nfor i in range(a, b + 1):\\n seki_gyaku = str(i)\\n if seki_gyaku == seki_gyaku[::-1]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 52.6315789474,\n", + " 'diff': ['-def findSumDigit(num):',\n", + " '- global total',\n", + " '- total = \"\"',\n", + " '- while num > 0:',\n", + " '- total += str(num % 10)',\n", + " '- num //= 10',\n", + " '- return total',\n", + " '-',\n", + " '-',\n", + " '-def main():',\n", + " '- a, b = list(map(int, input().split()))',\n", + " '- ans = 0',\n", + " '- for i in range(a, b + 1):',\n", + " '- tmp = str(findSumDigit(i))',\n", + " '- if tmp == str(i):',\n", + " '- ans += 1',\n", + " '- print(ans)',\n", + " '-',\n", + " '-',\n", + " '-if __name__ == \"__main__\":',\n", + " '- main()',\n", + " '+a, b = list(map(int, input().split()))',\n", + " '+ans = 0',\n", + " '+for i in range(a, b + 1):',\n", + " '+ seki_gyaku = str(i)',\n", + " '+ if seki_gyaku == seki_gyaku[::-1]:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.908202547,\n", + " 'measured_runtime_v1': 0.4125540495,\n", + " 'runtime_lift': 2.2014146949,\n", + " 'key': ['s698254896', 's209236188']},\n", + " {'user_id': 'u295361373',\n", + " 'problem_id': 'p02612',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's197156959',\n", + " 'submission_id_v1': 's836901225',\n", + " 'cpu_time_v0': 226,\n", + " 'cpu_time_v1': 180,\n", + " 'memory_v0': 68124,\n", + " 'memory_v1': 68072,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.35,\n", + " 'input': '\\'\\'\\'\\n\\n Auther: ghoshashis545 Ashis Ghosh\\n\\n College: jalpaiguri Govt Enggineering College\\n\\n\\n\\n\\'\\'\\'\\n\\nfrom os import path\\n\\nimport sys\\n\\nfrom functools import cmp_to_key as ctk\\n\\nfrom collections import deque,defaultdict as dd \\n\\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\\n\\nfrom itertools import permutations\\n\\nfrom datetime import datetime\\n\\nfrom math import ceil,sqrt,log,gcd\\n\\ndef ii():return int(eval(input()))\\n\\ndef si():return eval(input())\\n\\ndef mi():return list(map(int,input().split()))\\n\\ndef li():return list(mi())\\n\\nabc=\\'abcdefghijklmnopqrstuvwxyz\\'\\n\\nmod=1000000007\\n\\n#mod=998244353\\n\\ninf = float(\"inf\")\\n\\nvow=[\\'a\\',\\'e\\',\\'i\\',\\'o\\',\\'u\\']\\n\\ndx,dy=[-1,1,0,0],[0,0,1,-1]\\n\\n\\n\\ndef bo(i):\\n\\n return ord(i)-ord(\\'a\\')\\n\\n\\n\\nfile = 0\\n\\n\\n\\ndef solve():\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n # for _ in range(ii()):\\n\\n\\n\\n n=ii()\\n\\n n%=1000\\n\\n if n!=0:\\n\\n n=1000-n\\n\\n print(n)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nif __name__ ==\"__main__\":\\n\\n\\n\\n if(file):\\n\\n\\n\\n if path.exists(\\'input1.txt\\'):\\n\\n sys.stdin=open(\\'input1.txt\\', \\'r\\')\\n\\n sys.stdout=open(\\'output1.txt\\',\\'w\\')\\n\\n else:\\n\\n input=sys.stdin.readline\\n\\n solve()',\n", + " 'target': '\\'\\'\\'\\n\\n Auther: ghoshashis545 Ashis Ghosh\\n\\n College: jalpaiguri Govt Enggineering College\\n\\n\\n\\n\\'\\'\\'\\n\\nfrom os import path\\n\\nimport sys\\n\\nfrom heapq import heappush,heappop\\n\\nfrom functools import cmp_to_key as ctk\\n\\nfrom collections import deque,defaultdict as dd \\n\\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\\n\\nfrom itertools import permutations\\n\\nfrom datetime import datetime\\n\\nfrom math import ceil,sqrt,log,gcd\\n\\ndef ii():return int(eval(input()))\\n\\ndef si():return eval(input())\\n\\ndef mi():return list(map(int,input().split()))\\n\\ndef li():return list(mi())\\n\\nabc=\\'abcdefghijklmnopqrstuvwxyz\\'\\n\\nmod=1000000007\\n\\n# mod=998244353\\n\\ninf = float(\"inf\")\\n\\nvow=[\\'a\\',\\'e\\',\\'i\\',\\'o\\',\\'u\\']\\n\\ndx,dy=[-1,1,0,0],[0,0,1,-1]\\n\\n\\n\\ndef bo(i):\\n\\n return ord(i)-ord(\\'a\\')\\n\\n\\n\\nfile=0\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\ndef solve():\\n\\n\\n\\n\\n\\n # for _ in range(ii()):\\n\\n \\n\\n \\n\\n\\n\\n n=ii()\\n\\n n%=1000\\n\\n if(n!=0):\\n\\n n=1000-n\\n\\n print(n)\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n\\nif __name__ ==\"__main__\":\\n\\n\\n\\n if(file):\\n\\n\\n\\n if path.exists(\\'input1.txt\\'):\\n\\n sys.stdin=open(\\'input1.txt\\', \\'r\\')\\n\\n sys.stdout=open(\\'output1.txt\\',\\'w\\')\\n\\n else:\\n\\n input=sys.stdin.readline\\n\\n solve()\\n',\n", + " 'code_v0_loc': 77,\n", + " 'code_v1_loc': 66,\n", + " 'code_v0_num_chars': 1162,\n", + " 'code_v1_num_chars': 1190,\n", + " 'code_v0_no_empty_lines': '\"\"\"\\n Auther: ghoshashis545 Ashis Ghosh\\n College: jalpaiguri Govt Enggineering College\\n\"\"\"\\nfrom os import path\\nimport sys\\nfrom functools import cmp_to_key as ctk\\nfrom collections import deque, defaultdict as dd\\nfrom bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right\\nfrom itertools import permutations\\nfrom datetime import datetime\\nfrom math import ceil, sqrt, log, gcd\\n\\n\\ndef ii():\\n return int(eval(input()))\\n\\n\\ndef si():\\n return eval(input())\\n\\n\\ndef mi():\\n return list(map(int, input().split()))\\n\\n\\ndef li():\\n return list(mi())\\n\\n\\nabc = \"abcdefghijklmnopqrstuvwxyz\"\\nmod = 1000000007\\n# mod=998244353\\ninf = float(\"inf\")\\nvow = [\"a\", \"e\", \"i\", \"o\", \"u\"]\\ndx, dy = [-1, 1, 0, 0], [0, 0, 1, -1]\\n\\n\\ndef bo(i):\\n return ord(i) - ord(\"a\")\\n\\n\\nfile = 0\\n\\n\\ndef solve():\\n # for _ in range(ii()):\\n n = ii()\\n n %= 1000\\n if n != 0:\\n n = 1000 - n\\n print(n)\\n\\n\\nif __name__ == \"__main__\":\\n if file:\\n if path.exists(\"input1.txt\"):\\n sys.stdin = open(\"input1.txt\", \"r\")\\n sys.stdout = open(\"output1.txt\", \"w\")\\n else:\\n input = sys.stdin.readline\\n solve()\\n',\n", + " 'code_v1_no_empty_lines': '\"\"\"\\n Auther: ghoshashis545 Ashis Ghosh\\n College: jalpaiguri Govt Enggineering College\\n\"\"\"\\nfrom os import path\\nimport sys\\nfrom heapq import heappush, heappop\\nfrom functools import cmp_to_key as ctk\\nfrom collections import deque, defaultdict as dd\\nfrom bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right\\nfrom itertools import permutations\\nfrom datetime import datetime\\nfrom math import ceil, sqrt, log, gcd\\n\\n\\ndef ii():\\n return int(eval(input()))\\n\\n\\ndef si():\\n return eval(input())\\n\\n\\ndef mi():\\n return list(map(int, input().split()))\\n\\n\\ndef li():\\n return list(mi())\\n\\n\\nabc = \"abcdefghijklmnopqrstuvwxyz\"\\nmod = 1000000007\\n# mod=998244353\\ninf = float(\"inf\")\\nvow = [\"a\", \"e\", \"i\", \"o\", \"u\"]\\ndx, dy = [-1, 1, 0, 0], [0, 0, 1, -1]\\n\\n\\ndef bo(i):\\n return ord(i) - ord(\"a\")\\n\\n\\nfile = 0\\n\\n\\ndef solve():\\n # for _ in range(ii()):\\n n = ii()\\n n %= 1000\\n if n != 0:\\n n = 1000 - n\\n print(n)\\n\\n\\nif __name__ == \"__main__\":\\n if file:\\n if path.exists(\"input1.txt\"):\\n sys.stdin = open(\"input1.txt\", \"r\")\\n sys.stdout = open(\"output1.txt\", \"w\")\\n else:\\n input = sys.stdin.readline\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['+from heapq import heappush, heappop'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3258618799,\n", + " 'measured_runtime_v1': 0.2078528001,\n", + " 'runtime_lift': 1.5677531392,\n", + " 'key': ['s197156959', 's836901225']},\n", + " {'user_id': 'u849229491',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's006550541',\n", + " 'submission_id_v1': 's560841752',\n", + " 'cpu_time_v0': 67,\n", + " 'cpu_time_v1': 54,\n", + " 'memory_v0': 9152,\n", + " 'memory_v1': 9064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 19.4,\n", + " 'input': 'x = int(eval(input()))\\n\\nfor i in range(-200,200,1):\\n\\n for j in range(-200,200,1):\\n\\n if i**5-j**5==x:\\n\\n print((i,j))\\n\\n exit()',\n", + " 'target': \"import sys\\n\\nx = int(eval(input()))\\n\\nfor i in range(-159,159,1):\\n\\n for j in range(-159,159,1):\\n\\n if i**5 - j**5 == x:\\n\\n print((str(i)+' '+str(j)))\\n\\n sys.exit()\",\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 144,\n", + " 'code_v1_num_chars': 182,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(-200, 200, 1):\\n for j in range(-200, 200, 1):\\n if i**5 - j**5 == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nx = int(eval(input()))\\nfor i in range(-159, 159, 1):\\n for j in range(-159, 159, 1):\\n if i**5 - j**5 == x:\\n print((str(i) + \" \" + str(j)))\\n sys.exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '-for i in range(-200, 200, 1):',\n", + " '- for j in range(-200, 200, 1):',\n", + " '+for i in range(-159, 159, 1):',\n", + " '+ for j in range(-159, 159, 1):',\n", + " '- print((i, j))',\n", + " '- exit()',\n", + " '+ print((str(i) + \" \" + str(j)))',\n", + " '+ sys.exit()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6085173706,\n", + " 'measured_runtime_v1': 0.478621159,\n", + " 'runtime_lift': 1.2713967178,\n", + " 'key': ['s006550541', 's560841752']},\n", + " {'user_id': 'u400765446',\n", + " 'problem_id': 'p02412',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's921182397',\n", + " 'submission_id_v1': 's148735991',\n", + " 'cpu_time_v0': 320,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 5600,\n", + " 'memory_v1': 5600,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 93.75,\n", + " 'input': \"def main():\\n\\n\\n\\n while True:\\n\\n n, x = tuple(map(int, input().split()))\\n\\n pattern = 0\\n\\n\\n\\n if n == x == 0:\\n\\n break\\n\\n else:\\n\\n for a in range(1, n+1):\\n\\n for b in range(1, a):\\n\\n for c in range(1, b):\\n\\n pattern += 1 if a + b + c == x and a > b > c else 0\\n\\n print(pattern)\\n\\n \\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': 'def divide_two(c, z):\\n\\n min_b = z // 2 + 1\\n\\n max_b = min(c-1, z-1)\\n\\n return max(max_b-min_b+1, 0)\\n\\n \\n\\n\\n\\nnum_set = []\\n\\ncnt = 0\\n\\nwhile True:\\n\\n n, x = list(map(int, input().split()))\\n\\n if (n, x) == (0, 0):\\n\\n break\\n\\n else:\\n\\n num_set.append((n, x))\\n\\n cnt += 1\\n\\n\\n\\nfor i in range(cnt):\\n\\n num_count = 0\\n\\n (n, x) = num_set[i]\\n\\n for c in range(x//3, n+1):\\n\\n num_count += divide_two(c, x-c)\\n\\n print(num_count)\\n',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 458,\n", + " 'code_v1_num_chars': 454,\n", + " 'code_v0_no_empty_lines': 'def main():\\n while True:\\n n, x = tuple(map(int, input().split()))\\n pattern = 0\\n if n == x == 0:\\n break\\n else:\\n for a in range(1, n + 1):\\n for b in range(1, a):\\n for c in range(1, b):\\n pattern += 1 if a + b + c == x and a > b > c else 0\\n print(pattern)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def divide_two(c, z):\\n min_b = z // 2 + 1\\n max_b = min(c - 1, z - 1)\\n return max(max_b - min_b + 1, 0)\\n\\n\\nnum_set = []\\ncnt = 0\\nwhile True:\\n n, x = list(map(int, input().split()))\\n if (n, x) == (0, 0):\\n break\\n else:\\n num_set.append((n, x))\\n cnt += 1\\nfor i in range(cnt):\\n num_count = 0\\n (n, x) = num_set[i]\\n for c in range(x // 3, n + 1):\\n num_count += divide_two(c, x - c)\\n print(num_count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['-def main():',\n", + " '- while True:',\n", + " '- n, x = tuple(map(int, input().split()))',\n", + " '- pattern = 0',\n", + " '- if n == x == 0:',\n", + " '- break',\n", + " '- else:',\n", + " '- for a in range(1, n + 1):',\n", + " '- for b in range(1, a):',\n", + " '- for c in range(1, b):',\n", + " '- pattern += 1 if a + b + c == x and a > b > c else 0',\n", + " '- print(pattern)',\n", + " '+def divide_two(c, z):',\n", + " '+ min_b = z // 2 + 1',\n", + " '+ max_b = min(c - 1, z - 1)',\n", + " '+ return max(max_b - min_b + 1, 0)',\n", + " '-if __name__ == \"__main__\":',\n", + " '- main()',\n", + " '+num_set = []',\n", + " '+cnt = 0',\n", + " '+while True:',\n", + " '+ n, x = list(map(int, input().split()))',\n", + " '+ if (n, x) == (0, 0):',\n", + " '+ break',\n", + " '+ else:',\n", + " '+ num_set.append((n, x))',\n", + " '+ cnt += 1',\n", + " '+for i in range(cnt):',\n", + " '+ num_count = 0',\n", + " '+ (n, x) = num_set[i]',\n", + " '+ for c in range(x // 3, n + 1):',\n", + " '+ num_count += divide_two(c, x - c)',\n", + " '+ print(num_count)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2920441294,\n", + " 'measured_runtime_v1': 0.2327923727,\n", + " 'runtime_lift': 1.2545261942,\n", + " 'key': ['s921182397', 's148735991']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p02612',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's840955881',\n", + " 'submission_id_v1': 's608348800',\n", + " 'cpu_time_v0': 35,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 9152,\n", + " 'memory_v1': 9160,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.14,\n", + " 'input': 'import sys\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nN = int(read())\\n\\nx = N + (-N) % 1000\\n\\nprint((x - N))',\n", + " 'target': 'import math\\n\\nN = int(eval(input()))\\n\\nx = math.ceil(N/1000) * 1000\\n\\nprint((x-N))',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 174,\n", + " 'code_v1_num_chars': 71,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nN = int(read())\\nx = N + (-N) % 1000\\nprint((x - N))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nx = math.ceil(N / 1000) * 1000\\nprint((x - N))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.5555555556,\n", + " 'diff': ['-import sys',\n", + " '+import math',\n", + " '-read = sys.stdin.buffer.read',\n", + " '-readline = sys.stdin.buffer.readline',\n", + " '-readlines = sys.stdin.buffer.readlines',\n", + " '-N = int(read())',\n", + " '-x = N + (-N) % 1000',\n", + " '+N = int(eval(input()))',\n", + " '+x = math.ceil(N / 1000) * 1000'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.260022393,\n", + " 'measured_runtime_v1': 0.1385840868,\n", + " 'runtime_lift': 1.8762788639,\n", + " 'key': ['s840955881', 's608348800']},\n", + " {'user_id': 'u466330895',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's008235718',\n", + " 'submission_id_v1': 's090392182',\n", + " 'cpu_time_v0': 275,\n", + " 'cpu_time_v1': 173,\n", + " 'memory_v0': 42736,\n", + " 'memory_v1': 38512,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.09,\n", + " 'input': 'import math\\n\\nn = int(eval(input()))\\n\\n\\n\\nans = math.factorial(n) # nの階乗を計算\\n\\n\\n\\nif ans >= (10 ** 9)+7:\\n\\n ans = ans % ((10 ** 9)+7)\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\n\\n\\nans = 1\\n\\nfor i in range(1, n+1):\\n\\n ans = ans * i\\n\\n ans = ans % ((10 ** 9)+7) # 途中で割り算の余りを求めても、最終結果は同じになる\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 139,\n", + " 'code_v1_num_chars': 145,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nans = math.factorial(n) # nの階乗を計算\\nif ans >= (10**9) + 7:\\n ans = ans % ((10**9) + 7)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 1\\nfor i in range(1, n + 1):\\n ans = ans * i\\n ans = ans % ((10**9) + 7) # 途中で割り算の余りを求めても、最終結果は同じになる\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-ans = math.factorial(n) # nの階乗を計算',\n", + " '-if ans >= (10**9) + 7:',\n", + " '- ans = ans % ((10**9) + 7)',\n", + " '+ans = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans = ans * i',\n", + " '+ ans = ans % ((10**9) + 7) # 途中で割り算の余りを求めても、最終結果は同じになる'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5420387263,\n", + " 'measured_runtime_v1': 0.2535338807,\n", + " 'runtime_lift': 2.1379340891,\n", + " 'key': ['s008235718', 's090392182']},\n", + " {'user_id': 'u312025627',\n", + " 'problem_id': 'p03241',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's848556972',\n", + " 'submission_id_v1': 's836748791',\n", + " 'cpu_time_v0': 174,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 38640,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.51,\n", + " 'input': \"def main():\\n\\n N, M = (int(i) for i in input().split())\\n\\n\\n\\n def trial_division(n):\\n\\n divs = []\\n\\n for i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n divs.append(i)\\n\\n if i != n//i:\\n\\n divs.append(n//i)\\n\\n divs.sort(reverse=True)\\n\\n return divs\\n\\n divs = trial_division(M)\\n\\n for d in divs:\\n\\n if d*N <= M:\\n\\n return print(d)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"def main():\\n\\n def trial_division(n):\\n\\n divs = []\\n\\n for i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n divs.append(i)\\n\\n if i != n//i:\\n\\n divs.append(n//i)\\n\\n divs.sort(reverse=True)\\n\\n return divs\\n\\n\\n\\n N, M = (int(i) for i in input().split())\\n\\n divs = trial_division(M)\\n\\n for d in divs:\\n\\n if N*d <= M:\\n\\n return print(d)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 479,\n", + " 'code_v1_num_chars': 479,\n", + " 'code_v0_no_empty_lines': 'def main():\\n N, M = (int(i) for i in input().split())\\n\\n def trial_division(n):\\n divs = []\\n for i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n divs.append(i)\\n if i != n // i:\\n divs.append(n // i)\\n divs.sort(reverse=True)\\n return divs\\n\\n divs = trial_division(M)\\n for d in divs:\\n if d * N <= M:\\n return print(d)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n def trial_division(n):\\n divs = []\\n for i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n divs.append(i)\\n if i != n // i:\\n divs.append(n // i)\\n divs.sort(reverse=True)\\n return divs\\n\\n N, M = (int(i) for i in input().split())\\n divs = trial_division(M)\\n for d in divs:\\n if N * d <= M:\\n return print(d)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- N, M = (int(i) for i in input().split())',\n", + " '-',\n", + " '+ N, M = (int(i) for i in input().split())',\n", + " '- if d * N <= M:',\n", + " '+ if N * d <= M:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3135980744,\n", + " 'measured_runtime_v1': 0.0063253348,\n", + " 'runtime_lift': 49.5780989437,\n", + " 'key': ['s848556972', 's836748791']},\n", + " {'user_id': 'u186974762',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's418768557',\n", + " 'submission_id_v1': 's739454407',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12504,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.33,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nX = np.array(input().split()).astype(int)\\n\\nP = round(np.average(X))\\n\\nprint((int(np.sum((P-X)**2))))',\n", + " 'target': 'n = int(eval(input()))\\n\\nx = [int(i) for i in input().split()]\\n\\nmin_x = round(sum(x) / n)\\n\\nans = sum([(min_x - i)**2 for i in x])\\n\\nprint(ans)',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 135,\n", + " 'code_v1_num_chars': 134,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nX = np.array(input().split()).astype(int)\\nP = round(np.average(X))\\nprint((int(np.sum((P - X) ** 2))))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nx = [int(i) for i in input().split()]\\nmin_x = round(sum(x) / n)\\nans = sum([(min_x - i) ** 2 for i in x])\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '-X = np.array(input().split()).astype(int)',\n", + " '-P = round(np.average(X))',\n", + " '-print((int(np.sum((P - X) ** 2))))',\n", + " '+n = int(eval(input()))',\n", + " '+x = [int(i) for i in input().split()]',\n", + " '+min_x = round(sum(x) / n)',\n", + " '+ans = sum([(min_x - i) ** 2 for i in x])',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.1962851752,\n", + " 'measured_runtime_v1': 0.2023058402,\n", + " 'runtime_lift': 5.9132508194,\n", + " 'key': ['s418768557', 's739454407']},\n", + " {'user_id': 'u581603131',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's669812244',\n", + " 'submission_id_v1': 's638032890',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 41,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.17,\n", + " 'input': 'import math\\n\\nN = int(eval(input()))\\n\\nprint((math.factorial(N)%(10**9+7)))',\n", + " 'target': 'ans=1\\n\\nn=int(eval(input()))\\n\\nfor i in range(1,n+1):\\n\\n ans*=i\\n\\n ans=ans%(10**9+7)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 65,\n", + " 'code_v1_num_chars': 92,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nprint((math.factorial(N) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'ans = 1\\nn = int(eval(input()))\\nfor i in range(1, n + 1):\\n ans *= i\\n ans = ans % (10**9 + 7)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-N = int(eval(input()))',\n", + " '-print((math.factorial(N) % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+n = int(eval(input()))',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans = ans % (10**9 + 7)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8658925366,\n", + " 'measured_runtime_v1': 0.3537542467,\n", + " 'runtime_lift': 2.4477233692,\n", + " 'key': ['s669812244', 's638032890']},\n", + " {'user_id': 'u488127128',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's570028181',\n", + " 'submission_id_v1': 's434791726',\n", + " 'cpu_time_v0': 103,\n", + " 'cpu_time_v1': 46,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.34,\n", + " 'input': \"a,b = list(map(int, input().split()))\\n\\ncount = 0\\n\\nfor i in range(a,b+1):\\n\\n j = str(i)\\n\\n if j==''.join(reversed(j)):\\n\\n count += 1\\n\\nprint(count)\",\n", + " 'target': 'a,b = list(map(int, input().split()))\\n\\nn = [i for i in map(str, list(range(a,b+1))) if i==i[::-1]]\\n\\nprint((len(n)))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 149,\n", + " 'code_v1_num_chars': 101,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().split()))\\ncount = 0\\nfor i in range(a, b + 1):\\n j = str(i)\\n if j == \"\".join(reversed(j)):\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = list(map(int, input().split()))\\nn = [i for i in map(str, list(range(a, b + 1))) if i == i[::-1]]\\nprint((len(n)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 57.1428571429,\n", + " 'diff': ['-count = 0',\n", + " '-for i in range(a, b + 1):',\n", + " '- j = str(i)',\n", + " '- if j == \"\".join(reversed(j)):',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+n = [i for i in map(str, list(range(a, b + 1))) if i == i[::-1]]',\n", + " '+print((len(n)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4183517286,\n", + " 'measured_runtime_v1': 0.2983190859,\n", + " 'runtime_lift': 1.4023632692,\n", + " 'key': ['s570028181', 's434791726']},\n", + " {'user_id': 'u513081876',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's352799823',\n", + " 'submission_id_v1': 's651648403',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 82,\n", + " 'memory_v0': 4148,\n", + " 'memory_v1': 4148,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.51,\n", + " 'input': 'N = int(eval(input()))\\n\\nA = [int(i) for i in input().split()]\\n\\nans = 0\\n\\ncheck = [0]*30\\n\\nfor i in range(1, 31):\\n\\n check[i-1] = 2**i\\n\\n\\n\\nfor i in A:\\n\\n if i % 2 == 0:\\n\\n j = 0\\n\\n while check[j] <= i:\\n\\n if i % check[j] == 0:\\n\\n add = check[j]\\n\\n else:\\n\\n break\\n\\n \\n\\n j += 1\\n\\n ans += j\\n\\n \\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\na = [int(i) for i in input().split()]\\n\\nans = 0\\n\\n\\n\\nfor i in a:\\n\\n while i % 2 == 0:\\n\\n i //= 2\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 394,\n", + " 'code_v1_num_chars': 149,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nA = [int(i) for i in input().split()]\\nans = 0\\ncheck = [0] * 30\\nfor i in range(1, 31):\\n check[i - 1] = 2**i\\nfor i in A:\\n if i % 2 == 0:\\n j = 0\\n while check[j] <= i:\\n if i % check[j] == 0:\\n add = check[j]\\n else:\\n break\\n j += 1\\n ans += j\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\na = [int(i) for i in input().split()]\\nans = 0\\nfor i in a:\\n while i % 2 == 0:\\n i //= 2\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.0,\n", + " 'diff': ['-A = [int(i) for i in input().split()]',\n", + " '+a = [int(i) for i in input().split()]',\n", + " '-check = [0] * 30',\n", + " '-for i in range(1, 31):',\n", + " '- check[i - 1] = 2**i',\n", + " '-for i in A:',\n", + " '- if i % 2 == 0:',\n", + " '- j = 0',\n", + " '- while check[j] <= i:',\n", + " '- if i % check[j] == 0:',\n", + " '- add = check[j]',\n", + " '- else:',\n", + " '- break',\n", + " '- j += 1',\n", + " '- ans += j',\n", + " '+for i in a:',\n", + " '+ while i % 2 == 0:',\n", + " '+ i //= 2',\n", + " '+ ans += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3522037606,\n", + " 'measured_runtime_v1': 0.279608284,\n", + " 'runtime_lift': 1.2596327819,\n", + " 'key': ['s352799823', 's651648403']},\n", + " {'user_id': 'u652656291',\n", + " 'problem_id': 'p02996',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's858472018',\n", + " 'submission_id_v1': 's501268558',\n", + " 'cpu_time_v0': 821,\n", + " 'cpu_time_v1': 719,\n", + " 'memory_v0': 49964,\n", + " 'memory_v1': 33396,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.42,\n", + " 'input': \"import numpy as np\\n\\n# 締切が早いものから処理\\n\\nN = int(eval(input()))\\n\\nAB = np.array([[int(x) for x in input().split()] for _ in range(N)])\\n\\nA = AB[:,0]\\n\\nB = AB[:,1]\\n\\nidx = B.argsort()\\n\\nA = A[idx]\\n\\nB = B[idx]\\n\\nnp.cumsum(A, out = A)\\n\\nbl = (A <= B).all()\\n\\nanswer = 'Yes' if bl else 'No'\\n\\nprint(answer)\\n\",\n", + " 'target': \"def main():\\n\\n N = int(eval(input()))\\n\\n A = []\\n\\n for _ in range(N):\\n\\n a, b = list(map(int, input().split()))\\n\\n A.append((a, b))\\n\\n\\n\\n A = sorted(A, key=lambda x: x[1])\\n\\n time = 0\\n\\n for a, b in A:\\n\\n time += a\\n\\n if time > b:\\n\\n return 'No'\\n\\n\\n\\n return 'Yes'\\n\\n\\n\\nif __name__ == '__main__':\\n\\n print((main()))\\n\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 282,\n", + " 'code_v1_num_chars': 348,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n# 締切が早いものから処理\\nN = int(eval(input()))\\nAB = np.array([[int(x) for x in input().split()] for _ in range(N)])\\nA = AB[:, 0]\\nB = AB[:, 1]\\nidx = B.argsort()\\nA = A[idx]\\nB = B[idx]\\nnp.cumsum(A, out=A)\\nbl = (A <= B).all()\\nanswer = \"Yes\" if bl else \"No\"\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n N = int(eval(input()))\\n A = []\\n for _ in range(N):\\n a, b = list(map(int, input().split()))\\n A.append((a, b))\\n A = sorted(A, key=lambda x: x[1])\\n time = 0\\n for a, b in A:\\n time += a\\n if time > b:\\n return \"No\"\\n return \"Yes\"\\n\\n\\nif __name__ == \"__main__\":\\n print((main()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.7777777778,\n", + " 'diff': ['-import numpy as np',\n", + " '+def main():',\n", + " '+ N = int(eval(input()))',\n", + " '+ A = []',\n", + " '+ for _ in range(N):',\n", + " '+ a, b = list(map(int, input().split()))',\n", + " '+ A.append((a, b))',\n", + " '+ A = sorted(A, key=lambda x: x[1])',\n", + " '+ time = 0',\n", + " '+ for a, b in A:',\n", + " '+ time += a',\n", + " '+ if time > b:',\n", + " '+ return \"No\"',\n", + " '+ return \"Yes\"',\n", + " '-# 締切が早いものから処理',\n", + " '-N = int(eval(input()))',\n", + " '-AB = np.array([[int(x) for x in input().split()] for _ in range(N)])',\n", + " '-A = AB[:, 0]',\n", + " '-B = AB[:, 1]',\n", + " '-idx = B.argsort()',\n", + " '-A = A[idx]',\n", + " '-B = B[idx]',\n", + " '-np.cumsum(A, out=A)',\n", + " '-bl = (A <= B).all()',\n", + " '-answer = \"Yes\" if bl else \"No\"',\n", + " '-print(answer)',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ print((main()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3914355583,\n", + " 'measured_runtime_v1': 0.2070376647,\n", + " 'runtime_lift': 6.7206880477,\n", + " 'key': ['s858472018', 's501268558']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's819255712',\n", + " 'submission_id_v1': 's993166511',\n", + " 'cpu_time_v0': 1171,\n", + " 'cpu_time_v1': 206,\n", + " 'memory_v0': 32776,\n", + " 'memory_v1': 31536,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.41,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN,M = list(map(int,input().split()))\\n\\n\\n\\nA = np.array([int(x) for x in input().split()],dtype=np.int64)\\n\\nA.sort()\\n\\n\\n\\nBC = np.array([[int(x) for x in input().split()] for _ in range(M)])\\n\\nB = BC[:,0]\\n\\nC = BC[:,1]\\n\\n\\n\\nidx = C.argsort()\\n\\nB = B[idx][::-1]\\n\\nC = C[idx][::-1]\\n\\n\\n\\np = 0\\n\\nfor b,c in zip(B,C):\\n\\n A[p:p+b] = np.maximum(A[p:p+b],c)\\n\\n p += b\\n\\n\\n\\nanswer = A.sum()\\n\\nprint(answer)\\n',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nfrom operator import itemgetter\\n\\n\\n\\nN,M = list(map(int,readline().split()))\\n\\nA = list(map(int,readline().split()))\\n\\nm = list(map(int,read().split()))\\n\\nBC = list(zip(m,m))\\n\\n\\n\\nBC.sort(key = itemgetter(1),reverse=True)\\n\\n\\n\\nBC.append((N,-1))\\n\\n\\n\\nchange = []\\n\\nfor b,c in BC:\\n\\n change += [c] * b\\n\\n if len(change) > N:\\n\\n break\\n\\n\\n\\nA += change\\n\\nA.sort()\\n\\nanswer = sum(A[-N:])\\n\\nprint(answer)',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 397,\n", + " 'code_v1_num_chars': 501,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, M = list(map(int, input().split()))\\nA = np.array([int(x) for x in input().split()], dtype=np.int64)\\nA.sort()\\nBC = np.array([[int(x) for x in input().split()] for _ in range(M)])\\nB = BC[:, 0]\\nC = BC[:, 1]\\nidx = C.argsort()\\nB = B[idx][::-1]\\nC = C[idx][::-1]\\np = 0\\nfor b, c in zip(B, C):\\n A[p : p + b] = np.maximum(A[p : p + b], c)\\n p += b\\nanswer = A.sum()\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nfrom operator import itemgetter\\n\\nN, M = list(map(int, readline().split()))\\nA = list(map(int, readline().split()))\\nm = list(map(int, read().split()))\\nBC = list(zip(m, m))\\nBC.sort(key=itemgetter(1), reverse=True)\\nBC.append((N, -1))\\nchange = []\\nfor b, c in BC:\\n change += [c] * b\\n if len(change) > N:\\n break\\nA += change\\nA.sort()\\nanswer = sum(A[-N:])\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['-import numpy as np',\n", + " '+import sys',\n", + " '-N, M = list(map(int, input().split()))',\n", + " '-A = np.array([int(x) for x in input().split()], dtype=np.int64)',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '+from operator import itemgetter',\n", + " '+',\n", + " '+N, M = list(map(int, readline().split()))',\n", + " '+A = list(map(int, readline().split()))',\n", + " '+m = list(map(int, read().split()))',\n", + " '+BC = list(zip(m, m))',\n", + " '+BC.sort(key=itemgetter(1), reverse=True)',\n", + " '+BC.append((N, -1))',\n", + " '+change = []',\n", + " '+for b, c in BC:',\n", + " '+ change += [c] * b',\n", + " '+ if len(change) > N:',\n", + " '+ break',\n", + " '+A += change',\n", + " '-BC = np.array([[int(x) for x in input().split()] for _ in range(M)])',\n", + " '-B = BC[:, 0]',\n", + " '-C = BC[:, 1]',\n", + " '-idx = C.argsort()',\n", + " '-B = B[idx][::-1]',\n", + " '-C = C[idx][::-1]',\n", + " '-p = 0',\n", + " '-for b, c in zip(B, C):',\n", + " '- A[p : p + b] = np.maximum(A[p : p + b], c)',\n", + " '- p += b',\n", + " '-answer = A.sum()',\n", + " '+answer = sum(A[-N:])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1412646892,\n", + " 'measured_runtime_v1': 0.3274382627,\n", + " 'runtime_lift': 6.5394455476,\n", + " 'key': ['s819255712', 's993166511']},\n", + " {'user_id': 'u179169725',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's455496434',\n", + " 'submission_id_v1': 's062412783',\n", + " 'cpu_time_v0': 438,\n", + " 'cpu_time_v1': 334,\n", + " 'memory_v0': 17820,\n", + " 'memory_v1': 19904,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.74,\n", + " 'input': \"# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n\\n# 典型的なDP\\n\\n\\n\\nMOD = 10**9 + 7\\n\\nimport numpy as np\\n\\n# dp[i]をi段目までの通りの数とする。\\n\\nN, M = list(map(int, input().split()))\\n\\nto_zero = np.full((N + 1), False, dtype=bool)\\n\\nfor _ in range(M):\\n\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n\\n\\n\\n# dpテーブルの用意\\n\\ndp = np.full((N + 1), -1, dtype='int64')\\n\\ndp[0] = 1\\n\\ndp[1] = 0 if to_zero[1] else 1\\n\\nfor i in range(2, N + 1):\\n\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n\\n if dp[i] > MOD:\\n\\n dp[i] %= MOD\\n\\n\\n\\nprint((dp[-1]))\\n\",\n", + " 'target': '# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n\\n# 典型的なDP\\n\\n\\n\\nMOD = 10**9 + 7\\n\\nimport numpy as np\\n\\n# dp[i]をi段目までの通りの数とする。\\n\\nN, M = list(map(int, input().split()))\\n\\nto_zero = np.full((N + 1), False).tolist()\\n\\nfor _ in range(M):\\n\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n\\n\\n\\n# dpテーブルの用意\\n\\ndp = np.full((N + 1), -1).tolist()\\n\\ndp[0] = 1\\n\\ndp[1] = 0 if to_zero[1] else 1\\n\\nfor i in range(2, N + 1):\\n\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n\\n if dp[i] > MOD:\\n\\n dp[i] %= MOD\\n\\n\\n\\nprint((dp[-1]))\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 523,\n", + " 'code_v1_num_chars': 514,\n", + " 'code_v0_no_empty_lines': '# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n# 典型的なDP\\nMOD = 10**9 + 7\\nimport numpy as np\\n\\n# dp[i]をi段目までの通りの数とする。\\nN, M = list(map(int, input().split()))\\nto_zero = np.full((N + 1), False, dtype=bool)\\nfor _ in range(M):\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n# dpテーブルの用意\\ndp = np.full((N + 1), -1, dtype=\"int64\")\\ndp[0] = 1\\ndp[1] = 0 if to_zero[1] else 1\\nfor i in range(2, N + 1):\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n if dp[i] > MOD:\\n dp[i] %= MOD\\nprint((dp[-1]))\\n',\n", + " 'code_v1_no_empty_lines': '# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n# 典型的なDP\\nMOD = 10**9 + 7\\nimport numpy as np\\n\\n# dp[i]をi段目までの通りの数とする。\\nN, M = list(map(int, input().split()))\\nto_zero = np.full((N + 1), False).tolist()\\nfor _ in range(M):\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n# dpテーブルの用意\\ndp = np.full((N + 1), -1).tolist()\\ndp[0] = 1\\ndp[1] = 0 if to_zero[1] else 1\\nfor i in range(2, N + 1):\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n if dp[i] > MOD:\\n dp[i] %= MOD\\nprint((dp[-1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-to_zero = np.full((N + 1), False, dtype=bool)',\n", + " '+to_zero = np.full((N + 1), False).tolist()',\n", + " '-dp = np.full((N + 1), -1, dtype=\"int64\")',\n", + " '+dp = np.full((N + 1), -1).tolist()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9272715452,\n", + " 'measured_runtime_v1': 1.3572561545,\n", + " 'runtime_lift': 1.4199762799,\n", + " 'key': ['s455496434', 's062412783']},\n", + " {'user_id': 'u945199633',\n", + " 'problem_id': 'p02595',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's028374925',\n", + " 'submission_id_v1': 's480019615',\n", + " 'cpu_time_v0': 580,\n", + " 'cpu_time_v1': 443,\n", + " 'memory_v0': 45308,\n", + " 'memory_v1': 9156,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.62,\n", + " 'input': 'N, D = list(map(int, input().split()))\\n\\npoint = []\\n\\nfor i in range(N):\\n\\n point.append(list(map(int, input().split())))\\n\\n\\n\\nct = 0\\n\\nD2 = D * D\\n\\nfor i in point:\\n\\n if (i[0]**2 + i[1]**2) <= D2:\\n\\n ct += 1\\n\\n\\n\\nprint(ct)',\n", + " 'target': 'N, D = list(map(int, input().split()))\\n\\n\\n\\nct = 0\\n\\nD2 = D * D\\n\\nfor i in range(N):\\n\\n X, Y = list(map(int, input().split()))\\n\\n if (X**2 + Y**2) <= D2:\\n\\n ct += 1\\n\\n\\n\\nprint(ct)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 219,\n", + " 'code_v1_num_chars': 171,\n", + " 'code_v0_no_empty_lines': 'N, D = list(map(int, input().split()))\\npoint = []\\nfor i in range(N):\\n point.append(list(map(int, input().split())))\\nct = 0\\nD2 = D * D\\nfor i in point:\\n if (i[0] ** 2 + i[1] ** 2) <= D2:\\n ct += 1\\nprint(ct)\\n',\n", + " 'code_v1_no_empty_lines': 'N, D = list(map(int, input().split()))\\nct = 0\\nD2 = D * D\\nfor i in range(N):\\n X, Y = list(map(int, input().split()))\\n if (X**2 + Y**2) <= D2:\\n ct += 1\\nprint(ct)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.6666666667,\n", + " 'diff': ['-point = []',\n", + " '-for i in range(N):',\n", + " '- point.append(list(map(int, input().split())))',\n", + " '-for i in point:',\n", + " '- if (i[0] ** 2 + i[1] ** 2) <= D2:',\n", + " '+for i in range(N):',\n", + " '+ X, Y = list(map(int, input().split()))',\n", + " '+ if (X**2 + Y**2) <= D2:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.399467237,\n", + " 'measured_runtime_v1': 0.2084539161,\n", + " 'runtime_lift': 1.9163335691,\n", + " 'key': ['s028374925', 's480019615']},\n", + " {'user_id': 'u590871958',\n", + " 'problem_id': 'p01093',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's330226420',\n", + " 'submission_id_v1': 's459093378',\n", + " 'cpu_time_v0': 50,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 7684,\n", + " 'memory_v1': 7704,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.0,\n", + " 'input': 'while int(eval(input())) > 0:\\n\\n s = sorted(map(int, input().split()))\\n\\n print((min(abs(a - b) for (a, b) in zip(s, s[1:]))))',\n", + " 'target': 'while True:\\n\\n if int(eval(input())) == 0:\\n\\n break\\n\\n s = sorted(map(int, input().split()))\\n\\n r = min(abs(x - y) for (x, y) in zip(s, s[1:]))\\n\\n print(r)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 122,\n", + " 'code_v1_num_chars': 163,\n", + " 'code_v0_no_empty_lines': 'while int(eval(input())) > 0:\\n s = sorted(map(int, input().split()))\\n print((min(abs(a - b) for (a, b) in zip(s, s[1:]))))\\n',\n", + " 'code_v1_no_empty_lines': 'while True:\\n if int(eval(input())) == 0:\\n break\\n s = sorted(map(int, input().split()))\\n r = min(abs(x - y) for (x, y) in zip(s, s[1:]))\\n print(r)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-while int(eval(input())) > 0:',\n", + " '+while True:',\n", + " '+ if int(eval(input())) == 0:',\n", + " '+ break',\n", + " '- print((min(abs(a - b) for (a, b) in zip(s, s[1:]))))',\n", + " '+ r = min(abs(x - y) for (x, y) in zip(s, s[1:]))',\n", + " '+ print(r)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2760278752,\n", + " 'measured_runtime_v1': 0.2140542445,\n", + " 'runtime_lift': 1.2895230169,\n", + " 'key': ['s330226420', 's459093378']},\n", + " {'user_id': 'u120865944',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's595235842',\n", + " 'submission_id_v1': 's886147212',\n", + " 'cpu_time_v0': 1019,\n", + " 'cpu_time_v1': 680,\n", + " 'memory_v0': 47328,\n", + " 'memory_v1': 59484,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.27,\n", + " 'input': 'N = int(eval(input()))\\n\\nl = [list(map(int, input().split())) for _ in range(N)]\\n\\n\\n\\ndp = [[0 for i in range(3)] for j in range(N+1)]\\n\\n\\n\\n\\n\\nfor i in range(1, N+1):\\n\\n for j in range(3):\\n\\n for k in range(3):\\n\\n if j != k:\\n\\n dp[i][j] = max(dp[i][j], dp[i-1][k]+l[i-1][k])\\n\\n\\n\\nprint((max(dp[N][0], dp[N][1], dp[N][2])))\\n\\n\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\ndp = [[0 for i in range(3)] for j in range(N+1)]\\n\\n\\n\\nfor i in range(1, N+1):\\n\\n hapiness = list(map(int, input().split()))\\n\\n for j in range(3):\\n\\n for k in range(3):\\n\\n if j != k:\\n\\n dp[i][j] = max(dp[i][j], dp[i-1][k] + hapiness[k])\\n\\n\\n\\nprint((max(dp[N][0], dp[N][1], dp[N][2])))',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 341,\n", + " 'code_v1_num_chars': 329,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nl = [list(map(int, input().split())) for _ in range(N)]\\ndp = [[0 for i in range(3)] for j in range(N + 1)]\\nfor i in range(1, N + 1):\\n for j in range(3):\\n for k in range(3):\\n if j != k:\\n dp[i][j] = max(dp[i][j], dp[i - 1][k] + l[i - 1][k])\\nprint((max(dp[N][0], dp[N][1], dp[N][2])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\ndp = [[0 for i in range(3)] for j in range(N + 1)]\\nfor i in range(1, N + 1):\\n hapiness = list(map(int, input().split()))\\n for j in range(3):\\n for k in range(3):\\n if j != k:\\n dp[i][j] = max(dp[i][j], dp[i - 1][k] + hapiness[k])\\nprint((max(dp[N][0], dp[N][1], dp[N][2])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['-l = [list(map(int, input().split())) for _ in range(N)]',\n", + " '+ hapiness = list(map(int, input().split()))',\n", + " '- dp[i][j] = max(dp[i][j], dp[i - 1][k] + l[i - 1][k])',\n", + " '+ dp[i][j] = max(dp[i][j], dp[i - 1][k] + hapiness[k])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.267745409,\n", + " 'measured_runtime_v1': 0.0801038151,\n", + " 'runtime_lift': 3.3424801143,\n", + " 'key': ['s595235842', 's886147212']},\n", + " {'user_id': 'u638456847',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's213127805',\n", + " 'submission_id_v1': 's828879500',\n", + " 'cpu_time_v0': 45,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 7084,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 60.0,\n", + " 'input': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\nMOD = 10**9+7\\n\\n\\n\\nfac = [1, 1] # 元テーブル\\n\\nf_inv = [1, 1] # 逆元テーブル\\n\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\ndef prepare(n, mod):\\n\\n for i in range(2, n+1):\\n\\n fac.append((fac[-1] * i) % mod)\\n\\n\\n\\n\\n\\ndef cmb(n, r, mod):\\n\\n if n < 0 or r < 0:\\n\\n return 0\\n\\n if r > n:\\n\\n return 0\\n\\n\\n\\n return fac[n] * pow(fac[r],MOD-2,MOD) * pow(fac[n-r],MOD-2,MOD) % mod\\n\\n\\n\\n\\n\\ndef prime_factorization(n):\\n\\n d = []\\n\\n i, e = 2, 0 # factor, exponent\\n\\n while i * i <= n:\\n\\n while n % i == 0:\\n\\n n //= i\\n\\n e += 1\\n\\n if e > 0:\\n\\n d.append((i, e))\\n\\n i += 1\\n\\n e = 0\\n\\n if n > 1:\\n\\n d.append((n, 1))\\n\\n return d\\n\\n\\n\\n\\n\\ndef main():\\n\\n N,M = list(map(int, readline().split()))\\n\\n\\n\\n prepare(N+100, MOD)\\n\\n d = prime_factorization(M)\\n\\n\\n\\n ans = 1\\n\\n for i, e in d:\\n\\n ans *= cmb(N-1+e, e, MOD)\\n\\n ans %= MOD\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': '# AC: msec(Python3)\\n\\nfrom math import factorial\\n\\nimport sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\nMOD = 10**9+7\\n\\n\\n\\ndef cmb(n, r):\\n\\n if n < 0 or r < 0:\\n\\n return 0\\n\\n if r > n:\\n\\n return 0\\n\\n\\n\\n r = min(n-r, r)\\n\\n res = 1\\n\\n for i in range(r):\\n\\n res *= n - i\\n\\n\\n\\n return res // factorial(r)\\n\\n\\n\\n\\n\\ndef prime_factorization(n):\\n\\n d = []\\n\\n i, e = 2, 0 # factor, exponent\\n\\n while i * i <= n:\\n\\n while n % i == 0:\\n\\n n //= i\\n\\n e += 1\\n\\n if e > 0:\\n\\n d.append((i, e))\\n\\n i += 1\\n\\n e = 0\\n\\n if n > 1:\\n\\n d.append((n, 1))\\n\\n return d\\n\\n\\n\\n\\n\\ndef main():\\n\\n N,M = list(map(int, readline().split()))\\n\\n\\n\\n d = prime_factorization(M)\\n\\n\\n\\n ans = 1\\n\\n for i, e in d:\\n\\n ans *= cmb(N-1+e, e)\\n\\n ans %= MOD\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 56,\n", + " 'code_v1_loc': 54,\n", + " 'code_v0_num_chars': 1049,\n", + " 'code_v1_num_chars': 919,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nMOD = 10**9 + 7\\nfac = [1, 1] # 元テーブル\\nf_inv = [1, 1] # 逆元テーブル\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\n\\ndef prepare(n, mod):\\n for i in range(2, n + 1):\\n fac.append((fac[-1] * i) % mod)\\n\\n\\ndef cmb(n, r, mod):\\n if n < 0 or r < 0:\\n return 0\\n if r > n:\\n return 0\\n return fac[n] * pow(fac[r], MOD - 2, MOD) * pow(fac[n - r], MOD - 2, MOD) % mod\\n\\n\\ndef prime_factorization(n):\\n d = []\\n i, e = 2, 0 # factor, exponent\\n while i * i <= n:\\n while n % i == 0:\\n n //= i\\n e += 1\\n if e > 0:\\n d.append((i, e))\\n i += 1\\n e = 0\\n if n > 1:\\n d.append((n, 1))\\n return d\\n\\n\\ndef main():\\n N, M = list(map(int, readline().split()))\\n prepare(N + 100, MOD)\\n d = prime_factorization(M)\\n ans = 1\\n for i, e in d:\\n ans *= cmb(N - 1 + e, e, MOD)\\n ans %= MOD\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# AC: msec(Python3)\\nfrom math import factorial\\nimport sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nMOD = 10**9 + 7\\n\\n\\ndef cmb(n, r):\\n if n < 0 or r < 0:\\n return 0\\n if r > n:\\n return 0\\n r = min(n - r, r)\\n res = 1\\n for i in range(r):\\n res *= n - i\\n return res // factorial(r)\\n\\n\\ndef prime_factorization(n):\\n d = []\\n i, e = 2, 0 # factor, exponent\\n while i * i <= n:\\n while n % i == 0:\\n n //= i\\n e += 1\\n if e > 0:\\n d.append((i, e))\\n i += 1\\n e = 0\\n if n > 1:\\n d.append((n, 1))\\n return d\\n\\n\\ndef main():\\n N, M = list(map(int, readline().split()))\\n d = prime_factorization(M)\\n ans = 1\\n for i, e in d:\\n ans *= cmb(N - 1 + e, e)\\n ans %= MOD\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.5714285714,\n", + " 'diff': ['+# AC: msec(Python3)',\n", + " '+from math import factorial',\n", + " '-fac = [1, 1] # 元テーブル',\n", + " '-f_inv = [1, 1] # 逆元テーブル',\n", + " '-inv = [0, 1] # 逆元テーブル計算用テーブル',\n", + " '-def prepare(n, mod):',\n", + " '- for i in range(2, n + 1):',\n", + " '- fac.append((fac[-1] * i) % mod)',\n", + " '-',\n", + " '-',\n", + " '-def cmb(n, r, mod):',\n", + " '+def cmb(n, r):',\n", + " '- return fac[n] * pow(fac[r], MOD - 2, MOD) * pow(fac[n - r], MOD - 2, MOD) % mod',\n", + " '+ r = min(n - r, r)',\n", + " '+ res = 1',\n", + " '+ for i in range(r):',\n", + " '+ res *= n - i',\n", + " '+ return res // factorial(r)',\n", + " '- prepare(N + 100, MOD)',\n", + " '- ans *= cmb(N - 1 + e, e, MOD)',\n", + " '+ ans *= cmb(N - 1 + e, e)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3783175611,\n", + " 'measured_runtime_v1': 0.2571354423,\n", + " 'runtime_lift': 1.4712773852,\n", + " 'key': ['s213127805', 's828879500']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's918027483',\n", + " 'submission_id_v1': 's762694988',\n", + " 'cpu_time_v0': 83,\n", + " 'cpu_time_v1': 71,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.46,\n", + " 'input': \"def main():\\n\\n from itertools import product\\n\\n\\n\\n N = int(eval(input()))\\n\\n\\n\\n g = []\\n\\n for _ in range(N):\\n\\n a = int(eval(input()))\\n\\n t = []\\n\\n for _ in range(a):\\n\\n x, y = list(map(int, input().split()))\\n\\n x -= 1\\n\\n t.append((x, y))\\n\\n g.append(t)\\n\\n\\n\\n def is_ok(prd):\\n\\n for j, bl in enumerate(prd):\\n\\n if bl:\\n\\n for x, y in g[j]:\\n\\n if prd[x] != y:\\n\\n return False\\n\\n return True\\n\\n\\n\\n ans = 0\\n\\n for prd in product([0, 1], repeat=N):\\n\\n *prd, = prd # list化\\n\\n if is_ok(prd):\\n\\n ans = max(ans, prd.count(1))\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\\n\\n\\n# bit演算しようとしてはまった\\n\",\n", + " 'target': \"def main():\\n\\n from itertools import product\\n\\n\\n\\n N = int(eval(input()))\\n\\n\\n\\n g = []\\n\\n for _ in range(N):\\n\\n a = int(eval(input()))\\n\\n t = []\\n\\n for _ in range(a):\\n\\n x, y = list(map(int, input().split()))\\n\\n t.append((x - 1, y))\\n\\n g.append(t)\\n\\n\\n\\n def is_ok(prd):\\n\\n for j, bl in enumerate(prd):\\n\\n if bl:\\n\\n for x, y in g[j]:\\n\\n if prd[x] != y:\\n\\n return False\\n\\n return True\\n\\n\\n\\n ans = 0\\n\\n for prd in product([0, 1], repeat=N):\\n\\n if is_ok(prd):\\n\\n ans = max(ans, prd.count(1))\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\\n\\n\\n# bit演算しようとしてはまった\\n\",\n", + " 'code_v0_loc': 35,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 743,\n", + " 'code_v1_num_chars': 697,\n", + " 'code_v0_no_empty_lines': 'def main():\\n from itertools import product\\n\\n N = int(eval(input()))\\n g = []\\n for _ in range(N):\\n a = int(eval(input()))\\n t = []\\n for _ in range(a):\\n x, y = list(map(int, input().split()))\\n x -= 1\\n t.append((x, y))\\n g.append(t)\\n\\n def is_ok(prd):\\n for j, bl in enumerate(prd):\\n if bl:\\n for x, y in g[j]:\\n if prd[x] != y:\\n return False\\n return True\\n\\n ans = 0\\n for prd in product([0, 1], repeat=N):\\n (*prd,) = prd # list化\\n if is_ok(prd):\\n ans = max(ans, prd.count(1))\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n# bit演算しようとしてはまった\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n from itertools import product\\n\\n N = int(eval(input()))\\n g = []\\n for _ in range(N):\\n a = int(eval(input()))\\n t = []\\n for _ in range(a):\\n x, y = list(map(int, input().split()))\\n t.append((x - 1, y))\\n g.append(t)\\n\\n def is_ok(prd):\\n for j, bl in enumerate(prd):\\n if bl:\\n for x, y in g[j]:\\n if prd[x] != y:\\n return False\\n return True\\n\\n ans = 0\\n for prd in product([0, 1], repeat=N):\\n if is_ok(prd):\\n ans = max(ans, prd.count(1))\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n# bit演算しようとしてはまった\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.7142857143,\n", + " 'diff': ['- x -= 1',\n", + " '- t.append((x, y))',\n", + " '+ t.append((x - 1, y))',\n", + " '- (*prd,) = prd # list化'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1481621904,\n", + " 'measured_runtime_v1': 0.0058356328,\n", + " 'runtime_lift': 25.3892243111,\n", + " 'key': ['s918027483', 's762694988']},\n", + " {'user_id': 'u761320129',\n", + " 'problem_id': 'p03839',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's934844992',\n", + " 'submission_id_v1': 's135860240',\n", + " 'cpu_time_v0': 205,\n", + " 'cpu_time_v1': 174,\n", + " 'memory_v0': 17404,\n", + " 'memory_v1': 17532,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.12,\n", + " 'input': 'N,K = list(map(int,input().split()))\\n\\nsrc = list(map(int,input().split()))\\n\\n\\n\\ncums = [0]\\n\\ncump = [0]\\n\\nfor a in src:\\n\\n cums.append(cums[-1] + a)\\n\\n cump.append(cump[-1] + max(0,a))\\n\\n\\n\\nans = 0\\n\\nfor i in range(N-K+1):\\n\\n tmp = cump[i]\\n\\n tmp += max(0, cums[i+K] - cums[i])\\n\\n tmp += cump[N] - cump[i+K]\\n\\n ans = max(tmp, ans)\\n\\nprint(ans)\\n',\n", + " 'target': \"N,K = list(map(int,input().split()))\\n\\nA = list(map(int,input().split()))\\n\\n\\n\\ncums = [0]\\n\\ncums_p = [0]\\n\\nfor a in A:\\n\\n cums.append(cums[-1] + a)\\n\\n cums_p.append(cums_p[-1] + max(0,a))\\n\\n\\n\\nans = -float('inf')\\n\\nfor l in range(N-K+1):\\n\\n free = cums_p[l] + cums_p[-1] - cums_p[l+K]\\n\\n cont = cums[l+K] - cums[l]\\n\\n ans = max(ans, free, free+cont)\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 342,\n", + " 'code_v1_num_chars': 357,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\nsrc = list(map(int, input().split()))\\ncums = [0]\\ncump = [0]\\nfor a in src:\\n cums.append(cums[-1] + a)\\n cump.append(cump[-1] + max(0, a))\\nans = 0\\nfor i in range(N - K + 1):\\n tmp = cump[i]\\n tmp += max(0, cums[i + K] - cums[i])\\n tmp += cump[N] - cump[i + K]\\n ans = max(tmp, ans)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\ncums = [0]\\ncums_p = [0]\\nfor a in A:\\n cums.append(cums[-1] + a)\\n cums_p.append(cums_p[-1] + max(0, a))\\nans = -float(\"inf\")\\nfor l in range(N - K + 1):\\n free = cums_p[l] + cums_p[-1] - cums_p[l + K]\\n cont = cums[l + K] - cums[l]\\n ans = max(ans, free, free + cont)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.25,\n", + " 'diff': ['-src = list(map(int, input().split()))',\n", + " '+A = list(map(int, input().split()))',\n", + " '-cump = [0]',\n", + " '-for a in src:',\n", + " '+cums_p = [0]',\n", + " '+for a in A:',\n", + " '- cump.append(cump[-1] + max(0, a))',\n", + " '-ans = 0',\n", + " '-for i in range(N - K + 1):',\n", + " '- tmp = cump[i]',\n", + " '- tmp += max(0, cums[i + K] - cums[i])',\n", + " '- tmp += cump[N] - cump[i + K]',\n", + " '- ans = max(tmp, ans)',\n", + " '+ cums_p.append(cums_p[-1] + max(0, a))',\n", + " '+ans = -float(\"inf\")',\n", + " '+for l in range(N - K + 1):',\n", + " '+ free = cums_p[l] + cums_p[-1] - cums_p[l + K]',\n", + " '+ cont = cums[l + K] - cums[l]',\n", + " '+ ans = max(ans, free, free + cont)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3907449563,\n", + " 'measured_runtime_v1': 0.3033102551,\n", + " 'runtime_lift': 1.2882681998,\n", + " 'key': ['s934844992', 's135860240']},\n", + " {'user_id': 'u633450100',\n", + " 'problem_id': 'p04012',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's292377539',\n", + " 'submission_id_v1': 's830942060',\n", + " 'cpu_time_v0': 254,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 17816,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 93.31,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nw = eval(input())\\n\\nanal = np.array([])\\n\\n\\n\\nfor i in range(ord(\\'a\\'),ord(\\'z\\')+1):\\n\\n anal = np.append(anal,w.count(chr(i)))\\n\\nif np.all(anal % 2 == 0):\\n\\n #ans = np.sum(anal)\\n\\n print(\"Yes\")\\n\\nelse:\\n\\n print(\"No\")',\n", + " 'target': \"w = str(eval(input()))\\n\\ncount = int()\\n\\n\\n\\nfor i in range(len(w)):\\n\\n if w.count(w[i]) % 2 == 0:\\n\\n count += 1\\n\\n\\n\\nif count == len(w):\\n\\n print('Yes')\\n\\nelse:\\n\\n print('No')\",\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 232,\n", + " 'code_v1_num_chars': 175,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nw = eval(input())\\nanal = np.array([])\\nfor i in range(ord(\"a\"), ord(\"z\") + 1):\\n anal = np.append(anal, w.count(chr(i)))\\nif np.all(anal % 2 == 0):\\n # ans = np.sum(anal)\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 'w = str(eval(input()))\\ncount = int()\\nfor i in range(len(w)):\\n if w.count(w[i]) % 2 == 0:\\n count += 1\\nif count == len(w):\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-w = eval(input())',\n", + " '-anal = np.array([])',\n", + " '-for i in range(ord(\"a\"), ord(\"z\") + 1):',\n", + " '- anal = np.append(anal, w.count(chr(i)))',\n", + " '-if np.all(anal % 2 == 0):',\n", + " '- # ans = np.sum(anal)',\n", + " '+w = str(eval(input()))',\n", + " '+count = int()',\n", + " '+for i in range(len(w)):',\n", + " '+ if w.count(w[i]) % 2 == 0:',\n", + " '+ count += 1',\n", + " '+if count == len(w):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9986827209,\n", + " 'measured_runtime_v1': 0.2783588209,\n", + " 'runtime_lift': 7.1802384931,\n", + " 'key': ['s292377539', 's830942060']},\n", + " {'user_id': 'u194472175',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's141708536',\n", + " 'submission_id_v1': 's386181536',\n", + " 'cpu_time_v0': 50,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 9192,\n", + " 'memory_v1': 9160,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.0,\n", + " 'input': \"X=int(eval(input()))\\n\\nx=0\\n\\nlist=[]\\n\\nfor i in range(-118,120,1):\\n\\n\\n\\n for j in range(-119,119,1):\\n\\n x=i**5-j**5\\n\\n if x==X:\\n\\n list.append((str(i)+' '+str(j)))\\n\\n\\n\\nprint((list[0]))\",\n", + " 'target': \"X=int(eval(input()))\\n\\nx=0\\n\\nlist=[]\\n\\nfor i in range(-118,120,1):\\n\\n for j in range(-119,119,1):\\n\\n x=i**5-j**5\\n\\n if x==X:\\n\\n print((str(i)+' '+str(j)))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break\\n\",\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 195,\n", + " 'code_v1_num_chars': 229,\n", + " 'code_v0_no_empty_lines': 'X = int(eval(input()))\\nx = 0\\nlist = []\\nfor i in range(-118, 120, 1):\\n for j in range(-119, 119, 1):\\n x = i**5 - j**5\\n if x == X:\\n list.append((str(i) + \" \" + str(j)))\\nprint((list[0]))\\n',\n", + " 'code_v1_no_empty_lines': 'X = int(eval(input()))\\nx = 0\\nlist = []\\nfor i in range(-118, 120, 1):\\n for j in range(-119, 119, 1):\\n x = i**5 - j**5\\n if x == X:\\n print((str(i) + \" \" + str(j)))\\n break\\n else:\\n continue\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['- list.append((str(i) + \" \" + str(j)))',\n", + " '-print((list[0]))',\n", + " '+ print((str(i) + \" \" + str(j)))',\n", + " '+ break',\n", + " '+ else:',\n", + " '+ continue',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2096992373,\n", + " 'measured_runtime_v1': 0.1602732539,\n", + " 'runtime_lift': 1.3083857238,\n", + " 'key': ['s141708536', 's386181536']},\n", + " {'user_id': 'u964904181',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's459904551',\n", + " 'submission_id_v1': 's685671735',\n", + " 'cpu_time_v0': 153,\n", + " 'cpu_time_v1': 46,\n", + " 'memory_v0': 9880,\n", + " 'memory_v1': 9092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 69.93,\n", + " 'input': 'import math\\n\\n\\n\\nN = int(eval(input()))\\n\\n\\n\\nprint((math.factorial(N) % (1000000000 + 7)))\\n',\n", + " 'target': 'import math\\n\\n\\n\\nN = int(eval(input()))\\n\\n\\n\\np = 1\\n\\nfor i in range(2, N+1):\\n\\n p *= i\\n\\n p = p % (1000000000 + 7)\\n\\n \\n\\nprint(p)\\n',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 79,\n", + " 'code_v1_num_chars': 118,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nprint((math.factorial(N) % (1000000000 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\np = 1\\nfor i in range(2, N + 1):\\n p *= i\\n p = p % (1000000000 + 7)\\nprint(p)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-print((math.factorial(N) % (1000000000 + 7)))',\n", + " '+p = 1',\n", + " '+for i in range(2, N + 1):',\n", + " '+ p *= i',\n", + " '+ p = p % (1000000000 + 7)',\n", + " '+print(p)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5259809067,\n", + " 'measured_runtime_v1': 0.2554857254,\n", + " 'runtime_lift': 2.0587487065,\n", + " 'key': ['s459904551', 's685671735']},\n", + " {'user_id': 'u759412327',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's715481285',\n", + " 'submission_id_v1': 's158996242',\n", + " 'cpu_time_v0': 157,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12444,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.9,\n", + " 'input': \"import numpy as np\\n\\nimport sys\\n\\n\\n\\nbuf = sys.stdin.buffer\\n\\nH,W = list(map(int,buf.readline().split()))\\n\\n\\n\\ngrid = np.frombuffer(buf.read(H*(W+1)), dtype='S1').reshape((H,W+1))\\n\\ngrid = grid[:,:-1]\\n\\n\\n\\nselect_col = (grid == b'#').any(axis = 0)\\n\\nselect_row = (grid == b'#').any(axis = 1)\\n\\n\\n\\ngrid = grid[select_row, :]\\n\\ngrid = grid[:, select_col]\\n\\ngrid = grid.astype(str)\\n\\n\\n\\nprint(('\\\\n'.join(''.join(row) for row in grid)))\\n\",\n", + " 'target': \"H,W = list(map(int,input().split()))\\n\\nA = [eval(input()) for _ in range(H)]\\n\\nA = list([a for a in A if any(x=='#' for x in a)]) \\n\\nA = list([a for a in zip(*A) if any(x=='#' for x in a)])\\n\\n\\n\\nfor a in zip(*A):\\n\\n print((''.join(a)))\",\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 409,\n", + " 'code_v1_num_chars': 222,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport sys\\n\\nbuf = sys.stdin.buffer\\nH, W = list(map(int, buf.readline().split()))\\ngrid = np.frombuffer(buf.read(H * (W + 1)), dtype=\"S1\").reshape((H, W + 1))\\ngrid = grid[:, :-1]\\nselect_col = (grid == b\"#\").any(axis=0)\\nselect_row = (grid == b\"#\").any(axis=1)\\ngrid = grid[select_row, :]\\ngrid = grid[:, select_col]\\ngrid = grid.astype(str)\\nprint((\"\\\\n\".join(\"\".join(row) for row in grid)))\\n',\n", + " 'code_v1_no_empty_lines': 'H, W = list(map(int, input().split()))\\nA = [eval(input()) for _ in range(H)]\\nA = list([a for a in A if any(x == \"#\" for x in a)])\\nA = list([a for a in zip(*A) if any(x == \"#\" for x in a)])\\nfor a in zip(*A):\\n print((\"\".join(a)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 58.8235294118,\n", + " 'diff': ['-import numpy as np',\n", + " '-import sys',\n", + " '-',\n", + " '-buf = sys.stdin.buffer',\n", + " '-H, W = list(map(int, buf.readline().split()))',\n", + " '-grid = np.frombuffer(buf.read(H * (W + 1)), dtype=\"S1\").reshape((H, W + 1))',\n", + " '-grid = grid[:, :-1]',\n", + " '-select_col = (grid == b\"#\").any(axis=0)',\n", + " '-select_row = (grid == b\"#\").any(axis=1)',\n", + " '-grid = grid[select_row, :]',\n", + " '-grid = grid[:, select_col]',\n", + " '-grid = grid.astype(str)',\n", + " '-print((\"\\\\n\".join(\"\".join(row) for row in grid)))',\n", + " '+H, W = list(map(int, input().split()))',\n", + " '+A = [eval(input()) for _ in range(H)]',\n", + " '+A = list([a for a in A if any(x == \"#\" for x in a)])',\n", + " '+A = list([a for a in zip(*A) if any(x == \"#\" for x in a)])',\n", + " '+for a in zip(*A):',\n", + " '+ print((\"\".join(a)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2476984263,\n", + " 'measured_runtime_v1': 0.1928220473,\n", + " 'runtime_lift': 6.4707249179,\n", + " 'key': ['s715481285', 's158996242']},\n", + " {'user_id': 'u852690916',\n", + " 'problem_id': 'p02794',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's356881403',\n", + " 'submission_id_v1': 's623982203',\n", + " 'cpu_time_v0': 2735,\n", + " 'cpu_time_v1': 2229,\n", + " 'memory_v0': 44580,\n", + " 'memory_v1': 43936,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.5,\n", + " 'input': \"import sys\\n\\ndef main():\\n\\n input = sys.stdin.readline\\n\\n N = int(eval(input()))\\n\\n E = [[] for _ in range(N)]\\n\\n for i in range(N-1):\\n\\n a, b = list(map(int, input().split()))\\n\\n a, b = a-1, b-1\\n\\n E[a].append((b,i))\\n\\n E[b].append((a,i))\\n\\n \\n\\n def dfs(s, g):\\n\\n par = [(-1,-1)] * N\\n\\n par[s] = (s,-1)\\n\\n stack = [s]\\n\\n while stack:\\n\\n v = stack.pop()\\n\\n for to, i in E[v]:\\n\\n if par[to][0] >= 0: continue\\n\\n par[to] = (v, i)\\n\\n if to == g: break\\n\\n stack.append(to)\\n\\n r = set()\\n\\n v = g\\n\\n while v != s:\\n\\n v, i = par[v]\\n\\n r.add(i)\\n\\n return r\\n\\n \\n\\n M = int(eval(input()))\\n\\n path = [None] * M\\n\\n for i in range(M):\\n\\n u, v = list(map(int, input().split()))\\n\\n u, v = u-1, v-1\\n\\n path[i] = dfs(u, v)\\n\\n\\n\\n def calc(s): return 1<<(N-1-len(s))\\n\\n\\n\\n i_ans = 0\\n\\n for p in range(1, 1<>= 1\\n\\n if is_odd: i_ans += calc(s)\\n\\n else: i_ans -= calc(s)\\n\\n\\n\\n print(((1<<(N-1)) - i_ans))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"import sys\\n\\ndef main():\\n\\n input = sys.stdin.readline\\n\\n N = int(eval(input()))\\n\\n E = [[] for _ in range(N)]\\n\\n for i in range(N-1):\\n\\n a, b = list(map(int, input().split()))\\n\\n a, b = a-1, b-1\\n\\n E[a].append((b,i))\\n\\n E[b].append((a,i))\\n\\n \\n\\n def dfs(s, g):\\n\\n par = [(-1,-1)] * N\\n\\n par[s] = (s,-1)\\n\\n stack = [s]\\n\\n while stack:\\n\\n v = stack.pop()\\n\\n for to, i in E[v]:\\n\\n if par[to][0] >= 0: continue\\n\\n par[to] = (v, i)\\n\\n if to == g: break\\n\\n stack.append(to)\\n\\n r = set()\\n\\n v = g\\n\\n while v != s:\\n\\n v, i = par[v]\\n\\n r.add(i)\\n\\n return r\\n\\n \\n\\n M = int(eval(input()))\\n\\n path = [None] * M\\n\\n for i in range(M):\\n\\n u, v = list(map(int, input().split()))\\n\\n u, v = u-1, v-1\\n\\n path[i] = dfs(u, v)\\n\\n\\n\\n def calc(s): return 1<<(N-1-len(s))\\n\\n\\n\\n i_ans = 0\\n\\n for p in range(1, 1<>= 1\\n\\n if is_odd: i_ans += calc(s)\\n\\n else: i_ans -= calc(s)\\n\\n\\n\\n print(((1<<(N-1)) - i_ans))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 52,\n", + " 'code_v1_loc': 54,\n", + " 'code_v0_num_chars': 1262,\n", + " 'code_v1_num_chars': 1288,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\n\\ndef main():\\n input = sys.stdin.readline\\n N = int(eval(input()))\\n E = [[] for _ in range(N)]\\n for i in range(N - 1):\\n a, b = list(map(int, input().split()))\\n a, b = a - 1, b - 1\\n E[a].append((b, i))\\n E[b].append((a, i))\\n\\n def dfs(s, g):\\n par = [(-1, -1)] * N\\n par[s] = (s, -1)\\n stack = [s]\\n while stack:\\n v = stack.pop()\\n for to, i in E[v]:\\n if par[to][0] >= 0:\\n continue\\n par[to] = (v, i)\\n if to == g:\\n break\\n stack.append(to)\\n r = set()\\n v = g\\n while v != s:\\n v, i = par[v]\\n r.add(i)\\n return r\\n\\n M = int(eval(input()))\\n path = [None] * M\\n for i in range(M):\\n u, v = list(map(int, input().split()))\\n u, v = u - 1, v - 1\\n path[i] = dfs(u, v)\\n\\n def calc(s):\\n return 1 << (N - 1 - len(s))\\n\\n i_ans = 0\\n for p in range(1, 1 << M):\\n is_odd = bin(p).count(\"1\") & 1\\n s = set()\\n for i in range(M):\\n if p & 1:\\n s |= path[i]\\n p >>= 1\\n if is_odd:\\n i_ans += calc(s)\\n else:\\n i_ans -= calc(s)\\n print(((1 << (N - 1)) - i_ans))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef main():\\n input = sys.stdin.readline\\n N = int(eval(input()))\\n E = [[] for _ in range(N)]\\n for i in range(N - 1):\\n a, b = list(map(int, input().split()))\\n a, b = a - 1, b - 1\\n E[a].append((b, i))\\n E[b].append((a, i))\\n\\n def dfs(s, g):\\n par = [(-1, -1)] * N\\n par[s] = (s, -1)\\n stack = [s]\\n while stack:\\n v = stack.pop()\\n for to, i in E[v]:\\n if par[to][0] >= 0:\\n continue\\n par[to] = (v, i)\\n if to == g:\\n break\\n stack.append(to)\\n r = set()\\n v = g\\n while v != s:\\n v, i = par[v]\\n r.add(i)\\n return r\\n\\n M = int(eval(input()))\\n path = [None] * M\\n for i in range(M):\\n u, v = list(map(int, input().split()))\\n u, v = u - 1, v - 1\\n path[i] = dfs(u, v)\\n\\n def calc(s):\\n return 1 << (N - 1 - len(s))\\n\\n i_ans = 0\\n for p in range(1, 1 << M):\\n is_odd = 0\\n s = set()\\n for i in range(M):\\n if p & 1:\\n s |= path[i]\\n is_odd ^= 1\\n p >>= 1\\n if is_odd:\\n i_ans += calc(s)\\n else:\\n i_ans -= calc(s)\\n print(((1 << (N - 1)) - i_ans))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.7037037037,\n", + " 'diff': ['- is_odd = bin(p).count(\"1\") & 1',\n", + " '+ is_odd = 0',\n", + " '+ is_odd ^= 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3895377469,\n", + " 'measured_runtime_v1': 0.2566085732,\n", + " 'runtime_lift': 1.5180231199,\n", + " 'key': ['s356881403', 's623982203']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's646220831',\n", + " 'submission_id_v1': 's894161830',\n", + " 'cpu_time_v0': 493,\n", + " 'cpu_time_v1': 357,\n", + " 'memory_v0': 21804,\n", + " 'memory_v1': 62060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.59,\n", + " 'input': 'from numpy import*;_,a=open(0);print((*argsort(int32(a.split()))+1))',\n", + " 'target': 'n,a=open(0);a=a.split();print((*sorted(list(range(1,int(n)+1)),key=lambda x:int(a[x-1]))))',\n", + " 'code_v0_loc': 1,\n", + " 'code_v1_loc': 1,\n", + " 'code_v0_num_chars': 66,\n", + " 'code_v1_num_chars': 82,\n", + " 'code_v0_no_empty_lines': 'from numpy import *\\n\\n_, a = open(0)\\nprint((*argsort(int32(a.split())) + 1))\\n',\n", + " 'code_v1_no_empty_lines': 'n, a = open(0)\\na = a.split()\\nprint((*sorted(list(range(1, int(n) + 1)), key=lambda x: int(a[x - 1]))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-from numpy import *',\n", + " '-',\n", + " '-_, a = open(0)',\n", + " '-print((*argsort(int32(a.split())) + 1))',\n", + " '+n, a = open(0)',\n", + " '+a = a.split()',\n", + " '+print((*sorted(list(range(1, int(n) + 1)), key=lambda x: int(a[x - 1]))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.3151512724,\n", + " 'measured_runtime_v1': 0.2950551372,\n", + " 'runtime_lift': 7.8465038569,\n", + " 'key': ['s646220831', 's894161830']},\n", + " {'user_id': 'u579699847',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's947664162',\n", + " 'submission_id_v1': 's915143710',\n", + " 'cpu_time_v0': 285,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 20888,\n", + " 'memory_v1': 4468,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.63,\n", + " 'input': \"import numpy as np,sys\\n\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\n\\ndef S(): return sys.stdin.readline().rstrip()\\n\\nH,W = LI()\\n\\na = np.array([[s for s in S()] for _ in range(H)])\\n\\na = a[(a=='#').any(axis=1)]\\n\\na = a.T\\n\\na = a[(a=='#').any(axis=1)]\\n\\na = a.T.tolist()\\n\\nfor x in a:\\n\\n print(*x,sep='')\\n\",\n", + " 'target': \"import sys\\n\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\n\\ndef S(): return sys.stdin.readline().rstrip()\\n\\nH,W = LI()\\n\\na = [S() for _ in range(H)]\\n\\na2,a3 = [],[]\\n\\nfor x in a:\\n\\n if '#' in x:\\n\\n a2.append(x)\\n\\nfor y in zip(*a2):\\n\\n if '#' in y:\\n\\n a3.append(y)\\n\\nfor z in zip(*a3):\\n\\n print(*z,sep='')\\n\",\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 325,\n", + " 'code_v1_num_chars': 340,\n", + " 'code_v0_no_empty_lines': 'import numpy as np, sys\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().rstrip().split()))\\n\\n\\ndef S():\\n return sys.stdin.readline().rstrip()\\n\\n\\nH, W = LI()\\na = np.array([[s for s in S()] for _ in range(H)])\\na = a[(a == \"#\").any(axis=1)]\\na = a.T\\na = a[(a == \"#\").any(axis=1)]\\na = a.T.tolist()\\nfor x in a:\\n print(*x, sep=\"\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().rstrip().split()))\\n\\n\\ndef S():\\n return sys.stdin.readline().rstrip()\\n\\n\\nH, W = LI()\\na = [S() for _ in range(H)]\\na2, a3 = [], []\\nfor x in a:\\n if \"#\" in x:\\n a2.append(x)\\nfor y in zip(*a2):\\n if \"#\" in y:\\n a3.append(y)\\nfor z in zip(*a3):\\n print(*z, sep=\"\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['-import numpy as np, sys',\n", + " '+import sys',\n", + " '-a = np.array([[s for s in S()] for _ in range(H)])',\n", + " '-a = a[(a == \"#\").any(axis=1)]',\n", + " '-a = a.T',\n", + " '-a = a[(a == \"#\").any(axis=1)]',\n", + " '-a = a.T.tolist()',\n", + " '+a = [S() for _ in range(H)]',\n", + " '+a2, a3 = [], []',\n", + " '- print(*x, sep=\"\")',\n", + " '+ if \"#\" in x:',\n", + " '+ a2.append(x)',\n", + " '+for y in zip(*a2):',\n", + " '+ if \"#\" in y:',\n", + " '+ a3.append(y)',\n", + " '+for z in zip(*a3):',\n", + " '+ print(*z, sep=\"\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9641072226,\n", + " 'measured_runtime_v1': 0.3075638639,\n", + " 'runtime_lift': 6.3860142655,\n", + " 'key': ['s947664162', 's915143710']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's047908470',\n", + " 'submission_id_v1': 's794089628',\n", + " 'cpu_time_v0': 151,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 14456,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.74,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN, L = lr()\\n\\nA = np.arange(1, N+1)\\n\\nA += (L - 1)\\n\\nanswer = A.sum() - A[np.argmin(np.abs(A))]\\n\\nprint(answer)',\n", + " 'target': 'import sys\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN, L = lr()\\n\\ntotal = sum(range(L, L+N))\\n\\nsub = min(list(range(L, L+N)), key=abs)\\n\\nprint((total-sub))\\n',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 254,\n", + " 'code_v1_num_chars': 220,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN, L = lr()\\nA = np.arange(1, N + 1)\\nA += L - 1\\nanswer = A.sum() - A[np.argmin(np.abs(A))]\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN, L = lr()\\ntotal = sum(range(L, L + N))\\nsub = min(list(range(L, L + N)), key=abs)\\nprint((total - sub))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 16.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-A = np.arange(1, N + 1)',\n", + " '-A += L - 1',\n", + " '-answer = A.sum() - A[np.argmin(np.abs(A))]',\n", + " '-print(answer)',\n", + " '+total = sum(range(L, L + N))',\n", + " '+sub = min(list(range(L, L + N)), key=abs)',\n", + " '+print((total - sub))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7525720541,\n", + " 'measured_runtime_v1': 0.2779020016,\n", + " 'runtime_lift': 6.3064391184,\n", + " 'key': ['s047908470', 's794089628']},\n", + " {'user_id': 'u112317104',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's565064219',\n", + " 'submission_id_v1': 's656135042',\n", + " 'cpu_time_v0': 1126,\n", + " 'cpu_time_v1': 742,\n", + " 'memory_v0': 46132,\n", + " 'memory_v1': 32480,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 34.1,\n", + " 'input': 'from collections import defaultdict\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = [eval(input()) for _ in range(N)]\\n\\nA.sort()\\n\\nd = defaultdict(int)\\n\\nfor a in A:\\n\\n d[a] += 1\\n\\n\\n\\nl = sorted(d.items())\\n\\nmax_v = 0\\n\\n\\n\\nfor _, v in l:\\n\\n if v > max_v:\\n\\n max_v = v\\n\\n \\n\\nfor k, v in l:\\n\\n if v == max_v:\\n\\n print(k)\\n\\n else:\\n\\n continue\\n',\n", + " 'target': 'from collections import defaultdict\\n\\n\\n\\ndef solve():\\n\\n N = int(eval(input()))\\n\\n d = defaultdict(int)\\n\\n for _ in range(N):\\n\\n a = eval(input())\\n\\n d[a] += 1\\n\\n\\n\\n m = 0\\n\\n for k, v in list(d.items()):\\n\\n m = max(m, v)\\n\\n \\n\\n l = []\\n\\n for k, v in list(d.items()):\\n\\n if m == v:\\n\\n l.append(k)\\n\\n l.sort()\\n\\n for ans in l:\\n\\n print(ans)\\n\\n \\n\\nsolve()',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 330,\n", + " 'code_v1_num_chars': 386,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\n\\nN = int(eval(input()))\\nA = [eval(input()) for _ in range(N)]\\nA.sort()\\nd = defaultdict(int)\\nfor a in A:\\n d[a] += 1\\nl = sorted(d.items())\\nmax_v = 0\\nfor _, v in l:\\n if v > max_v:\\n max_v = v\\nfor k, v in l:\\n if v == max_v:\\n print(k)\\n else:\\n continue\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\n\\ndef solve():\\n N = int(eval(input()))\\n d = defaultdict(int)\\n for _ in range(N):\\n a = eval(input())\\n d[a] += 1\\n m = 0\\n for k, v in list(d.items()):\\n m = max(m, v)\\n l = []\\n for k, v in list(d.items()):\\n if m == v:\\n l.append(k)\\n l.sort()\\n for ans in l:\\n print(ans)\\n\\n\\nsolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-A = [eval(input()) for _ in range(N)]',\n", + " '-A.sort()',\n", + " '-d = defaultdict(int)',\n", + " '-for a in A:',\n", + " '- d[a] += 1',\n", + " '-l = sorted(d.items())',\n", + " '-max_v = 0',\n", + " '-for _, v in l:',\n", + " '- if v > max_v:',\n", + " '- max_v = v',\n", + " '-for k, v in l:',\n", + " '- if v == max_v:',\n", + " '- print(k)',\n", + " '- else:',\n", + " '- continue',\n", + " '+',\n", + " '+def solve():',\n", + " '+ N = int(eval(input()))',\n", + " '+ d = defaultdict(int)',\n", + " '+ for _ in range(N):',\n", + " '+ a = eval(input())',\n", + " '+ d[a] += 1',\n", + " '+ m = 0',\n", + " '+ for k, v in list(d.items()):',\n", + " '+ m = max(m, v)',\n", + " '+ l = []',\n", + " '+ for k, v in list(d.items()):',\n", + " '+ if m == v:',\n", + " '+ l.append(k)',\n", + " '+ l.sort()',\n", + " '+ for ans in l:',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+solve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2730668259,\n", + " 'measured_runtime_v1': 0.1417047331,\n", + " 'runtime_lift': 1.9270127385,\n", + " 'key': ['s565064219', 's656135042']},\n", + " {'user_id': 'u863442865',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's321808897',\n", + " 'submission_id_v1': 's575596303',\n", + " 'cpu_time_v0': 954,\n", + " 'cpu_time_v1': 745,\n", + " 'memory_v0': 139652,\n", + " 'memory_v1': 105356,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.91,\n", + " 'input': \"def main():\\n\\n import sys\\n\\n input = sys.stdin.readline\\n\\n sys.setrecursionlimit(10**7)\\n\\n from collections import Counter, deque\\n\\n #from collections import defaultdict\\n\\n from itertools import combinations, permutations, accumulate, groupby\\n\\n #from itertools import product\\n\\n from bisect import bisect_left,bisect_right\\n\\n import heapq\\n\\n from math import floor, ceil\\n\\n #from operator import itemgetter\\n\\n\\n\\n #inf = 10**17\\n\\n #mod = 10**9 + 7\\n\\n\\n\\n x,y,z,k = list(map(int, input().split()))\\n\\n a = list(map(int, input().split()))\\n\\n b = list(map(int, input().split()))\\n\\n c = list(map(int, input().split()))\\n\\n ab = []\\n\\n for i in a:\\n\\n for j in b:\\n\\n ab.append(i+j)\\n\\n ab.sort(reverse=1)\\n\\n ab = ab[:k]\\n\\n abc = []\\n\\n for i in ab:\\n\\n for j in c:\\n\\n abc.append(i+j)\\n\\n abc.sort(reverse=1)\\n\\n for i in range(k):\\n\\n print((abc[i]))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"#xyzの全通り調べると間に合わない\\n\\n#まず問題を分けよう\\n\\n#先にxyだけ考えてみる\\n\\n#xyの和をとってからそれとzの和をとるとき\\n\\n#xyの和においてk番目以降の値を使うことは無い\\n\\n#\\n\\n\\n\\ndef main():\\n\\n import sys\\n\\n input = sys.stdin.readline\\n\\n sys.setrecursionlimit(10**7)\\n\\n from collections import Counter, deque\\n\\n #from collections import defaultdict\\n\\n from itertools import combinations, permutations, accumulate, groupby\\n\\n #from itertools import product\\n\\n from bisect import bisect_left,bisect_right\\n\\n import heapq\\n\\n from math import floor, ceil\\n\\n #from operator import itemgetter\\n\\n\\n\\n #inf = 10**17\\n\\n #mod = 10**9 + 7\\n\\n\\n\\n x,y,z,k = list(map(int, input().split()))\\n\\n a = list(map(int, input().split()))\\n\\n b = list(map(int, input().split()))\\n\\n c = list(map(int, input().split()))\\n\\n a.sort(reverse=1)\\n\\n b.sort(reverse=1)\\n\\n c.sort(reverse=1)\\n\\n abc = []\\n\\n for i in range(x):\\n\\n for j in range(y):\\n\\n if i*j>k:\\n\\n continue\\n\\n for t in range(z):\\n\\n if i*j*t>k:\\n\\n continue\\n\\n abc.append(a[i]+b[j]+c[t])\\n\\n abc.sort(reverse=1)\\n\\n for i in range(k):\\n\\n print((abc[i]))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 36,\n", + " 'code_v1_loc': 45,\n", + " 'code_v0_num_chars': 954,\n", + " 'code_v1_num_chars': 1172,\n", + " 'code_v0_no_empty_lines': 'def main():\\n import sys\\n\\n input = sys.stdin.readline\\n sys.setrecursionlimit(10**7)\\n from collections import Counter, deque\\n\\n # from collections import defaultdict\\n from itertools import combinations, permutations, accumulate, groupby\\n\\n # from itertools import product\\n from bisect import bisect_left, bisect_right\\n import heapq\\n from math import floor, ceil\\n\\n # from operator import itemgetter\\n # inf = 10**17\\n # mod = 10**9 + 7\\n x, y, z, k = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n b = list(map(int, input().split()))\\n c = list(map(int, input().split()))\\n ab = []\\n for i in a:\\n for j in b:\\n ab.append(i + j)\\n ab.sort(reverse=1)\\n ab = ab[:k]\\n abc = []\\n for i in ab:\\n for j in c:\\n abc.append(i + j)\\n abc.sort(reverse=1)\\n for i in range(k):\\n print((abc[i]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# xyzの全通り調べると間に合わない\\n# まず問題を分けよう\\n# 先にxyだけ考えてみる\\n# xyの和をとってからそれとzの和をとるとき\\n# xyの和においてk番目以降の値を使うことは無い\\n#\\ndef main():\\n import sys\\n\\n input = sys.stdin.readline\\n sys.setrecursionlimit(10**7)\\n from collections import Counter, deque\\n\\n # from collections import defaultdict\\n from itertools import combinations, permutations, accumulate, groupby\\n\\n # from itertools import product\\n from bisect import bisect_left, bisect_right\\n import heapq\\n from math import floor, ceil\\n\\n # from operator import itemgetter\\n # inf = 10**17\\n # mod = 10**9 + 7\\n x, y, z, k = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n b = list(map(int, input().split()))\\n c = list(map(int, input().split()))\\n a.sort(reverse=1)\\n b.sort(reverse=1)\\n c.sort(reverse=1)\\n abc = []\\n for i in range(x):\\n for j in range(y):\\n if i * j > k:\\n continue\\n for t in range(z):\\n if i * j * t > k:\\n continue\\n abc.append(a[i] + b[j] + c[t])\\n abc.sort(reverse=1)\\n for i in range(k):\\n print((abc[i]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['+# xyzの全通り調べると間に合わない',\n", + " '+# まず問題を分けよう',\n", + " '+# 先にxyだけ考えてみる',\n", + " '+# xyの和をとってからそれとzの和をとるとき',\n", + " '+# xyの和においてk番目以降の値を使うことは無い',\n", + " '+#',\n", + " '- ab = []',\n", + " '- for i in a:',\n", + " '- for j in b:',\n", + " '- ab.append(i + j)',\n", + " '- ab.sort(reverse=1)',\n", + " '- ab = ab[:k]',\n", + " '+ a.sort(reverse=1)',\n", + " '+ b.sort(reverse=1)',\n", + " '+ c.sort(reverse=1)',\n", + " '- for i in ab:',\n", + " '- for j in c:',\n", + " '- abc.append(i + j)',\n", + " '+ for i in range(x):',\n", + " '+ for j in range(y):',\n", + " '+ if i * j > k:',\n", + " '+ continue',\n", + " '+ for t in range(z):',\n", + " '+ if i * j * t > k:',\n", + " '+ continue',\n", + " '+ abc.append(a[i] + b[j] + c[t])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5108549283,\n", + " 'measured_runtime_v1': 0.1529760139,\n", + " 'runtime_lift': 3.3394446306,\n", + " 'key': ['s321808897', 's575596303']},\n", + " {'user_id': 'u597374218',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's873197292',\n", + " 'submission_id_v1': 's712740845',\n", + " 'cpu_time_v0': 231,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 3980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.68,\n", + " 'input': 'import math\\n\\nprint((math.factorial(int(eval(input())))%(10**9+7)))',\n", + " 'target': 'ans=1\\n\\nn=int(eval(input()))\\n\\nfor i in range(1,n+1):\\n\\n ans*=i\\n\\n ans=ans%(10**9+7)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 58,\n", + " 'code_v1_num_chars': 92,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nprint((math.factorial(int(eval(input()))) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'ans = 1\\nn = int(eval(input()))\\nfor i in range(1, n + 1):\\n ans *= i\\n ans = ans % (10**9 + 7)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(int(eval(input()))) % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+n = int(eval(input()))',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans = ans % (10**9 + 7)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5415332041,\n", + " 'measured_runtime_v1': 0.2632789848,\n", + " 'runtime_lift': 2.0568797183,\n", + " 'key': ['s873197292', 's712740845']},\n", + " {'user_id': 'u498511622',\n", + " 'problem_id': 'p00001',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's534000808',\n", + " 'submission_id_v1': 's891056906',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 7536,\n", + " 'memory_v1': 7656,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.33,\n", + " 'input': 'ans=[]\\n\\nfor i in range (0,10):\\n\\n ans.append(int(eval(input())))\\n\\nans.sort(reverse=True)\\n\\nfor i in range (0,3):\\n\\n print((ans[i]))',\n", + " 'target': 'mountain=[]\\n\\nfor s in range(0,10):\\n\\n mountain.append(int(eval(input())))\\n\\nmountain.sort(reverse=True)\\n\\nfor s in range(0,3):\\n\\n print((mountain[s]))',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 126,\n", + " 'code_v1_num_chars': 141,\n", + " 'code_v0_no_empty_lines': 'ans = []\\nfor i in range(0, 10):\\n ans.append(int(eval(input())))\\nans.sort(reverse=True)\\nfor i in range(0, 3):\\n print((ans[i]))\\n',\n", + " 'code_v1_no_empty_lines': 'mountain = []\\nfor s in range(0, 10):\\n mountain.append(int(eval(input())))\\nmountain.sort(reverse=True)\\nfor s in range(0, 3):\\n print((mountain[s]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-ans = []',\n", + " '-for i in range(0, 10):',\n", + " '- ans.append(int(eval(input())))',\n", + " '-ans.sort(reverse=True)',\n", + " '-for i in range(0, 3):',\n", + " '- print((ans[i]))',\n", + " '+mountain = []',\n", + " '+for s in range(0, 10):',\n", + " '+ mountain.append(int(eval(input())))',\n", + " '+mountain.sort(reverse=True)',\n", + " '+for s in range(0, 3):',\n", + " '+ print((mountain[s]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3030959003,\n", + " 'measured_runtime_v1': 0.0643225815,\n", + " 'runtime_lift': 4.7121227575,\n", + " 'key': ['s534000808', 's891056906']},\n", + " {'user_id': 'u075012704',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's846597544',\n", + " 'submission_id_v1': 's758849446',\n", + " 'cpu_time_v0': 756,\n", + " 'cpu_time_v1': 520,\n", + " 'memory_v0': 43296,\n", + " 'memory_v1': 25512,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 31.22,\n", + " 'input': 'from collections import Counter\\n\\nN, M = list(map(int, input().split()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nX = Counter(A)\\n\\nfor i in range(M):\\n\\n B, C = list(map(int, input().split()))\\n\\n X[C] += B\\n\\n\\n\\nZ = []\\n\\nfor key, value in list(X.items()):\\n\\n Z.append((key, value))\\n\\n\\n\\nZ.sort(key=lambda x: x[0], reverse=True)\\n\\n\\n\\nans = 0\\n\\ncnt = 0\\n\\n\\n\\nfor value, key in Z:\\n\\n if cnt + key <= N:\\n\\n ans += key * value\\n\\n cnt += key\\n\\n else:\\n\\n ans += (N - cnt) * value\\n\\n break\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'N, M = list(map(int, input().split()))\\n\\nA = sorted(list(map(int, input().split())))\\n\\nquery = []\\n\\nfor i in range(M):\\n\\n b, c = list(map(int, input().split()))\\n\\n query.append([b, c])\\n\\nquery.sort(key=lambda q: q[1], reverse=True)\\n\\n\\n\\n\\n\\ni = 0\\n\\nfor b, c in query:\\n\\n while i < N and b > 0:\\n\\n if A[i] < c:\\n\\n A[i] = c\\n\\n b -= 1\\n\\n i += 1\\n\\n\\n\\nprint((sum(A)))\\n',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 496,\n", + " 'code_v1_num_chars': 376,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\n\\nN, M = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nX = Counter(A)\\nfor i in range(M):\\n B, C = list(map(int, input().split()))\\n X[C] += B\\nZ = []\\nfor key, value in list(X.items()):\\n Z.append((key, value))\\nZ.sort(key=lambda x: x[0], reverse=True)\\nans = 0\\ncnt = 0\\nfor value, key in Z:\\n if cnt + key <= N:\\n ans += key * value\\n cnt += key\\n else:\\n ans += (N - cnt) * value\\n break\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nA = sorted(list(map(int, input().split())))\\nquery = []\\nfor i in range(M):\\n b, c = list(map(int, input().split()))\\n query.append([b, c])\\nquery.sort(key=lambda q: q[1], reverse=True)\\ni = 0\\nfor b, c in query:\\n while i < N and b > 0:\\n if A[i] < c:\\n A[i] = c\\n b -= 1\\n i += 1\\nprint((sum(A)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-from collections import Counter',\n", + " '-',\n", + " '-A = list(map(int, input().split()))',\n", + " '-X = Counter(A)',\n", + " '+A = sorted(list(map(int, input().split())))',\n", + " '+query = []',\n", + " '- B, C = list(map(int, input().split()))',\n", + " '- X[C] += B',\n", + " '-Z = []',\n", + " '-for key, value in list(X.items()):',\n", + " '- Z.append((key, value))',\n", + " '-Z.sort(key=lambda x: x[0], reverse=True)',\n", + " '-ans = 0',\n", + " '-cnt = 0',\n", + " '-for value, key in Z:',\n", + " '- if cnt + key <= N:',\n", + " '- ans += key * value',\n", + " '- cnt += key',\n", + " '- else:',\n", + " '- ans += (N - cnt) * value',\n", + " '- break',\n", + " '-print(ans)',\n", + " '+ b, c = list(map(int, input().split()))',\n", + " '+ query.append([b, c])',\n", + " '+query.sort(key=lambda q: q[1], reverse=True)',\n", + " '+i = 0',\n", + " '+for b, c in query:',\n", + " '+ while i < N and b > 0:',\n", + " '+ if A[i] < c:',\n", + " '+ A[i] = c',\n", + " '+ b -= 1',\n", + " '+ i += 1',\n", + " '+print((sum(A)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.254084451,\n", + " 'measured_runtime_v1': 0.0066267376,\n", + " 'runtime_lift': 38.3423135365,\n", + " 'key': ['s846597544', 's758849446']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p02649',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's280841683',\n", + " 'submission_id_v1': 's122055425',\n", + " 'cpu_time_v0': 644,\n", + " 'cpu_time_v1': 575,\n", + " 'memory_v0': 110324,\n", + " 'memory_v1': 110580,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.71,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\nfrom numba import njit\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\n@njit('(i4[::1],i4,i8[::1])', cache=True)\\n\\ndef main(A, B, C):\\n\\n counts = np.zeros(1 << 18, np.int32)\\n\\n popcount = np.zeros(1 << B, np.int32)\\n\\n for i in range(B):\\n\\n popcount[1 << i:1 << i + 1] = popcount[:1 << i] + 1\\n\\n\\n\\n answer = 0\\n\\n for i in range(1 << B):\\n\\n k = popcount[i]\\n\\n t = 0\\n\\n for x in A & i:\\n\\n n = counts[x]\\n\\n counts[x] += 1\\n\\n t -= C[n]\\n\\n t += C[n + 1]\\n\\n for x in A & i:\\n\\n counts[x] = 0\\n\\n if k & 1:\\n\\n t = -t\\n\\n answer += t\\n\\n return answer\\n\\n\\n\\nN, K, S, T = list(map(int, readline().split()))\\n\\nA = np.array(readline().split(), np.int32)\\n\\n\\n\\ndef convert_problem(S, T, A):\\n\\n ng = np.zeros(len(A), np.bool)\\n\\n B = np.zeros_like(A)\\n\\n n = 0\\n\\n for i in range(18):\\n\\n s, t = (S >> i) & 1, (T >> i) & 1\\n\\n if (s, t) == (0, 0):\\n\\n ng |= ((A >> i) & 1) == 1\\n\\n elif (s, t) == (1, 1):\\n\\n ng |= ((A >> i) & 1) == 0\\n\\n elif (s, t) == (1, 0):\\n\\n print((0))\\n\\n exit()\\n\\n else:\\n\\n B += ((A >> i) & 1) << n\\n\\n n += 1\\n\\n return B[~ng], n\\n\\n\\n\\nA, B = convert_problem(S, T, A)\\n\\n\\n\\nC = np.zeros((100, 100), np.int64)\\n\\nC[0, 0] = 1\\n\\nfor n in range(1, 100):\\n\\n C[n, :-1] += C[n - 1, :-1]\\n\\n C[n, 1:] += C[n - 1, :-1]\\n\\nC = C[:, 1:K + 1].sum(axis=1)\\n\\n\\n\\nprint((main(A, B, C)))\",\n", + " 'target': \"import sys\\n\\nimport numpy as np\\n\\nfrom numba import njit\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\n@njit('(i4[::1],i4,i8[::1])', cache=True)\\n\\ndef main(A, B, C):\\n\\n counts = np.zeros(1 << 18, np.int32)\\n\\n popcount = np.zeros(1 << B, np.int32)\\n\\n for i in range(B):\\n\\n popcount[1 << i:1 << i + 1] = popcount[:1 << i] + 1\\n\\n\\n\\n answer = 0\\n\\n for i in range(1 << B):\\n\\n k = popcount[i]\\n\\n t = 0\\n\\n for x in A & i:\\n\\n n = counts[x]\\n\\n counts[x] += 1\\n\\n t -= C[n]\\n\\n t += C[n + 1]\\n\\n for x in A & i:\\n\\n counts[x] = 0\\n\\n if k & 1:\\n\\n t = -t\\n\\n answer += t\\n\\n return answer\\n\\n \\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n from numba.pycc import CC\\n\\n cc = CC('my_module')\\n\\n cc.export('main', '(i4[::1],i4,i8[::1])')(main)\\n\\n cc.compile()\\n\\n exit()\\n\\nfrom my_module import main\\n\\n\\n\\nN, K, S, T = list(map(int, readline().split()))\\n\\nA = np.array(readline().split(), np.int32)\\n\\n\\n\\ndef convert_problem(S, T, A):\\n\\n ng = np.zeros(len(A), np.bool)\\n\\n B = np.zeros_like(A)\\n\\n n = 0\\n\\n for i in range(18):\\n\\n s, t = (S >> i) & 1, (T >> i) & 1\\n\\n if (s, t) == (0, 0):\\n\\n ng |= ((A >> i) & 1) == 1\\n\\n elif (s, t) == (1, 1):\\n\\n ng |= ((A >> i) & 1) == 0\\n\\n elif (s, t) == (1, 0):\\n\\n print((0))\\n\\n exit()\\n\\n else:\\n\\n B += ((A >> i) & 1) << n\\n\\n n += 1\\n\\n return B[~ng], n\\n\\n\\n\\nA, B = convert_problem(S, T, A)\\n\\n\\n\\nC = np.zeros((100, 100), np.int64)\\n\\nC[0, 0] = 1\\n\\nfor n in range(1, 100):\\n\\n C[n, :-1] += C[n - 1, :-1]\\n\\n C[n, 1:] += C[n - 1, :-1]\\n\\nC = C[:, 1:K + 1].sum(axis=1)\\n\\n\\n\\nprint((main(A, B, C)))\",\n", + " 'code_v0_loc': 62,\n", + " 'code_v1_loc': 70,\n", + " 'code_v0_num_chars': 1548,\n", + " 'code_v1_num_chars': 1756,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\nfrom numba import njit\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n@njit(\"(i4[::1],i4,i8[::1])\", cache=True)\\ndef main(A, B, C):\\n counts = np.zeros(1 << 18, np.int32)\\n popcount = np.zeros(1 << B, np.int32)\\n for i in range(B):\\n popcount[1 << i : 1 << i + 1] = popcount[: 1 << i] + 1\\n answer = 0\\n for i in range(1 << B):\\n k = popcount[i]\\n t = 0\\n for x in A & i:\\n n = counts[x]\\n counts[x] += 1\\n t -= C[n]\\n t += C[n + 1]\\n for x in A & i:\\n counts[x] = 0\\n if k & 1:\\n t = -t\\n answer += t\\n return answer\\n\\n\\nN, K, S, T = list(map(int, readline().split()))\\nA = np.array(readline().split(), np.int32)\\n\\n\\ndef convert_problem(S, T, A):\\n ng = np.zeros(len(A), np.bool)\\n B = np.zeros_like(A)\\n n = 0\\n for i in range(18):\\n s, t = (S >> i) & 1, (T >> i) & 1\\n if (s, t) == (0, 0):\\n ng |= ((A >> i) & 1) == 1\\n elif (s, t) == (1, 1):\\n ng |= ((A >> i) & 1) == 0\\n elif (s, t) == (1, 0):\\n print((0))\\n exit()\\n else:\\n B += ((A >> i) & 1) << n\\n n += 1\\n return B[~ng], n\\n\\n\\nA, B = convert_problem(S, T, A)\\nC = np.zeros((100, 100), np.int64)\\nC[0, 0] = 1\\nfor n in range(1, 100):\\n C[n, :-1] += C[n - 1, :-1]\\n C[n, 1:] += C[n - 1, :-1]\\nC = C[:, 1 : K + 1].sum(axis=1)\\nprint((main(A, B, C)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport numpy as np\\nfrom numba import njit\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n@njit(\"(i4[::1],i4,i8[::1])\", cache=True)\\ndef main(A, B, C):\\n counts = np.zeros(1 << 18, np.int32)\\n popcount = np.zeros(1 << B, np.int32)\\n for i in range(B):\\n popcount[1 << i : 1 << i + 1] = popcount[: 1 << i] + 1\\n answer = 0\\n for i in range(1 << B):\\n k = popcount[i]\\n t = 0\\n for x in A & i:\\n n = counts[x]\\n counts[x] += 1\\n t -= C[n]\\n t += C[n + 1]\\n for x in A & i:\\n counts[x] = 0\\n if k & 1:\\n t = -t\\n answer += t\\n return answer\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n from numba.pycc import CC\\n\\n cc = CC(\"my_module\")\\n cc.export(\"main\", \"(i4[::1],i4,i8[::1])\")(main)\\n cc.compile()\\n exit()\\nfrom my_module import main\\n\\nN, K, S, T = list(map(int, readline().split()))\\nA = np.array(readline().split(), np.int32)\\n\\n\\ndef convert_problem(S, T, A):\\n ng = np.zeros(len(A), np.bool)\\n B = np.zeros_like(A)\\n n = 0\\n for i in range(18):\\n s, t = (S >> i) & 1, (T >> i) & 1\\n if (s, t) == (0, 0):\\n ng |= ((A >> i) & 1) == 1\\n elif (s, t) == (1, 1):\\n ng |= ((A >> i) & 1) == 0\\n elif (s, t) == (1, 0):\\n print((0))\\n exit()\\n else:\\n B += ((A >> i) & 1) << n\\n n += 1\\n return B[~ng], n\\n\\n\\nA, B = convert_problem(S, T, A)\\nC = np.zeros((100, 100), np.int64)\\nC[0, 0] = 1\\nfor n in range(1, 100):\\n C[n, :-1] += C[n - 1, :-1]\\n C[n, 1:] += C[n - 1, :-1]\\nC = C[:, 1 : K + 1].sum(axis=1)\\nprint((main(A, B, C)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.4285714286,\n", + " 'diff': ['+if sys.argv[-1] == \"ONLINE_JUDGE\":',\n", + " '+ from numba.pycc import CC',\n", + " '+',\n", + " '+ cc = CC(\"my_module\")',\n", + " '+ cc.export(\"main\", \"(i4[::1],i4,i8[::1])\")(main)',\n", + " '+ cc.compile()',\n", + " '+ exit()',\n", + " '+from my_module import main',\n", + " '+'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8857788267,\n", + " 'measured_runtime_v1': 1.3703739867,\n", + " 'runtime_lift': 1.3761052421,\n", + " 'key': ['s280841683', 's122055425']},\n", + " {'user_id': 'u952708174',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's856754977',\n", + " 'submission_id_v1': 's552892775',\n", + " 'cpu_time_v0': 106,\n", + " 'cpu_time_v1': 34,\n", + " 'memory_v0': 9192,\n", + " 'memory_v1': 9148,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 67.92,\n", + " 'input': 'def c_repsept():\\n\\n K = int(eval(input()))\\n\\n\\n\\n L = 9 * K // 7 if K % 7 == 0 else 9 * K\\n\\n if L % 2 == 0 or L % 5 == 0:\\n\\n return -1\\n\\n\\n\\n remainder = 1\\n\\n for n in range(1, L + 1):\\n\\n remainder = (10 * remainder) % L\\n\\n if remainder == 1:\\n\\n return n\\n\\n return -1\\n\\n\\n\\nprint((c_repsept()))',\n", + " 'target': 'def c_repsept_totient():\\n\\n def euler_phi(n):\\n\\n \"\"\"正整数 n に対して、n と互いに素な n 以下の正整数の個数\"\"\"\\n\\n ret = n\\n\\n for i in range(2, int(n**0.5) + 1):\\n\\n if n % i == 0:\\n\\n ret = ret // i * (i - 1)\\n\\n while n % i == 0:\\n\\n n //= i\\n\\n if n > 1:\\n\\n ret -= ret // n\\n\\n return ret\\n\\n\\n\\n def divisor_list(n):\\n\\n \"\"\"n の正の約数のリスト\"\"\"\\n\\n ret = set()\\n\\n for k in range(1, int(n**0.5) + 1):\\n\\n if n % k == 0:\\n\\n ret.update({k, n // k})\\n\\n return sorted(ret)\\n\\n\\n\\n K = int(eval(input()))\\n\\n L = 9 * (K // 7 if K % 7 == 0 else K)\\n\\n\\n\\n for d in divisor_list(euler_phi(L)):\\n\\n if pow(10, d, L) == 1:\\n\\n return d\\n\\n return -1\\n\\n\\n\\nprint((c_repsept_totient()))',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 319,\n", + " 'code_v1_num_chars': 786,\n", + " 'code_v0_no_empty_lines': 'def c_repsept():\\n K = int(eval(input()))\\n L = 9 * K // 7 if K % 7 == 0 else 9 * K\\n if L % 2 == 0 or L % 5 == 0:\\n return -1\\n remainder = 1\\n for n in range(1, L + 1):\\n remainder = (10 * remainder) % L\\n if remainder == 1:\\n return n\\n return -1\\n\\n\\nprint((c_repsept()))\\n',\n", + " 'code_v1_no_empty_lines': 'def c_repsept_totient():\\n def euler_phi(n):\\n \"\"\"正整数 n に対して、n と互いに素な n 以下の正整数の個数\"\"\"\\n ret = n\\n for i in range(2, int(n**0.5) + 1):\\n if n % i == 0:\\n ret = ret // i * (i - 1)\\n while n % i == 0:\\n n //= i\\n if n > 1:\\n ret -= ret // n\\n return ret\\n\\n def divisor_list(n):\\n \"\"\"n の正の約数のリスト\"\"\"\\n ret = set()\\n for k in range(1, int(n**0.5) + 1):\\n if n % k == 0:\\n ret.update({k, n // k})\\n return sorted(ret)\\n\\n K = int(eval(input()))\\n L = 9 * (K // 7 if K % 7 == 0 else K)\\n for d in divisor_list(euler_phi(L)):\\n if pow(10, d, L) == 1:\\n return d\\n return -1\\n\\n\\nprint((c_repsept_totient()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-def c_repsept():',\n", + " '+def c_repsept_totient():',\n", + " '+ def euler_phi(n):',\n", + " '+ \"\"\"正整数 n に対して、n と互いに素な n 以下の正整数の個数\"\"\"',\n", + " '+ ret = n',\n", + " '+ for i in range(2, int(n**0.5) + 1):',\n", + " '+ if n % i == 0:',\n", + " '+ ret = ret // i * (i - 1)',\n", + " '+ while n % i == 0:',\n", + " '+ n //= i',\n", + " '+ if n > 1:',\n", + " '+ ret -= ret // n',\n", + " '+ return ret',\n", + " '+',\n", + " '+ def divisor_list(n):',\n", + " '+ \"\"\"n の正の約数のリスト\"\"\"',\n", + " '+ ret = set()',\n", + " '+ for k in range(1, int(n**0.5) + 1):',\n", + " '+ if n % k == 0:',\n", + " '+ ret.update({k, n // k})',\n", + " '+ return sorted(ret)',\n", + " '+',\n", + " '- L = 9 * K // 7 if K % 7 == 0 else 9 * K',\n", + " '- if L % 2 == 0 or L % 5 == 0:',\n", + " '- return -1',\n", + " '- remainder = 1',\n", + " '- for n in range(1, L + 1):',\n", + " '- remainder = (10 * remainder) % L',\n", + " '- if remainder == 1:',\n", + " '- return n',\n", + " '+ L = 9 * (K // 7 if K % 7 == 0 else K)',\n", + " '+ for d in divisor_list(euler_phi(L)):',\n", + " '+ if pow(10, d, L) == 1:',\n", + " '+ return d',\n", + " '-print((c_repsept()))',\n", + " '+print((c_repsept_totient()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.338304636,\n", + " 'measured_runtime_v1': 0.2146003115,\n", + " 'runtime_lift': 1.5764405634,\n", + " 'key': ['s856754977', 's552892775']},\n", + " {'user_id': 'u712975113',\n", + " 'problem_id': 'p03126',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's000173013',\n", + " 'submission_id_v1': 's171225616',\n", + " 'cpu_time_v0': 186,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12396,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.32,\n", + " 'input': 'import numpy as np\\n\\nN,M=list(map(int,input().split()))\\n\\nA=np.zeros((N+1,M+1))\\n\\nA[0]=np.ones(M+1)\\n\\nfor i in range(1,N+1):\\n\\n B=list(map(int,input().split()))\\n\\n for m in range(1,B[0]+1):\\n\\n A[i][B[m]]=A[i-1][B[m]]\\n\\na=sum(A[N])\\n\\nprint((int(a)))',\n", + " 'target': 'N,M=list(map(int,input().split()))\\n\\nA = [[1 for _ in range(M)]]+[[0 for _ in range(M)] for _ in range(N)]\\n\\nfor i in range(1,N+1):\\n\\n B=list(map(int,input().split()))\\n\\n Ai=B[1:]\\n\\n for m in Ai:\\n\\n A[i][m-1]=A[i-1][m-1]\\n\\na=sum(A[N])\\n\\nprint((int(a)))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 244,\n", + " 'code_v1_num_chars': 252,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, M = list(map(int, input().split()))\\nA = np.zeros((N + 1, M + 1))\\nA[0] = np.ones(M + 1)\\nfor i in range(1, N + 1):\\n B = list(map(int, input().split()))\\n for m in range(1, B[0] + 1):\\n A[i][B[m]] = A[i - 1][B[m]]\\na = sum(A[N])\\nprint((int(a)))\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nA = [[1 for _ in range(M)]] + [[0 for _ in range(M)] for _ in range(N)]\\nfor i in range(1, N + 1):\\n B = list(map(int, input().split()))\\n Ai = B[1:]\\n for m in Ai:\\n A[i][m - 1] = A[i - 1][m - 1]\\na = sum(A[N])\\nprint((int(a)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.zeros((N + 1, M + 1))',\n", + " '-A[0] = np.ones(M + 1)',\n", + " '+A = [[1 for _ in range(M)]] + [[0 for _ in range(M)] for _ in range(N)]',\n", + " '- for m in range(1, B[0] + 1):',\n", + " '- A[i][B[m]] = A[i - 1][B[m]]',\n", + " '+ Ai = B[1:]',\n", + " '+ for m in Ai:',\n", + " '+ A[i][m - 1] = A[i - 1][m - 1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.536293736,\n", + " 'measured_runtime_v1': 0.2500440102,\n", + " 'runtime_lift': 6.1440933335,\n", + " 'key': ['s000173013', 's171225616']},\n", + " {'user_id': 'u599547273',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's252753387',\n", + " 'submission_id_v1': 's505612116',\n", + " 'cpu_time_v0': 21,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.29,\n", + " 'input': 'def two_count(x):\\n\\n\\tif int(str(x)[-1]) % 2 == 0:\\n\\n\\t\\treturn 1 + two_count(x//2)\\n\\n\\telse:\\n\\n\\t\\treturn 0\\n\\n\\n\\nn = int(eval(input()))\\n\\nn_list = [int(n) for n in input().split(\" \")]\\n\\n\\n\\nn_two_count_list = [two_count(n) for n in n_list]\\n\\n\\n\\nprint((min(n_two_count_list)))',\n", + " 'target': 'def two_count(x):\\n\\n\\tif x % 2 == 0:\\n\\n\\t\\treturn 1 + two_count(x//2)\\n\\n\\telse:\\n\\n\\t\\treturn 0\\n\\n\\n\\nn = int(eval(input()))\\n\\nn_list = [int(n) for n in input().split(\" \")]\\n\\n\\n\\nn_two_count_list = [two_count(n) for n in n_list]\\n\\n\\n\\nprint((min(n_two_count_list)))',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 250,\n", + " 'code_v1_num_chars': 236,\n", + " 'code_v0_no_empty_lines': 'def two_count(x):\\n if int(str(x)[-1]) % 2 == 0:\\n return 1 + two_count(x // 2)\\n else:\\n return 0\\n\\n\\nn = int(eval(input()))\\nn_list = [int(n) for n in input().split(\" \")]\\nn_two_count_list = [two_count(n) for n in n_list]\\nprint((min(n_two_count_list)))\\n',\n", + " 'code_v1_no_empty_lines': 'def two_count(x):\\n if x % 2 == 0:\\n return 1 + two_count(x // 2)\\n else:\\n return 0\\n\\n\\nn = int(eval(input()))\\nn_list = [int(n) for n in input().split(\" \")]\\nn_two_count_list = [two_count(n) for n in n_list]\\nprint((min(n_two_count_list)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- if int(str(x)[-1]) % 2 == 0:', '+ if x % 2 == 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3392717605,\n", + " 'measured_runtime_v1': 0.2706325946,\n", + " 'runtime_lift': 1.2536249042,\n", + " 'key': ['s252753387', 's505612116']},\n", + " {'user_id': 'u714642969',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's395457883',\n", + " 'submission_id_v1': 's001240926',\n", + " 'cpu_time_v0': 284,\n", + " 'cpu_time_v1': 184,\n", + " 'memory_v0': 14132,\n", + " 'memory_v1': 39024,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.21,\n", + " 'input': \"import numpy as np\\n\\n\\n\\nN=int(eval(input()))\\n\\na=int(np.sqrt(N))\\n\\nb=float('inf')\\n\\nfor i in range(1,a+1):\\n\\n if N%i==0:\\n\\n if i+N//ipsum:\\n\\n pmin=psum\\n\\nprint(pmin) ',\n", + " 'target': 'n=int(eval(input()))\\n\\nx=list(map(int,input().split()))\\n\\n\\n\\nx.sort()\\n\\n\\n\\npsum=0\\n\\nfor i in range(len(x)):\\n\\n psum=psum+(x[0]-x[i])**2\\n\\n# print(psum)\\n\\npmin=psum \\n\\nfor j in range(x[0]+1,x[len(x)-1]):\\n\\n psum=0\\n\\n for i in range(len(x)):\\n\\n psum=psum+(j-x[i])**2\\n\\n# print(psum)\\n\\n if pmin>psum:\\n\\n pmin=psum\\n\\nprint(pmin) \\n',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 421,\n", + " 'code_v1_num_chars': 353,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nx = list(map(int, input().split()))\\nx.sort()\\nfor p in range(x[0], x[len(x) - 1] + 1):\\n psum = 0\\n for i in range(len(x)):\\n psum = psum + (x[0] - x[i]) ** 2\\n # print(psum)\\n pmin = psum\\n for j in range(x[0] + 1, x[len(x) - 1]):\\n psum = 0\\n for i in range(len(x)):\\n psum = psum + (j - x[i]) ** 2\\n # print(psum)\\n if pmin > psum:\\n pmin = psum\\nprint(pmin)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nx = list(map(int, input().split()))\\nx.sort()\\npsum = 0\\nfor i in range(len(x)):\\n psum = psum + (x[0] - x[i]) ** 2\\n# print(psum)\\npmin = psum\\nfor j in range(x[0] + 1, x[len(x) - 1]):\\n psum = 0\\n for i in range(len(x)):\\n psum = psum + (j - x[i]) ** 2\\n # print(psum)\\n if pmin > psum:\\n pmin = psum\\nprint(pmin)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.2631578947,\n", + " 'diff': ['-for p in range(x[0], x[len(x) - 1] + 1):',\n", + " '+psum = 0',\n", + " '+for i in range(len(x)):',\n", + " '+ psum = psum + (x[0] - x[i]) ** 2',\n", + " '+# print(psum)',\n", + " '+pmin = psum',\n", + " '+for j in range(x[0] + 1, x[len(x) - 1]):',\n", + " '- psum = psum + (x[0] - x[i]) ** 2',\n", + " '- # print(psum)',\n", + " '- pmin = psum',\n", + " '- for j in range(x[0] + 1, x[len(x) - 1]):',\n", + " '- psum = 0',\n", + " '- for i in range(len(x)):',\n", + " '- psum = psum + (j - x[i]) ** 2',\n", + " '- # print(psum)',\n", + " '- if pmin > psum:',\n", + " '- pmin = psum',\n", + " '+ psum = psum + (j - x[i]) ** 2',\n", + " '+ # print(psum)',\n", + " '+ if pmin > psum:',\n", + " '+ pmin = psum'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.298344056,\n", + " 'measured_runtime_v1': 0.1876089347,\n", + " 'runtime_lift': 1.59024439,\n", + " 'key': ['s320006452', 's025352649']},\n", + " {'user_id': 'u072717685',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's483749071',\n", + " 'submission_id_v1': 's341017329',\n", + " 'cpu_time_v0': 162,\n", + " 'cpu_time_v1': 124,\n", + " 'memory_v0': 27024,\n", + " 'memory_v1': 27028,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.46,\n", + " 'input': \"import sys\\n\\nread = sys.stdin.read\\n\\nreadlines = sys.stdin.readlines\\n\\nimport numpy as np\\n\\ndef main():\\n\\n x = int(eval(input()))\\n\\n for i1 in range(-201, 201):\\n\\n for i2 in range(-201, 201):\\n\\n if i1**5 - i2**5 == x:\\n\\n print((i1, i2))\\n\\n sys.exit()\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"import sys\\n\\nread = sys.stdin.read\\n\\nreadlines = sys.stdin.readlines\\n\\nimport numpy as np\\n\\nfrom itertools import product\\n\\ndef main():\\n\\n x = int(input())\\n\\n n5 = [i**5 for i in range(201)]\\n\\n\\n\\n c = product(n5, repeat=2)\\n\\n for ce in c:\\n\\n if ce[0] + ce[1] == x:\\n\\n r = (int(ce[0]**0.2), int(ce[1]**0.2)* -1)\\n\\n break\\n\\n elif ce[0] - ce[1] == x:\\n\\n r = (int(ce[0] ** 0.2), int(ce[1] ** 0.2))\\n\\n break\\n\\n print(*r, sep=' ')\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 328,\n", + " 'code_v1_num_chars': 522,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nimport numpy as np\\n\\n\\ndef main():\\n x = int(eval(input()))\\n for i1 in range(-201, 201):\\n for i2 in range(-201, 201):\\n if i1**5 - i2**5 == x:\\n print((i1, i2))\\n sys.exit()\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nimport numpy as np\\nfrom itertools import product\\n\\n\\ndef main():\\n x = int(input())\\n n5 = [i**5 for i in range(201)]\\n c = product(n5, repeat=2)\\n for ce in c:\\n if ce[0] + ce[1] == x:\\n r = (int(ce[0] ** 0.2), int(ce[1] ** 0.2) * -1)\\n break\\n elif ce[0] - ce[1] == x:\\n r = (int(ce[0] ** 0.2), int(ce[1] ** 0.2))\\n break\\n print(*r, sep=\" \")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['+from itertools import product',\n", + " '- x = int(eval(input()))',\n", + " '- for i1 in range(-201, 201):',\n", + " '- for i2 in range(-201, 201):',\n", + " '- if i1**5 - i2**5 == x:',\n", + " '- print((i1, i2))',\n", + " '- sys.exit()',\n", + " '+ x = int(input())',\n", + " '+ n5 = [i**5 for i in range(201)]',\n", + " '+ c = product(n5, repeat=2)',\n", + " '+ for ce in c:',\n", + " '+ if ce[0] + ce[1] == x:',\n", + " '+ r = (int(ce[0] ** 0.2), int(ce[1] ** 0.2) * -1)',\n", + " '+ break',\n", + " '+ elif ce[0] - ce[1] == x:',\n", + " '+ r = (int(ce[0] ** 0.2), int(ce[1] ** 0.2))',\n", + " '+ break',\n", + " '+ print(*r, sep=\" \")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6760180672,\n", + " 'measured_runtime_v1': 0.2428507467,\n", + " 'runtime_lift': 2.7836771199,\n", + " 'key': ['s483749071', 's341017329']},\n", + " {'user_id': 'u102242691',\n", + " 'problem_id': 'p03592',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's217761930',\n", + " 'submission_id_v1': 's778426463',\n", + " 'cpu_time_v0': 406,\n", + " 'cpu_time_v1': 310,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.65,\n", + " 'input': '\\n\\nn,m,k = list(map(int,input().split()))\\n\\n#１回押すと変わるマス\\u3000= N * M -1\\n\\n#２回目押すと黒に変わるマス N * M -1 -2\\n\\n# 3 = N * M -1 -4\\n\\n\\n\\ncnt = 0\\n\\nfor i in range(n+1):\\n\\n for j in range(m + 1):\\n\\n cnt = i * m + j * n -2 * i * j\\n\\n if cnt == k:\\n\\n print(\"Yes\")\\n\\n exit()\\n\\nprint(\"No\")\\n',\n", + " 'target': '\\n\\nn,m,k = list(map(int,input().split()))\\n\\n\\n\\nfor i in range(n+1):\\n\\n for j in range(m+1):\\n\\n if i*(m-j) + j*(n-i) == k:\\n\\n print(\"Yes\")\\n\\n exit()\\n\\nprint(\"No\")\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 288,\n", + " 'code_v1_num_chars': 180,\n", + " 'code_v0_no_empty_lines': 'n, m, k = list(map(int, input().split()))\\n# １回押すと変わるマス\\u3000= N * M -1\\n# ２回目押すと黒に変わるマス N * M -1 -2\\n# 3 = N * M -1 -4\\ncnt = 0\\nfor i in range(n + 1):\\n for j in range(m + 1):\\n cnt = i * m + j * n - 2 * i * j\\n if cnt == k:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 'n, m, k = list(map(int, input().split()))\\nfor i in range(n + 1):\\n for j in range(m + 1):\\n if i * (m - j) + j * (n - i) == k:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.7142857143,\n", + " 'diff': ['-# １回押すと変わるマス\\u3000= N * M -1',\n", + " '-# ２回目押すと黒に変わるマス N * M -1 -2',\n", + " '-# 3 = N * M -1 -4',\n", + " '-cnt = 0',\n", + " '- cnt = i * m + j * n - 2 * i * j',\n", + " '- if cnt == k:',\n", + " '+ if i * (m - j) + j * (n - i) == k:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2209630473,\n", + " 'measured_runtime_v1': 0.0057685788,\n", + " 'runtime_lift': 38.3045903988,\n", + " 'key': ['s217761930', 's778426463']},\n", + " {'user_id': 'u906501980',\n", + " 'problem_id': 'p03363',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's203042500',\n", + " 'submission_id_v1': 's990747122',\n", + " 'cpu_time_v0': 316,\n", + " 'cpu_time_v1': 264,\n", + " 'memory_v0': 52496,\n", + " 'memory_v1': 52544,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.46,\n", + " 'input': 'n = int(eval(input()))\\n\\nA = [int(i) for i in input().split()]\\n\\nS = [0]*(n+1)\\n\\nnum={}\\n\\nfor i in range(n):\\n\\n S[i+1] = S[i] + A[i]\\n\\nfor i in S:\\n\\n if str(i) in list(num.keys()):\\n\\n num[str(i)] += 1\\n\\n else:\\n\\n num[str(i)] = 1\\n\\nout = [i*(i-1)//2 for i in list(num.values()) if i>1]\\n\\nprint((sum(out)))',\n", + " 'target': 'n = int(eval(input()))\\n\\nA = [int(i) for i in input().split()]\\n\\nS = [0]*(n+1)\\n\\nnum = {}\\n\\nfor i in range(n):\\n\\n S[i+1] = S[i] + A[i]\\n\\nfor i in S:\\n\\n s = str(i)\\n\\n num[s] = 1 if s not in list(num.keys()) else num[s]+1\\n\\nout = [i*(i-1)//2 for i in list(num.values()) if i > 1]\\n\\nprint((sum(out)))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 295,\n", + " 'code_v1_num_chars': 276,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nA = [int(i) for i in input().split()]\\nS = [0] * (n + 1)\\nnum = {}\\nfor i in range(n):\\n S[i + 1] = S[i] + A[i]\\nfor i in S:\\n if str(i) in list(num.keys()):\\n num[str(i)] += 1\\n else:\\n num[str(i)] = 1\\nout = [i * (i - 1) // 2 for i in list(num.values()) if i > 1]\\nprint((sum(out)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nA = [int(i) for i in input().split()]\\nS = [0] * (n + 1)\\nnum = {}\\nfor i in range(n):\\n S[i + 1] = S[i] + A[i]\\nfor i in S:\\n s = str(i)\\n num[s] = 1 if s not in list(num.keys()) else num[s] + 1\\nout = [i * (i - 1) // 2 for i in list(num.values()) if i > 1]\\nprint((sum(out)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['- if str(i) in list(num.keys()):',\n", + " '- num[str(i)] += 1',\n", + " '- else:',\n", + " '- num[str(i)] = 1',\n", + " '+ s = str(i)',\n", + " '+ num[s] = 1 if s not in list(num.keys()) else num[s] + 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4443410683,\n", + " 'measured_runtime_v1': 0.2339228122,\n", + " 'runtime_lift': 1.8995200341,\n", + " 'key': ['s203042500', 's990747122']},\n", + " {'user_id': 'u260216890',\n", + " 'problem_id': 'p02883',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's662154758',\n", + " 'submission_id_v1': 's660978012',\n", + " 'cpu_time_v0': 569,\n", + " 'cpu_time_v1': 344,\n", + " 'memory_v0': 43644,\n", + " 'memory_v1': 122364,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.54,\n", + " 'input': 'import numpy as np\\n\\nN, K= list(map(int, input().split()))\\n\\nA=[int(i) for i in input().split()]\\n\\nF=[int(i) for i in input().split()]\\n\\n\\n\\nA=np.array(sorted(A, reverse=True))\\n\\nF=np.array(sorted(F))\\n\\n\\n\\nlower_bound=0\\n\\nupper_bound=np.max(A*F)\\n\\nK_tmp=0\\n\\n\\n\\nwhile upper_bound>=lower_bound:\\n\\n mid=(lower_bound+upper_bound)//2\\n\\n K_tmp=np.sum(np.maximum(A-mid//F, 0))\\n\\n if K_tmp<=K:\\n\\n upper_bound=mid-1\\n\\n else:\\n\\n lower_bound=mid+1\\n\\n\\n\\nprint(lower_bound)',\n", + " 'target': 'n,k=list(map(int,input().split()))\\n\\n*a,= list(map(int,input().split()))\\n\\n*f,= list(map(int,input().split()))\\n\\na=sorted(a)\\n\\nf=sorted(f, reverse=True)\\n\\n\\n\\ndef is_ok(arg):\\n\\n cnt=0\\n\\n for i in range(n):\\n\\n cnt+=max(a[i]-arg//f[i], 0)\\n\\n return cnt<=k\\n\\n\\n\\ndef meguru_bisect(ng, ok):\\n\\n while (abs(ok - ng) > 1):\\n\\n mid = (ok + ng) // 2\\n\\n if is_ok(mid):\\n\\n ok = mid\\n\\n else:\\n\\n ng = mid\\n\\n return ok\\n\\n\\n\\nprint((meguru_bisect(-1, 10**12)))',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 459,\n", + " 'code_v1_num_chars': 465,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\nA = [int(i) for i in input().split()]\\nF = [int(i) for i in input().split()]\\nA = np.array(sorted(A, reverse=True))\\nF = np.array(sorted(F))\\nlower_bound = 0\\nupper_bound = np.max(A * F)\\nK_tmp = 0\\nwhile upper_bound >= lower_bound:\\n mid = (lower_bound + upper_bound) // 2\\n K_tmp = np.sum(np.maximum(A - mid // F, 0))\\n if K_tmp <= K:\\n upper_bound = mid - 1\\n else:\\n lower_bound = mid + 1\\nprint(lower_bound)\\n',\n", + " 'code_v1_no_empty_lines': 'n, k = list(map(int, input().split()))\\n(*a,) = list(map(int, input().split()))\\n(*f,) = list(map(int, input().split()))\\na = sorted(a)\\nf = sorted(f, reverse=True)\\n\\n\\ndef is_ok(arg):\\n cnt = 0\\n for i in range(n):\\n cnt += max(a[i] - arg // f[i], 0)\\n return cnt <= k\\n\\n\\ndef meguru_bisect(ng, ok):\\n while abs(ok - ng) > 1:\\n mid = (ok + ng) // 2\\n if is_ok(mid):\\n ok = mid\\n else:\\n ng = mid\\n return ok\\n\\n\\nprint((meguru_bisect(-1, 10**12)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['-import numpy as np',\n", + " '+n, k = list(map(int, input().split()))',\n", + " '+(*a,) = list(map(int, input().split()))',\n", + " '+(*f,) = list(map(int, input().split()))',\n", + " '+a = sorted(a)',\n", + " '+f = sorted(f, reverse=True)',\n", + " '-N, K = list(map(int, input().split()))',\n", + " '-A = [int(i) for i in input().split()]',\n", + " '-F = [int(i) for i in input().split()]',\n", + " '-A = np.array(sorted(A, reverse=True))',\n", + " '-F = np.array(sorted(F))',\n", + " '-lower_bound = 0',\n", + " '-upper_bound = np.max(A * F)',\n", + " '-K_tmp = 0',\n", + " '-while upper_bound >= lower_bound:',\n", + " '- mid = (lower_bound + upper_bound) // 2',\n", + " '- K_tmp = np.sum(np.maximum(A - mid // F, 0))',\n", + " '- if K_tmp <= K:',\n", + " '- upper_bound = mid - 1',\n", + " '- else:',\n", + " '- lower_bound = mid + 1',\n", + " '-print(lower_bound)',\n", + " '+',\n", + " '+def is_ok(arg):',\n", + " '+ cnt = 0',\n", + " '+ for i in range(n):',\n", + " '+ cnt += max(a[i] - arg // f[i], 0)',\n", + " '+ return cnt <= k',\n", + " '+',\n", + " '+',\n", + " '+def meguru_bisect(ng, ok):',\n", + " '+ while abs(ok - ng) > 1:',\n", + " '+ mid = (ok + ng) // 2',\n", + " '+ if is_ok(mid):',\n", + " '+ ok = mid',\n", + " '+ else:',\n", + " '+ ng = mid',\n", + " '+ return ok',\n", + " '+',\n", + " '+',\n", + " '+print((meguru_bisect(-1, 10**12)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.029960073,\n", + " 'measured_runtime_v1': 0.3428780406,\n", + " 'runtime_lift': 5.9203560242,\n", + " 'key': ['s662154758', 's660978012']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p03060',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's117395180',\n", + " 'submission_id_v1': 's327543146',\n", + " 'cpu_time_v0': 265,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 17848,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 93.21,\n", + " 'input': '# coding: utf-8\\n\\nimport sys\\n\\nimport numpy as np\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN = ir()\\n\\nV = np.array(lr())\\n\\nC = np.array(lr())\\n\\nV -= C\\n\\nV = V[V>0]\\n\\nanswer = V.sum()\\n\\nprint(answer)\\n',\n", + " 'target': '# coding: utf-8\\n\\nimport sys\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN = ir()\\n\\nV = lr()\\n\\nC = lr()\\n\\ntotal = 0\\n\\nfor i in range(N):\\n\\n result = V[i] - C[i]\\n\\n if result > 0:\\n\\n total += result\\n\\n\\n\\nprint(total)\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 266,\n", + " 'code_v1_num_chars': 291,\n", + " 'code_v0_no_empty_lines': '# coding: utf-8\\nimport sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN = ir()\\nV = np.array(lr())\\nC = np.array(lr())\\nV -= C\\nV = V[V > 0]\\nanswer = V.sum()\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nimport sys\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN = ir()\\nV = lr()\\nC = lr()\\ntotal = 0\\nfor i in range(N):\\n result = V[i] - C[i]\\n if result > 0:\\n total += result\\nprint(total)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.7647058824,\n", + " 'diff': ['-import numpy as np',\n", + " '-V = np.array(lr())',\n", + " '-C = np.array(lr())',\n", + " '-V -= C',\n", + " '-V = V[V > 0]',\n", + " '-answer = V.sum()',\n", + " '-print(answer)',\n", + " '+V = lr()',\n", + " '+C = lr()',\n", + " '+total = 0',\n", + " '+for i in range(N):',\n", + " '+ result = V[i] - C[i]',\n", + " '+ if result > 0:',\n", + " '+ total += result',\n", + " '+print(total)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.1957234194,\n", + " 'measured_runtime_v1': 0.2010130272,\n", + " 'runtime_lift': 5.9484872004,\n", + " 'key': ['s117395180', 's327543146']},\n", + " {'user_id': 'u433181015',\n", + " 'problem_id': 'p02394',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's560769298',\n", + " 'submission_id_v1': 's595626547',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 7680,\n", + " 'memory_v1': 7728,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.33,\n", + " 'input': \"a=input().split()\\n\\nb=list(map(int,a))\\n\\nW=b[0]\\n\\nH=b[1]\\n\\nx=b[2]\\n\\ny=b[3]\\n\\nr=b[4]\\n\\nif (r <= x <= (W - r)) and (r <= y <= (H - r)):\\n\\n print('Yes')\\n\\nelse:\\n\\n print('No')\",\n", + " 'target': \"W,H,x,y,r = [int(i) for i in input().split()]\\n\\nif (r <= x <= (W - r)) and (r <= y <= (H - r)):\\n\\n print('Yes')\\n\\nelse:\\n\\n print('No')\",\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 164,\n", + " 'code_v1_num_chars': 132,\n", + " 'code_v0_no_empty_lines': 'a = input().split()\\nb = list(map(int, a))\\nW = b[0]\\nH = b[1]\\nx = b[2]\\ny = b[3]\\nr = b[4]\\nif (r <= x <= (W - r)) and (r <= y <= (H - r)):\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 'W, H, x, y, r = [int(i) for i in input().split()]\\nif (r <= x <= (W - r)) and (r <= y <= (H - r)):\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 54.5454545455,\n", + " 'diff': ['-a = input().split()',\n", + " '-b = list(map(int, a))',\n", + " '-W = b[0]',\n", + " '-H = b[1]',\n", + " '-x = b[2]',\n", + " '-y = b[3]',\n", + " '-r = b[4]',\n", + " '+W, H, x, y, r = [int(i) for i in input().split()]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3832537071,\n", + " 'measured_runtime_v1': 0.2996923448,\n", + " 'runtime_lift': 1.2788238128,\n", + " 'key': ['s560769298', 's595626547']},\n", + " {'user_id': 'u827202523',\n", + " 'problem_id': 'p03988',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's661300903',\n", + " 'submission_id_v1': 's790648502',\n", + " 'cpu_time_v0': 180,\n", + " 'cpu_time_v1': 75,\n", + " 'memory_v0': 38384,\n", + " 'memory_v1': 69368,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 58.33,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(1000000)\\n\\nfrom collections import deque\\n\\ndef getN():\\n\\n return int(eval(input()))\\n\\ndef getList():\\n\\n return list(map(int, input().split()))\\n\\nimport math\\n\\n\\n\\nn = getN()\\n\\nnums = getList()\\n\\n\\n\\n# nums.sort(reverse=True)\\n\\nmx = max(nums)\\n\\nmn = (mx+1) // 2\\n\\nmndx = (mx % 2) + 1\\n\\n\\n\\nfrom collections import Counter\\n\\n\\n\\ncnt = Counter(nums)\\n\\n\\n\\nfor i in range(mn+1, mx+1):\\n\\n if cnt[i] < 2:\\n\\n print(\"Impossible\")\\n\\n sys.exit()\\n\\n\\n\\nif cnt[mn] != mndx:\\n\\n print(\"Impossible\")\\n\\nelse:\\n\\n print(\"Possible\")',\n", + " 'target': 'import sys\\n\\nimport math\\n\\nimport copy\\n\\nfrom heapq import heappush, heappop, heapify\\n\\nfrom functools import cmp_to_key\\n\\nfrom bisect import bisect_left, bisect_right\\n\\nfrom collections import defaultdict, deque, Counter\\n\\n# sys.setrecursionlimit(1000000)\\n\\n\\n\\n# input aliases\\n\\ninput = sys.stdin.readline\\n\\ngetS = lambda: input().strip()\\n\\ngetN = lambda: int(eval(input()))\\n\\ngetList = lambda: list(map(int, input().split()))\\n\\ngetZList = lambda: [int(x) - 1 for x in input().split()]\\n\\n\\n\\nINF = float(\"inf\")\\n\\nMOD = 10**9 + 7\\n\\ndivide = lambda x: pow(x, MOD-2, MOD)\\n\\n\\n\\ndef pim():\\n\\n print(\"Impossible\")\\n\\n sys.exit()\\n\\ndef pp():\\n\\n print(\"Possible\")\\n\\n sys.exit()\\n\\ndef solve():\\n\\n n = getN()\\n\\n nums = getList()\\n\\n cnt = Counter(nums)\\n\\n mx = max(nums)\\n\\n mn = min(nums)\\n\\n\\n\\n if cnt[mx] < 2:\\n\\n pim()\\n\\n if mn < (mx + 1) // 2:\\n\\n pim()\\n\\n\\n\\n if mx % 2 == 0:\\n\\n if cnt[mx//2] != 1:\\n\\n pim()\\n\\n else:\\n\\n if cnt[(mx+1) // 2] != 2:\\n\\n pim()\\n\\n\\n\\n for i in range((mx + 1) // 2 + 1, mx+1):\\n\\n if cnt[i] < 2:\\n\\n pim()\\n\\n\\n\\n pp()\\n\\n\\n\\n\\n\\ndef main():\\n\\n n = getN()\\n\\n for _ in range(n):\\n\\n solve()\\n\\n\\n\\n return\\n\\nif __name__ == \"__main__\":\\n\\n # main()\\n\\n solve()\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n',\n", + " 'code_v0_loc': 31,\n", + " 'code_v1_loc': 66,\n", + " 'code_v0_num_chars': 564,\n", + " 'code_v1_num_chars': 1240,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(1000000)\\nfrom collections import deque\\n\\n\\ndef getN():\\n return int(eval(input()))\\n\\n\\ndef getList():\\n return list(map(int, input().split()))\\n\\n\\nimport math\\n\\nn = getN()\\nnums = getList()\\n# nums.sort(reverse=True)\\nmx = max(nums)\\nmn = (mx + 1) // 2\\nmndx = (mx % 2) + 1\\nfrom collections import Counter\\n\\ncnt = Counter(nums)\\nfor i in range(mn + 1, mx + 1):\\n if cnt[i] < 2:\\n print(\"Impossible\")\\n sys.exit()\\nif cnt[mn] != mndx:\\n print(\"Impossible\")\\nelse:\\n print(\"Possible\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport math\\nimport copy\\nfrom heapq import heappush, heappop, heapify\\nfrom functools import cmp_to_key\\nfrom bisect import bisect_left, bisect_right\\nfrom collections import defaultdict, deque, Counter\\n\\n# sys.setrecursionlimit(1000000)\\n# input aliases\\ninput = sys.stdin.readline\\ngetS = lambda: input().strip()\\ngetN = lambda: int(eval(input()))\\ngetList = lambda: list(map(int, input().split()))\\ngetZList = lambda: [int(x) - 1 for x in input().split()]\\nINF = float(\"inf\")\\nMOD = 10**9 + 7\\ndivide = lambda x: pow(x, MOD - 2, MOD)\\n\\n\\ndef pim():\\n print(\"Impossible\")\\n sys.exit()\\n\\n\\ndef pp():\\n print(\"Possible\")\\n sys.exit()\\n\\n\\ndef solve():\\n n = getN()\\n nums = getList()\\n cnt = Counter(nums)\\n mx = max(nums)\\n mn = min(nums)\\n if cnt[mx] < 2:\\n pim()\\n if mn < (mx + 1) // 2:\\n pim()\\n if mx % 2 == 0:\\n if cnt[mx // 2] != 1:\\n pim()\\n else:\\n if cnt[(mx + 1) // 2] != 2:\\n pim()\\n for i in range((mx + 1) // 2 + 1, mx + 1):\\n if cnt[i] < 2:\\n pim()\\n pp()\\n\\n\\ndef main():\\n n = getN()\\n for _ in range(n):\\n solve()\\n return\\n\\n\\nif __name__ == \"__main__\":\\n # main()\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 53.0303030303,\n", + " 'diff': ['+import math',\n", + " '+import copy',\n", + " '+from heapq import heappush, heappop, heapify',\n", + " '+from functools import cmp_to_key',\n", + " '+from bisect import bisect_left, bisect_right',\n", + " '+from collections import defaultdict, deque, Counter',\n", + " '+# sys.setrecursionlimit(1000000)',\n", + " '+# input aliases',\n", + " '-sys.setrecursionlimit(1000000)',\n", + " '-from collections import deque',\n", + " '+getS = lambda: input().strip()',\n", + " '+getN = lambda: int(eval(input()))',\n", + " '+getList = lambda: list(map(int, input().split()))',\n", + " '+getZList = lambda: [int(x) - 1 for x in input().split()]',\n", + " '+INF = float(\"inf\")',\n", + " '+MOD = 10**9 + 7',\n", + " '+divide = lambda x: pow(x, MOD - 2, MOD)',\n", + " '-def getN():',\n", + " '- return int(eval(input()))',\n", + " '+def pim():',\n", + " '+ print(\"Impossible\")',\n", + " '+ sys.exit()',\n", + " '-def getList():',\n", + " '- return list(map(int, input().split()))',\n", + " '+def pp():',\n", + " '+ print(\"Possible\")',\n", + " '+ sys.exit()',\n", + " '-import math',\n", + " '+def solve():',\n", + " '+ n = getN()',\n", + " '+ nums = getList()',\n", + " '+ cnt = Counter(nums)',\n", + " '+ mx = max(nums)',\n", + " '+ mn = min(nums)',\n", + " '+ if cnt[mx] < 2:',\n", + " '+ pim()',\n", + " '+ if mn < (mx + 1) // 2:',\n", + " '+ pim()',\n", + " '+ if mx % 2 == 0:',\n", + " '+ if cnt[mx // 2] != 1:',\n", + " '+ pim()',\n", + " '+ else:',\n", + " '+ if cnt[(mx + 1) // 2] != 2:',\n", + " '+ pim()',\n", + " '+ for i in range((mx + 1) // 2 + 1, mx + 1):',\n", + " '+ if cnt[i] < 2:',\n", + " '+ pim()',\n", + " '+ pp()',\n", + " '-n = getN()',\n", + " '-nums = getList()',\n", + " '-# nums.sort(reverse=True)',\n", + " '-mx = max(nums)',\n", + " '-mn = (mx + 1) // 2',\n", + " '-mndx = (mx % 2) + 1',\n", + " '-from collections import Counter',\n", + " '-cnt = Counter(nums)',\n", + " '-for i in range(mn + 1, mx + 1):',\n", + " '- if cnt[i] < 2:',\n", + " '- print(\"Impossible\")',\n", + " '- sys.exit()',\n", + " '-if cnt[mn] != mndx:',\n", + " '- print(\"Impossible\")',\n", + " '-else:',\n", + " '- print(\"Possible\")',\n", + " '+def main():',\n", + " '+ n = getN()',\n", + " '+ for _ in range(n):',\n", + " '+ solve()',\n", + " '+ return',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ # main()',\n", + " '+ solve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.200920903,\n", + " 'measured_runtime_v1': 0.0064778831,\n", + " 'runtime_lift': 31.0164448269,\n", + " 'key': ['s661300903', 's790648502']},\n", + " {'user_id': 'u499259667',\n", + " 'problem_id': 'p03844',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's838870777',\n", + " 'submission_id_v1': 's858116598',\n", + " 'cpu_time_v0': 12,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 2572,\n", + " 'memory_v1': 2572,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.67,\n", + " 'input': 'print((eval(input())))',\n", + " 'target': 'print(eval(input()))',\n", + " 'code_v0_loc': 1,\n", + " 'code_v1_loc': 1,\n", + " 'code_v0_num_chars': 14,\n", + " 'code_v1_num_chars': 13,\n", + " 'code_v0_no_empty_lines': 'print((eval(input())))\\n',\n", + " 'code_v1_no_empty_lines': 'print(eval(input()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-print((eval(input())))', '+print(eval(input()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3375790837,\n", + " 'measured_runtime_v1': 0.2112844212,\n", + " 'runtime_lift': 1.5977471587,\n", + " 'key': ['s838870777', 's858116598']},\n", + " {'user_id': 'u842747358',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's407352029',\n", + " 'submission_id_v1': 's941706304',\n", + " 'cpu_time_v0': 381,\n", + " 'cpu_time_v1': 79,\n", + " 'memory_v0': 55248,\n", + " 'memory_v1': 21068,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.27,\n", + " 'input': 'import numpy as np\\n\\nfrom copy import deepcopy\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = []\\n\\nA.append(list(map(int, input().split())))\\n\\na = deepcopy(A[0])\\n\\na.sort()\\n\\nA.append(a)\\n\\nA_t = np.array(A).T.tolist()\\n\\nA_t.sort()\\n\\n\\n\\nout = []\\n\\nfor i in range(N):\\n\\n out.append(str(A_t[i][1]))\\n\\nprint((\" \".join(out)))\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nrev = [\"\"] * N\\n\\nfor i in range(N):\\n\\n rev[A[i]-1] = str(i+1)\\n\\nprint((\" \".join(rev)))\\n',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 288,\n", + " 'code_v1_num_chars': 142,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nfrom copy import deepcopy\\n\\nN = int(eval(input()))\\nA = []\\nA.append(list(map(int, input().split())))\\na = deepcopy(A[0])\\na.sort()\\nA.append(a)\\nA_t = np.array(A).T.tolist()\\nA_t.sort()\\nout = []\\nfor i in range(N):\\n out.append(str(A_t[i][1]))\\nprint((\" \".join(out)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nrev = [\"\"] * N\\nfor i in range(N):\\n rev[A[i] - 1] = str(i + 1)\\nprint((\" \".join(rev)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 56.25,\n", + " 'diff': ['-import numpy as np',\n", + " '-from copy import deepcopy',\n", + " '-',\n", + " '-A = []',\n", + " '-A.append(list(map(int, input().split())))',\n", + " '-a = deepcopy(A[0])',\n", + " '-a.sort()',\n", + " '-A.append(a)',\n", + " '-A_t = np.array(A).T.tolist()',\n", + " '-A_t.sort()',\n", + " '-out = []',\n", + " '+A = list(map(int, input().split()))',\n", + " '+rev = [\"\"] * N',\n", + " '- out.append(str(A_t[i][1]))',\n", + " '-print((\" \".join(out)))',\n", + " '+ rev[A[i] - 1] = str(i + 1)',\n", + " '+print((\" \".join(rev)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3604369454,\n", + " 'measured_runtime_v1': 0.1764305278,\n", + " 'runtime_lift': 7.7108931321,\n", + " 'key': ['s407352029', 's941706304']},\n", + " {'user_id': 'u653837719',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's121665958',\n", + " 'submission_id_v1': 's794197403',\n", + " 'cpu_time_v0': 113,\n", + " 'cpu_time_v1': 101,\n", + " 'memory_v0': 9288,\n", + " 'memory_v1': 9236,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.62,\n", + " 'input': 's = input()[::-1]\\n\\nl = len(s)\\n\\nc = [0] * 2019\\n\\nc[0] = 1\\n\\nten = 1\\n\\nmod = 0\\n\\nans = 0\\n\\n\\n\\nfor i in range(l):\\n\\n mod = (mod + int(s[i]) * ten) % 2019\\n\\n ten = ten * 10 % 2019\\n\\n c[mod] += 1\\n\\n\\n\\nfor i in c:\\n\\n ans += i * (i - 1) // 2\\n\\n\\n\\nprint(ans)',\n", + " 'target': 's = input()[::-1]\\n\\nc = [0] * 2019\\n\\nc[0] = 1\\n\\nmod = 0\\n\\nten = 1\\n\\nans = 0\\n\\n\\n\\nfor i in s:\\n\\n mod = (mod + int(i) * ten) % 2019\\n\\n ten = ten * 10 % 2019\\n\\n c[mod] += 1\\n\\n\\n\\nfor i in c:\\n\\n ans += i * (i - 1) // 2\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 248,\n", + " 'code_v1_num_chars': 226,\n", + " 'code_v0_no_empty_lines': 's = input()[::-1]\\nl = len(s)\\nc = [0] * 2019\\nc[0] = 1\\nten = 1\\nmod = 0\\nans = 0\\nfor i in range(l):\\n mod = (mod + int(s[i]) * ten) % 2019\\n ten = ten * 10 % 2019\\n c[mod] += 1\\nfor i in c:\\n ans += i * (i - 1) // 2\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 's = input()[::-1]\\nc = [0] * 2019\\nc[0] = 1\\nmod = 0\\nten = 1\\nans = 0\\nfor i in s:\\n mod = (mod + int(i) * ten) % 2019\\n ten = ten * 10 % 2019\\n c[mod] += 1\\nfor i in c:\\n ans += i * (i - 1) // 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.8823529412,\n", + " 'diff': ['-l = len(s)',\n", + " '+mod = 0',\n", + " '-mod = 0',\n", + " '-for i in range(l):',\n", + " '- mod = (mod + int(s[i]) * ten) % 2019',\n", + " '+for i in s:',\n", + " '+ mod = (mod + int(i) * ten) % 2019'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2661841769,\n", + " 'measured_runtime_v1': 0.1600983288,\n", + " 'runtime_lift': 1.6626293282,\n", + " 'key': ['s121665958', 's794197403']},\n", + " {'user_id': 'u599114793',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's483518668',\n", + " 'submission_id_v1': 's544930407',\n", + " 'cpu_time_v0': 317,\n", + " 'cpu_time_v1': 185,\n", + " 'memory_v0': 20624,\n", + " 'memory_v1': 39152,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 41.64,\n", + " 'input': 'import numpy\\n\\nh,w = list(map(int,input().split()))\\n\\ngrid = numpy.empty([h,w], str)\\n\\nwhite_h = []\\n\\nwhite_w = []\\n\\nfor i in range(h):\\n\\n grid[i] = list(eval(input()))\\n\\nfor i in range(h):\\n\\n if \"#\" not in grid[i]:\\n\\n white_h.append(i)\\n\\nfor i in range(w):\\n\\n if \"#\" not in grid[:, i]:\\n\\n white_w.append(i)\\n\\nans_grid = numpy.empty([h-len(white_h), w-len(white_w)], str)\\n\\ncnt_h = 0\\n\\nfor i in range(h):\\n\\n if i not in white_h:\\n\\n cnt_w = 0\\n\\n for j in range(w):\\n\\n if j not in white_w:\\n\\n ans_grid[cnt_h, cnt_w] = grid[i,j]\\n\\n cnt_w += 1\\n\\n cnt_h += 1\\n\\nfor i in range(len(ans_grid)):\\n\\n print((\"\".join(ans_grid[i])))\\n\\n\\n\\n\\n\\n\\n',\n", + " 'target': 'h,w = list(map(int,input().split()))\\n\\ngrid = []\\n\\nfor i in range(h):\\n\\n grid.append(list(eval(input())))\\n\\nh_b = []\\n\\nw_b = []\\n\\nfor i in range(h):\\n\\n if \"#\" in grid[i]:\\n\\n h_b.append(i)\\n\\ngrid_t = [list(x) for x in zip(*grid)]\\n\\nfor i in range(w):\\n\\n if \"#\" in grid_t[i]:\\n\\n w_b.append(i)\\n\\nans = []\\n\\nfor i in h_b:\\n\\n crt = []\\n\\n for j in w_b:\\n\\n crt.append(grid[i][j])\\n\\n ans.append(crt)\\n\\nfor i in range(len(ans)):\\n\\n print((\"\".join(ans[i])))\\n\\n\\n',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 679,\n", + " 'code_v1_num_chars': 458,\n", + " 'code_v0_no_empty_lines': 'import numpy\\n\\nh, w = list(map(int, input().split()))\\ngrid = numpy.empty([h, w], str)\\nwhite_h = []\\nwhite_w = []\\nfor i in range(h):\\n grid[i] = list(eval(input()))\\nfor i in range(h):\\n if \"#\" not in grid[i]:\\n white_h.append(i)\\nfor i in range(w):\\n if \"#\" not in grid[:, i]:\\n white_w.append(i)\\nans_grid = numpy.empty([h - len(white_h), w - len(white_w)], str)\\ncnt_h = 0\\nfor i in range(h):\\n if i not in white_h:\\n cnt_w = 0\\n for j in range(w):\\n if j not in white_w:\\n ans_grid[cnt_h, cnt_w] = grid[i, j]\\n cnt_w += 1\\n cnt_h += 1\\nfor i in range(len(ans_grid)):\\n print((\"\".join(ans_grid[i])))\\n',\n", + " 'code_v1_no_empty_lines': 'h, w = list(map(int, input().split()))\\ngrid = []\\nfor i in range(h):\\n grid.append(list(eval(input())))\\nh_b = []\\nw_b = []\\nfor i in range(h):\\n if \"#\" in grid[i]:\\n h_b.append(i)\\ngrid_t = [list(x) for x in zip(*grid)]\\nfor i in range(w):\\n if \"#\" in grid_t[i]:\\n w_b.append(i)\\nans = []\\nfor i in h_b:\\n crt = []\\n for j in w_b:\\n crt.append(grid[i][j])\\n ans.append(crt)\\nfor i in range(len(ans)):\\n print((\"\".join(ans[i])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['-import numpy',\n", + " '-',\n", + " '-grid = numpy.empty([h, w], str)',\n", + " '-white_h = []',\n", + " '-white_w = []',\n", + " '+grid = []',\n", + " '- grid[i] = list(eval(input()))',\n", + " '+ grid.append(list(eval(input())))',\n", + " '+h_b = []',\n", + " '+w_b = []',\n", + " '- if \"#\" not in grid[i]:',\n", + " '- white_h.append(i)',\n", + " '+ if \"#\" in grid[i]:',\n", + " '+ h_b.append(i)',\n", + " '+grid_t = [list(x) for x in zip(*grid)]',\n", + " '- if \"#\" not in grid[:, i]:',\n", + " '- white_w.append(i)',\n", + " '-ans_grid = numpy.empty([h - len(white_h), w - len(white_w)], str)',\n", + " '-cnt_h = 0',\n", + " '-for i in range(h):',\n", + " '- if i not in white_h:',\n", + " '- cnt_w = 0',\n", + " '- for j in range(w):',\n", + " '- if j not in white_w:',\n", + " '- ans_grid[cnt_h, cnt_w] = grid[i, j]',\n", + " '- cnt_w += 1',\n", + " '- cnt_h += 1',\n", + " '-for i in range(len(ans_grid)):',\n", + " '- print((\"\".join(ans_grid[i])))',\n", + " '+ if \"#\" in grid_t[i]:',\n", + " '+ w_b.append(i)',\n", + " '+ans = []',\n", + " '+for i in h_b:',\n", + " '+ crt = []',\n", + " '+ for j in w_b:',\n", + " '+ crt.append(grid[i][j])',\n", + " '+ ans.append(crt)',\n", + " '+for i in range(len(ans)):',\n", + " '+ print((\"\".join(ans[i])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7529192381,\n", + " 'measured_runtime_v1': 0.3749449561,\n", + " 'runtime_lift': 4.675137536,\n", + " 'key': ['s483518668', 's544930407']},\n", + " {'user_id': 'u297574184',\n", + " 'problem_id': 'p02901',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's249297018',\n", + " 'submission_id_v1': 's597922218',\n", + " 'cpu_time_v0': 1727,\n", + " 'cpu_time_v1': 694,\n", + " 'memory_v0': 3440,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.81,\n", + " 'input': \"INF = 10**10\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\ncosts = []\\n\\nkeys = []\\n\\nfor _ in range(M):\\n\\n A, B = list(map(int, input().split()))\\n\\n cs = list(map(int, input().split()))\\n\\n costs.append(A)\\n\\n # 鍵を2進数化する\\n\\n key = 0\\n\\n for c in cs:\\n\\n key |= 1<<(c-1)\\n\\n keys.append(key)\\n\\n\\n\\n# [1]の個数で分類する\\n\\nmaskss = [[] for _ in range(N+1)]\\n\\nnum1s = [0] * (2**N)\\n\\nfor S in range(2**N):\\n\\n num = bin(S).count('1')\\n\\n maskss[num].append(S)\\n\\n num1s[S] = num\\n\\n\\n\\ndpAll = [INF] * (2**N)\\n\\nfor S in range(2**N):\\n\\n for cost, key in zip(costs, keys):\\n\\n if S & key == S:\\n\\n if cost < dpAll[S]:\\n\\n dpAll[S] = cost\\n\\n\\n\\ndp = [INF] * (2**N)\\n\\nfor S in range(2**N):\\n\\n cost = dpAll[S]\\n\\n num1 = num1s[S]\\n\\n for k in range(1, (num1+1)//2+1):\\n\\n for mask in maskss[k]:\\n\\n if mask & S == mask:\\n\\n m2 = S^mask\\n\\n c2 = dp[mask] + dp[m2]\\n\\n if c2 < cost:\\n\\n cost = c2\\n\\n dp[S] = cost\\n\\n\\n\\nif dp[2**N-1] == INF:\\n\\n print((-1))\\n\\nelse:\\n\\n print((dp[2**N-1]))\\n\",\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef solve():\\n\\n INF = 10**10\\n\\n\\n\\n N, M = list(map(int, input().split()))\\n\\n keys = []\\n\\n costs = []\\n\\n for _ in range(M):\\n\\n a, b = list(map(int, input().split()))\\n\\n costs.append(a)\\n\\n cs = list(map(int, input().split()))\\n\\n key = 0\\n\\n for c in cs:\\n\\n key |= 1<<(c-1)\\n\\n keys.append(key)\\n\\n\\n\\n dp = [INF] * (1< k:\\n\\n break\\n\\n for l, _c in enumerate(c):\\n\\n if (i+1) * (j+1) * (l+1) > k:\\n\\n break\\n\\n abc.append(_a + _b + _c)\\n\\n\\n\\nabc.sort(reverse=True)\\n\\nfor x in abc[:k]:\\n\\n print(x)\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\nimport heapq\\n\\n\\n\\nx, y, z, k = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nb = list(map(int, input().split()))\\n\\nc = list(map(int, input().split()))\\n\\n\\n\\nla, lb, lc = len(a), len(b), len(c)\\n\\n\\n\\na.sort(reverse=True)\\n\\nb.sort(reverse=True)\\n\\nc.sort(reverse=True)\\n\\n\\n\\nfix = set()\\n\\n\\n\\nq = [(-(a[0]+b[0]+c[0]), 0, 0, 0)]\\n\\n\\n\\nfor _ in range(k):\\n\\n abc, i, j, l = heapq.heappop(q)\\n\\n print((-abc))\\n\\n\\n\\n if i+1 < la and (i+1, j, l) not in fix:\\n\\n heapq.heappush(q, (-(a[i+1]+b[j]+c[l]), i+1, j, l))\\n\\n fix.add((i+1, j, l))\\n\\n\\n\\n if j+1 < lb and (i, j+1, l) not in fix:\\n\\n heapq.heappush(q, (-(a[i]+b[j+1]+c[l]), i, j+1, l))\\n\\n fix.add((i, j+1, l))\\n\\n\\n\\n if l+1 < lc and (i, j, l+1) not in fix:\\n\\n heapq.heappush(q, (-(a[i]+b[j]+c[l+1]), i, j, l+1))\\n\\n fix.add((i, j, l+1))\\n',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 566,\n", + " 'code_v1_num_chars': 841,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nx, y, z, k = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nc = list(map(int, input().split()))\\na.sort(reverse=True)\\nb.sort(reverse=True)\\nc.sort(reverse=True)\\nabc = []\\nfor i, _a in enumerate(a):\\n for j, _b in enumerate(b):\\n if (i + 1) * (j + 1) > k:\\n break\\n for l, _c in enumerate(c):\\n if (i + 1) * (j + 1) * (l + 1) > k:\\n break\\n abc.append(_a + _b + _c)\\nabc.sort(reverse=True)\\nfor x in abc[:k]:\\n print(x)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport heapq\\n\\nx, y, z, k = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nc = list(map(int, input().split()))\\nla, lb, lc = len(a), len(b), len(c)\\na.sort(reverse=True)\\nb.sort(reverse=True)\\nc.sort(reverse=True)\\nfix = set()\\nq = [(-(a[0] + b[0] + c[0]), 0, 0, 0)]\\nfor _ in range(k):\\n abc, i, j, l = heapq.heappop(q)\\n print((-abc))\\n if i + 1 < la and (i + 1, j, l) not in fix:\\n heapq.heappush(q, (-(a[i + 1] + b[j] + c[l]), i + 1, j, l))\\n fix.add((i + 1, j, l))\\n if j + 1 < lb and (i, j + 1, l) not in fix:\\n heapq.heappush(q, (-(a[i] + b[j + 1] + c[l]), i, j + 1, l))\\n fix.add((i, j + 1, l))\\n if l + 1 < lc and (i, j, l + 1) not in fix:\\n heapq.heappush(q, (-(a[i] + b[j] + c[l + 1]), i, j, l + 1))\\n fix.add((i, j, l + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.2727272727,\n", + " 'diff': ['+import heapq',\n", + " '+',\n", + " '+la, lb, lc = len(a), len(b), len(c)',\n", + " '-abc = []',\n", + " '-for i, _a in enumerate(a):',\n", + " '- for j, _b in enumerate(b):',\n", + " '- if (i + 1) * (j + 1) > k:',\n", + " '- break',\n", + " '- for l, _c in enumerate(c):',\n", + " '- if (i + 1) * (j + 1) * (l + 1) > k:',\n", + " '- break',\n", + " '- abc.append(_a + _b + _c)',\n", + " '-abc.sort(reverse=True)',\n", + " '-for x in abc[:k]:',\n", + " '- print(x)',\n", + " '+fix = set()',\n", + " '+q = [(-(a[0] + b[0] + c[0]), 0, 0, 0)]',\n", + " '+for _ in range(k):',\n", + " '+ abc, i, j, l = heapq.heappop(q)',\n", + " '+ print((-abc))',\n", + " '+ if i + 1 < la and (i + 1, j, l) not in fix:',\n", + " '+ heapq.heappush(q, (-(a[i + 1] + b[j] + c[l]), i + 1, j, l))',\n", + " '+ fix.add((i + 1, j, l))',\n", + " '+ if j + 1 < lb and (i, j + 1, l) not in fix:',\n", + " '+ heapq.heappush(q, (-(a[i] + b[j + 1] + c[l]), i, j + 1, l))',\n", + " '+ fix.add((i, j + 1, l))',\n", + " '+ if l + 1 < lc and (i, j, l + 1) not in fix:',\n", + " '+ heapq.heappush(q, (-(a[i] + b[j] + c[l + 1]), i, j, l + 1))',\n", + " '+ fix.add((i, j, l + 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4343315315,\n", + " 'measured_runtime_v1': 0.2096420834,\n", + " 'runtime_lift': 2.0717764508,\n", + " 'key': ['s581139547', 's213757381']},\n", + " {'user_id': 'u761529120',\n", + " 'problem_id': 'p03164',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's478711084',\n", + " 'submission_id_v1': 's154638745',\n", + " 'cpu_time_v0': 1151,\n", + " 'cpu_time_v1': 682,\n", + " 'memory_v0': 312192,\n", + " 'memory_v1': 334552,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.75,\n", + " 'input': 'def main():\\n\\n N, W = list(map(int, input().split()))\\n\\n w = [0] * N\\n\\n v = [0] * N\\n\\n for i in range(N):\\n\\n w[i], v[i] = list(map(int, input().split()))\\n\\n\\n\\n max_v = max(v)\\n\\n dp = [[float(\\'inf\\')] * (max_v * N + 5) for _ in range(N + 5)]\\n\\n\\n\\n dp[0][0] = 0\\n\\n\\n\\n for i in range(N):\\n\\n for j in range(max_v * N):\\n\\n if j + v[i] <= max_v * N:\\n\\n dp[i+1][j + v[i]] = min(dp[i+1][j + v[i]], dp[i][j] + w[i])\\n\\n dp[i+1][j] = min(dp[i+1][j], dp[i][j]) \\n\\n\\n\\n ans = 0\\n\\n for j in range(max_v * N + 1):\\n\\n if dp[N][j] <= W:\\n\\n ans = j\\n\\n\\n\\n print(ans)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'target': 'def main():\\n\\n N, W = list(map(int, input().split()))\\n\\n weight = [0] * N\\n\\n value = [0] * N\\n\\n for i in range(N):\\n\\n weight[i], value[i] = list(map(int, input().split()))\\n\\n V = sum(value)\\n\\n dp = [[float(\\'inf\\')] * (V + 5) for _ in range(N + 5)]\\n\\n dp[0][0] = 0\\n\\n for i in range(N):\\n\\n for v in range(V+1):\\n\\n if v - value[i] >= 0:\\n\\n dp[i+1][v] = min(dp[i][v-value[i]] + weight[i], dp[i][v])\\n\\n else:\\n\\n dp[i+1][v] = dp[i][v]\\n\\n ans = 0\\n\\n for v in range(V+1):\\n\\n if dp[N][v] <= W:\\n\\n ans = v\\n\\n print(ans)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 654,\n", + " 'code_v1_num_chars': 637,\n", + " 'code_v0_no_empty_lines': 'def main():\\n N, W = list(map(int, input().split()))\\n w = [0] * N\\n v = [0] * N\\n for i in range(N):\\n w[i], v[i] = list(map(int, input().split()))\\n max_v = max(v)\\n dp = [[float(\"inf\")] * (max_v * N + 5) for _ in range(N + 5)]\\n dp[0][0] = 0\\n for i in range(N):\\n for j in range(max_v * N):\\n if j + v[i] <= max_v * N:\\n dp[i + 1][j + v[i]] = min(dp[i + 1][j + v[i]], dp[i][j] + w[i])\\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\\n ans = 0\\n for j in range(max_v * N + 1):\\n if dp[N][j] <= W:\\n ans = j\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n N, W = list(map(int, input().split()))\\n weight = [0] * N\\n value = [0] * N\\n for i in range(N):\\n weight[i], value[i] = list(map(int, input().split()))\\n V = sum(value)\\n dp = [[float(\"inf\")] * (V + 5) for _ in range(N + 5)]\\n dp[0][0] = 0\\n for i in range(N):\\n for v in range(V + 1):\\n if v - value[i] >= 0:\\n dp[i + 1][v] = min(dp[i][v - value[i]] + weight[i], dp[i][v])\\n else:\\n dp[i + 1][v] = dp[i][v]\\n ans = 0\\n for v in range(V + 1):\\n if dp[N][v] <= W:\\n ans = v\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.8148148148,\n", + " 'diff': ['- w = [0] * N',\n", + " '- v = [0] * N',\n", + " '+ weight = [0] * N',\n", + " '+ value = [0] * N',\n", + " '- w[i], v[i] = list(map(int, input().split()))',\n", + " '- max_v = max(v)',\n", + " '- dp = [[float(\"inf\")] * (max_v * N + 5) for _ in range(N + 5)]',\n", + " '+ weight[i], value[i] = list(map(int, input().split()))',\n", + " '+ V = sum(value)',\n", + " '+ dp = [[float(\"inf\")] * (V + 5) for _ in range(N + 5)]',\n", + " '- for j in range(max_v * N):',\n", + " '- if j + v[i] <= max_v * N:',\n", + " '- dp[i + 1][j + v[i]] = min(dp[i + 1][j + v[i]], dp[i][j] + w[i])',\n", + " '- dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])',\n", + " '+ for v in range(V + 1):',\n", + " '+ if v - value[i] >= 0:',\n", + " '+ dp[i + 1][v] = min(dp[i][v - value[i]] + weight[i], dp[i][v])',\n", + " '+ else:',\n", + " '+ dp[i + 1][v] = dp[i][v]',\n", + " '- for j in range(max_v * N + 1):',\n", + " '- if dp[N][j] <= W:',\n", + " '- ans = j',\n", + " '+ for v in range(V + 1):',\n", + " '+ if dp[N][v] <= W:',\n", + " '+ ans = v'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2676751952,\n", + " 'measured_runtime_v1': 0.1215952404,\n", + " 'runtime_lift': 2.2013624416,\n", + " 'key': ['s478711084', 's154638745']},\n", + " {'user_id': 'u945228737',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's973678433',\n", + " 'submission_id_v1': 's713708426',\n", + " 'cpu_time_v0': 115,\n", + " 'cpu_time_v1': 28,\n", + " 'memory_v0': 9184,\n", + " 'memory_v1': 9092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.65,\n", + " 'input': '# import sys\\n\\n# sys.setrecursionlimit(10 ** 6)\\n\\n# import bisect\\n\\n# from collections import deque\\n\\n\\n\\ndef cmb(n, r):\\n\\n \"\"\"組み合わせ\"\"\"\\n\\n import math\\n\\n if n < r:\\n\\n return 0\\n\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\n\\n\\n\\n\\n# from decorator import stop_watch\\n\\n#\\n\\n#\\n\\n# @stop_watch\\n\\ndef solve(S):\\n\\n mod = 10 ** 9 + 7\\n\\n ans = 0\\n\\n for i in range(1, S // 3 + 1):\\n\\n tama = i + (S - (i * 3))\\n\\n tama -= 2\\n\\n bo = i - 1\\n\\n ans += cmb(tama + 1, bo)\\n\\n ans %= mod\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n # S = input()\\n\\n S = int(eval(input()))\\n\\n # N, M = map(int, input().split())\\n\\n # Ai = [int(i) for i in input().split()]\\n\\n # Bi = [int(i) for i in input().split()]\\n\\n # ABi = [[int(i) for i in input().split()] for _ in range(N)]\\n\\n solve(S)\\n\\n\\n\\n # # test\\n\\n # from random import randint\\n\\n # from func import random_str\\n\\n # solve()\\n',\n", + " 'target': \"# 解説を参考に作成\\n\\n# import sys\\n\\n# sys.setrecursionlimit(10 ** 6)\\n\\n# import bisect\\n\\n# from collections import deque\\n\\n# from decorator import stop_watch\\n\\n#\\n\\n#\\n\\n# @stop_watch\\n\\ndef solve(S):\\n\\n mod = 10 ** 9 + 7\\n\\n dp = [0] * (S + 1)\\n\\n dp[0] = 1\\n\\n for i in range(3, S + 1):\\n\\n dp[i] = dp[i - 1] + dp[i - 3]\\n\\n dp[i] %= mod\\n\\n print((dp[S]))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n S = int(eval(input()))\\n\\n solve(S)\\n\\n\\n\\n # # test\\n\\n # from random import randint\\n\\n # from func import random_str\\n\\n # solve()\\n\",\n", + " 'code_v0_loc': 42,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 936,\n", + " 'code_v1_num_chars': 521,\n", + " 'code_v0_no_empty_lines': '# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\ndef cmb(n, r):\\n \"\"\"組み合わせ\"\"\"\\n import math\\n\\n if n < r:\\n return 0\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\n\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S):\\n mod = 10**9 + 7\\n ans = 0\\n for i in range(1, S // 3 + 1):\\n tama = i + (S - (i * 3))\\n tama -= 2\\n bo = i - 1\\n ans += cmb(tama + 1, bo)\\n ans %= mod\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n # S = input()\\n S = int(eval(input()))\\n # N, M = map(int, input().split())\\n # Ai = [int(i) for i in input().split()]\\n # Bi = [int(i) for i in input().split()]\\n # ABi = [[int(i) for i in input().split()] for _ in range(N)]\\n solve(S)\\n # # test\\n # from random import randint\\n # from func import random_str\\n # solve()\\n',\n", + " 'code_v1_no_empty_lines': '# 解説を参考に作成\\n# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S):\\n mod = 10**9 + 7\\n dp = [0] * (S + 1)\\n dp[0] = 1\\n for i in range(3, S + 1):\\n dp[i] = dp[i - 1] + dp[i - 3]\\n dp[i] %= mod\\n print((dp[S]))\\n\\n\\nif __name__ == \"__main__\":\\n S = int(eval(input()))\\n solve(S)\\n # # test\\n # from random import randint\\n # from func import random_str\\n # solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.7142857143,\n", + " 'diff': ['+# 解説を参考に作成',\n", + " '-def cmb(n, r):',\n", + " '- \"\"\"組み合わせ\"\"\"',\n", + " '- import math',\n", + " '-',\n", + " '- if n < r:',\n", + " '- return 0',\n", + " '- return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))',\n", + " '-',\n", + " '-',\n", + " '- ans = 0',\n", + " '- for i in range(1, S // 3 + 1):',\n", + " '- tama = i + (S - (i * 3))',\n", + " '- tama -= 2',\n", + " '- bo = i - 1',\n", + " '- ans += cmb(tama + 1, bo)',\n", + " '- ans %= mod',\n", + " '- print(ans)',\n", + " '+ dp = [0] * (S + 1)',\n", + " '+ dp[0] = 1',\n", + " '+ for i in range(3, S + 1):',\n", + " '+ dp[i] = dp[i - 1] + dp[i - 3]',\n", + " '+ dp[i] %= mod',\n", + " '+ print((dp[S]))',\n", + " '- # S = input()',\n", + " '- # N, M = map(int, input().split())',\n", + " '- # Ai = [int(i) for i in input().split()]',\n", + " '- # Bi = [int(i) for i in input().split()]',\n", + " '- # ABi = [[int(i) for i in input().split()] for _ in range(N)]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4257377865,\n", + " 'measured_runtime_v1': 0.2429736164,\n", + " 'runtime_lift': 1.7521975961,\n", + " 'key': ['s973678433', 's713708426']},\n", + " {'user_id': 'u606878291',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's651904471',\n", + " 'submission_id_v1': 's107901717',\n", + " 'cpu_time_v0': 460,\n", + " 'cpu_time_v1': 177,\n", + " 'memory_v0': 21064,\n", + " 'memory_v1': 11968,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 61.52,\n", + " 'input': \"import numpy as np\\n\\n\\n\\n\\n\\ndef main(n, m, a):\\n\\n dp = np.zeros(n + 1, dtype=int)\\n\\n dp[0] = 1\\n\\n dp[1] = 1 if 1 not in a else 0\\n\\n\\n\\n for i in range(2, len(dp)):\\n\\n dp[i] = dp[i - 1] + dp[i - 2] if i not in a else 0\\n\\n dp[i] %= 1000000007\\n\\n\\n\\n return dp[-1]\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n N, M = list(map(int, input().split()))\\n\\n A = set()\\n\\n for _ in range(M):\\n\\n A.add(int(eval(input())))\\n\\n\\n\\n print((main(N, M, A)))\\n\",\n", + " 'target': \"import math\\n\\n\\n\\nMOD = int(math.pow(10, 9)) + 7\\n\\nN, M = list(map(int, input().split(' ')))\\n\\nbroken_steps = {int(eval(input())) for _ in range(M)}\\n\\n\\n\\ndp = [0] * (N + 1)\\n\\n\\n\\ndp[0] = 1\\n\\nif 1 not in broken_steps:\\n\\n dp[1] = 1\\n\\n\\n\\nfor step in range(2, N + 1):\\n\\n if step not in broken_steps:\\n\\n dp[step] = (dp[step - 1] + dp[step - 2]) % MOD\\n\\n\\n\\nprint((dp[N]))\\n\",\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 442,\n", + " 'code_v1_num_chars': 347,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n\\ndef main(n, m, a):\\n dp = np.zeros(n + 1, dtype=int)\\n dp[0] = 1\\n dp[1] = 1 if 1 not in a else 0\\n for i in range(2, len(dp)):\\n dp[i] = dp[i - 1] + dp[i - 2] if i not in a else 0\\n dp[i] %= 1000000007\\n return dp[-1]\\n\\n\\nif __name__ == \"__main__\":\\n N, M = list(map(int, input().split()))\\n A = set()\\n for _ in range(M):\\n A.add(int(eval(input())))\\n print((main(N, M, A)))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nMOD = int(math.pow(10, 9)) + 7\\nN, M = list(map(int, input().split(\" \")))\\nbroken_steps = {int(eval(input())) for _ in range(M)}\\ndp = [0] * (N + 1)\\ndp[0] = 1\\nif 1 not in broken_steps:\\n dp[1] = 1\\nfor step in range(2, N + 1):\\n if step not in broken_steps:\\n dp[step] = (dp[step - 1] + dp[step - 2]) % MOD\\nprint((dp[N]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.7272727273,\n", + " 'diff': ['-import numpy as np',\n", + " '+import math',\n", + " '-',\n", + " '-def main(n, m, a):',\n", + " '- dp = np.zeros(n + 1, dtype=int)',\n", + " '- dp[0] = 1',\n", + " '- dp[1] = 1 if 1 not in a else 0',\n", + " '- for i in range(2, len(dp)):',\n", + " '- dp[i] = dp[i - 1] + dp[i - 2] if i not in a else 0',\n", + " '- dp[i] %= 1000000007',\n", + " '- return dp[-1]',\n", + " '-',\n", + " '-',\n", + " '-if __name__ == \"__main__\":',\n", + " '- N, M = list(map(int, input().split()))',\n", + " '- A = set()',\n", + " '- for _ in range(M):',\n", + " '- A.add(int(eval(input())))',\n", + " '- print((main(N, M, A)))',\n", + " '+MOD = int(math.pow(10, 9)) + 7',\n", + " '+N, M = list(map(int, input().split(\" \")))',\n", + " '+broken_steps = {int(eval(input())) for _ in range(M)}',\n", + " '+dp = [0] * (N + 1)',\n", + " '+dp[0] = 1',\n", + " '+if 1 not in broken_steps:',\n", + " '+ dp[1] = 1',\n", + " '+for step in range(2, N + 1):',\n", + " '+ if step not in broken_steps:',\n", + " '+ dp[step] = (dp[step - 1] + dp[step - 2]) % MOD',\n", + " '+print((dp[N]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3399993193,\n", + " 'measured_runtime_v1': 0.5207966185,\n", + " 'runtime_lift': 2.572980069,\n", + " 'key': ['s651904471', 's107901717']},\n", + " {'user_id': 'u075012704',\n", + " 'problem_id': 'p03558',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's239051528',\n", + " 'submission_id_v1': 's690298448',\n", + " 'cpu_time_v0': 622,\n", + " 'cpu_time_v1': 294,\n", + " 'memory_v0': 102192,\n", + " 'memory_v1': 35324,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 52.73,\n", + " 'input': \"from collections import deque\\n\\nK = int(eval(input()))\\n\\nG = [[] for i in range(K)]\\n\\n\\n\\nfor n in range(K):\\n\\n G[n].append([(n + 1) % K, 1])\\n\\n G[n].append([(10 * n) % K, 0])\\n\\n\\n\\nque = deque([[1, 1]])\\n\\ndist = [float('inf')] * K\\n\\n\\n\\nwhile que:\\n\\n node, cost = que.pop()\\n\\n dist[node] = min(cost, dist[node])\\n\\n for e, e_cost in G[node]:\\n\\n if dist[e] != float('inf'):\\n\\n continue\\n\\n\\n\\n if e_cost == 0:\\n\\n que.append([e, cost + 0])\\n\\n\\n\\n if e_cost == 1:\\n\\n que.appendleft([e, cost + 1])\\n\\n\\n\\nprint((dist[0]))\\n\",\n", + " 'target': \"from collections import deque\\n\\nK = int(eval(input()))\\n\\nG = [[] for i in range(K)]\\n\\nfor i in range(K):\\n\\n G[i].append(((10 * i) % K, 0))\\n\\n G[i].append(((i + 1) % K, 1))\\n\\n\\n\\ndist = [float('inf')] * K\\n\\ndist[1] = 1\\n\\nque = deque()\\n\\nque.append(1)\\n\\n\\n\\nwhile que:\\n\\n n = que.pop()\\n\\n for v, c in G[n]:\\n\\n if dist[v] > dist[n] + c:\\n\\n dist[v] = dist[n] + c\\n\\n if c == 0:\\n\\n que.append(v)\\n\\n else:\\n\\n que.appendleft(v)\\n\\n\\n\\nprint((dist[0]))\\n\",\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 547,\n", + " 'code_v1_num_chars': 492,\n", + " 'code_v0_no_empty_lines': 'from collections import deque\\n\\nK = int(eval(input()))\\nG = [[] for i in range(K)]\\nfor n in range(K):\\n G[n].append([(n + 1) % K, 1])\\n G[n].append([(10 * n) % K, 0])\\nque = deque([[1, 1]])\\ndist = [float(\"inf\")] * K\\nwhile que:\\n node, cost = que.pop()\\n dist[node] = min(cost, dist[node])\\n for e, e_cost in G[node]:\\n if dist[e] != float(\"inf\"):\\n continue\\n if e_cost == 0:\\n que.append([e, cost + 0])\\n if e_cost == 1:\\n que.appendleft([e, cost + 1])\\nprint((dist[0]))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque\\n\\nK = int(eval(input()))\\nG = [[] for i in range(K)]\\nfor i in range(K):\\n G[i].append(((10 * i) % K, 0))\\n G[i].append(((i + 1) % K, 1))\\ndist = [float(\"inf\")] * K\\ndist[1] = 1\\nque = deque()\\nque.append(1)\\nwhile que:\\n n = que.pop()\\n for v, c in G[n]:\\n if dist[v] > dist[n] + c:\\n dist[v] = dist[n] + c\\n if c == 0:\\n que.append(v)\\n else:\\n que.appendleft(v)\\nprint((dist[0]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.0,\n", + " 'diff': ['-for n in range(K):',\n", + " '- G[n].append([(n + 1) % K, 1])',\n", + " '- G[n].append([(10 * n) % K, 0])',\n", + " '-que = deque([[1, 1]])',\n", + " '+for i in range(K):',\n", + " '+ G[i].append(((10 * i) % K, 0))',\n", + " '+ G[i].append(((i + 1) % K, 1))',\n", + " '+dist[1] = 1',\n", + " '+que = deque()',\n", + " '+que.append(1)',\n", + " '- node, cost = que.pop()',\n", + " '- dist[node] = min(cost, dist[node])',\n", + " '- for e, e_cost in G[node]:',\n", + " '- if dist[e] != float(\"inf\"):',\n", + " '- continue',\n", + " '- if e_cost == 0:',\n", + " '- que.append([e, cost + 0])',\n", + " '- if e_cost == 1:',\n", + " '- que.appendleft([e, cost + 1])',\n", + " '+ n = que.pop()',\n", + " '+ for v, c in G[n]:',\n", + " '+ if dist[v] > dist[n] + c:',\n", + " '+ dist[v] = dist[n] + c',\n", + " '+ if c == 0:',\n", + " '+ que.append(v)',\n", + " '+ else:',\n", + " '+ que.appendleft(v)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7363213913,\n", + " 'measured_runtime_v1': 0.4714232118,\n", + " 'runtime_lift': 1.5619116176,\n", + " 'key': ['s239051528', 's690298448']},\n", + " {'user_id': 'u457901067',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's285073705',\n", + " 'submission_id_v1': 's453740847',\n", + " 'cpu_time_v0': 523,\n", + " 'cpu_time_v1': 158,\n", + " 'memory_v0': 21860,\n", + " 'memory_v1': 97668,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 69.79,\n", + " 'input': 'from fractions import gcd\\n\\nN, M = list(map(int, input().split()))\\n\\nA = list([int(x) for x in input().split()])\\n\\n\\n\\ncnt = [0 for _ in range(N)]\\n\\nfor i in range(N):\\n\\n a = A[i]\\n\\n while a%2 == 0:\\n\\n a = a // 2\\n\\n cnt[i] += 1\\n\\n\\n\\nif max(cnt) > min(cnt):\\n\\n print((0))\\n\\n exit(0)\\n\\nC = max(cnt)\\n\\n\\n\\nA = list([x // pow(2,C) for x in A])\\n\\ndef gcd(a,b):\\n\\n if a 0:\\n\\n a,b = b,a%b\\n\\n return b\\n\\n\\n\\ndef lcm(a,b):\\n\\n return a*b//gcd(a,b)\\n\\n\\n\\nx = A[0]\\n\\nfor a in A[1:]:\\n\\n x = lcm(x,a)\\n\\nx = x * pow(2,C-1)\\n\\n\\n\\nprint(((M // x + 1) // 2))',\n", + " 'target': 'N, M = list(map(int, input().split()))\\n\\nA = list([int(x) for x in input().split()])\\n\\n\\n\\ncnt = [0 for _ in range(N)]\\n\\nfor i in range(N):\\n\\n a = A[i]\\n\\n while a%2 == 0:\\n\\n a = a // 2\\n\\n cnt[i] += 1\\n\\n\\n\\nif max(cnt) > min(cnt):\\n\\n print((0))\\n\\n exit(0)\\n\\nC = max(cnt)\\n\\n\\n\\nA = list([x // pow(2,C) for x in A])\\n\\ndef gcd(a,b):\\n\\n if a 0:\\n\\n a,b = b,a%b\\n\\n return b\\n\\n\\n\\ndef lcm(a,b):\\n\\n return a*b//gcd(a,b)\\n\\n\\n\\nx = A[0]\\n\\nfor a in A[1:]:\\n\\n x = lcm(x,a)\\n\\nx = x * pow(2,C-1)\\n\\n\\n\\nprint(((M // x + 1) // 2))',\n", + " 'code_v0_loc': 33,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 560,\n", + " 'code_v1_num_chars': 533,\n", + " 'code_v0_no_empty_lines': 'from fractions import gcd\\n\\nN, M = list(map(int, input().split()))\\nA = list([int(x) for x in input().split()])\\ncnt = [0 for _ in range(N)]\\nfor i in range(N):\\n a = A[i]\\n while a % 2 == 0:\\n a = a // 2\\n cnt[i] += 1\\nif max(cnt) > min(cnt):\\n print((0))\\n exit(0)\\nC = max(cnt)\\nA = list([x // pow(2, C) for x in A])\\n\\n\\ndef gcd(a, b):\\n if a < b:\\n a, b = b, a\\n while a % b > 0:\\n a, b = b, a % b\\n return b\\n\\n\\ndef lcm(a, b):\\n return a * b // gcd(a, b)\\n\\n\\nx = A[0]\\nfor a in A[1:]:\\n x = lcm(x, a)\\nx = x * pow(2, C - 1)\\nprint(((M // x + 1) // 2))\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nA = list([int(x) for x in input().split()])\\ncnt = [0 for _ in range(N)]\\nfor i in range(N):\\n a = A[i]\\n while a % 2 == 0:\\n a = a // 2\\n cnt[i] += 1\\nif max(cnt) > min(cnt):\\n print((0))\\n exit(0)\\nC = max(cnt)\\nA = list([x // pow(2, C) for x in A])\\n\\n\\ndef gcd(a, b):\\n if a < b:\\n a, b = b, a\\n while a % b > 0:\\n a, b = b, a % b\\n return b\\n\\n\\ndef lcm(a, b):\\n return a * b // gcd(a, b)\\n\\n\\nx = A[0]\\nfor a in A[1:]:\\n x = lcm(x, a)\\nx = x * pow(2, C - 1)\\nprint(((M // x + 1) // 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.0303030303,\n", + " 'diff': ['-from fractions import gcd', '-'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2484916873,\n", + " 'measured_runtime_v1': 0.192324806,\n", + " 'runtime_lift': 1.2920417937,\n", + " 'key': ['s285073705', 's453740847']},\n", + " {'user_id': 'u609061751',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's621661858',\n", + " 'submission_id_v1': 's461712112',\n", + " 'cpu_time_v0': 665,\n", + " 'cpu_time_v1': 313,\n", + " 'memory_v0': 12772,\n", + " 'memory_v1': 45532,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 52.93,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nimport numpy as np\\n\\nN = int(eval(input()))\\n\\nS = [[] for _ in range(N)]\\n\\nfor i in range(N):\\n\\n A = int(eval(input()))\\n\\n temp = []\\n\\n for _ in range(A):\\n\\n temp.append([str(x) for x in input().split()])\\n\\n S[i] = temp\\n\\nans = 0\\n\\nfor i in range(2 ** N - 1, -1,-1):\\n\\n biti = list(bin(i)[2:].zfill(N))\\n\\n flag = 0\\n\\n for j in range(N):\\n\\n if biti[j] == \"1\":\\n\\n for k in S[j]:\\n\\n if biti[int(k[0])-1] != k[1]:\\n\\n flag = 1\\n\\n break\\n\\n if flag:\\n\\n break\\n\\n if not flag: \\n\\n biti = np.array(biti)\\n\\n ans = max(ans, np.count_nonzero(biti == \"1\"))\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nn = int(eval(input()))\\n\\n\\n\\nfrom collections import defaultdict\\n\\nd = defaultdict(list)\\n\\n\\n\\nfor i in range(n):\\n\\n a = int(eval(input()))\\n\\n for _ in range(a):\\n\\n x, y = [int(x) for x in input().split()]\\n\\n d[i].append((x - 1, y))\\n\\nans = 0\\n\\nfor k in range(2**n):\\n\\n res = 0\\n\\n j = bin(k)[2:].zfill(n)\\n\\n flag = 1\\n\\n for i in range(n):\\n\\n if j[i] == \"0\":\\n\\n continue\\n\\n for x, y in d[i]:\\n\\n if int(j[x]) != int(y):\\n\\n flag = 0\\n\\n break\\n\\n res += 1\\n\\n if flag:\\n\\n ans = max(ans, res)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 700,\n", + " 'code_v1_num_chars': 616,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nimport numpy as np\\n\\nN = int(eval(input()))\\nS = [[] for _ in range(N)]\\nfor i in range(N):\\n A = int(eval(input()))\\n temp = []\\n for _ in range(A):\\n temp.append([str(x) for x in input().split()])\\n S[i] = temp\\nans = 0\\nfor i in range(2**N - 1, -1, -1):\\n biti = list(bin(i)[2:].zfill(N))\\n flag = 0\\n for j in range(N):\\n if biti[j] == \"1\":\\n for k in S[j]:\\n if biti[int(k[0]) - 1] != k[1]:\\n flag = 1\\n break\\n if flag:\\n break\\n if not flag:\\n biti = np.array(biti)\\n ans = max(ans, np.count_nonzero(biti == \"1\"))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nn = int(eval(input()))\\nfrom collections import defaultdict\\n\\nd = defaultdict(list)\\nfor i in range(n):\\n a = int(eval(input()))\\n for _ in range(a):\\n x, y = [int(x) for x in input().split()]\\n d[i].append((x - 1, y))\\nans = 0\\nfor k in range(2**n):\\n res = 0\\n j = bin(k)[2:].zfill(n)\\n flag = 1\\n for i in range(n):\\n if j[i] == \"0\":\\n continue\\n for x, y in d[i]:\\n if int(j[x]) != int(y):\\n flag = 0\\n break\\n res += 1\\n if flag:\\n ans = max(ans, res)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.8965517241,\n", + " 'diff': ['-import numpy as np',\n", + " '+n = int(eval(input()))',\n", + " '+from collections import defaultdict',\n", + " '-N = int(eval(input()))',\n", + " '-S = [[] for _ in range(N)]',\n", + " '-for i in range(N):',\n", + " '- A = int(eval(input()))',\n", + " '- temp = []',\n", + " '- for _ in range(A):',\n", + " '- temp.append([str(x) for x in input().split()])',\n", + " '- S[i] = temp',\n", + " '+d = defaultdict(list)',\n", + " '+for i in range(n):',\n", + " '+ a = int(eval(input()))',\n", + " '+ for _ in range(a):',\n", + " '+ x, y = [int(x) for x in input().split()]',\n", + " '+ d[i].append((x - 1, y))',\n", + " '-for i in range(2**N - 1, -1, -1):',\n", + " '- biti = list(bin(i)[2:].zfill(N))',\n", + " '- flag = 0',\n", + " '- for j in range(N):',\n", + " '- if biti[j] == \"1\":',\n", + " '- for k in S[j]:',\n", + " '- if biti[int(k[0]) - 1] != k[1]:',\n", + " '- flag = 1',\n", + " '- break',\n", + " '- if flag:',\n", + " '- break',\n", + " '- if not flag:',\n", + " '- biti = np.array(biti)',\n", + " '- ans = max(ans, np.count_nonzero(biti == \"1\"))',\n", + " '+for k in range(2**n):',\n", + " '+ res = 0',\n", + " '+ j = bin(k)[2:].zfill(n)',\n", + " '+ flag = 1',\n", + " '+ for i in range(n):',\n", + " '+ if j[i] == \"0\":',\n", + " '+ continue',\n", + " '+ for x, y in d[i]:',\n", + " '+ if int(j[x]) != int(y):',\n", + " '+ flag = 0',\n", + " '+ break',\n", + " '+ res += 1',\n", + " '+ if flag:',\n", + " '+ ans = max(ans, res)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4142415071,\n", + " 'measured_runtime_v1': 0.2070345302,\n", + " 'runtime_lift': 6.8309450886,\n", + " 'key': ['s621661858', 's461712112']},\n", + " {'user_id': 'u340781749',\n", + " 'problem_id': 'p02604',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's339976577',\n", + " 'submission_id_v1': 's349402655',\n", + " 'cpu_time_v0': 907,\n", + " 'cpu_time_v1': 582,\n", + " 'memory_v0': 96844,\n", + " 'memory_v1': 96788,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.83,\n", + " 'input': \"import os\\n\\nimport sys\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\n\\n\\ndef solve(n, precalc_x, precalc_y):\\n\\n ans = np.full(n + 1, 10 ** 18, dtype=np.int64)\\n\\n\\n\\n def get_cost(v, bit):\\n\\n cost = 0\\n\\n pcx = precalc_x[v]\\n\\n pcy = precalc_y[v ^ bit]\\n\\n for i in range(n):\\n\\n if v & (1 << i):\\n\\n continue\\n\\n cost += min(pcx[i], pcy[i])\\n\\n return cost\\n\\n\\n\\n for bit in range(1 << n):\\n\\n k = (bit & 0x5555) + (bit >> 1 & 0x5555)\\n\\n k = (k & 0x3333) + (k >> 2 & 0x3333)\\n\\n k = (k & 0x0f0f) + (k >> 4 & 0x0f0f)\\n\\n k = (k & 0x00ff) + (k >> 8 & 0x00ff)\\n\\n v = bit\\n\\n while v:\\n\\n ans[k] = min(ans[k], get_cost(v, bit))\\n\\n v = (v - 1) & bit\\n\\n ans[k] = min(ans[k], get_cost(0, bit))\\n\\n\\n\\n return ans\\n\\n\\n\\n\\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n from numba.pycc import CC\\n\\n\\n\\n cc = CC('my_module')\\n\\n cc.export('solve', '(i8, i8[:,:], i8[:,:])')(solve)\\n\\n cc.compile()\\n\\n exit()\\n\\n\\n\\nif os.name == 'posix':\\n\\n # noinspection PyUnresolvedReferences\\n\\n from my_module import solve\\n\\nelse:\\n\\n from numba import njit\\n\\n\\n\\n solve = njit('(i8, i8[:,:], i8[:,:])', cache=True)(solve)\\n\\n print('compiled', file=sys.stderr)\\n\\n\\n\\ninp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')\\n\\nn = inp[0]\\n\\nxxx = inp[1::3]\\n\\nyyy = inp[2::3]\\n\\nppp = inp[3::3]\\n\\n\\n\\nbit_d = (((np.arange(1 << n)[:, None] & (1 << np.arange(n)))) > 0).astype(np.int64)\\n\\nprecalc_x = abs((xxx[None, :] * bit_d)[..., None] - xxx[None, None, :]).min(axis=1) * ppp[None, :]\\n\\nprecalc_y = abs((yyy[None, :] * bit_d)[..., None] - yyy[None, None, :]).min(axis=1) * ppp[None, :]\\n\\n\\n\\nans = solve(n, precalc_x, precalc_y)\\n\\nprint('\\\\n'.join(map(str, ans)))\\n\",\n", + " 'target': \"import os\\n\\nimport sys\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\n\\n\\ndef solve(n, precalc_x, precalc_y):\\n\\n ans = np.full(n + 1, 10 ** 18, dtype=np.int64)\\n\\n\\n\\n def get_cost(v, bit):\\n\\n cost = 0\\n\\n pcx = precalc_x[v]\\n\\n pcy = precalc_y[v ^ bit]\\n\\n for i in range(n):\\n\\n cost += min(pcx[i], pcy[i])\\n\\n return cost\\n\\n\\n\\n for bit in range(1 << n):\\n\\n k = (bit & 0x5555) + (bit >> 1 & 0x5555)\\n\\n k = (k & 0x3333) + (k >> 2 & 0x3333)\\n\\n k = (k & 0x0f0f) + (k >> 4 & 0x0f0f)\\n\\n k = (k & 0x00ff) + (k >> 8 & 0x00ff)\\n\\n v = bit\\n\\n while v:\\n\\n ans[k] = min(ans[k], get_cost(v, bit))\\n\\n v = (v - 1) & bit\\n\\n ans[k] = min(ans[k], get_cost(0, bit))\\n\\n\\n\\n return ans\\n\\n\\n\\n\\n\\nif sys.argv[-1] == 'ONLINE_JUDGE':\\n\\n from numba.pycc import CC\\n\\n\\n\\n cc = CC('my_module')\\n\\n cc.export('solve', '(i8, i8[:,:], i8[:,:])')(solve)\\n\\n cc.compile()\\n\\n exit()\\n\\n\\n\\nif os.name == 'posix':\\n\\n # noinspection PyUnresolvedReferences\\n\\n from my_module import solve\\n\\nelse:\\n\\n from numba import njit\\n\\n\\n\\n solve = njit('(i8, i8[:,:], i8[:,:])', cache=True)(solve)\\n\\n print('compiled', file=sys.stderr)\\n\\n\\n\\ninp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')\\n\\nn = inp[0]\\n\\nxxx = inp[1::3]\\n\\nyyy = inp[2::3]\\n\\nppp = inp[3::3]\\n\\n\\n\\nbit_d = (((np.arange(1 << n)[:, None] & (1 << np.arange(n)))) > 0).astype(np.int64)\\n\\nprecalc_x = abs((xxx[None, :] * bit_d)[..., None] - xxx[None, None, :]).min(axis=1) * ppp[None, :]\\n\\nprecalc_y = abs((yyy[None, :] * bit_d)[..., None] - yyy[None, None, :]).min(axis=1) * ppp[None, :]\\n\\n\\n\\nans = solve(n, precalc_x, precalc_y)\\n\\nprint('\\\\n'.join(map(str, ans)))\\n\",\n", + " 'code_v0_loc': 62,\n", + " 'code_v1_loc': 60,\n", + " 'code_v0_num_chars': 1714,\n", + " 'code_v1_num_chars': 1658,\n", + " 'code_v0_no_empty_lines': 'import os\\nimport sys\\nimport numpy as np\\n\\n\\ndef solve(n, precalc_x, precalc_y):\\n ans = np.full(n + 1, 10**18, dtype=np.int64)\\n\\n def get_cost(v, bit):\\n cost = 0\\n pcx = precalc_x[v]\\n pcy = precalc_y[v ^ bit]\\n for i in range(n):\\n if v & (1 << i):\\n continue\\n cost += min(pcx[i], pcy[i])\\n return cost\\n\\n for bit in range(1 << n):\\n k = (bit & 0x5555) + (bit >> 1 & 0x5555)\\n k = (k & 0x3333) + (k >> 2 & 0x3333)\\n k = (k & 0x0F0F) + (k >> 4 & 0x0F0F)\\n k = (k & 0x00FF) + (k >> 8 & 0x00FF)\\n v = bit\\n while v:\\n ans[k] = min(ans[k], get_cost(v, bit))\\n v = (v - 1) & bit\\n ans[k] = min(ans[k], get_cost(0, bit))\\n return ans\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n from numba.pycc import CC\\n\\n cc = CC(\"my_module\")\\n cc.export(\"solve\", \"(i8, i8[:,:], i8[:,:])\")(solve)\\n cc.compile()\\n exit()\\nif os.name == \"posix\":\\n # noinspection PyUnresolvedReferences\\n from my_module import solve\\nelse:\\n from numba import njit\\n\\n solve = njit(\"(i8, i8[:,:], i8[:,:])\", cache=True)(solve)\\n print(\"compiled\", file=sys.stderr)\\ninp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=\" \")\\nn = inp[0]\\nxxx = inp[1::3]\\nyyy = inp[2::3]\\nppp = inp[3::3]\\nbit_d = (((np.arange(1 << n)[:, None] & (1 << np.arange(n)))) > 0).astype(np.int64)\\nprecalc_x = (\\n abs((xxx[None, :] * bit_d)[..., None] - xxx[None, None, :]).min(axis=1)\\n * ppp[None, :]\\n)\\nprecalc_y = (\\n abs((yyy[None, :] * bit_d)[..., None] - yyy[None, None, :]).min(axis=1)\\n * ppp[None, :]\\n)\\nans = solve(n, precalc_x, precalc_y)\\nprint(\"\\\\n\".join(map(str, ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'import os\\nimport sys\\nimport numpy as np\\n\\n\\ndef solve(n, precalc_x, precalc_y):\\n ans = np.full(n + 1, 10**18, dtype=np.int64)\\n\\n def get_cost(v, bit):\\n cost = 0\\n pcx = precalc_x[v]\\n pcy = precalc_y[v ^ bit]\\n for i in range(n):\\n cost += min(pcx[i], pcy[i])\\n return cost\\n\\n for bit in range(1 << n):\\n k = (bit & 0x5555) + (bit >> 1 & 0x5555)\\n k = (k & 0x3333) + (k >> 2 & 0x3333)\\n k = (k & 0x0F0F) + (k >> 4 & 0x0F0F)\\n k = (k & 0x00FF) + (k >> 8 & 0x00FF)\\n v = bit\\n while v:\\n ans[k] = min(ans[k], get_cost(v, bit))\\n v = (v - 1) & bit\\n ans[k] = min(ans[k], get_cost(0, bit))\\n return ans\\n\\n\\nif sys.argv[-1] == \"ONLINE_JUDGE\":\\n from numba.pycc import CC\\n\\n cc = CC(\"my_module\")\\n cc.export(\"solve\", \"(i8, i8[:,:], i8[:,:])\")(solve)\\n cc.compile()\\n exit()\\nif os.name == \"posix\":\\n # noinspection PyUnresolvedReferences\\n from my_module import solve\\nelse:\\n from numba import njit\\n\\n solve = njit(\"(i8, i8[:,:], i8[:,:])\", cache=True)(solve)\\n print(\"compiled\", file=sys.stderr)\\ninp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=\" \")\\nn = inp[0]\\nxxx = inp[1::3]\\nyyy = inp[2::3]\\nppp = inp[3::3]\\nbit_d = (((np.arange(1 << n)[:, None] & (1 << np.arange(n)))) > 0).astype(np.int64)\\nprecalc_x = (\\n abs((xxx[None, :] * bit_d)[..., None] - xxx[None, None, :]).min(axis=1)\\n * ppp[None, :]\\n)\\nprecalc_y = (\\n abs((yyy[None, :] * bit_d)[..., None] - yyy[None, None, :]).min(axis=1)\\n * ppp[None, :]\\n)\\nans = solve(n, precalc_x, precalc_y)\\nprint(\"\\\\n\".join(map(str, ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.2258064516,\n", + " 'diff': ['- if v & (1 << i):', '- continue'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.2792407084,\n", + " 'measured_runtime_v1': 1.4276063459,\n", + " 'runtime_lift': 1.5965470558,\n", + " 'key': ['s339976577', 's349402655']},\n", + " {'user_id': 'u893063840',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's696312664',\n", + " 'submission_id_v1': 's914180377',\n", + " 'cpu_time_v0': 588,\n", + " 'cpu_time_v1': 493,\n", + " 'memory_v0': 32888,\n", + " 'memory_v1': 36036,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.16,\n", + " 'input': 'n, m = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nbc = [list(map(int, input().split())) for _ in range(m)]\\n\\n\\n\\nbc.sort(key=lambda x: x[1], reverse=True)\\n\\na.sort()\\n\\n\\n\\ni = 0\\n\\nfor b, c in bc:\\n\\n for _ in range(b):\\n\\n if i < n and a[i] < c:\\n\\n a[i] = c\\n\\n i += 1\\n\\n else:\\n\\n break\\n\\n\\n\\nans = sum(a)\\n\\nprint(ans)\\n',\n", + " 'target': 'n, m = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nbc = [list(map(int, input().split())) for _ in range(m)]\\n\\n\\n\\nbc.sort(reverse=True, key=lambda x: x[1])\\n\\n\\n\\nli = []\\n\\nl = 0\\n\\ni = 0\\n\\nwhile i < m and l < n:\\n\\n b, c = bc[i]\\n\\n li += [c] * b\\n\\n i += 1\\n\\n l += b\\n\\n\\n\\na += li\\n\\na.sort(reverse=True)\\n\\nans = sum(a[:n])\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 369,\n", + " 'code_v1_num_chars': 346,\n", + " 'code_v0_no_empty_lines': 'n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nbc = [list(map(int, input().split())) for _ in range(m)]\\nbc.sort(key=lambda x: x[1], reverse=True)\\na.sort()\\ni = 0\\nfor b, c in bc:\\n for _ in range(b):\\n if i < n and a[i] < c:\\n a[i] = c\\n i += 1\\n else:\\n break\\nans = sum(a)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nbc = [list(map(int, input().split())) for _ in range(m)]\\nbc.sort(reverse=True, key=lambda x: x[1])\\nli = []\\nl = 0\\ni = 0\\nwhile i < m and l < n:\\n b, c = bc[i]\\n li += [c] * b\\n i += 1\\n l += b\\na += li\\na.sort(reverse=True)\\nans = sum(a[:n])\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.2631578947,\n", + " 'diff': ['-bc.sort(key=lambda x: x[1], reverse=True)',\n", + " '-a.sort()',\n", + " '+bc.sort(reverse=True, key=lambda x: x[1])',\n", + " '+li = []',\n", + " '+l = 0',\n", + " '-for b, c in bc:',\n", + " '- for _ in range(b):',\n", + " '- if i < n and a[i] < c:',\n", + " '- a[i] = c',\n", + " '- i += 1',\n", + " '- else:',\n", + " '- break',\n", + " '-ans = sum(a)',\n", + " '+while i < m and l < n:',\n", + " '+ b, c = bc[i]',\n", + " '+ li += [c] * b',\n", + " '+ i += 1',\n", + " '+ l += b',\n", + " '+a += li',\n", + " '+a.sort(reverse=True)',\n", + " '+ans = sum(a[:n])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2346956289,\n", + " 'measured_runtime_v1': 0.006594183,\n", + " 'runtime_lift': 35.5913127767,\n", + " 'key': ['s696312664', 's914180377']},\n", + " {'user_id': 'u437638594',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's394411898',\n", + " 'submission_id_v1': 's768084185',\n", + " 'cpu_time_v0': 774,\n", + " 'cpu_time_v1': 113,\n", + " 'memory_v0': 23388,\n", + " 'memory_v1': 14008,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.4,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(input())\\n\\nAs = list(map(int, input().split()))\\n\\n\\n\\n# for i in range(N):\\n\\n# print(As.index(i+1) + 1, end = \" \")\\n\\n\\n\\nfor item in np.argsort(As):\\n\\n print(item+1, end=\" \")\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nAs = list(map(int, input().split()))\\n\\n\\n\\nans = [0] * N\\n\\n\\n\\nfor i, A in enumerate(As):\\n\\n ans[A-1] = i+1\\n\\n \\n\\nprint((*ans))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 199,\n", + " 'code_v1_num_chars': 136,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(input())\\nAs = list(map(int, input().split()))\\n# for i in range(N):\\n# print(As.index(i+1) + 1, end = \" \")\\nfor item in np.argsort(As):\\n print(item + 1, end=\" \")\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nAs = list(map(int, input().split()))\\nans = [0] * N\\nfor i, A in enumerate(As):\\n ans[A - 1] = i + 1\\nprint((*ans))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-N = int(input())',\n", + " '+N = int(eval(input()))',\n", + " '-# for i in range(N):',\n", + " '-# print(As.index(i+1) + 1, end = \" \")',\n", + " '-for item in np.argsort(As):',\n", + " '- print(item + 1, end=\" \")',\n", + " '+ans = [0] * N',\n", + " '+for i, A in enumerate(As):',\n", + " '+ ans[A - 1] = i + 1',\n", + " '+print((*ans))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1602964805,\n", + " 'measured_runtime_v1': 0.2883257704,\n", + " 'runtime_lift': 7.4925542641,\n", + " 'key': ['s394411898', 's768084185']},\n", + " {'user_id': 'u086503932',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's657535199',\n", + " 'submission_id_v1': 's415753878',\n", + " 'cpu_time_v0': 500,\n", + " 'cpu_time_v1': 202,\n", + " 'memory_v0': 16280,\n", + " 'memory_v1': 91128,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.6,\n", + " 'input': \"#!/usr/bin/env python3\\n\\nimport sys\\n\\nfrom fractions import gcd\\n\\nimport math\\n\\n\\n\\ndef main():\\n\\n N, M = list(map(int, input().split()))\\n\\n a = list(map(int, input().split()))\\n\\n tmp = 1\\n\\n count = None\\n\\n for i in range(N):\\n\\n tmp = (tmp * a[i]//2) // gcd(tmp,a[i]//2)\\n\\n c = 0\\n\\n n = a[i]//2\\n\\n while n % 2 == 0:\\n\\n c += 1\\n\\n n //= 2\\n\\n if i == 0:\\n\\n count = c\\n\\n elif count != c:\\n\\n print((0))\\n\\n exit()\\n\\n print(((M//tmp +1)//2))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': 'from math import gcd\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\nA = list(map(int, input().split()))\\n\\nB = [a//2 for a in A]\\n\\nLCM = 1\\n\\nfor i in range(N):\\n\\n LCM = LCM * B[i] // gcd(LCM, B[i])\\n\\nfor i in range(N):\\n\\n if LCM // B[i] % 2 == 0:\\n\\n print((0))\\n\\n exit()\\n\\nprint(((M//LCM + 1)//2))',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 527,\n", + " 'code_v1_num_chars': 293,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\nfrom fractions import gcd\\nimport math\\n\\n\\ndef main():\\n N, M = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n tmp = 1\\n count = None\\n for i in range(N):\\n tmp = (tmp * a[i] // 2) // gcd(tmp, a[i] // 2)\\n c = 0\\n n = a[i] // 2\\n while n % 2 == 0:\\n c += 1\\n n //= 2\\n if i == 0:\\n count = c\\n elif count != c:\\n print((0))\\n exit()\\n print(((M // tmp + 1) // 2))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from math import gcd\\n\\nN, M = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nB = [a // 2 for a in A]\\nLCM = 1\\nfor i in range(N):\\n LCM = LCM * B[i] // gcd(LCM, B[i])\\nfor i in range(N):\\n if LCM // B[i] % 2 == 0:\\n print((0))\\n exit()\\nprint(((M // LCM + 1) // 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-#!/usr/bin/env python3',\n", + " '-import sys',\n", + " '-from fractions import gcd',\n", + " '-import math',\n", + " '+from math import gcd',\n", + " '-',\n", + " '-def main():',\n", + " '- N, M = list(map(int, input().split()))',\n", + " '- a = list(map(int, input().split()))',\n", + " '- tmp = 1',\n", + " '- count = None',\n", + " '- for i in range(N):',\n", + " '- tmp = (tmp * a[i] // 2) // gcd(tmp, a[i] // 2)',\n", + " '- c = 0',\n", + " '- n = a[i] // 2',\n", + " '- while n % 2 == 0:',\n", + " '- c += 1',\n", + " '- n //= 2',\n", + " '- if i == 0:',\n", + " '- count = c',\n", + " '- elif count != c:',\n", + " '- print((0))',\n", + " '- exit()',\n", + " '- print(((M // tmp + 1) // 2))',\n", + " '-',\n", + " '-',\n", + " '-if __name__ == \"__main__\":',\n", + " '- main()',\n", + " '+N, M = list(map(int, input().split()))',\n", + " '+A = list(map(int, input().split()))',\n", + " '+B = [a // 2 for a in A]',\n", + " '+LCM = 1',\n", + " '+for i in range(N):',\n", + " '+ LCM = LCM * B[i] // gcd(LCM, B[i])',\n", + " '+for i in range(N):',\n", + " '+ if LCM // B[i] % 2 == 0:',\n", + " '+ print((0))',\n", + " '+ exit()',\n", + " '+print(((M // LCM + 1) // 2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4621698339,\n", + " 'measured_runtime_v1': 0.3237110667,\n", + " 'runtime_lift': 1.4277233045,\n", + " 'key': ['s657535199', 's415753878']},\n", + " {'user_id': 'u585963734',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's961921352',\n", + " 'submission_id_v1': 's631804156',\n", + " 'cpu_time_v0': 290,\n", + " 'cpu_time_v1': 180,\n", + " 'memory_v0': 48468,\n", + " 'memory_v1': 9168,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.93,\n", + " 'input': 'K=int(eval(input()))\\n\\n\\n\\nif K%2==0:\\n\\n print((-1))\\n\\n exit(0)\\n\\n \\n\\nans=[0]*(pow(10,6)+1)\\n\\nans[0]=0\\n\\n\\n\\nfor i in range(1,pow(10,6)):\\n\\n ans[i]=(ans[i-1]*10+7)%K\\n\\n if ans[i]==0:\\n\\n print(i)\\n\\n exit(0)\\n\\n\\n\\nprint((-1))',\n", + " 'target': 'import functools\\n\\n\\n\\nK=int(eval(input()))\\n\\n \\n\\nif K%2==0:\\n\\n print((-1))\\n\\n exit(0)\\n\\n\\n\\nmod=0\\n\\n\\n\\nfor i in range(1,pow(10,6)):\\n\\n mod=(mod*10+7)%K\\n\\n if mod==0:\\n\\n print(i)\\n\\n exit(0)\\n\\n \\n\\nprint((-1))',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 224,\n", + " 'code_v1_num_chars': 212,\n", + " 'code_v0_no_empty_lines': 'K = int(eval(input()))\\nif K % 2 == 0:\\n print((-1))\\n exit(0)\\nans = [0] * (pow(10, 6) + 1)\\nans[0] = 0\\nfor i in range(1, pow(10, 6)):\\n ans[i] = (ans[i - 1] * 10 + 7) % K\\n if ans[i] == 0:\\n print(i)\\n exit(0)\\nprint((-1))\\n',\n", + " 'code_v1_no_empty_lines': 'import functools\\n\\nK = int(eval(input()))\\nif K % 2 == 0:\\n print((-1))\\n exit(0)\\nmod = 0\\nfor i in range(1, pow(10, 6)):\\n mod = (mod * 10 + 7) % K\\n if mod == 0:\\n print(i)\\n exit(0)\\nprint((-1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.8823529412,\n", + " 'diff': ['+import functools',\n", + " '+',\n", + " '-ans = [0] * (pow(10, 6) + 1)',\n", + " '-ans[0] = 0',\n", + " '+mod = 0',\n", + " '- ans[i] = (ans[i - 1] * 10 + 7) % K',\n", + " '- if ans[i] == 0:',\n", + " '+ mod = (mod * 10 + 7) % K',\n", + " '+ if mod == 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7143074386,\n", + " 'measured_runtime_v1': 0.5444337668,\n", + " 'runtime_lift': 1.3120189858,\n", + " 'key': ['s961921352', 's631804156']},\n", + " {'user_id': 'u638456847',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's727719500',\n", + " 'submission_id_v1': 's621896362',\n", + " 'cpu_time_v0': 169,\n", + " 'cpu_time_v1': 115,\n", + " 'memory_v0': 29028,\n", + " 'memory_v1': 3464,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 31.95,\n", + " 'input': 'import numpy as np\\n\\n\\n\\ndef main():\\n\\n N = int(eval(input()))\\n\\n\\n\\n INF = 10**6 + 100\\n\\n\\n\\n x = np.arange(1,INF,dtype=np.int64)\\n\\n div = x[N % x == 0]\\n\\n #print(div)\\n\\n #print(N // div)\\n\\n \\n\\n ans = (div + N//div).min() - 2\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\nfrom math import sqrt\\n\\n\\n\\ndef divisor_enumeration(n):\\n\\n div = []\\n\\n for i in range(1, int(sqrt(n))+1):\\n\\n if n % i == 0:\\n\\n if n // i != i:\\n\\n div.append((i, n // i))\\n\\n else:\\n\\n div.append((i, i))\\n\\n \\n\\n return div\\n\\n\\n\\n\\n\\ndef main():\\n\\n N = int(readline())\\n\\n\\n\\n d = divisor_enumeration(N)\\n\\n \\n\\n ans = 10**15\\n\\n for x, y in d:\\n\\n ans = min(ans, x + y - 2)\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 290,\n", + " 'code_v1_num_chars': 600,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n\\ndef main():\\n N = int(eval(input()))\\n INF = 10**6 + 100\\n x = np.arange(1, INF, dtype=np.int64)\\n div = x[N % x == 0]\\n # print(div)\\n # print(N // div)\\n ans = (div + N // div).min() - 2\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nfrom math import sqrt\\n\\n\\ndef divisor_enumeration(n):\\n div = []\\n for i in range(1, int(sqrt(n)) + 1):\\n if n % i == 0:\\n if n // i != i:\\n div.append((i, n // i))\\n else:\\n div.append((i, i))\\n return div\\n\\n\\ndef main():\\n N = int(readline())\\n d = divisor_enumeration(N)\\n ans = 10**15\\n for x, y in d:\\n ans = min(ans, x + y - 2)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 45.4545454545,\n", + " 'diff': ['-import numpy as np',\n", + " '+import sys',\n", + " '+',\n", + " '+read = sys.stdin.read',\n", + " '+readline = sys.stdin.readline',\n", + " '+readlines = sys.stdin.readlines',\n", + " '+from math import sqrt',\n", + " '+',\n", + " '+',\n", + " '+def divisor_enumeration(n):',\n", + " '+ div = []',\n", + " '+ for i in range(1, int(sqrt(n)) + 1):',\n", + " '+ if n % i == 0:',\n", + " '+ if n // i != i:',\n", + " '+ div.append((i, n // i))',\n", + " '+ else:',\n", + " '+ div.append((i, i))',\n", + " '+ return div',\n", + " '- N = int(eval(input()))',\n", + " '- INF = 10**6 + 100',\n", + " '- x = np.arange(1, INF, dtype=np.int64)',\n", + " '- div = x[N % x == 0]',\n", + " '- # print(div)',\n", + " '- # print(N // div)',\n", + " '- ans = (div + N // div).min() - 2',\n", + " '+ N = int(readline())',\n", + " '+ d = divisor_enumeration(N)',\n", + " '+ ans = 10**15',\n", + " '+ for x, y in d:',\n", + " '+ ans = min(ans, x + y - 2)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9439773376,\n", + " 'measured_runtime_v1': 0.2817540879,\n", + " 'runtime_lift': 6.8995532659,\n", + " 'key': ['s727719500', 's621896362']},\n", + " {'user_id': 'u075012704',\n", + " 'problem_id': 'p02863',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's881828060',\n", + " 'submission_id_v1': 's407504441',\n", + " 'cpu_time_v0': 601,\n", + " 'cpu_time_v1': 526,\n", + " 'memory_v0': 119000,\n", + " 'memory_v1': 119000,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.48,\n", + " 'input': 'N, W = list(map(int, input().split()))\\n\\nitems = sorted([list(map(int, input().split())) for i in range(N)])\\n\\n\\n\\n# dp1[i][j] := 商品0 ~ i が対象\\n\\ndp = [[0] * (W + 1) for i in range(N + 1)]\\n\\n\\n\\n# dpテーブルを埋める\\n\\nfor i in range(N):\\n\\n wi, vi = items[i]\\n\\n for j in range(W + 1):\\n\\n if j + wi <= W:\\n\\n dp[i + 1][j + wi] = max(dp[i + 1][j + wi], dp[i][j] + vi)\\n\\n dp[i + 1][j] = max(dp[i][j], dp[i + 1][j])\\n\\n\\n\\n\\n\\nans = 0\\n\\nfor i, (wi, vi) in enumerate(items):\\n\\n for j in range(W):\\n\\n ans = max(ans, dp[i][j] + vi)\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'N, W = list(map(int, input().split()))\\n\\nitems = sorted([list(map(int, input().split())) for i in range(N)])\\n\\n\\n\\n# dp1[i][j] := 商品0 ~ i が対象\\n\\ndp = [[0] * (W + 1) for i in range(N + 1)]\\n\\n\\n\\n# dpテーブルを埋める\\n\\nfor i in range(N):\\n\\n wi, vi = items[i]\\n\\n for j in range(W + 1):\\n\\n if j + wi <= W:\\n\\n dp[i + 1][j + wi] = max(dp[i + 1][j + wi], dp[i][j] + vi)\\n\\n dp[i + 1][j] = max(dp[i][j], dp[i + 1][j])\\n\\n\\n\\n\\n\\nans = 0\\n\\nfor i, (wi, vi) in enumerate(items):\\n\\n ans = max(ans, dp[i][W - 1] + vi)\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 539,\n", + " 'code_v1_num_chars': 515,\n", + " 'code_v0_no_empty_lines': 'N, W = list(map(int, input().split()))\\nitems = sorted([list(map(int, input().split())) for i in range(N)])\\n# dp1[i][j] := 商品0 ~ i が対象\\ndp = [[0] * (W + 1) for i in range(N + 1)]\\n# dpテーブルを埋める\\nfor i in range(N):\\n wi, vi = items[i]\\n for j in range(W + 1):\\n if j + wi <= W:\\n dp[i + 1][j + wi] = max(dp[i + 1][j + wi], dp[i][j] + vi)\\n dp[i + 1][j] = max(dp[i][j], dp[i + 1][j])\\nans = 0\\nfor i, (wi, vi) in enumerate(items):\\n for j in range(W):\\n ans = max(ans, dp[i][j] + vi)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, W = list(map(int, input().split()))\\nitems = sorted([list(map(int, input().split())) for i in range(N)])\\n# dp1[i][j] := 商品0 ~ i が対象\\ndp = [[0] * (W + 1) for i in range(N + 1)]\\n# dpテーブルを埋める\\nfor i in range(N):\\n wi, vi = items[i]\\n for j in range(W + 1):\\n if j + wi <= W:\\n dp[i + 1][j + wi] = max(dp[i + 1][j + wi], dp[i][j] + vi)\\n dp[i + 1][j] = max(dp[i][j], dp[i + 1][j])\\nans = 0\\nfor i, (wi, vi) in enumerate(items):\\n ans = max(ans, dp[i][W - 1] + vi)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.7619047619,\n", + " 'diff': ['- for j in range(W):',\n", + " '- ans = max(ans, dp[i][j] + vi)',\n", + " '+ ans = max(ans, dp[i][W - 1] + vi)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2747145832,\n", + " 'measured_runtime_v1': 0.2133797197,\n", + " 'runtime_lift': 1.2874446713,\n", + " 'key': ['s881828060', 's407504441']},\n", + " {'user_id': 'u049979154',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's167074309',\n", + " 'submission_id_v1': 's223988235',\n", + " 'cpu_time_v0': 207,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.34,\n", + " 'input': \"a, b, c, x, y = list(map(int, input().split()))\\n\\n\\n\\nans = float('inf')\\n\\n\\n\\nfor i in range(2 * 10**5 + 1):\\n\\n ans = min(ans, a * max(x - i, 0) + b * max(y - i, 0) + 2 * c * i)\\n\\n\\n\\nprint(ans)\",\n", + " 'target': 'A,B,C,X,Y = list(map(int,input().split()))\\n\\nmin_xy = min(X,Y)\\n\\nmax_xy = max(X,Y)\\n\\nans1 = 2 * C * min_xy + A * (X-min_xy) + B * (Y-min_xy) # 無駄にならない範囲でABピザを買い、残りを買う\\n\\nans2 = A*X + B*Y # ABピザを買わない\\n\\nans3 = 2 * C * max_xy # ABピザだけを買う\\n\\nprint((min(ans1,ans2,ans3)))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 182,\n", + " 'code_v1_num_chars': 251,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in range(2 * 10**5 + 1):\\n ans = min(ans, a * max(x - i, 0) + b * max(y - i, 0) + 2 * c * i)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nmin_xy = min(X, Y)\\nmax_xy = max(X, Y)\\nans1 = 2 * C * min_xy + A * (X - min_xy) + B * (Y - min_xy) # 無駄にならない範囲でABピザを買い、残りを買う\\nans2 = A * X + B * Y # ABピザを買わない\\nans3 = 2 * C * max_xy # ABピザだけを買う\\nprint((min(ans1, ans2, ans3)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-a, b, c, x, y = list(map(int, input().split()))',\n", + " '-ans = float(\"inf\")',\n", + " '-for i in range(2 * 10**5 + 1):',\n", + " '- ans = min(ans, a * max(x - i, 0) + b * max(y - i, 0) + 2 * c * i)',\n", + " '-print(ans)',\n", + " '+A, B, C, X, Y = list(map(int, input().split()))',\n", + " '+min_xy = min(X, Y)',\n", + " '+max_xy = max(X, Y)',\n", + " '+ans1 = 2 * C * min_xy + A * (X - min_xy) + B * (Y - min_xy) # 無駄にならない範囲でABピザを買い、残りを買う',\n", + " '+ans2 = A * X + B * Y # ABピザを買わない',\n", + " '+ans3 = 2 * C * max_xy # ABピザだけを買う',\n", + " '+print((min(ans1, ans2, ans3)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9003799064,\n", + " 'measured_runtime_v1': 0.2384188967,\n", + " 'runtime_lift': 7.9707604256,\n", + " 'key': ['s167074309', 's223988235']},\n", + " {'user_id': 'u414980766',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's498649498',\n", + " 'submission_id_v1': 's794455280',\n", + " 'cpu_time_v0': 480,\n", + " 'cpu_time_v1': 421,\n", + " 'memory_v0': 47872,\n", + " 'memory_v1': 43256,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.29,\n", + " 'input': \"import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\nN = int(readline())\\n\\nS = read().split()\\n\\n\\n\\nS = sorted(S)\\n\\nls = [[] for i in range(N + 1)]\\n\\nmax_num = 0\\n\\nleft = 0\\n\\nright = 0\\n\\nwhile right < N:\\n\\n while right < N and S[left] == S[right]:\\n\\n right += 1\\n\\n if (right - left) >= max_num:\\n\\n ls[right - left].append(S[left].decode())\\n\\n max_num = right - left\\n\\n left = right\\n\\n \\n\\nprint(('\\\\n'.join(ls[max_num])))\\n\",\n", + " 'target': \"from collections import Counter\\n\\n\\n\\nimport sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\nN = int(readline())\\n\\nS = read().split()\\n\\n\\n\\nres = []\\n\\nc = Counter(S)\\n\\nmax_num = c.most_common(1)[0][1]\\n\\nfor i, j in list(c.items()):\\n\\n if j == max_num:\\n\\n res.append(i)\\n\\n \\n\\nres.sort()\\n\\n\\n\\n \\n\\nprint(('\\\\n'.join(list([x.decode() for x in res]))))\\n\",\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 502,\n", + " 'code_v1_num_chars': 421,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nN = int(readline())\\nS = read().split()\\nS = sorted(S)\\nls = [[] for i in range(N + 1)]\\nmax_num = 0\\nleft = 0\\nright = 0\\nwhile right < N:\\n while right < N and S[left] == S[right]:\\n right += 1\\n if (right - left) >= max_num:\\n ls[right - left].append(S[left].decode())\\n max_num = right - left\\n left = right\\nprint((\"\\\\n\".join(ls[max_num])))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\nimport sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nN = int(readline())\\nS = read().split()\\nres = []\\nc = Counter(S)\\nmax_num = c.most_common(1)[0][1]\\nfor i, j in list(c.items()):\\n if j == max_num:\\n res.append(i)\\nres.sort()\\nprint((\"\\\\n\".join(list([x.decode() for x in res]))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.7619047619,\n", + " 'diff': ['+from collections import Counter',\n", + " '-S = sorted(S)',\n", + " '-ls = [[] for i in range(N + 1)]',\n", + " '-max_num = 0',\n", + " '-left = 0',\n", + " '-right = 0',\n", + " '-while right < N:',\n", + " '- while right < N and S[left] == S[right]:',\n", + " '- right += 1',\n", + " '- if (right - left) >= max_num:',\n", + " '- ls[right - left].append(S[left].decode())',\n", + " '- max_num = right - left',\n", + " '- left = right',\n", + " '-print((\"\\\\n\".join(ls[max_num])))',\n", + " '+res = []',\n", + " '+c = Counter(S)',\n", + " '+max_num = c.most_common(1)[0][1]',\n", + " '+for i, j in list(c.items()):',\n", + " '+ if j == max_num:',\n", + " '+ res.append(i)',\n", + " '+res.sort()',\n", + " '+print((\"\\\\n\".join(list([x.decode() for x in res]))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2394288239,\n", + " 'measured_runtime_v1': 0.0062145643,\n", + " 'runtime_lift': 38.5270488971,\n", + " 'key': ['s498649498', 's794455280']},\n", + " {'user_id': 'u185948224',\n", + " 'problem_id': 'p02873',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's874712614',\n", + " 'submission_id_v1': 's975354355',\n", + " 'cpu_time_v0': 481,\n", + " 'cpu_time_v1': 429,\n", + " 'memory_v0': 27676,\n", + " 'memory_v1': 27548,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.81,\n", + " 'input': \"S = eval(input())\\n\\n\\n\\nlst = [1 if S[0]=='<' else -1]\\n\\nfor i in range(1, len(S)):\\n\\n if S[i] == S[i - 1]:\\n\\n lst[-1] += 1 if S[i]=='<' else -1\\n\\n else:\\n\\n lst.append(-1 if S[i]=='>' else 1)\\n\\n \\n\\nans = [0]\\n\\n\\n\\nfor i in range(len(lst)):\\n\\n if lst[i] > 0:\\n\\n ans += list(range(1,lst[i]+1))\\n\\n else:\\n\\n ans[-1] = max(ans[-1], -lst[i])\\n\\n ans += list(range(-lst[i]-1,-1, -1))\\n\\n\\n\\nprint((sum(ans)))\\n\",\n", + " 'target': \"S = eval(input())\\n\\n\\n\\nlst = [1 if S[0]=='<' else -1]\\n\\nfor i in range(1, len(S)):\\n\\n if S[i] == S[i - 1]:\\n\\n lst[-1] += 1 if S[i]=='<' else -1\\n\\n else:\\n\\n lst.append(-1 if S[i]=='>' else 1)\\n\\n \\n\\nans = [0]\\n\\n\\n\\nfor i in lst:\\n\\n if i > 0:\\n\\n ans += list(range(1,i+1))\\n\\n else:\\n\\n ans[-1] = max(ans[-1], -i)\\n\\n ans += list(range(-i-1,-1, -1))\\n\\n\\n\\n\\n\\nprint((sum(ans)))\",\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 425,\n", + " 'code_v1_num_chars': 394,\n", + " 'code_v0_no_empty_lines': 'S = eval(input())\\nlst = [1 if S[0] == \"<\" else -1]\\nfor i in range(1, len(S)):\\n if S[i] == S[i - 1]:\\n lst[-1] += 1 if S[i] == \"<\" else -1\\n else:\\n lst.append(-1 if S[i] == \">\" else 1)\\nans = [0]\\nfor i in range(len(lst)):\\n if lst[i] > 0:\\n ans += list(range(1, lst[i] + 1))\\n else:\\n ans[-1] = max(ans[-1], -lst[i])\\n ans += list(range(-lst[i] - 1, -1, -1))\\nprint((sum(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nlst = [1 if S[0] == \"<\" else -1]\\nfor i in range(1, len(S)):\\n if S[i] == S[i - 1]:\\n lst[-1] += 1 if S[i] == \"<\" else -1\\n else:\\n lst.append(-1 if S[i] == \">\" else 1)\\nans = [0]\\nfor i in lst:\\n if i > 0:\\n ans += list(range(1, i + 1))\\n else:\\n ans[-1] = max(ans[-1], -i)\\n ans += list(range(-i - 1, -1, -1))\\nprint((sum(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.0,\n", + " 'diff': ['-for i in range(len(lst)):',\n", + " '- if lst[i] > 0:',\n", + " '- ans += list(range(1, lst[i] + 1))',\n", + " '+for i in lst:',\n", + " '+ if i > 0:',\n", + " '+ ans += list(range(1, i + 1))',\n", + " '- ans[-1] = max(ans[-1], -lst[i])',\n", + " '- ans += list(range(-lst[i] - 1, -1, -1))',\n", + " '+ ans[-1] = max(ans[-1], -i)',\n", + " '+ ans += list(range(-i - 1, -1, -1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2820563465,\n", + " 'measured_runtime_v1': 0.2050767321,\n", + " 'runtime_lift': 1.3753698122,\n", + " 'key': ['s874712614', 's975354355']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's637446217',\n", + " 'submission_id_v1': 's864775628',\n", + " 'cpu_time_v0': 111,\n", + " 'cpu_time_v1': 46,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 58.56,\n", + " 'input': 'a, b = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor x in range(a, b + 1):\\n\\n s = str(x)\\n\\n l = len(s)\\n\\n flg = True\\n\\n for i in range(l // 2):\\n\\n if s[i] != s[l - 1 - i]:\\n\\n flg = False\\n\\n break\\n\\n if flg:\\n\\n cnt += 1\\n\\nprint(cnt)\\n',\n", + " 'target': 'a, b = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor i in range(a, b + 1):\\n\\n s = str(i)\\n\\n if s[0] == s[4] and s[1] == s[3]:\\n\\n cnt += 1\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 267,\n", + " 'code_v1_num_chars': 153,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().split()))\\ncnt = 0\\nfor x in range(a, b + 1):\\n s = str(x)\\n l = len(s)\\n flg = True\\n for i in range(l // 2):\\n if s[i] != s[l - 1 - i]:\\n flg = False\\n break\\n if flg:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(a, b + 1):\\n s = str(i)\\n if s[0] == s[4] and s[1] == s[3]:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 46.1538461538,\n", + " 'diff': ['-for x in range(a, b + 1):',\n", + " '- s = str(x)',\n", + " '- l = len(s)',\n", + " '- flg = True',\n", + " '- for i in range(l // 2):',\n", + " '- if s[i] != s[l - 1 - i]:',\n", + " '- flg = False',\n", + " '- break',\n", + " '- if flg:',\n", + " '+for i in range(a, b + 1):',\n", + " '+ s = str(i)',\n", + " '+ if s[0] == s[4] and s[1] == s[3]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.334243765,\n", + " 'measured_runtime_v1': 0.2510879046,\n", + " 'runtime_lift': 1.3311822625,\n", + " 'key': ['s637446217', 's864775628']},\n", + " {'user_id': 'u747602774',\n", + " 'problem_id': 'p03039',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's108635717',\n", + " 'submission_id_v1': 's387237372',\n", + " 'cpu_time_v0': 543,\n", + " 'cpu_time_v1': 230,\n", + " 'memory_v0': 9432,\n", + " 'memory_v1': 9412,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 57.64,\n", + " 'input': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\n#mod = 998244353\\n\\nINF = 10**18\\n\\neps = 10**-7\\n\\n\\n\\nm,n,k = list(map(int,readline().split()))\\n\\n\\n\\ndef comb(n, r, mod):\\n\\n r = min(r, n-r)\\n\\n mol = 1\\n\\n deno = 1\\n\\n for i in range(1, r+1):\\n\\n mol = mol * (n-r+i) % mod\\n\\n deno = deno * i % mod\\n\\n ret = mol * pow(deno, mod-2, mod) % mod\\n\\n return ret\\n\\n\\n\\ndef f1(x,y,a,b):\\n\\n return (a+b-x-y)*(a-x+1)*(b-y+1)//2\\n\\n\\n\\ndef f2(x,a):\\n\\n return (a-x)*(a-x+1)//2\\n\\n\\n\\nans = 0\\n\\n\\n\\nfor x in range(1,n+1):\\n\\n for y in range(1,m+1):\\n\\n ans += f1(x,y,n,m)+f1(1,1,x,y)+f1(1,y,x,m)+f1(x,1,n,y)\\n\\n ans -= f2(x,n) + f2(1,x) + f2(1,y) + f2(y,m)\\n\\n ans %= mod\\n\\n\\n\\nans = (ans * comb(m*n-2,k-2,mod))%mod\\n\\nans = ans*pow(2,mod-2,mod)%mod\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\n#mod = 998244353\\n\\nINF = 10**18\\n\\neps = 10**-7\\n\\n\\n\\nm,n,k = list(map(int,readline().split()))\\n\\n\\n\\ndef comb(n, r, mod):\\n\\n r = min(r, n-r)\\n\\n mol = 1\\n\\n deno = 1\\n\\n for i in range(1, r+1):\\n\\n mol = mol * (n-r+i) % mod\\n\\n deno = deno * i % mod\\n\\n ret = mol * pow(deno, mod-2, mod) % mod\\n\\n return ret\\n\\n\\n\\ndef f1(x,y,a,b):\\n\\n return (a+b-x-y)*(a-x+1)*(b-y+1)//2\\n\\n\\n\\ndef f2(x,a):\\n\\n return (a-x)*(a-x+1)//2\\n\\n\\n\\nans = 0\\n\\n\\n\\nfor x in range(1,n+1):\\n\\n for y in range(1,m+1):\\n\\n a = n-x+1\\n\\n b = m-y+1\\n\\n c = m*(a*(a-1)+x*(x-1))\\n\\n d = n*(b*(b-1)+y*(y-1))\\n\\n ans += (c+d)//2\\n\\n ans %= mod\\n\\n\\n\\nans = (ans * comb(m*n-2,k-2,mod))%mod\\n\\nans = ans*pow(2,mod-2,mod)%mod\\n\\n\\n\\nprint(ans)\\n\\n\\n',\n", + " 'code_v0_loc': 38,\n", + " 'code_v1_loc': 42,\n", + " 'code_v0_num_chars': 796,\n", + " 'code_v1_num_chars': 809,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n# mod = 998244353\\nINF = 10**18\\neps = 10**-7\\nm, n, k = list(map(int, readline().split()))\\n\\n\\ndef comb(n, r, mod):\\n r = min(r, n - r)\\n mol = 1\\n deno = 1\\n for i in range(1, r + 1):\\n mol = mol * (n - r + i) % mod\\n deno = deno * i % mod\\n ret = mol * pow(deno, mod - 2, mod) % mod\\n return ret\\n\\n\\ndef f1(x, y, a, b):\\n return (a + b - x - y) * (a - x + 1) * (b - y + 1) // 2\\n\\n\\ndef f2(x, a):\\n return (a - x) * (a - x + 1) // 2\\n\\n\\nans = 0\\nfor x in range(1, n + 1):\\n for y in range(1, m + 1):\\n ans += f1(x, y, n, m) + f1(1, 1, x, y) + f1(1, y, x, m) + f1(x, 1, n, y)\\n ans -= f2(x, n) + f2(1, x) + f2(1, y) + f2(y, m)\\n ans %= mod\\nans = (ans * comb(m * n - 2, k - 2, mod)) % mod\\nans = ans * pow(2, mod - 2, mod) % mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n# mod = 998244353\\nINF = 10**18\\neps = 10**-7\\nm, n, k = list(map(int, readline().split()))\\n\\n\\ndef comb(n, r, mod):\\n r = min(r, n - r)\\n mol = 1\\n deno = 1\\n for i in range(1, r + 1):\\n mol = mol * (n - r + i) % mod\\n deno = deno * i % mod\\n ret = mol * pow(deno, mod - 2, mod) % mod\\n return ret\\n\\n\\ndef f1(x, y, a, b):\\n return (a + b - x - y) * (a - x + 1) * (b - y + 1) // 2\\n\\n\\ndef f2(x, a):\\n return (a - x) * (a - x + 1) // 2\\n\\n\\nans = 0\\nfor x in range(1, n + 1):\\n for y in range(1, m + 1):\\n a = n - x + 1\\n b = m - y + 1\\n c = m * (a * (a - 1) + x * (x - 1))\\n d = n * (b * (b - 1) + y * (y - 1))\\n ans += (c + d) // 2\\n ans %= mod\\nans = (ans * comb(m * n - 2, k - 2, mod)) % mod\\nans = ans * pow(2, mod - 2, mod) % mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.5238095238,\n", + " 'diff': ['- ans += f1(x, y, n, m) + f1(1, 1, x, y) + f1(1, y, x, m) + f1(x, 1, n, y)',\n", + " '- ans -= f2(x, n) + f2(1, x) + f2(1, y) + f2(y, m)',\n", + " '+ a = n - x + 1',\n", + " '+ b = m - y + 1',\n", + " '+ c = m * (a * (a - 1) + x * (x - 1))',\n", + " '+ d = n * (b * (b - 1) + y * (y - 1))',\n", + " '+ ans += (c + d) // 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4582999928,\n", + " 'measured_runtime_v1': 0.3618569455,\n", + " 'runtime_lift': 1.2665225816,\n", + " 'key': ['s108635717', 's387237372']},\n", + " {'user_id': 'u977389981',\n", + " 'problem_id': 'p03720',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's310815601',\n", + " 'submission_id_v1': 's089084009',\n", + " 'cpu_time_v0': 25,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 32.0,\n", + " 'input': 'n, m = list(map(int, input().split()))\\n\\ndp = [0] * n\\n\\nfor i in range(m):\\n\\n x, y = list(map(int, input().split()))\\n\\n dp[x - 1] += 1\\n\\n dp[y - 1] += 1\\n\\nfor i in range(n):\\n\\n print((dp[i]))',\n", + " 'target': 'n, m = list(map(int, input().split()))\\n\\nA = [0] * n\\n\\nfor i in range(m):\\n\\n a, b = list(map(int, input().split()))\\n\\n A[a - 1] += 1\\n\\n A[b - 1] += 1\\n\\n \\n\\nfor i in range(n):\\n\\n print((A[i]))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 182,\n", + " 'code_v1_num_chars': 184,\n", + " 'code_v0_no_empty_lines': 'n, m = list(map(int, input().split()))\\ndp = [0] * n\\nfor i in range(m):\\n x, y = list(map(int, input().split()))\\n dp[x - 1] += 1\\n dp[y - 1] += 1\\nfor i in range(n):\\n print((dp[i]))\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nA = [0] * n\\nfor i in range(m):\\n a, b = list(map(int, input().split()))\\n A[a - 1] += 1\\n A[b - 1] += 1\\nfor i in range(n):\\n print((A[i]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-dp = [0] * n',\n", + " '+A = [0] * n',\n", + " '- x, y = list(map(int, input().split()))',\n", + " '- dp[x - 1] += 1',\n", + " '- dp[y - 1] += 1',\n", + " '+ a, b = list(map(int, input().split()))',\n", + " '+ A[a - 1] += 1',\n", + " '+ A[b - 1] += 1',\n", + " '- print((dp[i]))',\n", + " '+ print((A[i]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2766861832,\n", + " 'measured_runtime_v1': 0.17692909,\n", + " 'runtime_lift': 1.5638252769,\n", + " 'key': ['s310815601', 's089084009']},\n", + " {'user_id': 'u474423089',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's795258153',\n", + " 'submission_id_v1': 's793995977',\n", + " 'cpu_time_v0': 206,\n", + " 'cpu_time_v1': 23,\n", + " 'memory_v0': 14300,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.83,\n", + " 'input': \"import numpy as np\\n\\nfrom scipy.sparse.csgraph import connected_components\\n\\nfrom scipy.sparse import csr_matrix\\n\\ndef main():\\n\\n n,m=list(map(int,input().split(' ')))\\n\\n graph=[[0 for i in range(n)] for j in range(n)]\\n\\n graph_del=[]\\n\\n ans = 0\\n\\n\\n\\n for i in range(m):\\n\\n e_1,e_2=list(map(int,input().split(' ')))\\n\\n graph[e_1-1][e_2-1]=1\\n\\n graph[e_2-1][e_1-1]=1\\n\\n graph_del.append((e_1,e_2))\\n\\n\\n\\n for i,j in graph_del:\\n\\n graph[i-1][j-1]=0\\n\\n graph[j-1][i-1]=0\\n\\n if connected_components(np.array(graph),return_labels=False)!=1:\\n\\n ans += 1\\n\\n graph[i-1][j-1]=1\\n\\n graph[j-1][i-1]=1\\n\\n print(ans)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"class UnionFind:\\n\\n def __init__(self,N):\\n\\n self.par =[-1 for i in range(N)]\\n\\n def find(self,x):\\n\\n if self.par[x] < 0:\\n\\n return x\\n\\n else:\\n\\n self.par[x] = self.find(self.par[x])\\n\\n return self.par[x]\\n\\n\\n\\n def unite(self,x,y):\\n\\n x = self.find(x)\\n\\n y = self.find(y)\\n\\n if x==y:\\n\\n return\\n\\n if self.par[x] > self.par[y]:\\n\\n x,y = y,x\\n\\n self.par[x] +=self.par[y]\\n\\n self.par[y] = x\\n\\n\\n\\n def size(self,x):\\n\\n return -self.par[self.find(x)]\\n\\n def same(self,x,y):\\n\\n return self.find(x)==self.find(y)\\n\\n\\n\\nN,M=list(map(int,input().split(' ')))\\n\\nq = [list(map(int,input().split(' '))) for i in range(M)]\\n\\nans = 0\\n\\nfor i in range(M):\\n\\n tmp = q[:i]+q[i+1:]\\n\\n uf = UnionFind(N)\\n\\n for j,k in tmp:\\n\\n uf.unite(j-1,k-1)\\n\\n for l in range(N):\\n\\n if uf.size(l) != N:\\n\\n ans += 1\\n\\n break\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 38,\n", + " 'code_v0_num_chars': 712,\n", + " 'code_v1_num_chars': 954,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nfrom scipy.sparse.csgraph import connected_components\\nfrom scipy.sparse import csr_matrix\\n\\n\\ndef main():\\n n, m = list(map(int, input().split(\" \")))\\n graph = [[0 for i in range(n)] for j in range(n)]\\n graph_del = []\\n ans = 0\\n for i in range(m):\\n e_1, e_2 = list(map(int, input().split(\" \")))\\n graph[e_1 - 1][e_2 - 1] = 1\\n graph[e_2 - 1][e_1 - 1] = 1\\n graph_del.append((e_1, e_2))\\n for i, j in graph_del:\\n graph[i - 1][j - 1] = 0\\n graph[j - 1][i - 1] = 0\\n if connected_components(np.array(graph), return_labels=False) != 1:\\n ans += 1\\n graph[i - 1][j - 1] = 1\\n graph[j - 1][i - 1] = 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'class UnionFind:\\n def __init__(self, N):\\n self.par = [-1 for i in range(N)]\\n\\n def find(self, x):\\n if self.par[x] < 0:\\n return x\\n else:\\n self.par[x] = self.find(self.par[x])\\n return self.par[x]\\n\\n def unite(self, x, y):\\n x = self.find(x)\\n y = self.find(y)\\n if x == y:\\n return\\n if self.par[x] > self.par[y]:\\n x, y = y, x\\n self.par[x] += self.par[y]\\n self.par[y] = x\\n\\n def size(self, x):\\n return -self.par[self.find(x)]\\n\\n def same(self, x, y):\\n return self.find(x) == self.find(y)\\n\\n\\nN, M = list(map(int, input().split(\" \")))\\nq = [list(map(int, input().split(\" \"))) for i in range(M)]\\nans = 0\\nfor i in range(M):\\n tmp = q[:i] + q[i + 1 :]\\n uf = UnionFind(N)\\n for j, k in tmp:\\n uf.unite(j - 1, k - 1)\\n for l in range(N):\\n if uf.size(l) != N:\\n ans += 1\\n break\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.6842105263,\n", + " 'diff': ['-import numpy as np',\n", + " '-from scipy.sparse.csgraph import connected_components',\n", + " '-from scipy.sparse import csr_matrix',\n", + " '+class UnionFind:',\n", + " '+ def __init__(self, N):',\n", + " '+ self.par = [-1 for i in range(N)]',\n", + " '+',\n", + " '+ def find(self, x):',\n", + " '+ if self.par[x] < 0:',\n", + " '+ return x',\n", + " '+ else:',\n", + " '+ self.par[x] = self.find(self.par[x])',\n", + " '+ return self.par[x]',\n", + " '+',\n", + " '+ def unite(self, x, y):',\n", + " '+ x = self.find(x)',\n", + " '+ y = self.find(y)',\n", + " '+ if x == y:',\n", + " '+ return',\n", + " '+ if self.par[x] > self.par[y]:',\n", + " '+ x, y = y, x',\n", + " '+ self.par[x] += self.par[y]',\n", + " '+ self.par[y] = x',\n", + " '+',\n", + " '+ def size(self, x):',\n", + " '+ return -self.par[self.find(x)]',\n", + " '+',\n", + " '+ def same(self, x, y):',\n", + " '+ return self.find(x) == self.find(y)',\n", + " '-def main():',\n", + " '- n, m = list(map(int, input().split(\" \")))',\n", + " '- graph = [[0 for i in range(n)] for j in range(n)]',\n", + " '- graph_del = []',\n", + " '- ans = 0',\n", + " '- for i in range(m):',\n", + " '- e_1, e_2 = list(map(int, input().split(\" \")))',\n", + " '- graph[e_1 - 1][e_2 - 1] = 1',\n", + " '- graph[e_2 - 1][e_1 - 1] = 1',\n", + " '- graph_del.append((e_1, e_2))',\n", + " '- for i, j in graph_del:',\n", + " '- graph[i - 1][j - 1] = 0',\n", + " '- graph[j - 1][i - 1] = 0',\n", + " '- if connected_components(np.array(graph), return_labels=False) != 1:',\n", + " '+N, M = list(map(int, input().split(\" \")))',\n", + " '+q = [list(map(int, input().split(\" \"))) for i in range(M)]',\n", + " '+ans = 0',\n", + " '+for i in range(M):',\n", + " '+ tmp = q[:i] + q[i + 1 :]',\n", + " '+ uf = UnionFind(N)',\n", + " '+ for j, k in tmp:',\n", + " '+ uf.unite(j - 1, k - 1)',\n", + " '+ for l in range(N):',\n", + " '+ if uf.size(l) != N:',\n", + " '- graph[i - 1][j - 1] = 1',\n", + " '- graph[j - 1][i - 1] = 1',\n", + " '- print(ans)',\n", + " '-',\n", + " '-',\n", + " '-if __name__ == \"__main__\":',\n", + " '- main()',\n", + " '+ break',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9810539348,\n", + " 'measured_runtime_v1': 0.2057695253,\n", + " 'runtime_lift': 9.6275380522,\n", + " 'key': ['s795258153', 's793995977']},\n", + " {'user_id': 'u328364772',\n", + " 'problem_id': 'p02982',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's700480138',\n", + " 'submission_id_v1': 's244745375',\n", + " 'cpu_time_v0': 164,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 13336,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.63,\n", + " 'input': 'import math\\n\\nimport numpy as np\\n\\n\\n\\nn, d = list(map(int, input().split()))\\n\\n\\n\\nx = np.zeros([n, d])\\n\\n\\n\\nfor i in range(n):\\n\\n line = list(map(int, input().split()))\\n\\n for j in range(d):\\n\\n x[i, j] = line[j]\\n\\n\\n\\ncnt = 0\\n\\n\\n\\nfor i in range(n):\\n\\n for j in range(i+1, n):\\n\\n xx = (x[i] - x[j]) ** 2\\n\\n dist = math.sqrt(xx.sum())\\n\\n if dist % 1 == 0:\\n\\n cnt += 1\\n\\n\\n\\nprint(cnt)',\n", + " 'target': 'import math\\n\\n\\n\\nn, d = list(map(int, input().split()))\\n\\n\\n\\nx = [list(map(int, input().split())) for i in range(n)]\\n\\n\\n\\ncnt = 0\\n\\n\\n\\nfor i in range(n):\\n\\n for j in range(i+1, n):\\n\\n dist = 0\\n\\n for k in range(d):\\n\\n dist += (x[i][k] - x[j][k]) ** 2\\n\\n if math.sqrt(dist).is_integer():\\n\\n cnt += 1\\n\\n\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 402,\n", + " 'code_v1_num_chars': 338,\n", + " 'code_v0_no_empty_lines': 'import math\\nimport numpy as np\\n\\nn, d = list(map(int, input().split()))\\nx = np.zeros([n, d])\\nfor i in range(n):\\n line = list(map(int, input().split()))\\n for j in range(d):\\n x[i, j] = line[j]\\ncnt = 0\\nfor i in range(n):\\n for j in range(i + 1, n):\\n xx = (x[i] - x[j]) ** 2\\n dist = math.sqrt(xx.sum())\\n if dist % 1 == 0:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nn, d = list(map(int, input().split()))\\nx = [list(map(int, input().split())) for i in range(n)]\\ncnt = 0\\nfor i in range(n):\\n for j in range(i + 1, n):\\n dist = 0\\n for k in range(d):\\n dist += (x[i][k] - x[j][k]) ** 2\\n if math.sqrt(dist).is_integer():\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.7272727273,\n", + " 'diff': ['-import numpy as np',\n", + " '-x = np.zeros([n, d])',\n", + " '-for i in range(n):',\n", + " '- line = list(map(int, input().split()))',\n", + " '- for j in range(d):',\n", + " '- x[i, j] = line[j]',\n", + " '+x = [list(map(int, input().split())) for i in range(n)]',\n", + " '- xx = (x[i] - x[j]) ** 2',\n", + " '- dist = math.sqrt(xx.sum())',\n", + " '- if dist % 1 == 0:',\n", + " '+ dist = 0',\n", + " '+ for k in range(d):',\n", + " '+ dist += (x[i][k] - x[j][k]) ** 2',\n", + " '+ if math.sqrt(dist).is_integer():'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5958364801,\n", + " 'measured_runtime_v1': 0.2940665908,\n", + " 'runtime_lift': 5.4267860753,\n", + " 'key': ['s700480138', 's244745375']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p02537',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's897150427',\n", + " 'submission_id_v1': 's003067542',\n", + " 'cpu_time_v0': 1389,\n", + " 'cpu_time_v1': 1137,\n", + " 'memory_v0': 275544,\n", + " 'memory_v1': 157144,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.14,\n", + " 'input': 'd=[0]*6**8\\n\\nn,k,*a=list(map(int,open(0).read().split()+d))\\n\\nfor i in range(n):d[i]=max(d[j]for j in range(i-99,i+1)if abs(a[i]-a[j])<=k)+1\\n\\nprint((max(d)))',\n", + " 'target': 'd=[0]*6**8\\n\\nn,k,*a=list(map(int,open(0).read().split()))\\n\\na=d+a\\n\\nwhile n:d[n]=max(d[j]for j in range(n,n+99)if abs(a[-n]-a[-j])<=k)+1;n-=1\\n\\nprint((max(d)))',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 147,\n", + " 'code_v1_num_chars': 147,\n", + " 'code_v0_no_empty_lines': 'd = [0] * 6**8\\nn, k, *a = list(map(int, open(0).read().split() + d))\\nfor i in range(n):\\n d[i] = max(d[j] for j in range(i - 99, i + 1) if abs(a[i] - a[j]) <= k) + 1\\nprint((max(d)))\\n',\n", + " 'code_v1_no_empty_lines': 'd = [0] * 6**8\\nn, k, *a = list(map(int, open(0).read().split()))\\na = d + a\\nwhile n:\\n d[n] = max(d[j] for j in range(n, n + 99) if abs(a[-n] - a[-j]) <= k) + 1\\n n -= 1\\nprint((max(d)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-n, k, *a = list(map(int, open(0).read().split() + d))',\n", + " '-for i in range(n):',\n", + " '- d[i] = max(d[j] for j in range(i - 99, i + 1) if abs(a[i] - a[j]) <= k) + 1',\n", + " '+n, k, *a = list(map(int, open(0).read().split()))',\n", + " '+a = d + a',\n", + " '+while n:',\n", + " '+ d[n] = max(d[j] for j in range(n, n + 99) if abs(a[-n] - a[-j]) <= k) + 1',\n", + " '+ n -= 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.750332129,\n", + " 'measured_runtime_v1': 0.822091434,\n", + " 'runtime_lift': 2.1291209914,\n", + " 'key': ['s897150427', 's003067542']},\n", + " {'user_id': 'u207799478',\n", + " 'problem_id': 'p03568',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's195491532',\n", + " 'submission_id_v1': 's278252901',\n", + " 'cpu_time_v0': 90,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 3832,\n", + " 'memory_v1': 3832,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 72.22,\n", + " 'input': 'import math\\n\\nimport string\\n\\n\\n\\n\\n\\ndef readints():\\n\\n return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef nCr(n, r):\\n\\n return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))\\n\\n\\n\\n\\n\\ndef has_duplicates2(seq):\\n\\n seen = []\\n\\n for item in seq:\\n\\n if not(item in seen):\\n\\n seen.append(item)\\n\\n return len(seq) != len(seen)\\n\\n\\n\\n\\n\\ndef divisor(n):\\n\\n divisor = []\\n\\n for i in range(1, n+1):\\n\\n if n % i == 0:\\n\\n divisor.append(i)\\n\\n return divisor\\n\\n\\n\\n\\n\\n# coordinates\\n\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\n\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\n\\n\\n\\nn = int(eval(input()))\\n\\na = readints()\\n\\n\\n\\n\\n\\ndef func(l):\\n\\n if len(l) == n:\\n\\n for i in range(len(l)):\\n\\n if l[i] % 2 == 0:\\n\\n return 1\\n\\n\\n\\n return 0\\n\\n return func(l+[(a[len(l)])])+func(l+[(a[len(l)]-1)])+func(l+[(a[len(l)]+1)])\\n\\n\\n\\n\\n\\nprint((func([])))\\n',\n", + " 'target': 'import math\\n\\nimport string\\n\\n\\n\\n\\n\\ndef readints():\\n\\n return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef nCr(n, r):\\n\\n return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))\\n\\n\\n\\n\\n\\ndef has_duplicates2(seq):\\n\\n seen = []\\n\\n for item in seq:\\n\\n if not(item in seen):\\n\\n seen.append(item)\\n\\n return len(seq) != len(seen)\\n\\n\\n\\n\\n\\ndef divisor(n):\\n\\n divisor = []\\n\\n for i in range(1, n+1):\\n\\n if n % i == 0:\\n\\n divisor.append(i)\\n\\n return divisor\\n\\n\\n\\n\\n\\n# coordinates\\n\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\n\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\n\\n\\n\\nn = int(eval(input()))\\n\\na = readints()\\n\\nsum = 1\\n\\nfor i in range(len(a)):\\n\\n if a[i] % 2 == 0:\\n\\n sum *= 2\\n\\n else:\\n\\n sum *= 1\\n\\nprint((3**len(a)-sum))\\n',\n", + " 'code_v0_loc': 47,\n", + " 'code_v1_loc': 41,\n", + " 'code_v0_num_chars': 865,\n", + " 'code_v1_num_chars': 739,\n", + " 'code_v0_no_empty_lines': 'import math\\nimport string\\n\\n\\ndef readints():\\n return list(map(int, input().split()))\\n\\n\\ndef nCr(n, r):\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\n\\ndef has_duplicates2(seq):\\n seen = []\\n for item in seq:\\n if not (item in seen):\\n seen.append(item)\\n return len(seq) != len(seen)\\n\\n\\ndef divisor(n):\\n divisor = []\\n for i in range(1, n + 1):\\n if n % i == 0:\\n divisor.append(i)\\n return divisor\\n\\n\\n# coordinates\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\nn = int(eval(input()))\\na = readints()\\n\\n\\ndef func(l):\\n if len(l) == n:\\n for i in range(len(l)):\\n if l[i] % 2 == 0:\\n return 1\\n return 0\\n return (\\n func(l + [(a[len(l)])])\\n + func(l + [(a[len(l)] - 1)])\\n + func(l + [(a[len(l)] + 1)])\\n )\\n\\n\\nprint((func([])))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\nimport string\\n\\n\\ndef readints():\\n return list(map(int, input().split()))\\n\\n\\ndef nCr(n, r):\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\n\\ndef has_duplicates2(seq):\\n seen = []\\n for item in seq:\\n if not (item in seen):\\n seen.append(item)\\n return len(seq) != len(seen)\\n\\n\\ndef divisor(n):\\n divisor = []\\n for i in range(1, n + 1):\\n if n % i == 0:\\n divisor.append(i)\\n return divisor\\n\\n\\n# coordinates\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\nn = int(eval(input()))\\na = readints()\\nsum = 1\\nfor i in range(len(a)):\\n if a[i] % 2 == 0:\\n sum *= 2\\n else:\\n sum *= 1\\nprint((3 ** len(a) - sum))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.7659574468,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def func(l):',\n", + " '- if len(l) == n:',\n", + " '- for i in range(len(l)):',\n", + " '- if l[i] % 2 == 0:',\n", + " '- return 1',\n", + " '- return 0',\n", + " '- return (',\n", + " '- func(l + [(a[len(l)])])',\n", + " '- + func(l + [(a[len(l)] - 1)])',\n", + " '- + func(l + [(a[len(l)] + 1)])',\n", + " '- )',\n", + " '-',\n", + " '-',\n", + " '-print((func([])))',\n", + " '+sum = 1',\n", + " '+for i in range(len(a)):',\n", + " '+ if a[i] % 2 == 0:',\n", + " '+ sum *= 2',\n", + " '+ else:',\n", + " '+ sum *= 1',\n", + " '+print((3 ** len(a) - sum))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3073070612,\n", + " 'measured_runtime_v1': 0.2000235903,\n", + " 'runtime_lift': 1.5363540904,\n", + " 'key': ['s195491532', 's278252901']},\n", + " {'user_id': 'u144913062',\n", + " 'problem_id': 'p03457',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's956976175',\n", + " 'submission_id_v1': 's285518014',\n", + " 'cpu_time_v0': 628,\n", + " 'cpu_time_v1': 555,\n", + " 'memory_v0': 62040,\n", + " 'memory_v1': 46056,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.62,\n", + " 'input': \"N = int(eval(input()))\\n\\ntxy = [(0, 0, 0)] + [tuple(map(int, input().split())) for _ in range(N)]\\n\\nfor i in range(N):\\n\\n t1, x1, y1 = txy[i]\\n\\n t2, x2, y2 = txy[i+1]\\n\\n if abs(x2-x1) + abs(y2-y1) <= t2 - t1 and (x1+y1+x2+y2) % 2 == (t2-t1) % 2:\\n\\n continue\\n\\n else:\\n\\n print('No')\\n\\n exit()\\n\\nprint('Yes')\",\n", + " 'target': \"N = int(eval(input()))\\n\\nt0 = x0 = y0 = 0\\n\\nfor _ in range(N):\\n\\n t1, x1, y1 = list(map(int, input().split()))\\n\\n d = abs(x1 - x0) + abs(y1 - y0)\\n\\n if d > t1 - t0 or d % 2 != (t1 - t0) % 2:\\n\\n print('No')\\n\\n exit()\\n\\n t0, x0, y0 = t1, x1, y1\\n\\nprint('Yes')\\n\",\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 323,\n", + " 'code_v1_num_chars': 263,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\ntxy = [(0, 0, 0)] + [tuple(map(int, input().split())) for _ in range(N)]\\nfor i in range(N):\\n t1, x1, y1 = txy[i]\\n t2, x2, y2 = txy[i + 1]\\n if (\\n abs(x2 - x1) + abs(y2 - y1) <= t2 - t1\\n and (x1 + y1 + x2 + y2) % 2 == (t2 - t1) % 2\\n ):\\n continue\\n else:\\n print(\"No\")\\n exit()\\nprint(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nt0 = x0 = y0 = 0\\nfor _ in range(N):\\n t1, x1, y1 = list(map(int, input().split()))\\n d = abs(x1 - x0) + abs(y1 - y0)\\n if d > t1 - t0 or d % 2 != (t1 - t0) % 2:\\n print(\"No\")\\n exit()\\n t0, x0, y0 = t1, x1, y1\\nprint(\"Yes\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-txy = [(0, 0, 0)] + [tuple(map(int, input().split())) for _ in range(N)]',\n", + " '-for i in range(N):',\n", + " '- t1, x1, y1 = txy[i]',\n", + " '- t2, x2, y2 = txy[i + 1]',\n", + " '- if (',\n", + " '- abs(x2 - x1) + abs(y2 - y1) <= t2 - t1',\n", + " '- and (x1 + y1 + x2 + y2) % 2 == (t2 - t1) % 2',\n", + " '- ):',\n", + " '- continue',\n", + " '- else:',\n", + " '+t0 = x0 = y0 = 0',\n", + " '+for _ in range(N):',\n", + " '+ t1, x1, y1 = list(map(int, input().split()))',\n", + " '+ d = abs(x1 - x0) + abs(y1 - y0)',\n", + " '+ if d > t1 - t0 or d % 2 != (t1 - t0) % 2:',\n", + " '+ t0, x0, y0 = t1, x1, y1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3724059272,\n", + " 'measured_runtime_v1': 0.2797260373,\n", + " 'runtime_lift': 1.3313237867,\n", + " 'key': ['s956976175', 's285518014']},\n", + " {'user_id': 'u682672120',\n", + " 'problem_id': 'p03172',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's523132470',\n", + " 'submission_id_v1': 's175761939',\n", + " 'cpu_time_v0': 314,\n", + " 'cpu_time_v1': 131,\n", + " 'memory_v0': 146396,\n", + " 'memory_v1': 67544,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 58.28,\n", + " 'input': 'n, k = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\ndp = [[0] * (k + 1) for _ in range(n + 1)]\\n\\ndp[0][0] = 1\\n\\nfor i in range(n):\\n\\n dp[i + 1][0] = dp[i][0]\\n\\n for j in range(1, k+1):\\n\\n dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % mod\\n\\n for j in range(k, a[i], -1):\\n\\n dp[i + 1][j] = (dp[i + 1][j] - dp[i + 1][j - a[i] - 1]) % mod\\n\\nprint((dp[n][-1]))',\n", + " 'target': 'n, k = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\nf = [0] * (k + 1)\\n\\nf[0] = 1\\n\\nfor i in range(n):\\n\\n for j in range(1, k+1):\\n\\n f[j] = (f[j] + f[j - 1]) % mod # 1/(1-x):累積和\\n\\n for j in range(k, a[i], -1): # 1-x^(a[i]+1) a[i]+1次したの項を引く\\n\\n f[j] = (f[j] - f[j - a[i] - 1]) % mod\\n\\nprint((f[-1]))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 409,\n", + " 'code_v1_num_chars': 347,\n", + " 'code_v0_no_empty_lines': 'n, k = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nmod = 10**9 + 7\\ndp = [[0] * (k + 1) for _ in range(n + 1)]\\ndp[0][0] = 1\\nfor i in range(n):\\n dp[i + 1][0] = dp[i][0]\\n for j in range(1, k + 1):\\n dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % mod\\n for j in range(k, a[i], -1):\\n dp[i + 1][j] = (dp[i + 1][j] - dp[i + 1][j - a[i] - 1]) % mod\\nprint((dp[n][-1]))\\n',\n", + " 'code_v1_no_empty_lines': 'n, k = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nmod = 10**9 + 7\\nf = [0] * (k + 1)\\nf[0] = 1\\nfor i in range(n):\\n for j in range(1, k + 1):\\n f[j] = (f[j] + f[j - 1]) % mod # 1/(1-x):累積和\\n for j in range(k, a[i], -1): # 1-x^(a[i]+1) a[i]+1次したの項を引く\\n f[j] = (f[j] - f[j - a[i] - 1]) % mod\\nprint((f[-1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['-dp = [[0] * (k + 1) for _ in range(n + 1)]',\n", + " '-dp[0][0] = 1',\n", + " '+f = [0] * (k + 1)',\n", + " '+f[0] = 1',\n", + " '- dp[i + 1][0] = dp[i][0]',\n", + " '- dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % mod',\n", + " '- for j in range(k, a[i], -1):',\n", + " '- dp[i + 1][j] = (dp[i + 1][j] - dp[i + 1][j - a[i] - 1]) % mod',\n", + " '-print((dp[n][-1]))',\n", + " '+ f[j] = (f[j] + f[j - 1]) % mod # 1/(1-x):累積和',\n", + " '+ for j in range(k, a[i], -1): # 1-x^(a[i]+1) a[i]+1次したの項を引く',\n", + " '+ f[j] = (f[j] - f[j - a[i] - 1]) % mod',\n", + " '+print((f[-1]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.165174345,\n", + " 'measured_runtime_v1': 0.7766242659,\n", + " 'runtime_lift': 1.5003063851,\n", + " 'key': ['s523132470', 's175761939']},\n", + " {'user_id': 'u168139048',\n", + " 'problem_id': 'p02883',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's505691060',\n", + " 'submission_id_v1': 's145470826',\n", + " 'cpu_time_v0': 1986,\n", + " 'cpu_time_v1': 1272,\n", + " 'memory_v0': 119628,\n", + " 'memory_v1': 120140,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.95,\n", + " 'input': \"import sys\\n\\nsys.setrecursionlimit(10000000)\\n\\nimport heapq\\n\\nimport math\\n\\n \\n\\ndef main():\\n\\n N, K = list(map(int, input().split()))\\n\\n A = [int(c) for c in input().split()]\\n\\n F = [int(c) for c in input().split()]\\n\\n \\n\\n A.sort()\\n\\n F.sort(reverse=True)\\n\\n \\n\\n num = 0\\n\\n sum_ = []\\n\\n for i in range(N):\\n\\n sum_.append(A[i] * F[i])\\n\\n left = 0\\n\\n right = 10 ** 12\\n\\n while(num < 90):\\n\\n number = 0\\n\\n mid = (left + right) // 2\\n\\n # print(mid)\\n\\n for i in range(len(A)):\\n\\n if sum_[i] <= mid:\\n\\n continue\\n\\n else:\\n\\n number += math.ceil((sum_[i] - mid) / F[i])\\n\\n # print(number)\\n\\n if number > K:\\n\\n # 最大値をmidより小さくできない -> 最大値はもっとでかい\\n\\n left = mid + 1\\n\\n else:\\n\\n right = mid\\n\\n num += 1\\n\\n print(mid)\\n\\n \\n\\n \\n\\n \\n\\n \\n\\n \\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"import sys\\n\\nsys.setrecursionlimit(10000000)\\n\\nimport heapq\\n\\nimport math\\n\\n\\n\\ndef main():\\n\\n N, K = list(map(int, input().split()))\\n\\n A = [int(c) for c in input().split()]\\n\\n F = [int(c) for c in input().split()]\\n\\n \\n\\n A.sort()\\n\\n F.sort(reverse=True)\\n\\n\\n\\n num = 0\\n\\n sum_ = []\\n\\n for i in range(len(A)):\\n\\n sum_.append(A[i] * F[i])\\n\\n left = 0\\n\\n right = 10 ** 12\\n\\n while(num < 50):\\n\\n number = 0\\n\\n mid = (left + right) // 2\\n\\n # print(mid)\\n\\n for i in range(len(A)):\\n\\n if sum_[i] <= mid:\\n\\n continue\\n\\n else:\\n\\n number += math.ceil((sum_[i] - mid) / F[i])\\n\\n # print(number)\\n\\n if number > K:\\n\\n # 最大値をmidより小さくできない -> 最大値はもっとでかい\\n\\n left = mid + 1\\n\\n else:\\n\\n right = mid\\n\\n num += 1\\n\\n print(mid)\\n\\n \\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 43,\n", + " 'code_v1_loc': 40,\n", + " 'code_v0_num_chars': 927,\n", + " 'code_v1_num_chars': 916,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10000000)\\nimport heapq\\nimport math\\n\\n\\ndef main():\\n N, K = list(map(int, input().split()))\\n A = [int(c) for c in input().split()]\\n F = [int(c) for c in input().split()]\\n A.sort()\\n F.sort(reverse=True)\\n num = 0\\n sum_ = []\\n for i in range(N):\\n sum_.append(A[i] * F[i])\\n left = 0\\n right = 10**12\\n while num < 90:\\n number = 0\\n mid = (left + right) // 2\\n # print(mid)\\n for i in range(len(A)):\\n if sum_[i] <= mid:\\n continue\\n else:\\n number += math.ceil((sum_[i] - mid) / F[i])\\n # print(number)\\n if number > K:\\n # 最大値をmidより小さくできない -> 最大値はもっとでかい\\n left = mid + 1\\n else:\\n right = mid\\n num += 1\\n print(mid)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10000000)\\nimport heapq\\nimport math\\n\\n\\ndef main():\\n N, K = list(map(int, input().split()))\\n A = [int(c) for c in input().split()]\\n F = [int(c) for c in input().split()]\\n A.sort()\\n F.sort(reverse=True)\\n num = 0\\n sum_ = []\\n for i in range(len(A)):\\n sum_.append(A[i] * F[i])\\n left = 0\\n right = 10**12\\n while num < 50:\\n number = 0\\n mid = (left + right) // 2\\n # print(mid)\\n for i in range(len(A)):\\n if sum_[i] <= mid:\\n continue\\n else:\\n number += math.ceil((sum_[i] - mid) / F[i])\\n # print(number)\\n if number > K:\\n # 最大値をmidより小さくできない -> 最大値はもっとでかい\\n left = mid + 1\\n else:\\n right = mid\\n num += 1\\n print(mid)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.976744186,\n", + " 'diff': ['- for i in range(N):',\n", + " '+ for i in range(len(A)):',\n", + " '- while num < 90:',\n", + " '+ while num < 50:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2338457465,\n", + " 'measured_runtime_v1': 0.006493052,\n", + " 'runtime_lift': 36.0147656217,\n", + " 'key': ['s505691060', 's145470826']},\n", + " {'user_id': 'u546285759',\n", + " 'problem_id': 'p00500',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's199562246',\n", + " 'submission_id_v1': 's512442556',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 7644,\n", + " 'memory_v1': 7672,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.33,\n", + " 'input': \"N = int(input())\\n\\nscore = [list(map(int, input().split())) for _ in range(N)]\\n\\nplayers = [0 for _ in range(N)]\\n\\nfor play in list(zip(*score)):\\n\\n for i, p in enumerate(play):\\n\\n if play.count(p) == 1:\\n\\n players[i] += p\\n\\nprint(*players, sep='\\\\n')\\n\",\n", + " 'target': \"N = int(input())\\n\\nscore = [input().split() for _ in range(N)]\\n\\nplayers = [0]*N\\n\\nfor play in list(zip(*score)):\\n\\n for i, p in enumerate(play):\\n\\n if play.count(p) == 1:\\n\\n players[i] += int(p)\\n\\nprint(*players, sep='\\\\n')\\n\",\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 264,\n", + " 'code_v1_num_chars': 237,\n", + " 'code_v0_no_empty_lines': 'N = int(input())\\nscore = [list(map(int, input().split())) for _ in range(N)]\\nplayers = [0 for _ in range(N)]\\nfor play in list(zip(*score)):\\n for i, p in enumerate(play):\\n if play.count(p) == 1:\\n players[i] += p\\nprint(*players, sep=\"\\\\n\")\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(input())\\nscore = [input().split() for _ in range(N)]\\nplayers = [0] * N\\nfor play in list(zip(*score)):\\n for i, p in enumerate(play):\\n if play.count(p) == 1:\\n players[i] += int(p)\\nprint(*players, sep=\"\\\\n\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-score = [list(map(int, input().split())) for _ in range(N)]',\n", + " '-players = [0 for _ in range(N)]',\n", + " '+score = [input().split() for _ in range(N)]',\n", + " '+players = [0] * N',\n", + " '- players[i] += p',\n", + " '+ players[i] += int(p)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3026783457,\n", + " 'measured_runtime_v1': 0.2355215042,\n", + " 'runtime_lift': 1.2851410182,\n", + " 'key': ['s199562246', 's512442556']},\n", + " {'user_id': 'u171065106',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's258128729',\n", + " 'submission_id_v1': 's727911974',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 43,\n", + " 'memory_v0': 3976,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.3,\n", + " 'input': 'import math\\n\\n\\n\\nn = int(eval(input()))\\n\\n\\n\\nprint((math.factorial(n) % (10**9 + 7)))\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\n\\n\\nans = 1\\n\\n\\n\\nfor i in range(1, n+1):\\n\\n ans *= i\\n\\n ans %= 10**9 + 7\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 74,\n", + " 'code_v1_num_chars': 105,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nprint((math.factorial(n) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nans = 1\\nfor i in range(1, n + 1):\\n ans *= i\\n ans %= 10**9 + 7\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 44.4444444444,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(n) % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= 10**9 + 7',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6649877462,\n", + " 'measured_runtime_v1': 0.4034042664,\n", + " 'runtime_lift': 1.6484400431,\n", + " 'key': ['s258128729', 's727911974']},\n", + " {'user_id': 'u342869120',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's557028395',\n", + " 'submission_id_v1': 's922919122',\n", + " 'cpu_time_v0': 65,\n", + " 'cpu_time_v1': 58,\n", + " 'memory_v0': 64700,\n", + " 'memory_v1': 63784,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.77,\n", + " 'input': '\\n\\nX = int(eval(input()))\\n\\nfor a in range(-200, 200):\\n\\n find = False\\n\\n for b in range(-200, 200):\\n\\n x = a**5-b**5\\n\\n if x == X:\\n\\n find = True\\n\\n print((a, b))\\n\\n break\\n\\n if find:\\n\\n break\\n',\n", + " 'target': '\\n\\nX = int(eval(input()))\\n\\nfor a in range(-120, 120):\\n\\n find = False\\n\\n for b in range(-120, 120):\\n\\n x = a**5-b**5\\n\\n if x == X:\\n\\n find = True\\n\\n print((a, b))\\n\\n break\\n\\n if find:\\n\\n break\\n',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 238,\n", + " 'code_v1_num_chars': 238,\n", + " 'code_v0_no_empty_lines': 'X = int(eval(input()))\\nfor a in range(-200, 200):\\n find = False\\n for b in range(-200, 200):\\n x = a**5 - b**5\\n if x == X:\\n find = True\\n print((a, b))\\n break\\n if find:\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'X = int(eval(input()))\\nfor a in range(-120, 120):\\n find = False\\n for b in range(-120, 120):\\n x = a**5 - b**5\\n if x == X:\\n find = True\\n print((a, b))\\n break\\n if find:\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for a in range(-200, 200):',\n", + " '+for a in range(-120, 120):',\n", + " '- for b in range(-200, 200):',\n", + " '+ for b in range(-120, 120):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6603648007,\n", + " 'measured_runtime_v1': 0.3721980631,\n", + " 'runtime_lift': 1.7742295463,\n", + " 'key': ['s557028395', 's922919122']},\n", + " {'user_id': 'u634461820',\n", + " 'problem_id': 'p02863',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's061535189',\n", + " 'submission_id_v1': 's586045080',\n", + " 'cpu_time_v0': 1058,\n", + " 'cpu_time_v1': 461,\n", + " 'memory_v0': 183896,\n", + " 'memory_v1': 117976,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 56.43,\n", + " 'input': 'import sys\\n\\nfrom operator import itemgetter\\n\\nfrom heapq import heapify, heappop, heappush\\n\\nMAX_INT = int(10e15)\\n\\nMIN_INT = -MAX_INT\\n\\nmod = 1000000007\\n\\nsys.setrecursionlimit(1000000)\\n\\ndef IL(): return list(map(int,input().split()))\\n\\ndef SL(): return input().split()\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef S(): return eval(input())\\n\\n\\n\\nN, T = IL()\\n\\nab = [IL() for i in range(N)]\\n\\nab.sort(key=itemgetter(0))\\n\\n#print(ab)\\n\\n\\n\\ndp = [[0]*(T+1+3000+1) for _ in range(N+1)]\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n for j in range(T+1+3000+1):\\n\\n time, deli = ab[i]\\n\\n if 0 <= j-time < T:\\n\\n dp[i + 1][j] = max(dp[i][j], dp[i][j - time] + deli)\\n\\n else:\\n\\n dp[i + 1][j] = dp[i][j]\\n\\n ans = max(ans, dp[i + 1][j])\\n\\nprint(ans)\\n\\n\\n\\n#print(dp)\\n',\n", + " 'target': 'import sys\\n\\nfrom collections import deque\\n\\nMAX_INT = int(10e10)\\n\\nMIN_INT = -MAX_INT\\n\\nmod = 1000000007\\n\\nsys.setrecursionlimit(1000000)\\n\\ndef IL(): return list(map(int,input().split()))\\n\\ndef SL(): return input().split()\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef S(): return eval(input())\\n\\n\\n\\nN,T = IL()\\n\\nab = [IL() for i in range(N)]\\n\\nab.sort()\\n\\n\\n\\nans = 0\\n\\ndp = [[0]*T for i in range(N+1)]\\n\\nfor i in range(1,N+1):\\n\\n a,b = ab[i-1]\\n\\n for j in range(T):\\n\\n if 0 <= j-a < T:\\n\\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-a] + b)\\n\\n else:\\n\\n dp[i][j] = dp[i-1][j]\\n\\n else:\\n\\n ans = max(ans, dp[i-1][-1] + b)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 737,\n", + " 'code_v1_num_chars': 620,\n", + " 'code_v0_no_empty_lines': 'import sys\\nfrom operator import itemgetter\\nfrom heapq import heapify, heappop, heappush\\n\\nMAX_INT = int(10e15)\\nMIN_INT = -MAX_INT\\nmod = 1000000007\\nsys.setrecursionlimit(1000000)\\n\\n\\ndef IL():\\n return list(map(int, input().split()))\\n\\n\\ndef SL():\\n return input().split()\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef S():\\n return eval(input())\\n\\n\\nN, T = IL()\\nab = [IL() for i in range(N)]\\nab.sort(key=itemgetter(0))\\n# print(ab)\\ndp = [[0] * (T + 1 + 3000 + 1) for _ in range(N + 1)]\\nans = 0\\nfor i in range(N):\\n for j in range(T + 1 + 3000 + 1):\\n time, deli = ab[i]\\n if 0 <= j - time < T:\\n dp[i + 1][j] = max(dp[i][j], dp[i][j - time] + deli)\\n else:\\n dp[i + 1][j] = dp[i][j]\\n ans = max(ans, dp[i + 1][j])\\nprint(ans)\\n# print(dp)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom collections import deque\\n\\nMAX_INT = int(10e10)\\nMIN_INT = -MAX_INT\\nmod = 1000000007\\nsys.setrecursionlimit(1000000)\\n\\n\\ndef IL():\\n return list(map(int, input().split()))\\n\\n\\ndef SL():\\n return input().split()\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef S():\\n return eval(input())\\n\\n\\nN, T = IL()\\nab = [IL() for i in range(N)]\\nab.sort()\\nans = 0\\ndp = [[0] * T for i in range(N + 1)]\\nfor i in range(1, N + 1):\\n a, b = ab[i - 1]\\n for j in range(T):\\n if 0 <= j - a < T:\\n dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a] + b)\\n else:\\n dp[i][j] = dp[i - 1][j]\\n else:\\n ans = max(ans, dp[i - 1][-1] + b)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-from operator import itemgetter',\n", + " '-from heapq import heapify, heappop, heappush',\n", + " '+from collections import deque',\n", + " '-MAX_INT = int(10e15)',\n", + " '+MAX_INT = int(10e10)',\n", + " '-ab.sort(key=itemgetter(0))',\n", + " '-# print(ab)',\n", + " '-dp = [[0] * (T + 1 + 3000 + 1) for _ in range(N + 1)]',\n", + " '+ab.sort()',\n", + " '-for i in range(N):',\n", + " '- for j in range(T + 1 + 3000 + 1):',\n", + " '- time, deli = ab[i]',\n", + " '- if 0 <= j - time < T:',\n", + " '- dp[i + 1][j] = max(dp[i][j], dp[i][j - time] + deli)',\n", + " '+dp = [[0] * T for i in range(N + 1)]',\n", + " '+for i in range(1, N + 1):',\n", + " '+ a, b = ab[i - 1]',\n", + " '+ for j in range(T):',\n", + " '+ if 0 <= j - a < T:',\n", + " '+ dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a] + b)',\n", + " '- dp[i + 1][j] = dp[i][j]',\n", + " '- ans = max(ans, dp[i + 1][j])',\n", + " '+ dp[i][j] = dp[i - 1][j]',\n", + " '+ else:',\n", + " '+ ans = max(ans, dp[i - 1][-1] + b)',\n", + " '-# print(dp)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4860900669,\n", + " 'measured_runtime_v1': 0.3545958745,\n", + " 'runtime_lift': 1.3708283197,\n", + " 'key': ['s061535189', 's586045080']},\n", + " {'user_id': 'u062691227',\n", + " 'problem_id': 'p03723',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's522426109',\n", + " 'submission_id_v1': 's794063832',\n", + " 'cpu_time_v0': 61,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 61360,\n", + " 'memory_v1': 9172,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 52.46,\n", + " 'input': 'a,b,c=list(map(int,input().split()))\\n\\ne=(a-b)|(b-c)\\n\\nprint((bool(e|(a|b|c)%2)*(e^~-e).bit_length()-1))',\n", + " 'target': 'a,b,c=list(map(int,input().split()))\\n\\ne=(a-b)|(b-c)\\n\\nprint((bool(e|b%2)*(e^~-e).bit_length()-1))',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 94,\n", + " 'code_v1_num_chars': 88,\n", + " 'code_v0_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\ne = (a - b) | (b - c)\\nprint((bool(e | (a | b | c) % 2) * (e ^ ~-e).bit_length() - 1))\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\ne = (a - b) | (b - c)\\nprint((bool(e | b % 2) * (e ^ ~-e).bit_length() - 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-print((bool(e | (a | b | c) % 2) * (e ^ ~-e).bit_length() - 1))',\n", + " '+print((bool(e | b % 2) * (e ^ ~-e).bit_length() - 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2914967289,\n", + " 'measured_runtime_v1': 0.0905496902,\n", + " 'runtime_lift': 3.2191907898,\n", + " 'key': ['s522426109', 's794063832']},\n", + " {'user_id': 'u678167152',\n", + " 'problem_id': 'p02574',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's474626212',\n", + " 'submission_id_v1': 's470012575',\n", + " 'cpu_time_v0': 803,\n", + " 'cpu_time_v1': 363,\n", + " 'memory_v0': 216812,\n", + " 'memory_v1': 219860,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.79,\n", + " 'input': \"import numpy as np\\n\\nimport numba\\n\\nfrom numba import njit, b1, i4, i8, f8\\n\\n\\n\\n@njit((i8, i8[:]), cache=True)\\n\\ndef main(N,A):\\n\\n Amax = np.max(A)\\n\\n lis = np.zeros(Amax+1, np.int64)\\n\\n for i in range(N):\\n\\n lis[A[i]] += 1\\n\\n setwise = False\\n\\n for t in range(2,Amax+1):\\n\\n cnt = np.sum(lis[t:Amax+1:t])\\n\\n if cnt==N:\\n\\n return 'not'\\n\\n if 2<=cnt= x and dp[stones-x] == False:\\n\\n dp[stones] = True\\n\\n\\n\\nif dp[k]:\\n\\n print(\"First\")\\n\\nelse:\\n\\n print(\"Second\")\\n',\n", + " 'target': 'N,K = list(map(int,input().split()))\\n\\nA = list(map(int,input().split()))\\n\\n\\n\\ndp = [False]*(K+1)\\n\\n\\n\\nfor i in range(K+1):\\n\\n for j in range(N):\\n\\n if i-A[j]>=0 and dp[i-A[j]] == False:\\n\\n dp[i] = True\\n\\n\\n\\n \\n\\nif dp[K]:\\n\\n print(\"First\")\\n\\nelse:\\n\\n print(\"Second\")',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 282,\n", + " 'code_v1_num_chars': 280,\n", + " 'code_v0_no_empty_lines': 'n, k = list(map(int, input().split()))\\narr = list(map(int, input().split()))\\ndp = [False] * (k + 1)\\nfor stones in range(k + 1):\\n for x in arr:\\n if stones >= x and dp[stones - x] == False:\\n dp[stones] = True\\nif dp[k]:\\n print(\"First\")\\nelse:\\n print(\"Second\")\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\ndp = [False] * (K + 1)\\nfor i in range(K + 1):\\n for j in range(N):\\n if i - A[j] >= 0 and dp[i - A[j]] == False:\\n dp[i] = True\\nif dp[K]:\\n print(\"First\")\\nelse:\\n print(\"Second\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['-n, k = list(map(int, input().split()))',\n", + " '-arr = list(map(int, input().split()))',\n", + " '-dp = [False] * (k + 1)',\n", + " '-for stones in range(k + 1):',\n", + " '- for x in arr:',\n", + " '- if stones >= x and dp[stones - x] == False:',\n", + " '- dp[stones] = True',\n", + " '-if dp[k]:',\n", + " '+N, K = list(map(int, input().split()))',\n", + " '+A = list(map(int, input().split()))',\n", + " '+dp = [False] * (K + 1)',\n", + " '+for i in range(K + 1):',\n", + " '+ for j in range(N):',\n", + " '+ if i - A[j] >= 0 and dp[i - A[j]] == False:',\n", + " '+ dp[i] = True',\n", + " '+if dp[K]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2082244466,\n", + " 'measured_runtime_v1': 0.0065503952,\n", + " 'runtime_lift': 31.7880739295,\n", + " 'key': ['s690193516', 's176737022']},\n", + " {'user_id': 'u584658281',\n", + " 'problem_id': 'p02688',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's600438109',\n", + " 'submission_id_v1': 's928531547',\n", + " 'cpu_time_v0': 27,\n", + " 'cpu_time_v1': 24,\n", + " 'memory_v0': 9216,\n", + " 'memory_v1': 9264,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.11,\n", + " 'input': 'N,K=list(map(int,input().split()))\\n\\na = [[0]*N]*K\\n\\na = [[0 for n in range(N)] for k in range(K)]\\n\\n\\n\\nfor k in range(K):\\n\\n d=int(eval(input()))\\n\\n have_k=list(map(int,input().split()))\\n\\n for h in have_k:\\n\\n a[k][h-1]=1\\n\\n\\n\\nan=[0]*N\\n\\nfor k in range(K):\\n\\n for n in range(N):\\n\\n an[n] = an[n]+a[k][n]\\n\\n\\n\\nresult=0\\n\\nfor i in an:\\n\\n if i == 0:\\n\\n result+=1\\n\\n\\n\\nprint(result)',\n", + " 'target': 'N,K=list(map(int,input().split()))\\n\\na = [[0 for n in range(N)] for k in range(K)]\\n\\n\\n\\nfor k in range(K):\\n\\n d=int(eval(input()))\\n\\n have_k=list(map(int,input().split()))\\n\\n for h in have_k:\\n\\n a[k][h-1]=1\\n\\n\\n\\nan=[0]*N\\n\\nfor k in range(K):\\n\\n for n in range(N):\\n\\n an[n] = an[n]+a[k][n]\\n\\n\\n\\nresult=0\\n\\nfor i in an:\\n\\n if i == 0:\\n\\n result+=1\\n\\n\\n\\nprint(result)',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 365,\n", + " 'code_v1_num_chars': 350,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\na = [[0] * N] * K\\na = [[0 for n in range(N)] for k in range(K)]\\nfor k in range(K):\\n d = int(eval(input()))\\n have_k = list(map(int, input().split()))\\n for h in have_k:\\n a[k][h - 1] = 1\\nan = [0] * N\\nfor k in range(K):\\n for n in range(N):\\n an[n] = an[n] + a[k][n]\\nresult = 0\\nfor i in an:\\n if i == 0:\\n result += 1\\nprint(result)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\na = [[0 for n in range(N)] for k in range(K)]\\nfor k in range(K):\\n d = int(eval(input()))\\n have_k = list(map(int, input().split()))\\n for h in have_k:\\n a[k][h - 1] = 1\\nan = [0] * N\\nfor k in range(K):\\n for n in range(N):\\n an[n] = an[n] + a[k][n]\\nresult = 0\\nfor i in an:\\n if i == 0:\\n result += 1\\nprint(result)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.7619047619,\n", + " 'diff': ['-a = [[0] * N] * K'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.33595281,\n", + " 'measured_runtime_v1': 0.2656919487,\n", + " 'runtime_lift': 1.264444827,\n", + " 'key': ['s600438109', 's928531547']},\n", + " {'user_id': 'u670180528',\n", + " 'problem_id': 'p03634',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's592706363',\n", + " 'submission_id_v1': 's081294326',\n", + " 'cpu_time_v0': 718,\n", + " 'cpu_time_v1': 476,\n", + " 'memory_v0': 63540,\n", + " 'memory_v1': 64180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.7,\n", + " 'input': 'from collections import deque\\n\\nn,*t=list(map(int,open(0).read().split()))\\n\\ncon=[[] for _ in range(n)]\\n\\ndist_f_k=[0]*n\\n\\n\\n\\nfor a,b,c in zip(t[:3*n-3:3],t[1::3],t[2::3]):\\n\\n\\tcon[a-1].append((b-1,c))\\n\\n\\tcon[b-1].append((a-1,c))\\n\\n\\n\\nk=t[3*n-2]\\n\\nque=deque([k-1])\\n\\nwhile que:\\n\\n\\tcur=que.popleft()\\n\\n\\tfor nxt,dd in con[cur]:\\n\\n\\t\\tif dist_f_k[nxt]==0 and nxt!=k-1:\\n\\n\\t\\t\\tque.append(nxt)\\n\\n\\t\\t\\tdist_f_k[nxt]=dist_f_k[cur]+dd\\n\\n\\n\\nfor x,y in zip(t[3*n-1::2],t[3*n::2]):\\n\\n\\tprint((dist_f_k[x-1]+dist_f_k[y-1]))',\n", + " 'target': 'def solve():\\n\\n\\tfrom collections import deque\\n\\n\\tn,*t=list(map(int,open(0).read().split()))\\n\\n\\tcon=[[] for _ in range(n)]\\n\\n\\tdist_f_k=[0]*n\\n\\n\\tl1,l2=t[:3*n-3],t[3*n-1:]\\n\\n\\n\\n\\tfor a,b,c in zip(*[iter(l1)]*3):\\n\\n\\t\\tcon[a-1].append((b-1,c))\\n\\n\\t\\tcon[b-1].append((a-1,c))\\n\\n\\n\\n\\tk=t[3*n-2]\\n\\n\\tque=deque([k-1])\\n\\n\\twhile que:\\n\\n\\t\\tcur=que.popleft()\\n\\n\\t\\tfor nxt,dd in con[cur]:\\n\\n\\t\\t\\tif dist_f_k[nxt]==0 and nxt!=k-1:\\n\\n\\t\\t\\t\\tque.append(nxt)\\n\\n\\t\\t\\t\\tdist_f_k[nxt]=dist_f_k[cur]+dd\\n\\n\\n\\n\\tfor x,y in zip(*[iter(l2)]*2):\\n\\n\\t\\tprint((dist_f_k[x-1]+dist_f_k[y-1]))\\n\\n\\t\\t\\n\\nif __name__==\"__main__\":\\n\\n\\tsolve()',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 476,\n", + " 'code_v1_num_chars': 553,\n", + " 'code_v0_no_empty_lines': 'from collections import deque\\n\\nn, *t = list(map(int, open(0).read().split()))\\ncon = [[] for _ in range(n)]\\ndist_f_k = [0] * n\\nfor a, b, c in zip(t[: 3 * n - 3 : 3], t[1::3], t[2::3]):\\n con[a - 1].append((b - 1, c))\\n con[b - 1].append((a - 1, c))\\nk = t[3 * n - 2]\\nque = deque([k - 1])\\nwhile que:\\n cur = que.popleft()\\n for nxt, dd in con[cur]:\\n if dist_f_k[nxt] == 0 and nxt != k - 1:\\n que.append(nxt)\\n dist_f_k[nxt] = dist_f_k[cur] + dd\\nfor x, y in zip(t[3 * n - 1 :: 2], t[3 * n :: 2]):\\n print((dist_f_k[x - 1] + dist_f_k[y - 1]))\\n',\n", + " 'code_v1_no_empty_lines': 'def solve():\\n from collections import deque\\n\\n n, *t = list(map(int, open(0).read().split()))\\n con = [[] for _ in range(n)]\\n dist_f_k = [0] * n\\n l1, l2 = t[: 3 * n - 3], t[3 * n - 1 :]\\n for a, b, c in zip(*[iter(l1)] * 3):\\n con[a - 1].append((b - 1, c))\\n con[b - 1].append((a - 1, c))\\n k = t[3 * n - 2]\\n que = deque([k - 1])\\n while que:\\n cur = que.popleft()\\n for nxt, dd in con[cur]:\\n if dist_f_k[nxt] == 0 and nxt != k - 1:\\n que.append(nxt)\\n dist_f_k[nxt] = dist_f_k[cur] + dd\\n for x, y in zip(*[iter(l2)] * 2):\\n print((dist_f_k[x - 1] + dist_f_k[y - 1]))\\n\\n\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-from collections import deque',\n", + " '+def solve():',\n", + " '+ from collections import deque',\n", + " '-n, *t = list(map(int, open(0).read().split()))',\n", + " '-con = [[] for _ in range(n)]',\n", + " '-dist_f_k = [0] * n',\n", + " '-for a, b, c in zip(t[: 3 * n - 3 : 3], t[1::3], t[2::3]):',\n", + " '- con[a - 1].append((b - 1, c))',\n", + " '- con[b - 1].append((a - 1, c))',\n", + " '-k = t[3 * n - 2]',\n", + " '-que = deque([k - 1])',\n", + " '-while que:',\n", + " '- cur = que.popleft()',\n", + " '- for nxt, dd in con[cur]:',\n", + " '- if dist_f_k[nxt] == 0 and nxt != k - 1:',\n", + " '- que.append(nxt)',\n", + " '- dist_f_k[nxt] = dist_f_k[cur] + dd',\n", + " '-for x, y in zip(t[3 * n - 1 :: 2], t[3 * n :: 2]):',\n", + " '- print((dist_f_k[x - 1] + dist_f_k[y - 1]))',\n", + " '+ n, *t = list(map(int, open(0).read().split()))',\n", + " '+ con = [[] for _ in range(n)]',\n", + " '+ dist_f_k = [0] * n',\n", + " '+ l1, l2 = t[: 3 * n - 3], t[3 * n - 1 :]',\n", + " '+ for a, b, c in zip(*[iter(l1)] * 3):',\n", + " '+ con[a - 1].append((b - 1, c))',\n", + " '+ con[b - 1].append((a - 1, c))',\n", + " '+ k = t[3 * n - 2]',\n", + " '+ que = deque([k - 1])',\n", + " '+ while que:',\n", + " '+ cur = que.popleft()',\n", + " '+ for nxt, dd in con[cur]:',\n", + " '+ if dist_f_k[nxt] == 0 and nxt != k - 1:',\n", + " '+ que.append(nxt)',\n", + " '+ dist_f_k[nxt] = dist_f_k[cur] + dd',\n", + " '+ for x, y in zip(*[iter(l2)] * 2):',\n", + " '+ print((dist_f_k[x - 1] + dist_f_k[y - 1]))',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ solve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.331901531,\n", + " 'measured_runtime_v1': 0.2149364519,\n", + " 'runtime_lift': 1.5441844695,\n", + " 'key': ['s592706363', 's081294326']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p02850',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's960505941',\n", + " 'submission_id_v1': 's699117089',\n", + " 'cpu_time_v0': 1118,\n", + " 'cpu_time_v1': 274,\n", + " 'memory_v0': 34416,\n", + " 'memory_v1': 33444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.49,\n", + " 'input': \"import sys\\n\\nfrom collections import deque\\n\\nimport numpy as np\\n\\n\\n\\ndef main():\\n\\n n = int(sys.stdin.readline().rstrip())\\n\\n ab = np.array(sys.stdin.read().split(), dtype=np.int64).reshape(-1, 2)\\n\\n\\n\\n G = [[] for _ in range(n + 1)]\\n\\n for a, b in ab:\\n\\n G[a].append(b)\\n\\n G[b].append(a)\\n\\n \\n\\n parent = np.zeros(n + 1, dtype=np.int64)\\n\\n color = np.zeros(n + 1, dtype=np.int64) # color of the edge(parent[y], y)\\n\\n\\n\\n q = deque([1]) # root = 1\\n\\n while q:\\n\\n x = q.popleft()\\n\\n ng = color[x]\\n\\n c = 1\\n\\n for y in G[x]:\\n\\n if y == parent[x]:\\n\\n continue\\n\\n parent[y] = x\\n\\n if c == ng:\\n\\n c += 1\\n\\n color[y] = c\\n\\n q.append(y)\\n\\n c += 1\\n\\n\\n\\n print((np.amax(color)))\\n\\n\\n\\n for a, b in ab:\\n\\n if a == parent[b]:\\n\\n print((color[b]))\\n\\n else:\\n\\n print((color[a]))\\n\\n \\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"import sys\\n\\nfrom collections import deque\\n\\n\\n\\ndef main():\\n\\n n = int(sys.stdin.readline().rstrip())\\n\\n ab = list(map(int, sys.stdin.read().split()))\\n\\n ab = list(zip(ab, ab))\\n\\n\\n\\n G = [[] for _ in range(n + 1)]\\n\\n for a, b in ab:\\n\\n G[a].append(b)\\n\\n G[b].append(a)\\n\\n \\n\\n q = deque([1]) # root = 1\\n\\n parent = [None] * (n + 1)\\n\\n color = [0] * (n + 1) # color of the edge(parent[y], y)\\n\\n\\n\\n while q:\\n\\n x = q.popleft()\\n\\n ng = color[x]\\n\\n c = 1\\n\\n for y in G[x]:\\n\\n if y == parent[x]:\\n\\n continue\\n\\n parent[y] = x\\n\\n if c == ng:\\n\\n c += 1\\n\\n color[y] = c\\n\\n q.append(y)\\n\\n c += 1\\n\\n \\n\\n print((max(color)))\\n\\n\\n\\n for a, b in ab:\\n\\n if a == parent[b]:\\n\\n print((color[b]))\\n\\n else:\\n\\n print((color[a]))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 41,\n", + " 'code_v1_loc': 41,\n", + " 'code_v0_num_chars': 980,\n", + " 'code_v1_num_chars': 920,\n", + " 'code_v0_no_empty_lines': 'import sys\\nfrom collections import deque\\nimport numpy as np\\n\\n\\ndef main():\\n n = int(sys.stdin.readline().rstrip())\\n ab = np.array(sys.stdin.read().split(), dtype=np.int64).reshape(-1, 2)\\n G = [[] for _ in range(n + 1)]\\n for a, b in ab:\\n G[a].append(b)\\n G[b].append(a)\\n parent = np.zeros(n + 1, dtype=np.int64)\\n color = np.zeros(n + 1, dtype=np.int64) # color of the edge(parent[y], y)\\n q = deque([1]) # root = 1\\n while q:\\n x = q.popleft()\\n ng = color[x]\\n c = 1\\n for y in G[x]:\\n if y == parent[x]:\\n continue\\n parent[y] = x\\n if c == ng:\\n c += 1\\n color[y] = c\\n q.append(y)\\n c += 1\\n print((np.amax(color)))\\n for a, b in ab:\\n if a == parent[b]:\\n print((color[b]))\\n else:\\n print((color[a]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom collections import deque\\n\\n\\ndef main():\\n n = int(sys.stdin.readline().rstrip())\\n ab = list(map(int, sys.stdin.read().split()))\\n ab = list(zip(ab, ab))\\n G = [[] for _ in range(n + 1)]\\n for a, b in ab:\\n G[a].append(b)\\n G[b].append(a)\\n q = deque([1]) # root = 1\\n parent = [None] * (n + 1)\\n color = [0] * (n + 1) # color of the edge(parent[y], y)\\n while q:\\n x = q.popleft()\\n ng = color[x]\\n c = 1\\n for y in G[x]:\\n if y == parent[x]:\\n continue\\n parent[y] = x\\n if c == ng:\\n c += 1\\n color[y] = c\\n q.append(y)\\n c += 1\\n print((max(color)))\\n for a, b in ab:\\n if a == parent[b]:\\n print((color[b]))\\n else:\\n print((color[a]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import numpy as np',\n", + " '- ab = np.array(sys.stdin.read().split(), dtype=np.int64).reshape(-1, 2)',\n", + " '+ ab = list(map(int, sys.stdin.read().split()))',\n", + " '+ ab = list(zip(ab, ab))',\n", + " '- parent = np.zeros(n + 1, dtype=np.int64)',\n", + " '- color = np.zeros(n + 1, dtype=np.int64) # color of the edge(parent[y], y)',\n", + " '+ parent = [None] * (n + 1)',\n", + " '+ color = [0] * (n + 1) # color of the edge(parent[y], y)',\n", + " '- print((np.amax(color)))',\n", + " '+ print((max(color)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3834958427,\n", + " 'measured_runtime_v1': 0.2106900873,\n", + " 'runtime_lift': 6.5664970775,\n", + " 'key': ['s960505941', 's699117089']},\n", + " {'user_id': 'u507456172',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's532831472',\n", + " 'submission_id_v1': 's789265811',\n", + " 'cpu_time_v0': 123,\n", + " 'cpu_time_v1': 31,\n", + " 'memory_v0': 9160,\n", + " 'memory_v1': 9152,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.8,\n", + " 'input': 'from math import factorial as fac\\n\\n\\n\\nS = int(eval(input()))\\n\\nans = 0\\n\\n\\n\\nif S == 1 or S == 2:\\n\\n print((0))\\n\\nelif S == 3:\\n\\n print((1))\\n\\nelse:\\n\\n for k in range(1,S):\\n\\n if S-2*k-1 >= 0 and S-3*k >= 0:\\n\\n ans += fac(S-2*k-1)//(fac(k-1)*fac(S-3*k))\\n\\n print((ans%1000000007))',\n", + " 'target': 'S = int(eval(input()))\\n\\n\\n\\nif S == 1 or S ==2:\\n\\n print((0))\\n\\nelif S == 3 or S == 4 or S == 5:\\n\\n print((1))\\n\\nelse:\\n\\n #初期化\\n\\n dp = [0]*S\\n\\n dp[2] = 1\\n\\n dp[3] = 1\\n\\n dp[4] = 1\\n\\n dp_S = 0\\n\\n #dp\\n\\n for i in range(5,S):\\n\\n dp_S += dp[i-3] \\n\\n dp[i] = 1+dp_S\\n\\n\\n\\n print((dp[S-1]%1000000007))',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 267,\n", + " 'code_v1_num_chars': 281,\n", + " 'code_v0_no_empty_lines': 'from math import factorial as fac\\n\\nS = int(eval(input()))\\nans = 0\\nif S == 1 or S == 2:\\n print((0))\\nelif S == 3:\\n print((1))\\nelse:\\n for k in range(1, S):\\n if S - 2 * k - 1 >= 0 and S - 3 * k >= 0:\\n ans += fac(S - 2 * k - 1) // (fac(k - 1) * fac(S - 3 * k))\\n print((ans % 1000000007))\\n',\n", + " 'code_v1_no_empty_lines': 'S = int(eval(input()))\\nif S == 1 or S == 2:\\n print((0))\\nelif S == 3 or S == 4 or S == 5:\\n print((1))\\nelse:\\n # 初期化\\n dp = [0] * S\\n dp[2] = 1\\n dp[3] = 1\\n dp[4] = 1\\n dp_S = 0\\n # dp\\n for i in range(5, S):\\n dp_S += dp[i - 3]\\n dp[i] = 1 + dp_S\\n print((dp[S - 1] % 1000000007))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.3157894737,\n", + " 'diff': ['-from math import factorial as fac',\n", + " '-',\n", + " '-ans = 0',\n", + " '-elif S == 3:',\n", + " '+elif S == 3 or S == 4 or S == 5:',\n", + " '- for k in range(1, S):',\n", + " '- if S - 2 * k - 1 >= 0 and S - 3 * k >= 0:',\n", + " '- ans += fac(S - 2 * k - 1) // (fac(k - 1) * fac(S - 3 * k))',\n", + " '- print((ans % 1000000007))',\n", + " '+ # 初期化',\n", + " '+ dp = [0] * S',\n", + " '+ dp[2] = 1',\n", + " '+ dp[3] = 1',\n", + " '+ dp[4] = 1',\n", + " '+ dp_S = 0',\n", + " '+ # dp',\n", + " '+ for i in range(5, S):',\n", + " '+ dp_S += dp[i - 3]',\n", + " '+ dp[i] = 1 + dp_S',\n", + " '+ print((dp[S - 1] % 1000000007))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3404159594,\n", + " 'measured_runtime_v1': 0.2477156413,\n", + " 'runtime_lift': 1.3742206895,\n", + " 'key': ['s532831472', 's789265811']},\n", + " {'user_id': 'u844646164',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's330073490',\n", + " 'submission_id_v1': 's440501694',\n", + " 'cpu_time_v0': 294,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 21384,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.86,\n", + " 'input': \"import numpy as np \\n\\nn = int(eval(input()))\\n\\nx = list(map(int, input().split()))\\n\\nx = np.array(x)\\n\\nans = float('inf')\\n\\nidx = 200\\n\\nfor i in range(100):\\n\\n y = x \\n\\n ans = min(ans, np.sum((y-i)**2))\\n\\n \\n\\nprint(ans)\",\n", + " 'target': \"N = int(eval(input()))\\n\\nX = list(map(int, input().split()))\\n\\nmx = max(X)\\n\\nans = float('inf')\\n\\nfor i in range(mx+1):\\n\\n tmp = 0\\n\\n for x in X:\\n\\n tmp += (x-(i+1))**2\\n\\n ans = min(ans, tmp)\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 206,\n", + " 'code_v1_num_chars': 195,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nx = list(map(int, input().split()))\\nx = np.array(x)\\nans = float(\"inf\")\\nidx = 200\\nfor i in range(100):\\n y = x\\n ans = min(ans, np.sum((y - i) ** 2))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nX = list(map(int, input().split()))\\nmx = max(X)\\nans = float(\"inf\")\\nfor i in range(mx + 1):\\n tmp = 0\\n for x in X:\\n tmp += (x - (i + 1)) ** 2\\n ans = min(ans, tmp)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-n = int(eval(input()))',\n", + " '-x = list(map(int, input().split()))',\n", + " '-x = np.array(x)',\n", + " '+N = int(eval(input()))',\n", + " '+X = list(map(int, input().split()))',\n", + " '+mx = max(X)',\n", + " '-idx = 200',\n", + " '-for i in range(100):',\n", + " '- y = x',\n", + " '- ans = min(ans, np.sum((y - i) ** 2))',\n", + " '+for i in range(mx + 1):',\n", + " '+ tmp = 0',\n", + " '+ for x in X:',\n", + " '+ tmp += (x - (i + 1)) ** 2',\n", + " '+ ans = min(ans, tmp)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4239430195,\n", + " 'measured_runtime_v1': 0.19636644,\n", + " 'runtime_lift': 7.2514581394,\n", + " 'key': ['s330073490', 's440501694']},\n", + " {'user_id': 'u218834617',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's048931274',\n", + " 'submission_id_v1': 's960526895',\n", + " 'cpu_time_v0': 127,\n", + " 'cpu_time_v1': 59,\n", + " 'memory_v0': 17264,\n", + " 'memory_v1': 17228,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 53.54,\n", + " 'input': 'import sys\\n\\nN,M=list(map(int,input().split()))\\n\\nS=set(map(int,sys.stdin))\\n\\n\\n\\na,b=0,1\\n\\nfor i in range(1,N+1):\\n\\n if i in S:\\n\\n a,b=b,0\\n\\n else:\\n\\n a,b=b,a+b\\n\\n\\n\\nprint((b%(10**9+7)))\\n',\n", + " 'target': 'import sys\\n\\n\\n\\nN,M=list(map(int,input().split()))\\n\\nbad=set(map(int,sys.stdin))\\n\\nMOD=10**9+7\\n\\n\\n\\na,b=0,1\\n\\nfor i in range(1,N+1):\\n\\n if i in bad:\\n\\n a,b=b,0\\n\\n if a==0:\\n\\n break\\n\\n else:\\n\\n a,b=b,(a+b)%MOD\\n\\n\\n\\nprint(b)\\n',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 188,\n", + " 'code_v1_num_chars': 240,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nN, M = list(map(int, input().split()))\\nS = set(map(int, sys.stdin))\\na, b = 0, 1\\nfor i in range(1, N + 1):\\n if i in S:\\n a, b = b, 0\\n else:\\n a, b = b, a + b\\nprint((b % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nN, M = list(map(int, input().split()))\\nbad = set(map(int, sys.stdin))\\nMOD = 10**9 + 7\\na, b = 0, 1\\nfor i in range(1, N + 1):\\n if i in bad:\\n a, b = b, 0\\n if a == 0:\\n break\\n else:\\n a, b = b, (a + b) % MOD\\nprint(b)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-S = set(map(int, sys.stdin))',\n", + " '+bad = set(map(int, sys.stdin))',\n", + " '+MOD = 10**9 + 7',\n", + " '- if i in S:',\n", + " '+ if i in bad:',\n", + " '+ if a == 0:',\n", + " '+ break',\n", + " '- a, b = b, a + b',\n", + " '-print((b % (10**9 + 7)))',\n", + " '+ a, b = b, (a + b) % MOD',\n", + " '+print(b)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3212681165,\n", + " 'measured_runtime_v1': 0.212405349,\n", + " 'runtime_lift': 1.5125236626,\n", + " 'key': ['s048931274', 's960526895']},\n", + " {'user_id': 'u072717685',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's067063811',\n", + " 'submission_id_v1': 's910505357',\n", + " 'cpu_time_v0': 35,\n", + " 'cpu_time_v1': 31,\n", + " 'memory_v0': 5084,\n", + " 'memory_v1': 9036,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.43,\n", + " 'input': 'def main():\\n\\n from statistics import mean\\n\\n from math import floor,ceil\\n\\n\\n\\n n = int(eval(input()))\\n\\n x = list(map(int, input().split()))\\n\\n x_mean = mean(x) \\n\\n if x_mean == 0.5:\\n\\n greater_than_x = len([i for i in x if i > x_mean])\\n\\n if greater_than_x * 2 >= n:\\n\\n x_mean = ceil(x_mean)\\n\\n else:\\n\\n x_mean = floor(x_mean)\\n\\n elif x_mean % 1 > 0.5:\\n\\n x_mean = ceil(x_mean)\\n\\n else:\\n\\n x_mean = floor(x_mean)\\n\\n x2 = [(num - x_mean)**2 for num in x]\\n\\n print((sum(x2)))\\n\\n\\n\\nmain()',\n", + " 'target': \"import sys\\n\\nread = sys.stdin.read\\n\\ndef main():\\n\\n n, *x = list(map(int, read().split()))\\n\\n r = float('inf')\\n\\n for i1 in range(1, 101):\\n\\n rt = 0\\n\\n for xe in x:\\n\\n rt += (xe - i1)**2\\n\\n r = min(r, rt)\\n\\n print(r)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 512,\n", + " 'code_v1_num_chars': 287,\n", + " 'code_v0_no_empty_lines': 'def main():\\n from statistics import mean\\n from math import floor, ceil\\n\\n n = int(eval(input()))\\n x = list(map(int, input().split()))\\n x_mean = mean(x)\\n if x_mean == 0.5:\\n greater_than_x = len([i for i in x if i > x_mean])\\n if greater_than_x * 2 >= n:\\n x_mean = ceil(x_mean)\\n else:\\n x_mean = floor(x_mean)\\n elif x_mean % 1 > 0.5:\\n x_mean = ceil(x_mean)\\n else:\\n x_mean = floor(x_mean)\\n x2 = [(num - x_mean) ** 2 for num in x]\\n print((sum(x2)))\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\n\\n\\ndef main():\\n n, *x = list(map(int, read().split()))\\n r = float(\"inf\")\\n for i1 in range(1, 101):\\n rt = 0\\n for xe in x:\\n rt += (xe - i1) ** 2\\n r = min(r, rt)\\n print(r)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-def main():',\n", + " '- from statistics import mean',\n", + " '- from math import floor, ceil',\n", + " '+import sys',\n", + " '- n = int(eval(input()))',\n", + " '- x = list(map(int, input().split()))',\n", + " '- x_mean = mean(x)',\n", + " '- if x_mean == 0.5:',\n", + " '- greater_than_x = len([i for i in x if i > x_mean])',\n", + " '- if greater_than_x * 2 >= n:',\n", + " '- x_mean = ceil(x_mean)',\n", + " '- else:',\n", + " '- x_mean = floor(x_mean)',\n", + " '- elif x_mean % 1 > 0.5:',\n", + " '- x_mean = ceil(x_mean)',\n", + " '- else:',\n", + " '- x_mean = floor(x_mean)',\n", + " '- x2 = [(num - x_mean) ** 2 for num in x]',\n", + " '- print((sum(x2)))',\n", + " '+read = sys.stdin.read',\n", + " '-main()',\n", + " '+def main():',\n", + " '+ n, *x = list(map(int, read().split()))',\n", + " '+ r = float(\"inf\")',\n", + " '+ for i1 in range(1, 101):',\n", + " '+ rt = 0',\n", + " '+ for xe in x:',\n", + " '+ rt += (xe - i1) ** 2',\n", + " '+ r = min(r, rt)',\n", + " '+ print(r)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3305953437,\n", + " 'measured_runtime_v1': 0.2443374534,\n", + " 'runtime_lift': 1.3530277041,\n", + " 'key': ['s067063811', 's910505357']},\n", + " {'user_id': 'u227082700',\n", + " 'problem_id': 'p02834',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's854767798',\n", + " 'submission_id_v1': 's662268715',\n", + " 'cpu_time_v0': 780,\n", + " 'cpu_time_v1': 670,\n", + " 'memory_v0': 84508,\n", + " 'memory_v1': 38312,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.1,\n", + " 'input': \"n,u,v=list(map(int,input().split()))\\n\\nanss=0\\n\\nu-=1\\n\\nv-=1\\n\\nd=[[]for _ in range(n)]\\n\\ninf=float('inf')\\n\\naoki=[inf]*n\\n\\nfor i in range(n-1):\\n\\n a,b=list(map(int,input().split()))\\n\\n a-=1\\n\\n b-=1\\n\\n d[a].append(b)\\n\\n d[b].append(a)\\n\\nQ=d[v]\\n\\naoki[v]=0\\n\\ndis=1\\n\\nvisited={v}\\n\\nwhile Q:\\n\\n P=[]\\n\\n for i in Q:\\n\\n visited.add(i)\\n\\n for j in d[i]:\\n\\n if j not in visited:P.append(j)\\n\\n aoki[i]=dis\\n\\n dis+=1\\n\\n Q=P\\n\\nQ=d[u]\\n\\nchokudai=[-1]*n\\n\\nchokudai[u]=0\\n\\ndis=1\\n\\nvisited={u}\\n\\npoint=-1\\n\\nwhile Q:\\n\\n P=[]\\n\\n for i in Q:\\n\\n visited.add(i)\\n\\n for j in d[i]:\\n\\n if aoki[j]<=dis+1:\\n\\n if aoki[j]==dis+1:anss=1\\n\\n if point<0:point=i\\n\\n continue\\n\\n if j not in visited:P.append(j)\\n\\n chokudai[i]=dis\\n\\n dis+=1\\n\\n Q=P\\n\\nQ=d[point]\\n\\ndis=chokudai[point]+1\\n\\nvisited={point}\\n\\nwhile Q:\\n\\n P=[]\\n\\n for i in Q:\\n\\n visited.add(i)\\n\\n if chokudai[i]==-1:continue\\n\\n chokudai[i]=max(dis,chokudai[i])\\n\\n for j in d[i]:\\n\\n if j not in visited:P.append(j)\\n\\n dis+=1\\n\\n Q=P\\n\\nans=0\\n\\nfor i in range(n):\\n\\n if aoki[i]>chokudai[i]:ans=max(ans,chokudai[i])\\n\\nprint((ans+anss))\\n\\n#print(aoki)\\n\\n#print(chokudai)\",\n", + " 'target': 'n,u,v=list(map(int,input().split()))\\n\\nu-=1\\n\\nv-=1\\n\\ne=[[]for _ in range(n)]\\n\\nfor i in range(n-1):\\n\\n a,b=list(map(int,input().split()))\\n\\n a-=1\\n\\n b-=1\\n\\n e[a].append(b)\\n\\n e[b].append(a)\\n\\ncho=[u]\\n\\ncho_dis=[10**7]*n\\n\\ncho_dis[u]=0\\n\\ncho_visited={u}\\n\\ncountt=1\\n\\nwhile cho:\\n\\n CHO=[]\\n\\n for i in cho:\\n\\n for j in e[i]:\\n\\n if j in cho_visited:continue\\n\\n cho_visited.add(j)\\n\\n CHO.append(j)\\n\\n cho_dis[j]=countt\\n\\n countt+=1\\n\\n cho=CHO\\n\\naok=[v]\\n\\naok_dis=[10**7]*n\\n\\naok_dis[v]=0\\n\\naok_visited={v}\\n\\ncountt=1\\n\\nwhile aok:\\n\\n AOK=[]\\n\\n for i in aok:\\n\\n for j in e[i]:\\n\\n if j in aok_visited:continue\\n\\n aok_visited.add(j)\\n\\n AOK.append(j)\\n\\n aok_dis[j]=countt\\n\\n countt+=1\\n\\n aok=AOK\\n\\nans=0\\n\\nfor i in range(n):\\n\\n if cho_dis[i] chokudai[i]:\\n ans = max(ans, chokudai[i])\\nprint((ans + anss))\\n# print(aoki)\\n# print(chokudai)\\n',\n", + " 'code_v1_no_empty_lines': 'n, u, v = list(map(int, input().split()))\\nu -= 1\\nv -= 1\\ne = [[] for _ in range(n)]\\nfor i in range(n - 1):\\n a, b = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n e[a].append(b)\\n e[b].append(a)\\ncho = [u]\\ncho_dis = [10**7] * n\\ncho_dis[u] = 0\\ncho_visited = {u}\\ncountt = 1\\nwhile cho:\\n CHO = []\\n for i in cho:\\n for j in e[i]:\\n if j in cho_visited:\\n continue\\n cho_visited.add(j)\\n CHO.append(j)\\n cho_dis[j] = countt\\n countt += 1\\n cho = CHO\\naok = [v]\\naok_dis = [10**7] * n\\naok_dis[v] = 0\\naok_visited = {v}\\ncountt = 1\\nwhile aok:\\n AOK = []\\n for i in aok:\\n for j in e[i]:\\n if j in aok_visited:\\n continue\\n aok_visited.add(j)\\n AOK.append(j)\\n aok_dis[j] = countt\\n countt += 1\\n aok = AOK\\nans = 0\\nfor i in range(n):\\n if cho_dis[i] < aok_dis[i]:\\n ans = max(ans, aok_dis[i] - 1)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.25,\n", + " 'diff': ['-anss = 0',\n", + " '-d = [[] for _ in range(n)]',\n", + " '-inf = float(\"inf\")',\n", + " '-aoki = [inf] * n',\n", + " '+e = [[] for _ in range(n)]',\n", + " '- d[a].append(b)',\n", + " '- d[b].append(a)',\n", + " '-Q = d[v]',\n", + " '-aoki[v] = 0',\n", + " '-dis = 1',\n", + " '-visited = {v}',\n", + " '-while Q:',\n", + " '- P = []',\n", + " '- for i in Q:',\n", + " '- visited.add(i)',\n", + " '- for j in d[i]:',\n", + " '- if j not in visited:',\n", + " '- P.append(j)',\n", + " '- aoki[i] = dis',\n", + " '- dis += 1',\n", + " '- Q = P',\n", + " '-Q = d[u]',\n", + " '-chokudai = [-1] * n',\n", + " '-chokudai[u] = 0',\n", + " '-dis = 1',\n", + " '-visited = {u}',\n", + " '-point = -1',\n", + " '-while Q:',\n", + " '- P = []',\n", + " '- for i in Q:',\n", + " '- visited.add(i)',\n", + " '- for j in d[i]:',\n", + " '- if aoki[j] <= dis + 1:',\n", + " '- if aoki[j] == dis + 1:',\n", + " '- anss = 1',\n", + " '- if point < 0:',\n", + " '- point = i',\n", + " '+ e[a].append(b)',\n", + " '+ e[b].append(a)',\n", + " '+cho = [u]',\n", + " '+cho_dis = [10**7] * n',\n", + " '+cho_dis[u] = 0',\n", + " '+cho_visited = {u}',\n", + " '+countt = 1',\n", + " '+while cho:',\n", + " '+ CHO = []',\n", + " '+ for i in cho:',\n", + " '+ for j in e[i]:',\n", + " '+ if j in cho_visited:',\n", + " '- if j not in visited:',\n", + " '- P.append(j)',\n", + " '- chokudai[i] = dis',\n", + " '- dis += 1',\n", + " '- Q = P',\n", + " '-Q = d[point]',\n", + " '-dis = chokudai[point] + 1',\n", + " '-visited = {point}',\n", + " '-while Q:',\n", + " '- P = []',\n", + " '- for i in Q:',\n", + " '- visited.add(i)',\n", + " '- if chokudai[i] == -1:',\n", + " '- continue',\n", + " '- chokudai[i] = max(dis, chokudai[i])',\n", + " '- for j in d[i]:',\n", + " '- if j not in visited:',\n", + " '- P.append(j)',\n", + " '- dis += 1',\n", + " '- Q = P',\n", + " '+ cho_visited.add(j)',\n", + " '+ CHO.append(j)',\n", + " '+ cho_dis[j] = countt',\n", + " '+ countt += 1',\n", + " '+ cho = CHO',\n", + " '+aok = [v]',\n", + " '+aok_dis = [10**7] * n',\n", + " '+aok_dis[v] = 0',\n", + " '+aok_visited = {v}',\n", + " '+countt = 1',\n", + " '+while aok:',\n", + " '+ AOK = []',\n", + " '+ for i in aok:',\n", + " '+ for j in e[i]:',\n", + " '+ if j in aok_visited:',\n", + " '+ continue',\n", + " '+ aok_visited.add(j)',\n", + " '+ AOK.append(j)',\n", + " '+ aok_dis[j] = countt',\n", + " '+ countt += 1',\n", + " '+ aok = AOK',\n", + " '- if aoki[i] > chokudai[i]:',\n", + " '- ans = max(ans, chokudai[i])',\n", + " '-print((ans + anss))',\n", + " '-# print(aoki)',\n", + " '-# print(chokudai)',\n", + " '+ if cho_dis[i] < aok_dis[i]:',\n", + " '+ ans = max(ans, aok_dis[i] - 1)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2686464586,\n", + " 'measured_runtime_v1': 0.0699197628,\n", + " 'runtime_lift': 3.842210666,\n", + " 'key': ['s854767798', 's662268715']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03034',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's230699006',\n", + " 'submission_id_v1': 's911725590',\n", + " 'cpu_time_v0': 873,\n", + " 'cpu_time_v1': 348,\n", + " 'memory_v0': 18552,\n", + " 'memory_v1': 12936,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 60.14,\n", + " 'input': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\nN = int(readline())\\n\\nS = np.array(read().split(),np.int64)\\n\\n\\n\\ndef F(d):\\n\\n # 公差を固定\\n\\n L = S[:-d:d].cumsum()\\n\\n R = S[::-1][:-d:d].cumsum()\\n\\n if (N-1)%d == 0:\\n\\n n = (N-1)//d\\n\\n x = np.arange(1,n+1)\\n\\n bl = (x+x <= n+1)\\n\\n L = L[bl]; R = R[bl]\\n\\n return (L+R).max()\\n\\n\\n\\ndef G(n):\\n\\n # 項数n+1を固定\\n\\n D = (N-1-n)//n\\n\\n L = np.zeros(D+1,np.int64)\\n\\n R = np.zeros(D+1,np.int64)\\n\\n for i in range(1,n+1):\\n\\n L += S[:i*(D+1):i]\\n\\n R += S[::-1][:i*(D+1):i]\\n\\n ok = np.ones(D+1,np.bool)\\n\\n overlap = (np.arange(D+1) * (n+n) >= N-1)\\n\\n overlap[1:] &= ((N-1)%np.arange(1,D+1) == 0)\\n\\n x = L+R\\n\\n x[overlap] = 0\\n\\n return x.max()\\n\\n\\n\\nL = int((N-1)**.5 + 10)\\n\\nL = min(N-1,L)\\n\\n\\n\\nx = max(F(n) for n in range(1,L+1))\\n\\ny = max(G(n) for n in range(1,L+1))\\n\\nanswer = max(x,y)\\n\\nprint(answer)',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nimport itertools\\n\\n\\n\\nN = int(readline())\\n\\nS = list(map(int,read().split()))\\n\\n\\n\\nanswer = 0\\n\\nfor d in range(1,N):\\n\\n n = (N-1)//d\\n\\n if (N-1)%d == 0:\\n\\n n = ((N-1)//d+1)//2\\n\\n if n <= 1:\\n\\n continue\\n\\n x = max(itertools.accumulate(x+y for x,y in zip(S[d:d*n:d],S[N-1-d:N-1-d*n:-d])))\\n\\n if answer < x:\\n\\n answer = x\\n\\n\\n\\nprint(answer)',\n", + " 'code_v0_loc': 43,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 980,\n", + " 'code_v1_num_chars': 479,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nimport numpy as np\\n\\nN = int(readline())\\nS = np.array(read().split(), np.int64)\\n\\n\\ndef F(d):\\n # 公差を固定\\n L = S[:-d:d].cumsum()\\n R = S[::-1][:-d:d].cumsum()\\n if (N - 1) % d == 0:\\n n = (N - 1) // d\\n x = np.arange(1, n + 1)\\n bl = x + x <= n + 1\\n L = L[bl]\\n R = R[bl]\\n return (L + R).max()\\n\\n\\ndef G(n):\\n # 項数n+1を固定\\n D = (N - 1 - n) // n\\n L = np.zeros(D + 1, np.int64)\\n R = np.zeros(D + 1, np.int64)\\n for i in range(1, n + 1):\\n L += S[: i * (D + 1) : i]\\n R += S[::-1][: i * (D + 1) : i]\\n ok = np.ones(D + 1, np.bool)\\n overlap = np.arange(D + 1) * (n + n) >= N - 1\\n overlap[1:] &= (N - 1) % np.arange(1, D + 1) == 0\\n x = L + R\\n x[overlap] = 0\\n return x.max()\\n\\n\\nL = int((N - 1) ** 0.5 + 10)\\nL = min(N - 1, L)\\nx = max(F(n) for n in range(1, L + 1))\\ny = max(G(n) for n in range(1, L + 1))\\nanswer = max(x, y)\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nimport itertools\\n\\nN = int(readline())\\nS = list(map(int, read().split()))\\nanswer = 0\\nfor d in range(1, N):\\n n = (N - 1) // d\\n if (N - 1) % d == 0:\\n n = ((N - 1) // d + 1) // 2\\n if n <= 1:\\n continue\\n x = max(\\n itertools.accumulate(\\n x + y for x, y in zip(S[d : d * n : d], S[N - 1 - d : N - 1 - d * n : -d])\\n )\\n )\\n if answer < x:\\n answer = x\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 48.8372093023,\n", + " 'diff': ['-import numpy as np',\n", + " '+import itertools',\n", + " '-S = np.array(read().split(), np.int64)',\n", + " '-',\n", + " '-',\n", + " '-def F(d):',\n", + " '- # 公差を固定',\n", + " '- L = S[:-d:d].cumsum()',\n", + " '- R = S[::-1][:-d:d].cumsum()',\n", + " '+S = list(map(int, read().split()))',\n", + " '+answer = 0',\n", + " '+for d in range(1, N):',\n", + " '+ n = (N - 1) // d',\n", + " '- n = (N - 1) // d',\n", + " '- x = np.arange(1, n + 1)',\n", + " '- bl = x + x <= n + 1',\n", + " '- L = L[bl]',\n", + " '- R = R[bl]',\n", + " '- return (L + R).max()',\n", + " '-',\n", + " '-',\n", + " '-def G(n):',\n", + " '- # 項数n+1を固定',\n", + " '- D = (N - 1 - n) // n',\n", + " '- L = np.zeros(D + 1, np.int64)',\n", + " '- R = np.zeros(D + 1, np.int64)',\n", + " '- for i in range(1, n + 1):',\n", + " '- L += S[: i * (D + 1) : i]',\n", + " '- R += S[::-1][: i * (D + 1) : i]',\n", + " '- ok = np.ones(D + 1, np.bool)',\n", + " '- overlap = np.arange(D + 1) * (n + n) >= N - 1',\n", + " '- overlap[1:] &= (N - 1) % np.arange(1, D + 1) == 0',\n", + " '- x = L + R',\n", + " '- x[overlap] = 0',\n", + " '- return x.max()',\n", + " '-',\n", + " '-',\n", + " '-L = int((N - 1) ** 0.5 + 10)',\n", + " '-L = min(N - 1, L)',\n", + " '-x = max(F(n) for n in range(1, L + 1))',\n", + " '-y = max(G(n) for n in range(1, L + 1))',\n", + " '-answer = max(x, y)',\n", + " '+ n = ((N - 1) // d + 1) // 2',\n", + " '+ if n <= 1:',\n", + " '+ continue',\n", + " '+ x = max(',\n", + " '+ itertools.accumulate(',\n", + " '+ x + y for x, y in zip(S[d : d * n : d], S[N - 1 - d : N - 1 - d * n : -d])',\n", + " '+ )',\n", + " '+ )',\n", + " '+ if answer < x:',\n", + " '+ answer = x'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5818065369,\n", + " 'measured_runtime_v1': 0.2384125237,\n", + " 'runtime_lift': 6.634745994,\n", + " 'key': ['s230699006', 's911725590']},\n", + " {'user_id': 'u119982001',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's761984261',\n", + " 'submission_id_v1': 's930653030',\n", + " 'cpu_time_v0': 42,\n", + " 'cpu_time_v1': 32,\n", + " 'memory_v0': 9160,\n", + " 'memory_v1': 9092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.81,\n", + " 'input': 'X=int(eval(input()))\\n\\n\\n\\nfor i in range(200):\\n\\n for j in range(-200,200):\\n\\n if X == (i**5-j**5):\\n\\n print((i, j))\\n\\n exit()\\n',\n", + " 'target': 'X=int(eval(input()))\\n\\n\\n\\nfor i in range(120):\\n\\n for j in range(-120,120):\\n\\n if X == (i**5-j**5):\\n\\n print((i, j))\\n\\n exit()\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 145,\n", + " 'code_v1_num_chars': 145,\n", + " 'code_v0_no_empty_lines': 'X = int(eval(input()))\\nfor i in range(200):\\n for j in range(-200, 200):\\n if X == (i**5 - j**5):\\n print((i, j))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'X = int(eval(input()))\\nfor i in range(120):\\n for j in range(-120, 120):\\n if X == (i**5 - j**5):\\n print((i, j))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in range(200):',\n", + " '- for j in range(-200, 200):',\n", + " '+for i in range(120):',\n", + " '+ for j in range(-120, 120):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2879281123,\n", + " 'measured_runtime_v1': 0.1173316002,\n", + " 'runtime_lift': 2.4539690233,\n", + " 'key': ['s761984261', 's930653030']},\n", + " {'user_id': 'u167751176',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's149883415',\n", + " 'submission_id_v1': 's931960732',\n", + " 'cpu_time_v0': 641,\n", + " 'cpu_time_v1': 91,\n", + " 'memory_v0': 97660,\n", + " 'memory_v1': 8708,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.8,\n", + " 'input': \"def main():\\n\\n\\tx, y, z, k = list(map(int, input().split()))\\n\\n\\ta = list(map(int, input().split()))\\n\\n\\tb = list(map(int, input().split()))\\n\\n\\tc = list(map(int, input().split()))\\n\\n\\td = [0]*x*y\\n\\n\\tfor i in range(x):\\n\\n\\t\\tfor j in range(y):\\n\\n\\t\\t\\td[i*y+j] = a[i]+b[j]\\n\\n\\td.sort(reverse=True)\\n\\n\\tc.sort(reverse=True)\\n\\n\\n\\n\\tc_len = min(k, z)\\n\\n\\td_len = min(k, x*y)\\n\\n\\te = [0]*d_len*c_len\\n\\n\\tfor i in range(d_len):\\n\\n\\t\\tfor j in range(c_len):\\n\\n\\t\\t\\te[i*c_len+j] = d[i] + c[j]\\n\\n\\te.sort(reverse=True)\\n\\n\\tfor i in range(k):\\n\\n\\t\\tprint((e[i]))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'target': \"def main():\\n\\n\\tx, y, z, k = list(map(int, input().split()))\\n\\n\\ta = list(map(int, input().split()))\\n\\n\\tb = list(map(int, input().split()))\\n\\n\\tc = list(map(int, input().split()))\\n\\n\\n\\n\\tsolve(a, b, c, x, y, z, k)\\n\\n\\n\\ndef solve(a, b, c, x, y, z, k):\\n\\n\\ta.sort(reverse=True)\\n\\n\\tb.sort(reverse=True)\\n\\n\\tc.sort(reverse=True)\\n\\n\\tstack = list()\\n\\n\\tfor p in range(x):\\n\\n\\t\\tfor q in range(y):\\n\\n\\t\\t\\tif (p+1)*(q+1) > k:\\n\\n\\t\\t\\t\\tbreak\\n\\n\\t\\t\\tfor r in range(z):\\n\\n\\t\\t\\t\\tif (p+1)*(q+1)*(r+1) > k:\\n\\n\\t\\t\\t\\t\\tbreak\\n\\n\\t\\t\\t\\tstack.append(a[p]+b[q]+c[r])\\n\\n\\tstack.sort(reverse=True)\\n\\n\\tfor i in range(k):\\n\\n\\t\\tprint((stack[i]))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 545,\n", + " 'code_v1_num_chars': 605,\n", + " 'code_v0_no_empty_lines': 'def main():\\n x, y, z, k = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n b = list(map(int, input().split()))\\n c = list(map(int, input().split()))\\n d = [0] * x * y\\n for i in range(x):\\n for j in range(y):\\n d[i * y + j] = a[i] + b[j]\\n d.sort(reverse=True)\\n c.sort(reverse=True)\\n c_len = min(k, z)\\n d_len = min(k, x * y)\\n e = [0] * d_len * c_len\\n for i in range(d_len):\\n for j in range(c_len):\\n e[i * c_len + j] = d[i] + c[j]\\n e.sort(reverse=True)\\n for i in range(k):\\n print((e[i]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n x, y, z, k = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n b = list(map(int, input().split()))\\n c = list(map(int, input().split()))\\n solve(a, b, c, x, y, z, k)\\n\\n\\ndef solve(a, b, c, x, y, z, k):\\n a.sort(reverse=True)\\n b.sort(reverse=True)\\n c.sort(reverse=True)\\n stack = list()\\n for p in range(x):\\n for q in range(y):\\n if (p + 1) * (q + 1) > k:\\n break\\n for r in range(z):\\n if (p + 1) * (q + 1) * (r + 1) > k:\\n break\\n stack.append(a[p] + b[q] + c[r])\\n stack.sort(reverse=True)\\n for i in range(k):\\n print((stack[i]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.4074074074,\n", + " 'diff': ['- d = [0] * x * y',\n", + " '- for i in range(x):',\n", + " '- for j in range(y):',\n", + " '- d[i * y + j] = a[i] + b[j]',\n", + " '- d.sort(reverse=True)',\n", + " '+ solve(a, b, c, x, y, z, k)',\n", + " '+',\n", + " '+',\n", + " '+def solve(a, b, c, x, y, z, k):',\n", + " '+ a.sort(reverse=True)',\n", + " '+ b.sort(reverse=True)',\n", + " '- c_len = min(k, z)',\n", + " '- d_len = min(k, x * y)',\n", + " '- e = [0] * d_len * c_len',\n", + " '- for i in range(d_len):',\n", + " '- for j in range(c_len):',\n", + " '- e[i * c_len + j] = d[i] + c[j]',\n", + " '- e.sort(reverse=True)',\n", + " '+ stack = list()',\n", + " '+ for p in range(x):',\n", + " '+ for q in range(y):',\n", + " '+ if (p + 1) * (q + 1) > k:',\n", + " '+ break',\n", + " '+ for r in range(z):',\n", + " '+ if (p + 1) * (q + 1) * (r + 1) > k:',\n", + " '+ break',\n", + " '+ stack.append(a[p] + b[q] + c[r])',\n", + " '+ stack.sort(reverse=True)',\n", + " '- print((e[i]))',\n", + " '+ print((stack[i]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3135767848,\n", + " 'measured_runtime_v1': 0.0401056306,\n", + " 'runtime_lift': 7.8187720726,\n", + " 'key': ['s149883415', 's931960732']},\n", + " {'user_id': 'u089230684',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's560811979',\n", + " 'submission_id_v1': 's868944422',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.91,\n", + " 'input': 'import math\\n\\nx = int(eval(input()))\\n\\nprint((math.factorial(x) % (10**9 + 7)))',\n", + " 'target': 'n = int(eval(input()))\\n\\nfact = 1\\n\\nfor i in range(1,n+1):\\n\\n fact = fact * i % (10**9 +7)\\n\\nres = fact % (10**9 + 7)\\n\\nprint(res)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 69,\n", + " 'code_v1_num_chars': 120,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nx = int(eval(input()))\\nprint((math.factorial(x) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nfact = 1\\nfor i in range(1, n + 1):\\n fact = fact * i % (10**9 + 7)\\nres = fact % (10**9 + 7)\\nprint(res)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-x = int(eval(input()))',\n", + " '-print((math.factorial(x) % (10**9 + 7)))',\n", + " '+n = int(eval(input()))',\n", + " '+fact = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ fact = fact * i % (10**9 + 7)',\n", + " '+res = fact % (10**9 + 7)',\n", + " '+print(res)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5532854562,\n", + " 'measured_runtime_v1': 0.2473686228,\n", + " 'runtime_lift': 2.2366840626,\n", + " 'key': ['s560811979', 's868944422']},\n", + " {'user_id': 'u379692329',\n", + " 'problem_id': 'p03720',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's591924545',\n", + " 'submission_id_v1': 's922681456',\n", + " 'cpu_time_v0': 155,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12452,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.03,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN, M = [int(x) for x in input().split()]\\n\\nL = [[int (y) for y in input().split()] for _ in range(M)]\\n\\nL = sum(L, [])\\n\\n\\n\\nfor i in np.arange(1, N+1):\\n\\n print((L.count(i)))',\n", + " 'target': 'N, M = [int(x) for x in input().split()]\\n\\nL = [[int (y) for y in input().split()] for _ in range(M)]\\n\\nL = sum(L, [])\\n\\n\\n\\nfor i in range(1, N+1):\\n\\n print((L.count(i)))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 192,\n", + " 'code_v1_num_chars': 166,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, M = [int(x) for x in input().split()]\\nL = [[int(y) for y in input().split()] for _ in range(M)]\\nL = sum(L, [])\\nfor i in np.arange(1, N + 1):\\n print((L.count(i)))\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = [int(x) for x in input().split()]\\nL = [[int(y) for y in input().split()] for _ in range(M)]\\nL = sum(L, [])\\nfor i in range(1, N + 1):\\n print((L.count(i)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-for i in np.arange(1, N + 1):',\n", + " '+for i in range(1, N + 1):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7429071844,\n", + " 'measured_runtime_v1': 0.246149132,\n", + " 'runtime_lift': 7.08069604,\n", + " 'key': ['s591924545', 's922681456']},\n", + " {'user_id': 'u588341295',\n", + " 'problem_id': 'p02748',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's850163388',\n", + " 'submission_id_v1': 's734063266',\n", + " 'cpu_time_v0': 667,\n", + " 'cpu_time_v1': 325,\n", + " 'memory_v0': 36848,\n", + " 'memory_v1': 18864,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 51.27,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\\n\\nimport sys\\n\\nfrom collections import Counter\\n\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\\n\\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\\n\\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\\n\\ndef ceil(x, y=1): return int(-(-x // y))\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\\n\\ndef Yes(): print(\\'Yes\\')\\n\\ndef No(): print(\\'No\\')\\n\\ndef YES(): print(\\'YES\\')\\n\\ndef NO(): print(\\'NO\\')\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = 10 ** 18\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\ndef fft(A, B):\\n\\n \"\"\" \\n\\n 高速フーリエ変換(FFT)\\n\\n A：出現回数をカウントしたリスト\\n\\n B：出現回数をカウントしたリスト\\n\\n \"\"\"\\n\\n import numpy as np\\n\\n from numpy.fft import rfft, irfft\\n\\n\\n\\n # 出現数カウント\\n\\n MAXA = max(A)\\n\\n MAXB = max(B)\\n\\n C1 = [0] * (MAXA+1)\\n\\n C2 = [0] * (MAXB+1)\\n\\n for a in A:\\n\\n C1[a] += 1\\n\\n for b in B:\\n\\n C2[b] += 1\\n\\n # max(A)+max(B)より大きい2冪\\n\\n L = 1\\n\\n k = 0\\n\\n while L <= MAXA + MAXB:\\n\\n k += 1\\n\\n L = 2**k\\n\\n # FFT\\n\\n res = irfft(rfft(C1, L) * rfft(C2, L), L)\\n\\n # 四捨五入して整数に\\n\\n res = np.rint(res).astype(np.int64)\\n\\n return res\\n\\n\\n\\nN, M, L = MAP()\\n\\nA = LIST()\\n\\nB = LIST()\\n\\n\\n\\nres = list(fft(A, B))\\n\\n\\n\\nmn = INF\\n\\nfor i, a in enumerate(res):\\n\\n if a != 0:\\n\\n mn = i\\n\\n break\\n\\n\\n\\nfor _ in range(L):\\n\\n x, y, c = MAP()\\n\\n x -= 1; y -= 1\\n\\n mn = min(mn, A[x] + B[y] - c)\\n\\nprint(mn)\\n',\n", + " 'target': \"# -*- coding: utf-8 -*-\\n\\n\\n\\nimport sys\\n\\nfrom collections import Counter\\n\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\\n\\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\\n\\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\\n\\ndef ceil(x, y=1): return int(-(-x // y))\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\\n\\ndef Yes(): print('Yes')\\n\\ndef No(): print('No')\\n\\ndef YES(): print('YES')\\n\\ndef NO(): print('NO')\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = 10 ** 18\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\nN, M, L = MAP()\\n\\nA = LIST()\\n\\nB = LIST()\\n\\n\\n\\nmn = min(A) + min(B)\\n\\nfor _ in range(L):\\n\\n x, y, c = MAP()\\n\\n x -= 1; y -= 1\\n\\n mn = min(mn, A[x] + B[y] - c)\\n\\nprint(mn)\\n\",\n", + " 'code_v0_loc': 68,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 1587,\n", + " 'code_v1_num_chars': 901,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\nfrom collections import Counter\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef list2d(a, b, c):\\n return [[c] * b for i in range(a)]\\n\\n\\ndef list3d(a, b, c, d):\\n return [[[d] * c for j in range(b)] for i in range(a)]\\n\\n\\ndef list4d(a, b, c, d, e):\\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\\n\\n\\ndef ceil(x, y=1):\\n return int(-(-x // y))\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST(N=None):\\n return list(MAP()) if N is None else [INT() for i in range(N)]\\n\\n\\ndef Yes():\\n print(\"Yes\")\\n\\n\\ndef No():\\n print(\"No\")\\n\\n\\ndef YES():\\n print(\"YES\")\\n\\n\\ndef NO():\\n print(\"NO\")\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = 10**18\\nMOD = 10**9 + 7\\n\\n\\ndef fft(A, B):\\n \"\"\"\\n 高速フーリエ変換(FFT)\\n A：出現回数をカウントしたリスト\\n B：出現回数をカウントしたリスト\\n \"\"\"\\n import numpy as np\\n from numpy.fft import rfft, irfft\\n\\n # 出現数カウント\\n MAXA = max(A)\\n MAXB = max(B)\\n C1 = [0] * (MAXA + 1)\\n C2 = [0] * (MAXB + 1)\\n for a in A:\\n C1[a] += 1\\n for b in B:\\n C2[b] += 1\\n # max(A)+max(B)より大きい2冪\\n L = 1\\n k = 0\\n while L <= MAXA + MAXB:\\n k += 1\\n L = 2**k\\n # FFT\\n res = irfft(rfft(C1, L) * rfft(C2, L), L)\\n # 四捨五入して整数に\\n res = np.rint(res).astype(np.int64)\\n return res\\n\\n\\nN, M, L = MAP()\\nA = LIST()\\nB = LIST()\\nres = list(fft(A, B))\\nmn = INF\\nfor i, a in enumerate(res):\\n if a != 0:\\n mn = i\\n break\\nfor _ in range(L):\\n x, y, c = MAP()\\n x -= 1\\n y -= 1\\n mn = min(mn, A[x] + B[y] - c)\\nprint(mn)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\nfrom collections import Counter\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef list2d(a, b, c):\\n return [[c] * b for i in range(a)]\\n\\n\\ndef list3d(a, b, c, d):\\n return [[[d] * c for j in range(b)] for i in range(a)]\\n\\n\\ndef list4d(a, b, c, d, e):\\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\\n\\n\\ndef ceil(x, y=1):\\n return int(-(-x // y))\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST(N=None):\\n return list(MAP()) if N is None else [INT() for i in range(N)]\\n\\n\\ndef Yes():\\n print(\"Yes\")\\n\\n\\ndef No():\\n print(\"No\")\\n\\n\\ndef YES():\\n print(\"YES\")\\n\\n\\ndef NO():\\n print(\"NO\")\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = 10**18\\nMOD = 10**9 + 7\\nN, M, L = MAP()\\nA = LIST()\\nB = LIST()\\nmn = min(A) + min(B)\\nfor _ in range(L):\\n x, y, c = MAP()\\n x -= 1\\n y -= 1\\n mn = min(mn, A[x] + B[y] - c)\\nprint(mn)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 54.4117647059,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def fft(A, B):',\n", + " '- \"\"\"',\n", + " '- 高速フーリエ変換(FFT)',\n", + " '- A：出現回数をカウントしたリスト',\n", + " '- B：出現回数をカウントしたリスト',\n", + " '- \"\"\"',\n", + " '- import numpy as np',\n", + " '- from numpy.fft import rfft, irfft',\n", + " '-',\n", + " '- # 出現数カウント',\n", + " '- MAXA = max(A)',\n", + " '- MAXB = max(B)',\n", + " '- C1 = [0] * (MAXA + 1)',\n", + " '- C2 = [0] * (MAXB + 1)',\n", + " '- for a in A:',\n", + " '- C1[a] += 1',\n", + " '- for b in B:',\n", + " '- C2[b] += 1',\n", + " '- # max(A)+max(B)より大きい2冪',\n", + " '- L = 1',\n", + " '- k = 0',\n", + " '- while L <= MAXA + MAXB:',\n", + " '- k += 1',\n", + " '- L = 2**k',\n", + " '- # FFT',\n", + " '- res = irfft(rfft(C1, L) * rfft(C2, L), L)',\n", + " '- # 四捨五入して整数に',\n", + " '- res = np.rint(res).astype(np.int64)',\n", + " '- return res',\n", + " '-',\n", + " '-',\n", + " '-res = list(fft(A, B))',\n", + " '-mn = INF',\n", + " '-for i, a in enumerate(res):',\n", + " '- if a != 0:',\n", + " '- mn = i',\n", + " '- break',\n", + " '+mn = min(A) + min(B)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0354720068,\n", + " 'measured_runtime_v1': 0.3338449564,\n", + " 'runtime_lift': 6.097057834,\n", + " 'key': ['s850163388', 's734063266']},\n", + " {'user_id': 'u416011173',\n", + " 'problem_id': 'p02615',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's077290395',\n", + " 'submission_id_v1': 's490562127',\n", + " 'cpu_time_v0': 209,\n", + " 'cpu_time_v1': 168,\n", + " 'memory_v0': 49528,\n", + " 'memory_v1': 32840,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 19.62,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n# モジュールのインポート\\n\\nimport math\\n\\nimport numpy as np\\n\\n\\n\\n# 標準入力を取得\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\n# 求解処理\\n\\nA = sorted(A, reverse=True)\\n\\nA = np.array(A)\\n\\nans = 2 * np.sum(A[:(N // 2)]) - A[0] + (N % 2) * A[math.floor(N / 2)]\\n\\n\\n\\n# 結果出力\\n\\nprint(ans)\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\n# モジュールのインポート\\n\\nimport math\\n\\n\\n\\n# 標準入力を取得\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\n# 求解処理\\n\\nA = sorted(A, reverse=True)\\n\\nans = 0\\n\\nfor n in range(1, N + 1):\\n\\n if n == 1:\\n\\n continue\\n\\n ans += A[math.ceil(n / 2) - 1]\\n\\n\\n\\n# 結果出力\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 290,\n", + " 'code_v1_num_chars': 287,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\n# モジュールのインポート\\nimport math\\nimport numpy as np\\n\\n# 標準入力を取得\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\n# 求解処理\\nA = sorted(A, reverse=True)\\nA = np.array(A)\\nans = 2 * np.sum(A[: (N // 2)]) - A[0] + (N % 2) * A[math.floor(N / 2)]\\n# 結果出力\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\n# モジュールのインポート\\nimport math\\n\\n# 標準入力を取得\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\n# 求解処理\\nA = sorted(A, reverse=True)\\nans = 0\\nfor n in range(1, N + 1):\\n if n == 1:\\n continue\\n ans += A[math.ceil(n / 2) - 1]\\n# 結果出力\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-import numpy as np',\n", + " '-A = np.array(A)',\n", + " '-ans = 2 * np.sum(A[: (N // 2)]) - A[0] + (N % 2) * A[math.floor(N / 2)]',\n", + " '+ans = 0',\n", + " '+for n in range(1, N + 1):',\n", + " '+ if n == 1:',\n", + " '+ continue',\n", + " '+ ans += A[math.ceil(n / 2) - 1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7039060501,\n", + " 'measured_runtime_v1': 0.2517175666,\n", + " 'runtime_lift': 6.7691185533,\n", + " 'key': ['s077290395', 's490562127']},\n", + " {'user_id': 'u970197315',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's588181559',\n", + " 'submission_id_v1': 's154731902',\n", + " 'cpu_time_v0': 63,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.02,\n", + " 'input': '# ABC95 C -Half and Half\\n\\na,b,c,x,y = list(map(float,input().split()))\\n\\nans = 0\\n\\nif a+b > 2*c:\\n\\n while x != 0.0 and y != 0.0:\\n\\n ans += 2*c\\n\\n x -= 1.0\\n\\n y -= 1.0\\n\\n if y == 0.0:\\n\\n while x != 0.0:\\n\\n if a > 2*c:\\n\\n ans += 2*c\\n\\n x -= 1.0\\n\\n else:\\n\\n ans += a\\n\\n x -= 1.0\\n\\n if x == 0.0:\\n\\n while y != 0.0:\\n\\n if b > 2*c:\\n\\n ans += 2*c\\n\\n y -= 1.0\\n\\n else:\\n\\n ans += b\\n\\n y -= 1.0\\n\\nelse:\\n\\n ans += a*x + b*y\\n\\nprint((int(ans)))\\n\\n\\n\\n ',\n", + " 'target': 'a,b,c,x,y=list(map(int,input().split()))\\n\\nans=0\\n\\nans1=0\\n\\n\\n\\ne=max(x,y)\\n\\nans1=e*(2*c)\\n\\nif 2*c 2 * c:\\n while x != 0.0 and y != 0.0:\\n ans += 2 * c\\n x -= 1.0\\n y -= 1.0\\n if y == 0.0:\\n while x != 0.0:\\n if a > 2 * c:\\n ans += 2 * c\\n x -= 1.0\\n else:\\n ans += a\\n x -= 1.0\\n if x == 0.0:\\n while y != 0.0:\\n if b > 2 * c:\\n ans += 2 * c\\n y -= 1.0\\n else:\\n ans += b\\n y -= 1.0\\nelse:\\n ans += a * x + b * y\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = 0\\nans1 = 0\\ne = max(x, y)\\nans1 = e * (2 * c)\\nif 2 * c < a + b:\\n d = min(x, y)\\n ans += c * (2 * d)\\n x -= d\\n y -= d\\nelse:\\n ans = a * x + b * y\\n x -= x\\n y -= y\\nans += x * a\\nans += y * b\\nprint((min(ans, ans1)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 37.9310344828,\n", + " 'diff': ['-# ABC95 C -Half and Half',\n", + " '-a, b, c, x, y = list(map(float, input().split()))',\n", + " '+a, b, c, x, y = list(map(int, input().split()))',\n", + " '-if a + b > 2 * c:',\n", + " '- while x != 0.0 and y != 0.0:',\n", + " '- ans += 2 * c',\n", + " '- x -= 1.0',\n", + " '- y -= 1.0',\n", + " '- if y == 0.0:',\n", + " '- while x != 0.0:',\n", + " '- if a > 2 * c:',\n", + " '- ans += 2 * c',\n", + " '- x -= 1.0',\n", + " '- else:',\n", + " '- ans += a',\n", + " '- x -= 1.0',\n", + " '- if x == 0.0:',\n", + " '- while y != 0.0:',\n", + " '- if b > 2 * c:',\n", + " '- ans += 2 * c',\n", + " '- y -= 1.0',\n", + " '- else:',\n", + " '- ans += b',\n", + " '- y -= 1.0',\n", + " '+ans1 = 0',\n", + " '+e = max(x, y)',\n", + " '+ans1 = e * (2 * c)',\n", + " '+if 2 * c < a + b:',\n", + " '+ d = min(x, y)',\n", + " '+ ans += c * (2 * d)',\n", + " '+ x -= d',\n", + " '+ y -= d',\n", + " '- ans += a * x + b * y',\n", + " '-print((int(ans)))',\n", + " '+ ans = a * x + b * y',\n", + " '+ x -= x',\n", + " '+ y -= y',\n", + " '+ans += x * a',\n", + " '+ans += y * b',\n", + " '+print((min(ans, ans1)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3221288462,\n", + " 'measured_runtime_v1': 0.2473681471,\n", + " 'runtime_lift': 1.3022244371,\n", + " 'key': ['s588181559', 's154731902']},\n", + " {'user_id': 'u564589929',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's828672272',\n", + " 'submission_id_v1': 's142357126',\n", + " 'cpu_time_v0': 836,\n", + " 'cpu_time_v1': 221,\n", + " 'memory_v0': 14044,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.56,\n", + " 'input': \"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\n# input = sys.stdin.readline ####\\n\\nint1 = lambda x: int(x) - 1\\n\\ndef II(): return int(eval(input()))\\n\\n\\n\\ndef MI(): return list(map(int, input().split()))\\n\\ndef MI1(): return list(map(int1, input().split()))\\n\\n\\n\\ndef LI(): return list(map(int, input().split()))\\n\\ndef LI1(): return list(map(int1, input().split()))\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\n\\n\\ndef printlist(lst, k='\\\\n'): print((k.join(list(map(str, lst)))))\\n\\nINF = float('inf')\\n\\n\\n\\nimport numpy as np\\n\\n\\n\\ndef solve():\\n\\n n = II()\\n\\n D = np.zeros((10, 10))\\n\\n\\n\\n for i in range(1, n+1):\\n\\n s = list(str(i))\\n\\n l = int(s[0])\\n\\n r = int(s[-1])\\n\\n # print(s, l, r)\\n\\n D[l][r] += 1\\n\\n # print(D)\\n\\n\\n\\n ans = 0\\n\\n for i in range(10):\\n\\n for j in range(10):\\n\\n ans += D[i][j] * D[j][i]\\n\\n print((int(ans)))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n solve()\\n\",\n", + " 'target': \"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\n\\n# input = sys.stdin.readline ####\\n\\nint1 = lambda x: int(x) - 1\\n\\ndef II(): return int(eval(input()))\\n\\n\\n\\ndef MI(): return list(map(int, input().split()))\\n\\ndef MI1(): return list(map(int1, input().split()))\\n\\n\\n\\ndef LI(): return list(map(int, input().split()))\\n\\ndef LI1(): return list(map(int1, input().split()))\\n\\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\\n\\n\\n\\ndef printlist(lst, k='\\\\n'): print((k.join(list(map(str, lst)))))\\n\\nINF = float('inf')\\n\\n\\n\\ndef solve():\\n\\n n = II()\\n\\n D = [[0]*10 for _ in range(10)]\\n\\n\\n\\n for i in range(1, n+1):\\n\\n s = list(str(i))\\n\\n l = int(s[0])\\n\\n r = int(s[-1])\\n\\n # print(s, l, r)\\n\\n D[l][r] += 1\\n\\n # print(D)\\n\\n\\n\\n ans = 0\\n\\n for i in range(10):\\n\\n for j in range(10):\\n\\n ans += D[i][j] * D[j][i]\\n\\n print((int(ans)))\\n\\n\\n\\nif __name__ == '__main__':\\n\\n solve()\\n\",\n", + " 'code_v0_loc': 38,\n", + " 'code_v1_loc': 36,\n", + " 'code_v0_num_chars': 907,\n", + " 'code_v1_num_chars': 894,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\n# input = sys.stdin.readline ####\\nint1 = lambda x: int(x) - 1\\n\\n\\ndef II():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef MI1():\\n return list(map(int1, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, input().split()))\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef printlist(lst, k=\"\\\\n\"):\\n print((k.join(list(map(str, lst)))))\\n\\n\\nINF = float(\"inf\")\\nimport numpy as np\\n\\n\\ndef solve():\\n n = II()\\n D = np.zeros((10, 10))\\n for i in range(1, n + 1):\\n s = list(str(i))\\n l = int(s[0])\\n r = int(s[-1])\\n # print(s, l, r)\\n D[l][r] += 1\\n # print(D)\\n ans = 0\\n for i in range(10):\\n for j in range(10):\\n ans += D[i][j] * D[j][i]\\n print((int(ans)))\\n\\n\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**6)\\n# input = sys.stdin.readline ####\\nint1 = lambda x: int(x) - 1\\n\\n\\ndef II():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef MI1():\\n return list(map(int1, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI1():\\n return list(map(int1, input().split()))\\n\\n\\ndef LLI(rows_number):\\n return [LI() for _ in range(rows_number)]\\n\\n\\ndef printlist(lst, k=\"\\\\n\"):\\n print((k.join(list(map(str, lst)))))\\n\\n\\nINF = float(\"inf\")\\n\\n\\ndef solve():\\n n = II()\\n D = [[0] * 10 for _ in range(10)]\\n for i in range(1, n + 1):\\n s = list(str(i))\\n l = int(s[0])\\n r = int(s[-1])\\n # print(s, l, r)\\n D[l][r] += 1\\n # print(D)\\n ans = 0\\n for i in range(10):\\n for j in range(10):\\n ans += D[i][j] * D[j][i]\\n print((int(ans)))\\n\\n\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.2631578947,\n", + " 'diff': ['-import numpy as np',\n", + " '- D = np.zeros((10, 10))',\n", + " '+ D = [[0] * 10 for _ in range(10)]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6453994412,\n", + " 'measured_runtime_v1': 0.3645976332,\n", + " 'runtime_lift': 4.512918602,\n", + " 'key': ['s828672272', 's142357126']},\n", + " {'user_id': 'u389910364',\n", + " 'problem_id': 'p03007',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's018798749',\n", + " 'submission_id_v1': 's300834964',\n", + " 'cpu_time_v0': 1421,\n", + " 'cpu_time_v1': 375,\n", + " 'memory_v0': 124920,\n", + " 'memory_v1': 29800,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.61,\n", + " 'input': 'import heapq\\n\\nimport os\\n\\nimport sys\\n\\n\\n\\nif os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"_in.txt\", \"r\")\\n\\n\\n\\nsys.setrecursionlimit(2147483647)\\n\\nINF = float(\"inf\")\\n\\n\\n\\nN = int(sys.stdin.readline())\\n\\nA = list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\n# ans = []\\n\\n# while len(A) > 2:\\n\\n# x = max(A)\\n\\n# y = min(A)\\n\\n# A = A[1:-1]\\n\\n# next_max = max(A)\\n\\n# next_min = min(A)\\n\\n# if abs(x - y - next_min) < abs(y - x - next_max):\\n\\n# x, y = y, x\\n\\n# bisect.insort_left(A, x - y)\\n\\n# ans.append((x, y))\\n\\n# x, y = max(A), min(A)\\n\\n# ans.append((x, y))\\n\\n# print(x - y)\\n\\n# for a in ans:\\n\\n# print(*a)\\n\\n\\n\\n\\n\\nenable = [True] * N\\n\\nmins = [(a, i) for i, a in enumerate(A)]\\n\\nmaxes = [(-a, i) for i, a in enumerate(A)]\\n\\nheapq.heapify(mins)\\n\\nheapq.heapify(maxes)\\n\\n\\n\\nans = []\\n\\nfor _ in range(N - 2):\\n\\n x, xi = heapq.heappop(maxes)\\n\\n x *= -1\\n\\n y, yi = heapq.heappop(mins)\\n\\n enable[xi] = False\\n\\n enable[yi] = False\\n\\n while not enable[maxes[0][1]]:\\n\\n heapq.heappop(maxes)\\n\\n while not enable[mins[0][1]]:\\n\\n heapq.heappop(mins)\\n\\n next_max = -maxes[0][0]\\n\\n next_min = mins[0][0]\\n\\n if abs(x - y - next_min) < abs(y - x - next_max):\\n\\n x, y = y, x\\n\\n enable.append(True)\\n\\n heapq.heappush(mins, (x - y, len(enable) - 1))\\n\\n heapq.heappush(maxes, (y - x, len(enable) - 1))\\n\\n ans.append((x, y))\\n\\n\\n\\nx = -maxes[0][0]\\n\\ny = mins[0][0]\\n\\nans.append((x, y))\\n\\nprint((x - y))\\n\\nfor a in ans:\\n\\n print((*a))\\n',\n", + " 'target': 'import bisect\\n\\nimport os\\n\\nfrom collections import Counter, deque\\n\\nfrom fractions import gcd\\n\\nfrom functools import lru_cache\\n\\nfrom functools import reduce\\n\\nimport functools\\n\\nimport heapq\\n\\nimport itertools\\n\\nimport math\\n\\nimport numpy as np\\n\\nimport re\\n\\nimport string\\n\\nimport sys\\n\\n\\n\\nif os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"_in.txt\", \"r\")\\n\\n\\n\\nsys.setrecursionlimit(2147483647)\\n\\nINF = float(\"inf\")\\n\\n\\n\\nN = int(sys.stdin.readline())\\n\\nA = list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\nplus = []\\n\\nminus = []\\n\\n\\n\\nfor a in A:\\n\\n if a >= 0:\\n\\n plus.append(a)\\n\\n else:\\n\\n minus.append(a)\\n\\nif not plus:\\n\\n mm = max(minus)\\n\\n plus.append(mm)\\n\\n minus.remove(mm)\\n\\nif not minus:\\n\\n mp = min(plus)\\n\\n minus.append(mp)\\n\\n plus.remove(mp)\\n\\n\\n\\nhist = []\\n\\nx = minus.pop()\\n\\nwhile len(plus) > 1:\\n\\n y = plus.pop()\\n\\n hist.append((x, y))\\n\\n x = x - y\\n\\nminus.append(x)\\n\\n\\n\\nx = plus.pop()\\n\\nwhile len(minus) > 1:\\n\\n y = minus.pop()\\n\\n hist.append((x, y))\\n\\n x = x - y\\n\\ny = minus.pop()\\n\\nhist.append((x, y))\\n\\n\\n\\nprint((x - y))\\n\\nfor h in hist:\\n\\n print((*h))\\n',\n", + " 'code_v0_loc': 63,\n", + " 'code_v1_loc': 60,\n", + " 'code_v0_num_chars': 1453,\n", + " 'code_v1_num_chars': 1068,\n", + " 'code_v0_no_empty_lines': 'import heapq\\nimport os\\nimport sys\\n\\nif os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"_in.txt\", \"r\")\\nsys.setrecursionlimit(2147483647)\\nINF = float(\"inf\")\\nN = int(sys.stdin.readline())\\nA = list(map(int, sys.stdin.readline().split()))\\n# ans = []\\n# while len(A) > 2:\\n# x = max(A)\\n# y = min(A)\\n# A = A[1:-1]\\n# next_max = max(A)\\n# next_min = min(A)\\n# if abs(x - y - next_min) < abs(y - x - next_max):\\n# x, y = y, x\\n# bisect.insort_left(A, x - y)\\n# ans.append((x, y))\\n# x, y = max(A), min(A)\\n# ans.append((x, y))\\n# print(x - y)\\n# for a in ans:\\n# print(*a)\\nenable = [True] * N\\nmins = [(a, i) for i, a in enumerate(A)]\\nmaxes = [(-a, i) for i, a in enumerate(A)]\\nheapq.heapify(mins)\\nheapq.heapify(maxes)\\nans = []\\nfor _ in range(N - 2):\\n x, xi = heapq.heappop(maxes)\\n x *= -1\\n y, yi = heapq.heappop(mins)\\n enable[xi] = False\\n enable[yi] = False\\n while not enable[maxes[0][1]]:\\n heapq.heappop(maxes)\\n while not enable[mins[0][1]]:\\n heapq.heappop(mins)\\n next_max = -maxes[0][0]\\n next_min = mins[0][0]\\n if abs(x - y - next_min) < abs(y - x - next_max):\\n x, y = y, x\\n enable.append(True)\\n heapq.heappush(mins, (x - y, len(enable) - 1))\\n heapq.heappush(maxes, (y - x, len(enable) - 1))\\n ans.append((x, y))\\nx = -maxes[0][0]\\ny = mins[0][0]\\nans.append((x, y))\\nprint((x - y))\\nfor a in ans:\\n print((*a))\\n',\n", + " 'code_v1_no_empty_lines': 'import bisect\\nimport os\\nfrom collections import Counter, deque\\nfrom fractions import gcd\\nfrom functools import lru_cache\\nfrom functools import reduce\\nimport functools\\nimport heapq\\nimport itertools\\nimport math\\nimport numpy as np\\nimport re\\nimport string\\nimport sys\\n\\nif os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"_in.txt\", \"r\")\\nsys.setrecursionlimit(2147483647)\\nINF = float(\"inf\")\\nN = int(sys.stdin.readline())\\nA = list(map(int, sys.stdin.readline().split()))\\nplus = []\\nminus = []\\nfor a in A:\\n if a >= 0:\\n plus.append(a)\\n else:\\n minus.append(a)\\nif not plus:\\n mm = max(minus)\\n plus.append(mm)\\n minus.remove(mm)\\nif not minus:\\n mp = min(plus)\\n minus.append(mp)\\n plus.remove(mp)\\nhist = []\\nx = minus.pop()\\nwhile len(plus) > 1:\\n y = plus.pop()\\n hist.append((x, y))\\n x = x - y\\nminus.append(x)\\nx = plus.pop()\\nwhile len(minus) > 1:\\n y = minus.pop()\\n hist.append((x, y))\\n x = x - y\\ny = minus.pop()\\nhist.append((x, y))\\nprint((x - y))\\nfor h in hist:\\n print((*h))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.7619047619,\n", + " 'diff': ['+import bisect',\n", + " '+import os',\n", + " '+from collections import Counter, deque',\n", + " '+from fractions import gcd',\n", + " '+from functools import lru_cache',\n", + " '+from functools import reduce',\n", + " '+import functools',\n", + " '-import os',\n", + " '+import itertools',\n", + " '+import math',\n", + " '+import numpy as np',\n", + " '+import re',\n", + " '+import string',\n", + " '-# ans = []',\n", + " '-# while len(A) > 2:',\n", + " '-# x = max(A)',\n", + " '-# y = min(A)',\n", + " '-# A = A[1:-1]',\n", + " '-# next_max = max(A)',\n", + " '-# next_min = min(A)',\n", + " '-# if abs(x - y - next_min) < abs(y - x - next_max):',\n", + " '-# x, y = y, x',\n", + " '-# bisect.insort_left(A, x - y)',\n", + " '-# ans.append((x, y))',\n", + " '-# x, y = max(A), min(A)',\n", + " '-# ans.append((x, y))',\n", + " '-# print(x - y)',\n", + " '-# for a in ans:',\n", + " '-# print(*a)',\n", + " '-enable = [True] * N',\n", + " '-mins = [(a, i) for i, a in enumerate(A)]',\n", + " '-maxes = [(-a, i) for i, a in enumerate(A)]',\n", + " '-heapq.heapify(mins)',\n", + " '-heapq.heapify(maxes)',\n", + " '-ans = []',\n", + " '-for _ in range(N - 2):',\n", + " '- x, xi = heapq.heappop(maxes)',\n", + " '- x *= -1',\n", + " '- y, yi = heapq.heappop(mins)',\n", + " '- enable[xi] = False',\n", + " '- enable[yi] = False',\n", + " '- while not enable[maxes[0][1]]:',\n", + " '- heapq.heappop(maxes)',\n", + " '- while not enable[mins[0][1]]:',\n", + " '- heapq.heappop(mins)',\n", + " '- next_max = -maxes[0][0]',\n", + " '- next_min = mins[0][0]',\n", + " '- if abs(x - y - next_min) < abs(y - x - next_max):',\n", + " '- x, y = y, x',\n", + " '- enable.append(True)',\n", + " '- heapq.heappush(mins, (x - y, len(enable) - 1))',\n", + " '- heapq.heappush(maxes, (y - x, len(enable) - 1))',\n", + " '- ans.append((x, y))',\n", + " '-x = -maxes[0][0]',\n", + " '-y = mins[0][0]',\n", + " '-ans.append((x, y))',\n", + " '+plus = []',\n", + " '+minus = []',\n", + " '+for a in A:',\n", + " '+ if a >= 0:',\n", + " '+ plus.append(a)',\n", + " '+ else:',\n", + " '+ minus.append(a)',\n", + " '+if not plus:',\n", + " '+ mm = max(minus)',\n", + " '+ plus.append(mm)',\n", + " '+ minus.remove(mm)',\n", + " '+if not minus:',\n", + " '+ mp = min(plus)',\n", + " '+ minus.append(mp)',\n", + " '+ plus.remove(mp)',\n", + " '+hist = []',\n", + " '+x = minus.pop()',\n", + " '+while len(plus) > 1:',\n", + " '+ y = plus.pop()',\n", + " '+ hist.append((x, y))',\n", + " '+ x = x - y',\n", + " '+minus.append(x)',\n", + " '+x = plus.pop()',\n", + " '+while len(minus) > 1:',\n", + " '+ y = minus.pop()',\n", + " '+ hist.append((x, y))',\n", + " '+ x = x - y',\n", + " '+y = minus.pop()',\n", + " '+hist.append((x, y))',\n", + " '-for a in ans:',\n", + " '- print((*a))',\n", + " '+for h in hist:',\n", + " '+ print((*h))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3442365975,\n", + " 'measured_runtime_v1': 0.2437948611,\n", + " 'runtime_lift': 1.4119928366,\n", + " 'key': ['s018798749', 's300834964']},\n", + " {'user_id': 'u855831834',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's777833838',\n", + " 'submission_id_v1': 's349314776',\n", + " 'cpu_time_v0': 179,\n", + " 'cpu_time_v1': 88,\n", + " 'memory_v0': 9072,\n", + " 'memory_v1': 63520,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.84,\n", + " 'input': 'k = int(eval(input()))\\n\\nnum = 0\\n\\nif not k%2:\\n\\n print((-1))\\n\\nelse:\\n\\n for i in range(k):\\n\\n num = (num*10+7)%k\\n\\n if num == 0:\\n\\n print((i+1))\\n\\n break\\n\\n else:\\n\\n print((-1))',\n", + " 'target': 'K = int(eval(input()))\\n\\n\\n\\nans = 1\\n\\nnum = 0\\n\\nseven = 7\\n\\n\\n\\nif not K%2:\\n\\n print((-1))\\n\\nelse:\\n\\n for i in range(K):\\n\\n num = num + seven\\n\\n seven = seven*10%K\\n\\n num = num%K\\n\\n if num == 0:\\n\\n print(ans)\\n\\n break\\n\\n ans += 1\\n\\n else:\\n\\n print((-1))',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 207,\n", + " 'code_v1_num_chars': 297,\n", + " 'code_v0_no_empty_lines': 'k = int(eval(input()))\\nnum = 0\\nif not k % 2:\\n print((-1))\\nelse:\\n for i in range(k):\\n num = (num * 10 + 7) % k\\n if num == 0:\\n print((i + 1))\\n break\\n else:\\n print((-1))\\n',\n", + " 'code_v1_no_empty_lines': 'K = int(eval(input()))\\nans = 1\\nnum = 0\\nseven = 7\\nif not K % 2:\\n print((-1))\\nelse:\\n for i in range(K):\\n num = num + seven\\n seven = seven * 10 % K\\n num = num % K\\n if num == 0:\\n print(ans)\\n break\\n ans += 1\\n else:\\n print((-1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.8421052632,\n", + " 'diff': ['-k = int(eval(input()))',\n", + " '+K = int(eval(input()))',\n", + " '+ans = 1',\n", + " '-if not k % 2:',\n", + " '+seven = 7',\n", + " '+if not K % 2:',\n", + " '- for i in range(k):',\n", + " '- num = (num * 10 + 7) % k',\n", + " '+ for i in range(K):',\n", + " '+ num = num + seven',\n", + " '+ seven = seven * 10 % K',\n", + " '+ num = num % K',\n", + " '- print((i + 1))',\n", + " '+ print(ans)',\n", + " '+ ans += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.513984643,\n", + " 'measured_runtime_v1': 0.3340408325,\n", + " 'runtime_lift': 1.5386880672,\n", + " 'key': ['s777833838', 's349314776']},\n", + " {'user_id': 'u813993459',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's822177134',\n", + " 'submission_id_v1': 's188572308',\n", + " 'cpu_time_v0': 110,\n", + " 'cpu_time_v1': 41,\n", + " 'memory_v0': 27216,\n", + " 'memory_v1': 9056,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.73,\n", + " 'input': 'import numpy as np\\n\\nx = int(eval(input()))\\n\\ntmp_list=[]\\n\\nc=0\\n\\ntmp_2=0\\n\\nwhile(1):\\n\\n tmp_1=c**5\\n\\n if (tmp_1 - tmp_2)<=x:\\n\\n tmp_list+=[tmp_1]\\n\\n else:\\n\\n break\\n\\n tmp_2=tmp_1\\n\\n c+=1\\n\\n \\n\\ndef せいがわ(target:list,x) -> list:\\n\\n for i in np.flipud(target):\\n\\n for j in target:\\n\\n tmp=i+j\\n\\n if tmp==x:\\n\\n return [int(i**(1/5)),int(j**(1/5))*-1]\\n\\n if tmp>x:\\n\\n break\\n\\n return 0\\n\\n \\n\\ndef ふがわ(target:list,x) -> list:\\n\\n for i in np.flipud(target):\\n\\n for j in target:\\n\\n tmp=i-j\\n\\n if tmp==x:\\n\\n return [int(i**(1/5)),int(j**(1/5))]\\n\\n if tmp list:\\n for i in np.flipud(target):\\n for j in target:\\n tmp = i + j\\n if tmp == x:\\n return [int(i ** (1 / 5)), int(j ** (1 / 5)) * -1]\\n if tmp > x:\\n break\\n return 0\\n\\n\\ndef ふがわ(target: list, x) -> list:\\n for i in np.flipud(target):\\n for j in target:\\n tmp = i - j\\n if tmp == x:\\n return [int(i ** (1 / 5)), int(j ** (1 / 5))]\\n if tmp < x:\\n break\\n return 0\\n\\n\\nans = ふがわ(tmp_list, x)\\nif ans == 0:\\n ans = せいがわ(tmp_list, x)\\nprint((ans[0], ans[1]))\\n',\n", + " 'code_v1_no_empty_lines': 'X = int(eval(input()))\\nfor a in range(0, 121):\\n for b in range(0, 121):\\n if X == a**5 - b**5:\\n print((a, b))\\n exit()\\n elif X == a**5 + b**5:\\n print((a, -b))\\n exit()\\n elif X == -(a**5) - (10**4 - b) ** 5:\\n print((-a, 10**4 - b))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 68.4210526316,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-x = int(eval(input()))',\n", + " '-tmp_list = []',\n", + " '-c = 0',\n", + " '-tmp_2 = 0',\n", + " '-while 1:',\n", + " '- tmp_1 = c**5',\n", + " '- if (tmp_1 - tmp_2) <= x:',\n", + " '- tmp_list += [tmp_1]',\n", + " '- else:',\n", + " '- break',\n", + " '- tmp_2 = tmp_1',\n", + " '- c += 1',\n", + " '-',\n", + " '-',\n", + " '-def せいがわ(target: list, x) -> list:',\n", + " '- for i in np.flipud(target):',\n", + " '- for j in target:',\n", + " '- tmp = i + j',\n", + " '- if tmp == x:',\n", + " '- return [int(i ** (1 / 5)), int(j ** (1 / 5)) * -1]',\n", + " '- if tmp > x:',\n", + " '- break',\n", + " '- return 0',\n", + " '-',\n", + " '-',\n", + " '-def ふがわ(target: list, x) -> list:',\n", + " '- for i in np.flipud(target):',\n", + " '- for j in target:',\n", + " '- tmp = i - j',\n", + " '- if tmp == x:',\n", + " '- return [int(i ** (1 / 5)), int(j ** (1 / 5))]',\n", + " '- if tmp < x:',\n", + " '- break',\n", + " '- return 0',\n", + " '-',\n", + " '-',\n", + " '-ans = ふがわ(tmp_list, x)',\n", + " '-if ans == 0:',\n", + " '- ans = せいがわ(tmp_list, x)',\n", + " '-print((ans[0], ans[1]))',\n", + " '+X = int(eval(input()))',\n", + " '+for a in range(0, 121):',\n", + " '+ for b in range(0, 121):',\n", + " '+ if X == a**5 - b**5:',\n", + " '+ print((a, b))',\n", + " '+ exit()',\n", + " '+ elif X == a**5 + b**5:',\n", + " '+ print((a, -b))',\n", + " '+ exit()',\n", + " '+ elif X == -(a**5) - (10**4 - b) ** 5:',\n", + " '+ print((-a, 10**4 - b))',\n", + " '+ exit()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0893567204,\n", + " 'measured_runtime_v1': 0.3149728358,\n", + " 'runtime_lift': 6.6334505171,\n", + " 'key': ['s822177134', 's188572308']},\n", + " {'user_id': 'u503228842',\n", + " 'problem_id': 'p03363',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's333415387',\n", + " 'submission_id_v1': 's550734009',\n", + " 'cpu_time_v0': 299,\n", + " 'cpu_time_v1': 187,\n", + " 'memory_v0': 39380,\n", + " 'memory_v1': 41492,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 37.46,\n", + " 'input': 'from collections import Counter\\n\\nimport numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = np.array(input().split(), dtype = np.int64)\\n\\n\\n\\nc = Counter(A.cumsum())\\n\\nc[0] += 1\\n\\nanswer = sum(x*(x-1)//2 for x in list(c.values()))\\n\\nprint(answer)\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\ncsum = [0]\\n\\ntemp = 0\\n\\nfor a in A:\\n\\n temp += a\\n\\n csum.append(temp)\\n\\n# csum.sort()\\n\\n# print(csum)\\n\\nfrom collections import Counter\\n\\nfreq = Counter(csum)\\n\\nans = 0\\n\\nfor v in list(freq.values()):\\n\\n ans += (v*(v-1))//2\\n\\nprint(ans)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 220,\n", + " 'code_v1_num_chars': 281,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\nimport numpy as np\\n\\nN = int(eval(input()))\\nA = np.array(input().split(), dtype=np.int64)\\nc = Counter(A.cumsum())\\nc[0] += 1\\nanswer = sum(x * (x - 1) // 2 for x in list(c.values()))\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\ncsum = [0]\\ntemp = 0\\nfor a in A:\\n temp += a\\n csum.append(temp)\\n# csum.sort()\\n# print(csum)\\nfrom collections import Counter\\n\\nfreq = Counter(csum)\\nans = 0\\nfor v in list(freq.values()):\\n ans += (v * (v - 1)) // 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['+N = int(eval(input()))',\n", + " '+A = list(map(int, input().split()))',\n", + " '+csum = [0]',\n", + " '+temp = 0',\n", + " '+for a in A:',\n", + " '+ temp += a',\n", + " '+ csum.append(temp)',\n", + " '+# csum.sort()',\n", + " '+# print(csum)',\n", + " '-import numpy as np',\n", + " '-N = int(eval(input()))',\n", + " '-A = np.array(input().split(), dtype=np.int64)',\n", + " '-c = Counter(A.cumsum())',\n", + " '-c[0] += 1',\n", + " '-answer = sum(x * (x - 1) // 2 for x in list(c.values()))',\n", + " '-print(answer)',\n", + " '+freq = Counter(csum)',\n", + " '+ans = 0',\n", + " '+for v in list(freq.values()):',\n", + " '+ ans += (v * (v - 1)) // 2',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3650826566,\n", + " 'measured_runtime_v1': 0.2447019732,\n", + " 'runtime_lift': 5.5785518961,\n", + " 'key': ['s333415387', 's550734009']},\n", + " {'user_id': 'u227020436',\n", + " 'problem_id': 'p02691',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's398079244',\n", + " 'submission_id_v1': 's005565219',\n", + " 'cpu_time_v0': 275,\n", + " 'cpu_time_v1': 188,\n", + " 'memory_v0': 40672,\n", + " 'memory_v1': 40564,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 31.64,\n", + " 'input': '# E - This Message Will Self-Distruct in 5s\\n\\n\\n\\nfrom collections import Counter\\n\\n\\n\\nn = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nassert len(a) == n\\n\\n\\n\\n# Ai + Aj == j - i\\n\\n# Aj - j == -Ai - i\\n\\n\\n\\n# Aj - j の各値の個数\\n\\ndiff = Counter(a[j] - (j+1) for j in range(n))\\n\\n\\n\\n# 各Aiについて Aj - j == -Ai - i となるjの個数を数える\\n\\ncount = 0\\n\\nfor i in range(n):\\n\\n diff[a[i] - (i+1)] -= 1 # i自身を取り除く\\n\\n count += diff[-a[i] - (i+1)]\\n\\n\\n\\nprint(count)\\n',\n", + " 'target': '# E - This Message Will Self-Distruct in 5s\\n\\n\\n\\nfrom collections import Counter\\n\\n\\n\\nn = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nassert len(a) == n\\n\\n\\n\\n# Aj - j の各値の個数\\n\\ndiff = Counter(a[j] - (j+1) for j in range(n))\\n\\n\\n\\n# Aj - j == -Ai - i となる(i,j)の個数\\n\\ncount = sum(diff[-a[i] - (i+1)] for i in range(n))\\n\\nprint(count)\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 431,\n", + " 'code_v1_num_chars': 324,\n", + " 'code_v0_no_empty_lines': '# E - This Message Will Self-Distruct in 5s\\nfrom collections import Counter\\n\\nn = int(eval(input()))\\na = list(map(int, input().split()))\\nassert len(a) == n\\n# Ai + Aj == j - i\\n# Aj - j == -Ai - i\\n# Aj - j の各値の個数\\ndiff = Counter(a[j] - (j + 1) for j in range(n))\\n# 各Aiについて Aj - j == -Ai - i となるjの個数を数える\\ncount = 0\\nfor i in range(n):\\n diff[a[i] - (i + 1)] -= 1 # i自身を取り除く\\n count += diff[-a[i] - (i + 1)]\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': '# E - This Message Will Self-Distruct in 5s\\nfrom collections import Counter\\n\\nn = int(eval(input()))\\na = list(map(int, input().split()))\\nassert len(a) == n\\n# Aj - j の各値の個数\\ndiff = Counter(a[j] - (j + 1) for j in range(n))\\n# Aj - j == -Ai - i となる(i,j)の個数\\ncount = sum(diff[-a[i] - (i + 1)] for i in range(n))\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-# Ai + Aj == j - i',\n", + " '-# Aj - j == -Ai - i',\n", + " '-# 各Aiについて Aj - j == -Ai - i となるjの個数を数える',\n", + " '-count = 0',\n", + " '-for i in range(n):',\n", + " '- diff[a[i] - (i + 1)] -= 1 # i自身を取り除く',\n", + " '- count += diff[-a[i] - (i + 1)]',\n", + " '+# Aj - j == -Ai - i となる(i,j)の個数',\n", + " '+count = sum(diff[-a[i] - (i + 1)] for i in range(n))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3012974186,\n", + " 'measured_runtime_v1': 0.2404572899,\n", + " 'runtime_lift': 1.2530184411,\n", + " 'key': ['s398079244', 's005565219']},\n", + " {'user_id': 'u466335531',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's648346082',\n", + " 'submission_id_v1': 's083367920',\n", + " 'cpu_time_v0': 1558,\n", + " 'cpu_time_v1': 225,\n", + " 'memory_v0': 34220,\n", + " 'memory_v1': 26360,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.56,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN=int(eval(input()))\\n\\nA=list(map(int, input().split()))\\n\\n\\n\\nAA=[]\\n\\nfor i,a in enumerate(A):\\n\\n AA.append(a-i+1)\\n\\n\\n\\nb=np.median(AA)\\n\\nans=0\\n\\n\\n\\nfor a in AA:\\n\\n ans+=abs(a-b)\\n\\nprint((int(ans)))',\n", + " 'target': 'N=int(eval(input()))\\n\\nA=list(map(int,input().split()))\\n\\nB=[]\\n\\nfor i in range(N):\\n\\n B.append(A[i]-i-1)\\n\\nB.sort()\\n\\nif N%2:\\n\\n b=B[N//2]\\n\\nelse:\\n\\n b=(B[N//2]+B[N//2-1])//2\\n\\nans=0\\n\\nfor k in B:\\n\\n ans+=abs(k-b)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 206,\n", + " 'code_v1_num_chars': 220,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nAA = []\\nfor i, a in enumerate(A):\\n AA.append(a - i + 1)\\nb = np.median(AA)\\nans = 0\\nfor a in AA:\\n ans += abs(a - b)\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nB = []\\nfor i in range(N):\\n B.append(A[i] - i - 1)\\nB.sort()\\nif N % 2:\\n b = B[N // 2]\\nelse:\\n b = (B[N // 2] + B[N // 2 - 1]) // 2\\nans = 0\\nfor k in B:\\n ans += abs(k - b)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-AA = []',\n", + " '-for i, a in enumerate(A):',\n", + " '- AA.append(a - i + 1)',\n", + " '-b = np.median(AA)',\n", + " '+B = []',\n", + " '+for i in range(N):',\n", + " '+ B.append(A[i] - i - 1)',\n", + " '+B.sort()',\n", + " '+if N % 2:',\n", + " '+ b = B[N // 2]',\n", + " '+else:',\n", + " '+ b = (B[N // 2] + B[N // 2 - 1]) // 2',\n", + " '-for a in AA:',\n", + " '- ans += abs(a - b)',\n", + " '-print((int(ans)))',\n", + " '+for k in B:',\n", + " '+ ans += abs(k - b)',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5822621562,\n", + " 'measured_runtime_v1': 0.1663134053,\n", + " 'runtime_lift': 3.5009935324,\n", + " 'key': ['s648346082', 's083367920']},\n", + " {'user_id': 'u402629484',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's210362874',\n", + " 'submission_id_v1': 's375403495',\n", + " 'cpu_time_v0': 52,\n", + " 'cpu_time_v1': 31,\n", + " 'memory_v0': 9156,\n", + " 'memory_v1': 8904,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.38,\n", + " 'input': \"'''\\n\\nA = 500 とする。\\n\\nこのとき、X = 10^9 となるのは、 B = 499.9968... のとき。\\n\\n→ AまたはB (の絶対値) が大きすぎると、Xが10^9に収まらない。\\n\\n\\n\\nA, Bの探索範囲は -120~120で十分。\\n\\n'''\\n\\n\\n\\nfrom itertools import product\\n\\n\\n\\ndef main():\\n\\n X = int(eval(input()))\\n\\n for A, B in product(list(range(-150, 150)), list(range(-150, 150))):\\n\\n if A**5 - B**5 == X:\\n\\n print((A, B))\\n\\n return\\n\\n\\n\\nmain()\\n\\n\\n\",\n", + " 'target': 'from itertools import count\\n\\n\\n\\ndef main():\\n\\n X = int(eval(input()))\\n\\n for i in count():\\n\\n for A in (-i, i):\\n\\n for B in range(-i, i+1):\\n\\n if A**5 - B**5 == X:\\n\\n print((A, B))\\n\\n return\\n\\n\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 350,\n", + " 'code_v1_num_chars': 264,\n", + " 'code_v0_no_empty_lines': '\"\"\"\\nA = 500 とする。\\nこのとき、X = 10^9 となるのは、 B = 499.9968... のとき。\\n→ AまたはB (の絶対値) が大きすぎると、Xが10^9に収まらない。\\nA, Bの探索範囲は -120~120で十分。\\n\"\"\"\\nfrom itertools import product\\n\\n\\ndef main():\\n X = int(eval(input()))\\n for A, B in product(list(range(-150, 150)), list(range(-150, 150))):\\n if A**5 - B**5 == X:\\n print((A, B))\\n return\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'from itertools import count\\n\\n\\ndef main():\\n X = int(eval(input()))\\n for i in count():\\n for A in (-i, i):\\n for B in range(-i, i + 1):\\n if A**5 - B**5 == X:\\n print((A, B))\\n return\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.5789473684,\n", + " 'diff': ['-\"\"\"',\n", + " '-A = 500 とする。',\n", + " '-このとき、X = 10^9 となるのは、 B = 499.9968... のとき。',\n", + " '-→ AまたはB (の絶対値) が大きすぎると、Xが10^9に収まらない。',\n", + " '-A, Bの探索範囲は -120~120で十分。',\n", + " '-\"\"\"',\n", + " '-from itertools import product',\n", + " '+from itertools import count',\n", + " '- for A, B in product(list(range(-150, 150)), list(range(-150, 150))):',\n", + " '- if A**5 - B**5 == X:',\n", + " '- print((A, B))',\n", + " '- return',\n", + " '+ for i in count():',\n", + " '+ for A in (-i, i):',\n", + " '+ for B in range(-i, i + 1):',\n", + " '+ if A**5 - B**5 == X:',\n", + " '+ print((A, B))',\n", + " '+ return'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5383961856,\n", + " 'measured_runtime_v1': 0.3121367236,\n", + " 'runtime_lift': 1.724872932,\n", + " 'key': ['s210362874', 's375403495']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p03200',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's639682353',\n", + " 'submission_id_v1': 's546135650',\n", + " 'cpu_time_v0': 48,\n", + " 'cpu_time_v1': 43,\n", + " 'memory_v0': 3500,\n", + " 'memory_v1': 3500,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.42,\n", + " 'input': \"s = eval(input())\\n\\n\\n\\ncnt = 0\\n\\nans = 0\\n\\nfor c in s:\\n\\n if c == 'B':\\n\\n cnt += 1\\n\\n elif c == 'W':\\n\\n ans += cnt\\n\\nprint(ans)\\n\",\n", + " 'target': \"s = eval(input())\\n\\n\\n\\nans = 0\\n\\nb = 0\\n\\nfor ss in s:\\n\\n if ss == 'W':\\n\\n ans += b\\n\\n else:\\n\\n b += 1\\n\\nprint(ans)\\n\",\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 133,\n", + " 'code_v1_num_chars': 120,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\ncnt = 0\\nans = 0\\nfor c in s:\\n if c == \"B\":\\n cnt += 1\\n elif c == \"W\":\\n ans += cnt\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nans = 0\\nb = 0\\nfor ss in s:\\n if ss == \"W\":\\n ans += b\\n else:\\n b += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-cnt = 0',\n", + " '-for c in s:',\n", + " '- if c == \"B\":',\n", + " '- cnt += 1',\n", + " '- elif c == \"W\":',\n", + " '- ans += cnt',\n", + " '+b = 0',\n", + " '+for ss in s:',\n", + " '+ if ss == \"W\":',\n", + " '+ ans += b',\n", + " '+ else:',\n", + " '+ b += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2094221431,\n", + " 'measured_runtime_v1': 0.1051600281,\n", + " 'runtime_lift': 1.9914614603,\n", + " 'key': ['s639682353', 's546135650']},\n", + " {'user_id': 'u648212584',\n", + " 'problem_id': 'p02883',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's240795971',\n", + " 'submission_id_v1': 's404695253',\n", + " 'cpu_time_v0': 613,\n", + " 'cpu_time_v1': 511,\n", + " 'memory_v0': 38924,\n", + " 'memory_v1': 83684,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.64,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\n\\nimport numpy as np\\n\\n\\n\\ndef main():\\n\\n N,K = list(map(int,input().split()))\\n\\n a = list(map(int,input().split()))\\n\\n f = list(map(int,input().split()))\\n\\n a.sort()\\n\\n f.sort(reverse=True)\\n\\n\\n\\n if sum(a) <= K:\\n\\n print((0))\\n\\n else:\\n\\n a = np.array(a)\\n\\n f = np.array(f)\\n\\n left,right = 0,max(a)*max(f)\\n\\n while right-left > 1:\\n\\n mid = (left+right)//2\\n\\n pra = a-mid//f\\n\\n pra[pra<0] = 0\\n\\n if np.sum(pra) > K:\\n\\n left = mid\\n\\n else:\\n\\n right = mid\\n\\n print(right)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\n\\n\\n\\ndef main():\\n\\n N,K = list(map(int,input().split()))\\n\\n a = list(map(int,input().split()))\\n\\n f = list(map(int,input().split()))\\n\\n \\n\\n a.sort()\\n\\n f.sort(reverse=True)\\n\\n \\n\\n l,r = -1,max(a)*max(f)+1\\n\\n \\n\\n while r-l>1:\\n\\n mid = (r+l)//2\\n\\n count = 0\\n\\n for cost,dif in zip(a,f):\\n\\n if mid >= cost*dif:\\n\\n continue\\n\\n rest = cost*dif-mid\\n\\n count += -(-rest//dif)\\n\\n if count <= K:\\n\\n r = mid\\n\\n else:\\n\\n l = mid\\n\\n \\n\\n print(r)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 672,\n", + " 'code_v1_num_chars': 640,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\nimport numpy as np\\n\\n\\ndef main():\\n N, K = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n f = list(map(int, input().split()))\\n a.sort()\\n f.sort(reverse=True)\\n if sum(a) <= K:\\n print((0))\\n else:\\n a = np.array(a)\\n f = np.array(f)\\n left, right = 0, max(a) * max(f)\\n while right - left > 1:\\n mid = (left + right) // 2\\n pra = a - mid // f\\n pra[pra < 0] = 0\\n if np.sum(pra) > K:\\n left = mid\\n else:\\n right = mid\\n print(right)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\n\\n\\ndef main():\\n N, K = list(map(int, input().split()))\\n a = list(map(int, input().split()))\\n f = list(map(int, input().split()))\\n a.sort()\\n f.sort(reverse=True)\\n l, r = -1, max(a) * max(f) + 1\\n while r - l > 1:\\n mid = (r + l) // 2\\n count = 0\\n for cost, dif in zip(a, f):\\n if mid >= cost * dif:\\n continue\\n rest = cost * dif - mid\\n count += -(-rest // dif)\\n if count <= K:\\n r = mid\\n else:\\n l = mid\\n print(r)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '- if sum(a) <= K:',\n", + " '- print((0))',\n", + " '- else:',\n", + " '- a = np.array(a)',\n", + " '- f = np.array(f)',\n", + " '- left, right = 0, max(a) * max(f)',\n", + " '- while right - left > 1:',\n", + " '- mid = (left + right) // 2',\n", + " '- pra = a - mid // f',\n", + " '- pra[pra < 0] = 0',\n", + " '- if np.sum(pra) > K:',\n", + " '- left = mid',\n", + " '- else:',\n", + " '- right = mid',\n", + " '- print(right)',\n", + " '+ l, r = -1, max(a) * max(f) + 1',\n", + " '+ while r - l > 1:',\n", + " '+ mid = (r + l) // 2',\n", + " '+ count = 0',\n", + " '+ for cost, dif in zip(a, f):',\n", + " '+ if mid >= cost * dif:',\n", + " '+ continue',\n", + " '+ rest = cost * dif - mid',\n", + " '+ count += -(-rest // dif)',\n", + " '+ if count <= K:',\n", + " '+ r = mid',\n", + " '+ else:',\n", + " '+ l = mid',\n", + " '+ print(r)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4018948729,\n", + " 'measured_runtime_v1': 0.2158444211,\n", + " 'runtime_lift': 6.4949321617,\n", + " 'key': ['s240795971', 's404695253']},\n", + " {'user_id': 'u257162238',\n", + " 'problem_id': 'p02691',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's433671213',\n", + " 'submission_id_v1': 's939654113',\n", + " 'cpu_time_v0': 930,\n", + " 'cpu_time_v1': 228,\n", + " 'memory_v0': 50980,\n", + " 'memory_v1': 66228,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.48,\n", + " 'input': 'from collections import deque\\n\\nfrom itertools import product\\n\\nimport sys\\n\\nimport math\\n\\nimport numpy as np\\n\\nimport bisect\\n\\n\\n\\nsys.setrecursionlimit(200000)\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef read():\\n\\n N = int(input().strip())\\n\\n A = list(map(int, input().strip().split()))\\n\\n return N, A\\n\\n\\n\\n\\n\\ndef argsort(seq):\\n\\n return sorted(list(range(len(seq))), key=seq.__getitem__)\\n\\n\\n\\ndef solve(N, A):\\n\\n # x: i-A[i]の列\\n\\n X = np.array([i-A[i] for i in range(N)], dtype=np.int)\\n\\n # y: i+A[i]の列\\n\\n Y = np.array([i+A[i] for i in range(N)], dtype=np.int)\\n\\n keys = np.argsort(X)\\n\\n X = X[keys] # x[i] <= x[i+1]\\n\\n Y = Y[keys]\\n\\n ans = 0\\n\\n for y in Y:\\n\\n l = bisect.bisect_left(X, y)\\n\\n r = bisect.bisect_left(X, y+1)\\n\\n ans += r - l\\n\\n return ans\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n inputs = read()\\n\\n outputs = solve(*inputs)\\n\\n print((\"{}\".format(outputs)))\\n',\n", + " 'target': 'from collections import defaultdict\\n\\nfrom itertools import product\\n\\nimport sys\\n\\nimport math\\n\\nimport bisect\\n\\n\\n\\nsys.setrecursionlimit(200000)\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef read():\\n\\n N = int(input().strip())\\n\\n A = list(map(int, input().strip().split()))\\n\\n return N, A\\n\\n\\n\\n\\n\\ndef solve(N, A):\\n\\n # x: i-A[i]の列\\n\\n X = [i-A[i] for i in range(N)]\\n\\n # y: i+A[i]の列\\n\\n Y = [i+A[i] for i in range(N)]\\n\\n z = defaultdict(int)\\n\\n for y in Y:\\n\\n z[y] += 1\\n\\n return sum([z[x] for x in X])\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n inputs = read()\\n\\n outputs = solve(*inputs)\\n\\n print((\"{}\".format(outputs)))\\n',\n", + " 'code_v0_loc': 40,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 893,\n", + " 'code_v1_num_chars': 626,\n", + " 'code_v0_no_empty_lines': 'from collections import deque\\nfrom itertools import product\\nimport sys\\nimport math\\nimport numpy as np\\nimport bisect\\n\\nsys.setrecursionlimit(200000)\\ninput = sys.stdin.readline\\n\\n\\ndef read():\\n N = int(input().strip())\\n A = list(map(int, input().strip().split()))\\n return N, A\\n\\n\\ndef argsort(seq):\\n return sorted(list(range(len(seq))), key=seq.__getitem__)\\n\\n\\ndef solve(N, A):\\n # x: i-A[i]の列\\n X = np.array([i - A[i] for i in range(N)], dtype=np.int)\\n # y: i+A[i]の列\\n Y = np.array([i + A[i] for i in range(N)], dtype=np.int)\\n keys = np.argsort(X)\\n X = X[keys] # x[i] <= x[i+1]\\n Y = Y[keys]\\n ans = 0\\n for y in Y:\\n l = bisect.bisect_left(X, y)\\n r = bisect.bisect_left(X, y + 1)\\n ans += r - l\\n return ans\\n\\n\\nif __name__ == \"__main__\":\\n inputs = read()\\n outputs = solve(*inputs)\\n print((\"{}\".format(outputs)))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\nfrom itertools import product\\nimport sys\\nimport math\\nimport bisect\\n\\nsys.setrecursionlimit(200000)\\ninput = sys.stdin.readline\\n\\n\\ndef read():\\n N = int(input().strip())\\n A = list(map(int, input().strip().split()))\\n return N, A\\n\\n\\ndef solve(N, A):\\n # x: i-A[i]の列\\n X = [i - A[i] for i in range(N)]\\n # y: i+A[i]の列\\n Y = [i + A[i] for i in range(N)]\\n z = defaultdict(int)\\n for y in Y:\\n z[y] += 1\\n return sum([z[x] for x in X])\\n\\n\\nif __name__ == \"__main__\":\\n inputs = read()\\n outputs = solve(*inputs)\\n print((\"{}\".format(outputs)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.5,\n", + " 'diff': ['-from collections import deque',\n", + " '+from collections import defaultdict',\n", + " '-import numpy as np',\n", + " '-def argsort(seq):',\n", + " '- return sorted(list(range(len(seq))), key=seq.__getitem__)',\n", + " '-',\n", + " '-',\n", + " '- X = np.array([i - A[i] for i in range(N)], dtype=np.int)',\n", + " '+ X = [i - A[i] for i in range(N)]',\n", + " '- Y = np.array([i + A[i] for i in range(N)], dtype=np.int)',\n", + " '- keys = np.argsort(X)',\n", + " '- X = X[keys] # x[i] <= x[i+1]',\n", + " '- Y = Y[keys]',\n", + " '- ans = 0',\n", + " '+ Y = [i + A[i] for i in range(N)]',\n", + " '+ z = defaultdict(int)',\n", + " '- l = bisect.bisect_left(X, y)',\n", + " '- r = bisect.bisect_left(X, y + 1)',\n", + " '- ans += r - l',\n", + " '- return ans',\n", + " '+ z[y] += 1',\n", + " '+ return sum([z[x] for x in X])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2892834942,\n", + " 'measured_runtime_v1': 0.2085203347,\n", + " 'runtime_lift': 6.1830108603,\n", + " 'key': ['s433671213', 's939654113']},\n", + " {'user_id': 'u340781749',\n", + " 'problem_id': 'p02680',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's341076610',\n", + " 'submission_id_v1': 's034276815',\n", + " 'cpu_time_v0': 2314,\n", + " 'cpu_time_v1': 1930,\n", + " 'memory_v0': 1000052,\n", + " 'memory_v1': 915508,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.59,\n", + " 'input': \"import sys\\n\\n# from itertools import chain, accumulate\\n\\n\\n\\nn, m, *abcdef = list(map(int, sys.stdin.buffer.read().split()))\\n\\n\\n\\nver_lines = []\\n\\nhor_lines = []\\n\\nx_list = set()\\n\\ny_list = set()\\n\\nn3 = n * 3\\n\\nfor a, b, c in zip(abcdef[0:n3:3], abcdef[1:n3:3], abcdef[2:n3:3]):\\n\\n y_list.add(a)\\n\\n y_list.add(b)\\n\\n x_list.add(c)\\n\\n ver_lines.append((a, b, c))\\n\\n\\n\\nfor d, e, f in zip(abcdef[n3 + 0::3], abcdef[n3 + 1::3], abcdef[n3 + 2::3]):\\n\\n y_list.add(d)\\n\\n x_list.add(e)\\n\\n x_list.add(f)\\n\\n hor_lines.append((d, e, f))\\n\\nx_list.add(0)\\n\\ny_list.add(0)\\n\\n\\n\\nx_list = sorted(x_list)\\n\\ny_list = sorted(y_list)\\n\\nx_dict = {x: i for i, x in enumerate(x_list, start=1)}\\n\\ny_dict = {y: i for i, y in enumerate(y_list, start=1)}\\n\\nrow_real = len(x_list)\\n\\ncol_real = len(y_list)\\n\\nrow = row_real + 2\\n\\ncol = col_real + 2\\n\\nbanned_up_ij = [[0] * row for _ in range(col)]\\n\\nbanned_down_ij = [[0] * row for _ in range(col)]\\n\\nbanned_left_ij = [[0] * col for _ in range(row)]\\n\\nbanned_right_ij = [[0] * col for _ in range(row)]\\n\\nfor a, b, c in ver_lines:\\n\\n if a > b:\\n\\n a, b = b, a\\n\\n ai = y_dict[a]\\n\\n bi = y_dict[b]\\n\\n j = x_dict[c]\\n\\n banned_left_ij[j][ai] += 1\\n\\n banned_left_ij[j][bi] -= 1\\n\\n banned_right_ij[j - 1][ai] += 1\\n\\n banned_right_ij[j - 1][bi] -= 1\\n\\nfor d, e, f in hor_lines:\\n\\n if e > f:\\n\\n e, f = f, e\\n\\n i = y_dict[d]\\n\\n ej = x_dict[e]\\n\\n fj = x_dict[f]\\n\\n banned_up_ij[i][ej] += 1\\n\\n banned_up_ij[i][fj] -= 1\\n\\n banned_down_ij[i - 1][ej] += 1\\n\\n banned_down_ij[i - 1][fj] -= 1\\n\\n\\n\\nbanned_up = [0] * (row * col)\\n\\nbanned_down = [0] * (row * col)\\n\\nbanned_left = [0] * (row * col)\\n\\nbanned_right = [0] * (row * col)\\n\\nfor i in range(col):\\n\\n ru = banned_up_ij[i]\\n\\n rd = banned_down_ij[i]\\n\\n ri = row * i\\n\\n banned_up[ri] = ru[0]\\n\\n banned_down[ri] = rd[0]\\n\\n for j in range(1, row):\\n\\n banned_up[ri + j] = banned_up[ri + j - 1] + ru[j]\\n\\n banned_down[ri + j] = banned_down[ri + j - 1] + rd[j]\\n\\nfor j in range(row):\\n\\n rl = banned_left_ij[j]\\n\\n rr = banned_right_ij[j]\\n\\n banned_left[j] = rl[0]\\n\\n banned_right[j] = rr[0]\\n\\n for i in range(1, col):\\n\\n ri0 = (i - 1) * row\\n\\n ri1 = i * row\\n\\n banned_left[ri1 + j] = banned_left[ri0 + j] + rl[i]\\n\\n banned_right[ri1 + j] = banned_right[ri0 + j] + rr[i]\\n\\n\\n\\n# banned_up = list(chain.from_iterable(map(accumulate, banned_up_ij)))\\n\\n# banned_down = list(chain.from_iterable(map(accumulate, banned_down_ij)))\\n\\n# banned_left = list(chain.from_iterable(zip(*map(accumulate, banned_left_ij))))\\n\\n# banned_right = list(chain.from_iterable(zip(*map(accumulate, banned_right_ij))))\\n\\n\\n\\n# for i in range(col):\\n\\n# print(walls[i * row:(i + 1) * row])\\n\\n\\n\\ns = row * y_dict[0] + x_dict[0]\\n\\nenable = [-1] * row + ([-1] + [0] * (row - 2) + [-1]) * (col - 2) + [-1] * row\\n\\n\\n\\n# for i in range(col):\\n\\n# print(enable[i * row:(i + 1) * row])\\n\\n\\n\\nq = [s]\\n\\nmoves = [(-row, banned_up), (-1, banned_left), (1, banned_right), (row, banned_down)]\\n\\nwhile q:\\n\\n c = q.pop()\\n\\n if enable[c] == 1:\\n\\n continue\\n\\n elif enable[c] == -1:\\n\\n print('INF')\\n\\n exit()\\n\\n enable[c] = 1\\n\\n for dc, banned in moves:\\n\\n if banned[c]:\\n\\n continue\\n\\n nc = c + dc\\n\\n if enable[nc] == 1:\\n\\n continue\\n\\n q.append(nc)\\n\\n# for i in range(col):\\n\\n# print(enable[i * row:(i + 1) * row])\\n\\n\\n\\n\\n\\nans = 0\\n\\nfor i in range(col):\\n\\n ri = i * row\\n\\n for j in range(row):\\n\\n if enable[ri + j] != 1:\\n\\n continue\\n\\n t = y_list[i - 1]\\n\\n b = y_list[i]\\n\\n l = x_list[j - 1]\\n\\n r = x_list[j]\\n\\n ans += (b - t) * (r - l)\\n\\nprint(ans)\\n\",\n", + " 'target': \"import sys\\n\\n\\n\\n# from itertools import chain, accumulate\\n\\n\\n\\nn, m, *abcdef = list(map(int, sys.stdin.buffer.read().split()))\\n\\n\\n\\nver_lines = []\\n\\nhor_lines = []\\n\\nx_list = set()\\n\\ny_list = set()\\n\\nn3 = n * 3\\n\\nfor a, b, c in zip(abcdef[0:n3:3], abcdef[1:n3:3], abcdef[2:n3:3]):\\n\\n y_list.add(a)\\n\\n y_list.add(b)\\n\\n x_list.add(c)\\n\\n ver_lines.append((a, b, c))\\n\\n\\n\\nfor d, e, f in zip(abcdef[n3 + 0::3], abcdef[n3 + 1::3], abcdef[n3 + 2::3]):\\n\\n y_list.add(d)\\n\\n x_list.add(e)\\n\\n x_list.add(f)\\n\\n hor_lines.append((d, e, f))\\n\\nx_list.add(0)\\n\\ny_list.add(0)\\n\\n\\n\\nx_list = sorted(x_list)\\n\\ny_list = sorted(y_list)\\n\\nx_dict = {x: i for i, x in enumerate(x_list, start=1)}\\n\\ny_dict = {y: i for i, y in enumerate(y_list, start=1)}\\n\\nrow_real = len(x_list)\\n\\ncol_real = len(y_list)\\n\\nrow = row_real + 2\\n\\ncol = col_real + 2\\n\\n\\n\\nbanned_up = [0] * (row * col)\\n\\nbanned_down = [0] * (row * col)\\n\\nbanned_left = [0] * (row * col)\\n\\nbanned_right = [0] * (row * col)\\n\\nfor a, b, c in ver_lines:\\n\\n if a > b:\\n\\n a, b = b, a\\n\\n ai = y_dict[a] * row\\n\\n bi = y_dict[b] * row\\n\\n j = x_dict[c]\\n\\n banned_left[ai + j] += 1\\n\\n banned_left[bi + j] -= 1\\n\\n banned_right[ai + j - 1] += 1\\n\\n banned_right[bi + j - 1] -= 1\\n\\nfor d, e, f in hor_lines:\\n\\n if e > f:\\n\\n e, f = f, e\\n\\n ri = y_dict[d] * row\\n\\n ej = x_dict[e]\\n\\n fj = x_dict[f]\\n\\n banned_up[ri + ej] += 1\\n\\n banned_up[ri + fj] -= 1\\n\\n banned_down[ri - row + ej] += 1\\n\\n banned_down[ri - row + fj] -= 1\\n\\n\\n\\nfor i in range(1, col):\\n\\n ri0 = row * (i - 1)\\n\\n ri1 = row * i\\n\\n for j in range(1, row):\\n\\n banned_up[ri1 + j] += banned_up[ri1 + j - 1]\\n\\n banned_down[ri1 + j] += banned_down[ri1 + j - 1]\\n\\n banned_left[ri1 + j] += banned_left[ri0 + j]\\n\\n banned_right[ri1 + j] += banned_right[ri0 + j]\\n\\n\\n\\n# banned_up = list(chain.from_iterable(map(accumulate, banned_up_ij)))\\n\\n# banned_down = list(chain.from_iterable(map(accumulate, banned_down_ij)))\\n\\n# banned_left = list(chain.from_iterable(zip(*map(accumulate, banned_left_ij))))\\n\\n# banned_right = list(chain.from_iterable(zip(*map(accumulate, banned_right_ij))))\\n\\n\\n\\n# for i in range(col):\\n\\n# print(walls[i * row:(i + 1) * row])\\n\\n\\n\\ns = row * y_dict[0] + x_dict[0]\\n\\nenable = [-1] * row + ([-1] + [0] * (row - 2) + [-1]) * (col - 2) + [-1] * row\\n\\n\\n\\n# for i in range(col):\\n\\n# print(enable[i * row:(i + 1) * row])\\n\\n\\n\\nq = [s]\\n\\nmoves = [(-row, banned_up), (-1, banned_left), (1, banned_right), (row, banned_down)]\\n\\nwhile q:\\n\\n c = q.pop()\\n\\n if enable[c] == 1:\\n\\n continue\\n\\n elif enable[c] == -1:\\n\\n print('INF')\\n\\n exit()\\n\\n enable[c] = 1\\n\\n for dc, banned in moves:\\n\\n if banned[c]:\\n\\n continue\\n\\n nc = c + dc\\n\\n if enable[nc] == 1:\\n\\n continue\\n\\n q.append(nc)\\n\\n# for i in range(col):\\n\\n# print(enable[i * row:(i + 1) * row])\\n\\n\\n\\n\\n\\nans = 0\\n\\nfor i in range(col):\\n\\n ri = i * row\\n\\n for j in range(row):\\n\\n if enable[ri + j] != 1:\\n\\n continue\\n\\n t = y_list[i - 1]\\n\\n b = y_list[i]\\n\\n l = x_list[j - 1]\\n\\n r = x_list[j]\\n\\n ans += (b - t) * (r - l)\\n\\nprint(ans)\\n\",\n", + " 'code_v0_loc': 128,\n", + " 'code_v1_loc': 115,\n", + " 'code_v0_num_chars': 3630,\n", + " 'code_v1_num_chars': 3124,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\n# from itertools import chain, accumulate\\nn, m, *abcdef = list(map(int, sys.stdin.buffer.read().split()))\\nver_lines = []\\nhor_lines = []\\nx_list = set()\\ny_list = set()\\nn3 = n * 3\\nfor a, b, c in zip(abcdef[0:n3:3], abcdef[1:n3:3], abcdef[2:n3:3]):\\n y_list.add(a)\\n y_list.add(b)\\n x_list.add(c)\\n ver_lines.append((a, b, c))\\nfor d, e, f in zip(abcdef[n3 + 0 :: 3], abcdef[n3 + 1 :: 3], abcdef[n3 + 2 :: 3]):\\n y_list.add(d)\\n x_list.add(e)\\n x_list.add(f)\\n hor_lines.append((d, e, f))\\nx_list.add(0)\\ny_list.add(0)\\nx_list = sorted(x_list)\\ny_list = sorted(y_list)\\nx_dict = {x: i for i, x in enumerate(x_list, start=1)}\\ny_dict = {y: i for i, y in enumerate(y_list, start=1)}\\nrow_real = len(x_list)\\ncol_real = len(y_list)\\nrow = row_real + 2\\ncol = col_real + 2\\nbanned_up_ij = [[0] * row for _ in range(col)]\\nbanned_down_ij = [[0] * row for _ in range(col)]\\nbanned_left_ij = [[0] * col for _ in range(row)]\\nbanned_right_ij = [[0] * col for _ in range(row)]\\nfor a, b, c in ver_lines:\\n if a > b:\\n a, b = b, a\\n ai = y_dict[a]\\n bi = y_dict[b]\\n j = x_dict[c]\\n banned_left_ij[j][ai] += 1\\n banned_left_ij[j][bi] -= 1\\n banned_right_ij[j - 1][ai] += 1\\n banned_right_ij[j - 1][bi] -= 1\\nfor d, e, f in hor_lines:\\n if e > f:\\n e, f = f, e\\n i = y_dict[d]\\n ej = x_dict[e]\\n fj = x_dict[f]\\n banned_up_ij[i][ej] += 1\\n banned_up_ij[i][fj] -= 1\\n banned_down_ij[i - 1][ej] += 1\\n banned_down_ij[i - 1][fj] -= 1\\nbanned_up = [0] * (row * col)\\nbanned_down = [0] * (row * col)\\nbanned_left = [0] * (row * col)\\nbanned_right = [0] * (row * col)\\nfor i in range(col):\\n ru = banned_up_ij[i]\\n rd = banned_down_ij[i]\\n ri = row * i\\n banned_up[ri] = ru[0]\\n banned_down[ri] = rd[0]\\n for j in range(1, row):\\n banned_up[ri + j] = banned_up[ri + j - 1] + ru[j]\\n banned_down[ri + j] = banned_down[ri + j - 1] + rd[j]\\nfor j in range(row):\\n rl = banned_left_ij[j]\\n rr = banned_right_ij[j]\\n banned_left[j] = rl[0]\\n banned_right[j] = rr[0]\\n for i in range(1, col):\\n ri0 = (i - 1) * row\\n ri1 = i * row\\n banned_left[ri1 + j] = banned_left[ri0 + j] + rl[i]\\n banned_right[ri1 + j] = banned_right[ri0 + j] + rr[i]\\n# banned_up = list(chain.from_iterable(map(accumulate, banned_up_ij)))\\n# banned_down = list(chain.from_iterable(map(accumulate, banned_down_ij)))\\n# banned_left = list(chain.from_iterable(zip(*map(accumulate, banned_left_ij))))\\n# banned_right = list(chain.from_iterable(zip(*map(accumulate, banned_right_ij))))\\n# for i in range(col):\\n# print(walls[i * row:(i + 1) * row])\\ns = row * y_dict[0] + x_dict[0]\\nenable = [-1] * row + ([-1] + [0] * (row - 2) + [-1]) * (col - 2) + [-1] * row\\n# for i in range(col):\\n# print(enable[i * row:(i + 1) * row])\\nq = [s]\\nmoves = [(-row, banned_up), (-1, banned_left), (1, banned_right), (row, banned_down)]\\nwhile q:\\n c = q.pop()\\n if enable[c] == 1:\\n continue\\n elif enable[c] == -1:\\n print(\"INF\")\\n exit()\\n enable[c] = 1\\n for dc, banned in moves:\\n if banned[c]:\\n continue\\n nc = c + dc\\n if enable[nc] == 1:\\n continue\\n q.append(nc)\\n# for i in range(col):\\n# print(enable[i * row:(i + 1) * row])\\nans = 0\\nfor i in range(col):\\n ri = i * row\\n for j in range(row):\\n if enable[ri + j] != 1:\\n continue\\n t = y_list[i - 1]\\n b = y_list[i]\\n l = x_list[j - 1]\\n r = x_list[j]\\n ans += (b - t) * (r - l)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n# from itertools import chain, accumulate\\nn, m, *abcdef = list(map(int, sys.stdin.buffer.read().split()))\\nver_lines = []\\nhor_lines = []\\nx_list = set()\\ny_list = set()\\nn3 = n * 3\\nfor a, b, c in zip(abcdef[0:n3:3], abcdef[1:n3:3], abcdef[2:n3:3]):\\n y_list.add(a)\\n y_list.add(b)\\n x_list.add(c)\\n ver_lines.append((a, b, c))\\nfor d, e, f in zip(abcdef[n3 + 0 :: 3], abcdef[n3 + 1 :: 3], abcdef[n3 + 2 :: 3]):\\n y_list.add(d)\\n x_list.add(e)\\n x_list.add(f)\\n hor_lines.append((d, e, f))\\nx_list.add(0)\\ny_list.add(0)\\nx_list = sorted(x_list)\\ny_list = sorted(y_list)\\nx_dict = {x: i for i, x in enumerate(x_list, start=1)}\\ny_dict = {y: i for i, y in enumerate(y_list, start=1)}\\nrow_real = len(x_list)\\ncol_real = len(y_list)\\nrow = row_real + 2\\ncol = col_real + 2\\nbanned_up = [0] * (row * col)\\nbanned_down = [0] * (row * col)\\nbanned_left = [0] * (row * col)\\nbanned_right = [0] * (row * col)\\nfor a, b, c in ver_lines:\\n if a > b:\\n a, b = b, a\\n ai = y_dict[a] * row\\n bi = y_dict[b] * row\\n j = x_dict[c]\\n banned_left[ai + j] += 1\\n banned_left[bi + j] -= 1\\n banned_right[ai + j - 1] += 1\\n banned_right[bi + j - 1] -= 1\\nfor d, e, f in hor_lines:\\n if e > f:\\n e, f = f, e\\n ri = y_dict[d] * row\\n ej = x_dict[e]\\n fj = x_dict[f]\\n banned_up[ri + ej] += 1\\n banned_up[ri + fj] -= 1\\n banned_down[ri - row + ej] += 1\\n banned_down[ri - row + fj] -= 1\\nfor i in range(1, col):\\n ri0 = row * (i - 1)\\n ri1 = row * i\\n for j in range(1, row):\\n banned_up[ri1 + j] += banned_up[ri1 + j - 1]\\n banned_down[ri1 + j] += banned_down[ri1 + j - 1]\\n banned_left[ri1 + j] += banned_left[ri0 + j]\\n banned_right[ri1 + j] += banned_right[ri0 + j]\\n# banned_up = list(chain.from_iterable(map(accumulate, banned_up_ij)))\\n# banned_down = list(chain.from_iterable(map(accumulate, banned_down_ij)))\\n# banned_left = list(chain.from_iterable(zip(*map(accumulate, banned_left_ij))))\\n# banned_right = list(chain.from_iterable(zip(*map(accumulate, banned_right_ij))))\\n# for i in range(col):\\n# print(walls[i * row:(i + 1) * row])\\ns = row * y_dict[0] + x_dict[0]\\nenable = [-1] * row + ([-1] + [0] * (row - 2) + [-1]) * (col - 2) + [-1] * row\\n# for i in range(col):\\n# print(enable[i * row:(i + 1) * row])\\nq = [s]\\nmoves = [(-row, banned_up), (-1, banned_left), (1, banned_right), (row, banned_down)]\\nwhile q:\\n c = q.pop()\\n if enable[c] == 1:\\n continue\\n elif enable[c] == -1:\\n print(\"INF\")\\n exit()\\n enable[c] = 1\\n for dc, banned in moves:\\n if banned[c]:\\n continue\\n nc = c + dc\\n if enable[nc] == 1:\\n continue\\n q.append(nc)\\n# for i in range(col):\\n# print(enable[i * row:(i + 1) * row])\\nans = 0\\nfor i in range(col):\\n ri = i * row\\n for j in range(row):\\n if enable[ri + j] != 1:\\n continue\\n t = y_list[i - 1]\\n b = y_list[i]\\n l = x_list[j - 1]\\n r = x_list[j]\\n ans += (b - t) * (r - l)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.15625,\n", + " 'diff': ['-banned_up_ij = [[0] * row for _ in range(col)]',\n", + " '-banned_down_ij = [[0] * row for _ in range(col)]',\n", + " '-banned_left_ij = [[0] * col for _ in range(row)]',\n", + " '-banned_right_ij = [[0] * col for _ in range(row)]',\n", + " '-for a, b, c in ver_lines:',\n", + " '- if a > b:',\n", + " '- a, b = b, a',\n", + " '- ai = y_dict[a]',\n", + " '- bi = y_dict[b]',\n", + " '- j = x_dict[c]',\n", + " '- banned_left_ij[j][ai] += 1',\n", + " '- banned_left_ij[j][bi] -= 1',\n", + " '- banned_right_ij[j - 1][ai] += 1',\n", + " '- banned_right_ij[j - 1][bi] -= 1',\n", + " '-for d, e, f in hor_lines:',\n", + " '- if e > f:',\n", + " '- e, f = f, e',\n", + " '- i = y_dict[d]',\n", + " '- ej = x_dict[e]',\n", + " '- fj = x_dict[f]',\n", + " '- banned_up_ij[i][ej] += 1',\n", + " '- banned_up_ij[i][fj] -= 1',\n", + " '- banned_down_ij[i - 1][ej] += 1',\n", + " '- banned_down_ij[i - 1][fj] -= 1',\n", + " '-for i in range(col):',\n", + " '- ru = banned_up_ij[i]',\n", + " '- rd = banned_down_ij[i]',\n", + " '- ri = row * i',\n", + " '- banned_up[ri] = ru[0]',\n", + " '- banned_down[ri] = rd[0]',\n", + " '+for a, b, c in ver_lines:',\n", + " '+ if a > b:',\n", + " '+ a, b = b, a',\n", + " '+ ai = y_dict[a] * row',\n", + " '+ bi = y_dict[b] * row',\n", + " '+ j = x_dict[c]',\n", + " '+ banned_left[ai + j] += 1',\n", + " '+ banned_left[bi + j] -= 1',\n", + " '+ banned_right[ai + j - 1] += 1',\n", + " '+ banned_right[bi + j - 1] -= 1',\n", + " '+for d, e, f in hor_lines:',\n", + " '+ if e > f:',\n", + " '+ e, f = f, e',\n", + " '+ ri = y_dict[d] * row',\n", + " '+ ej = x_dict[e]',\n", + " '+ fj = x_dict[f]',\n", + " '+ banned_up[ri + ej] += 1',\n", + " '+ banned_up[ri + fj] -= 1',\n", + " '+ banned_down[ri - row + ej] += 1',\n", + " '+ banned_down[ri - row + fj] -= 1',\n", + " '+for i in range(1, col):',\n", + " '+ ri0 = row * (i - 1)',\n", + " '+ ri1 = row * i',\n", + " '- banned_up[ri + j] = banned_up[ri + j - 1] + ru[j]',\n", + " '- banned_down[ri + j] = banned_down[ri + j - 1] + rd[j]',\n", + " '-for j in range(row):',\n", + " '- rl = banned_left_ij[j]',\n", + " '- rr = banned_right_ij[j]',\n", + " '- banned_left[j] = rl[0]',\n", + " '- banned_right[j] = rr[0]',\n", + " '- for i in range(1, col):',\n", + " '- ri0 = (i - 1) * row',\n", + " '- ri1 = i * row',\n", + " '- banned_left[ri1 + j] = banned_left[ri0 + j] + rl[i]',\n", + " '- banned_right[ri1 + j] = banned_right[ri0 + j] + rr[i]',\n", + " '+ banned_up[ri1 + j] += banned_up[ri1 + j - 1]',\n", + " '+ banned_down[ri1 + j] += banned_down[ri1 + j - 1]',\n", + " '+ banned_left[ri1 + j] += banned_left[ri0 + j]',\n", + " '+ banned_right[ri1 + j] += banned_right[ri0 + j]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2846495706,\n", + " 'measured_runtime_v1': 0.092071644,\n", + " 'runtime_lift': 3.0916095148,\n", + " 'key': ['s341076610', 's034276815']},\n", + " {'user_id': 'u202406075',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's829872247',\n", + " 'submission_id_v1': 's319951709',\n", + " 'cpu_time_v0': 148,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12396,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.84,\n", + " 'input': 'import numpy as np\\n\\nimport sys\\n\\n\\n\\nn = int(eval(input()))\\n\\na = np.array(list(map(int, input().split())))\\n\\n\\n\\ncnt = 1\\n\\n\\n\\nif np.any(a%2==1):\\n\\n print((0))\\n\\n sys.exit()\\n\\n\\n\\nwhile True:\\n\\n a2 = a % 2**cnt\\n\\n if np.all(a2==0):\\n\\n cnt += 1\\n\\n continue\\n\\n else:\\n\\n print((cnt-1))\\n\\n break',\n", + " 'target': 'N = int(eval(input()))\\n\\na = list(map(int,input().split()))\\n\\nans = 0\\n\\nwhile all(A%2 == 0 for A in a):\\n\\n\\ta = [i/2 for i in a ]\\n\\n\\tans += 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 303,\n", + " 'code_v1_num_chars': 142,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport sys\\n\\nn = int(eval(input()))\\na = np.array(list(map(int, input().split())))\\ncnt = 1\\nif np.any(a % 2 == 1):\\n print((0))\\n sys.exit()\\nwhile True:\\n a2 = a % 2**cnt\\n if np.all(a2 == 0):\\n cnt += 1\\n continue\\n else:\\n print((cnt - 1))\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\na = list(map(int, input().split()))\\nans = 0\\nwhile all(A % 2 == 0 for A in a):\\n a = [i / 2 for i in a]\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 65.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-import sys',\n", + " '-',\n", + " '-n = int(eval(input()))',\n", + " '-a = np.array(list(map(int, input().split())))',\n", + " '-cnt = 1',\n", + " '-if np.any(a % 2 == 1):',\n", + " '- print((0))',\n", + " '- sys.exit()',\n", + " '-while True:',\n", + " '- a2 = a % 2**cnt',\n", + " '- if np.all(a2 == 0):',\n", + " '- cnt += 1',\n", + " '- continue',\n", + " '- else:',\n", + " '- print((cnt - 1))',\n", + " '- break',\n", + " '+N = int(eval(input()))',\n", + " '+a = list(map(int, input().split()))',\n", + " '+ans = 0',\n", + " '+while all(A % 2 == 0 for A in a):',\n", + " '+ a = [i / 2 for i in a]',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8370131412,\n", + " 'measured_runtime_v1': 0.3072203367,\n", + " 'runtime_lift': 5.9794646441,\n", + " 'key': ['s829872247', 's319951709']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p03074',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's931234571',\n", + " 'submission_id_v1': 's204237470',\n", + " 'cpu_time_v0': 1852,\n", + " 'cpu_time_v1': 78,\n", + " 'memory_v0': 16724,\n", + " 'memory_v1': 7924,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 95.79,\n", + " 'input': \"import numpy as np\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\nS = list(eval(input())) + ['2']\\n\\n\\n\\nblocks = []\\n\\ncur = 1\\n\\nseq = 0\\n\\nfor s in S:\\n\\n if int(s) == cur:\\n\\n seq += 1\\n\\n else:\\n\\n blocks.append(seq)\\n\\n cur = 1 - cur\\n\\n seq = 1\\n\\nanswer = 0\\n\\nblocks = np.array(blocks)\\n\\nfor i in range(0, len(blocks), 2):\\n\\n answer = max(answer, blocks[i:i+2*K+1].sum())\\n\\nprint(answer)\\n\",\n", + " 'target': \"# coding: utf-8\\n\\nimport sys\\n\\nimport itertools\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\n# 0か1の連続している人数のリスト、累積和\\n\\nstreak = [0, 0]\\n\\nN, K = lr()\\n\\nS = sr() + '2'\\n\\ncur = 1\\n\\nfor i in range(N):\\n\\n if S[i] != S[i+1]:\\n\\n streak.append(cur)\\n\\n cur = 1\\n\\n else:\\n\\n cur += 1\\n\\n\\n\\nstreak_cum = list(itertools.accumulate(streak))\\n\\nstreak_cum.extend([streak_cum[-1], streak_cum[-1]])\\n\\nif S[0] == '0':\\n\\n start = 0\\n\\nelse:\\n\\n start = 1\\n\\nanswer = 0\\n\\n\\n\\nlimit = len(streak_cum) - 1\\n\\nfor i in range(start, len(streak_cum), 2):\\n\\n result = streak_cum[min(limit, i+2*K+1)] - streak_cum[i]\\n\\n if result > answer:\\n\\n answer = result\\n\\n\\n\\nprint(answer)\\n\\n# 52\",\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 36,\n", + " 'code_v0_num_chars': 389,\n", + " 'code_v1_num_chars': 737,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, K = list(map(int, input().split()))\\nS = list(eval(input())) + [\"2\"]\\nblocks = []\\ncur = 1\\nseq = 0\\nfor s in S:\\n if int(s) == cur:\\n seq += 1\\n else:\\n blocks.append(seq)\\n cur = 1 - cur\\n seq = 1\\nanswer = 0\\nblocks = np.array(blocks)\\nfor i in range(0, len(blocks), 2):\\n answer = max(answer, blocks[i : i + 2 * K + 1].sum())\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nimport sys\\nimport itertools\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\n# 0か1の連続している人数のリスト、累積和\\nstreak = [0, 0]\\nN, K = lr()\\nS = sr() + \"2\"\\ncur = 1\\nfor i in range(N):\\n if S[i] != S[i + 1]:\\n streak.append(cur)\\n cur = 1\\n else:\\n cur += 1\\nstreak_cum = list(itertools.accumulate(streak))\\nstreak_cum.extend([streak_cum[-1], streak_cum[-1]])\\nif S[0] == \"0\":\\n start = 0\\nelse:\\n start = 1\\nanswer = 0\\nlimit = len(streak_cum) - 1\\nfor i in range(start, len(streak_cum), 2):\\n result = streak_cum[min(limit, i + 2 * K + 1)] - streak_cum[i]\\n if result > answer:\\n answer = result\\nprint(answer)\\n# 52\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 44.4444444444,\n", + " 'diff': ['-import numpy as np',\n", + " '+# coding: utf-8',\n", + " '+import sys',\n", + " '+import itertools',\n", + " '-N, K = list(map(int, input().split()))',\n", + " '-S = list(eval(input())) + [\"2\"]',\n", + " '-blocks = []',\n", + " '+sr = lambda: sys.stdin.readline().rstrip()',\n", + " '+ir = lambda: int(sr())',\n", + " '+lr = lambda: list(map(int, sr().split()))',\n", + " '+# 0か1の連続している人数のリスト、累積和',\n", + " '+streak = [0, 0]',\n", + " '+N, K = lr()',\n", + " '+S = sr() + \"2\"',\n", + " '-seq = 0',\n", + " '-for s in S:',\n", + " '- if int(s) == cur:',\n", + " '- seq += 1',\n", + " '+for i in range(N):',\n", + " '+ if S[i] != S[i + 1]:',\n", + " '+ streak.append(cur)',\n", + " '+ cur = 1',\n", + " '- blocks.append(seq)',\n", + " '- cur = 1 - cur',\n", + " '- seq = 1',\n", + " '+ cur += 1',\n", + " '+streak_cum = list(itertools.accumulate(streak))',\n", + " '+streak_cum.extend([streak_cum[-1], streak_cum[-1]])',\n", + " '+if S[0] == \"0\":',\n", + " '+ start = 0',\n", + " '+else:',\n", + " '+ start = 1',\n", + " '-blocks = np.array(blocks)',\n", + " '-for i in range(0, len(blocks), 2):',\n", + " '- answer = max(answer, blocks[i : i + 2 * K + 1].sum())',\n", + " '+limit = len(streak_cum) - 1',\n", + " '+for i in range(start, len(streak_cum), 2):',\n", + " '+ result = streak_cum[min(limit, i + 2 * K + 1)] - streak_cum[i]',\n", + " '+ if result > answer:',\n", + " '+ answer = result',\n", + " '+# 52'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9750818772,\n", + " 'measured_runtime_v1': 0.2859025445,\n", + " 'runtime_lift': 6.9082346945,\n", + " 'key': ['s931234571', 's204237470']},\n", + " {'user_id': 'u952708174',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's363239082',\n", + " 'submission_id_v1': 's852466512',\n", + " 'cpu_time_v0': 1303,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 21264,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 98.62,\n", + " 'input': \"import numpy\\n\\nH, W = [int(i) for i in input().split()]\\n\\nA = numpy.array([list(input().strip()) for _ in range(H)])\\n\\n\\n\\nrow_space = []\\n\\ncol_space = []\\n\\n\\n\\nfor k, row in enumerate(A):\\n\\n if '#' not in row:\\n\\n row_space.append(k)\\n\\n\\n\\nA_rot = numpy.rot90(A, k=-1)\\n\\nfor k, row in enumerate(A_rot):\\n\\n if '#' not in row:\\n\\n col_space.append(k)\\n\\n\\n\\nA = numpy.delete(A, row_space, axis=0)\\n\\nA = numpy.delete(A, col_space, axis=1)\\n\\nans = '\\\\n'.join([''.join(row) for row in A])\\n\\nprint(ans)\",\n", + " 'target': \"def rotate_clockwise(matrix):\\n\\n tmp = list(map(list, list(zip(*matrix))))[::-1]\\n\\n return list(''.join(row) for row in tmp)\\n\\n # 文字列のリストを入れるので文字列のリストで返す\\n\\n\\n\\n\\n\\ndef rotate_counterclockwise(matrix):\\n\\n tmp = list([list(x[::-1]) for x in zip(*matrix)])\\n\\n return list(''.join(row) for row in tmp)\\n\\n # 文字列のリストを入れるので文字列のリストで返す\\n\\n\\n\\n\\n\\nH, W = [int(i) for i in input().split()]\\n\\nA = [eval(input()) for _ in range(H)]\\n\\n\\n\\nrow_remove_count = 0\\n\\nwhile '.' * W in A:\\n\\n A.remove('.' * W) # 行まるごと白なら、回数を記録して除く\\n\\n row_remove_count += 1\\n\\n\\n\\nA = rotate_clockwise(A) # 反時計回りに回す\\n\\nwhile '.' * (H - row_remove_count) in A:\\n\\n A.remove('.' * (H - row_remove_count))\\n\\n\\n\\nA = rotate_counterclockwise(A) # 時計回りに回して元に戻す\\n\\nprint(('\\\\n'.join(A)))\",\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 490,\n", + " 'code_v1_num_chars': 724,\n", + " 'code_v0_no_empty_lines': 'import numpy\\n\\nH, W = [int(i) for i in input().split()]\\nA = numpy.array([list(input().strip()) for _ in range(H)])\\nrow_space = []\\ncol_space = []\\nfor k, row in enumerate(A):\\n if \"#\" not in row:\\n row_space.append(k)\\nA_rot = numpy.rot90(A, k=-1)\\nfor k, row in enumerate(A_rot):\\n if \"#\" not in row:\\n col_space.append(k)\\nA = numpy.delete(A, row_space, axis=0)\\nA = numpy.delete(A, col_space, axis=1)\\nans = \"\\\\n\".join([\"\".join(row) for row in A])\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def rotate_clockwise(matrix):\\n tmp = list(map(list, list(zip(*matrix))))[::-1]\\n return list(\"\".join(row) for row in tmp)\\n # 文字列のリストを入れるので文字列のリストで返す\\n\\n\\ndef rotate_counterclockwise(matrix):\\n tmp = list([list(x[::-1]) for x in zip(*matrix)])\\n return list(\"\".join(row) for row in tmp)\\n # 文字列のリストを入れるので文字列のリストで返す\\n\\n\\nH, W = [int(i) for i in input().split()]\\nA = [eval(input()) for _ in range(H)]\\nrow_remove_count = 0\\nwhile \".\" * W in A:\\n A.remove(\".\" * W) # 行まるごと白なら、回数を記録して除く\\n row_remove_count += 1\\nA = rotate_clockwise(A) # 反時計回りに回す\\nwhile \".\" * (H - row_remove_count) in A:\\n A.remove(\".\" * (H - row_remove_count))\\nA = rotate_counterclockwise(A) # 時計回りに回して元に戻す\\nprint((\"\\\\n\".join(A)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-import numpy',\n", + " '+def rotate_clockwise(matrix):',\n", + " '+ tmp = list(map(list, list(zip(*matrix))))[::-1]',\n", + " '+ return list(\"\".join(row) for row in tmp)',\n", + " '+ # 文字列のリストを入れるので文字列のリストで返す',\n", + " '+',\n", + " '+',\n", + " '+def rotate_counterclockwise(matrix):',\n", + " '+ tmp = list([list(x[::-1]) for x in zip(*matrix)])',\n", + " '+ return list(\"\".join(row) for row in tmp)',\n", + " '+ # 文字列のリストを入れるので文字列のリストで返す',\n", + " '+',\n", + " '-A = numpy.array([list(input().strip()) for _ in range(H)])',\n", + " '-row_space = []',\n", + " '-col_space = []',\n", + " '-for k, row in enumerate(A):',\n", + " '- if \"#\" not in row:',\n", + " '- row_space.append(k)',\n", + " '-A_rot = numpy.rot90(A, k=-1)',\n", + " '-for k, row in enumerate(A_rot):',\n", + " '- if \"#\" not in row:',\n", + " '- col_space.append(k)',\n", + " '-A = numpy.delete(A, row_space, axis=0)',\n", + " '-A = numpy.delete(A, col_space, axis=1)',\n", + " '-ans = \"\\\\n\".join([\"\".join(row) for row in A])',\n", + " '-print(ans)',\n", + " '+A = [eval(input()) for _ in range(H)]',\n", + " '+row_remove_count = 0',\n", + " '+while \".\" * W in A:',\n", + " '+ A.remove(\".\" * W) # 行まるごと白なら、回数を記録して除く',\n", + " '+ row_remove_count += 1',\n", + " '+A = rotate_clockwise(A) # 反時計回りに回す',\n", + " '+while \".\" * (H - row_remove_count) in A:',\n", + " '+ A.remove(\".\" * (H - row_remove_count))',\n", + " '+A = rotate_counterclockwise(A) # 時計回りに回して元に戻す',\n", + " '+print((\"\\\\n\".join(A)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3900156258,\n", + " 'measured_runtime_v1': 0.2221083821,\n", + " 'runtime_lift': 6.2582763077,\n", + " 'key': ['s363239082', 's852466512']},\n", + " {'user_id': 'u116348130',\n", + " 'problem_id': 'p02772',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's819852741',\n", + " 'submission_id_v1': 's529440144',\n", + " 'cpu_time_v0': 147,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12488,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.44,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\nn = int(eval(input()))\\n\\ninput = sys.stdin.readline\\n\\na = np.array(list(map(int, input().split())))\\n\\nfor i in a:\\n\\n if i % 2 == 0:\\n\\n if i % 3 != 0 and i % 5 != 0:\\n\\n print('DENIED')\\n\\n exit()\\n\\nprint('APPROVED')\\n\",\n", + " 'target': \"#import sys\\n\\n#import numpy as np\\n\\nn = int(eval(input()))\\n\\n#input = sys.stdin.readline\\n\\n#a = np.array(list(map(int, input().split())))\\n\\na = list(map(int, input().split()))\\n\\nfor i in a:\\n\\n if i % 2 == 0:\\n\\n if i % 3 != 0 and i % 5 != 0:\\n\\n print('DENIED')\\n\\n exit()\\n\\nprint('APPROVED')\\n\",\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 264,\n", + " 'code_v1_num_chars': 305,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nn = int(eval(input()))\\ninput = sys.stdin.readline\\na = np.array(list(map(int, input().split())))\\nfor i in a:\\n if i % 2 == 0:\\n if i % 3 != 0 and i % 5 != 0:\\n print(\"DENIED\")\\n exit()\\nprint(\"APPROVED\")\\n',\n", + " 'code_v1_no_empty_lines': '# import sys\\n# import numpy as np\\nn = int(eval(input()))\\n# input = sys.stdin.readline\\n# a = np.array(list(map(int, input().split())))\\na = list(map(int, input().split()))\\nfor i in a:\\n if i % 2 == 0:\\n if i % 3 != 0 and i % 5 != 0:\\n print(\"DENIED\")\\n exit()\\nprint(\"APPROVED\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-import sys',\n", + " '-import numpy as np',\n", + " '-',\n", + " '+# import sys',\n", + " '+# import numpy as np',\n", + " '-input = sys.stdin.readline',\n", + " '-a = np.array(list(map(int, input().split())))',\n", + " '+# input = sys.stdin.readline',\n", + " '+# a = np.array(list(map(int, input().split())))',\n", + " '+a = list(map(int, input().split()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.601757371,\n", + " 'measured_runtime_v1': 0.2577495209,\n", + " 'runtime_lift': 6.2143951447,\n", + " 'key': ['s819852741', 's529440144']},\n", + " {'user_id': 'u546338822',\n", + " 'problem_id': 'p02792',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's925566735',\n", + " 'submission_id_v1': 's918927310',\n", + " 'cpu_time_v0': 742,\n", + " 'cpu_time_v1': 154,\n", + " 'memory_v0': 12884,\n", + " 'memory_v1': 9096,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.25,\n", + " 'input': 'def main():\\n\\n n = int(eval(input()))\\n\\n import numpy as np\\n\\n ans = np.zeros((10,10))\\n\\n for i in range(1,n+1):\\n\\n h,t = str(i)[0],str(i)[-1]\\n\\n ans[int(h)-1][int(t)-1]+=1\\n\\n s = 0\\n\\n for i in range(10):\\n\\n for j in range(10):\\n\\n s += ans[i][j]*ans[j][i]\\n\\n\\n\\n print((int(s)))\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'target': 'def main():\\n\\n n = int(eval(input()))\\n\\n dp = [[0 for i in range(10)] for i in range(10)]\\n\\n for i in range(1,n+1):\\n\\n h,t = int(str(i)[0]), int(str(i)[-1])\\n\\n dp[h][t] += 1\\n\\n ans = 0\\n\\n for i in range(10):\\n\\n for j in range(10):\\n\\n ans += dp[i][j] * dp[j][i]\\n\\n print(ans)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 350,\n", + " 'code_v1_num_chars': 351,\n", + " 'code_v0_no_empty_lines': 'def main():\\n n = int(eval(input()))\\n import numpy as np\\n\\n ans = np.zeros((10, 10))\\n for i in range(1, n + 1):\\n h, t = str(i)[0], str(i)[-1]\\n ans[int(h) - 1][int(t) - 1] += 1\\n s = 0\\n for i in range(10):\\n for j in range(10):\\n s += ans[i][j] * ans[j][i]\\n print((int(s)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n n = int(eval(input()))\\n dp = [[0 for i in range(10)] for i in range(10)]\\n for i in range(1, n + 1):\\n h, t = int(str(i)[0]), int(str(i)[-1])\\n dp[h][t] += 1\\n ans = 0\\n for i in range(10):\\n for j in range(10):\\n ans += dp[i][j] * dp[j][i]\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['- import numpy as np',\n", + " '-',\n", + " '- ans = np.zeros((10, 10))',\n", + " '+ dp = [[0 for i in range(10)] for i in range(10)]',\n", + " '- h, t = str(i)[0], str(i)[-1]',\n", + " '- ans[int(h) - 1][int(t) - 1] += 1',\n", + " '- s = 0',\n", + " '+ h, t = int(str(i)[0]), int(str(i)[-1])',\n", + " '+ dp[h][t] += 1',\n", + " '+ ans = 0',\n", + " '- s += ans[i][j] * ans[j][i]',\n", + " '- print((int(s)))',\n", + " '+ ans += dp[i][j] * dp[j][i]',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6066912649,\n", + " 'measured_runtime_v1': 0.3226509961,\n", + " 'runtime_lift': 4.9796569178,\n", + " 'key': ['s925566735', 's918927310']},\n", + " {'user_id': 'u348868667',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's647144203',\n", + " 'submission_id_v1': 's608787131',\n", + " 'cpu_time_v0': 154,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12508,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.96,\n", + " 'input': 'import numpy as np\\n\\nN,L = list(map(int,input().split()))\\n\\napple = np.array(list(range(N))) + 1\\n\\ntaste = apple + L - 1\\n\\ntaste_applepie = sum(taste)\\n\\nif L <= 0 and abs(N) > abs(L):\\n\\n print(taste_applepie)\\n\\nelif L > 0:\\n\\n print((taste_applepie - L))\\n\\nelse:\\n\\n print((taste_applepie - (N+L-1)))',\n", + " 'target': 'N,L = list(map(int,input().split()))\\n\\nt = [L+i-1 for i in range(1,N+1)]\\n\\nabst = list(map(abs,t))\\n\\nminind = abst.index(min(abst))\\n\\nprint((sum(t)-t[minind]))',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 281,\n", + " 'code_v1_num_chars': 147,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, L = list(map(int, input().split()))\\napple = np.array(list(range(N))) + 1\\ntaste = apple + L - 1\\ntaste_applepie = sum(taste)\\nif L <= 0 and abs(N) > abs(L):\\n print(taste_applepie)\\nelif L > 0:\\n print((taste_applepie - L))\\nelse:\\n print((taste_applepie - (N + L - 1)))\\n',\n", + " 'code_v1_no_empty_lines': 'N, L = list(map(int, input().split()))\\nt = [L + i - 1 for i in range(1, N + 1)]\\nabst = list(map(abs, t))\\nminind = abst.index(min(abst))\\nprint((sum(t) - t[minind]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 54.5454545455,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-apple = np.array(list(range(N))) + 1',\n", + " '-taste = apple + L - 1',\n", + " '-taste_applepie = sum(taste)',\n", + " '-if L <= 0 and abs(N) > abs(L):',\n", + " '- print(taste_applepie)',\n", + " '-elif L > 0:',\n", + " '- print((taste_applepie - L))',\n", + " '-else:',\n", + " '- print((taste_applepie - (N + L - 1)))',\n", + " '+t = [L + i - 1 for i in range(1, N + 1)]',\n", + " '+abst = list(map(abs, t))',\n", + " '+minind = abst.index(min(abst))',\n", + " '+print((sum(t) - t[minind]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7270206907,\n", + " 'measured_runtime_v1': 0.2688547273,\n", + " 'runtime_lift': 6.4236203252,\n", + " 'key': ['s647144203', 's608787131']},\n", + " {'user_id': 'u197300260',\n", + " 'problem_id': 'p03814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's932284243',\n", + " 'submission_id_v1': 's708109984',\n", + " 'cpu_time_v0': 36,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 4012,\n", + " 'memory_v1': 3516,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 19.44,\n", + " 'input': '# Problem https://atcoder.jp/contests/abc053/tasks/abc053_b\\n\\n# Python 1st Try\\n\\nimport copy\\n\\n\\n\\n\\n\\nclass Problem:\\n\\n def __init__(self, stringdata):\\n\\n self.stringdata = stringdata\\n\\n\\n\\n def solver(self):\\n\\n strcont = copy.copy(self.stringdata)\\n\\n result = 0\\n\\n rightposition = 0\\n\\n leftposition = len(strcont)\\n\\n j = 0\\n\\n while True:\\n\\n if strcont[j] == \\'A\\':\\n\\n rightposition = j\\n\\n break\\n\\n else:\\n\\n j = j + 1\\n\\n j = leftposition - 1\\n\\n while True:\\n\\n if strcont[j] == \\'Z\\':\\n\\n leftposition = j\\n\\n break\\n\\n else:\\n\\n j = j - 1\\n\\n\\n\\n result = leftposition - rightposition + 1\\n\\n return result\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n s = eval(input())\\n\\n print((\"{}\".format(Problem(s).solver())))\\n',\n", + " 'target': '# Problem https://atcoder.jp/contests/abc053/tasks/abc053_b\\n\\n# Python 2nd Try\\n\\n\\n\\n\\n\\ndef solver(string):\\n\\n result = 200000\\n\\n aposi = 0\\n\\n zposi = len(string)\\n\\n for j in range(0, len(string), 1):\\n\\n if string[j] == \\'A\\':\\n\\n aposi = j\\n\\n break\\n\\n for j in range(len(string)-1, -1, -1):\\n\\n if string[j] == \\'Z\\':\\n\\n zposi = j\\n\\n break\\n\\n result = zposi - aposi + 1\\n\\n return result\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n s = eval(input())\\n\\n print((\\'{}\\'.format(solver(s))))\\n',\n", + " 'code_v0_loc': 36,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 875,\n", + " 'code_v1_num_chars': 527,\n", + " 'code_v0_no_empty_lines': '# Problem https://atcoder.jp/contests/abc053/tasks/abc053_b\\n# Python 1st Try\\nimport copy\\n\\n\\nclass Problem:\\n def __init__(self, stringdata):\\n self.stringdata = stringdata\\n\\n def solver(self):\\n strcont = copy.copy(self.stringdata)\\n result = 0\\n rightposition = 0\\n leftposition = len(strcont)\\n j = 0\\n while True:\\n if strcont[j] == \"A\":\\n rightposition = j\\n break\\n else:\\n j = j + 1\\n j = leftposition - 1\\n while True:\\n if strcont[j] == \"Z\":\\n leftposition = j\\n break\\n else:\\n j = j - 1\\n result = leftposition - rightposition + 1\\n return result\\n\\n\\nif __name__ == \"__main__\":\\n s = eval(input())\\n print((\"{}\".format(Problem(s).solver())))\\n',\n", + " 'code_v1_no_empty_lines': '# Problem https://atcoder.jp/contests/abc053/tasks/abc053_b\\n# Python 2nd Try\\ndef solver(string):\\n result = 200000\\n aposi = 0\\n zposi = len(string)\\n for j in range(0, len(string), 1):\\n if string[j] == \"A\":\\n aposi = j\\n break\\n for j in range(len(string) - 1, -1, -1):\\n if string[j] == \"Z\":\\n zposi = j\\n break\\n result = zposi - aposi + 1\\n return result\\n\\n\\nif __name__ == \"__main__\":\\n s = eval(input())\\n print((\"{}\".format(solver(s))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.1111111111,\n", + " 'diff': ['-# Python 1st Try',\n", + " '-import copy',\n", + " '-',\n", + " '-',\n", + " '-class Problem:',\n", + " '- def __init__(self, stringdata):',\n", + " '- self.stringdata = stringdata',\n", + " '-',\n", + " '- def solver(self):',\n", + " '- strcont = copy.copy(self.stringdata)',\n", + " '- result = 0',\n", + " '- rightposition = 0',\n", + " '- leftposition = len(strcont)',\n", + " '- j = 0',\n", + " '- while True:',\n", + " '- if strcont[j] == \"A\":',\n", + " '- rightposition = j',\n", + " '- break',\n", + " '- else:',\n", + " '- j = j + 1',\n", + " '- j = leftposition - 1',\n", + " '- while True:',\n", + " '- if strcont[j] == \"Z\":',\n", + " '- leftposition = j',\n", + " '- break',\n", + " '- else:',\n", + " '- j = j - 1',\n", + " '- result = leftposition - rightposition + 1',\n", + " '- return result',\n", + " '+# Python 2nd Try',\n", + " '+def solver(string):',\n", + " '+ result = 200000',\n", + " '+ aposi = 0',\n", + " '+ zposi = len(string)',\n", + " '+ for j in range(0, len(string), 1):',\n", + " '+ if string[j] == \"A\":',\n", + " '+ aposi = j',\n", + " '+ break',\n", + " '+ for j in range(len(string) - 1, -1, -1):',\n", + " '+ if string[j] == \"Z\":',\n", + " '+ zposi = j',\n", + " '+ break',\n", + " '+ result = zposi - aposi + 1',\n", + " '+ return result',\n", + " '- print((\"{}\".format(Problem(s).solver())))',\n", + " '+ print((\"{}\".format(solver(s))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2169195101,\n", + " 'measured_runtime_v1': 0.1208960545,\n", + " 'runtime_lift': 1.7942645936,\n", + " 'key': ['s932284243', 's708109984']},\n", + " {'user_id': 'u105210954',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's757552767',\n", + " 'submission_id_v1': 's396543034',\n", + " 'cpu_time_v0': 1264,\n", + " 'cpu_time_v1': 505,\n", + " 'memory_v0': 17796,\n", + " 'memory_v1': 44376,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 60.05,\n", + " 'input': 'import numpy as np\\n\\ndef resolve():\\n\\n MOD = 10 ** 9 + 7\\n\\n n, m = list(map(int, input().split()))\\n\\n a = [int(eval(input())) for _ in range(m)]\\n\\n\\n\\n dp = np.array([1] * (n + 1))\\n\\n dp[a] = 0\\n\\n\\n\\n for i in range(2, n + 1):\\n\\n if dp[i] != 0:\\n\\n dp[i] = np.sum(dp[i - 2:i]) % MOD\\n\\n\\n\\n print((dp[n]))\\n\\n \\n\\nresolve()',\n", + " 'target': 'def resolve():\\n\\n MOD = 10 ** 9 + 7\\n\\n n, m = list(map(int, input().split()))\\n\\n\\n\\n # i段目に到達するまでのルートの総数\\n\\n dp = [1] * (n + 1)\\n\\n\\n\\n for _ in range(m):\\n\\n dp[int(eval(input()))] = 0\\n\\n\\n\\n for i in range(2, n + 1):\\n\\n if dp[i] == 0:\\n\\n continue\\n\\n\\n\\n dp[i] = (dp[i - 1] + dp[i - 2]) % MOD\\n\\n\\n\\n print((dp[n]))\\n\\n \\n\\nresolve()',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 329,\n", + " 'code_v1_num_chars': 347,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n\\ndef resolve():\\n MOD = 10**9 + 7\\n n, m = list(map(int, input().split()))\\n a = [int(eval(input())) for _ in range(m)]\\n dp = np.array([1] * (n + 1))\\n dp[a] = 0\\n for i in range(2, n + 1):\\n if dp[i] != 0:\\n dp[i] = np.sum(dp[i - 2 : i]) % MOD\\n print((dp[n]))\\n\\n\\nresolve()\\n',\n", + " 'code_v1_no_empty_lines': 'def resolve():\\n MOD = 10**9 + 7\\n n, m = list(map(int, input().split()))\\n # i段目に到達するまでのルートの総数\\n dp = [1] * (n + 1)\\n for _ in range(m):\\n dp[int(eval(input()))] = 0\\n for i in range(2, n + 1):\\n if dp[i] == 0:\\n continue\\n dp[i] = (dp[i - 1] + dp[i - 2]) % MOD\\n print((dp[n]))\\n\\n\\nresolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.7894736842,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-',\n", + " '- a = [int(eval(input())) for _ in range(m)]',\n", + " '- dp = np.array([1] * (n + 1))',\n", + " '- dp[a] = 0',\n", + " '+ # i段目に到達するまでのルートの総数',\n", + " '+ dp = [1] * (n + 1)',\n", + " '+ for _ in range(m):',\n", + " '+ dp[int(eval(input()))] = 0',\n", + " '- if dp[i] != 0:',\n", + " '- dp[i] = np.sum(dp[i - 2 : i]) % MOD',\n", + " '+ if dp[i] == 0:',\n", + " '+ continue',\n", + " '+ dp[i] = (dp[i - 1] + dp[i - 2]) % MOD'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6744469514,\n", + " 'measured_runtime_v1': 0.2573392596,\n", + " 'runtime_lift': 6.5067683562,\n", + " 'key': ['s757552767', 's396543034']},\n", + " {'user_id': 'u952708174',\n", + " 'problem_id': 'p02983',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's271837395',\n", + " 'submission_id_v1': 's778364451',\n", + " 'cpu_time_v0': 612,\n", + " 'cpu_time_v1': 51,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.67,\n", + " 'input': \"def c_remainder_minimization_2019(L, R):\\n\\n ans = float('inf')\\n\\n for i in range(L, min(R, L + 2019)):\\n\\n for j in range(i + 1, min(R + 1, L + 2020)):\\n\\n ans = min(ans, (i * j) % 2019)\\n\\n return ans\\n\\n\\n\\nL, R = [int(i) for i in input().split()]\\n\\nprint((c_remainder_minimization_2019(L, R)))\",\n", + " 'target': \"def c_remainder_minimization_2019(L, R):\\n\\n ans = float('inf')\\n\\n for i in range(L, min(R, L + 2019)):\\n\\n for j in range(i + 1, min(R + 1, L + 2020)):\\n\\n ans = min(ans, (i * j) % 2019)\\n\\n if ans == 0:\\n\\n return 0\\n\\n return ans\\n\\n\\n\\nL, R = [int(i) for i in input().split()]\\n\\nprint((c_remainder_minimization_2019(L, R)))\",\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 308,\n", + " 'code_v1_num_chars': 360,\n", + " 'code_v0_no_empty_lines': 'def c_remainder_minimization_2019(L, R):\\n ans = float(\"inf\")\\n for i in range(L, min(R, L + 2019)):\\n for j in range(i + 1, min(R + 1, L + 2020)):\\n ans = min(ans, (i * j) % 2019)\\n return ans\\n\\n\\nL, R = [int(i) for i in input().split()]\\nprint((c_remainder_minimization_2019(L, R)))\\n',\n", + " 'code_v1_no_empty_lines': 'def c_remainder_minimization_2019(L, R):\\n ans = float(\"inf\")\\n for i in range(L, min(R, L + 2019)):\\n for j in range(i + 1, min(R + 1, L + 2020)):\\n ans = min(ans, (i * j) % 2019)\\n if ans == 0:\\n return 0\\n return ans\\n\\n\\nL, R = [int(i) for i in input().split()]\\nprint((c_remainder_minimization_2019(L, R)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['+ if ans == 0:', '+ return 0'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3551982943,\n", + " 'measured_runtime_v1': 0.2038855975,\n", + " 'runtime_lift': 1.7421450986,\n", + " 'key': ['s271837395', 's778364451']},\n", + " {'user_id': 'u861109991',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's393491495',\n", + " 'submission_id_v1': 's671436001',\n", + " 'cpu_time_v0': 1842,\n", + " 'cpu_time_v1': 304,\n", + " 'memory_v0': 60120,\n", + " 'memory_v1': 38476,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.5,\n", + " 'input': \"# ABC 155 C\\n\\nfrom collections import Counter\\n\\nimport numpy as np\\n\\nN = int(eval(input()))\\n\\nS = [str(eval(input())) for i in range(N)]\\n\\nS = np.array(S)\\n\\n\\n\\ncount = Counter(S)\\n\\nmax_num = max(count.values())\\n\\nmax_list = [i for i,j in list(count.items()) if j==max_num]\\n\\n\\n\\nmax_list.sort()\\n\\nprint(('\\\\n'.join(max_list)))\",\n", + " 'target': \"import sys\\n\\nfrom collections import Counter\\n\\nN = int(sys.stdin.readline())\\n\\nS = sys.stdin.read().split()\\n\\n\\n\\ncount = Counter(S)\\n\\nmax_num = max(count.values())\\n\\nmax_list = [i for i,j in list(count.items()) if j==max_num]\\n\\n \\n\\nmax_list.sort()\\n\\nprint(('\\\\n'.join(max_list)))\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 292,\n", + " 'code_v1_num_chars': 260,\n", + " 'code_v0_no_empty_lines': '# ABC 155 C\\nfrom collections import Counter\\nimport numpy as np\\n\\nN = int(eval(input()))\\nS = [str(eval(input())) for i in range(N)]\\nS = np.array(S)\\ncount = Counter(S)\\nmax_num = max(count.values())\\nmax_list = [i for i, j in list(count.items()) if j == max_num]\\nmax_list.sort()\\nprint((\"\\\\n\".join(max_list)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom collections import Counter\\n\\nN = int(sys.stdin.readline())\\nS = sys.stdin.read().split()\\ncount = Counter(S)\\nmax_num = max(count.values())\\nmax_list = [i for i, j in list(count.items()) if j == max_num]\\nmax_list.sort()\\nprint((\"\\\\n\".join(max_list)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['-# ABC 155 C',\n", + " '+import sys',\n", + " '-import numpy as np',\n", + " '-N = int(eval(input()))',\n", + " '-S = [str(eval(input())) for i in range(N)]',\n", + " '-S = np.array(S)',\n", + " '+N = int(sys.stdin.readline())',\n", + " '+S = sys.stdin.read().split()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8564253402,\n", + " 'measured_runtime_v1': 0.2880120206,\n", + " 'runtime_lift': 6.4456522902,\n", + " 'key': ['s393491495', 's671436001']},\n", + " {'user_id': 'u836939578',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's134270128',\n", + " 'submission_id_v1': 's044449964',\n", + " 'cpu_time_v0': 73,\n", + " 'cpu_time_v1': 62,\n", + " 'memory_v0': 64852,\n", + " 'memory_v1': 63756,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.07,\n", + " 'input': 'S = int(eval(input()))\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\n#dp[i]最後に切った場所がi\\u3000スタートが1なのは、そこまでの切り方が1通りなので\\n\\n#３以下はダメなので、3個前の結果を見るようにする\\n\\ndp = [0] * (S+1)\\n\\ndp[0] = 1\\n\\n\\n\\nfor i in range(1, S+1):\\n\\n #たとえばi=6のとき、i=6で初めて切れ目を入れる時で＋１、i=3に切れ目をいれるときで＋１で合計＋２\\n\\n for j in range(0, (i-3)+1):\\n\\n dp[i] += dp[j]\\n\\n dp[i] %= MOD\\n\\nprint((dp[S])) ',\n", + " 'target': 'S = int(eval(input()))\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\n#dp[i]最後に切った場所がi\\u3000スタートが1なのは、そこまでの切り方が1通りなので\\n\\n#３以下はダメなので、3個前の結果を見るようにする\\n\\ndp = [0] * (S+1)\\n\\ndp[0] = 1\\n\\n\\n\\n#これまでの和をxに保存しておく\\n\\nx = 0\\n\\nfor i in range(1, S+1):\\n\\n if i-3 >= 0:\\n\\n x += dp[i-3]\\n\\n x %= MOD\\n\\n dp[i] = x\\n\\nprint((dp[S])) ',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 324,\n", + " 'code_v1_num_chars': 285,\n", + " 'code_v0_no_empty_lines': 'S = int(eval(input()))\\nMOD = 10**9 + 7\\n# dp[i]最後に切った場所がi\\u3000スタートが1なのは、そこまでの切り方が1通りなので\\n# ３以下はダメなので、3個前の結果を見るようにする\\ndp = [0] * (S + 1)\\ndp[0] = 1\\nfor i in range(1, S + 1):\\n # たとえばi=6のとき、i=6で初めて切れ目を入れる時で＋１、i=3に切れ目をいれるときで＋１で合計＋２\\n for j in range(0, (i - 3) + 1):\\n dp[i] += dp[j]\\n dp[i] %= MOD\\nprint((dp[S]))\\n',\n", + " 'code_v1_no_empty_lines': 'S = int(eval(input()))\\nMOD = 10**9 + 7\\n# dp[i]最後に切った場所がi\\u3000スタートが1なのは、そこまでの切り方が1通りなので\\n# ３以下はダメなので、3個前の結果を見るようにする\\ndp = [0] * (S + 1)\\ndp[0] = 1\\n# これまでの和をxに保存しておく\\nx = 0\\nfor i in range(1, S + 1):\\n if i - 3 >= 0:\\n x += dp[i - 3]\\n x %= MOD\\n dp[i] = x\\nprint((dp[S]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['+# これまでの和をxに保存しておく',\n", + " '+x = 0',\n", + " '- # たとえばi=6のとき、i=6で初めて切れ目を入れる時で＋１、i=3に切れ目をいれるときで＋１で合計＋２',\n", + " '- for j in range(0, (i - 3) + 1):',\n", + " '- dp[i] += dp[j]',\n", + " '- dp[i] %= MOD',\n", + " '+ if i - 3 >= 0:',\n", + " '+ x += dp[i - 3]',\n", + " '+ x %= MOD',\n", + " '+ dp[i] = x'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7110086412,\n", + " 'measured_runtime_v1': 0.2124667544,\n", + " 'runtime_lift': 3.3464465681,\n", + " 'key': ['s134270128', 's044449964']},\n", + " {'user_id': 'u853010060',\n", + " 'problem_id': 'p02921',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's066833687',\n", + " 'submission_id_v1': 's453964878',\n", + " 'cpu_time_v0': 21,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 19.05,\n", + " 'input': 'S = eval(input())\\n\\nT = eval(input())\\n\\n\\n\\nl = len(S)\\n\\nres = 0\\n\\nfor n in range(l):\\n\\n if S[n] == T[n]:\\n\\n res += 1\\n\\nprint(res)',\n", + " 'target': 'S = eval(input())\\n\\nT = eval(input())\\n\\nl = len(S)\\n\\nans = 0\\n\\nfor n in range(l):\\n\\n if S[n] == T[n]:\\n\\n ans += 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 119,\n", + " 'code_v1_num_chars': 118,\n", + " 'code_v0_no_empty_lines': 'S = eval(input())\\nT = eval(input())\\nl = len(S)\\nres = 0\\nfor n in range(l):\\n if S[n] == T[n]:\\n res += 1\\nprint(res)\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nT = eval(input())\\nl = len(S)\\nans = 0\\nfor n in range(l):\\n if S[n] == T[n]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-res = 0',\n", + " '+ans = 0',\n", + " '- res += 1',\n", + " '-print(res)',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3049550076,\n", + " 'measured_runtime_v1': 0.2412325363,\n", + " 'runtime_lift': 1.2641537174,\n", + " 'key': ['s066833687', 's453964878']},\n", + " {'user_id': 'u813098295',\n", + " 'problem_id': 'p03363',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's373502740',\n", + " 'submission_id_v1': 's912924761',\n", + " 'cpu_time_v0': 217,\n", + " 'cpu_time_v1': 194,\n", + " 'memory_v0': 31620,\n", + " 'memory_v1': 45788,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.6,\n", + " 'input': 'N = int(input())\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nans, s = 0, 0\\n\\nd = {0:1}\\n\\n\\n\\nfor i in A:\\n\\n s += i\\n\\n ans += d.get(s, 0)\\n\\n d[s] = d.get(s, 0) + 1\\n\\n\\n\\nprint(ans)',\n", + " 'target': '#!/usr/bin/env python3\\n\\n\\n\\nfrom collections import defaultdict\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nd = defaultdict(int)\\n\\nd[0] = 1\\n\\n\\n\\ns, ans = 0, 0\\n\\n\\n\\nfor a in A:\\n\\n s += a\\n\\n ans += d[s]\\n\\n d[s] += 1\\n\\n\\n\\nprint (ans)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 175,\n", + " 'code_v1_num_chars': 237,\n", + " 'code_v0_no_empty_lines': 'N = int(input())\\nA = list(map(int, input().split()))\\nans, s = 0, 0\\nd = {0: 1}\\nfor i in A:\\n s += i\\n ans += d.get(s, 0)\\n d[s] = d.get(s, 0) + 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\nfrom collections import defaultdict\\n\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nd = defaultdict(int)\\nd[0] = 1\\ns, ans = 0, 0\\nfor a in A:\\n s += a\\n ans += d[s]\\n d[s] += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-N = int(input())',\n", + " '+#!/usr/bin/env python3',\n", + " '+from collections import defaultdict',\n", + " '+',\n", + " '+N = int(eval(input()))',\n", + " '-ans, s = 0, 0',\n", + " '-d = {0: 1}',\n", + " '-for i in A:',\n", + " '- s += i',\n", + " '- ans += d.get(s, 0)',\n", + " '- d[s] = d.get(s, 0) + 1',\n", + " '+d = defaultdict(int)',\n", + " '+d[0] = 1',\n", + " '+s, ans = 0, 0',\n", + " '+for a in A:',\n", + " '+ s += a',\n", + " '+ ans += d[s]',\n", + " '+ d[s] += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2992557037,\n", + " 'measured_runtime_v1': 0.2235582159,\n", + " 'runtime_lift': 1.3386030235,\n", + " 'key': ['s373502740', 's912924761']},\n", + " {'user_id': 'u936985471',\n", + " 'problem_id': 'p03721',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's865752287',\n", + " 'submission_id_v1': 's921873406',\n", + " 'cpu_time_v0': 343,\n", + " 'cpu_time_v1': 288,\n", + " 'memory_v0': 15072,\n", + " 'memory_v1': 29824,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.03,\n", + " 'input': 'N,K=list(map(int,input().split()))\\n\\ndic={}\\n\\nfor i in range(N):\\n\\n a,b=list(map(int,input().split()))\\n\\n if a in dic:\\n\\n dic[a]+=b\\n\\n else:\\n\\n dic[a]=b\\n\\n \\n\\ndic=sorted(list(dic.items()),key=lambda x:x[0])\\n\\nfor d in range(len(dic)):\\n\\n amount=dic[d][1]\\n\\n if amount>=K:\\n\\n print((dic[d][0]))\\n\\n exit(0)\\n\\n else:\\n\\n K-=amount\\n\\n ',\n", + " 'target': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\n\\n\\nN,K = list(map(int,readline().split()))\\n\\n\\n\\nAB = [list(map(int,readline().split())) for i in range(N)]\\n\\n\\n\\nAB = sorted(AB, key = lambda x:x[0])\\n\\namount = 0\\n\\nfor a,b in AB:\\n\\n amount += b\\n\\n if amount >= K:\\n\\n print(a)\\n\\n break\\n',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 318,\n", + " 'code_v1_num_chars': 268,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\ndic = {}\\nfor i in range(N):\\n a, b = list(map(int, input().split()))\\n if a in dic:\\n dic[a] += b\\n else:\\n dic[a] = b\\ndic = sorted(list(dic.items()), key=lambda x: x[0])\\nfor d in range(len(dic)):\\n amount = dic[d][1]\\n if amount >= K:\\n print((dic[d][0]))\\n exit(0)\\n else:\\n K -= amount\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nN, K = list(map(int, readline().split()))\\nAB = [list(map(int, readline().split())) for i in range(N)]\\nAB = sorted(AB, key=lambda x: x[0])\\namount = 0\\nfor a, b in AB:\\n amount += b\\n if amount >= K:\\n print(a)\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['-N, K = list(map(int, input().split()))',\n", + " '-dic = {}',\n", + " '-for i in range(N):',\n", + " '- a, b = list(map(int, input().split()))',\n", + " '- if a in dic:',\n", + " '- dic[a] += b',\n", + " '- else:',\n", + " '- dic[a] = b',\n", + " '-dic = sorted(list(dic.items()), key=lambda x: x[0])',\n", + " '-for d in range(len(dic)):',\n", + " '- amount = dic[d][1]',\n", + " '+import sys',\n", + " '+',\n", + " '+readline = sys.stdin.readline',\n", + " '+N, K = list(map(int, readline().split()))',\n", + " '+AB = [list(map(int, readline().split())) for i in range(N)]',\n", + " '+AB = sorted(AB, key=lambda x: x[0])',\n", + " '+amount = 0',\n", + " '+for a, b in AB:',\n", + " '+ amount += b',\n", + " '- print((dic[d][0]))',\n", + " '- exit(0)',\n", + " '- else:',\n", + " '- K -= amount',\n", + " '+ print(a)',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3684674098,\n", + " 'measured_runtime_v1': 0.2810288085,\n", + " 'runtime_lift': 1.3111375012,\n", + " 'key': ['s865752287', 's921873406']},\n", + " {'user_id': 'u028260664',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's951687748',\n", + " 'submission_id_v1': 's895960468',\n", + " 'cpu_time_v0': 279,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 17932,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 93.19,\n", + " 'input': 'import numpy as np\\n\\n# Me\\n\\n\\n\\n\\n\\ndef f():\\n\\n i = int(eval(input()))\\n\\n nums = np.array(list(map(int, input().split())))\\n\\n # nums = [int(x) for x in input().split()]\\n\\n c = 0\\n\\n while True:\\n\\n if any(nums % 2 == 1):\\n\\n break\\n\\n c += 1\\n\\n nums = nums / 2\\n\\n print(c)\\n\\n\\n\\n\\n\\nf()\\n\\n\\n\\n\\n\\n# Other\\n',\n", + " 'target': 'def divide_all(a):\\n\\n success = True\\n\\n for i, n in enumerate(a):\\n\\n if n % 2 != 0:\\n\\n success = False\\n\\n break\\n\\n a[i] = n / 2\\n\\n if success is False:\\n\\n return (a, False)\\n\\n return (a, True)\\n\\n\\n\\nn = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nc = 0\\n\\nwhile True:\\n\\n a, r = divide_all(a)\\n\\n if r is False:\\n\\n break\\n\\n c += 1\\n\\n\\n\\n\\n\\nprint(c)\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 319,\n", + " 'code_v1_num_chars': 403,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n# Me\\ndef f():\\n i = int(eval(input()))\\n nums = np.array(list(map(int, input().split())))\\n # nums = [int(x) for x in input().split()]\\n c = 0\\n while True:\\n if any(nums % 2 == 1):\\n break\\n c += 1\\n nums = nums / 2\\n print(c)\\n\\n\\nf()\\n# Other\\n',\n", + " 'code_v1_no_empty_lines': 'def divide_all(a):\\n success = True\\n for i, n in enumerate(a):\\n if n % 2 != 0:\\n success = False\\n break\\n a[i] = n / 2\\n if success is False:\\n return (a, False)\\n return (a, True)\\n\\n\\nn = int(eval(input()))\\na = list(map(int, input().split()))\\nc = 0\\nwhile True:\\n a, r = divide_all(a)\\n if r is False:\\n break\\n c += 1\\nprint(c)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-# Me',\n", + " '-def f():',\n", + " '- i = int(eval(input()))',\n", + " '- nums = np.array(list(map(int, input().split())))',\n", + " '- # nums = [int(x) for x in input().split()]',\n", + " '- c = 0',\n", + " '- while True:',\n", + " '- if any(nums % 2 == 1):',\n", + " '+def divide_all(a):',\n", + " '+ success = True',\n", + " '+ for i, n in enumerate(a):',\n", + " '+ if n % 2 != 0:',\n", + " '+ success = False',\n", + " '- c += 1',\n", + " '- nums = nums / 2',\n", + " '- print(c)',\n", + " '+ a[i] = n / 2',\n", + " '+ if success is False:',\n", + " '+ return (a, False)',\n", + " '+ return (a, True)',\n", + " '-f()',\n", + " '-# Other',\n", + " '+n = int(eval(input()))',\n", + " '+a = list(map(int, input().split()))',\n", + " '+c = 0',\n", + " '+while True:',\n", + " '+ a, r = divide_all(a)',\n", + " '+ if r is False:',\n", + " '+ break',\n", + " '+ c += 1',\n", + " '+print(c)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5223398395,\n", + " 'measured_runtime_v1': 0.2142075307,\n", + " 'runtime_lift': 7.106845563,\n", + " 'key': ['s951687748', 's895960468']},\n", + " {'user_id': 'u879870653',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's279175230',\n", + " 'submission_id_v1': 's789865740',\n", + " 'cpu_time_v0': 111,\n", + " 'cpu_time_v1': 45,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.46,\n", + " 'input': 'a,b = list(map(int,input().split()))\\n\\nanswer = 0\\n\\nfor i in range(a,b+1) :\\n\\n j = str(i)\\n\\n p1 = j[4]\\n\\n p2 = j[3]\\n\\n p3 = j[2]\\n\\n p4 = j[1]\\n\\n p5 = j[0]\\n\\n k = int(p1+p2+p3+p4+p5)\\n\\n if i == k :\\n\\n answer += 1\\n\\nprint(answer)\\n\\n\\n',\n", + " 'target': 'A,B = list(map(int,input().split()))\\n\\nans = 0\\n\\nfor i in range(A,B+1) :\\n\\n l = str(i)\\n\\n if l[0] == l[4] and l[1] == l[3] :\\n\\n ans += 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 243,\n", + " 'code_v1_num_chars': 151,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().split()))\\nanswer = 0\\nfor i in range(a, b + 1):\\n j = str(i)\\n p1 = j[4]\\n p2 = j[3]\\n p3 = j[2]\\n p4 = j[1]\\n p5 = j[0]\\n k = int(p1 + p2 + p3 + p4 + p5)\\n if i == k:\\n answer += 1\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\nans = 0\\nfor i in range(A, B + 1):\\n l = str(i)\\n if l[0] == l[4] and l[1] == l[3]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-a, b = list(map(int, input().split()))',\n", + " '-answer = 0',\n", + " '-for i in range(a, b + 1):',\n", + " '- j = str(i)',\n", + " '- p1 = j[4]',\n", + " '- p2 = j[3]',\n", + " '- p3 = j[2]',\n", + " '- p4 = j[1]',\n", + " '- p5 = j[0]',\n", + " '- k = int(p1 + p2 + p3 + p4 + p5)',\n", + " '- if i == k:',\n", + " '- answer += 1',\n", + " '-print(answer)',\n", + " '+A, B = list(map(int, input().split()))',\n", + " '+ans = 0',\n", + " '+for i in range(A, B + 1):',\n", + " '+ l = str(i)',\n", + " '+ if l[0] == l[4] and l[1] == l[3]:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5475045266,\n", + " 'measured_runtime_v1': 0.378210106,\n", + " 'runtime_lift': 1.4476200343,\n", + " 'key': ['s279175230', 's789865740']},\n", + " {'user_id': 'u208713671',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's801223812',\n", + " 'submission_id_v1': 's234548187',\n", + " 'cpu_time_v0': 968,\n", + " 'cpu_time_v1': 337,\n", + " 'memory_v0': 44132,\n", + " 'memory_v1': 115244,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 65.19,\n", + " 'input': 'import numpy as np\\n\\nNM = list(map(int,input().split()))\\n\\nN = NM[0]\\n\\nM = NM[1]\\n\\nA = list(map(int,input().split()))\\n\\nlistBC =[]\\n\\nwhile True:\\n\\n try:\\n\\n listBC.append(list(map(int,input().split())))\\n\\n except:\\n\\n break;\\n\\nBC = np.array(listBC)\\n\\nBCnum = np.argsort(BC[:,1])[::-1]\\n\\nBC = BC[BCnum,:]\\n\\n\\n\\nA.sort()\\n\\nj=0\\n\\nfor i in range(len(A)):\\n\\n times = BC[j,0]\\n\\n if BC[j,0]==0:\\n\\n j+=1\\n\\n if j == BC.shape[0]:\\n\\n break\\n\\n times = BC[j,0]\\n\\n if A[i]0:\\n\\n out += K[now]\\n\\n D[K[now]] += -1\\n\\n cnt+=1\\n\\n else:\\n\\n now+=1\\n\\nprint(out)',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 578,\n", + " 'code_v1_num_chars': 429,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nNM = list(map(int, input().split()))\\nN = NM[0]\\nM = NM[1]\\nA = list(map(int, input().split()))\\nlistBC = []\\nwhile True:\\n try:\\n listBC.append(list(map(int, input().split())))\\n except:\\n break\\nBC = np.array(listBC)\\nBCnum = np.argsort(BC[:, 1])[::-1]\\nBC = BC[BCnum, :]\\nA.sort()\\nj = 0\\nfor i in range(len(A)):\\n times = BC[j, 0]\\n if BC[j, 0] == 0:\\n j += 1\\n if j == BC.shape[0]:\\n break\\n times = BC[j, 0]\\n if A[i] < BC[j, 1]:\\n A[i] = BC[j, 1]\\n BC[j, 0] += -1\\noutput = sum(A)\\nprint(output)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nfrom collections import Counter\\n\\nD = dict(Counter(A))\\nfor i in range(M):\\n B, C = list(map(int, input().split()))\\n D[C] = D.get(C, 0) + B\\nK = sorted(list(D.keys()), reverse=True)\\nout = 0\\ncnt = 0\\nnow = 0\\nwhile cnt <= N - 1:\\n if D[K[now]] > 0:\\n out += K[now]\\n D[K[now]] += -1\\n cnt += 1\\n else:\\n now += 1\\nprint(out)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.6896551724,\n", + " 'diff': ['-import numpy as np',\n", + " '+N, M = list(map(int, input().split()))',\n", + " '+A = list(map(int, input().split()))',\n", + " '+from collections import Counter',\n", + " '-NM = list(map(int, input().split()))',\n", + " '-N = NM[0]',\n", + " '-M = NM[1]',\n", + " '-A = list(map(int, input().split()))',\n", + " '-listBC = []',\n", + " '-while True:',\n", + " '- try:',\n", + " '- listBC.append(list(map(int, input().split())))',\n", + " '- except:',\n", + " '- break',\n", + " '-BC = np.array(listBC)',\n", + " '-BCnum = np.argsort(BC[:, 1])[::-1]',\n", + " '-BC = BC[BCnum, :]',\n", + " '-A.sort()',\n", + " '-j = 0',\n", + " '-for i in range(len(A)):',\n", + " '- times = BC[j, 0]',\n", + " '- if BC[j, 0] == 0:',\n", + " '- j += 1',\n", + " '- if j == BC.shape[0]:',\n", + " '- break',\n", + " '- times = BC[j, 0]',\n", + " '- if A[i] < BC[j, 1]:',\n", + " '- A[i] = BC[j, 1]',\n", + " '- BC[j, 0] += -1',\n", + " '-output = sum(A)',\n", + " '-print(output)',\n", + " '+D = dict(Counter(A))',\n", + " '+for i in range(M):',\n", + " '+ B, C = list(map(int, input().split()))',\n", + " '+ D[C] = D.get(C, 0) + B',\n", + " '+K = sorted(list(D.keys()), reverse=True)',\n", + " '+out = 0',\n", + " '+cnt = 0',\n", + " '+now = 0',\n", + " '+while cnt <= N - 1:',\n", + " '+ if D[K[now]] > 0:',\n", + " '+ out += K[now]',\n", + " '+ D[K[now]] += -1',\n", + " '+ cnt += 1',\n", + " '+ else:',\n", + " '+ now += 1',\n", + " '+print(out)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3117765622,\n", + " 'measured_runtime_v1': 0.2034162543,\n", + " 'runtime_lift': 6.4487302983,\n", + " 'key': ['s801223812', 's234548187']},\n", + " {'user_id': 'u096128910',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's987616882',\n", + " 'submission_id_v1': 's695744152',\n", + " 'cpu_time_v0': 126,\n", + " 'cpu_time_v1': 81,\n", + " 'memory_v0': 66508,\n", + " 'memory_v1': 64160,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.71,\n", + " 'input': 'N = int(eval(input()))\\n\\nans = N - 1\\n\\np = 1\\n\\nfor i in range(2, int((N ** 0.5) + 1)):\\n\\n if p % 2 == 1 and i > (N ** 0.5):\\n\\n break\\n\\n if N % i == 0:\\n\\n p = i\\n\\n j = N // i\\n\\n m = i + j - 2\\n\\n if m < ans:\\n\\n ans = m\\n\\n else:\\n\\n continue\\n\\n else:\\n\\n continue\\n\\nprint(ans)\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nans = N - 1\\n\\nfor i in range(2, int((N ** 0.5) + 1)):\\n\\n if N % i == 0:\\n\\n j = N // i\\n\\n m = i + j - 2\\n\\n ans = min(ans, m)\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 330,\n", + " 'code_v1_num_chars': 173,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nans = N - 1\\np = 1\\nfor i in range(2, int((N**0.5) + 1)):\\n if p % 2 == 1 and i > (N**0.5):\\n break\\n if N % i == 0:\\n p = i\\n j = N // i\\n m = i + j - 2\\n if m < ans:\\n ans = m\\n else:\\n continue\\n else:\\n continue\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nans = N - 1\\nfor i in range(2, int((N**0.5) + 1)):\\n if N % i == 0:\\n j = N // i\\n m = i + j - 2\\n ans = min(ans, m)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 52.9411764706,\n", + " 'diff': ['-p = 1',\n", + " '- if p % 2 == 1 and i > (N**0.5):',\n", + " '- break',\n", + " '- p = i',\n", + " '- if m < ans:',\n", + " '- ans = m',\n", + " '- else:',\n", + " '- continue',\n", + " '- else:',\n", + " '- continue',\n", + " '+ ans = min(ans, m)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3775834899,\n", + " 'measured_runtime_v1': 0.2214011464,\n", + " 'runtime_lift': 1.7054269863,\n", + " 'key': ['s987616882', 's695744152']},\n", + " {'user_id': 'u439396449',\n", + " 'problem_id': 'p03287',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's936062710',\n", + " 'submission_id_v1': 's930018564',\n", + " 'cpu_time_v0': 270,\n", + " 'cpu_time_v1': 121,\n", + " 'memory_v0': 27356,\n", + " 'memory_v1': 16208,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.19,\n", + " 'input': 'from collections import defaultdict\\n\\n\\n\\nfrom scipy.misc import comb\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\nA = [int(x) for x in input().split()]\\n\\n\\n\\nB = [0] * N\\n\\nB[0] = A[0]\\n\\nfor i in range(1, N):\\n\\n B[i] = B[i - 1] + A[i]\\n\\nB = [0] + B\\n\\n\\n\\nc = defaultdict(int)\\n\\nfor i in range(N + 1):\\n\\n c[B[i] % M] += 1\\n\\n\\n\\nans = 0\\n\\nfor k, v in list(c.items()):\\n\\n if v >= 2:\\n\\n ans += comb(v, 2, exact=True)\\n\\nprint(ans)',\n", + " 'target': 'from collections import defaultdict\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\nA = [int(x) for x in input().split()]\\n\\n\\n\\nB = [0] * N\\n\\nB[0] = A[0]\\n\\nfor i in range(1, N):\\n\\n B[i] = B[i - 1] + A[i]\\n\\nB = [0] + B\\n\\n\\n\\nc = defaultdict(int)\\n\\nfor i in range(N + 1):\\n\\n c[B[i] % M] += 1\\n\\n\\n\\nans = 0\\n\\nfor k, v in list(c.items()):\\n\\n if v >= 2:\\n\\n ans += v * (v - 1) // 2\\n\\nprint(ans)',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 405,\n", + " 'code_v1_num_chars': 368,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\nfrom scipy.misc import comb\\n\\nN, M = list(map(int, input().split()))\\nA = [int(x) for x in input().split()]\\nB = [0] * N\\nB[0] = A[0]\\nfor i in range(1, N):\\n B[i] = B[i - 1] + A[i]\\nB = [0] + B\\nc = defaultdict(int)\\nfor i in range(N + 1):\\n c[B[i] % M] += 1\\nans = 0\\nfor k, v in list(c.items()):\\n if v >= 2:\\n ans += comb(v, 2, exact=True)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\nN, M = list(map(int, input().split()))\\nA = [int(x) for x in input().split()]\\nB = [0] * N\\nB[0] = A[0]\\nfor i in range(1, N):\\n B[i] = B[i - 1] + A[i]\\nB = [0] + B\\nc = defaultdict(int)\\nfor i in range(N + 1):\\n c[B[i] % M] += 1\\nans = 0\\nfor k, v in list(c.items()):\\n if v >= 2:\\n ans += v * (v - 1) // 2\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 9.0909090909,\n", + " 'diff': ['-from scipy.misc import comb',\n", + " '- ans += comb(v, 2, exact=True)',\n", + " '+ ans += v * (v - 1) // 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3683824704,\n", + " 'measured_runtime_v1': 0.2000572271,\n", + " 'runtime_lift': 6.8399551963,\n", + " 'key': ['s936062710', 's930018564']},\n", + " {'user_id': 'u576434377',\n", + " 'problem_id': 'p03568',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's245503579',\n", + " 'submission_id_v1': 's305475228',\n", + " 'cpu_time_v0': 101,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.17,\n", + " 'input': 'N = int(eval(input()))\\n\\nAs = list(map(int,input().split()))\\n\\n\\n\\n\\n\\ndef dfs(A_s, index,Bss):\\n\\n if index == N:\\n\\n tmp = 1\\n\\n for b in Bss:\\n\\n tmp *= b\\n\\n return 1 if tmp % 2 == 0 else 0\\n\\n b_mi = Bss.copy()\\n\\n b_mi.append(A_s[index] - 1)\\n\\n\\n\\n b = Bss.copy()\\n\\n b.append(A_s[index])\\n\\n\\n\\n b_pl = Bss.copy()\\n\\n b_pl.append(A_s[index] + 1)\\n\\n return dfs(A_s,index + 1, b_mi) + dfs(A_s,index + 1,b) + dfs(A_s,index + 1,b_pl)\\n\\n\\n\\n\\n\\nprint((dfs(As,0,[])))\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nAs = list(map(int,input().split()))\\n\\n\\n\\ntmp = 1\\n\\nfor i in range(N):\\n\\n if As[i] % 2 == 0:\\n\\n tmp *= 2\\n\\n\\n\\nprint((3 ** N - tmp))',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 480,\n", + " 'code_v1_num_chars': 148,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nAs = list(map(int, input().split()))\\n\\n\\ndef dfs(A_s, index, Bss):\\n if index == N:\\n tmp = 1\\n for b in Bss:\\n tmp *= b\\n return 1 if tmp % 2 == 0 else 0\\n b_mi = Bss.copy()\\n b_mi.append(A_s[index] - 1)\\n b = Bss.copy()\\n b.append(A_s[index])\\n b_pl = Bss.copy()\\n b_pl.append(A_s[index] + 1)\\n return (\\n dfs(A_s, index + 1, b_mi) + dfs(A_s, index + 1, b) + dfs(A_s, index + 1, b_pl)\\n )\\n\\n\\nprint((dfs(As, 0, [])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nAs = list(map(int, input().split()))\\ntmp = 1\\nfor i in range(N):\\n if As[i] % 2 == 0:\\n tmp *= 2\\nprint((3**N - tmp))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 59.0909090909,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def dfs(A_s, index, Bss):',\n", + " '- if index == N:',\n", + " '- tmp = 1',\n", + " '- for b in Bss:',\n", + " '- tmp *= b',\n", + " '- return 1 if tmp % 2 == 0 else 0',\n", + " '- b_mi = Bss.copy()',\n", + " '- b_mi.append(A_s[index] - 1)',\n", + " '- b = Bss.copy()',\n", + " '- b.append(A_s[index])',\n", + " '- b_pl = Bss.copy()',\n", + " '- b_pl.append(A_s[index] + 1)',\n", + " '- return (',\n", + " '- dfs(A_s, index + 1, b_mi) + dfs(A_s, index + 1, b) + dfs(A_s, index + 1, b_pl)',\n", + " '- )',\n", + " '-',\n", + " '-',\n", + " '-print((dfs(As, 0, [])))',\n", + " '+tmp = 1',\n", + " '+for i in range(N):',\n", + " '+ if As[i] % 2 == 0:',\n", + " '+ tmp *= 2',\n", + " '+print((3**N - tmp))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4574659042,\n", + " 'measured_runtime_v1': 0.2742938831,\n", + " 'runtime_lift': 1.6677947721,\n", + " 'key': ['s245503579', 's305475228']},\n", + " {'user_id': 'u657901243',\n", + " 'problem_id': 'p02921',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's942582713',\n", + " 'submission_id_v1': 's970883644',\n", + " 'cpu_time_v0': 124,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 27104,\n", + " 'memory_v1': 9024,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.61,\n", + " 'input': 'import numpy as np\\n\\ns = np.array(list(eval(input())))\\n\\nt = np.array(list(eval(input())))\\n\\nprint((len(s[s==t])))\\n',\n", + " 'target': 's = eval(input())\\n\\nt = eval(input())\\n\\nans = 0\\n\\nfor i in range(len(s)):\\n\\n if s[i] == t[i]:\\n\\n ans += 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 98,\n", + " 'code_v1_num_chars': 111,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\ns = np.array(list(eval(input())))\\nt = np.array(list(eval(input())))\\nprint((len(s[s == t])))\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nt = eval(input())\\nans = 0\\nfor i in range(len(s)):\\n if s[i] == t[i]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.8571428571,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-s = np.array(list(eval(input())))',\n", + " '-t = np.array(list(eval(input())))',\n", + " '-print((len(s[s == t])))',\n", + " '+s = eval(input())',\n", + " '+t = eval(input())',\n", + " '+ans = 0',\n", + " '+for i in range(len(s)):',\n", + " '+ if s[i] == t[i]:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4444875236,\n", + " 'measured_runtime_v1': 0.1914589086,\n", + " 'runtime_lift': 7.5446346914,\n", + " 'key': ['s942582713', 's970883644']},\n", + " {'user_id': 'u353797797',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's255169106',\n", + " 'submission_id_v1': 's752105173',\n", + " 'cpu_time_v0': 312,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 21368,\n", + " 'memory_v1': 4596,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.99,\n", + " 'input': 'import numpy as np\\n\\nh,w=map(int,input().split())\\n\\nt=[list(input()) for _ in range(h)]\\n\\nfor i in range(h):\\n\\n t[i]=[(tij==\"#\")*1 for tij in t[i]]\\n\\nt=np.array(t,dtype=\"i2\")\\n\\nrows=[]\\n\\ncolumns=[]\\n\\nfor i in range(h):\\n\\n if np.sum(t[i])==0:\\n\\n rows+=[i]\\n\\nfor j in range(w):\\n\\n if np.sum(t[:,j])==0:\\n\\n columns+=[j]\\n\\nt=np.delete(t,rows,0)\\n\\nt=np.delete(t,columns,1)\\n\\nfor i in range(h-len(rows)):\\n\\n print(*[\"#\" if tij else \".\" for tij in t[i]],sep=\"\")\\n',\n", + " 'target': 'h,w=map(int,input().split())\\n\\nt=[list(input()) for _ in range(h)]\\n\\nfor i in range(h):\\n\\n t[i]=[(tij==\"#\")*1 for tij in t[i]]\\n\\nrows=[]\\n\\ncolumns=[]\\n\\nfor i,ti in enumerate(t):\\n\\n if sum(ti)==0:\\n\\n rows+=[i]\\n\\nfor j,tj in enumerate(zip(*t)):\\n\\n if sum(tj)==0:\\n\\n columns+=[j]\\n\\nnt=[]\\n\\nfor i,ti in enumerate(t):\\n\\n if i in rows:continue\\n\\n nti=[]\\n\\n for j,tij in enumerate(ti):\\n\\n if j in columns:continue\\n\\n nti+=[\"#\" if tij else \".\"]\\n\\n print(*nti,sep=\"\")\\n',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 464,\n", + " 'code_v1_num_chars': 489,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nh, w = map(int, input().split())\\nt = [list(input()) for _ in range(h)]\\nfor i in range(h):\\n t[i] = [(tij == \"#\") * 1 for tij in t[i]]\\nt = np.array(t, dtype=\"i2\")\\nrows = []\\ncolumns = []\\nfor i in range(h):\\n if np.sum(t[i]) == 0:\\n rows += [i]\\nfor j in range(w):\\n if np.sum(t[:, j]) == 0:\\n columns += [j]\\nt = np.delete(t, rows, 0)\\nt = np.delete(t, columns, 1)\\nfor i in range(h - len(rows)):\\n print(*[\"#\" if tij else \".\" for tij in t[i]], sep=\"\")\\n',\n", + " 'code_v1_no_empty_lines': 'h, w = map(int, input().split())\\nt = [list(input()) for _ in range(h)]\\nfor i in range(h):\\n t[i] = [(tij == \"#\") * 1 for tij in t[i]]\\nrows = []\\ncolumns = []\\nfor i, ti in enumerate(t):\\n if sum(ti) == 0:\\n rows += [i]\\nfor j, tj in enumerate(zip(*t)):\\n if sum(tj) == 0:\\n columns += [j]\\nnt = []\\nfor i, ti in enumerate(t):\\n if i in rows:\\n continue\\n nti = []\\n for j, tij in enumerate(ti):\\n if j in columns:\\n continue\\n nti += [\"#\" if tij else \".\"]\\n print(*nti, sep=\"\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-t = np.array(t, dtype=\"i2\")',\n", + " '-for i in range(h):',\n", + " '- if np.sum(t[i]) == 0:',\n", + " '+for i, ti in enumerate(t):',\n", + " '+ if sum(ti) == 0:',\n", + " '-for j in range(w):',\n", + " '- if np.sum(t[:, j]) == 0:',\n", + " '+for j, tj in enumerate(zip(*t)):',\n", + " '+ if sum(tj) == 0:',\n", + " '-t = np.delete(t, rows, 0)',\n", + " '-t = np.delete(t, columns, 1)',\n", + " '-for i in range(h - len(rows)):',\n", + " '- print(*[\"#\" if tij else \".\" for tij in t[i]], sep=\"\")',\n", + " '+nt = []',\n", + " '+for i, ti in enumerate(t):',\n", + " '+ if i in rows:',\n", + " '+ continue',\n", + " '+ nti = []',\n", + " '+ for j, tij in enumerate(ti):',\n", + " '+ if j in columns:',\n", + " '+ continue',\n", + " '+ nti += [\"#\" if tij else \".\"]',\n", + " '+ print(*nti, sep=\"\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9158326536,\n", + " 'measured_runtime_v1': 0.3161913253,\n", + " 'runtime_lift': 6.0590930236,\n", + " 'key': ['s255169106', 's752105173']},\n", + " {'user_id': 'u089230684',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's817533229',\n", + " 'submission_id_v1': 's906455398',\n", + " 'cpu_time_v0': 826,\n", + " 'cpu_time_v1': 662,\n", + " 'memory_v0': 82456,\n", + " 'memory_v1': 25196,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 19.85,\n", + " 'input': 'I=lambda:list(map(int,input().split()))\\n\\nn,m=I()\\n\\na=I()\\n\\na.sort(reverse=True)\\n\\nqq=[I() for i in range(m)]\\n\\nqq.sort(key=lambda x:x[1],reverse=True)\\n\\nans=0\\n\\nfor x,y in qq:\\n\\n for j in range(x):\\n\\n if not a:\\n\\n break\\n\\n aa=a.pop()\\n\\n ans+=max(aa,y)\\n\\nans+=sum(a)\\n\\nprint(ans)\\n\\n ',\n", + " 'target': 'I=lambda : list(map(int,input().split()))\\n\\nn,m = I()\\n\\nl=I();s=sum(l);l.sort();d=[]\\n\\nfor _ in range(m):\\n\\n b,c=I()\\n\\n d.append([c,b])\\n\\np=s=0 \\n\\nfor i in sorted(d,reverse=True):\\n\\n while i[1]:\\n\\n if p>=n or l[p]>=i[0]:\\n\\n break\\n\\n i[1]-=1\\n\\n s+=i[0]\\n\\n p+=1\\n\\n if p>=n:\\n\\n break\\n\\ns+=sum(l[p:])\\n\\nprint(s)',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 310,\n", + " 'code_v1_num_chars': 351,\n", + " 'code_v0_no_empty_lines': 'I = lambda: list(map(int, input().split()))\\nn, m = I()\\na = I()\\na.sort(reverse=True)\\nqq = [I() for i in range(m)]\\nqq.sort(key=lambda x: x[1], reverse=True)\\nans = 0\\nfor x, y in qq:\\n for j in range(x):\\n if not a:\\n break\\n aa = a.pop()\\n ans += max(aa, y)\\nans += sum(a)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'I = lambda: list(map(int, input().split()))\\nn, m = I()\\nl = I()\\ns = sum(l)\\nl.sort()\\nd = []\\nfor _ in range(m):\\n b, c = I()\\n d.append([c, b])\\np = s = 0\\nfor i in sorted(d, reverse=True):\\n while i[1]:\\n if p >= n or l[p] >= i[0]:\\n break\\n i[1] -= 1\\n s += i[0]\\n p += 1\\n if p >= n:\\n break\\ns += sum(l[p:])\\nprint(s)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-a = I()',\n", + " '-a.sort(reverse=True)',\n", + " '-qq = [I() for i in range(m)]',\n", + " '-qq.sort(key=lambda x: x[1], reverse=True)',\n", + " '-ans = 0',\n", + " '-for x, y in qq:',\n", + " '- for j in range(x):',\n", + " '- if not a:',\n", + " '+l = I()',\n", + " '+s = sum(l)',\n", + " '+l.sort()',\n", + " '+d = []',\n", + " '+for _ in range(m):',\n", + " '+ b, c = I()',\n", + " '+ d.append([c, b])',\n", + " '+p = s = 0',\n", + " '+for i in sorted(d, reverse=True):',\n", + " '+ while i[1]:',\n", + " '+ if p >= n or l[p] >= i[0]:',\n", + " '- aa = a.pop()',\n", + " '- ans += max(aa, y)',\n", + " '-ans += sum(a)',\n", + " '-print(ans)',\n", + " '+ i[1] -= 1',\n", + " '+ s += i[0]',\n", + " '+ p += 1',\n", + " '+ if p >= n:',\n", + " '+ break',\n", + " '+s += sum(l[p:])',\n", + " '+print(s)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3493785617,\n", + " 'measured_runtime_v1': 0.2761461248,\n", + " 'runtime_lift': 1.2651945122,\n", + " 'key': ['s817533229', 's906455398']},\n", + " {'user_id': 'u761320129',\n", + " 'problem_id': 'p03564',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's515134391',\n", + " 'submission_id_v1': 's980600609',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': 'N,K = int(eval(input())), int(eval(input()))\\n\\nnow = 1\\n\\nfor i in range(N):\\n\\n if now*2 < now + K:\\n\\n now *= 2\\n\\n else:\\n\\n now += K\\n\\nprint(now)\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nK = int(eval(input()))\\n\\nans = 1\\n\\nfor i in range(N):\\n\\n if ans < K:\\n\\n ans *= 2\\n\\n else:\\n\\n ans += K\\n\\nprint(ans)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 146,\n", + " 'code_v1_num_chars': 139,\n", + " 'code_v0_no_empty_lines': 'N, K = int(eval(input())), int(eval(input()))\\nnow = 1\\nfor i in range(N):\\n if now * 2 < now + K:\\n now *= 2\\n else:\\n now += K\\nprint(now)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nK = int(eval(input()))\\nans = 1\\nfor i in range(N):\\n if ans < K:\\n ans *= 2\\n else:\\n ans += K\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-N, K = int(eval(input())), int(eval(input()))',\n", + " '-now = 1',\n", + " '+N = int(eval(input()))',\n", + " '+K = int(eval(input()))',\n", + " '+ans = 1',\n", + " '- if now * 2 < now + K:',\n", + " '- now *= 2',\n", + " '+ if ans < K:',\n", + " '+ ans *= 2',\n", + " '- now += K',\n", + " '-print(now)',\n", + " '+ ans += K',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2990638907,\n", + " 'measured_runtime_v1': 0.1086408798,\n", + " 'runtime_lift': 2.7527749338,\n", + " 'key': ['s515134391', 's980600609']},\n", + " {'user_id': 'u257974487',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's235320519',\n", + " 'submission_id_v1': 's032021754',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 3980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.61,\n", + " 'input': 'import math\\n\\nN = int(eval(input()))\\n\\np = math.factorial(N)\\n\\nprint((p % 1000000007))',\n", + " 'target': 'N = int(eval(input()))\\n\\np = 1\\n\\nfor i in range(1,N+1):\\n\\n p *= i\\n\\n p %= 1000000007\\n\\nprint(p)\\n',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 75,\n", + " 'code_v1_num_chars': 91,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\np = math.factorial(N)\\nprint((p % 1000000007))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\np = 1\\nfor i in range(1, N + 1):\\n p *= i\\n p %= 1000000007\\nprint(p)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-p = math.factorial(N)',\n", + " '-print((p % 1000000007))',\n", + " '+p = 1',\n", + " '+for i in range(1, N + 1):',\n", + " '+ p *= i',\n", + " '+ p %= 1000000007',\n", + " '+print(p)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.768677109,\n", + " 'measured_runtime_v1': 0.410683428,\n", + " 'runtime_lift': 1.8717022808,\n", + " 'key': ['s235320519', 's032021754']},\n", + " {'user_id': 'u747602774',\n", + " 'problem_id': 'p03039',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's387237372',\n", + " 'submission_id_v1': 's322645394',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 47,\n", + " 'memory_v0': 9412,\n", + " 'memory_v1': 9476,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.57,\n", + " 'input': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\n#mod = 998244353\\n\\nINF = 10**18\\n\\neps = 10**-7\\n\\n\\n\\nm,n,k = list(map(int,readline().split()))\\n\\n\\n\\ndef comb(n, r, mod):\\n\\n r = min(r, n-r)\\n\\n mol = 1\\n\\n deno = 1\\n\\n for i in range(1, r+1):\\n\\n mol = mol * (n-r+i) % mod\\n\\n deno = deno * i % mod\\n\\n ret = mol * pow(deno, mod-2, mod) % mod\\n\\n return ret\\n\\n\\n\\ndef f1(x,y,a,b):\\n\\n return (a+b-x-y)*(a-x+1)*(b-y+1)//2\\n\\n\\n\\ndef f2(x,a):\\n\\n return (a-x)*(a-x+1)//2\\n\\n\\n\\nans = 0\\n\\n\\n\\nfor x in range(1,n+1):\\n\\n for y in range(1,m+1):\\n\\n a = n-x+1\\n\\n b = m-y+1\\n\\n c = m*(a*(a-1)+x*(x-1))\\n\\n d = n*(b*(b-1)+y*(y-1))\\n\\n ans += (c+d)//2\\n\\n ans %= mod\\n\\n\\n\\nans = (ans * comb(m*n-2,k-2,mod))%mod\\n\\nans = ans*pow(2,mod-2,mod)%mod\\n\\n\\n\\nprint(ans)\\n\\n\\n',\n", + " 'target': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\nsys.setrecursionlimit(10**8)\\n\\nmod = 10**9+7\\n\\n#mod = 998244353\\n\\nINF = 10**18\\n\\neps = 10**-7\\n\\n\\n\\nm,n,k = list(map(int,readline().split()))\\n\\n\\n\\ndef comb(n, r, mod):\\n\\n r = min(r, n-r)\\n\\n mol = 1\\n\\n deno = 1\\n\\n for i in range(1, r+1):\\n\\n mol = mol * (n-r+i) % mod\\n\\n deno = deno * i % mod\\n\\n ret = mol * pow(deno, mod-2, mod) % mod\\n\\n return ret\\n\\n\\n\\nans = m*n*(m+n)*(m*n-1)//3\\n\\n\\n\\nans = (ans * comb(m*n-2,k-2,mod))%mod\\n\\nans = ans*pow(2,mod-2,mod)%mod\\n\\n\\n\\nprint(ans)\\n\\n\\n',\n", + " 'code_v0_loc': 42,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 809,\n", + " 'code_v1_num_chars': 519,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n# mod = 998244353\\nINF = 10**18\\neps = 10**-7\\nm, n, k = list(map(int, readline().split()))\\n\\n\\ndef comb(n, r, mod):\\n r = min(r, n - r)\\n mol = 1\\n deno = 1\\n for i in range(1, r + 1):\\n mol = mol * (n - r + i) % mod\\n deno = deno * i % mod\\n ret = mol * pow(deno, mod - 2, mod) % mod\\n return ret\\n\\n\\ndef f1(x, y, a, b):\\n return (a + b - x - y) * (a - x + 1) * (b - y + 1) // 2\\n\\n\\ndef f2(x, a):\\n return (a - x) * (a - x + 1) // 2\\n\\n\\nans = 0\\nfor x in range(1, n + 1):\\n for y in range(1, m + 1):\\n a = n - x + 1\\n b = m - y + 1\\n c = m * (a * (a - 1) + x * (x - 1))\\n d = n * (b * (b - 1) + y * (y - 1))\\n ans += (c + d) // 2\\n ans %= mod\\nans = (ans * comb(m * n - 2, k - 2, mod)) % mod\\nans = ans * pow(2, mod - 2, mod) % mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nsys.setrecursionlimit(10**8)\\nmod = 10**9 + 7\\n# mod = 998244353\\nINF = 10**18\\neps = 10**-7\\nm, n, k = list(map(int, readline().split()))\\n\\n\\ndef comb(n, r, mod):\\n r = min(r, n - r)\\n mol = 1\\n deno = 1\\n for i in range(1, r + 1):\\n mol = mol * (n - r + i) % mod\\n deno = deno * i % mod\\n ret = mol * pow(deno, mod - 2, mod) % mod\\n return ret\\n\\n\\nans = m * n * (m + n) * (m * n - 1) // 3\\nans = (ans * comb(m * n - 2, k - 2, mod)) % mod\\nans = ans * pow(2, mod - 2, mod) % mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.7142857143,\n", + " 'diff': ['-def f1(x, y, a, b):',\n", + " '- return (a + b - x - y) * (a - x + 1) * (b - y + 1) // 2',\n", + " '-',\n", + " '-',\n", + " '-def f2(x, a):',\n", + " '- return (a - x) * (a - x + 1) // 2',\n", + " '-',\n", + " '-',\n", + " '-ans = 0',\n", + " '-for x in range(1, n + 1):',\n", + " '- for y in range(1, m + 1):',\n", + " '- a = n - x + 1',\n", + " '- b = m - y + 1',\n", + " '- c = m * (a * (a - 1) + x * (x - 1))',\n", + " '- d = n * (b * (b - 1) + y * (y - 1))',\n", + " '- ans += (c + d) // 2',\n", + " '- ans %= mod',\n", + " '+ans = m * n * (m + n) * (m * n - 1) // 3'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3618569455,\n", + " 'measured_runtime_v1': 0.2781652772,\n", + " 'runtime_lift': 1.3008702923,\n", + " 'key': ['s387237372', 's322645394']},\n", + " {'user_id': 'u644907318',\n", + " 'problem_id': 'p02886',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's745140004',\n", + " 'submission_id_v1': 's021490246',\n", + " 'cpu_time_v0': 167,\n", + " 'cpu_time_v1': 89,\n", + " 'memory_v0': 38512,\n", + " 'memory_v1': 61656,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 46.71,\n", + " 'input': 'N = int(eval(input()))\\n\\nD = list(map(int,input().split()))\\n\\ncnt = 0\\n\\nfor i in range(N-1):\\n\\n for j in range(i+1,N):\\n\\n cnt += D[i]*D[j]\\n\\nprint(cnt)',\n", + " 'target': 'N = int(eval(input()))\\n\\nD = list(map(int,input().split()))\\n\\ncnt = 0\\n\\nfor i in range(N):\\n\\n cnt += D[i]**2\\n\\ntot = 0\\n\\nfor i in range(N):\\n\\n tot += D[i]\\n\\ntot = tot**2\\n\\ntot -= cnt\\n\\nprint((tot//2))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 149,\n", + " 'code_v1_num_chars': 188,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nD = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(N - 1):\\n for j in range(i + 1, N):\\n cnt += D[i] * D[j]\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nD = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(N):\\n cnt += D[i] ** 2\\ntot = 0\\nfor i in range(N):\\n tot += D[i]\\ntot = tot**2\\ntot -= cnt\\nprint((tot // 2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.3636363636,\n", + " 'diff': ['-for i in range(N - 1):',\n", + " '- for j in range(i + 1, N):',\n", + " '- cnt += D[i] * D[j]',\n", + " '-print(cnt)',\n", + " '+for i in range(N):',\n", + " '+ cnt += D[i] ** 2',\n", + " '+tot = 0',\n", + " '+for i in range(N):',\n", + " '+ tot += D[i]',\n", + " '+tot = tot**2',\n", + " '+tot -= cnt',\n", + " '+print((tot // 2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2884610276,\n", + " 'measured_runtime_v1': 0.2260356005,\n", + " 'runtime_lift': 1.2761751997,\n", + " 'key': ['s745140004', 's021490246']},\n", + " {'user_id': 'u263737105',\n", + " 'problem_id': 'p02595',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's947121829',\n", + " 'submission_id_v1': 's479170385',\n", + " 'cpu_time_v0': 481,\n", + " 'cpu_time_v1': 391,\n", + " 'memory_v0': 9072,\n", + " 'memory_v1': 9124,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.71,\n", + " 'input': 'N, D = list(map(int, input().split()))\\n\\ncount = 0\\n\\nfor i in range(N):\\n\\n a, b = list(map(int, input().split()))\\n\\n if (a**2 + b**2) <= D**2:\\n\\n count += 1\\n\\nprint(count)\\n',\n", + " 'target': 'N, D = list(map(int, input().split()))\\n\\ncount = 0\\n\\nfor i in range(N):\\n\\n a, b = list(map(int, input().split()))\\n\\n if (a*a + b*b) <= D*D:\\n\\n count += 1\\n\\nprint(count)\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 167,\n", + " 'code_v1_num_chars': 164,\n", + " 'code_v0_no_empty_lines': 'N, D = list(map(int, input().split()))\\ncount = 0\\nfor i in range(N):\\n a, b = list(map(int, input().split()))\\n if (a**2 + b**2) <= D**2:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'N, D = list(map(int, input().split()))\\ncount = 0\\nfor i in range(N):\\n a, b = list(map(int, input().split()))\\n if (a * a + b * b) <= D * D:\\n count += 1\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- if (a**2 + b**2) <= D**2:',\n", + " '+ if (a * a + b * b) <= D * D:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2832637064,\n", + " 'measured_runtime_v1': 0.1751975398,\n", + " 'runtime_lift': 1.6168246811,\n", + " 'key': ['s947121829', 's479170385']},\n", + " {'user_id': 'u933622697',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's043120968',\n", + " 'submission_id_v1': 's898487040',\n", + " 'cpu_time_v0': 153,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12484,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.58,\n", + " 'input': '# Use numpy if you use column operation\\n\\nimport numpy as np\\n\\nh, w = list(map(int, input().split()))\\n\\n\\n\\n# Get grid colors\\n\\ngird_colors = np.array([])\\n\\nfor _ in range(h):\\n\\n tmp_row = np.array(list(eval(input())))\\n\\n if \"#\" in tmp_row: # If the row includes black\\n\\n gird_colors = np.concatenate((gird_colors, tmp_row))\\n\\ngird_colors = gird_colors.reshape(-1, w)\\n\\n\\n\\n# Search and delete white line\\n\\ndel_count = 0\\n\\nfor wi in range(w):\\n\\n if \"#\" not in gird_colors[:, wi - del_count]:\\n\\n gird_colors = np.delete(gird_colors, wi - del_count, 1)\\n\\n del_count += 1\\n\\n\\n\\n# Print result\\n\\nfor line_val in gird_colors:\\n\\n print((\"\".join(line_val))) ',\n", + " 'target': 'h, w = list(map(int, input().split()))\\n\\ngrid = [list(eval(input())) for _ in range(h)]\\n\\n\\n\\n# Filtering the data if any \"#\" are existed in the each row or col\\n\\n# Usage: filter(lambda row: , grid or zip(*grid)) \\n\\n# If true, the row is not be deleted\\n\\n# (Do not use if statement!)\\n\\nrow_compressed_grid = list([row for row in grid if any(x == \"#\" for x in row)])\\n\\ncompressed_grid = list([col for col in zip(*row_compressed_grid) if any(x == \"#\" for x in col)])\\n\\n# list -> string and out\\n\\nfor row in zip(*compressed_grid):\\n\\n print((\"\".join(row)))',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 647,\n", + " 'code_v1_num_chars': 552,\n", + " 'code_v0_no_empty_lines': '# Use numpy if you use column operation\\nimport numpy as np\\n\\nh, w = list(map(int, input().split()))\\n# Get grid colors\\ngird_colors = np.array([])\\nfor _ in range(h):\\n tmp_row = np.array(list(eval(input())))\\n if \"#\" in tmp_row: # If the row includes black\\n gird_colors = np.concatenate((gird_colors, tmp_row))\\ngird_colors = gird_colors.reshape(-1, w)\\n# Search and delete white line\\ndel_count = 0\\nfor wi in range(w):\\n if \"#\" not in gird_colors[:, wi - del_count]:\\n gird_colors = np.delete(gird_colors, wi - del_count, 1)\\n del_count += 1\\n# Print result\\nfor line_val in gird_colors:\\n print((\"\".join(line_val)))\\n',\n", + " 'code_v1_no_empty_lines': 'h, w = list(map(int, input().split()))\\ngrid = [list(eval(input())) for _ in range(h)]\\n# Filtering the data if any \"#\" are existed in the each row or col\\n# Usage: filter(lambda row: , grid or zip(*grid))\\n# If true, the row is not be deleted\\n# (Do not use if statement!)\\nrow_compressed_grid = list([row for row in grid if any(x == \"#\" for x in row)])\\ncompressed_grid = list(\\n [col for col in zip(*row_compressed_grid) if any(x == \"#\" for x in col)]\\n)\\n# list -> string and out\\nfor row in zip(*compressed_grid):\\n print((\"\".join(row)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 45.4545454545,\n", + " 'diff': ['-# Use numpy if you use column operation',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-# Get grid colors',\n", + " '-gird_colors = np.array([])',\n", + " '-for _ in range(h):',\n", + " '- tmp_row = np.array(list(eval(input())))',\n", + " '- if \"#\" in tmp_row: # If the row includes black',\n", + " '- gird_colors = np.concatenate((gird_colors, tmp_row))',\n", + " '-gird_colors = gird_colors.reshape(-1, w)',\n", + " '-# Search and delete white line',\n", + " '-del_count = 0',\n", + " '-for wi in range(w):',\n", + " '- if \"#\" not in gird_colors[:, wi - del_count]:',\n", + " '- gird_colors = np.delete(gird_colors, wi - del_count, 1)',\n", + " '- del_count += 1',\n", + " '-# Print result',\n", + " '-for line_val in gird_colors:',\n", + " '- print((\"\".join(line_val)))',\n", + " '+grid = [list(eval(input())) for _ in range(h)]',\n", + " '+# Filtering the data if any \"#\" are existed in the each row or col',\n", + " '+# Usage: filter(lambda row: , grid or zip(*grid))',\n", + " '+# If true, the row is not be deleted',\n", + " '+# (Do not use if statement!)',\n", + " '+row_compressed_grid = list([row for row in grid if any(x == \"#\" for x in row)])',\n", + " '+compressed_grid = list(',\n", + " '+ [col for col in zip(*row_compressed_grid) if any(x == \"#\" for x in col)]',\n", + " '+)',\n", + " '+# list -> string and out',\n", + " '+for row in zip(*compressed_grid):',\n", + " '+ print((\"\".join(row)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0488239424,\n", + " 'measured_runtime_v1': 0.3252195714,\n", + " 'runtime_lift': 6.2998174844,\n", + " 'key': ['s043120968', 's898487040']},\n", + " {'user_id': 'u133936772',\n", + " 'problem_id': 'p02988',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's657683547',\n", + " 'submission_id_v1': 's740427744',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'n = int(eval(input()))\\n\\nl = list(map(int, input().split()))\\n\\nprint((sum(l[i]l[i+1]>l[i+2] for i in range(n-2))))',\n", + " 'target': 'n=int(eval(input()))\\n\\nl=list(map(int,input().split()))\\n\\na=0\\n\\nfor i in range(n-2):\\n\\n p,q,r=l[i:i+3]\\n\\n if p l[i + 1] > l[i + 2]\\n for i in range(n - 2)\\n )\\n )\\n)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nl = list(map(int, input().split()))\\na = 0\\nfor i in range(n - 2):\\n p, q, r = l[i : i + 3]\\n if p < q < r or r < q < p:\\n a += 1\\nprint(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 57.1428571429,\n", + " 'diff': ['-print(',\n", + " '- (',\n", + " '- sum(',\n", + " '- l[i] < l[i + 1] < l[i + 2] or l[i] > l[i + 1] > l[i + 2]',\n", + " '- for i in range(n - 2)',\n", + " '- )',\n", + " '- )',\n", + " '-)',\n", + " '+a = 0',\n", + " '+for i in range(n - 2):',\n", + " '+ p, q, r = l[i : i + 3]',\n", + " '+ if p < q < r or r < q < p:',\n", + " '+ a += 1',\n", + " '+print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1639216754,\n", + " 'measured_runtime_v1': 0.0058678908,\n", + " 'runtime_lift': 27.9353658749,\n", + " 'key': ['s657683547', 's740427744']},\n", + " {'user_id': 'u624689667',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's800016333',\n", + " 'submission_id_v1': 's112879561',\n", + " 'cpu_time_v0': 271,\n", + " 'cpu_time_v1': 164,\n", + " 'memory_v0': 42736,\n", + " 'memory_v1': 38512,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.48,\n", + " 'input': 'from math import factorial\\n\\n\\n\\nmod = 10**9 + 7\\n\\nn = int(eval(input()))\\n\\n\\n\\nans = factorial(n) % mod\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\nMOD = 10**9 + 7\\n\\nans = 1\\n\\nfor i in range(2, N+1):\\n\\n ans *= i\\n\\n ans %= MOD\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 103,\n", + " 'code_v1_num_chars': 110,\n", + " 'code_v0_no_empty_lines': 'from math import factorial\\n\\nmod = 10**9 + 7\\nn = int(eval(input()))\\nans = factorial(n) % mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nMOD = 10**9 + 7\\nans = 1\\nfor i in range(2, N + 1):\\n ans *= i\\n ans %= MOD\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-from math import factorial',\n", + " '-',\n", + " '-mod = 10**9 + 7',\n", + " '-n = int(eval(input()))',\n", + " '-ans = factorial(n) % mod',\n", + " '+N = int(eval(input()))',\n", + " '+MOD = 10**9 + 7',\n", + " '+ans = 1',\n", + " '+for i in range(2, N + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= MOD'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5071064572,\n", + " 'measured_runtime_v1': 0.006458343,\n", + " 'runtime_lift': 78.5195915066,\n", + " 'key': ['s800016333', 's112879561']},\n", + " {'user_id': 'u145950990',\n", + " 'problem_id': 'p02552',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's431367942',\n", + " 'submission_id_v1': 's270499104',\n", + " 'cpu_time_v0': 32,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 9148,\n", + " 'memory_v1': 9028,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.88,\n", + " 'input': 'x = int(eval(input()))\\n\\nprint((0 if x==1 else 1))',\n", + " 'target': \"s = eval(input())\\n\\nif s == '0':\\n\\n print((1))\\n\\nelse:\\n\\n print((0))\",\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 41,\n", + " 'code_v1_num_chars': 56,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nprint((0 if x == 1 else 1))\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nif s == \"0\":\\n print((1))\\nelse:\\n print((0))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 60.0,\n", + " 'diff': ['-x = int(eval(input()))',\n", + " '-print((0 if x == 1 else 1))',\n", + " '+s = eval(input())',\n", + " '+if s == \"0\":',\n", + " '+ print((1))',\n", + " '+else:',\n", + " '+ print((0))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2680207849,\n", + " 'measured_runtime_v1': 0.0548314691,\n", + " 'runtime_lift': 4.8880832377,\n", + " 'key': ['s431367942', 's270499104']},\n", + " {'user_id': 'u860002137',\n", + " 'problem_id': 'p02952',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's726498671',\n", + " 'submission_id_v1': 's714071292',\n", + " 'cpu_time_v0': 61,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 9004,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 57.38,\n", + " 'input': 'N = int(eval(input()))\\n\\n\\n\\nans = 0\\n\\n\\n\\nfor i in range(1, N+1):\\n\\n if len(str(i))%2==1:\\n\\n ans += 1\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'import sys\\n\\n\\n\\n\\n\\ndef rec(length):\\n\\n if length == 1:\\n\\n return 9\\n\\n else:\\n\\n return 9 * 10**(length - 1) + rec(length - 2)\\n\\n\\n\\n\\n\\nn = eval(input())\\n\\nlength = len(n)\\n\\n\\n\\nif length == 1:\\n\\n print(n)\\n\\n sys.exit()\\n\\n\\n\\nif length % 2 == 0:\\n\\n ans = rec(length - 1)\\n\\nelse:\\n\\n ans = rec(length - 2) + int(n) - int(\"1\" + \"0\" * (length - 1)) + 1\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 112,\n", + " 'code_v1_num_chars': 363,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nans = 0\\nfor i in range(1, N + 1):\\n if len(str(i)) % 2 == 1:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef rec(length):\\n if length == 1:\\n return 9\\n else:\\n return 9 * 10 ** (length - 1) + rec(length - 2)\\n\\n\\nn = eval(input())\\nlength = len(n)\\nif length == 1:\\n print(n)\\n sys.exit()\\nif length % 2 == 0:\\n ans = rec(length - 1)\\nelse:\\n ans = rec(length - 2) + int(n) - int(\"1\" + \"0\" * (length - 1)) + 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 60.8695652174,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-ans = 0',\n", + " '-for i in range(1, N + 1):',\n", + " '- if len(str(i)) % 2 == 1:',\n", + " '- ans += 1',\n", + " '+import sys',\n", + " '+',\n", + " '+',\n", + " '+def rec(length):',\n", + " '+ if length == 1:',\n", + " '+ return 9',\n", + " '+ else:',\n", + " '+ return 9 * 10 ** (length - 1) + rec(length - 2)',\n", + " '+',\n", + " '+',\n", + " '+n = eval(input())',\n", + " '+length = len(n)',\n", + " '+if length == 1:',\n", + " '+ print(n)',\n", + " '+ sys.exit()',\n", + " '+if length % 2 == 0:',\n", + " '+ ans = rec(length - 1)',\n", + " '+else:',\n", + " '+ ans = rec(length - 2) + int(n) - int(\"1\" + \"0\" * (length - 1)) + 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2155013096,\n", + " 'measured_runtime_v1': 0.1672313638,\n", + " 'runtime_lift': 1.2886417043,\n", + " 'key': ['s726498671', 's714071292']},\n", + " {'user_id': 'u893063840',\n", + " 'problem_id': 'p03801',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's790222372',\n", + " 'submission_id_v1': 's964537161',\n", + " 'cpu_time_v0': 316,\n", + " 'cpu_time_v1': 278,\n", + " 'memory_v0': 40396,\n", + " 'memory_v1': 31800,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.03,\n", + " 'input': 'n = int(input())\\n\\na = list(map(int, input().split()))\\n\\n\\n\\ntmp = [[e, n - i] for i, e in enumerate(a)]\\n\\ntmp.sort(reverse=True)\\n\\n\\n\\naa = [[e, n - i] for e, i in tmp] + [[0, -1]]\\n\\n\\n\\nv_prev, i_prev = aa[0]\\n\\ni = 0\\n\\nans = [0] * n\\n\\nsm = 0\\n\\nwhile i < n:\\n\\n while aa[i][1] >= i_prev:\\n\\n sm += aa[i][0]\\n\\n i += 1\\n\\n\\n\\n ans[i_prev] += sm - aa[i][0] * i\\n\\n sm = aa[i][0] * i\\n\\n v_prev, i_prev = aa[i]\\n\\n\\n\\nprint(*ans, sep=\"\\\\n\")\\n',\n", + " 'target': 'from bisect import bisect_right\\n\\n\\n\\nn = int(input())\\n\\na = list(map(int, input().split()))\\n\\n\\n\\nli = [[0, -1]]\\n\\nfor i, e in enumerate(a):\\n\\n if e > li[-1][0]:\\n\\n li.append([e, i])\\n\\n\\n\\nli = li[::-1]\\n\\n\\n\\na.sort()\\n\\nacc = [0] * (n + 1)\\n\\nfor i in range(n - 1, -1, -1):\\n\\n acc[i] = acc[i+1] + a[i]\\n\\n\\n\\nans = [0] * n\\n\\nsub = 0\\n\\nans_prev = 0\\n\\nfor (ep, ip), (e, i) in zip(li, li[1:]):\\n\\n j = bisect_right(a, e)\\n\\n ans[ip] = acc[j] - e * (n - j)\\n\\n\\n\\ni_prev = 0\\n\\nfor i in range(1, n):\\n\\n if ans[i]:\\n\\n ans[i_prev] -= ans[i]\\n\\n i_prev = i\\n\\n\\n\\nprint(*ans, sep=\"\\\\n\")\\n',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 431,\n", + " 'code_v1_num_chars': 571,\n", + " 'code_v0_no_empty_lines': 'n = int(input())\\na = list(map(int, input().split()))\\ntmp = [[e, n - i] for i, e in enumerate(a)]\\ntmp.sort(reverse=True)\\naa = [[e, n - i] for e, i in tmp] + [[0, -1]]\\nv_prev, i_prev = aa[0]\\ni = 0\\nans = [0] * n\\nsm = 0\\nwhile i < n:\\n while aa[i][1] >= i_prev:\\n sm += aa[i][0]\\n i += 1\\n ans[i_prev] += sm - aa[i][0] * i\\n sm = aa[i][0] * i\\n v_prev, i_prev = aa[i]\\nprint(*ans, sep=\"\\\\n\")\\n',\n", + " 'code_v1_no_empty_lines': 'from bisect import bisect_right\\n\\nn = int(input())\\na = list(map(int, input().split()))\\nli = [[0, -1]]\\nfor i, e in enumerate(a):\\n if e > li[-1][0]:\\n li.append([e, i])\\nli = li[::-1]\\na.sort()\\nacc = [0] * (n + 1)\\nfor i in range(n - 1, -1, -1):\\n acc[i] = acc[i + 1] + a[i]\\nans = [0] * n\\nsub = 0\\nans_prev = 0\\nfor (ep, ip), (e, i) in zip(li, li[1:]):\\n j = bisect_right(a, e)\\n ans[ip] = acc[j] - e * (n - j)\\ni_prev = 0\\nfor i in range(1, n):\\n if ans[i]:\\n ans[i_prev] -= ans[i]\\n i_prev = i\\nprint(*ans, sep=\"\\\\n\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 29.0322580645,\n", + " 'diff': ['+from bisect import bisect_right',\n", + " '+',\n", + " '-tmp = [[e, n - i] for i, e in enumerate(a)]',\n", + " '-tmp.sort(reverse=True)',\n", + " '-aa = [[e, n - i] for e, i in tmp] + [[0, -1]]',\n", + " '-v_prev, i_prev = aa[0]',\n", + " '-i = 0',\n", + " '+li = [[0, -1]]',\n", + " '+for i, e in enumerate(a):',\n", + " '+ if e > li[-1][0]:',\n", + " '+ li.append([e, i])',\n", + " '+li = li[::-1]',\n", + " '+a.sort()',\n", + " '+acc = [0] * (n + 1)',\n", + " '+for i in range(n - 1, -1, -1):',\n", + " '+ acc[i] = acc[i + 1] + a[i]',\n", + " '-sm = 0',\n", + " '-while i < n:',\n", + " '- while aa[i][1] >= i_prev:',\n", + " '- sm += aa[i][0]',\n", + " '- i += 1',\n", + " '- ans[i_prev] += sm - aa[i][0] * i',\n", + " '- sm = aa[i][0] * i',\n", + " '- v_prev, i_prev = aa[i]',\n", + " '+sub = 0',\n", + " '+ans_prev = 0',\n", + " '+for (ep, ip), (e, i) in zip(li, li[1:]):',\n", + " '+ j = bisect_right(a, e)',\n", + " '+ ans[ip] = acc[j] - e * (n - j)',\n", + " '+i_prev = 0',\n", + " '+for i in range(1, n):',\n", + " '+ if ans[i]:',\n", + " '+ ans[i_prev] -= ans[i]',\n", + " '+ i_prev = i'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2510323788,\n", + " 'measured_runtime_v1': 0.1409289612,\n", + " 'runtime_lift': 1.7812689216,\n", + " 'key': ['s790222372', 's964537161']},\n", + " {'user_id': 'u312025627',\n", + " 'problem_id': 'p03457',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's103328073',\n", + " 'submission_id_v1': 's130173321',\n", + " 'cpu_time_v0': 250,\n", + " 'cpu_time_v1': 183,\n", + " 'memory_v0': 55644,\n", + " 'memory_v1': 21108,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.8,\n", + " 'input': 'def main():\\n\\n import sys\\n\\n input = sys.stdin.buffer.readline\\n\\n N = int(input())\\n\\n TXY = [[int(i) for i in input().split()] for j in range(N)]\\n\\n time, px, py = 0, 0, 0\\n\\n for t, x, y in TXY:\\n\\n move = abs(x-px) + abs(y-py)\\n\\n # print(move, t-time)\\n\\n if (t - time) % 2 != move % 2 or t - time < move:\\n\\n return print(\"No\")\\n\\n time, px, py = t, x, y\\n\\n print(\"Yes\")\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': 'def main():\\n\\n import sys\\n\\n input = sys.stdin.buffer.readline\\n\\n N = int(input())\\n\\n TXY = [[int(i) for i in input().split()] for j in range(N)]\\n\\n time = 0\\n\\n px = 0\\n\\n py = 0\\n\\n for t, x, y in TXY:\\n\\n move = abs(py-y) + abs(px - x)\\n\\n if (t-time) < move or (t - time) % 2 != move % 2:\\n\\n return print(\"No\")\\n\\n time = t\\n\\n px = x\\n\\n py = y\\n\\n print(\"Yes\")\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 461,\n", + " 'code_v1_num_chars': 460,\n", + " 'code_v0_no_empty_lines': 'def main():\\n import sys\\n\\n input = sys.stdin.buffer.readline\\n N = int(input())\\n TXY = [[int(i) for i in input().split()] for j in range(N)]\\n time, px, py = 0, 0, 0\\n for t, x, y in TXY:\\n move = abs(x - px) + abs(y - py)\\n # print(move, t-time)\\n if (t - time) % 2 != move % 2 or t - time < move:\\n return print(\"No\")\\n time, px, py = t, x, y\\n print(\"Yes\")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n import sys\\n\\n input = sys.stdin.buffer.readline\\n N = int(input())\\n TXY = [[int(i) for i in input().split()] for j in range(N)]\\n time = 0\\n px = 0\\n py = 0\\n for t, x, y in TXY:\\n move = abs(py - y) + abs(px - x)\\n if (t - time) < move or (t - time) % 2 != move % 2:\\n return print(\"No\")\\n time = t\\n px = x\\n py = y\\n print(\"Yes\")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.0,\n", + " 'diff': ['- time, px, py = 0, 0, 0',\n", + " '+ time = 0',\n", + " '+ px = 0',\n", + " '+ py = 0',\n", + " '- move = abs(x - px) + abs(y - py)',\n", + " '- # print(move, t-time)',\n", + " '- if (t - time) % 2 != move % 2 or t - time < move:',\n", + " '+ move = abs(py - y) + abs(px - x)',\n", + " '+ if (t - time) < move or (t - time) % 2 != move % 2:',\n", + " '- time, px, py = t, x, y',\n", + " '+ time = t',\n", + " '+ px = x',\n", + " '+ py = y'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3387642326,\n", + " 'measured_runtime_v1': 0.1945750663,\n", + " 'runtime_lift': 1.7410464712,\n", + " 'key': ['s103328073', 's130173321']},\n", + " {'user_id': 'u077898957',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's080864979',\n", + " 'submission_id_v1': 's354066004',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 42,\n", + " 'memory_v0': 3980,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.74,\n", + " 'input': 'import math\\n\\nn = int(eval(input()))\\n\\nprint((math.factorial(n)%(10**9+7)))\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\npw = 1\\n\\nfor i in range(n):\\n\\n pw *= (i+1)\\n\\n pw %= 10**9+7\\n\\nprint(pw)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 66,\n", + " 'code_v1_num_chars': 87,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nprint((math.factorial(n) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\npw = 1\\nfor i in range(n):\\n pw *= i + 1\\n pw %= 10**9 + 7\\nprint(pw)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(n) % (10**9 + 7)))',\n", + " '+pw = 1',\n", + " '+for i in range(n):',\n", + " '+ pw *= i + 1',\n", + " '+ pw %= 10**9 + 7',\n", + " '+print(pw)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.9190823469,\n", + " 'measured_runtime_v1': 0.4266894727,\n", + " 'runtime_lift': 2.1539841167,\n", + " 'key': ['s080864979', 's354066004']},\n", + " {'user_id': 'u539692012',\n", + " 'problem_id': 'p02622',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's511745855',\n", + " 'submission_id_v1': 's953276742',\n", + " 'cpu_time_v0': 78,\n", + " 'cpu_time_v1': 44,\n", + " 'memory_v0': 68212,\n", + " 'memory_v1': 9464,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.59,\n", + " 'input': 'print((sum(si != ti for si, ti in zip(eval(input()), eval(input())))))\\n',\n", + " 'target': 'print((sum(a!=b for a,b in zip(*open(0)))))',\n", + " 'code_v0_loc': 1,\n", + " 'code_v1_loc': 1,\n", + " 'code_v0_num_chars': 57,\n", + " 'code_v1_num_chars': 41,\n", + " 'code_v0_no_empty_lines': 'print((sum(si != ti for si, ti in zip(eval(input()), eval(input())))))\\n',\n", + " 'code_v1_no_empty_lines': 'print((sum(a != b for a, b in zip(*open(0)))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-print((sum(si != ti for si, ti in zip(eval(input()), eval(input())))))',\n", + " '+print((sum(a != b for a, b in zip(*open(0)))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3334237881,\n", + " 'measured_runtime_v1': 0.1220404458,\n", + " 'runtime_lift': 2.7320761232,\n", + " 'key': ['s511745855', 's953276742']},\n", + " {'user_id': 'u492447501',\n", + " 'problem_id': 'p02988',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's007840106',\n", + " 'submission_id_v1': 's122872076',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12508,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.0,\n", + " 'input': 'import copy\\n\\nimport numpy as np\\n\\n\\n\\nS = eval(input())\\n\\n\\n\\nN = int(S)\\n\\n\\n\\nS = eval(input())\\n\\n\\n\\nP = list(map(int, S.split()))\\n\\n\\n\\ncheck = []\\n\\n\\n\\ncount = 0\\n\\n\\n\\nfor i in range(0, N-2, 1):\\n\\n\\n\\n check = P[i:i+3]\\n\\n check = np.array(check)\\n\\n check = check.argsort()\\n\\n if check[1] == 1:\\n\\n count = count + 1\\n\\n\\n\\nprint(count)\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\nP = list(map(int, input().split()))\\n\\ncount = 0\\n\\nfor i in range(n-2):\\n\\n\\n\\n P_temp = [P[i], P[i+1], P[i+2]]\\n\\n P_temp.sort()\\n\\n if P_temp[1] == P[i+1]:\\n\\n count = count + 1\\n\\n\\n\\nprint(count)\\n',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 314,\n", + " 'code_v1_num_chars': 217,\n", + " 'code_v0_no_empty_lines': 'import copy\\nimport numpy as np\\n\\nS = eval(input())\\nN = int(S)\\nS = eval(input())\\nP = list(map(int, S.split()))\\ncheck = []\\ncount = 0\\nfor i in range(0, N - 2, 1):\\n check = P[i : i + 3]\\n check = np.array(check)\\n check = check.argsort()\\n if check[1] == 1:\\n count = count + 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nP = list(map(int, input().split()))\\ncount = 0\\nfor i in range(n - 2):\\n P_temp = [P[i], P[i + 1], P[i + 2]]\\n P_temp.sort()\\n if P_temp[1] == P[i + 1]:\\n count = count + 1\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 54.1666666667,\n", + " 'diff': ['-import copy',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-S = eval(input())',\n", + " '-N = int(S)',\n", + " '-S = eval(input())',\n", + " '-P = list(map(int, S.split()))',\n", + " '-check = []',\n", + " '+n = int(eval(input()))',\n", + " '+P = list(map(int, input().split()))',\n", + " '-for i in range(0, N - 2, 1):',\n", + " '- check = P[i : i + 3]',\n", + " '- check = np.array(check)',\n", + " '- check = check.argsort()',\n", + " '- if check[1] == 1:',\n", + " '+for i in range(n - 2):',\n", + " '+ P_temp = [P[i], P[i + 1], P[i + 2]]',\n", + " '+ P_temp.sort()',\n", + " '+ if P_temp[1] == P[i + 1]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5926496607,\n", + " 'measured_runtime_v1': 0.1723277428,\n", + " 'runtime_lift': 9.2419806274,\n", + " 'key': ['s007840106', 's122872076']},\n", + " {'user_id': 'u575431498',\n", + " 'problem_id': 'p03828',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's058426510',\n", + " 'submission_id_v1': 's587454237',\n", + " 'cpu_time_v0': 73,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 3572,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.34,\n", + " 'input': 'from functools import reduce\\n\\nN = int(eval(input()))\\n\\n\\n\\nprime_table = [1] * (N+1)\\n\\n\\n\\nfor x in range(2, N+1):\\n\\n for t in range(2, x+1):\\n\\n while x % t == 0:\\n\\n prime_table[t] += 1\\n\\n x //= t\\n\\nprint((reduce(lambda x, y: x * y % (int(1e9) + 7), prime_table)))',\n", + " 'target': 'def prime_factorize(n):\\n\\n while n % 2 == 0:\\n\\n a[2] += 1\\n\\n n //= 2\\n\\n f = 3\\n\\n while f * f <= n:\\n\\n if n % f == 0:\\n\\n a[f] += 1\\n\\n n //= f\\n\\n else:\\n\\n f += 2\\n\\n if n != 1:\\n\\n a[n] += 1\\n\\n\\n\\nN = int(eval(input()))\\n\\na = [0]*(N+1)\\n\\nfor i in range(2, N+1):\\n\\n prime_factorize(i)\\n\\nans = 1\\n\\nfor i in a:\\n\\n if i > 0:\\n\\n ans *= (i+1)\\n\\nbig = 10**9 + 7\\n\\nprint((ans % big))',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 277,\n", + " 'code_v1_num_chars': 432,\n", + " 'code_v0_no_empty_lines': 'from functools import reduce\\n\\nN = int(eval(input()))\\nprime_table = [1] * (N + 1)\\nfor x in range(2, N + 1):\\n for t in range(2, x + 1):\\n while x % t == 0:\\n prime_table[t] += 1\\n x //= t\\nprint((reduce(lambda x, y: x * y % (int(1e9) + 7), prime_table)))\\n',\n", + " 'code_v1_no_empty_lines': 'def prime_factorize(n):\\n while n % 2 == 0:\\n a[2] += 1\\n n //= 2\\n f = 3\\n while f * f <= n:\\n if n % f == 0:\\n a[f] += 1\\n n //= f\\n else:\\n f += 2\\n if n != 1:\\n a[n] += 1\\n\\n\\nN = int(eval(input()))\\na = [0] * (N + 1)\\nfor i in range(2, N + 1):\\n prime_factorize(i)\\nans = 1\\nfor i in a:\\n if i > 0:\\n ans *= i + 1\\nbig = 10**9 + 7\\nprint((ans % big))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 54.1666666667,\n", + " 'diff': ['-from functools import reduce',\n", + " '+def prime_factorize(n):',\n", + " '+ while n % 2 == 0:',\n", + " '+ a[2] += 1',\n", + " '+ n //= 2',\n", + " '+ f = 3',\n", + " '+ while f * f <= n:',\n", + " '+ if n % f == 0:',\n", + " '+ a[f] += 1',\n", + " '+ n //= f',\n", + " '+ else:',\n", + " '+ f += 2',\n", + " '+ if n != 1:',\n", + " '+ a[n] += 1',\n", + " '+',\n", + " '-prime_table = [1] * (N + 1)',\n", + " '-for x in range(2, N + 1):',\n", + " '- for t in range(2, x + 1):',\n", + " '- while x % t == 0:',\n", + " '- prime_table[t] += 1',\n", + " '- x //= t',\n", + " '-print((reduce(lambda x, y: x * y % (int(1e9) + 7), prime_table)))',\n", + " '+a = [0] * (N + 1)',\n", + " '+for i in range(2, N + 1):',\n", + " '+ prime_factorize(i)',\n", + " '+ans = 1',\n", + " '+for i in a:',\n", + " '+ if i > 0:',\n", + " '+ ans *= i + 1',\n", + " '+big = 10**9 + 7',\n", + " '+print((ans % big))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2580870204,\n", + " 'measured_runtime_v1': 0.1952191839,\n", + " 'runtime_lift': 1.3220371851,\n", + " 'key': ['s058426510', 's587454237']},\n", + " {'user_id': 'u145231176',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's435485475',\n", + " 'submission_id_v1': 's123950040',\n", + " 'cpu_time_v0': 820,\n", + " 'cpu_time_v1': 175,\n", + " 'memory_v0': 97132,\n", + " 'memory_v1': 83224,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 78.66,\n", + " 'input': 'def getN():\\n\\n return int(eval(input()))\\n\\ndef getNM():\\n\\n return list(map(int, input().split()))\\n\\ndef getList():\\n\\n return list(map(int, input().split()))\\n\\ndef getArray(intn):\\n\\n return [int(eval(input())) for i in range(intn)]\\n\\ndef input():\\n\\n return sys.stdin.readline().rstrip()\\n\\ndef rand_N(ran1, ran2):\\n\\n return random.randint(ran1, ran2)\\n\\ndef rand_List(ran1, ran2, rantime):\\n\\n return [random.randint(ran1, ran2) for i in range(rantime)]\\n\\ndef rand_ints_nodup(ran1, ran2, rantime):\\n\\n ns = []\\n\\n while len(ns) < rantime:\\n\\n n = random.randint(ran1, ran2)\\n\\n if not n in ns:\\n\\n ns.append(n)\\n\\n return sorted(ns)\\n\\n\\n\\ndef rand_query(ran1, ran2, rantime):\\n\\n r_query = []\\n\\n while len(r_query) < rantime:\\n\\n n_q = rand_ints_nodup(ran1, ran2, 2)\\n\\n if not n_q in r_query:\\n\\n r_query.append(n_q)\\n\\n return sorted(r_query)\\n\\n\\n\\nfrom collections import defaultdict, deque, Counter\\n\\nfrom sys import exit\\n\\nfrom decimal import *\\n\\nfrom heapq import heapify, heappop, heappush\\n\\nimport math\\n\\nimport random\\n\\nimport string\\n\\nfrom copy import deepcopy\\n\\nfrom itertools import combinations, permutations, product\\n\\nfrom operator import mul, itemgetter\\n\\nfrom functools import reduce\\n\\nfrom bisect import bisect_left, bisect_right\\n\\n\\n\\nimport sys\\n\\nsys.setrecursionlimit(1000000000)\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\n#############\\n\\n# Main Code #\\n\\n#############\\n\\n\\n\\nS = getN()\\n\\n\\n\\n# 逆元事前処理ver\\n\\n# nが小さい場合に\\n\\nlim = 10 ** 5 + 1\\n\\nfact = [1, 1]\\n\\nfactinv = [1, 1]\\n\\ninv = [0, 1]\\n\\n\\n\\nfor i in range(2, lim + 1):\\n\\n fact.append((fact[-1] * i) % mod)\\n\\n inv.append((-inv[mod % i] * (mod // i)) % mod)\\n\\n # 累計\\n\\n factinv.append((factinv[-1] * inv[-1]) % mod)\\n\\n\\n\\ndef cmb(n, r):\\n\\n if (r < 0) or (n < r):\\n\\n return 0\\n\\n r = min(r, n - r)\\n\\n return fact[n] * factinv[r] * factinv[n - r] % mod\\n\\n\\n\\nans = 0\\n\\n# 長さNの時最低でも3 * N使う\\n\\n# 残りは分配する\\n\\nfor i in range(1, 2001):\\n\\n s = S - (3 * i)\\n\\n if s < 0:\\n\\n break\\n\\n # sをN個に分配する通りがいくつあるか\\n\\n # 重複組み合わせ\\n\\n # 仕切りの数はi - 1個\\n\\n ans += cmb(s + i - 1, i - 1)\\n\\nprint((ans % mod))',\n", + " 'target': 'def getN():\\n\\n return int(eval(input()))\\n\\ndef getNM():\\n\\n return list(map(int, input().split()))\\n\\ndef getList():\\n\\n return list(map(int, input().split()))\\n\\ndef getArray(intn):\\n\\n return [int(eval(input())) for i in range(intn)]\\n\\ndef input():\\n\\n return sys.stdin.readline().rstrip()\\n\\ndef rand_N(ran1, ran2):\\n\\n return random.randint(ran1, ran2)\\n\\ndef rand_List(ran1, ran2, rantime):\\n\\n return [random.randint(ran1, ran2) for i in range(rantime)]\\n\\ndef rand_ints_nodup(ran1, ran2, rantime):\\n\\n ns = []\\n\\n while len(ns) < rantime:\\n\\n n = random.randint(ran1, ran2)\\n\\n if not n in ns:\\n\\n ns.append(n)\\n\\n return sorted(ns)\\n\\n\\n\\ndef rand_query(ran1, ran2, rantime):\\n\\n r_query = []\\n\\n while len(r_query) < rantime:\\n\\n n_q = rand_ints_nodup(ran1, ran2, 2)\\n\\n if not n_q in r_query:\\n\\n r_query.append(n_q)\\n\\n return sorted(r_query)\\n\\n\\n\\nfrom collections import defaultdict, deque, Counter\\n\\nfrom sys import exit\\n\\nfrom decimal import *\\n\\nfrom heapq import heapify, heappop, heappush\\n\\nimport math\\n\\nimport random\\n\\nimport string\\n\\nfrom copy import deepcopy\\n\\nfrom itertools import combinations, permutations, product\\n\\nfrom operator import mul, itemgetter\\n\\nfrom functools import reduce\\n\\nfrom bisect import bisect_left, bisect_right\\n\\n\\n\\nimport sys\\n\\nsys.setrecursionlimit(1000000000)\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\n#############\\n\\n# Main Code #\\n\\n#############\\n\\n\\n\\nN = getN()\\n\\nlogk = N.bit_length()\\n\\n\\n\\n# 漸化式にできるなら行列計算に落とし込める\\n\\n# A[n] = A[n - 1] + A[n - 3]なので\\n\\n# [a2, a1, a0] = [0, 0, 1]\\n\\n# [[1, 1, 0], [0, 0, 1], [1, 0, 0]]のN乗をすれば\\n\\n# [an+2, an+1, an] が出る\\n\\n\\n\\ndp = [[[0, 0, 0] for i in range(3)] for i in range(logk)]\\n\\ndp[0] = [\\n\\n[1, 1, 0],\\n\\n[0, 0, 1],\\n\\n[1, 0, 0]\\n\\n]\\n\\n\\n\\n# 行列掛け算 O(n3)かかる\\n\\ndef array_cnt(ar1, ar2):\\n\\n h = len(ar1)\\n\\n w = len(ar2[0])\\n\\n row = ar1\\n\\n col = []\\n\\n for j in range(w):\\n\\n opt = []\\n\\n for i in range(len(ar2)):\\n\\n opt.append(ar2[i][j])\\n\\n col.append(opt)\\n\\n\\n\\n res = [[[0, 0] for i in range(w)] for i in range(h)]\\n\\n for i in range(h):\\n\\n for j in range(w):\\n\\n cnt = 0\\n\\n for x, y in zip(row[i], col[j]):\\n\\n cnt += x * y\\n\\n res[i][j] = cnt\\n\\n res[i][j] %= mod\\n\\n return res\\n\\n\\n\\nfor i in range(1, logk):\\n\\n dp[i] = array_cnt(dp[i - 1], dp[i - 1])\\n\\n\\n\\nans = [[0, 0, 1]]\\n\\nfor i in range(logk):\\n\\n if N & (1 << i):\\n\\n ans = array_cnt(ans, dp[i])\\n\\nprint((ans[0][2] % mod))',\n", + " 'code_v0_loc': 84,\n", + " 'code_v1_loc': 97,\n", + " 'code_v0_num_chars': 2000,\n", + " 'code_v1_num_chars': 2372,\n", + " 'code_v0_no_empty_lines': 'def getN():\\n return int(eval(input()))\\n\\n\\ndef getNM():\\n return list(map(int, input().split()))\\n\\n\\ndef getList():\\n return list(map(int, input().split()))\\n\\n\\ndef getArray(intn):\\n return [int(eval(input())) for i in range(intn)]\\n\\n\\ndef input():\\n return sys.stdin.readline().rstrip()\\n\\n\\ndef rand_N(ran1, ran2):\\n return random.randint(ran1, ran2)\\n\\n\\ndef rand_List(ran1, ran2, rantime):\\n return [random.randint(ran1, ran2) for i in range(rantime)]\\n\\n\\ndef rand_ints_nodup(ran1, ran2, rantime):\\n ns = []\\n while len(ns) < rantime:\\n n = random.randint(ran1, ran2)\\n if not n in ns:\\n ns.append(n)\\n return sorted(ns)\\n\\n\\ndef rand_query(ran1, ran2, rantime):\\n r_query = []\\n while len(r_query) < rantime:\\n n_q = rand_ints_nodup(ran1, ran2, 2)\\n if not n_q in r_query:\\n r_query.append(n_q)\\n return sorted(r_query)\\n\\n\\nfrom collections import defaultdict, deque, Counter\\nfrom sys import exit\\nfrom decimal import *\\nfrom heapq import heapify, heappop, heappush\\nimport math\\nimport random\\nimport string\\nfrom copy import deepcopy\\nfrom itertools import combinations, permutations, product\\nfrom operator import mul, itemgetter\\nfrom functools import reduce\\nfrom bisect import bisect_left, bisect_right\\nimport sys\\n\\nsys.setrecursionlimit(1000000000)\\nmod = 10**9 + 7\\n#############\\n# Main Code #\\n#############\\nS = getN()\\n# 逆元事前処理ver\\n# nが小さい場合に\\nlim = 10**5 + 1\\nfact = [1, 1]\\nfactinv = [1, 1]\\ninv = [0, 1]\\nfor i in range(2, lim + 1):\\n fact.append((fact[-1] * i) % mod)\\n inv.append((-inv[mod % i] * (mod // i)) % mod)\\n # 累計\\n factinv.append((factinv[-1] * inv[-1]) % mod)\\n\\n\\ndef cmb(n, r):\\n if (r < 0) or (n < r):\\n return 0\\n r = min(r, n - r)\\n return fact[n] * factinv[r] * factinv[n - r] % mod\\n\\n\\nans = 0\\n# 長さNの時最低でも3 * N使う\\n# 残りは分配する\\nfor i in range(1, 2001):\\n s = S - (3 * i)\\n if s < 0:\\n break\\n # sをN個に分配する通りがいくつあるか\\n # 重複組み合わせ\\n # 仕切りの数はi - 1個\\n ans += cmb(s + i - 1, i - 1)\\nprint((ans % mod))\\n',\n", + " 'code_v1_no_empty_lines': 'def getN():\\n return int(eval(input()))\\n\\n\\ndef getNM():\\n return list(map(int, input().split()))\\n\\n\\ndef getList():\\n return list(map(int, input().split()))\\n\\n\\ndef getArray(intn):\\n return [int(eval(input())) for i in range(intn)]\\n\\n\\ndef input():\\n return sys.stdin.readline().rstrip()\\n\\n\\ndef rand_N(ran1, ran2):\\n return random.randint(ran1, ran2)\\n\\n\\ndef rand_List(ran1, ran2, rantime):\\n return [random.randint(ran1, ran2) for i in range(rantime)]\\n\\n\\ndef rand_ints_nodup(ran1, ran2, rantime):\\n ns = []\\n while len(ns) < rantime:\\n n = random.randint(ran1, ran2)\\n if not n in ns:\\n ns.append(n)\\n return sorted(ns)\\n\\n\\ndef rand_query(ran1, ran2, rantime):\\n r_query = []\\n while len(r_query) < rantime:\\n n_q = rand_ints_nodup(ran1, ran2, 2)\\n if not n_q in r_query:\\n r_query.append(n_q)\\n return sorted(r_query)\\n\\n\\nfrom collections import defaultdict, deque, Counter\\nfrom sys import exit\\nfrom decimal import *\\nfrom heapq import heapify, heappop, heappush\\nimport math\\nimport random\\nimport string\\nfrom copy import deepcopy\\nfrom itertools import combinations, permutations, product\\nfrom operator import mul, itemgetter\\nfrom functools import reduce\\nfrom bisect import bisect_left, bisect_right\\nimport sys\\n\\nsys.setrecursionlimit(1000000000)\\nmod = 10**9 + 7\\n#############\\n# Main Code #\\n#############\\nN = getN()\\nlogk = N.bit_length()\\n# 漸化式にできるなら行列計算に落とし込める\\n# A[n] = A[n - 1] + A[n - 3]なので\\n# [a2, a1, a0] = [0, 0, 1]\\n# [[1, 1, 0], [0, 0, 1], [1, 0, 0]]のN乗をすれば\\n# [an+2, an+1, an] が出る\\ndp = [[[0, 0, 0] for i in range(3)] for i in range(logk)]\\ndp[0] = [[1, 1, 0], [0, 0, 1], [1, 0, 0]]\\n# 行列掛け算 O(n3)かかる\\ndef array_cnt(ar1, ar2):\\n h = len(ar1)\\n w = len(ar2[0])\\n row = ar1\\n col = []\\n for j in range(w):\\n opt = []\\n for i in range(len(ar2)):\\n opt.append(ar2[i][j])\\n col.append(opt)\\n res = [[[0, 0] for i in range(w)] for i in range(h)]\\n for i in range(h):\\n for j in range(w):\\n cnt = 0\\n for x, y in zip(row[i], col[j]):\\n cnt += x * y\\n res[i][j] = cnt\\n res[i][j] %= mod\\n return res\\n\\n\\nfor i in range(1, logk):\\n dp[i] = array_cnt(dp[i - 1], dp[i - 1])\\nans = [[0, 0, 1]]\\nfor i in range(logk):\\n if N & (1 << i):\\n ans = array_cnt(ans, dp[i])\\nprint((ans[0][2] % mod))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.4020618557,\n", + " 'diff': ['-S = getN()',\n", + " '-# 逆元事前処理ver',\n", + " '-# nが小さい場合に',\n", + " '-lim = 10**5 + 1',\n", + " '-fact = [1, 1]',\n", + " '-factinv = [1, 1]',\n", + " '-inv = [0, 1]',\n", + " '-for i in range(2, lim + 1):',\n", + " '- fact.append((fact[-1] * i) % mod)',\n", + " '- inv.append((-inv[mod % i] * (mod // i)) % mod)',\n", + " '- # 累計',\n", + " '- factinv.append((factinv[-1] * inv[-1]) % mod)',\n", + " '+N = getN()',\n", + " '+logk = N.bit_length()',\n", + " '+# 漸化式にできるなら行列計算に落とし込める',\n", + " '+# A[n] = A[n - 1] + A[n - 3]なので',\n", + " '+# [a2, a1, a0] = [0, 0, 1]',\n", + " '+# [[1, 1, 0], [0, 0, 1], [1, 0, 0]]のN乗をすれば',\n", + " '+# [an+2, an+1, an] が出る',\n", + " '+dp = [[[0, 0, 0] for i in range(3)] for i in range(logk)]',\n", + " '+dp[0] = [[1, 1, 0], [0, 0, 1], [1, 0, 0]]',\n", + " '+# 行列掛け算 O(n3)かかる',\n", + " '+def array_cnt(ar1, ar2):',\n", + " '+ h = len(ar1)',\n", + " '+ w = len(ar2[0])',\n", + " '+ row = ar1',\n", + " '+ col = []',\n", + " '+ for j in range(w):',\n", + " '+ opt = []',\n", + " '+ for i in range(len(ar2)):',\n", + " '+ opt.append(ar2[i][j])',\n", + " '+ col.append(opt)',\n", + " '+ res = [[[0, 0] for i in range(w)] for i in range(h)]',\n", + " '+ for i in range(h):',\n", + " '+ for j in range(w):',\n", + " '+ cnt = 0',\n", + " '+ for x, y in zip(row[i], col[j]):',\n", + " '+ cnt += x * y',\n", + " '+ res[i][j] = cnt',\n", + " '+ res[i][j] %= mod',\n", + " '+ return res',\n", + " '-def cmb(n, r):',\n", + " '- if (r < 0) or (n < r):',\n", + " '- return 0',\n", + " '- r = min(r, n - r)',\n", + " '- return fact[n] * factinv[r] * factinv[n - r] % mod',\n", + " '-',\n", + " '-',\n", + " '-ans = 0',\n", + " '-# 長さNの時最低でも3 * N使う',\n", + " '-# 残りは分配する',\n", + " '-for i in range(1, 2001):',\n", + " '- s = S - (3 * i)',\n", + " '- if s < 0:',\n", + " '- break',\n", + " '- # sをN個に分配する通りがいくつあるか',\n", + " '- # 重複組み合わせ',\n", + " '- # 仕切りの数はi - 1個',\n", + " '- ans += cmb(s + i - 1, i - 1)',\n", + " '-print((ans % mod))',\n", + " '+for i in range(1, logk):',\n", + " '+ dp[i] = array_cnt(dp[i - 1], dp[i - 1])',\n", + " '+ans = [[0, 0, 1]]',\n", + " '+for i in range(logk):',\n", + " '+ if N & (1 << i):',\n", + " '+ ans = array_cnt(ans, dp[i])',\n", + " '+print((ans[0][2] % mod))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3269546282,\n", + " 'measured_runtime_v1': 0.2049855587,\n", + " 'runtime_lift': 6.4734054256,\n", + " 'key': ['s435485475', 's123950040']},\n", + " {'user_id': 'u287132915',\n", + " 'problem_id': 'p02891',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's480399361',\n", + " 'submission_id_v1': 's640908939',\n", + " 'cpu_time_v0': 182,\n", + " 'cpu_time_v1': 72,\n", + " 'memory_v0': 38256,\n", + " 'memory_v1': 61768,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 60.44,\n", + " 'input': \"s = eval(input())\\n\\nk = int(eval(input()))\\n\\n\\n\\nif len(set(s)) == 1:\\n\\n print(((len(s)*k)//2))\\n\\n exit()\\n\\n\\n\\nss = s + s\\n\\n\\n\\nshoko = 0\\n\\nprev = ''\\n\\ncnt = 0\\n\\nfor i in range(len(s)):\\n\\n if s[i] == prev:\\n\\n cnt += 1\\n\\n else:\\n\\n shoko += cnt // 2\\n\\n cnt = 1\\n\\n prev = s[i]\\n\\nshoko += cnt // 2\\n\\n\\n\\nkosa = 0\\n\\nprev = ''\\n\\ncnt = 0\\n\\nfor i in range(len(ss)):\\n\\n if ss[i] == prev:\\n\\n cnt += 1\\n\\n else:\\n\\n kosa += cnt // 2\\n\\n cnt = 1\\n\\n prev = ss[i]\\n\\nkosa += cnt // 2\\n\\nkosa -= shoko\\n\\n\\n\\nprint((shoko + (k-1)*kosa))\",\n", + " 'target': 's = eval(input())\\n\\nk = int(eval(input()))\\n\\nn = len(s)\\n\\n\\n\\nif len(set(s)) == 1:\\n\\n print((n*k//2))\\n\\n exit()\\n\\n\\n\\nss = s + s\\n\\ncnts = 0\\n\\nnow = s[0]\\n\\ntemp = 1\\n\\nfor i in range(1, n):\\n\\n if s[i] == now:\\n\\n temp += 1\\n\\n else:\\n\\n cnts += temp // 2\\n\\n temp = 1\\n\\n now = s[i]\\n\\ncnts += temp // 2\\n\\n\\n\\ncntss = 0\\n\\nnow = ss[0]\\n\\ntemp = 1\\n\\nfor i in range(1, 2*n):\\n\\n if ss[i] == now:\\n\\n temp += 1\\n\\n else:\\n\\n cntss += temp // 2\\n\\n temp = 1\\n\\n now = ss[i]\\n\\ncntss += temp // 2\\n\\n\\n\\nkousa = cntss - cnts\\n\\nprint((cnts + kousa*(k-1)))',\n", + " 'code_v0_loc': 35,\n", + " 'code_v1_loc': 35,\n", + " 'code_v0_num_chars': 527,\n", + " 'code_v1_num_chars': 551,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\nk = int(eval(input()))\\nif len(set(s)) == 1:\\n print(((len(s) * k) // 2))\\n exit()\\nss = s + s\\nshoko = 0\\nprev = \"\"\\ncnt = 0\\nfor i in range(len(s)):\\n if s[i] == prev:\\n cnt += 1\\n else:\\n shoko += cnt // 2\\n cnt = 1\\n prev = s[i]\\nshoko += cnt // 2\\nkosa = 0\\nprev = \"\"\\ncnt = 0\\nfor i in range(len(ss)):\\n if ss[i] == prev:\\n cnt += 1\\n else:\\n kosa += cnt // 2\\n cnt = 1\\n prev = ss[i]\\nkosa += cnt // 2\\nkosa -= shoko\\nprint((shoko + (k - 1) * kosa))\\n',\n", + " 'code_v1_no_empty_lines': 's = eval(input())\\nk = int(eval(input()))\\nn = len(s)\\nif len(set(s)) == 1:\\n print((n * k // 2))\\n exit()\\nss = s + s\\ncnts = 0\\nnow = s[0]\\ntemp = 1\\nfor i in range(1, n):\\n if s[i] == now:\\n temp += 1\\n else:\\n cnts += temp // 2\\n temp = 1\\n now = s[i]\\ncnts += temp // 2\\ncntss = 0\\nnow = ss[0]\\ntemp = 1\\nfor i in range(1, 2 * n):\\n if ss[i] == now:\\n temp += 1\\n else:\\n cntss += temp // 2\\n temp = 1\\n now = ss[i]\\ncntss += temp // 2\\nkousa = cntss - cnts\\nprint((cnts + kousa * (k - 1)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['+n = len(s)',\n", + " '- print(((len(s) * k) // 2))',\n", + " '+ print((n * k // 2))',\n", + " '-shoko = 0',\n", + " '-prev = \"\"',\n", + " '-cnt = 0',\n", + " '-for i in range(len(s)):',\n", + " '- if s[i] == prev:',\n", + " '- cnt += 1',\n", + " '+cnts = 0',\n", + " '+now = s[0]',\n", + " '+temp = 1',\n", + " '+for i in range(1, n):',\n", + " '+ if s[i] == now:',\n", + " '+ temp += 1',\n", + " '- shoko += cnt // 2',\n", + " '- cnt = 1',\n", + " '- prev = s[i]',\n", + " '-shoko += cnt // 2',\n", + " '-kosa = 0',\n", + " '-prev = \"\"',\n", + " '-cnt = 0',\n", + " '-for i in range(len(ss)):',\n", + " '- if ss[i] == prev:',\n", + " '- cnt += 1',\n", + " '+ cnts += temp // 2',\n", + " '+ temp = 1',\n", + " '+ now = s[i]',\n", + " '+cnts += temp // 2',\n", + " '+cntss = 0',\n", + " '+now = ss[0]',\n", + " '+temp = 1',\n", + " '+for i in range(1, 2 * n):',\n", + " '+ if ss[i] == now:',\n", + " '+ temp += 1',\n", + " '- kosa += cnt // 2',\n", + " '- cnt = 1',\n", + " '- prev = ss[i]',\n", + " '-kosa += cnt // 2',\n", + " '-kosa -= shoko',\n", + " '-print((shoko + (k - 1) * kosa))',\n", + " '+ cntss += temp // 2',\n", + " '+ temp = 1',\n", + " '+ now = ss[i]',\n", + " '+cntss += temp // 2',\n", + " '+kousa = cntss - cnts',\n", + " '+print((cnts + kousa * (k - 1)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2980948234,\n", + " 'measured_runtime_v1': 0.2282131991,\n", + " 'runtime_lift': 1.3062120179,\n", + " 'key': ['s480399361', 's640908939']},\n", + " {'user_id': 'u678167152',\n", + " 'problem_id': 'p02899',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's907108803',\n", + " 'submission_id_v1': 's636537863',\n", + " 'cpu_time_v0': 642,\n", + " 'cpu_time_v1': 86,\n", + " 'memory_v0': 23368,\n", + " 'memory_v1': 20468,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.6,\n", + " 'input': \"import numpy\\n\\nN = int(input())\\n\\nA = list(map(int, input().split()))\\n\\ninds = numpy.argsort(A)\\n\\ninds+=1\\n\\nfor ind in inds:\\n\\n print(ind, end=' ')\\n\",\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nans = [0]*N\\n\\nfor i,a in enumerate(A):\\n\\n ans[a-1] = i+1\\n\\nprint((*ans))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 142,\n", + " 'code_v1_num_chars': 123,\n", + " 'code_v0_no_empty_lines': 'import numpy\\n\\nN = int(input())\\nA = list(map(int, input().split()))\\ninds = numpy.argsort(A)\\ninds += 1\\nfor ind in inds:\\n print(ind, end=\" \")\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nans = [0] * N\\nfor i, a in enumerate(A):\\n ans[a - 1] = i + 1\\nprint((*ans))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-import numpy',\n", + " '-',\n", + " '-N = int(input())',\n", + " '+N = int(eval(input()))',\n", + " '-inds = numpy.argsort(A)',\n", + " '-inds += 1',\n", + " '-for ind in inds:',\n", + " '- print(ind, end=\" \")',\n", + " '+ans = [0] * N',\n", + " '+for i, a in enumerate(A):',\n", + " '+ ans[a - 1] = i + 1',\n", + " '+print((*ans))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.787777245,\n", + " 'measured_runtime_v1': 0.2704045452,\n", + " 'runtime_lift': 6.6114911046,\n", + " 'key': ['s907108803', 's636537863']},\n", + " {'user_id': 'u310381103',\n", + " 'problem_id': 'p03457',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's861400279',\n", + " 'submission_id_v1': 's171825130',\n", + " 'cpu_time_v0': 647,\n", + " 'cpu_time_v1': 294,\n", + " 'memory_v0': 63064,\n", + " 'memory_v1': 27216,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.56,\n", + " 'input': \"N=eval(input())\\n\\na=[]\\n\\nt=True\\n\\nfor _ in range(int(N)):\\n\\n a+=[list(map(int,input().split()))]\\n\\nfor i in range(int(N)):\\n\\n if a[i][0]%2==0:\\n\\n if abs(a[i][1]+a[i][2])<=a[i][0] and (a[i][1]+a[i][2])%2==0:\\n\\n continue\\n\\n else:\\n\\n print('No')\\n\\n t=False\\n\\n break\\n\\n else:\\n\\n if abs(a[i][1]+a[i][2]<=a[i][0]) and (a[i][1]+a[i][2])%2==1:\\n\\n continue\\n\\n else:\\n\\n print('No')\\n\\n t=False\\n\\n break\\n\\nif t:\\n\\n print('Yes')\",\n", + " 'target': \"import sys\\n\\nn=int(eval(input()))\\n\\nt=[]\\n\\nfor i in range(n):\\n\\n t.append(list(map(int,input().split())))\\n\\nfor i,d in enumerate(t):\\n\\n if i>0:\\n\\n b=d[0]-a\\n\\n c=abs(d[1]+d[2]-aa)\\n\\n a=d[0]\\n\\n aa=d[1]+d[2]\\n\\n if i==0:\\n\\n if not (a >= aa and a % 2 == aa % 2):\\n\\n print('No')\\n\\n sys.exit()\\n\\n else:\\n\\n continue\\n\\n if not (b>=c and b%2==c%2):\\n\\n print('No')\\n\\n sys.exit()\\n\\nprint('Yes')\",\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 516,\n", + " 'code_v1_num_chars': 449,\n", + " 'code_v0_no_empty_lines': 'N = eval(input())\\na = []\\nt = True\\nfor _ in range(int(N)):\\n a += [list(map(int, input().split()))]\\nfor i in range(int(N)):\\n if a[i][0] % 2 == 0:\\n if abs(a[i][1] + a[i][2]) <= a[i][0] and (a[i][1] + a[i][2]) % 2 == 0:\\n continue\\n else:\\n print(\"No\")\\n t = False\\n break\\n else:\\n if abs(a[i][1] + a[i][2] <= a[i][0]) and (a[i][1] + a[i][2]) % 2 == 1:\\n continue\\n else:\\n print(\"No\")\\n t = False\\n break\\nif t:\\n print(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nn = int(eval(input()))\\nt = []\\nfor i in range(n):\\n t.append(list(map(int, input().split())))\\nfor i, d in enumerate(t):\\n if i > 0:\\n b = d[0] - a\\n c = abs(d[1] + d[2] - aa)\\n a = d[0]\\n aa = d[1] + d[2]\\n if i == 0:\\n if not (a >= aa and a % 2 == aa % 2):\\n print(\"No\")\\n sys.exit()\\n else:\\n continue\\n if not (b >= c and b % 2 == c % 2):\\n print(\"No\")\\n sys.exit()\\nprint(\"Yes\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['-N = eval(input())',\n", + " '-a = []',\n", + " '-t = True',\n", + " '-for _ in range(int(N)):',\n", + " '- a += [list(map(int, input().split()))]',\n", + " '-for i in range(int(N)):',\n", + " '- if a[i][0] % 2 == 0:',\n", + " '- if abs(a[i][1] + a[i][2]) <= a[i][0] and (a[i][1] + a[i][2]) % 2 == 0:',\n", + " '+import sys',\n", + " '+',\n", + " '+n = int(eval(input()))',\n", + " '+t = []',\n", + " '+for i in range(n):',\n", + " '+ t.append(list(map(int, input().split())))',\n", + " '+for i, d in enumerate(t):',\n", + " '+ if i > 0:',\n", + " '+ b = d[0] - a',\n", + " '+ c = abs(d[1] + d[2] - aa)',\n", + " '+ a = d[0]',\n", + " '+ aa = d[1] + d[2]',\n", + " '+ if i == 0:',\n", + " '+ if not (a >= aa and a % 2 == aa % 2):',\n", + " '+ print(\"No\")',\n", + " '+ sys.exit()',\n", + " '+ else:',\n", + " '- else:',\n", + " '- print(\"No\")',\n", + " '- t = False',\n", + " '- break',\n", + " '- else:',\n", + " '- if abs(a[i][1] + a[i][2] <= a[i][0]) and (a[i][1] + a[i][2]) % 2 == 1:',\n", + " '- continue',\n", + " '- else:',\n", + " '- print(\"No\")',\n", + " '- t = False',\n", + " '- break',\n", + " '-if t:',\n", + " '- print(\"Yes\")',\n", + " '+ if not (b >= c and b % 2 == c % 2):',\n", + " '+ print(\"No\")',\n", + " '+ sys.exit()',\n", + " '+print(\"Yes\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2371032157,\n", + " 'measured_runtime_v1': 0.0063223619,\n", + " 'runtime_lift': 37.5023159605,\n", + " 'key': ['s861400279', 's171825130']},\n", + " {'user_id': 'u440566786',\n", + " 'problem_id': 'p02863',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's564882715',\n", + " 'submission_id_v1': 's252011051',\n", + " 'cpu_time_v0': 496,\n", + " 'cpu_time_v1': 355,\n", + " 'memory_v0': 47580,\n", + " 'memory_v1': 43228,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.43,\n", + " 'input': 'import sys\\n\\nsys.setrecursionlimit(2147483647)\\n\\nINF=float(\"inf\")\\n\\nMOD=10**9+7\\n\\ninput=lambda :sys.stdin.readline().rstrip()\\n\\ndef resolve():\\n\\n n,T=list(map(int,input().split()))\\n\\n AB=[tuple(map(int,input().split())) for _ in range(n)]\\n\\n ans=-INF\\n\\n\\n\\n # 何も考えずやる\\n\\n dp=[0]*T\\n\\n for i in range(n):\\n\\n a,b=AB[i]\\n\\n ndp=dp[:]\\n\\n for t in range(T):\\n\\n if(t+aL:\\n\\n mini=L\\n\\n now=i+1\\n\\n print(now)',\n", + " 'target': 'N,M=list(map(int, input().split()))\\n\\nS=[]\\n\\nfor i in range(N):\\n\\n a,b=list(map(int, input().split()))\\n\\n S.append((a,b))\\n\\n\\n\\nC=[]\\n\\nfor i in range(M):\\n\\n c,d=list(map(int, input().split()))\\n\\n C.append((c,d,i+1))\\n\\n#print(C)\\n\\nfor s in S:\\n\\n a,b=s\\n\\n now=0\\n\\n dis=10**9\\n\\n\\n\\n for t in C:\\n\\n c,d,n=t\\n\\n D=abs(c-a)+abs(d-b)\\n\\n \\n\\n if D L:\\n mini = L\\n now = i + 1\\n print(now)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nS = []\\nfor i in range(N):\\n a, b = list(map(int, input().split()))\\n S.append((a, b))\\nC = []\\nfor i in range(M):\\n c, d = list(map(int, input().split()))\\n C.append((c, d, i + 1))\\n# print(C)\\nfor s in S:\\n a, b = s\\n now = 0\\n dis = 10**9\\n for t in C:\\n c, d, n = t\\n D = abs(c - a) + abs(d - b)\\n if D < dis:\\n dis = D\\n now = n\\n print(now)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-human = []',\n", + " '+S = []',\n", + " '- human.append((a, b))',\n", + " '+ S.append((a, b))',\n", + " '- C.append((c, d))',\n", + " '-for h in human:',\n", + " '- a, b = h',\n", + " '+ C.append((c, d, i + 1))',\n", + " '+# print(C)',\n", + " '+for s in S:',\n", + " '+ a, b = s',\n", + " '- mini = np.inf',\n", + " '- for i, ch in enumerate(C):',\n", + " '- c, d = ch',\n", + " '- L = abs(a - c) + abs(b - d)',\n", + " '- if mini > L:',\n", + " '- mini = L',\n", + " '- now = i + 1',\n", + " '+ dis = 10**9',\n", + " '+ for t in C:',\n", + " '+ c, d, n = t',\n", + " '+ D = abs(c - a) + abs(d - b)',\n", + " '+ if D < dis:',\n", + " '+ dis = D',\n", + " '+ now = n'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7596903191,\n", + " 'measured_runtime_v1': 0.2910071514,\n", + " 'runtime_lift': 6.0468971664,\n", + " 'key': ['s225721289', 's121271513']},\n", + " {'user_id': 'u599114793',\n", + " 'problem_id': 'p03721',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's168629717',\n", + " 'submission_id_v1': 's331365181',\n", + " 'cpu_time_v0': 827,\n", + " 'cpu_time_v1': 370,\n", + " 'memory_v0': 54036,\n", + " 'memory_v1': 83348,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.26,\n", + " 'input': 'n,k = list(map(int,input().split()))\\n\\nnum = 0\\n\\nq = []\\n\\nfor i in range(n):\\n\\n a,b = list(map(int,input().split()))\\n\\n q.append((a,b))\\n\\nq.sort()\\n\\nfor i in range(n):\\n\\n a, b = q[i][0], q[i][1]\\n\\n num += b\\n\\n if num >= k:\\n\\n print(a)\\n\\n exit()\\n\\n\\n',\n", + " 'target': 'n,k = list(map(int,input().split()))\\n\\ncnt = 0\\n\\nnum = []\\n\\nfor i in range(n):\\n\\n a,b = list(map(int,input().split()))\\n\\n num.append((a,b))\\n\\nnum.sort()\\n\\nfor i in range(n):\\n\\n cnt += num[i][1]\\n\\n if cnt >= k:\\n\\n print((num[i][0]))\\n\\n exit()',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 252,\n", + " 'code_v1_num_chars': 242,\n", + " 'code_v0_no_empty_lines': 'n, k = list(map(int, input().split()))\\nnum = 0\\nq = []\\nfor i in range(n):\\n a, b = list(map(int, input().split()))\\n q.append((a, b))\\nq.sort()\\nfor i in range(n):\\n a, b = q[i][0], q[i][1]\\n num += b\\n if num >= k:\\n print(a)\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'n, k = list(map(int, input().split()))\\ncnt = 0\\nnum = []\\nfor i in range(n):\\n a, b = list(map(int, input().split()))\\n num.append((a, b))\\nnum.sort()\\nfor i in range(n):\\n cnt += num[i][1]\\n if cnt >= k:\\n print((num[i][0]))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-num = 0',\n", + " '-q = []',\n", + " '+cnt = 0',\n", + " '+num = []',\n", + " '- q.append((a, b))',\n", + " '-q.sort()',\n", + " '+ num.append((a, b))',\n", + " '+num.sort()',\n", + " '- a, b = q[i][0], q[i][1]',\n", + " '- num += b',\n", + " '- if num >= k:',\n", + " '- print(a)',\n", + " '+ cnt += num[i][1]',\n", + " '+ if cnt >= k:',\n", + " '+ print((num[i][0]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3024329725,\n", + " 'measured_runtime_v1': 0.2289340452,\n", + " 'runtime_lift': 1.3210484801,\n", + " 'key': ['s168629717', 's331365181']},\n", + " {'user_id': 'u396211450',\n", + " 'problem_id': 'p03828',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's749493108',\n", + " 'submission_id_v1': 's831049300',\n", + " 'cpu_time_v0': 39,\n", + " 'cpu_time_v1': 31,\n", + " 'memory_v0': 9360,\n", + " 'memory_v1': 9168,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.51,\n", + " 'input': 'from math import factorial\\n\\n\\n\\nn = int(eval(input()))\\n\\nf = factorial(n)\\n\\n\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\ndef primes(n):\\n\\n is_prime = [True] * (n + 1)\\n\\n is_prime[0] = False\\n\\n is_prime[1] = False\\n\\n for i in range(2, int(n ** 0.5) + 1):\\n\\n if not is_prime[i]:\\n\\n continue\\n\\n for j in range(i * 2, n + 1, i):\\n\\n is_prime[j] = False\\n\\n return [i for i in range(n + 1) if is_prime[i]]\\n\\n\\n\\nans = 1\\n\\nfor p in primes(n):\\n\\n temp = 1\\n\\n while f % p == 0:\\n\\n temp += 1\\n\\n f //= p\\n\\n ans = (ans * temp) % mod\\n\\nprint(ans)\\n',\n", + " 'target': 'n=int(eval(input()))\\n\\nm=10**9+7\\n\\np=[1 for i in range(10000)]\\n\\np[0]=0\\n\\np[1]=0\\n\\nfor i in range(2,n+1):\\n\\n if p[i]==1:\\n\\n for j in range(i*i,n+1,i):\\n\\n p[j]=0\\n\\nans=1\\n\\nfor i in range(2,n+1):\\n\\n if p[i]:\\n\\n c=0\\n\\n k=i\\n\\n while n//k>0:\\n\\n c=c+(n//k)%m\\n\\n k=k*i\\n\\n ans=(ans*((c+1)%m))%m\\n\\nprint((ans%m))\\n\\n \\n\\n \\n\\n \\n\\n \\n',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 556,\n", + " 'code_v1_num_chars': 340,\n", + " 'code_v0_no_empty_lines': 'from math import factorial\\n\\nn = int(eval(input()))\\nf = factorial(n)\\nmod = 10**9 + 7\\n\\n\\ndef primes(n):\\n is_prime = [True] * (n + 1)\\n is_prime[0] = False\\n is_prime[1] = False\\n for i in range(2, int(n**0.5) + 1):\\n if not is_prime[i]:\\n continue\\n for j in range(i * 2, n + 1, i):\\n is_prime[j] = False\\n return [i for i in range(n + 1) if is_prime[i]]\\n\\n\\nans = 1\\nfor p in primes(n):\\n temp = 1\\n while f % p == 0:\\n temp += 1\\n f //= p\\n ans = (ans * temp) % mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nm = 10**9 + 7\\np = [1 for i in range(10000)]\\np[0] = 0\\np[1] = 0\\nfor i in range(2, n + 1):\\n if p[i] == 1:\\n for j in range(i * i, n + 1, i):\\n p[j] = 0\\nans = 1\\nfor i in range(2, n + 1):\\n if p[i]:\\n c = 0\\n k = i\\n while n // k > 0:\\n c = c + (n // k) % m\\n k = k * i\\n ans = (ans * ((c + 1) % m)) % m\\nprint((ans % m))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.5384615385,\n", + " 'diff': ['-from math import factorial',\n", + " '-',\n", + " '-f = factorial(n)',\n", + " '-mod = 10**9 + 7',\n", + " '-',\n", + " '-',\n", + " '-def primes(n):',\n", + " '- is_prime = [True] * (n + 1)',\n", + " '- is_prime[0] = False',\n", + " '- is_prime[1] = False',\n", + " '- for i in range(2, int(n**0.5) + 1):',\n", + " '- if not is_prime[i]:',\n", + " '- continue',\n", + " '- for j in range(i * 2, n + 1, i):',\n", + " '- is_prime[j] = False',\n", + " '- return [i for i in range(n + 1) if is_prime[i]]',\n", + " '-',\n", + " '-',\n", + " '+m = 10**9 + 7',\n", + " '+p = [1 for i in range(10000)]',\n", + " '+p[0] = 0',\n", + " '+p[1] = 0',\n", + " '+for i in range(2, n + 1):',\n", + " '+ if p[i] == 1:',\n", + " '+ for j in range(i * i, n + 1, i):',\n", + " '+ p[j] = 0',\n", + " '-for p in primes(n):',\n", + " '- temp = 1',\n", + " '- while f % p == 0:',\n", + " '- temp += 1',\n", + " '- f //= p',\n", + " '- ans = (ans * temp) % mod',\n", + " '-print(ans)',\n", + " '+for i in range(2, n + 1):',\n", + " '+ if p[i]:',\n", + " '+ c = 0',\n", + " '+ k = i',\n", + " '+ while n // k > 0:',\n", + " '+ c = c + (n // k) % m',\n", + " '+ k = k * i',\n", + " '+ ans = (ans * ((c + 1) % m)) % m',\n", + " '+print((ans % m))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2370509479,\n", + " 'measured_runtime_v1': 0.0064624088,\n", + " 'runtime_lift': 36.6815154487,\n", + " 'key': ['s749493108', 's831049300']},\n", + " {'user_id': 'u821588465',\n", + " 'problem_id': 'p03000',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's259788442',\n", + " 'submission_id_v1': 's163625054',\n", + " 'cpu_time_v0': 29,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 9172,\n", + " 'memory_v1': 8984,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.79,\n", + " 'input': 'from itertools import accumulate\\n\\nfrom bisect import *\\n\\nN, X = list(map(int, input().split()))\\n\\nL = list(tuple(map(int, input().split())))\\n\\n\\n\\nacc = sorted(list(accumulate(L)) + [0])\\n\\n\\n\\nn = bisect_right(acc,X)\\n\\nprint(n)\\n\\n\\n',\n", + " 'target': 'N,X = list(map(int,input().split()))\\n\\nL = list(map(int,input().split()))\\n\\nList = [0]*(N+1)\\n\\nfor i in range(1,N+1):\\n\\n List[i] = List[i-1] + L[i-1]\\n\\nA = [i for i in List if i <=X]\\n\\nprint((len(A)))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 215,\n", + " 'code_v1_num_chars': 189,\n", + " 'code_v0_no_empty_lines': 'from itertools import accumulate\\nfrom bisect import *\\n\\nN, X = list(map(int, input().split()))\\nL = list(tuple(map(int, input().split())))\\nacc = sorted(list(accumulate(L)) + [0])\\nn = bisect_right(acc, X)\\nprint(n)\\n',\n", + " 'code_v1_no_empty_lines': 'N, X = list(map(int, input().split()))\\nL = list(map(int, input().split()))\\nList = [0] * (N + 1)\\nfor i in range(1, N + 1):\\n List[i] = List[i - 1] + L[i - 1]\\nA = [i for i in List if i <= X]\\nprint((len(A)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.0,\n", + " 'diff': ['-from itertools import accumulate',\n", + " '-from bisect import *',\n", + " '-',\n", + " '-L = list(tuple(map(int, input().split())))',\n", + " '-acc = sorted(list(accumulate(L)) + [0])',\n", + " '-n = bisect_right(acc, X)',\n", + " '-print(n)',\n", + " '+L = list(map(int, input().split()))',\n", + " '+List = [0] * (N + 1)',\n", + " '+for i in range(1, N + 1):',\n", + " '+ List[i] = List[i - 1] + L[i - 1]',\n", + " '+A = [i for i in List if i <= X]',\n", + " '+print((len(A)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2199657279,\n", + " 'measured_runtime_v1': 0.1756561113,\n", + " 'runtime_lift': 1.2522520635,\n", + " 'key': ['s259788442', 's163625054']},\n", + " {'user_id': 'u498487134',\n", + " 'problem_id': 'p02917',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's303870321',\n", + " 'submission_id_v1': 's766724876',\n", + " 'cpu_time_v0': 162,\n", + " 'cpu_time_v1': 67,\n", + " 'memory_v0': 38256,\n", + " 'memory_v1': 61812,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 58.64,\n", + " 'input': 'N = int(eval(input()))\\n\\nB =list(map(int,input().split()))\\n\\nA=[0]*N\\n\\n\\n\\nA[0]=B[0]\\n\\nfor i in range(1,N-1):\\n\\n A[i]=min(B[i],B[i-1])\\n\\nA[-1]=B[-1]\\n\\nprint((sum(A)))',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef I(): return int(eval(input()))\\n\\ndef MI(): return list(map(int, input().split()))\\n\\ndef LI(): return list(map(int, input().split()))\\n\\n\\n\\ndef main():\\n\\n mod=10**9+7\\n\\n N=I()\\n\\n B=LI()\\n\\n A=[0]*N\\n\\n A[0]=B[0]\\n\\n A[-1]=B[-1]\\n\\n for i in range(N-2):\\n\\n A[i+1]=min(B[i],B[i+1])\\n\\n \\n\\n print((sum(A)))\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 152,\n", + " 'code_v1_num_chars': 363,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nB = list(map(int, input().split()))\\nA = [0] * N\\nA[0] = B[0]\\nfor i in range(1, N - 1):\\n A[i] = min(B[i], B[i - 1])\\nA[-1] = B[-1]\\nprint((sum(A)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef I():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\ndef main():\\n mod = 10**9 + 7\\n N = I()\\n B = LI()\\n A = [0] * N\\n A[0] = B[0]\\n A[-1] = B[-1]\\n for i in range(N - 2):\\n A[i + 1] = min(B[i], B[i + 1])\\n print((sum(A)))\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.0,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-B = list(map(int, input().split()))',\n", + " '-A = [0] * N',\n", + " '-A[0] = B[0]',\n", + " '-for i in range(1, N - 1):',\n", + " '- A[i] = min(B[i], B[i - 1])',\n", + " '-A[-1] = B[-1]',\n", + " '-print((sum(A)))',\n", + " '+import sys',\n", + " '+',\n", + " '+input = sys.stdin.readline',\n", + " '+',\n", + " '+',\n", + " '+def I():',\n", + " '+ return int(eval(input()))',\n", + " '+',\n", + " '+',\n", + " '+def MI():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+def LI():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ mod = 10**9 + 7',\n", + " '+ N = I()',\n", + " '+ B = LI()',\n", + " '+ A = [0] * N',\n", + " '+ A[0] = B[0]',\n", + " '+ A[-1] = B[-1]',\n", + " '+ for i in range(N - 2):',\n", + " '+ A[i + 1] = min(B[i], B[i + 1])',\n", + " '+ print((sum(A)))',\n", + " '+',\n", + " '+',\n", + " '+main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.251366816,\n", + " 'measured_runtime_v1': 0.147175539,\n", + " 'runtime_lift': 1.7079388172,\n", + " 'key': ['s303870321', 's766724876']},\n", + " {'user_id': 'u854690176',\n", + " 'problem_id': 'p02952',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's720457111',\n", + " 'submission_id_v1': 's185706611',\n", + " 'cpu_time_v0': 60,\n", + " 'cpu_time_v1': 51,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 6732,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': 'N = int(eval(input()))\\n\\nans = 0\\n\\nfor i in range(1, N + 1):\\n\\n if len(str(i)) % 2 == 1:\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\nprint((len(list([x for x in range(1, N + 1) if len(str(x)) % 2 == 1]))))',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 2,\n", + " 'code_v0_num_chars': 112,\n", + " 'code_v1_num_chars': 91,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nans = 0\\nfor i in range(1, N + 1):\\n if len(str(i)) % 2 == 1:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nprint((len(list([x for x in range(1, N + 1) if len(str(x)) % 2 == 1]))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 66.6666666667,\n", + " 'diff': ['-ans = 0',\n", + " '-for i in range(1, N + 1):',\n", + " '- if len(str(i)) % 2 == 1:',\n", + " '- ans += 1',\n", + " '-print(ans)',\n", + " '+print((len(list([x for x in range(1, N + 1) if len(str(x)) % 2 == 1]))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1607959216,\n", + " 'measured_runtime_v1': 0.006350698,\n", + " 'runtime_lift': 25.3194092141,\n", + " 'key': ['s720457111', 's185706611']},\n", + " {'user_id': 'u312025627',\n", + " 'problem_id': 'p02901',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's827366183',\n", + " 'submission_id_v1': 's086626630',\n", + " 'cpu_time_v0': 364,\n", + " 'cpu_time_v1': 311,\n", + " 'memory_v0': 78552,\n", + " 'memory_v1': 75116,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.56,\n", + " 'input': 'INF = 2*10**7\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, M = (int(i) for i in input().split())\\n\\n A = []\\n\\n B = []\\n\\n C = []\\n\\n for _ in range(M):\\n\\n a, b = (int(i) for i in input().split())\\n\\n A.append(a)\\n\\n B.append(b)\\n\\n bit = 0\\n\\n for i in input().split():\\n\\n bit |= (1 << (int(i)-1))\\n\\n C.append(bit)\\n\\n dp = [[INF]*(1 << N) for _ in range(M+1)]\\n\\n dp[0][0] = 0\\n\\n for i in range(M):\\n\\n for j in range(1 << N):\\n\\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\\n\\n if dp[i][j] != INF:\\n\\n next_bit = j | C[i]\\n\\n dp[i+1][next_bit] = min(dp[i+1][next_bit], dp[i][j] + A[i])\\n\\n ans = dp[-1][-1]\\n\\n if ans == INF:\\n\\n print((-1))\\n\\n else:\\n\\n print(ans)\\n\\n # print(*dp, sep=\"\\\\n\")\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': 'INF = 2*10**7\\n\\n\\n\\n\\n\\ndef main():\\n\\n import sys\\n\\n input = sys.stdin.buffer.readline\\n\\n N, M = (int(i) for i in input().split())\\n\\n A = []\\n\\n B = []\\n\\n C = []\\n\\n for _ in range(M):\\n\\n a, b = (int(i) for i in input().split())\\n\\n A.append(a)\\n\\n B.append(b)\\n\\n bit = 0\\n\\n for i in input().split():\\n\\n bit |= (1 << (int(i)-1))\\n\\n C.append(bit)\\n\\n dp = [[INF]*(1 << N) for _ in range(M+1)]\\n\\n dp[0][0] = 0\\n\\n for i in range(M):\\n\\n for j in range(1 << N):\\n\\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\\n\\n if dp[i][j] != INF:\\n\\n next_bit = j | C[i]\\n\\n dp[i+1][next_bit] = min(dp[i+1][next_bit], dp[i][j] + A[i])\\n\\n ans = dp[-1][-1]\\n\\n if ans == INF:\\n\\n print((-1))\\n\\n else:\\n\\n print(ans)\\n\\n # print(*dp, sep=\"\\\\n\")\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'code_v0_loc': 34,\n", + " 'code_v1_loc': 36,\n", + " 'code_v0_num_chars': 827,\n", + " 'code_v1_num_chars': 882,\n", + " 'code_v0_no_empty_lines': 'INF = 2 * 10**7\\n\\n\\ndef main():\\n N, M = (int(i) for i in input().split())\\n A = []\\n B = []\\n C = []\\n for _ in range(M):\\n a, b = (int(i) for i in input().split())\\n A.append(a)\\n B.append(b)\\n bit = 0\\n for i in input().split():\\n bit |= 1 << (int(i) - 1)\\n C.append(bit)\\n dp = [[INF] * (1 << N) for _ in range(M + 1)]\\n dp[0][0] = 0\\n for i in range(M):\\n for j in range(1 << N):\\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\\n if dp[i][j] != INF:\\n next_bit = j | C[i]\\n dp[i + 1][next_bit] = min(dp[i + 1][next_bit], dp[i][j] + A[i])\\n ans = dp[-1][-1]\\n if ans == INF:\\n print((-1))\\n else:\\n print(ans)\\n # print(*dp, sep=\"\\\\n\")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'INF = 2 * 10**7\\n\\n\\ndef main():\\n import sys\\n\\n input = sys.stdin.buffer.readline\\n N, M = (int(i) for i in input().split())\\n A = []\\n B = []\\n C = []\\n for _ in range(M):\\n a, b = (int(i) for i in input().split())\\n A.append(a)\\n B.append(b)\\n bit = 0\\n for i in input().split():\\n bit |= 1 << (int(i) - 1)\\n C.append(bit)\\n dp = [[INF] * (1 << N) for _ in range(M + 1)]\\n dp[0][0] = 0\\n for i in range(M):\\n for j in range(1 << N):\\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\\n if dp[i][j] != INF:\\n next_bit = j | C[i]\\n dp[i + 1][next_bit] = min(dp[i + 1][next_bit], dp[i][j] + A[i])\\n ans = dp[-1][-1]\\n if ans == INF:\\n print((-1))\\n else:\\n print(ans)\\n # print(*dp, sep=\"\\\\n\")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.5555555556,\n", + " 'diff': ['+ import sys', '+', '+ input = sys.stdin.buffer.readline'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4147989278,\n", + " 'measured_runtime_v1': 0.289175185,\n", + " 'runtime_lift': 1.4344208955,\n", + " 'key': ['s827366183', 's086626630']},\n", + " {'user_id': 'u118019047',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's640144582',\n", + " 'submission_id_v1': 's252292470',\n", + " 'cpu_time_v0': 78,\n", + " 'cpu_time_v1': 54,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 30.77,\n", + " 'input': 'a , b = input().split()\\n\\na = int(a)\\n\\nb = int(b)\\n\\ncount=0\\n\\nfor i in range(a,b+1):\\n\\n test = list(str(i))\\n\\n if (test[0] == test[4]) and (test[1]==test[3]):\\n\\n count=count+1\\n\\nprint(count)',\n", + " 'target': 'A,B=list(map(int,input().split()))\\n\\nct=0\\n\\nfor i in range(A,B+1):\\n\\n s=str(i)\\n\\n if s==s[::-1]:\\n\\n ct+=1\\n\\nprint(ct)',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 195,\n", + " 'code_v1_num_chars': 118,\n", + " 'code_v0_no_empty_lines': 'a, b = input().split()\\na = int(a)\\nb = int(b)\\ncount = 0\\nfor i in range(a, b + 1):\\n test = list(str(i))\\n if (test[0] == test[4]) and (test[1] == test[3]):\\n count = count + 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\nct = 0\\nfor i in range(A, B + 1):\\n s = str(i)\\n if s == s[::-1]:\\n ct += 1\\nprint(ct)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['-a, b = input().split()',\n", + " '-a = int(a)',\n", + " '-b = int(b)',\n", + " '-count = 0',\n", + " '-for i in range(a, b + 1):',\n", + " '- test = list(str(i))',\n", + " '- if (test[0] == test[4]) and (test[1] == test[3]):',\n", + " '- count = count + 1',\n", + " '-print(count)',\n", + " '+A, B = list(map(int, input().split()))',\n", + " '+ct = 0',\n", + " '+for i in range(A, B + 1):',\n", + " '+ s = str(i)',\n", + " '+ if s == s[::-1]:',\n", + " '+ ct += 1',\n", + " '+print(ct)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4764800201,\n", + " 'measured_runtime_v1': 0.3351052109,\n", + " 'runtime_lift': 1.4218818588,\n", + " 'key': ['s640144582', 's252292470']},\n", + " {'user_id': 'u228223940',\n", + " 'problem_id': 'p02647',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's621197357',\n", + " 'submission_id_v1': 's626568623',\n", + " 'cpu_time_v0': 912,\n", + " 'cpu_time_v1': 246,\n", + " 'memory_v0': 179240,\n", + " 'memory_v1': 155944,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.03,\n", + " 'input': 'import copy\\n\\nn,k = list(map(int,input().split()))\\n\\nai = [int(i) for i in input().split()]\\n\\n\\n\\nold_ai = ai\\n\\ncnt = 0\\n\\n\\n\\nwhile 1 == 1:\\n\\n old_ai = copy.deepcopy(ai)\\n\\n li = [0]*(n+1)\\n\\n for i in range(n):\\n\\n li[max(0,i-ai[i])] += 1\\n\\n li[min(n,i+1+ai[i])] -= 1\\n\\n #print(li)\\n\\n #print(li)\\n\\n tmp = 0\\n\\n for i in range(n):\\n\\n if i == 0:\\n\\n ai[i] = li[i]\\n\\n tmp += ai[i]\\n\\n else:\\n\\n ai[i] = li[i] + ai[i-1]\\n\\n tmp += ai[i]\\n\\n #print(rui)\\n\\n if ai == old_ai:\\n\\n print((*ai))\\n\\n exit()\\n\\n break\\n\\n cnt += 1\\n\\n if cnt == k:\\n\\n print((*ai))\\n\\n exit()\\n\\n old_ai = ai',\n", + " 'target': 'import copy\\n\\nn,k = list(map(int,input().split()))\\n\\nai = [int(i) for i in input().split()]\\n\\n\\n\\n#old_ai = ai\\n\\ncnt = 0\\n\\nold_tmp = sum(ai)\\n\\n\\n\\nwhile 1 == 1:\\n\\n #old_ai = copy.deepcopy(ai)\\n\\n li = [0]*(n+1)\\n\\n for i in range(n):\\n\\n li[max(0,i-ai[i])] += 1\\n\\n li[min(n,i+1+ai[i])] -= 1\\n\\n #print(li)\\n\\n #print(li)\\n\\n tmp = 0\\n\\n for i in range(n):\\n\\n if i == 0:\\n\\n ai[i] = li[i]\\n\\n tmp += ai[i]\\n\\n else:\\n\\n ai[i] = li[i] + ai[i-1]\\n\\n tmp += ai[i]\\n\\n #print(rui)\\n\\n if old_tmp == tmp:\\n\\n print((*ai))\\n\\n exit()\\n\\n break\\n\\n cnt += 1\\n\\n if cnt == k:\\n\\n print((*ai))\\n\\n exit()\\n\\n old_tmp = tmp',\n", + " 'code_v0_loc': 33,\n", + " 'code_v1_loc': 34,\n", + " 'code_v0_num_chars': 667,\n", + " 'code_v1_num_chars': 692,\n", + " 'code_v0_no_empty_lines': 'import copy\\n\\nn, k = list(map(int, input().split()))\\nai = [int(i) for i in input().split()]\\nold_ai = ai\\ncnt = 0\\nwhile 1 == 1:\\n old_ai = copy.deepcopy(ai)\\n li = [0] * (n + 1)\\n for i in range(n):\\n li[max(0, i - ai[i])] += 1\\n li[min(n, i + 1 + ai[i])] -= 1\\n # print(li)\\n # print(li)\\n tmp = 0\\n for i in range(n):\\n if i == 0:\\n ai[i] = li[i]\\n tmp += ai[i]\\n else:\\n ai[i] = li[i] + ai[i - 1]\\n tmp += ai[i]\\n # print(rui)\\n if ai == old_ai:\\n print((*ai))\\n exit()\\n break\\n cnt += 1\\n if cnt == k:\\n print((*ai))\\n exit()\\n old_ai = ai\\n',\n", + " 'code_v1_no_empty_lines': 'import copy\\n\\nn, k = list(map(int, input().split()))\\nai = [int(i) for i in input().split()]\\n# old_ai = ai\\ncnt = 0\\nold_tmp = sum(ai)\\nwhile 1 == 1:\\n # old_ai = copy.deepcopy(ai)\\n li = [0] * (n + 1)\\n for i in range(n):\\n li[max(0, i - ai[i])] += 1\\n li[min(n, i + 1 + ai[i])] -= 1\\n # print(li)\\n # print(li)\\n tmp = 0\\n for i in range(n):\\n if i == 0:\\n ai[i] = li[i]\\n tmp += ai[i]\\n else:\\n ai[i] = li[i] + ai[i - 1]\\n tmp += ai[i]\\n # print(rui)\\n if old_tmp == tmp:\\n print((*ai))\\n exit()\\n break\\n cnt += 1\\n if cnt == k:\\n print((*ai))\\n exit()\\n old_tmp = tmp\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.9411764706,\n", + " 'diff': ['-old_ai = ai',\n", + " '+# old_ai = ai',\n", + " '+old_tmp = sum(ai)',\n", + " '- old_ai = copy.deepcopy(ai)',\n", + " '+ # old_ai = copy.deepcopy(ai)',\n", + " '- if ai == old_ai:',\n", + " '+ if old_tmp == tmp:',\n", + " '- old_ai = ai',\n", + " '+ old_tmp = tmp'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2951365216,\n", + " 'measured_runtime_v1': 0.2292118037,\n", + " 'runtime_lift': 1.2876148472,\n", + " 'key': ['s621197357', 's626568623']},\n", + " {'user_id': 'u970308980',\n", + " 'problem_id': 'p03309',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's685396762',\n", + " 'submission_id_v1': 's566858224',\n", + " 'cpu_time_v0': 318,\n", + " 'cpu_time_v1': 239,\n", + " 'memory_v0': 101332,\n", + " 'memory_v1': 27244,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 24.84,\n", + " 'input': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n# 中央値\\n\\nB = []\\n\\nfor i in range(N):\\n\\n B.append(A[i] - (i+1))\\n\\nb = sorted(B)[N//2]\\n\\n\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n ans += abs(A[i] - (i + 1) - b)\\n\\n\\n\\nprint(ans)\\n\\n\\n',\n", + " 'target': 'from statistics import median_low\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\nD = []\\n\\nfor i in range(N):\\n\\n D.append(A[i] - (i+1))\\n\\n\\n\\nm = median_low(D)\\n\\nans = 0\\n\\nfor d in D:\\n\\n ans += abs(d - m)\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 221,\n", + " 'code_v1_num_chars': 229,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\n# 中央値\\nB = []\\nfor i in range(N):\\n B.append(A[i] - (i + 1))\\nb = sorted(B)[N // 2]\\nans = 0\\nfor i in range(N):\\n ans += abs(A[i] - (i + 1) - b)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from statistics import median_low\\n\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nD = []\\nfor i in range(N):\\n D.append(A[i] - (i + 1))\\nm = median_low(D)\\nans = 0\\nfor d in D:\\n ans += abs(d - m)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['+from statistics import median_low',\n", + " '+',\n", + " '-# 中央値',\n", + " '-B = []',\n", + " '+D = []',\n", + " '- B.append(A[i] - (i + 1))',\n", + " '-b = sorted(B)[N // 2]',\n", + " '+ D.append(A[i] - (i + 1))',\n", + " '+m = median_low(D)',\n", + " '-for i in range(N):',\n", + " '- ans += abs(A[i] - (i + 1) - b)',\n", + " '+for d in D:',\n", + " '+ ans += abs(d - m)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2779975181,\n", + " 'measured_runtime_v1': 0.211870023,\n", + " 'runtime_lift': 1.3121135029,\n", + " 'key': ['s685396762', 's566858224']},\n", + " {'user_id': 'u813098295',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's229566237',\n", + " 'submission_id_v1': 's072536815',\n", + " 'cpu_time_v0': 222,\n", + " 'cpu_time_v1': 129,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 41.89,\n", + " 'input': \"a, b, c, x, y = list(map(int, input().split()))\\n\\nans = float('inf')\\n\\n\\n\\nfor i in range(200005):\\n\\n tmp = i * 2 * c\\n\\n tmp += max(0, x-i) * a\\n\\n tmp += max(0, y-i) * b\\n\\n ans = min(ans, tmp)\\n\\n\\n\\nprint(ans)\",\n", + " 'target': \"a, b, c, x, y = list(map(int, input().split()))\\n\\nans = float('inf')\\n\\n\\n\\nfor i in range(100005):\\n\\n tmp = i * 2 * c\\n\\n tmp += max(0, x-i) * a\\n\\n tmp += max(0, y-i) * b\\n\\n ans = min(ans, tmp)\\n\\n\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 204,\n", + " 'code_v1_num_chars': 204,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in range(200005):\\n tmp = i * 2 * c\\n tmp += max(0, x - i) * a\\n tmp += max(0, y - i) * b\\n ans = min(ans, tmp)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in range(100005):\\n tmp = i * 2 * c\\n tmp += max(0, x - i) * a\\n tmp += max(0, y - i) * b\\n ans = min(ans, tmp)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for i in range(200005):', '+for i in range(100005):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0992211397,\n", + " 'measured_runtime_v1': 1.3130319312,\n", + " 'runtime_lift': 1.5987586363,\n", + " 'key': ['s229566237', 's072536815']},\n", + " {'user_id': 'u991567869',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's146225899',\n", + " 'submission_id_v1': 's204753661',\n", + " 'cpu_time_v0': 292,\n", + " 'cpu_time_v1': 175,\n", + " 'memory_v0': 9152,\n", + " 'memory_v1': 9164,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.07,\n", + " 'input': 'k = int(eval(input()))\\n\\nx = 1\\n\\n\\n\\nif k%7 != 0:\\n\\n mod = 9*k\\n\\nelse:\\n\\n mod = 9*k//7\\n\\n\\n\\nfor i in range(10**6):\\n\\n x = x*10%mod\\n\\n if x == 1:\\n\\n print((i + 1))\\n\\n exit()\\n\\n\\n\\nprint((-1))',\n", + " 'target': 'k = int(eval(input()))\\n\\na = 0\\n\\n\\n\\nfor i in range(k + 10):\\n\\n a = (a*10 + 7)%k\\n\\n if a == 0:\\n\\n print((i + 1))\\n\\n exit()\\n\\nprint((-1))',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 190,\n", + " 'code_v1_num_chars': 137,\n", + " 'code_v0_no_empty_lines': 'k = int(eval(input()))\\nx = 1\\nif k % 7 != 0:\\n mod = 9 * k\\nelse:\\n mod = 9 * k // 7\\nfor i in range(10**6):\\n x = x * 10 % mod\\n if x == 1:\\n print((i + 1))\\n exit()\\nprint((-1))\\n',\n", + " 'code_v1_no_empty_lines': 'k = int(eval(input()))\\na = 0\\nfor i in range(k + 10):\\n a = (a * 10 + 7) % k\\n if a == 0:\\n print((i + 1))\\n exit()\\nprint((-1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 40.0,\n", + " 'diff': ['-x = 1',\n", + " '-if k % 7 != 0:',\n", + " '- mod = 9 * k',\n", + " '-else:',\n", + " '- mod = 9 * k // 7',\n", + " '-for i in range(10**6):',\n", + " '- x = x * 10 % mod',\n", + " '- if x == 1:',\n", + " '+a = 0',\n", + " '+for i in range(k + 10):',\n", + " '+ a = (a * 10 + 7) % k',\n", + " '+ if a == 0:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5332653046,\n", + " 'measured_runtime_v1': 0.4200988929,\n", + " 'runtime_lift': 1.2693804091,\n", + " 'key': ['s146225899', 's204753661']},\n", + " {'user_id': 'u392029857',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's263636434',\n", + " 'submission_id_v1': 's255168613',\n", + " 'cpu_time_v0': 110,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.82,\n", + " 'input': \"A, B = list(map(int, input().split()))\\n\\nnumbers = list(range(A, B+1))\\n\\ncount = 0\\n\\nfor i in numbers:\\n\\n m = str(i)\\n\\n rm = ''.join(list(reversed(m)))\\n\\n if m == rm:\\n\\n count += 1\\n\\nprint(count)\",\n", + " 'target': 'A, B = list(map(int, input().split()))\\n\\nx = list(range(1,10))\\n\\ny = list(range(10))\\n\\ncount = 0\\n\\nfor p in x:\\n\\n for q in y:\\n\\n for r in y:\\n\\n sakasama = int(str(p)+str(q)+str(r)+str(q)+str(p))\\n\\n if A <= sakasama <= B:\\n\\n count += 1\\n\\nprint(count)',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 191,\n", + " 'code_v1_num_chars': 268,\n", + " 'code_v0_no_empty_lines': 'A, B = list(map(int, input().split()))\\nnumbers = list(range(A, B + 1))\\ncount = 0\\nfor i in numbers:\\n m = str(i)\\n rm = \"\".join(list(reversed(m)))\\n if m == rm:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\nx = list(range(1, 10))\\ny = list(range(10))\\ncount = 0\\nfor p in x:\\n for q in y:\\n for r in y:\\n sakasama = int(str(p) + str(q) + str(r) + str(q) + str(p))\\n if A <= sakasama <= B:\\n count += 1\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['-numbers = list(range(A, B + 1))',\n", + " '+x = list(range(1, 10))',\n", + " '+y = list(range(10))',\n", + " '-for i in numbers:',\n", + " '- m = str(i)',\n", + " '- rm = \"\".join(list(reversed(m)))',\n", + " '- if m == rm:',\n", + " '- count += 1',\n", + " '+for p in x:',\n", + " '+ for q in y:',\n", + " '+ for r in y:',\n", + " '+ sakasama = int(str(p) + str(q) + str(r) + str(q) + str(p))',\n", + " '+ if A <= sakasama <= B:',\n", + " '+ count += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3536295901,\n", + " 'measured_runtime_v1': 0.1996227459,\n", + " 'runtime_lift': 1.7714894587,\n", + " 'key': ['s263636434', 's255168613']},\n", + " {'user_id': 'u513081876',\n", + " 'problem_id': 'p03845',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's710663686',\n", + " 'submission_id_v1': 's021252857',\n", + " 'cpu_time_v0': 28,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.29,\n", + " 'input': 'N = int(eval(input()))\\n\\nT = list(map(int, input().split()))\\n\\nM = int(eval(input()))\\n\\np = []\\n\\nx = []\\n\\nans = []\\n\\nfor i in range(M):\\n\\n p, x = list(map(int, input().split()))\\n\\n ans.append(sum(T[:p-1])+x+sum(T[p:]))\\n\\n\\n\\nfor _ in ans:\\n\\n print(_)',\n", + " 'target': 'N = int(eval(input()))\\n\\nT = list(map(int, input().split()))\\n\\nM = int(eval(input()))\\n\\nP, X, ans = [0]*M, [0]*M, []\\n\\nbase = sum(T)\\n\\n\\n\\nfor i in range(M):\\n\\n P, X = list(map(int, input().split()))\\n\\n ans.append(base-T[P-1]+X)\\n\\n\\n\\nfor i in ans:\\n\\n print(i)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 229,\n", + " 'code_v1_num_chars': 238,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nT = list(map(int, input().split()))\\nM = int(eval(input()))\\np = []\\nx = []\\nans = []\\nfor i in range(M):\\n p, x = list(map(int, input().split()))\\n ans.append(sum(T[: p - 1]) + x + sum(T[p:]))\\nfor _ in ans:\\n print(_)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nT = list(map(int, input().split()))\\nM = int(eval(input()))\\nP, X, ans = [0] * M, [0] * M, []\\nbase = sum(T)\\nfor i in range(M):\\n P, X = list(map(int, input().split()))\\n ans.append(base - T[P - 1] + X)\\nfor i in ans:\\n print(i)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-p = []',\n", + " '-x = []',\n", + " '-ans = []',\n", + " '+P, X, ans = [0] * M, [0] * M, []',\n", + " '+base = sum(T)',\n", + " '- p, x = list(map(int, input().split()))',\n", + " '- ans.append(sum(T[: p - 1]) + x + sum(T[p:]))',\n", + " '-for _ in ans:',\n", + " '- print(_)',\n", + " '+ P, X = list(map(int, input().split()))',\n", + " '+ ans.append(base - T[P - 1] + X)',\n", + " '+for i in ans:',\n", + " '+ print(i)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2214040067,\n", + " 'measured_runtime_v1': 0.1726463588,\n", + " 'runtime_lift': 1.2824134157,\n", + " 'key': ['s710663686', 's021252857']},\n", + " {'user_id': 'u179169725',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's062412783',\n", + " 'submission_id_v1': 's752380372',\n", + " 'cpu_time_v0': 334,\n", + " 'cpu_time_v1': 193,\n", + " 'memory_v0': 19904,\n", + " 'memory_v1': 7668,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 42.22,\n", + " 'input': '# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n\\n# 典型的なDP\\n\\n\\n\\nMOD = 10**9 + 7\\n\\nimport numpy as np\\n\\n# dp[i]をi段目までの通りの数とする。\\n\\nN, M = list(map(int, input().split()))\\n\\nto_zero = np.full((N + 1), False).tolist()\\n\\nfor _ in range(M):\\n\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n\\n\\n\\n# dpテーブルの用意\\n\\ndp = np.full((N + 1), -1).tolist()\\n\\ndp[0] = 1\\n\\ndp[1] = 0 if to_zero[1] else 1\\n\\nfor i in range(2, N + 1):\\n\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n\\n if dp[i] > MOD:\\n\\n dp[i] %= MOD\\n\\n\\n\\nprint((dp[-1]))\\n',\n", + " 'target': '# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n\\n# 典型的なDP\\n\\n\\n\\n\\n\\ndef full(shape, full_value):\\n\\n if isinstance(shape, tuple):\\n\\n NotImplementedError()\\n\\n else:\\n\\n return [full_value] * shape\\n\\n\\n\\n\\n\\nMOD = 10**9 + 7\\n\\n# dp[i]をi段目までの通りの数とする。\\n\\nN, M = list(map(int, input().split()))\\n\\nto_zero = full((N + 1), False)\\n\\nfor _ in range(M):\\n\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n\\n\\n\\n# dpテーブルの用意\\n\\ndp = full((N + 1), -1)\\n\\ndp[0] = 1\\n\\ndp[1] = 0 if to_zero[1] else 1\\n\\nfor i in range(2, N + 1):\\n\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n\\n if dp[i] > MOD:\\n\\n dp[i] %= MOD\\n\\n\\n\\nprint((dp[-1]))\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 28,\n", + " 'code_v0_num_chars': 514,\n", + " 'code_v1_num_chars': 619,\n", + " 'code_v0_no_empty_lines': '# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n# 典型的なDP\\nMOD = 10**9 + 7\\nimport numpy as np\\n\\n# dp[i]をi段目までの通りの数とする。\\nN, M = list(map(int, input().split()))\\nto_zero = np.full((N + 1), False).tolist()\\nfor _ in range(M):\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n# dpテーブルの用意\\ndp = np.full((N + 1), -1).tolist()\\ndp[0] = 1\\ndp[1] = 0 if to_zero[1] else 1\\nfor i in range(2, N + 1):\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n if dp[i] > MOD:\\n dp[i] %= MOD\\nprint((dp[-1]))\\n',\n", + " 'code_v1_no_empty_lines': '# https://atcoder.jp/contests/abc129/tasks/abc129_c\\n# 典型的なDP\\ndef full(shape, full_value):\\n if isinstance(shape, tuple):\\n NotImplementedError()\\n else:\\n return [full_value] * shape\\n\\n\\nMOD = 10**9 + 7\\n# dp[i]をi段目までの通りの数とする。\\nN, M = list(map(int, input().split()))\\nto_zero = full((N + 1), False)\\nfor _ in range(M):\\n to_zero[int(eval(input()))] = True # 床が抜けているところ\\n# dpテーブルの用意\\ndp = full((N + 1), -1)\\ndp[0] = 1\\ndp[1] = 0 if to_zero[1] else 1\\nfor i in range(2, N + 1):\\n dp[i] = 0 if to_zero[i] else dp[i - 2] + dp[i - 1]\\n if dp[i] > MOD:\\n dp[i] %= MOD\\nprint((dp[-1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['+def full(shape, full_value):',\n", + " '+ if isinstance(shape, tuple):',\n", + " '+ NotImplementedError()',\n", + " '+ else:',\n", + " '+ return [full_value] * shape',\n", + " '+',\n", + " '+',\n", + " '-import numpy as np',\n", + " '-',\n", + " '-to_zero = np.full((N + 1), False).tolist()',\n", + " '+to_zero = full((N + 1), False)',\n", + " '-dp = np.full((N + 1), -1).tolist()',\n", + " '+dp = full((N + 1), -1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3572561545,\n", + " 'measured_runtime_v1': 0.1989456849,\n", + " 'runtime_lift': 6.8222447503,\n", + " 'key': ['s062412783', 's752380372']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p03200',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's238646365',\n", + " 'submission_id_v1': 's273593908',\n", + " 'cpu_time_v0': 247,\n", + " 'cpu_time_v1': 188,\n", + " 'memory_v0': 24588,\n", + " 'memory_v1': 14540,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.89,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nstdin = sys.stdin\\n\\n \\n\\nri = lambda: int(rs())\\n\\nrl = lambda: list(map(int, stdin.readline().split()))\\n\\nrs = lambda: stdin.readline().rstrip() # ignore trailing spaces\\n\\n\\n\\nS = list(rs())\\n\\nW = [0] * len(S)\\n\\nfor i in range(len(S)):\\n\\n if S[i] == 'W':\\n\\n W[i] = 1\\n\\nW = np.array(W[::-1])\\n\\nW_cum = W.cumsum()[::-1]\\n\\nW_cum = W_cum.tolist()\\n\\nanswer = 0\\n\\nfor i in range(len(S)):\\n\\n if S[i] == 'B':\\n\\n answer += W_cum[i]\\n\\n\\n\\nprint(answer)\",\n", + " 'target': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nstdin = sys.stdin\\n\\n \\n\\nri = lambda: int(rs())\\n\\nrl = lambda: list(map(int, stdin.readline().split()))\\n\\nrs = lambda: stdin.readline().rstrip() # ignore trailing spaces\\n\\n\\n\\nS = list(rs())\\n\\ncnt_B = 0\\n\\nanswer = 0\\n\\nfor s in S:\\n\\n if s == 'B':\\n\\n cnt_B += 1\\n\\n else:\\n\\n answer += cnt_B\\n\\nprint(answer)\\n\",\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 475,\n", + " 'code_v1_num_chars': 343,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nstdin = sys.stdin\\nri = lambda: int(rs())\\nrl = lambda: list(map(int, stdin.readline().split()))\\nrs = lambda: stdin.readline().rstrip() # ignore trailing spaces\\nS = list(rs())\\nW = [0] * len(S)\\nfor i in range(len(S)):\\n if S[i] == \"W\":\\n W[i] = 1\\nW = np.array(W[::-1])\\nW_cum = W.cumsum()[::-1]\\nW_cum = W_cum.tolist()\\nanswer = 0\\nfor i in range(len(S)):\\n if S[i] == \"B\":\\n answer += W_cum[i]\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nstdin = sys.stdin\\nri = lambda: int(rs())\\nrl = lambda: list(map(int, stdin.readline().split()))\\nrs = lambda: stdin.readline().rstrip() # ignore trailing spaces\\nS = list(rs())\\ncnt_B = 0\\nanswer = 0\\nfor s in S:\\n if s == \"B\":\\n cnt_B += 1\\n else:\\n answer += cnt_B\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.7391304348,\n", + " 'diff': ['-W = [0] * len(S)',\n", + " '-for i in range(len(S)):',\n", + " '- if S[i] == \"W\":',\n", + " '- W[i] = 1',\n", + " '-W = np.array(W[::-1])',\n", + " '-W_cum = W.cumsum()[::-1]',\n", + " '-W_cum = W_cum.tolist()',\n", + " '+cnt_B = 0',\n", + " '-for i in range(len(S)):',\n", + " '- if S[i] == \"B\":',\n", + " '- answer += W_cum[i]',\n", + " '+for s in S:',\n", + " '+ if s == \"B\":',\n", + " '+ cnt_B += 1',\n", + " '+ else:',\n", + " '+ answer += cnt_B'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3702549627,\n", + " 'measured_runtime_v1': 0.2093048743,\n", + " 'runtime_lift': 6.5466939885,\n", + " 'key': ['s238646365', 's273593908']},\n", + " {'user_id': 'u070201429',\n", + " 'problem_id': 'p03608',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's030633020',\n", + " 'submission_id_v1': 's301564470',\n", + " 'cpu_time_v0': 137,\n", + " 'cpu_time_v1': 113,\n", + " 'memory_v0': 74552,\n", + " 'memory_v1': 74516,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.52,\n", + " 'input': 'def main():\\n\\n from sys import stdin\\n\\n input = stdin.readline\\n\\n\\n\\n n, m, r = list(map(int, input().split()))\\n\\n l = list(map(int, input().split()))\\n\\n for i in range(r):\\n\\n l[i] -= 1\\n\\n d = [[10**8] * n for _ in range(n)]\\n\\n for _ in range(m):\\n\\n i, j, k = list(map(int, input().split()))\\n\\n d[i-1][j-1] = k\\n\\n d[j-1][i-1] = k\\n\\n\\n\\n # Warshall-Floyd algorithm\\n\\n for k in range(n):\\n\\n for i in range(n):\\n\\n for j in range(n):\\n\\n if d[i][j] > d[i][k] + d[k][j]:\\n\\n d[i][j] = d[i][k] + d[k][j]\\n\\n\\n\\n # full search\\n\\n # 8! = 40320\\n\\n from itertools import permutations\\n\\n\\n\\n answer = 10**8\\n\\n for i in permutations(l):\\n\\n ans = 0\\n\\n for j in range(r-1):\\n\\n ans += d[i[j]][i[j+1]]\\n\\n if ans < answer:\\n\\n answer = ans\\n\\n\\n\\n print(answer)\\n\\n\\n\\nmain()\\n',\n", + " 'target': 'def main():\\n\\n from sys import stdin\\n\\n input = stdin.readline\\n\\n\\n\\n n, m, r = list(map(int, input().split()))\\n\\n l = list(map(int, input().split()))\\n\\n for i in range(r):\\n\\n l[i] -= 1\\n\\n d = [[10**8] * n for _ in range(n)]\\n\\n for _ in range(m):\\n\\n i, j, k = list(map(int, input().split()))\\n\\n d[i-1][j-1] = k\\n\\n d[j-1][i-1] = k\\n\\n\\n\\n # Warshall-Floyd algorithm\\n\\n for k in range(n):\\n\\n for i in range(n-1):\\n\\n for j in range(i+1, n):\\n\\n if d[i][j] > d[i][k] + d[k][j]:\\n\\n d[i][j] = d[i][k] + d[k][j]\\n\\n d[j][i] = d[i][j]\\n\\n\\n\\n # full search\\n\\n # 8! = 40320\\n\\n from itertools import permutations\\n\\n\\n\\n answer = 10**8\\n\\n for i in permutations(l):\\n\\n ans = 0\\n\\n for j in range(r-1):\\n\\n ans += d[i[j]][i[j+1]]\\n\\n if ans < answer:\\n\\n answer = ans\\n\\n\\n\\n print(answer)\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 36,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 868,\n", + " 'code_v1_num_chars': 914,\n", + " 'code_v0_no_empty_lines': 'def main():\\n from sys import stdin\\n\\n input = stdin.readline\\n n, m, r = list(map(int, input().split()))\\n l = list(map(int, input().split()))\\n for i in range(r):\\n l[i] -= 1\\n d = [[10**8] * n for _ in range(n)]\\n for _ in range(m):\\n i, j, k = list(map(int, input().split()))\\n d[i - 1][j - 1] = k\\n d[j - 1][i - 1] = k\\n # Warshall-Floyd algorithm\\n for k in range(n):\\n for i in range(n):\\n for j in range(n):\\n if d[i][j] > d[i][k] + d[k][j]:\\n d[i][j] = d[i][k] + d[k][j]\\n # full search\\n # 8! = 40320\\n from itertools import permutations\\n\\n answer = 10**8\\n for i in permutations(l):\\n ans = 0\\n for j in range(r - 1):\\n ans += d[i[j]][i[j + 1]]\\n if ans < answer:\\n answer = ans\\n print(answer)\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n from sys import stdin\\n\\n input = stdin.readline\\n n, m, r = list(map(int, input().split()))\\n l = list(map(int, input().split()))\\n for i in range(r):\\n l[i] -= 1\\n d = [[10**8] * n for _ in range(n)]\\n for _ in range(m):\\n i, j, k = list(map(int, input().split()))\\n d[i - 1][j - 1] = k\\n d[j - 1][i - 1] = k\\n # Warshall-Floyd algorithm\\n for k in range(n):\\n for i in range(n - 1):\\n for j in range(i + 1, n):\\n if d[i][j] > d[i][k] + d[k][j]:\\n d[i][j] = d[i][k] + d[k][j]\\n d[j][i] = d[i][j]\\n # full search\\n # 8! = 40320\\n from itertools import permutations\\n\\n answer = 10**8\\n for i in permutations(l):\\n ans = 0\\n for j in range(r - 1):\\n ans += d[i[j]][i[j + 1]]\\n if ans < answer:\\n answer = ans\\n print(answer)\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.7027027027,\n", + " 'diff': ['- for i in range(n):',\n", + " '- for j in range(n):',\n", + " '+ for i in range(n - 1):',\n", + " '+ for j in range(i + 1, n):',\n", + " '+ d[j][i] = d[i][j]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2599997888,\n", + " 'measured_runtime_v1': 0.1532082543,\n", + " 'runtime_lift': 1.697035123,\n", + " 'key': ['s030633020', 's301564470']},\n", + " {'user_id': 'u531220228',\n", + " 'problem_id': 'p02970',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's388408889',\n", + " 'submission_id_v1': 's284238115',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 21,\n", + " 'memory_v0': 12392,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.0,\n", + " 'input': 'import numpy as np\\n\\nN, D = list(map(int, input().split()))\\n\\nprint((int(np.ceil(N/(2*D+1)))))',\n", + " 'target': 'N, D = list(map(int, input().split()))\\n\\nimport math\\n\\nprint((math.ceil(N/(2*D+1))))',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 84,\n", + " 'code_v1_num_chars': 74,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, D = list(map(int, input().split()))\\nprint((int(np.ceil(N / (2 * D + 1)))))\\n',\n", + " 'code_v1_no_empty_lines': 'N, D = list(map(int, input().split()))\\nimport math\\n\\nprint((math.ceil(N / (2 * D + 1))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import numpy as np',\n", + " '+N, D = list(map(int, input().split()))',\n", + " '+import math',\n", + " '-N, D = list(map(int, input().split()))',\n", + " '-print((int(np.ceil(N / (2 * D + 1)))))',\n", + " '+print((math.ceil(N / (2 * D + 1))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.2725535502,\n", + " 'measured_runtime_v1': 0.3538572516,\n", + " 'runtime_lift': 6.4222325235,\n", + " 'key': ['s388408889', 's284238115']},\n", + " {'user_id': 'u761320129',\n", + " 'problem_id': 'p03592',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's651607907',\n", + " 'submission_id_v1': 's022339691',\n", + " 'cpu_time_v0': 277,\n", + " 'cpu_time_v1': 242,\n", + " 'memory_v0': 9168,\n", + " 'memory_v1': 9152,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.64,\n", + " 'input': \"N,M,K = list(map(int,input().split()))\\n\\n\\n\\nfor i in range(N+1):\\n\\n for j in range(M+1):\\n\\n t = i*M + j*N - i*j*2\\n\\n if t==K:\\n\\n print('Yes')\\n\\n exit()\\n\\nprint('No')\",\n", + " 'target': \"N,M,K = list(map(int,input().split()))\\n\\n\\n\\nfor i in range(N+1):\\n\\n for j in range(M+1):\\n\\n if i*(M-j) + j*(N-i) == K:\\n\\n print('Yes')\\n\\n exit()\\n\\nprint('No')\",\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 190,\n", + " 'code_v1_num_chars': 177,\n", + " 'code_v0_no_empty_lines': 'N, M, K = list(map(int, input().split()))\\nfor i in range(N + 1):\\n for j in range(M + 1):\\n t = i * M + j * N - i * j * 2\\n if t == K:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_v1_no_empty_lines': 'N, M, K = list(map(int, input().split()))\\nfor i in range(N + 1):\\n for j in range(M + 1):\\n if i * (M - j) + j * (N - i) == K:\\n print(\"Yes\")\\n exit()\\nprint(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['- t = i * M + j * N - i * j * 2',\n", + " '- if t == K:',\n", + " '+ if i * (M - j) + j * (N - i) == K:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2590724151,\n", + " 'measured_runtime_v1': 0.2069754691,\n", + " 'runtime_lift': 1.2517058964,\n", + " 'key': ['s651607907', 's022339691']},\n", + " {'user_id': 'u426534722',\n", + " 'problem_id': 'p02248',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's909106276',\n", + " 'submission_id_v1': 's961733692',\n", + " 'cpu_time_v0': 910,\n", + " 'cpu_time_v1': 790,\n", + " 'memory_v0': 117852,\n", + " 'memory_v1': 117860,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.19,\n", + " 'input': 'def kmpTable(w):\\n\\n lw = len(w)\\n\\n nx = [-1] * (lw + 1)\\n\\n j = -1\\n\\n for i in range(lw):\\n\\n while j >= 0 and w[i] != w[j]:\\n\\n j = nx[j]\\n\\n j += 1\\n\\n nx[i + 1] = j\\n\\n return nx\\n\\ndef kmpSearch(s, w):\\n\\n ls = len(s)\\n\\n start = 0\\n\\n w_idx = 0\\n\\n ret = []\\n\\n nx = kmpTable(w)\\n\\n while start + w_idx < ls:\\n\\n if s[start + w_idx] == w[w_idx]:\\n\\n w_idx += 1\\n\\n if w_idx == len(w):\\n\\n ret.append(start)\\n\\n start = start + w_idx - nx[w_idx]\\n\\n w_idx = nx[w_idx]\\n\\n else:\\n\\n if w_idx == 0:\\n\\n start += 1\\n\\n else:\\n\\n start = start + w_idx - nx[w_idx]\\n\\n w_idx = nx[w_idx]\\n\\n return ret\\n\\nT = eval(input())\\n\\nP = eval(input())\\n\\nans = kmpSearch(T, P)\\n\\nif ans:\\n\\n print((\"\\\\n\".join(map(str, ans))))\\t\\n\\n\\n',\n", + " 'target': 'def kmpTable(w):\\n\\n lw = len(w)\\n\\n nx = [-1] * (lw + 1)\\n\\n j = -1\\n\\n for i in range(lw):\\n\\n while j >= 0 and w[i] != w[j]:\\n\\n j = nx[j]\\n\\n j += 1\\n\\n nx[i + 1] = j\\n\\n return tuple(nx)\\n\\ndef kmpSearch(s, w):\\n\\n ls = len(s)\\n\\n start = 0\\n\\n w_idx = 0\\n\\n ret = []\\n\\n nx = kmpTable(w)\\n\\n while start + w_idx < ls:\\n\\n if s[start + w_idx] == w[w_idx]:\\n\\n w_idx += 1\\n\\n if w_idx == len(w):\\n\\n ret.append(start)\\n\\n start = start + w_idx - nx[w_idx]\\n\\n w_idx = nx[w_idx]\\n\\n else:\\n\\n if w_idx == 0:\\n\\n start += 1\\n\\n else:\\n\\n start = start + w_idx - nx[w_idx]\\n\\n w_idx = nx[w_idx]\\n\\n return ret\\n\\nT = eval(input())\\n\\nP = eval(input())\\n\\nans = kmpSearch(T, P)\\n\\nif ans:\\n\\n print((\"\\\\n\".join(map(str, ans))))\\t\\n\\n\\n',\n", + " 'code_v0_loc': 36,\n", + " 'code_v1_loc': 36,\n", + " 'code_v0_num_chars': 860,\n", + " 'code_v1_num_chars': 867,\n", + " 'code_v0_no_empty_lines': 'def kmpTable(w):\\n lw = len(w)\\n nx = [-1] * (lw + 1)\\n j = -1\\n for i in range(lw):\\n while j >= 0 and w[i] != w[j]:\\n j = nx[j]\\n j += 1\\n nx[i + 1] = j\\n return nx\\n\\n\\ndef kmpSearch(s, w):\\n ls = len(s)\\n start = 0\\n w_idx = 0\\n ret = []\\n nx = kmpTable(w)\\n while start + w_idx < ls:\\n if s[start + w_idx] == w[w_idx]:\\n w_idx += 1\\n if w_idx == len(w):\\n ret.append(start)\\n start = start + w_idx - nx[w_idx]\\n w_idx = nx[w_idx]\\n else:\\n if w_idx == 0:\\n start += 1\\n else:\\n start = start + w_idx - nx[w_idx]\\n w_idx = nx[w_idx]\\n return ret\\n\\n\\nT = eval(input())\\nP = eval(input())\\nans = kmpSearch(T, P)\\nif ans:\\n print((\"\\\\n\".join(map(str, ans))))\\n',\n", + " 'code_v1_no_empty_lines': 'def kmpTable(w):\\n lw = len(w)\\n nx = [-1] * (lw + 1)\\n j = -1\\n for i in range(lw):\\n while j >= 0 and w[i] != w[j]:\\n j = nx[j]\\n j += 1\\n nx[i + 1] = j\\n return tuple(nx)\\n\\n\\ndef kmpSearch(s, w):\\n ls = len(s)\\n start = 0\\n w_idx = 0\\n ret = []\\n nx = kmpTable(w)\\n while start + w_idx < ls:\\n if s[start + w_idx] == w[w_idx]:\\n w_idx += 1\\n if w_idx == len(w):\\n ret.append(start)\\n start = start + w_idx - nx[w_idx]\\n w_idx = nx[w_idx]\\n else:\\n if w_idx == 0:\\n start += 1\\n else:\\n start = start + w_idx - nx[w_idx]\\n w_idx = nx[w_idx]\\n return ret\\n\\n\\nT = eval(input())\\nP = eval(input())\\nans = kmpSearch(T, P)\\nif ans:\\n print((\"\\\\n\".join(map(str, ans))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- return nx', '+ return tuple(nx)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.215319014,\n", + " 'measured_runtime_v1': 0.1265300495,\n", + " 'runtime_lift': 1.7017223565,\n", + " 'key': ['s909106276', 's961733692']},\n", + " {'user_id': 'u678167152',\n", + " 'problem_id': 'p03814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's292011694',\n", + " 'submission_id_v1': 's577750700',\n", + " 'cpu_time_v0': 173,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 41456,\n", + " 'memory_v1': 9328,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.92,\n", + " 'input': \"s = eval(input())\\n\\na = s.find('A')\\n\\nz = s[::-1].find('Z')\\n\\nans = len(s)-a-z\\n\\n\\n\\nprint(ans)\\n\\n\\n\\n#print(*ans, sep='\\\\n')\",\n", + " 'target': \"def solve():\\n\\n S = eval(input())\\n\\n a = S.find('A')\\n\\n z = S[::-1].find('Z')\\n\\n ans = len(S)-a-z\\n\\n return ans\\n\\nprint((solve()))\",\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 109,\n", + " 'code_v1_num_chars': 121,\n", + " 'code_v0_no_empty_lines': 's = eval(input())\\na = s.find(\"A\")\\nz = s[::-1].find(\"Z\")\\nans = len(s) - a - z\\nprint(ans)\\n# print(*ans, sep=\\'\\\\n\\')\\n',\n", + " 'code_v1_no_empty_lines': 'def solve():\\n S = eval(input())\\n a = S.find(\"A\")\\n z = S[::-1].find(\"Z\")\\n ans = len(S) - a - z\\n return ans\\n\\n\\nprint((solve()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-s = eval(input())',\n", + " '-a = s.find(\"A\")',\n", + " '-z = s[::-1].find(\"Z\")',\n", + " '-ans = len(s) - a - z',\n", + " '-print(ans)',\n", + " \"-# print(*ans, sep='\\\\n')\",\n", + " '+def solve():',\n", + " '+ S = eval(input())',\n", + " '+ a = S.find(\"A\")',\n", + " '+ z = S[::-1].find(\"Z\")',\n", + " '+ ans = len(S) - a - z',\n", + " '+ return ans',\n", + " '+',\n", + " '+',\n", + " '+print((solve()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3115016568,\n", + " 'measured_runtime_v1': 0.2242342863,\n", + " 'runtime_lift': 1.3891794243,\n", + " 'key': ['s292011694', 's577750700']},\n", + " {'user_id': 'u638456847',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's318779524',\n", + " 'submission_id_v1': 's213127805',\n", + " 'cpu_time_v0': 120,\n", + " 'cpu_time_v1': 45,\n", + " 'memory_v0': 15264,\n", + " 'memory_v1': 7084,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.5,\n", + " 'input': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\nMOD = 10**9+7\\n\\n\\n\\nfac = [1, 1] # 元テーブル\\n\\nf_inv = [1, 1] # 逆元テーブル\\n\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\ndef prepare(n, mod):\\n\\n for i in range(2, n+1):\\n\\n fac.append((fac[-1] * i) % mod)\\n\\n inv.append((-inv[mod % i] * (mod//i)) % mod)\\n\\n f_inv.append((f_inv[-1] * inv[-1]) % mod)\\n\\n\\n\\n\\n\\ndef cmb(n, r, mod):\\n\\n if n < 0 or r < 0:\\n\\n return 0\\n\\n if r > n:\\n\\n return 0\\n\\n\\n\\n return fac[n] * f_inv[r] * f_inv[n-r] % mod\\n\\n\\n\\n\\n\\ndef prime_factorization(n):\\n\\n d = []\\n\\n i, e = 2, 0 # factor, exponent\\n\\n while i * i <= n:\\n\\n while n % i == 0:\\n\\n n //= i\\n\\n e += 1\\n\\n if e > 0:\\n\\n d.append((i, e))\\n\\n i += 1\\n\\n e = 0\\n\\n if n > 1:\\n\\n d.append((n, 1))\\n\\n return d\\n\\n\\n\\n\\n\\ndef main():\\n\\n N,M = list(map(int, readline().split()))\\n\\n\\n\\n prepare(N+100, MOD)\\n\\n d = prime_factorization(M)\\n\\n\\n\\n ans = 1\\n\\n for i, e in d:\\n\\n ans *= cmb(N-1+e, e, MOD)\\n\\n ans %= MOD\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\nMOD = 10**9+7\\n\\n\\n\\nfac = [1, 1] # 元テーブル\\n\\nf_inv = [1, 1] # 逆元テーブル\\n\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\ndef prepare(n, mod):\\n\\n for i in range(2, n+1):\\n\\n fac.append((fac[-1] * i) % mod)\\n\\n\\n\\n\\n\\ndef cmb(n, r, mod):\\n\\n if n < 0 or r < 0:\\n\\n return 0\\n\\n if r > n:\\n\\n return 0\\n\\n\\n\\n return fac[n] * pow(fac[r],MOD-2,MOD) * pow(fac[n-r],MOD-2,MOD) % mod\\n\\n\\n\\n\\n\\ndef prime_factorization(n):\\n\\n d = []\\n\\n i, e = 2, 0 # factor, exponent\\n\\n while i * i <= n:\\n\\n while n % i == 0:\\n\\n n //= i\\n\\n e += 1\\n\\n if e > 0:\\n\\n d.append((i, e))\\n\\n i += 1\\n\\n e = 0\\n\\n if n > 1:\\n\\n d.append((n, 1))\\n\\n return d\\n\\n\\n\\n\\n\\ndef main():\\n\\n N,M = list(map(int, readline().split()))\\n\\n\\n\\n prepare(N+100, MOD)\\n\\n d = prime_factorization(M)\\n\\n\\n\\n ans = 1\\n\\n for i, e in d:\\n\\n ans *= cmb(N-1+e, e, MOD)\\n\\n ans %= MOD\\n\\n\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 58,\n", + " 'code_v1_loc': 56,\n", + " 'code_v0_num_chars': 1128,\n", + " 'code_v1_num_chars': 1049,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nMOD = 10**9 + 7\\nfac = [1, 1] # 元テーブル\\nf_inv = [1, 1] # 逆元テーブル\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\n\\ndef prepare(n, mod):\\n for i in range(2, n + 1):\\n fac.append((fac[-1] * i) % mod)\\n inv.append((-inv[mod % i] * (mod // i)) % mod)\\n f_inv.append((f_inv[-1] * inv[-1]) % mod)\\n\\n\\ndef cmb(n, r, mod):\\n if n < 0 or r < 0:\\n return 0\\n if r > n:\\n return 0\\n return fac[n] * f_inv[r] * f_inv[n - r] % mod\\n\\n\\ndef prime_factorization(n):\\n d = []\\n i, e = 2, 0 # factor, exponent\\n while i * i <= n:\\n while n % i == 0:\\n n //= i\\n e += 1\\n if e > 0:\\n d.append((i, e))\\n i += 1\\n e = 0\\n if n > 1:\\n d.append((n, 1))\\n return d\\n\\n\\ndef main():\\n N, M = list(map(int, readline().split()))\\n prepare(N + 100, MOD)\\n d = prime_factorization(M)\\n ans = 1\\n for i, e in d:\\n ans *= cmb(N - 1 + e, e, MOD)\\n ans %= MOD\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nMOD = 10**9 + 7\\nfac = [1, 1] # 元テーブル\\nf_inv = [1, 1] # 逆元テーブル\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\n\\ndef prepare(n, mod):\\n for i in range(2, n + 1):\\n fac.append((fac[-1] * i) % mod)\\n\\n\\ndef cmb(n, r, mod):\\n if n < 0 or r < 0:\\n return 0\\n if r > n:\\n return 0\\n return fac[n] * pow(fac[r], MOD - 2, MOD) * pow(fac[n - r], MOD - 2, MOD) % mod\\n\\n\\ndef prime_factorization(n):\\n d = []\\n i, e = 2, 0 # factor, exponent\\n while i * i <= n:\\n while n % i == 0:\\n n //= i\\n e += 1\\n if e > 0:\\n d.append((i, e))\\n i += 1\\n e = 0\\n if n > 1:\\n d.append((n, 1))\\n return d\\n\\n\\ndef main():\\n N, M = list(map(int, readline().split()))\\n prepare(N + 100, MOD)\\n d = prime_factorization(M)\\n ans = 1\\n for i, e in d:\\n ans *= cmb(N - 1 + e, e, MOD)\\n ans %= MOD\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.4482758621,\n", + " 'diff': ['- inv.append((-inv[mod % i] * (mod // i)) % mod)',\n", + " '- f_inv.append((f_inv[-1] * inv[-1]) % mod)',\n", + " '- return fac[n] * f_inv[r] * f_inv[n - r] % mod',\n", + " '+ return fac[n] * pow(fac[r], MOD - 2, MOD) * pow(fac[n - r], MOD - 2, MOD) % mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6358441951,\n", + " 'measured_runtime_v1': 0.3783175611,\n", + " 'runtime_lift': 1.6807155163,\n", + " 'key': ['s318779524', 's213127805']},\n", + " {'user_id': 'u869919400',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's203896708',\n", + " 'submission_id_v1': 's149433895',\n", + " 'cpu_time_v0': 1653,\n", + " 'cpu_time_v1': 675,\n", + " 'memory_v0': 43728,\n", + " 'memory_v1': 76760,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.17,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nL = [list(map(int, input().split())) for i in range(N)]\\n\\ndp = np.zeros((N, 3), dtype=int)\\n\\n\\n\\nfor i in range(N):\\n\\n dp[i][0] = L[0][0] if i == 0 else max(dp[i-1][1]+L[i][0], dp[i-1][2]+L[i][0])\\n\\n dp[i][1] = L[0][1] if i == 0 else max(dp[i-1][0]+L[i][1], dp[i-1][2]+L[i][1])\\n\\n dp[i][2] = L[0][2] if i == 0 else max(dp[i-1][0]+L[i][2], dp[i-1][1]+L[i][2])\\n\\n\\n\\nprint((max(dp[-1])))',\n", + " 'target': 'N = int(eval(input()))\\n\\nabc = [list(map(int, input().split())) for i in range(N)]\\n\\ndp = [[0 for i in range(3)] for j in range(N+1)]\\n\\nfor i in range(N):\\n\\n dp[i+1][0] = max(dp[i][1]+abc[i][0], dp[i][2]+abc[i][0])\\n\\n dp[i+1][1] = max(dp[i][0]+abc[i][1], dp[i][2]+abc[i][1])\\n\\n dp[i+1][2] = max(dp[i][0]+abc[i][2], dp[i][1]+abc[i][2])\\n\\nprint((max(dp[-1])))',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 420,\n", + " 'code_v1_num_chars': 351,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nL = [list(map(int, input().split())) for i in range(N)]\\ndp = np.zeros((N, 3), dtype=int)\\nfor i in range(N):\\n dp[i][0] = (\\n L[0][0] if i == 0 else max(dp[i - 1][1] + L[i][0], dp[i - 1][2] + L[i][0])\\n )\\n dp[i][1] = (\\n L[0][1] if i == 0 else max(dp[i - 1][0] + L[i][1], dp[i - 1][2] + L[i][1])\\n )\\n dp[i][2] = (\\n L[0][2] if i == 0 else max(dp[i - 1][0] + L[i][2], dp[i - 1][1] + L[i][2])\\n )\\nprint((max(dp[-1])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nabc = [list(map(int, input().split())) for i in range(N)]\\ndp = [[0 for i in range(3)] for j in range(N + 1)]\\nfor i in range(N):\\n dp[i + 1][0] = max(dp[i][1] + abc[i][0], dp[i][2] + abc[i][0])\\n dp[i + 1][1] = max(dp[i][0] + abc[i][1], dp[i][2] + abc[i][1])\\n dp[i + 1][2] = max(dp[i][0] + abc[i][2], dp[i][1] + abc[i][2])\\nprint((max(dp[-1])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.2727272727,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-L = [list(map(int, input().split())) for i in range(N)]',\n", + " '-dp = np.zeros((N, 3), dtype=int)',\n", + " '+abc = [list(map(int, input().split())) for i in range(N)]',\n", + " '+dp = [[0 for i in range(3)] for j in range(N + 1)]',\n", + " '- dp[i][0] = (',\n", + " '- L[0][0] if i == 0 else max(dp[i - 1][1] + L[i][0], dp[i - 1][2] + L[i][0])',\n", + " '- )',\n", + " '- dp[i][1] = (',\n", + " '- L[0][1] if i == 0 else max(dp[i - 1][0] + L[i][1], dp[i - 1][2] + L[i][1])',\n", + " '- )',\n", + " '- dp[i][2] = (',\n", + " '- L[0][2] if i == 0 else max(dp[i - 1][0] + L[i][2], dp[i - 1][1] + L[i][2])',\n", + " '- )',\n", + " '+ dp[i + 1][0] = max(dp[i][1] + abc[i][0], dp[i][2] + abc[i][0])',\n", + " '+ dp[i + 1][1] = max(dp[i][0] + abc[i][1], dp[i][2] + abc[i][1])',\n", + " '+ dp[i + 1][2] = max(dp[i][0] + abc[i][2], dp[i][1] + abc[i][2])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.439308491,\n", + " 'measured_runtime_v1': 0.1934893382,\n", + " 'runtime_lift': 7.4386966466,\n", + " 'key': ['s203896708', 's149433895']},\n", + " {'user_id': 'u371409687',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's077527302',\n", + " 'submission_id_v1': 's532076785',\n", + " 'cpu_time_v0': 39,\n", + " 'cpu_time_v1': 22,\n", + " 'memory_v0': 9172,\n", + " 'memory_v1': 9344,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.59,\n", + " 'input': \"x = int(eval(input()))\\n\\nfor i in range(-118, 120):\\n\\n for j in range(-119, 119):\\n\\n if i**5 - j**5 == x:\\n\\n print(('{} {}'.format(i,j)))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break\",\n", + " 'target': \"def make_divisors(n):\\n\\n divisors = []\\n\\n for i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n divisors.append(i)\\n\\n if i != n // i:\\n\\n divisors.append(n//i)\\n\\n\\n\\n divisors.sort()\\n\\n return divisors\\n\\nx = int(eval(input()))\\n\\nL = make_divisors(x)\\n\\nfor i in L:\\n\\n for a in range(-118,120):\\n\\n if a**5 - (a-i)**5 == x:\\n\\n print(('{} {}'.format(a,a-i)))\\n\\n break\\n\\n else:\\n\\n continue\\n\\n break\",\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 205,\n", + " 'code_v1_num_chars': 466,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(-118, 120):\\n for j in range(-119, 119):\\n if i**5 - j**5 == x:\\n print((\"{} {}\".format(i, j)))\\n break\\n else:\\n continue\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'def make_divisors(n):\\n divisors = []\\n for i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n divisors.append(i)\\n if i != n // i:\\n divisors.append(n // i)\\n divisors.sort()\\n return divisors\\n\\n\\nx = int(eval(input()))\\nL = make_divisors(x)\\nfor i in L:\\n for a in range(-118, 120):\\n if a**5 - (a - i) ** 5 == x:\\n print((\"{} {}\".format(a, a - i)))\\n break\\n else:\\n continue\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.0,\n", + " 'diff': ['+def make_divisors(n):',\n", + " '+ divisors = []',\n", + " '+ for i in range(1, int(n**0.5) + 1):',\n", + " '+ if n % i == 0:',\n", + " '+ divisors.append(i)',\n", + " '+ if i != n // i:',\n", + " '+ divisors.append(n // i)',\n", + " '+ divisors.sort()',\n", + " '+ return divisors',\n", + " '+',\n", + " '+',\n", + " '-for i in range(-118, 120):',\n", + " '- for j in range(-119, 119):',\n", + " '- if i**5 - j**5 == x:',\n", + " '- print((\"{} {}\".format(i, j)))',\n", + " '+L = make_divisors(x)',\n", + " '+for i in L:',\n", + " '+ for a in range(-118, 120):',\n", + " '+ if a**5 - (a - i) ** 5 == x:',\n", + " '+ print((\"{} {}\".format(a, a - i)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.530296878,\n", + " 'measured_runtime_v1': 0.2904120326,\n", + " 'runtime_lift': 1.8260155175,\n", + " 'key': ['s077527302', 's532076785']},\n", + " {'user_id': 'u987164499',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's696147047',\n", + " 'submission_id_v1': 's878437113',\n", + " 'cpu_time_v0': 159,\n", + " 'cpu_time_v1': 23,\n", + " 'memory_v0': 12512,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.53,\n", + " 'input': 'from sys import stdin\\n\\nimport numpy as np\\n\\n\\n\\nh,w= [int(x) for x in stdin.readline().rstrip().split()]\\n\\n\\n\\nli = [[\"\" for i in range(w)]for j in range(h)]\\n\\n\\n\\nfor i in range(h):\\n\\n s = stdin.readline().rstrip()\\n\\n for j in range(w):\\n\\n li[i][j] = s[j]\\n\\n\\n\\nli = np.asarray([s for s in li if s != [\\'.\\']*w]).T.tolist()\\n\\nli = np.asarray([s for s in li if s != [\\'.\\']*len(li[0])]).T.tolist()\\n\\n\\n\\nfor i in li:\\n\\n s = \"\"\\n\\n for j in range(len(li[0])):\\n\\n s += i[j]\\n\\n print(s)',\n", + " 'target': 'from sys import stdin,setrecursionlimit\\n\\nsetrecursionlimit(10 ** 7)\\n\\nh,w = list(map(int,stdin.readline().rstrip().split()))\\n\\nli = [[\"\" for i in range(w)]for j in range(h)]\\n\\nfor i in range(h):\\n\\n s = stdin.readline().rstrip()\\n\\n for j in range(w):\\n\\n li[i][j] = s[j]\\n\\nlin = []\\n\\nfor i in li:\\n\\n if i != [\".\"]*w:\\n\\n lin.append(i)\\n\\nout = []\\n\\nfor i in range(w):\\n\\n flag = True\\n\\n for j in range(len(lin)):\\n\\n if lin[j][i] == \"#\":\\n\\n flag = False\\n\\n if flag:\\n\\n out.append(i)\\n\\n\\n\\nlis = []\\n\\nfor i in lin:\\n\\n case = []\\n\\n for j,k in enumerate(i):\\n\\n if j in out:\\n\\n continue\\n\\n case.append(k)\\n\\n lis.append(case)\\n\\n\\n\\nfor i in lis:\\n\\n print((\"\".join(i)))',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 32,\n", + " 'code_v0_num_chars': 484,\n", + " 'code_v1_num_chars': 711,\n", + " 'code_v0_no_empty_lines': 'from sys import stdin\\nimport numpy as np\\n\\nh, w = [int(x) for x in stdin.readline().rstrip().split()]\\nli = [[\"\" for i in range(w)] for j in range(h)]\\nfor i in range(h):\\n s = stdin.readline().rstrip()\\n for j in range(w):\\n li[i][j] = s[j]\\nli = np.asarray([s for s in li if s != [\".\"] * w]).T.tolist()\\nli = np.asarray([s for s in li if s != [\".\"] * len(li[0])]).T.tolist()\\nfor i in li:\\n s = \"\"\\n for j in range(len(li[0])):\\n s += i[j]\\n print(s)\\n',\n", + " 'code_v1_no_empty_lines': 'from sys import stdin, setrecursionlimit\\n\\nsetrecursionlimit(10**7)\\nh, w = list(map(int, stdin.readline().rstrip().split()))\\nli = [[\"\" for i in range(w)] for j in range(h)]\\nfor i in range(h):\\n s = stdin.readline().rstrip()\\n for j in range(w):\\n li[i][j] = s[j]\\nlin = []\\nfor i in li:\\n if i != [\".\"] * w:\\n lin.append(i)\\nout = []\\nfor i in range(w):\\n flag = True\\n for j in range(len(lin)):\\n if lin[j][i] == \"#\":\\n flag = False\\n if flag:\\n out.append(i)\\nlis = []\\nfor i in lin:\\n case = []\\n for j, k in enumerate(i):\\n if j in out:\\n continue\\n case.append(k)\\n lis.append(case)\\nfor i in lis:\\n print((\"\".join(i)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 37.5,\n", + " 'diff': ['-from sys import stdin',\n", + " '-import numpy as np',\n", + " '+from sys import stdin, setrecursionlimit',\n", + " '-h, w = [int(x) for x in stdin.readline().rstrip().split()]',\n", + " '+setrecursionlimit(10**7)',\n", + " '+h, w = list(map(int, stdin.readline().rstrip().split()))',\n", + " '-li = np.asarray([s for s in li if s != [\".\"] * w]).T.tolist()',\n", + " '-li = np.asarray([s for s in li if s != [\".\"] * len(li[0])]).T.tolist()',\n", + " '+lin = []',\n", + " '- s = \"\"',\n", + " '- for j in range(len(li[0])):',\n", + " '- s += i[j]',\n", + " '- print(s)',\n", + " '+ if i != [\".\"] * w:',\n", + " '+ lin.append(i)',\n", + " '+out = []',\n", + " '+for i in range(w):',\n", + " '+ flag = True',\n", + " '+ for j in range(len(lin)):',\n", + " '+ if lin[j][i] == \"#\":',\n", + " '+ flag = False',\n", + " '+ if flag:',\n", + " '+ out.append(i)',\n", + " '+lis = []',\n", + " '+for i in lin:',\n", + " '+ case = []',\n", + " '+ for j, k in enumerate(i):',\n", + " '+ if j in out:',\n", + " '+ continue',\n", + " '+ case.append(k)',\n", + " '+ lis.append(case)',\n", + " '+for i in lis:',\n", + " '+ print((\"\".join(i)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5214503652,\n", + " 'measured_runtime_v1': 0.1999706806,\n", + " 'runtime_lift': 7.6083671913,\n", + " 'key': ['s696147047', 's878437113']},\n", + " {'user_id': 'u029000441',\n", + " 'problem_id': 'p02850',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's037775300',\n", + " 'submission_id_v1': 's014062604',\n", + " 'cpu_time_v0': 655,\n", + " 'cpu_time_v1': 577,\n", + " 'memory_v0': 74684,\n", + " 'memory_v1': 85652,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.91,\n", + " 'input': '#d3と同一解法\\n\\nn=int(eval(input()))\\n\\nimport sys\\n\\n#再帰関数の再帰回数を変更\\n\\nsys.setrecursionlimit(10**6)\\n\\ns=[[] for _ in range(n)]\\n\\n\\n\\nfor i in range(n-1):\\n\\n a,b=list(map(int,input().split()))\\n\\n s[a-1].append((b-1,i))\\n\\n s[b-1].append((a-1,i))\\n\\n\\n\\nl=[0]*(n-1)\\n\\n\\n\\ndef dfs(node,pre_col,par):\\n\\n col=1\\n\\n for nei,i in s[node]:\\n\\n if nei==par:\\n\\n continue\\n\\n if col==pre_col:\\n\\n col+=1\\n\\n l[i]=col\\n\\n dfs(nei,col,node)\\n\\n col+=1\\n\\ndfs(0,-1,-1)\\n\\nprint((max(l)))\\n\\nfor i in l:\\n\\n print(i)\\n',\n", + " 'target': 'import sys\\n\\nsys.setrecursionlimit(500000)\\n\\nN = int(eval(input()))\\n\\nE = [[] for _ in range(N+1)]\\n\\nfor i in range(N-1):\\n\\n a, b = list(map(int, input().split()))\\n\\n E[a].append((b, i))\\n\\n E[b].append((a, i))\\n\\nK = max(len(e) for e in E)\\n\\nprint(K)\\n\\nAns = [-1] * (N-1)\\n\\ndef dfs(v=1, p=0, p_col=-1):\\n\\n col = 1\\n\\n for u, idx in E[v]:\\n\\n if u!=p: #木構造の逆向きの矢印を除くための条件\\n\\n if col == p_col:\\n\\n col += 1\\n\\n Ans[idx] = col\\n\\n #print(p_col)\\n\\n dfs(u, v, col) #u;調べる頂点 v;直前に調べた辺で、調べる頂点と結ばれている頂点\\u3000col;直前に調べた辺の色番号\\n\\n col += 1 #最深部まで調べたら デフォルトの色=最後に調べた辺の色+1とする\\n\\n #最深部に繋がった辺の色+1してやれば、次の辺の色は必ず条件を満たしてくれる\\n\\n\\n\\ndfs()\\n\\nprint((\"\\\\n\".join(map(str, Ans))))\\n',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 512,\n", + " 'code_v1_num_chars': 704,\n", + " 'code_v0_no_empty_lines': '# d3と同一解法\\nn = int(eval(input()))\\nimport sys\\n\\n# 再帰関数の再帰回数を変更\\nsys.setrecursionlimit(10**6)\\ns = [[] for _ in range(n)]\\nfor i in range(n - 1):\\n a, b = list(map(int, input().split()))\\n s[a - 1].append((b - 1, i))\\n s[b - 1].append((a - 1, i))\\nl = [0] * (n - 1)\\n\\n\\ndef dfs(node, pre_col, par):\\n col = 1\\n for nei, i in s[node]:\\n if nei == par:\\n continue\\n if col == pre_col:\\n col += 1\\n l[i] = col\\n dfs(nei, col, node)\\n col += 1\\n\\n\\ndfs(0, -1, -1)\\nprint((max(l)))\\nfor i in l:\\n print(i)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(500000)\\nN = int(eval(input()))\\nE = [[] for _ in range(N + 1)]\\nfor i in range(N - 1):\\n a, b = list(map(int, input().split()))\\n E[a].append((b, i))\\n E[b].append((a, i))\\nK = max(len(e) for e in E)\\nprint(K)\\nAns = [-1] * (N - 1)\\n\\n\\ndef dfs(v=1, p=0, p_col=-1):\\n col = 1\\n for u, idx in E[v]:\\n if u != p: # 木構造の逆向きの矢印を除くための条件\\n if col == p_col:\\n col += 1\\n Ans[idx] = col\\n # print(p_col)\\n dfs(u, v, col) # u;調べる頂点 v;直前に調べた辺で、調べる頂点と結ばれている頂点\\u3000col;直前に調べた辺の色番号\\n col += 1 # 最深部まで調べたら デフォルトの色=最後に調べた辺の色+1とする\\n # 最深部に繋がった辺の色+1してやれば、次の辺の色は必ず条件を満たしてくれる\\n\\n\\ndfs()\\nprint((\"\\\\n\".join(map(str, Ans))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.7142857143,\n", + " 'diff': ['-# d3と同一解法',\n", + " '-n = int(eval(input()))',\n", + " '-# 再帰関数の再帰回数を変更',\n", + " '-sys.setrecursionlimit(10**6)',\n", + " '-s = [[] for _ in range(n)]',\n", + " '-for i in range(n - 1):',\n", + " '+sys.setrecursionlimit(500000)',\n", + " '+N = int(eval(input()))',\n", + " '+E = [[] for _ in range(N + 1)]',\n", + " '+for i in range(N - 1):',\n", + " '- s[a - 1].append((b - 1, i))',\n", + " '- s[b - 1].append((a - 1, i))',\n", + " '-l = [0] * (n - 1)',\n", + " '+ E[a].append((b, i))',\n", + " '+ E[b].append((a, i))',\n", + " '+K = max(len(e) for e in E)',\n", + " '+print(K)',\n", + " '+Ans = [-1] * (N - 1)',\n", + " '-def dfs(node, pre_col, par):',\n", + " '+def dfs(v=1, p=0, p_col=-1):',\n", + " '- for nei, i in s[node]:',\n", + " '- if nei == par:',\n", + " '- continue',\n", + " '- if col == pre_col:',\n", + " '- col += 1',\n", + " '- l[i] = col',\n", + " '- dfs(nei, col, node)',\n", + " '- col += 1',\n", + " '+ for u, idx in E[v]:',\n", + " '+ if u != p: # 木構造の逆向きの矢印を除くための条件',\n", + " '+ if col == p_col:',\n", + " '+ col += 1',\n", + " '+ Ans[idx] = col',\n", + " '+ # print(p_col)',\n", + " '+ dfs(u, v, col) # u;調べる頂点 v;直前に調べた辺で、調べる頂点と結ばれている頂点\\u3000col;直前に調べた辺の色番号',\n", + " '+ col += 1 # 最深部まで調べたら デフォルトの色=最後に調べた辺の色+1とする',\n", + " '+ # 最深部に繋がった辺の色+1してやれば、次の辺の色は必ず条件を満たしてくれる',\n", + " '-dfs(0, -1, -1)',\n", + " '-print((max(l)))',\n", + " '-for i in l:',\n", + " '- print(i)',\n", + " '+dfs()',\n", + " '+print((\"\\\\n\".join(map(str, Ans))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2935128241,\n", + " 'measured_runtime_v1': 0.2145129414,\n", + " 'runtime_lift': 1.3682756023,\n", + " 'key': ['s037775300', 's014062604']},\n", + " {'user_id': 'u127499732',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's032064078',\n", + " 'submission_id_v1': 's836088645',\n", + " 'cpu_time_v0': 401,\n", + " 'cpu_time_v1': 159,\n", + " 'memory_v0': 32556,\n", + " 'memory_v1': 23616,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 60.35,\n", + " 'input': 'import numpy as np\\n\\nn,k=list(map(int,input().split()))\\n\\nexp=tuple([(int(x)+1)/2 for x in input().split()])\\n\\nl=np.cumsum(exp)\\n\\n\\n\\nans=l[k-1]\\n\\nfor i in range(0,n-k):\\n\\n x=l[i+k]-l[i]\\n\\n ans=max(ans,x)\\n\\nprint(ans)',\n", + " 'target': \"def main():\\n\\n from itertools import accumulate\\n\\n n, k = list(map(int, input().split()))\\n\\n *exp, = [(int(x) + 1) / 2 for x in input().split()]\\n\\n l = accumulate(exp)\\n\\n l = list(l)\\n\\n ans = l[k - 1]\\n\\n for i in range(0, n - k):\\n\\n x = l[i + k] - l[i]\\n\\n ans = max(ans, x)\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 207,\n", + " 'code_v1_num_chars': 359,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn, k = list(map(int, input().split()))\\nexp = tuple([(int(x) + 1) / 2 for x in input().split()])\\nl = np.cumsum(exp)\\nans = l[k - 1]\\nfor i in range(0, n - k):\\n x = l[i + k] - l[i]\\n ans = max(ans, x)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n from itertools import accumulate\\n\\n n, k = list(map(int, input().split()))\\n (*exp,) = [(int(x) + 1) / 2 for x in input().split()]\\n l = accumulate(exp)\\n l = list(l)\\n ans = l[k - 1]\\n for i in range(0, n - k):\\n x = l[i + k] - l[i]\\n ans = max(ans, x)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '+def main():',\n", + " '+ from itertools import accumulate',\n", + " '-n, k = list(map(int, input().split()))',\n", + " '-exp = tuple([(int(x) + 1) / 2 for x in input().split()])',\n", + " '-l = np.cumsum(exp)',\n", + " '-ans = l[k - 1]',\n", + " '-for i in range(0, n - k):',\n", + " '- x = l[i + k] - l[i]',\n", + " '- ans = max(ans, x)',\n", + " '-print(ans)',\n", + " '+ n, k = list(map(int, input().split()))',\n", + " '+ (*exp,) = [(int(x) + 1) / 2 for x in input().split()]',\n", + " '+ l = accumulate(exp)',\n", + " '+ l = list(l)',\n", + " '+ ans = l[k - 1]',\n", + " '+ for i in range(0, n - k):',\n", + " '+ x = l[i + k] - l[i]',\n", + " '+ ans = max(ans, x)',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2954093719,\n", + " 'measured_runtime_v1': 0.1973411753,\n", + " 'runtime_lift': 6.5643136548,\n", + " 'key': ['s032064078', 's836088645']},\n", + " {'user_id': 'u827885761',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's193052587',\n", + " 'submission_id_v1': 's829443238',\n", + " 'cpu_time_v0': 509,\n", + " 'cpu_time_v1': 195,\n", + " 'memory_v0': 46168,\n", + " 'memory_v1': 7668,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 61.69,\n", + " 'input': 'import sys\\n\\nsys.setrecursionlimit(10**7)\\n\\ndef lmi(): return list(map(int, input().split()))\\n\\n\\n\\nn, m = lmi()\\n\\n\\n\\nl = [0] * (n+1)\\n\\nl[0] = 1\\n\\n\\n\\na = 0\\n\\nif m != 0:\\n\\n a = int(eval(input()))\\n\\nk = 1\\n\\nfor i in range(n+1):\\n\\n\\n\\n if i != a:\\n\\n if i == 1:\\n\\n l[i] = 1\\n\\n elif i >= 2:\\n\\n l[i] = l[i-1] + l[i-2]\\n\\n l[i] %= 1000000007\\n\\n else:\\n\\n k += 1\\n\\n if k <= m:\\n\\n a = int(eval(input()))\\n\\n\\n\\n\\n\\n\\n\\n#print(l)\\n\\nprint((l[n] % 1000000007))\\n',\n", + " 'target': 'import sys\\n\\nsys.setrecursionlimit(10**7)\\n\\ndef lmi(): return list(map(int, input().split()))\\n\\n\\n\\nn, m = lmi()\\n\\na = [1] * (n+1)\\n\\nfor i in range(m):\\n\\n a[int(eval(input()))] = 0\\n\\nk = [0] * (n+1)\\n\\nk[0] = 1\\n\\nfor i in range(1,n+1):\\n\\n if i == 1 and a[1]:\\n\\n k[1] = 1\\n\\n elif i >= 2 and a[i]:\\n\\n k[i] = k[i-1] + k[i-2]\\n\\n k[i] %= 10 ** 9 + 7\\n\\n\\n\\nprint((k[n]))\\n',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 479,\n", + " 'code_v1_num_chars': 367,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**7)\\n\\n\\ndef lmi():\\n return list(map(int, input().split()))\\n\\n\\nn, m = lmi()\\nl = [0] * (n + 1)\\nl[0] = 1\\na = 0\\nif m != 0:\\n a = int(eval(input()))\\nk = 1\\nfor i in range(n + 1):\\n if i != a:\\n if i == 1:\\n l[i] = 1\\n elif i >= 2:\\n l[i] = l[i - 1] + l[i - 2]\\n l[i] %= 1000000007\\n else:\\n k += 1\\n if k <= m:\\n a = int(eval(input()))\\n# print(l)\\nprint((l[n] % 1000000007))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**7)\\n\\n\\ndef lmi():\\n return list(map(int, input().split()))\\n\\n\\nn, m = lmi()\\na = [1] * (n + 1)\\nfor i in range(m):\\n a[int(eval(input()))] = 0\\nk = [0] * (n + 1)\\nk[0] = 1\\nfor i in range(1, n + 1):\\n if i == 1 and a[1]:\\n k[1] = 1\\n elif i >= 2 and a[i]:\\n k[i] = k[i - 1] + k[i - 2]\\n k[i] %= 10**9 + 7\\nprint((k[n]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 40.0,\n", + " 'diff': ['-l = [0] * (n + 1)',\n", + " '-l[0] = 1',\n", + " '-a = 0',\n", + " '-if m != 0:',\n", + " '- a = int(eval(input()))',\n", + " '-k = 1',\n", + " '-for i in range(n + 1):',\n", + " '- if i != a:',\n", + " '- if i == 1:',\n", + " '- l[i] = 1',\n", + " '- elif i >= 2:',\n", + " '- l[i] = l[i - 1] + l[i - 2]',\n", + " '- l[i] %= 1000000007',\n", + " '- else:',\n", + " '- k += 1',\n", + " '- if k <= m:',\n", + " '- a = int(eval(input()))',\n", + " '-# print(l)',\n", + " '-print((l[n] % 1000000007))',\n", + " '+a = [1] * (n + 1)',\n", + " '+for i in range(m):',\n", + " '+ a[int(eval(input()))] = 0',\n", + " '+k = [0] * (n + 1)',\n", + " '+k[0] = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ if i == 1 and a[1]:',\n", + " '+ k[1] = 1',\n", + " '+ elif i >= 2 and a[i]:',\n", + " '+ k[i] = k[i - 1] + k[i - 2]',\n", + " '+ k[i] %= 10**9 + 7',\n", + " '+print((k[n]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3120539634,\n", + " 'measured_runtime_v1': 0.1110639279,\n", + " 'runtime_lift': 2.8096787978,\n", + " 'key': ['s193052587', 's829443238']},\n", + " {'user_id': 'u263830634',\n", + " 'problem_id': 'p03173',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's585052356',\n", + " 'submission_id_v1': 's189629023',\n", + " 'cpu_time_v0': 1975,\n", + " 'cpu_time_v1': 405,\n", + " 'memory_v0': 15668,\n", + " 'memory_v1': 42732,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.49,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = [0] + list(map(int, input().split()))\\n\\n\\n\\nA = np.array(A, dtype = np.int64)\\n\\nA = np.cumsum(A)\\n\\n\\n\\ndp = np.zeros((N, N), dtype = np.int64)\\n\\n\\n\\nfor j in range(1, N):\\n\\n for i in range(N - j):\\n\\n # print (dp[i, i:i + j], dp[i + 1:i + j + 1, i + j])\\n\\n tmp = min(dp[i, i:i + j] + dp[i + 1:i + j + 1, i + j])\\n\\n dp[i][i + j] = tmp + A[i + j + 1] - A[i]\\n\\n\\n\\nprint((dp[0][N - 1]))',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = [0] + list(map(int, input().split()))\\n\\n\\n\\nINF = 10 ** 18\\n\\n\\n\\ndp = [[0] * (N) for _ in range(N)]\\n\\n\\n\\nfor i in range(N):\\n\\n A[i + 1] += A[i]\\n\\n\\n\\nfor j in range(1, N):\\n\\n for i in range(N - j):\\n\\n tmp = INF\\n\\n for k in range(i, i + j):\\n\\n # print (i, i + j, k + 1)\\n\\n tmp = min(tmp, dp[i][k] + dp[k + 1][i + j])\\n\\n dp[i][i + j] = tmp + A[i + j + 1] - A[i]\\n\\n\\n\\nprint((dp[0][N - 1]))\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 432,\n", + " 'code_v1_num_chars': 437,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nA = [0] + list(map(int, input().split()))\\nA = np.array(A, dtype=np.int64)\\nA = np.cumsum(A)\\ndp = np.zeros((N, N), dtype=np.int64)\\nfor j in range(1, N):\\n for i in range(N - j):\\n # print (dp[i, i:i + j], dp[i + 1:i + j + 1, i + j])\\n tmp = min(dp[i, i : i + j] + dp[i + 1 : i + j + 1, i + j])\\n dp[i][i + j] = tmp + A[i + j + 1] - A[i]\\nprint((dp[0][N - 1]))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = [0] + list(map(int, input().split()))\\nINF = 10**18\\ndp = [[0] * (N) for _ in range(N)]\\nfor i in range(N):\\n A[i + 1] += A[i]\\nfor j in range(1, N):\\n for i in range(N - j):\\n tmp = INF\\n for k in range(i, i + j):\\n # print (i, i + j, k + 1)\\n tmp = min(tmp, dp[i][k] + dp[k + 1][i + j])\\n dp[i][i + j] = tmp + A[i + j + 1] - A[i]\\nprint((dp[0][N - 1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.5263157895,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.array(A, dtype=np.int64)',\n", + " '-A = np.cumsum(A)',\n", + " '-dp = np.zeros((N, N), dtype=np.int64)',\n", + " '+INF = 10**18',\n", + " '+dp = [[0] * (N) for _ in range(N)]',\n", + " '+for i in range(N):',\n", + " '+ A[i + 1] += A[i]',\n", + " '- # print (dp[i, i:i + j], dp[i + 1:i + j + 1, i + j])',\n", + " '- tmp = min(dp[i, i : i + j] + dp[i + 1 : i + j + 1, i + j])',\n", + " '+ tmp = INF',\n", + " '+ for k in range(i, i + j):',\n", + " '+ # print (i, i + j, k + 1)',\n", + " '+ tmp = min(tmp, dp[i][k] + dp[k + 1][i + j])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3938372128,\n", + " 'measured_runtime_v1': 0.1987130241,\n", + " 'runtime_lift': 7.0143223816,\n", + " 'key': ['s585052356', 's189629023']},\n", + " {'user_id': 'u886655280',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's576934995',\n", + " 'submission_id_v1': 's588523024',\n", + " 'cpu_time_v0': 174,\n", + " 'cpu_time_v1': 53,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 69.54,\n", + " 'input': \"A, B = list(map(int, input().split()))\\n\\ncount_target = 0\\n\\n\\n\\nfor i in range(A, B + 1):\\n\\n str_i = str(i)\\n\\n reversed_i = ''\\n\\n for n_th_i in reversed(list(range(len(str_i)))):\\n\\n reversed_i += str_i[n_th_i]\\n\\n\\n\\n if str_i == reversed_i:\\n\\n count_target += 1\\n\\n\\n\\nprint(count_target)\",\n", + " 'target': 'A, B = list(map(int, input().split()))\\n\\ncount_target = 0\\n\\n\\n\\nfor i in range(A, B+1):\\n\\n str_i = str(i)\\n\\n reversed_i = str_i[::-1]\\n\\n\\n\\n if str_i == reversed_i:\\n\\n count_target += 1\\n\\n\\n\\nprint(count_target)\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 286,\n", + " 'code_v1_num_chars': 209,\n", + " 'code_v0_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncount_target = 0\\nfor i in range(A, B + 1):\\n str_i = str(i)\\n reversed_i = \"\"\\n for n_th_i in reversed(list(range(len(str_i)))):\\n reversed_i += str_i[n_th_i]\\n if str_i == reversed_i:\\n count_target += 1\\nprint(count_target)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncount_target = 0\\nfor i in range(A, B + 1):\\n str_i = str(i)\\n reversed_i = str_i[::-1]\\n if str_i == reversed_i:\\n count_target += 1\\nprint(count_target)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['- reversed_i = \"\"',\n", + " '- for n_th_i in reversed(list(range(len(str_i)))):',\n", + " '- reversed_i += str_i[n_th_i]',\n", + " '+ reversed_i = str_i[::-1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5743804177,\n", + " 'measured_runtime_v1': 0.3217681063,\n", + " 'runtime_lift': 1.7850756691,\n", + " 'key': ['s576934995', 's588523024']},\n", + " {'user_id': 'u709304134',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's716751946',\n", + " 'submission_id_v1': 's847137300',\n", + " 'cpu_time_v0': 140,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 9172,\n", + " 'memory_v1': 9052,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.43,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(10**7)\\n\\nINF = 10**10\\n\\nMOD = 10**9 + 7\\n\\nX = int(eval(input()))\\n\\nfor i in range(1000):\\n\\n for j in range(-1000,1000):\\n\\n #print (i**5 - j**5)\\n\\n if i**5 - j**5 == X:\\n\\n print((i,j))\\n\\n exit()\\n\\n ',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(10**7)\\n\\nINF = 10**10\\n\\nMOD = 10**9 + 7\\n\\nX = int(eval(input()))\\n\\nMAX_X = 10**9\\n\\nn = 0\\n\\nwhile(1):\\n\\n n+=1\\n\\n if n**5 - (n-1)**5 > MAX_X:\\n\\n break\\n\\nfor i in range(n):\\n\\n for j in range(-n+1,n-1):\\n\\n if i**5 - j**5 == X:\\n\\n print((i,j))\\n\\n exit()\\n\\n ',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 283,\n", + " 'code_v1_num_chars': 339,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(10**7)\\nINF = 10**10\\nMOD = 10**9 + 7\\nX = int(eval(input()))\\nfor i in range(1000):\\n for j in range(-1000, 1000):\\n # print (i**5 - j**5)\\n if i**5 - j**5 == X:\\n print((i, j))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(10**7)\\nINF = 10**10\\nMOD = 10**9 + 7\\nX = int(eval(input()))\\nMAX_X = 10**9\\nn = 0\\nwhile 1:\\n n += 1\\n if n**5 - (n - 1) ** 5 > MAX_X:\\n break\\nfor i in range(n):\\n for j in range(-n + 1, n - 1):\\n if i**5 - j**5 == X:\\n print((i, j))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.7777777778,\n", + " 'diff': ['-for i in range(1000):',\n", + " '- for j in range(-1000, 1000):',\n", + " '- # print (i**5 - j**5)',\n", + " '+MAX_X = 10**9',\n", + " '+n = 0',\n", + " '+while 1:',\n", + " '+ n += 1',\n", + " '+ if n**5 - (n - 1) ** 5 > MAX_X:',\n", + " '+ break',\n", + " '+for i in range(n):',\n", + " '+ for j in range(-n + 1, n - 1):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2435716569,\n", + " 'measured_runtime_v1': 0.1900340259,\n", + " 'runtime_lift': 1.2817265527,\n", + " 'key': ['s716751946', 's847137300']},\n", + " {'user_id': 'u057109575',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's065985582',\n", + " 'submission_id_v1': 's294135268',\n", + " 'cpu_time_v0': 153,\n", + " 'cpu_time_v1': 124,\n", + " 'memory_v0': 79232,\n", + " 'memory_v1': 73392,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.95,\n", + " 'input': '\\n\\nfrom heapq import heappop, heappush\\n\\n\\n\\nX, Y, Z, K = list(map(int, input().split()))\\n\\nA = list(map(int, input().split()))\\n\\nB = list(map(int, input().split()))\\n\\nC = list(map(int, input().split()))\\n\\n\\n\\nA.sort(reverse=True)\\n\\nB.sort(reverse=True)\\n\\nC.sort(reverse=True)\\n\\n\\n\\npq = []\\n\\nheappush(pq, (-A[0] - B[0] - C[0], 0, 0, 0))\\n\\nappeared = set((0, 0, 0))\\n\\n\\n\\nfor _ in range(K):\\n\\n # Pop maximum value\\n\\n val, i, j, k = heappop(pq)\\n\\n print((-val))\\n\\n\\n\\n # Add next value\\n\\n if i + 1 < X and (i + 1, j, k) not in appeared:\\n\\n heappush(pq, (-A[i + 1] - B[j] - C[k], i + 1, j, k))\\n\\n appeared.add((i + 1, j, k))\\n\\n\\n\\n if j + 1 < Y and (i, j + 1, k) not in appeared:\\n\\n heappush(pq, (-A[i] - B[j + 1] - C[k], i, j + 1, k))\\n\\n appeared.add((i, j + 1, k))\\n\\n\\n\\n if k + 1 < Z and (i, j, k + 1) not in appeared:\\n\\n heappush(pq, (-A[i] - B[j] - C[k + 1], i, j, k + 1))\\n\\n appeared.add((i, j, k + 1))\\n',\n", + " 'target': '\\n\\nX, Y, Z, K = list(map(int, input().split()))\\n\\nA = list(map(int, input().split()))\\n\\nB = list(map(int, input().split()))\\n\\nC = list(map(int, input().split()))\\n\\n\\n\\nA.sort(reverse=True)\\n\\nB.sort(reverse=True)\\n\\nC.sort(reverse=True)\\n\\n\\n\\nres = []\\n\\nfor i in range(X):\\n\\n for j in range(Y):\\n\\n for k in range(Z):\\n\\n if (i + 1) * (j + 1) * (k + 1) <= K:\\n\\n res.append(A[i] + B[j] + C[k])\\n\\n else:\\n\\n break\\n\\n\\n\\nres.sort(reverse=True)\\n\\nfor i in range(K):\\n\\n print((res[i]))\\n',\n", + " 'code_v0_loc': 33,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 923,\n", + " 'code_v1_num_chars': 509,\n", + " 'code_v0_no_empty_lines': 'from heapq import heappop, heappush\\n\\nX, Y, Z, K = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nA.sort(reverse=True)\\nB.sort(reverse=True)\\nC.sort(reverse=True)\\npq = []\\nheappush(pq, (-A[0] - B[0] - C[0], 0, 0, 0))\\nappeared = set((0, 0, 0))\\nfor _ in range(K):\\n # Pop maximum value\\n val, i, j, k = heappop(pq)\\n print((-val))\\n # Add next value\\n if i + 1 < X and (i + 1, j, k) not in appeared:\\n heappush(pq, (-A[i + 1] - B[j] - C[k], i + 1, j, k))\\n appeared.add((i + 1, j, k))\\n if j + 1 < Y and (i, j + 1, k) not in appeared:\\n heappush(pq, (-A[i] - B[j + 1] - C[k], i, j + 1, k))\\n appeared.add((i, j + 1, k))\\n if k + 1 < Z and (i, j, k + 1) not in appeared:\\n heappush(pq, (-A[i] - B[j] - C[k + 1], i, j, k + 1))\\n appeared.add((i, j, k + 1))\\n',\n", + " 'code_v1_no_empty_lines': 'X, Y, Z, K = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nA.sort(reverse=True)\\nB.sort(reverse=True)\\nC.sort(reverse=True)\\nres = []\\nfor i in range(X):\\n for j in range(Y):\\n for k in range(Z):\\n if (i + 1) * (j + 1) * (k + 1) <= K:\\n res.append(A[i] + B[j] + C[k])\\n else:\\n break\\nres.sort(reverse=True)\\nfor i in range(K):\\n print((res[i]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-from heapq import heappop, heappush',\n", + " '-',\n", + " '-pq = []',\n", + " '-heappush(pq, (-A[0] - B[0] - C[0], 0, 0, 0))',\n", + " '-appeared = set((0, 0, 0))',\n", + " '-for _ in range(K):',\n", + " '- # Pop maximum value',\n", + " '- val, i, j, k = heappop(pq)',\n", + " '- print((-val))',\n", + " '- # Add next value',\n", + " '- if i + 1 < X and (i + 1, j, k) not in appeared:',\n", + " '- heappush(pq, (-A[i + 1] - B[j] - C[k], i + 1, j, k))',\n", + " '- appeared.add((i + 1, j, k))',\n", + " '- if j + 1 < Y and (i, j + 1, k) not in appeared:',\n", + " '- heappush(pq, (-A[i] - B[j + 1] - C[k], i, j + 1, k))',\n", + " '- appeared.add((i, j + 1, k))',\n", + " '- if k + 1 < Z and (i, j, k + 1) not in appeared:',\n", + " '- heappush(pq, (-A[i] - B[j] - C[k + 1], i, j, k + 1))',\n", + " '- appeared.add((i, j, k + 1))',\n", + " '+res = []',\n", + " '+for i in range(X):',\n", + " '+ for j in range(Y):',\n", + " '+ for k in range(Z):',\n", + " '+ if (i + 1) * (j + 1) * (k + 1) <= K:',\n", + " '+ res.append(A[i] + B[j] + C[k])',\n", + " '+ else:',\n", + " '+ break',\n", + " '+res.sort(reverse=True)',\n", + " '+for i in range(K):',\n", + " '+ print((res[i]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3859105117,\n", + " 'measured_runtime_v1': 0.2075348065,\n", + " 'runtime_lift': 1.8594977789,\n", + " 'key': ['s065985582', 's294135268']},\n", + " {'user_id': 'u092301301',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's709013905',\n", + " 'submission_id_v1': 's416556005',\n", + " 'cpu_time_v0': 482,\n", + " 'cpu_time_v1': 235,\n", + " 'memory_v0': 56536,\n", + " 'memory_v1': 53084,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 51.24,\n", + " 'input': 'n,m=[int(i) for i in input().split()]\\n\\ndp=[1,1] ;a=set() ; mod=(10**9+7)\\n\\nfor i in range(m):\\n\\n a.add(int(eval(input())))\\n\\nif 1 in a: dp[1]=0\\n\\nfor i in range(2,n+1):\\n\\n if i not in a:\\n\\n dp.append((dp[-1]+dp[-2])%mod)\\n\\n else:\\n\\n dp.append(0)\\n\\nprint((dp[-1]))\\n\\n \\n',\n", + " 'target': 'import sys\\n\\ninput = lambda: sys.stdin.readline().rstrip()\\n\\nn,m=[int(i) for i in input().split()]\\n\\ndp=[1,1] ;a=set() ; mod=(10**9+7)\\n\\nfor i in range(m):\\n\\n a.add(int(eval(input())))\\n\\nif 1 in a: dp[1]=0\\n\\nfor i in range(2,n+1):\\n\\n if i not in a:\\n\\n dp.append((dp[-1]+dp[-2])%mod)\\n\\n else:\\n\\n dp.append(0)\\n\\nprint((dp[-1]))\\n\\n \\n',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 276,\n", + " 'code_v1_num_chars': 335,\n", + " 'code_v0_no_empty_lines': 'n, m = [int(i) for i in input().split()]\\ndp = [1, 1]\\na = set()\\nmod = 10**9 + 7\\nfor i in range(m):\\n a.add(int(eval(input())))\\nif 1 in a:\\n dp[1] = 0\\nfor i in range(2, n + 1):\\n if i not in a:\\n dp.append((dp[-1] + dp[-2]) % mod)\\n else:\\n dp.append(0)\\nprint((dp[-1]))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = lambda: sys.stdin.readline().rstrip()\\nn, m = [int(i) for i in input().split()]\\ndp = [1, 1]\\na = set()\\nmod = 10**9 + 7\\nfor i in range(m):\\n a.add(int(eval(input())))\\nif 1 in a:\\n dp[1] = 0\\nfor i in range(2, n + 1):\\n if i not in a:\\n dp.append((dp[-1] + dp[-2]) % mod)\\n else:\\n dp.append(0)\\nprint((dp[-1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '+input = lambda: sys.stdin.readline().rstrip()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1801067755,\n", + " 'measured_runtime_v1': 0.0061562738,\n", + " 'runtime_lift': 29.2558095784,\n", + " 'key': ['s709013905', 's416556005']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's167085688',\n", + " 'submission_id_v1': 's483261544',\n", + " 'cpu_time_v0': 534,\n", + " 'cpu_time_v1': 70,\n", + " 'memory_v0': 14552,\n", + " 'memory_v1': 3572,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.89,\n", + " 'input': '# x < yでyが不要とする。y抜きで[K-y,K)を作れる。\\n\\n# このときにxを使っていないのならば、xも不要。\\n\\n# xを使っているのならば、xy抜きで[K-x-y,K-x)を作れる。\\n\\n# yを加えて、x抜きで[K-x,K)を作れる。\\n\\n# よってy不要ならばx不要。\\n\\nimport numpy as np\\n\\nimport itertools\\n\\n\\n\\nN,K = list(map(int,input().split()))\\n\\nA = [int(x) for x in input().split()]\\n\\nA.sort()\\n\\n\\n\\n# カードは[0,N)-indexed\\n\\n\\n\\ndef test(i):\\n\\n # i番目のカードは不要\\n\\n dp = np.zeros(K,dtype=np.bool)\\n\\n dp[0] = True\\n\\n for a in itertools.chain(A[:i],A[i+1:]):\\n\\n dp[a:] = np.logical_or(dp[a:],dp[:-a])\\n\\n return not dp[-A[i]:].any()\\n\\n\\n\\nleft = -1 # 不要だと判明\\n\\nright = N # 不要でないと判明\\n\\nwhile right - left > 1:\\n\\n mid = (left+right)//2\\n\\n if test(mid):\\n\\n left = mid\\n\\n else:\\n\\n right = mid\\n\\n\\n\\n \\n\\nanswer = left+1\\n\\nprint(answer)',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nimport itertools\\n\\n\\n\\n\"\"\"\\n\\n・「必要」とは～～が存在\\n\\n・x を含まない、[K-x,K) 内の総和が存在\\n\\n・集合を指定すると、ある値段より上側\\n\\n・全体としても単調性がある\\n\\n\"\"\"\\n\\n\\n\\nN,K,*A = list(map(int,read().split()))\\n\\n\\n\\nA = [x if x <= K else K + 1 for x in A]\\n\\nA.sort()\\n\\n\\n\\nmask = (1 << K) - 1\\n\\n\\n\\ndef test(x):\\n\\n # x番目は必要\\n\\n if A[x] > K:\\n\\n return True\\n\\n dp = 1\\n\\n for a in itertools.chain(A[:x], A[x+1:]):\\n\\n dp |= (dp << a)\\n\\n dp &= mask\\n\\n dp >>= (K - A[x])\\n\\n return (dp > 0)\\n\\n\\n\\nleft = -1 # 必要\\n\\nright = N # 不要\\n\\nwhile left + 1 < right:\\n\\n x = (left + right) // 2\\n\\n if test(x):\\n\\n right = x\\n\\n else:\\n\\n left = x\\n\\n\\n\\nanswer = left + 1\\n\\nprint(answer)\\n',\n", + " 'code_v0_loc': 34,\n", + " 'code_v1_loc': 43,\n", + " 'code_v0_num_chars': 676,\n", + " 'code_v1_num_chars': 744,\n", + " 'code_v0_no_empty_lines': '# x < yでyが不要とする。y抜きで[K-y,K)を作れる。\\n# このときにxを使っていないのならば、xも不要。\\n# xを使っているのならば、xy抜きで[K-x-y,K-x)を作れる。\\n# yを加えて、x抜きで[K-x,K)を作れる。\\n# よってy不要ならばx不要。\\nimport numpy as np\\nimport itertools\\n\\nN, K = list(map(int, input().split()))\\nA = [int(x) for x in input().split()]\\nA.sort()\\n# カードは[0,N)-indexed\\ndef test(i):\\n # i番目のカードは不要\\n dp = np.zeros(K, dtype=np.bool)\\n dp[0] = True\\n for a in itertools.chain(A[:i], A[i + 1 :]):\\n dp[a:] = np.logical_or(dp[a:], dp[:-a])\\n return not dp[-A[i] :].any()\\n\\n\\nleft = -1 # 不要だと判明\\nright = N # 不要でないと判明\\nwhile right - left > 1:\\n mid = (left + right) // 2\\n if test(mid):\\n left = mid\\n else:\\n right = mid\\nanswer = left + 1\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nimport itertools\\n\\n\"\"\"\\n・「必要」とは～～が存在\\n・x を含まない、[K-x,K) 内の総和が存在\\n・集合を指定すると、ある値段より上側\\n・全体としても単調性がある\\n\"\"\"\\nN, K, *A = list(map(int, read().split()))\\nA = [x if x <= K else K + 1 for x in A]\\nA.sort()\\nmask = (1 << K) - 1\\n\\n\\ndef test(x):\\n # x番目は必要\\n if A[x] > K:\\n return True\\n dp = 1\\n for a in itertools.chain(A[:x], A[x + 1 :]):\\n dp |= dp << a\\n dp &= mask\\n dp >>= K - A[x]\\n return dp > 0\\n\\n\\nleft = -1 # 必要\\nright = N # 不要\\nwhile left + 1 < right:\\n x = (left + right) // 2\\n if test(x):\\n right = x\\n else:\\n left = x\\nanswer = left + 1\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.9302325581,\n", + " 'diff': ['-# x < yでyが不要とする。y抜きで[K-y,K)を作れる。',\n", + " '-# このときにxを使っていないのならば、xも不要。',\n", + " '-# xを使っているのならば、xy抜きで[K-x-y,K-x)を作れる。',\n", + " '-# yを加えて、x抜きで[K-x,K)を作れる。',\n", + " '-# よってy不要ならばx不要。',\n", + " '-import numpy as np',\n", + " '+import sys',\n", + " '+',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '-N, K = list(map(int, input().split()))',\n", + " '-A = [int(x) for x in input().split()]',\n", + " '+\"\"\"',\n", + " '+・「必要」とは～～が存在',\n", + " '+・x を含まない、[K-x,K) 内の総和が存在',\n", + " '+・集合を指定すると、ある値段より上側',\n", + " '+・全体としても単調性がある',\n", + " '+\"\"\"',\n", + " '+N, K, *A = list(map(int, read().split()))',\n", + " '+A = [x if x <= K else K + 1 for x in A]',\n", + " '-# カードは[0,N)-indexed',\n", + " '-def test(i):',\n", + " '- # i番目のカードは不要',\n", + " '- dp = np.zeros(K, dtype=np.bool)',\n", + " '- dp[0] = True',\n", + " '- for a in itertools.chain(A[:i], A[i + 1 :]):',\n", + " '- dp[a:] = np.logical_or(dp[a:], dp[:-a])',\n", + " '- return not dp[-A[i] :].any()',\n", + " '+mask = (1 << K) - 1',\n", + " '-left = -1 # 不要だと判明',\n", + " '-right = N # 不要でないと判明',\n", + " '-while right - left > 1:',\n", + " '- mid = (left + right) // 2',\n", + " '- if test(mid):',\n", + " '- left = mid',\n", + " '+def test(x):',\n", + " '+ # x番目は必要',\n", + " '+ if A[x] > K:',\n", + " '+ return True',\n", + " '+ dp = 1',\n", + " '+ for a in itertools.chain(A[:x], A[x + 1 :]):',\n", + " '+ dp |= dp << a',\n", + " '+ dp &= mask',\n", + " '+ dp >>= K - A[x]',\n", + " '+ return dp > 0',\n", + " '+',\n", + " '+',\n", + " '+left = -1 # 必要',\n", + " '+right = N # 不要',\n", + " '+while left + 1 < right:',\n", + " '+ x = (left + right) // 2',\n", + " '+ if test(x):',\n", + " '+ right = x',\n", + " '- right = mid',\n", + " '+ left = x'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 3.0458679354,\n", + " 'measured_runtime_v1': 0.4234246819,\n", + " 'runtime_lift': 7.1934114036,\n", + " 'key': ['s167085688', 's483261544']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p02837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's091639988',\n", + " 'submission_id_v1': 's838166037',\n", + " 'cpu_time_v0': 602,\n", + " 'cpu_time_v1': 120,\n", + " 'memory_v0': 12496,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.07,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nn = int(sys.stdin.readline().rstrip())\\n\\nx = []\\n\\ny = []\\n\\nfor i in range(n):\\n\\n a = int(sys.stdin.readline().rstrip())\\n\\n xy = [sys.stdin.readline().split() for _ in range(a)]\\n\\n if not xy:\\n\\n x.append(None)\\n\\n y.append(None)\\n\\n continue\\n\\n xi, yi = np.array(xy, np.int64).T\\n\\n x.append(xi-1)\\n\\n y.append(yi)\\n\\n\\n\\ndef main():\\n\\n\\n\\n ans = 0\\n\\n for comb in range(2 ** n):\\n\\n cnt = 0\\n\\n for i in range(n):\\n\\n if not comb >> i & 1:\\n\\n continue\\n\\n if x[i] is None:\\n\\n cnt += 1\\n\\n continue\\n\\n if np.count_nonzero(comb >> x[i] & 1 ^ y[i]):\\n\\n break\\n\\n cnt += 1\\n\\n else:\\n\\n ans = max(ans, cnt)\\n\\n return ans\\n\\n \\n\\nif __name__ == '__main__':\\n\\n ans = main()\\n\\n print(ans)\",\n", + " 'target': \"import sys\\n\\n\\n\\nn = int(sys.stdin.readline().rstrip())\\n\\nxy = [[] for _ in range(n)]\\n\\nfor i in range(n):\\n\\n a = int(sys.stdin.readline().rstrip())\\n\\n for j in range(a):\\n\\n x, y = list(map(int, sys.stdin.readline().split()))\\n\\n xy[i].append((x-1, y))\\n\\n\\n\\ndef main():\\n\\n ans = 0\\n\\n for comb in range(2 ** n):\\n\\n cnt = 0\\n\\n for i in range(n):\\n\\n if comb >> i & 1 ^ 1:\\n\\n continue\\n\\n for x, y in xy[i]:\\n\\n if comb >> x & 1 ^ y:\\n\\n break\\n\\n else:\\n\\n cnt += 1\\n\\n continue\\n\\n break\\n\\n else:\\n\\n ans = max(ans, cnt)\\n\\n return ans\\n\\n \\n\\nif __name__ == '__main__':\\n\\n ans = main()\\n\\n print(ans)\",\n", + " 'code_v0_loc': 38,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 868,\n", + " 'code_v1_num_chars': 754,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nn = int(sys.stdin.readline().rstrip())\\nx = []\\ny = []\\nfor i in range(n):\\n a = int(sys.stdin.readline().rstrip())\\n xy = [sys.stdin.readline().split() for _ in range(a)]\\n if not xy:\\n x.append(None)\\n y.append(None)\\n continue\\n xi, yi = np.array(xy, np.int64).T\\n x.append(xi - 1)\\n y.append(yi)\\n\\n\\ndef main():\\n ans = 0\\n for comb in range(2**n):\\n cnt = 0\\n for i in range(n):\\n if not comb >> i & 1:\\n continue\\n if x[i] is None:\\n cnt += 1\\n continue\\n if np.count_nonzero(comb >> x[i] & 1 ^ y[i]):\\n break\\n cnt += 1\\n else:\\n ans = max(ans, cnt)\\n return ans\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nn = int(sys.stdin.readline().rstrip())\\nxy = [[] for _ in range(n)]\\nfor i in range(n):\\n a = int(sys.stdin.readline().rstrip())\\n for j in range(a):\\n x, y = list(map(int, sys.stdin.readline().split()))\\n xy[i].append((x - 1, y))\\n\\n\\ndef main():\\n ans = 0\\n for comb in range(2**n):\\n cnt = 0\\n for i in range(n):\\n if comb >> i & 1 ^ 1:\\n continue\\n for x, y in xy[i]:\\n if comb >> x & 1 ^ y:\\n break\\n else:\\n cnt += 1\\n continue\\n break\\n else:\\n ans = max(ans, cnt)\\n return ans\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.4210526316,\n", + " 'diff': ['-import numpy as np',\n", + " '-x = []',\n", + " '-y = []',\n", + " '+xy = [[] for _ in range(n)]',\n", + " '- xy = [sys.stdin.readline().split() for _ in range(a)]',\n", + " '- if not xy:',\n", + " '- x.append(None)',\n", + " '- y.append(None)',\n", + " '- continue',\n", + " '- xi, yi = np.array(xy, np.int64).T',\n", + " '- x.append(xi - 1)',\n", + " '- y.append(yi)',\n", + " '+ for j in range(a):',\n", + " '+ x, y = list(map(int, sys.stdin.readline().split()))',\n", + " '+ xy[i].append((x - 1, y))',\n", + " '- if not comb >> i & 1:',\n", + " '+ if comb >> i & 1 ^ 1:',\n", + " '- if x[i] is None:',\n", + " '+ for x, y in xy[i]:',\n", + " '+ if comb >> x & 1 ^ y:',\n", + " '+ break',\n", + " '+ else:',\n", + " '- if np.count_nonzero(comb >> x[i] & 1 ^ y[i]):',\n", + " '- break',\n", + " '- cnt += 1',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7658371491,\n", + " 'measured_runtime_v1': 0.3071119606,\n", + " 'runtime_lift': 5.7498156221,\n", + " 'key': ['s091639988', 's838166037']},\n", + " {'user_id': 'u753589982',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's918408995',\n", + " 'submission_id_v1': 's703264591',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3064,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'N, L = [int(i) for i in input().split()]\\n\\n\\n\\nmin_ = L\\n\\nmax_ = L + N -1\\n\\n\\n\\ndef eat_apple():\\n\\n if max_<0:\\n\\n return max_ \\n\\n if L < 0:\\n\\n return 0\\n\\n return L\\n\\n\\n\\nprint(((min_+max_)*(max_-min_+1)//2 - eat_apple()))',\n", + " 'target': 'N, L = [int(i) for i in input().split()]\\n\\n\\n\\nmin_ = L\\n\\nmax_ = L + N -1\\n\\n\\n\\ndef eat_apple(N, L, max_):\\n\\n if max_<0:\\n\\n return max_ \\n\\n if L < 0:\\n\\n return 0\\n\\n return L\\n\\n\\n\\nprint(((min_+max_)*(max_-min_+1)//2 - eat_apple(N, L, max_)))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 227,\n", + " 'code_v1_num_chars': 247,\n", + " 'code_v0_no_empty_lines': 'N, L = [int(i) for i in input().split()]\\nmin_ = L\\nmax_ = L + N - 1\\n\\n\\ndef eat_apple():\\n if max_ < 0:\\n return max_\\n if L < 0:\\n return 0\\n return L\\n\\n\\nprint(((min_ + max_) * (max_ - min_ + 1) // 2 - eat_apple()))\\n',\n", + " 'code_v1_no_empty_lines': 'N, L = [int(i) for i in input().split()]\\nmin_ = L\\nmax_ = L + N - 1\\n\\n\\ndef eat_apple(N, L, max_):\\n if max_ < 0:\\n return max_\\n if L < 0:\\n return 0\\n return L\\n\\n\\nprint(((min_ + max_) * (max_ - min_ + 1) // 2 - eat_apple(N, L, max_)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-def eat_apple():',\n", + " '+def eat_apple(N, L, max_):',\n", + " '-print(((min_ + max_) * (max_ - min_ + 1) // 2 - eat_apple()))',\n", + " '+print(((min_ + max_) * (max_ - min_ + 1) // 2 - eat_apple(N, L, max_)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2025646191,\n", + " 'measured_runtime_v1': 0.0060813091,\n", + " 'runtime_lift': 33.309377317,\n", + " 'key': ['s918408995', 's703264591']},\n", + " {'user_id': 'u216928054',\n", + " 'problem_id': 'p02560',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's978863609',\n", + " 'submission_id_v1': 's598945859',\n", + " 'cpu_time_v0': 297,\n", + " 'cpu_time_v1': 234,\n", + " 'memory_v0': 78412,\n", + " 'memory_v1': 70336,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.21,\n", + " 'input': '#!/usr/bin/env python3\\n\\nimport sys\\n\\nsys.setrecursionlimit(10**6)\\n\\nINF = 10 ** 9 + 1 # sys.maxsize # float(\"inf\")\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\n\\n\\ndef floor_sum(n, m, a, b):\\n\\n ret = 0\\n\\n if a >= m:\\n\\n ret += (n - 1) * n * (a // m) // 2\\n\\n a %= m\\n\\n if b >= m:\\n\\n ret += n * (b // m)\\n\\n b %= m\\n\\n y_max = (a * n + b) // m\\n\\n x_max = y_max * m - b\\n\\n if y_max == 0:\\n\\n return ret\\n\\n ret += (n - (x_max + a - 1) // a) * y_max\\n\\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\\n\\n return ret\\n\\n\\n\\n\\n\\ndef debug(*x):\\n\\n print(*x, file=sys.stderr)\\n\\n\\n\\n\\n\\ndef solve(SOLVE_PARAMS):\\n\\n pass\\n\\n\\n\\n\\n\\ndef main():\\n\\n # parse input\\n\\n T = int(input())\\n\\n for _t in range(T):\\n\\n N, M, A, B = map(int, input().split())\\n\\n print(floor_sum(N, M, A, B))\\n\\n\\n\\n\\n\\n# tests\\n\\nT1 = \"\"\"\\n\\n5\\n\\n4 10 6 3\\n\\n6 5 4 3\\n\\n1 1 0 0\\n\\n31415 92653 58979 32384\\n\\n1000000000 1000000000 999999999 999999999\\n\\n\"\"\"\\n\\nTEST_T1 = \"\"\"\\n\\n>>> as_input(T1)\\n\\n>>> main()\\n\\n3\\n\\n13\\n\\n0\\n\\n314095480\\n\\n499999999500000000\\n\\n\"\"\"\\n\\n\\n\\n\\n\\ndef _test():\\n\\n import doctest\\n\\n doctest.testmod()\\n\\n g = globals()\\n\\n for k in sorted(g):\\n\\n if k.startswith(\"TEST_\"):\\n\\n doctest.run_docstring_examples(g[k], g, name=k)\\n\\n\\n\\n\\n\\ndef as_input(s):\\n\\n \"use in test, use given string as input file\"\\n\\n import io\\n\\n f = io.StringIO(s.strip())\\n\\n g = globals()\\n\\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\\n\\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\\n\\n\\n\\n\\n\\ninput = sys.stdin.buffer.readline\\n\\nread = sys.stdin.buffer.read\\n\\n\\n\\nif sys.argv[-1] == \"-t\":\\n\\n print(\"testing\")\\n\\n _test()\\n\\n sys.exit()\\n\\n\\n\\nmain()\\n',\n", + " 'target': '#!/usr/bin/env python3\\n\\nimport sys\\n\\nsys.setrecursionlimit(10**6)\\n\\nINF = 10 ** 9 + 1 # sys.maxsize # float(\"inf\")\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\n\\n\\ndef floor_sum_1(n, m, a, b):\\n\\n ret = 0\\n\\n if a >= m:\\n\\n ret += (n - 1) * n * (a // m) // 2\\n\\n a %= m\\n\\n if b >= m:\\n\\n ret += n * (b // m)\\n\\n b %= m\\n\\n y_max = (a * n + b) // m\\n\\n x_max = y_max * m - b\\n\\n if y_max == 0:\\n\\n return ret\\n\\n ret += (n - (x_max + a - 1) // a) * y_max\\n\\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\\n\\n return ret\\n\\n\\n\\n\\n\\ndef floor_sum(n, m, a, b):\\n\\n ret = 0\\n\\n while True:\\n\\n if a >= m:\\n\\n ret += (n - 1) * n * (a // m) // 2\\n\\n a %= m\\n\\n if b >= m:\\n\\n ret += n * (b // m)\\n\\n b %= m\\n\\n y_max = (a * n + b) // m\\n\\n x_max = y_max * m - b\\n\\n if y_max == 0:\\n\\n return ret\\n\\n ret += (n - (x_max + a - 1) // a) * y_max\\n\\n n = y_max\\n\\n m, a, b = a, m, (a - x_max % a) % a\\n\\n\\n\\n\\n\\ndef debug(*x):\\n\\n print(*x, file=sys.stderr)\\n\\n\\n\\n\\n\\ndef solve(SOLVE_PARAMS):\\n\\n pass\\n\\n\\n\\n\\n\\ndef main():\\n\\n # parse input\\n\\n T = int(input())\\n\\n for _t in range(T):\\n\\n N, M, A, B = map(int, input().split())\\n\\n print(floor_sum(N, M, A, B))\\n\\n\\n\\n\\n\\n# tests\\n\\nT1 = \"\"\"\\n\\n5\\n\\n4 10 6 3\\n\\n6 5 4 3\\n\\n1 1 0 0\\n\\n31415 92653 58979 32384\\n\\n1000000000 1000000000 999999999 999999999\\n\\n\"\"\"\\n\\nTEST_T1 = \"\"\"\\n\\n>>> as_input(T1)\\n\\n>>> main()\\n\\n3\\n\\n13\\n\\n0\\n\\n314095480\\n\\n499999999500000000\\n\\n\"\"\"\\n\\n\\n\\n\\n\\ndef _test():\\n\\n import doctest\\n\\n doctest.testmod()\\n\\n g = globals()\\n\\n for k in sorted(g):\\n\\n if k.startswith(\"TEST_\"):\\n\\n doctest.run_docstring_examples(g[k], g, name=k)\\n\\n\\n\\n\\n\\ndef as_input(s):\\n\\n \"use in test, use given string as input file\"\\n\\n import io\\n\\n f = io.StringIO(s.strip())\\n\\n g = globals()\\n\\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\\n\\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\\n\\n\\n\\n\\n\\ninput = sys.stdin.buffer.readline\\n\\nread = sys.stdin.buffer.read\\n\\n\\n\\nif sys.argv[-1] == \"-t\":\\n\\n print(\"testing\")\\n\\n _test()\\n\\n sys.exit()\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 87,\n", + " 'code_v1_loc': 105,\n", + " 'code_v0_num_chars': 1613,\n", + " 'code_v1_num_chars': 2066,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\n\\nsys.setrecursionlimit(10**6)\\nINF = 10**9 + 1 # sys.maxsize # float(\"inf\")\\nMOD = 10**9 + 7\\n\\n\\ndef floor_sum(n, m, a, b):\\n ret = 0\\n if a >= m:\\n ret += (n - 1) * n * (a // m) // 2\\n a %= m\\n if b >= m:\\n ret += n * (b // m)\\n b %= m\\n y_max = (a * n + b) // m\\n x_max = y_max * m - b\\n if y_max == 0:\\n return ret\\n ret += (n - (x_max + a - 1) // a) * y_max\\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\\n return ret\\n\\n\\ndef debug(*x):\\n print(*x, file=sys.stderr)\\n\\n\\ndef solve(SOLVE_PARAMS):\\n pass\\n\\n\\ndef main():\\n # parse input\\n T = int(input())\\n for _t in range(T):\\n N, M, A, B = map(int, input().split())\\n print(floor_sum(N, M, A, B))\\n\\n\\n# tests\\nT1 = \"\"\"\\n5\\n4 10 6 3\\n6 5 4 3\\n1 1 0 0\\n31415 92653 58979 32384\\n1000000000 1000000000 999999999 999999999\\n\"\"\"\\nTEST_T1 = \"\"\"\\n>>> as_input(T1)\\n>>> main()\\n3\\n13\\n0\\n314095480\\n499999999500000000\\n\"\"\"\\n\\n\\ndef _test():\\n import doctest\\n\\n doctest.testmod()\\n g = globals()\\n for k in sorted(g):\\n if k.startswith(\"TEST_\"):\\n doctest.run_docstring_examples(g[k], g, name=k)\\n\\n\\ndef as_input(s):\\n \"use in test, use given string as input file\"\\n import io\\n\\n f = io.StringIO(s.strip())\\n g = globals()\\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\\n\\n\\ninput = sys.stdin.buffer.readline\\nread = sys.stdin.buffer.read\\nif sys.argv[-1] == \"-t\":\\n print(\"testing\")\\n _test()\\n sys.exit()\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\n\\nsys.setrecursionlimit(10**6)\\nINF = 10**9 + 1 # sys.maxsize # float(\"inf\")\\nMOD = 10**9 + 7\\n\\n\\ndef floor_sum_1(n, m, a, b):\\n ret = 0\\n if a >= m:\\n ret += (n - 1) * n * (a // m) // 2\\n a %= m\\n if b >= m:\\n ret += n * (b // m)\\n b %= m\\n y_max = (a * n + b) // m\\n x_max = y_max * m - b\\n if y_max == 0:\\n return ret\\n ret += (n - (x_max + a - 1) // a) * y_max\\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\\n return ret\\n\\n\\ndef floor_sum(n, m, a, b):\\n ret = 0\\n while True:\\n if a >= m:\\n ret += (n - 1) * n * (a // m) // 2\\n a %= m\\n if b >= m:\\n ret += n * (b // m)\\n b %= m\\n y_max = (a * n + b) // m\\n x_max = y_max * m - b\\n if y_max == 0:\\n return ret\\n ret += (n - (x_max + a - 1) // a) * y_max\\n n = y_max\\n m, a, b = a, m, (a - x_max % a) % a\\n\\n\\ndef debug(*x):\\n print(*x, file=sys.stderr)\\n\\n\\ndef solve(SOLVE_PARAMS):\\n pass\\n\\n\\ndef main():\\n # parse input\\n T = int(input())\\n for _t in range(T):\\n N, M, A, B = map(int, input().split())\\n print(floor_sum(N, M, A, B))\\n\\n\\n# tests\\nT1 = \"\"\"\\n5\\n4 10 6 3\\n6 5 4 3\\n1 1 0 0\\n31415 92653 58979 32384\\n1000000000 1000000000 999999999 999999999\\n\"\"\"\\nTEST_T1 = \"\"\"\\n>>> as_input(T1)\\n>>> main()\\n3\\n13\\n0\\n314095480\\n499999999500000000\\n\"\"\"\\n\\n\\ndef _test():\\n import doctest\\n\\n doctest.testmod()\\n g = globals()\\n for k in sorted(g):\\n if k.startswith(\"TEST_\"):\\n doctest.run_docstring_examples(g[k], g, name=k)\\n\\n\\ndef as_input(s):\\n \"use in test, use given string as input file\"\\n import io\\n\\n f = io.StringIO(s.strip())\\n g = globals()\\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\\n\\n\\ninput = sys.stdin.buffer.readline\\nread = sys.stdin.buffer.read\\nif sys.argv[-1] == \"-t\":\\n print(\"testing\")\\n _test()\\n sys.exit()\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.1428571429,\n", + " 'diff': ['-def floor_sum(n, m, a, b):',\n", + " '+def floor_sum_1(n, m, a, b):',\n", + " '+',\n", + " '+',\n", + " '+def floor_sum(n, m, a, b):',\n", + " '+ ret = 0',\n", + " '+ while True:',\n", + " '+ if a >= m:',\n", + " '+ ret += (n - 1) * n * (a // m) // 2',\n", + " '+ a %= m',\n", + " '+ if b >= m:',\n", + " '+ ret += n * (b // m)',\n", + " '+ b %= m',\n", + " '+ y_max = (a * n + b) // m',\n", + " '+ x_max = y_max * m - b',\n", + " '+ if y_max == 0:',\n", + " '+ return ret',\n", + " '+ ret += (n - (x_max + a - 1) // a) * y_max',\n", + " '+ n = y_max',\n", + " '+ m, a, b = a, m, (a - x_max % a) % a'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1788789105,\n", + " 'measured_runtime_v1': 0.0066359096,\n", + " 'runtime_lift': 26.9562007629,\n", + " 'key': ['s978863609', 's598945859']},\n", + " {'user_id': 'u813450984',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's722861535',\n", + " 'submission_id_v1': 's015018251',\n", + " 'cpu_time_v0': 77,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 77.92,\n", + " 'input': 'a, b, c, x, y = list(map(int, input().split()))\\n\\nans = a * x + b * y\\n\\nm = max(x, y)\\n\\nfor i in range(1, m+1):\\n\\n x -= 1\\n\\n y -= 1\\n\\n if x < 0:\\n\\n x = 0\\n\\n if y < 0:\\n\\n y = 0\\n\\n temp = c*(i*2) + x*a + y*b\\n\\n if temp < ans:\\n\\n ans = temp\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': 'a, b, c, x, y = list(map(int, input().split()))\\n\\nans = a * x + b * y\\n\\nans = min(c * max(x, y) * 2, ans)\\n\\nif x < y:\\n\\n ans = min(c * x * 2 + (y - x) * b, ans)\\n\\nelse:\\n\\n ans = min(c * y * 2 + (x - y) * a, ans)\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 249,\n", + " 'code_v1_num_chars': 219,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = a * x + b * y\\nm = max(x, y)\\nfor i in range(1, m + 1):\\n x -= 1\\n y -= 1\\n if x < 0:\\n x = 0\\n if y < 0:\\n y = 0\\n temp = c * (i * 2) + x * a + y * b\\n if temp < ans:\\n ans = temp\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nans = a * x + b * y\\nans = min(c * max(x, y) * 2, ans)\\nif x < y:\\n ans = min(c * x * 2 + (y - x) * b, ans)\\nelse:\\n ans = min(c * y * 2 + (x - y) * a, ans)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 40.0,\n", + " 'diff': ['-m = max(x, y)',\n", + " '-for i in range(1, m + 1):',\n", + " '- x -= 1',\n", + " '- y -= 1',\n", + " '- if x < 0:',\n", + " '- x = 0',\n", + " '- if y < 0:',\n", + " '- y = 0',\n", + " '- temp = c * (i * 2) + x * a + y * b',\n", + " '- if temp < ans:',\n", + " '- ans = temp',\n", + " '+ans = min(c * max(x, y) * 2, ans)',\n", + " '+if x < y:',\n", + " '+ ans = min(c * x * 2 + (y - x) * b, ans)',\n", + " '+else:',\n", + " '+ ans = min(c * y * 2 + (x - y) * a, ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2966257923,\n", + " 'measured_runtime_v1': 0.2002350025,\n", + " 'runtime_lift': 1.4813883113,\n", + " 'key': ['s722861535', 's015018251']},\n", + " {'user_id': 'u271934630',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's986292698',\n", + " 'submission_id_v1': 's820058882',\n", + " 'cpu_time_v0': 225,\n", + " 'cpu_time_v1': 186,\n", + " 'memory_v0': 40684,\n", + " 'memory_v1': 40300,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.33,\n", + " 'input': 'A, B = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor i in range(A, B+1):\\n\\n l = list(str(i))\\n\\n\\n\\n if l == list(reversed(l)):\\n\\n cnt += 1\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'target': 'A, B = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor i in range(A, B+1):\\n\\n l = str(i)\\n\\n if l == l[::-1]:\\n\\n cnt += 1\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 155,\n", + " 'code_v1_num_chars': 137,\n", + " 'code_v0_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(A, B + 1):\\n l = list(str(i))\\n if l == list(reversed(l)):\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B = list(map(int, input().split()))\\ncnt = 0\\nfor i in range(A, B + 1):\\n l = str(i)\\n if l == l[::-1]:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['- l = list(str(i))',\n", + " '- if l == list(reversed(l)):',\n", + " '+ l = str(i)',\n", + " '+ if l == l[::-1]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3457211592,\n", + " 'measured_runtime_v1': 0.2683477015,\n", + " 'runtime_lift': 1.2883328503,\n", + " 'key': ['s986292698', 's820058882']},\n", + " {'user_id': 'u532966492',\n", + " 'problem_id': 'p03039',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's814969347',\n", + " 'submission_id_v1': 's884180243',\n", + " 'cpu_time_v0': 555,\n", + " 'cpu_time_v1': 399,\n", + " 'memory_v0': 27096,\n", + " 'memory_v1': 3192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.11,\n", + " 'input': 'def cmb(n, r, mod):\\n\\n if ( r<0 or r>n ):\\n\\n return 0\\n\\n r = min(r, n-r)\\n\\n return g1[n] * g2[r] * g2[n-r] % mod\\n\\n\\n\\nA=2*10**5\\n\\nmod = 10**9+7\\n\\ng1 = [1, 1]\\n\\ng2 = [1, 1]\\n\\ninverse = [0, 1]\\n\\n\\n\\nfor i in range( 2, A + 1 ):\\n\\n g1.append( ( g1[-1] * i ) % mod )\\n\\n inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )\\n\\n g2.append( (g2[-1] * inverse[-1]) % mod )\\n\\n\\n\\nN,M,K=list(map(int,input().split()))\\n\\nkeisuu=cmb(N*M-2,K-2,mod)\\n\\n\\n\\nsum_=0\\n\\nfor i in range(N):\\n\\n a=min(abs(i),abs(N-i-1))\\n\\n b=max(abs(i),abs(N-i-1))\\n\\n sum_+=(M**2)*((a*(a+1)//2)+(b*(b+1)//2))\\n\\nfor i in range(M):\\n\\n a=min(abs(i),abs(M-i-1))\\n\\n b=max(abs(i),abs(M-i-1))\\n\\n sum_+=(N**2)*((a*(a+1)//2)+(b*(b+1)//2))\\n\\nprint(((keisuu * (sum_//2))%mod))',\n", + " 'target': 'def power_mod(a,b,mod=10**9+7):\\n\\n i,temp,box=0,b,[]\\n\\n while(2**i<=b):\\n\\n i+=1\\n\\n for j in range(i-1,-1,-1):\\n\\n box=[[j,temp//2**j]]+box\\n\\n temp-=2**j*(temp//2**j)\\n\\n box[0].append(a)\\n\\n ans=box[0][1]*a%mod\\n\\n for j in range(1,i):\\n\\n box[j].append(box[j-1][2]**2%mod)\\n\\n if box[j][1]==1:\\n\\n ans=(ans*box[j][2])%mod\\n\\n return ans\\n\\ndef n_func(n,mod=10**9+7):\\n\\n ans=1\\n\\n for i in range(1,n+1):\\n\\n ans=(ans*i)%mod\\n\\n return ans\\n\\ndef nPr(n,r,mod=10**9+7):\\n\\n ans=n_func(n-r,mod)\\n\\n ans=power_mod(ans,mod-2,mod)\\n\\n return ans*n_func(n,mod)%mod\\n\\ndef nCr(n,r,mod=10**9+7):\\n\\n ans=n_func(n-r,mod)*n_func(r,mod)%mod\\n\\n ans=power_mod(ans,mod-2,mod)\\n\\n return ans*n_func(n,mod)%mod\\n\\n\\n\\nN,M,K=list(map(int,input().split()))\\n\\nkeisuu=nCr(N*M-2,K-2)\\n\\nmod=10**9+7\\n\\n\\n\\nsum_=0\\n\\nfor i in range(N):\\n\\n a=min(abs(i),abs(N-i-1))\\n\\n b=max(abs(i),abs(N-i-1))\\n\\n sum_+=(M**2)*((a*(a+1)//2)+(b*(b+1)//2))\\n\\nfor i in range(M):\\n\\n a=min(abs(i),abs(M-i-1))\\n\\n b=max(abs(i),abs(M-i-1))\\n\\n sum_+=(N**2)*((a*(a+1)//2)+(b*(b+1)//2))\\n\\nprint(((keisuu * (sum_//2))%mod))',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 42,\n", + " 'code_v0_num_chars': 731,\n", + " 'code_v1_num_chars': 1114,\n", + " 'code_v0_no_empty_lines': 'def cmb(n, r, mod):\\n if r < 0 or r > n:\\n return 0\\n r = min(r, n - r)\\n return g1[n] * g2[r] * g2[n - r] % mod\\n\\n\\nA = 2 * 10**5\\nmod = 10**9 + 7\\ng1 = [1, 1]\\ng2 = [1, 1]\\ninverse = [0, 1]\\nfor i in range(2, A + 1):\\n g1.append((g1[-1] * i) % mod)\\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\\n g2.append((g2[-1] * inverse[-1]) % mod)\\nN, M, K = list(map(int, input().split()))\\nkeisuu = cmb(N * M - 2, K - 2, mod)\\nsum_ = 0\\nfor i in range(N):\\n a = min(abs(i), abs(N - i - 1))\\n b = max(abs(i), abs(N - i - 1))\\n sum_ += (M**2) * ((a * (a + 1) // 2) + (b * (b + 1) // 2))\\nfor i in range(M):\\n a = min(abs(i), abs(M - i - 1))\\n b = max(abs(i), abs(M - i - 1))\\n sum_ += (N**2) * ((a * (a + 1) // 2) + (b * (b + 1) // 2))\\nprint(((keisuu * (sum_ // 2)) % mod))\\n',\n", + " 'code_v1_no_empty_lines': 'def power_mod(a, b, mod=10**9 + 7):\\n i, temp, box = 0, b, []\\n while 2**i <= b:\\n i += 1\\n for j in range(i - 1, -1, -1):\\n box = [[j, temp // 2**j]] + box\\n temp -= 2**j * (temp // 2**j)\\n box[0].append(a)\\n ans = box[0][1] * a % mod\\n for j in range(1, i):\\n box[j].append(box[j - 1][2] ** 2 % mod)\\n if box[j][1] == 1:\\n ans = (ans * box[j][2]) % mod\\n return ans\\n\\n\\ndef n_func(n, mod=10**9 + 7):\\n ans = 1\\n for i in range(1, n + 1):\\n ans = (ans * i) % mod\\n return ans\\n\\n\\ndef nPr(n, r, mod=10**9 + 7):\\n ans = n_func(n - r, mod)\\n ans = power_mod(ans, mod - 2, mod)\\n return ans * n_func(n, mod) % mod\\n\\n\\ndef nCr(n, r, mod=10**9 + 7):\\n ans = n_func(n - r, mod) * n_func(r, mod) % mod\\n ans = power_mod(ans, mod - 2, mod)\\n return ans * n_func(n, mod) % mod\\n\\n\\nN, M, K = list(map(int, input().split()))\\nkeisuu = nCr(N * M - 2, K - 2)\\nmod = 10**9 + 7\\nsum_ = 0\\nfor i in range(N):\\n a = min(abs(i), abs(N - i - 1))\\n b = max(abs(i), abs(N - i - 1))\\n sum_ += (M**2) * ((a * (a + 1) // 2) + (b * (b + 1) // 2))\\nfor i in range(M):\\n a = min(abs(i), abs(M - i - 1))\\n b = max(abs(i), abs(M - i - 1))\\n sum_ += (N**2) * ((a * (a + 1) // 2) + (b * (b + 1) // 2))\\nprint(((keisuu * (sum_ // 2)) % mod))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 28.5714285714,\n", + " 'diff': ['-def cmb(n, r, mod):',\n", + " '- if r < 0 or r > n:',\n", + " '- return 0',\n", + " '- r = min(r, n - r)',\n", + " '- return g1[n] * g2[r] * g2[n - r] % mod',\n", + " '+def power_mod(a, b, mod=10**9 + 7):',\n", + " '+ i, temp, box = 0, b, []',\n", + " '+ while 2**i <= b:',\n", + " '+ i += 1',\n", + " '+ for j in range(i - 1, -1, -1):',\n", + " '+ box = [[j, temp // 2**j]] + box',\n", + " '+ temp -= 2**j * (temp // 2**j)',\n", + " '+ box[0].append(a)',\n", + " '+ ans = box[0][1] * a % mod',\n", + " '+ for j in range(1, i):',\n", + " '+ box[j].append(box[j - 1][2] ** 2 % mod)',\n", + " '+ if box[j][1] == 1:',\n", + " '+ ans = (ans * box[j][2]) % mod',\n", + " '+ return ans',\n", + " '-A = 2 * 10**5',\n", + " '+def n_func(n, mod=10**9 + 7):',\n", + " '+ ans = 1',\n", + " '+ for i in range(1, n + 1):',\n", + " '+ ans = (ans * i) % mod',\n", + " '+ return ans',\n", + " '+',\n", + " '+',\n", + " '+def nPr(n, r, mod=10**9 + 7):',\n", + " '+ ans = n_func(n - r, mod)',\n", + " '+ ans = power_mod(ans, mod - 2, mod)',\n", + " '+ return ans * n_func(n, mod) % mod',\n", + " '+',\n", + " '+',\n", + " '+def nCr(n, r, mod=10**9 + 7):',\n", + " '+ ans = n_func(n - r, mod) * n_func(r, mod) % mod',\n", + " '+ ans = power_mod(ans, mod - 2, mod)',\n", + " '+ return ans * n_func(n, mod) % mod',\n", + " '+',\n", + " '+',\n", + " '+N, M, K = list(map(int, input().split()))',\n", + " '+keisuu = nCr(N * M - 2, K - 2)',\n", + " '-g1 = [1, 1]',\n", + " '-g2 = [1, 1]',\n", + " '-inverse = [0, 1]',\n", + " '-for i in range(2, A + 1):',\n", + " '- g1.append((g1[-1] * i) % mod)',\n", + " '- inverse.append((-inverse[mod % i] * (mod // i)) % mod)',\n", + " '- g2.append((g2[-1] * inverse[-1]) % mod)',\n", + " '-N, M, K = list(map(int, input().split()))',\n", + " '-keisuu = cmb(N * M - 2, K - 2, mod)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.5172936699,\n", + " 'measured_runtime_v1': 0.2314554,\n", + " 'runtime_lift': 10.8759340674,\n", + " 'key': ['s814969347', 's884180243']},\n", + " {'user_id': 'u703950586',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's848540196',\n", + " 'submission_id_v1': 's618059842',\n", + " 'cpu_time_v0': 457,\n", + " 'cpu_time_v1': 162,\n", + " 'memory_v0': 19432,\n", + " 'memory_v1': 13148,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 64.55,\n", + " 'input': 'import sys,queue,math,numpy as np,scipy as sc\\n\\nsys.setrecursionlimit(10**7)\\n\\ninput = sys.stdin.readline\\n\\nINF = 10**18\\n\\nMOD = 10**9 + 7\\n\\nLI = lambda : [int(x) for x in input().split()]\\n\\nN,M = LI()\\n\\nE = [LI() for _ in range(M)]\\n\\nans = 0\\n\\nfor i in range(M):\\n\\n g = np.array([i for i in range(N+1)])\\n\\n\\n\\n def root(x):\\n\\n if g[x] != x:\\n\\n g[x] = root(g[x])\\n\\n return g[x]\\n\\n\\n\\n for j in range(M):\\n\\n if i != j: g[root(E[j][0])] = root(E[j][1])\\n\\n\\n\\n ans += (root(E[i][0]) != root(E[i][1]))\\n\\n\\n\\nprint (ans)',\n", + " 'target': 'import sys,queue,math,numpy as np,scipy as sc\\n\\nsys.setrecursionlimit(10**7)\\n\\ninput = sys.stdin.readline\\n\\nINF = 10**18\\n\\nMOD = 10**9 + 7\\n\\nLI = lambda : [int(x) for x in input().split()]\\n\\nN,M = LI()\\n\\nE = [LI() for _ in range(M)]\\n\\nans = 0\\n\\nfor i in range(M):\\n\\n g = [i for i in range(N+1)]\\n\\n\\n\\n def root(x):\\n\\n if g[x] != x:\\n\\n g[x] = root(g[x])\\n\\n return g[x]\\n\\n\\n\\n for j in range(M):\\n\\n if i != j: g[root(E[j][0])] = root(E[j][1])\\n\\n\\n\\n ans += (root(E[i][0]) != root(E[i][1]))\\n\\n\\n\\nprint (ans)',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 533,\n", + " 'code_v1_num_chars': 523,\n", + " 'code_v0_no_empty_lines': 'import sys, queue, math, numpy as np, scipy as sc\\n\\nsys.setrecursionlimit(10**7)\\ninput = sys.stdin.readline\\nINF = 10**18\\nMOD = 10**9 + 7\\nLI = lambda: [int(x) for x in input().split()]\\nN, M = LI()\\nE = [LI() for _ in range(M)]\\nans = 0\\nfor i in range(M):\\n g = np.array([i for i in range(N + 1)])\\n\\n def root(x):\\n if g[x] != x:\\n g[x] = root(g[x])\\n return g[x]\\n\\n for j in range(M):\\n if i != j:\\n g[root(E[j][0])] = root(E[j][1])\\n ans += root(E[i][0]) != root(E[i][1])\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys, queue, math, numpy as np, scipy as sc\\n\\nsys.setrecursionlimit(10**7)\\ninput = sys.stdin.readline\\nINF = 10**18\\nMOD = 10**9 + 7\\nLI = lambda: [int(x) for x in input().split()]\\nN, M = LI()\\nE = [LI() for _ in range(M)]\\nans = 0\\nfor i in range(M):\\n g = [i for i in range(N + 1)]\\n\\n def root(x):\\n if g[x] != x:\\n g[x] = root(g[x])\\n return g[x]\\n\\n for j in range(M):\\n if i != j:\\n g[root(E[j][0])] = root(E[j][1])\\n ans += root(E[i][0]) != root(E[i][1])\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- g = np.array([i for i in range(N + 1)])',\n", + " '+ g = [i for i in range(N + 1)]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8879079869,\n", + " 'measured_runtime_v1': 0.2002263706,\n", + " 'runtime_lift': 4.4345207092,\n", + " 'key': ['s848540196', 's618059842']},\n", + " {'user_id': 'u543954314',\n", + " 'problem_id': 'p02596',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's410919516',\n", + " 'submission_id_v1': 's753895766',\n", + " 'cpu_time_v0': 302,\n", + " 'cpu_time_v1': 127,\n", + " 'memory_v0': 114648,\n", + " 'memory_v1': 9196,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 57.95,\n", + " 'input': \"import sys\\n\\n\\n\\nreadline = sys.stdin.readline\\n\\nreadall = sys.stdin.read\\n\\nns = lambda: readline().rstrip()\\n\\nni = lambda: int(readline().rstrip())\\n\\nnm = lambda: map(int, readline().split())\\n\\nnl = lambda: list(map(int, readline().split()))\\n\\nprn = lambda x: print(*x, sep='\\\\n')\\n\\n\\n\\ndef solve():\\n\\n d = dict()\\n\\n k = ni()\\n\\n c = 7 % k\\n\\n x = d[c] = 1\\n\\n while True:\\n\\n c = (c * 10 + 7) % k\\n\\n if c in d:\\n\\n break\\n\\n x += 1\\n\\n d[c] = x\\n\\n print(d.get(0, -1))\\n\\n return\\n\\n\\n\\nsolve()\\n\",\n", + " 'target': \"import sys\\n\\n\\n\\nreadline = sys.stdin.readline\\n\\nreadall = sys.stdin.read\\n\\nns = lambda: readline().rstrip()\\n\\nni = lambda: int(readline().rstrip())\\n\\nnm = lambda: map(int, readline().split())\\n\\nnl = lambda: list(map(int, readline().split()))\\n\\nprn = lambda x: print(*x, sep='\\\\n')\\n\\n\\n\\ndef solve():\\n\\n k = ni()\\n\\n c = 0\\n\\n for i in range(k):\\n\\n c = (c * 10 + 7) % k\\n\\n if c == 0:\\n\\n print(i+1)\\n\\n break\\n\\n else:\\n\\n print(-1)\\n\\n return\\n\\n\\n\\nsolve()\\n\",\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 519,\n", + " 'code_v1_num_chars': 483,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nreadall = sys.stdin.read\\nns = lambda: readline().rstrip()\\nni = lambda: int(readline().rstrip())\\nnm = lambda: map(int, readline().split())\\nnl = lambda: list(map(int, readline().split()))\\nprn = lambda x: print(*x, sep=\"\\\\n\")\\n\\n\\ndef solve():\\n d = dict()\\n k = ni()\\n c = 7 % k\\n x = d[c] = 1\\n while True:\\n c = (c * 10 + 7) % k\\n if c in d:\\n break\\n x += 1\\n d[c] = x\\n print(d.get(0, -1))\\n return\\n\\n\\nsolve()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nreadall = sys.stdin.read\\nns = lambda: readline().rstrip()\\nni = lambda: int(readline().rstrip())\\nnm = lambda: map(int, readline().split())\\nnl = lambda: list(map(int, readline().split()))\\nprn = lambda x: print(*x, sep=\"\\\\n\")\\n\\n\\ndef solve():\\n k = ni()\\n c = 0\\n for i in range(k):\\n c = (c * 10 + 7) % k\\n if c == 0:\\n print(i + 1)\\n break\\n else:\\n print(-1)\\n return\\n\\n\\nsolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.0,\n", + " 'diff': ['- d = dict()',\n", + " '- c = 7 % k',\n", + " '- x = d[c] = 1',\n", + " '- while True:',\n", + " '+ c = 0',\n", + " '+ for i in range(k):',\n", + " '- if c in d:',\n", + " '+ if c == 0:',\n", + " '+ print(i + 1)',\n", + " '- x += 1',\n", + " '- d[c] = x',\n", + " '- print(d.get(0, -1))',\n", + " '+ else:',\n", + " '+ print(-1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7691566973,\n", + " 'measured_runtime_v1': 0.3673865876,\n", + " 'runtime_lift': 2.0935894863,\n", + " 'key': ['s410919516', 's753895766']},\n", + " {'user_id': 'u882209234',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's179415880',\n", + " 'submission_id_v1': 's895771571',\n", + " 'cpu_time_v0': 230,\n", + " 'cpu_time_v1': 42,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 81.74,\n", + " 'input': 'from math import factorial\\n\\nN = int(eval(input()))\\n\\nprint((factorial(N) % (10**9 + 7)))',\n", + " 'target': 'from math import factorial\\n\\nN = int(eval(input()))\\n\\nans = 1\\n\\nfor i in range(1,N+1):\\n\\n ans *= i % (10**9 + 7)\\n\\n ans %= 10**9 + 7\\n\\nprint(ans)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 79,\n", + " 'code_v1_num_chars': 139,\n", + " 'code_v0_no_empty_lines': 'from math import factorial\\n\\nN = int(eval(input()))\\nprint((factorial(N) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'from math import factorial\\n\\nN = int(eval(input()))\\nans = 1\\nfor i in range(1, N + 1):\\n ans *= i % (10**9 + 7)\\n ans %= 10**9 + 7\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 57.1428571429,\n", + " 'diff': ['-print((factorial(N) % (10**9 + 7)))',\n", + " '+ans = 1',\n", + " '+for i in range(1, N + 1):',\n", + " '+ ans *= i % (10**9 + 7)',\n", + " '+ ans %= 10**9 + 7',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.9434056597,\n", + " 'measured_runtime_v1': 0.3957924933,\n", + " 'runtime_lift': 2.3835865397,\n", + " 'key': ['s179415880', 's895771571']},\n", + " {'user_id': 'u923270446',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's885010221',\n", + " 'submission_id_v1': 's420231524',\n", + " 'cpu_time_v0': 220,\n", + " 'cpu_time_v1': 172,\n", + " 'memory_v0': 16320,\n", + " 'memory_v1': 20208,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.82,\n", + " 'input': 'from fractions import gcd\\n\\nn, m = list(map(int, input().split()))\\n\\na = [int(i) // 2 for i in input().split()]\\n\\nx = 1\\n\\nfor i in range(n):\\n\\n x *= a[i] // gcd(x, a[i])\\n\\nfor i in a:\\n\\n if x // i % 2 == 0:\\n\\n print((0))\\n\\n exit()\\n\\nprint(((m // x + 1) // 2))',\n", + " 'target': 'from math import gcd, ceil\\n\\nn, m = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\na = [i // 2 for i in a]\\n\\nl = 1\\n\\nfor i in a:\\n\\n l *= i // gcd(l, i)\\n\\nfor i in a:\\n\\n if l // i % 2 == 0:\\n\\n print((0))\\n\\n exit()\\n\\nprint((ceil((m // l) / 2)))',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 259,\n", + " 'code_v1_num_chars': 266,\n", + " 'code_v0_no_empty_lines': 'from fractions import gcd\\n\\nn, m = list(map(int, input().split()))\\na = [int(i) // 2 for i in input().split()]\\nx = 1\\nfor i in range(n):\\n x *= a[i] // gcd(x, a[i])\\nfor i in a:\\n if x // i % 2 == 0:\\n print((0))\\n exit()\\nprint(((m // x + 1) // 2))\\n',\n", + " 'code_v1_no_empty_lines': 'from math import gcd, ceil\\n\\nn, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\na = [i // 2 for i in a]\\nl = 1\\nfor i in a:\\n l *= i // gcd(l, i)\\nfor i in a:\\n if l // i % 2 == 0:\\n print((0))\\n exit()\\nprint((ceil((m // l) / 2)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-from fractions import gcd',\n", + " '+from math import gcd, ceil',\n", + " '-a = [int(i) // 2 for i in input().split()]',\n", + " '-x = 1',\n", + " '-for i in range(n):',\n", + " '- x *= a[i] // gcd(x, a[i])',\n", + " '+a = list(map(int, input().split()))',\n", + " '+a = [i // 2 for i in a]',\n", + " '+l = 1',\n", + " '- if x // i % 2 == 0:',\n", + " '+ l *= i // gcd(l, i)',\n", + " '+for i in a:',\n", + " '+ if l // i % 2 == 0:',\n", + " '-print(((m // x + 1) // 2))',\n", + " '+print((ceil((m // l) / 2)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2764406667,\n", + " 'measured_runtime_v1': 0.214073961,\n", + " 'runtime_lift': 1.2913325159,\n", + " 'key': ['s885010221', 's420231524']},\n", + " {'user_id': 'u989345508',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's593926411',\n", + " 'submission_id_v1': 's601943768',\n", + " 'cpu_time_v0': 162,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 14024,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.65,\n", + " 'input': 'import numpy as np\\n\\nh,w=input().split()\\n\\nh,w=int(h),int(w)\\n\\nx3=[]\\n\\nfor i in range(h):\\n\\n x1=input()\\n\\n if x1 != w*\".\":\\n\\n x3.append(list(x1))\\n\\n\\n\\nx3=np.array(x3).T.tolist()\\n\\nx4=[]\\n\\nfor i in range(w):\\n\\n if x3[i] != [\".\" for i in range(len(x3[i]))]:\\n\\n x4.append(x3[i])\\n\\n\\n\\nx4=np.array(x4).T.tolist()\\n\\nfor i in range(len(x4)):\\n\\n for j in range(len(x4[0])):\\n\\n print(x4[i][j],end=\"\")\\n\\n print()\\n',\n", + " 'target': 'h,w=list(map(int,input().split()))\\n\\na=[]\\n\\nfor i in range(h):\\n\\n k=eval(input())\\n\\n if k!=\".\"*w:\\n\\n a.append(k)\\n\\nl=len(a)\\n\\n#print(a)\\n\\nans=[[] for i in range(l)]\\n\\nfor i in range(w):\\n\\n for j in range(l):\\n\\n if a[j][i]==\"#\":\\n\\n for k in range(l):\\n\\n ans[k].append(a[k][i])\\n\\n break\\n\\nfor i in range(l):\\n\\n print((\"\".join(ans[i])))',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 421,\n", + " 'code_v1_num_chars': 366,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nh, w = input().split()\\nh, w = int(h), int(w)\\nx3 = []\\nfor i in range(h):\\n x1 = input()\\n if x1 != w * \".\":\\n x3.append(list(x1))\\nx3 = np.array(x3).T.tolist()\\nx4 = []\\nfor i in range(w):\\n if x3[i] != [\".\" for i in range(len(x3[i]))]:\\n x4.append(x3[i])\\nx4 = np.array(x4).T.tolist()\\nfor i in range(len(x4)):\\n for j in range(len(x4[0])):\\n print(x4[i][j], end=\"\")\\n print()\\n',\n", + " 'code_v1_no_empty_lines': 'h, w = list(map(int, input().split()))\\na = []\\nfor i in range(h):\\n k = eval(input())\\n if k != \".\" * w:\\n a.append(k)\\nl = len(a)\\n# print(a)\\nans = [[] for i in range(l)]\\nfor i in range(w):\\n for j in range(l):\\n if a[j][i] == \"#\":\\n for k in range(l):\\n ans[k].append(a[k][i])\\n break\\nfor i in range(l):\\n print((\"\".join(ans[i])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-h, w = input().split()',\n", + " '-h, w = int(h), int(w)',\n", + " '-x3 = []',\n", + " '+h, w = list(map(int, input().split()))',\n", + " '+a = []',\n", + " '- x1 = input()',\n", + " '- if x1 != w * \".\":',\n", + " '- x3.append(list(x1))',\n", + " '-x3 = np.array(x3).T.tolist()',\n", + " '-x4 = []',\n", + " '+ k = eval(input())',\n", + " '+ if k != \".\" * w:',\n", + " '+ a.append(k)',\n", + " '+l = len(a)',\n", + " '+# print(a)',\n", + " '+ans = [[] for i in range(l)]',\n", + " '- if x3[i] != [\".\" for i in range(len(x3[i]))]:',\n", + " '- x4.append(x3[i])',\n", + " '-x4 = np.array(x4).T.tolist()',\n", + " '-for i in range(len(x4)):',\n", + " '- for j in range(len(x4[0])):',\n", + " '- print(x4[i][j], end=\"\")',\n", + " '- print()',\n", + " '+ for j in range(l):',\n", + " '+ if a[j][i] == \"#\":',\n", + " '+ for k in range(l):',\n", + " '+ ans[k].append(a[k][i])',\n", + " '+ break',\n", + " '+for i in range(l):',\n", + " '+ print((\"\".join(ans[i])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2296837176,\n", + " 'measured_runtime_v1': 0.215579181,\n", + " 'runtime_lift': 5.7040930953,\n", + " 'key': ['s593926411', 's601943768']},\n", + " {'user_id': 'u187857228',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's720217601',\n", + " 'submission_id_v1': 's964731712',\n", + " 'cpu_time_v0': 154,\n", + " 'cpu_time_v1': 57,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.99,\n", + " 'input': 'def test():\\n\\n a,b = list(map(int,input().split()))\\n\\n count = 0\\n\\n for i in range(a,b+1):\\n\\n j = list(map(int,list(str(i))))\\n\\n if j[0] == j[4] and j[1] == j[3]:\\n\\n count += 1\\n\\n print(count)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n test()\\n',\n", + " 'target': 'def test():\\n\\n a,b = list(map(int,input().split()))\\n\\n count = 0\\n\\n for i in range(a,b+1):\\n\\n if str(i)[0] == str(i)[4] and str(i)[1] == str(i)[3]:\\n\\n count += 1\\n\\n print(count)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n test()\\n',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 261,\n", + " 'code_v1_num_chars': 240,\n", + " 'code_v0_no_empty_lines': 'def test():\\n a, b = list(map(int, input().split()))\\n count = 0\\n for i in range(a, b + 1):\\n j = list(map(int, list(str(i))))\\n if j[0] == j[4] and j[1] == j[3]:\\n count += 1\\n print(count)\\n\\n\\nif __name__ == \"__main__\":\\n test()\\n',\n", + " 'code_v1_no_empty_lines': 'def test():\\n a, b = list(map(int, input().split()))\\n count = 0\\n for i in range(a, b + 1):\\n if str(i)[0] == str(i)[4] and str(i)[1] == str(i)[3]:\\n count += 1\\n print(count)\\n\\n\\nif __name__ == \"__main__\":\\n test()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['- j = list(map(int, list(str(i))))',\n", + " '- if j[0] == j[4] and j[1] == j[3]:',\n", + " '+ if str(i)[0] == str(i)[4] and str(i)[1] == str(i)[3]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4881631348,\n", + " 'measured_runtime_v1': 0.3868406759,\n", + " 'runtime_lift': 1.2619229704,\n", + " 'key': ['s720217601', 's964731712']},\n", + " {'user_id': 'u652583512',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's221829319',\n", + " 'submission_id_v1': 's354836218',\n", + " 'cpu_time_v0': 342,\n", + " 'cpu_time_v1': 121,\n", + " 'memory_v0': 19068,\n", + " 'memory_v1': 8728,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 64.62,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nX, Y, Z, K = list(map(int, input().split()))\\n\\nA = np.array([int(i) for i in input().split()])\\n\\nB = np.array([int(i) for i in input().split()])\\n\\nC =np.array([int(i) for i in input().split()])\\n\\nA = -np.sort(-A) #要チェックや\\n\\nB = -np.sort(-B)\\n\\nC = -np.sort(-C)\\n\\nD = []\\n\\nfor i in range(min(K, X)):\\n\\n for j in range(min(K, Y)):\\n\\n if (i + 1) * (j + 1) > K:\\n\\n break\\n\\n for k in range(min(K, Z)):\\n\\n if (i + 1) * (j + 1) * (k + 1) > K:\\n\\n break\\n\\n else:\\n\\n\\n\\n D.append(A[i] + B[j] + C[k])\\n\\n\\n\\nX = np.array(D)\\n\\nX = -np.sort(-X)\\n\\nfor i in range(K):\\n\\n print((X[i]))',\n", + " 'target': 'X, Y, Z, K = list(map(int, input().split()))\\n\\nA = sorted([int(i) for i in input().split()], reverse=True)\\n\\nB = sorted([int(i) for i in input().split()], reverse=True)\\n\\nC = sorted([int(i) for i in input().split()], reverse=True)\\n\\nD = []\\n\\nfor i in range(min(K, X)):\\n\\n for j in range(min(K, Y)):\\n\\n if (i + 1) * (j + 1) > K:\\n\\n break\\n\\n for k in range(min(K, Z)):\\n\\n if (i + 1) * (j + 1) * (k + 1) > K:\\n\\n break\\n\\n else:\\n\\n\\n\\n D.append(A[i] + B[j] + C[k])\\n\\n\\n\\nD.sort(reverse=True)\\n\\nfor i in range(K):\\n\\n print((D[i]))',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 639,\n", + " 'code_v1_num_chars': 579,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nX, Y, Z, K = list(map(int, input().split()))\\nA = np.array([int(i) for i in input().split()])\\nB = np.array([int(i) for i in input().split()])\\nC = np.array([int(i) for i in input().split()])\\nA = -np.sort(-A) # 要チェックや\\nB = -np.sort(-B)\\nC = -np.sort(-C)\\nD = []\\nfor i in range(min(K, X)):\\n for j in range(min(K, Y)):\\n if (i + 1) * (j + 1) > K:\\n break\\n for k in range(min(K, Z)):\\n if (i + 1) * (j + 1) * (k + 1) > K:\\n break\\n else:\\n D.append(A[i] + B[j] + C[k])\\nX = np.array(D)\\nX = -np.sort(-X)\\nfor i in range(K):\\n print((X[i]))\\n',\n", + " 'code_v1_no_empty_lines': 'X, Y, Z, K = list(map(int, input().split()))\\nA = sorted([int(i) for i in input().split()], reverse=True)\\nB = sorted([int(i) for i in input().split()], reverse=True)\\nC = sorted([int(i) for i in input().split()], reverse=True)\\nD = []\\nfor i in range(min(K, X)):\\n for j in range(min(K, Y)):\\n if (i + 1) * (j + 1) > K:\\n break\\n for k in range(min(K, Z)):\\n if (i + 1) * (j + 1) * (k + 1) > K:\\n break\\n else:\\n D.append(A[i] + B[j] + C[k])\\nD.sort(reverse=True)\\nfor i in range(K):\\n print((D[i]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 24.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A = np.array([int(i) for i in input().split()])',\n", + " '-B = np.array([int(i) for i in input().split()])',\n", + " '-C = np.array([int(i) for i in input().split()])',\n", + " '-A = -np.sort(-A) # 要チェックや',\n", + " '-B = -np.sort(-B)',\n", + " '-C = -np.sort(-C)',\n", + " '+A = sorted([int(i) for i in input().split()], reverse=True)',\n", + " '+B = sorted([int(i) for i in input().split()], reverse=True)',\n", + " '+C = sorted([int(i) for i in input().split()], reverse=True)',\n", + " '-X = np.array(D)',\n", + " '-X = -np.sort(-X)',\n", + " '+D.sort(reverse=True)',\n", + " '- print((X[i]))',\n", + " '+ print((D[i]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3790917091,\n", + " 'measured_runtime_v1': 0.1937455821,\n", + " 'runtime_lift': 7.1180549982,\n", + " 'key': ['s221829319', 's354836218']},\n", + " {'user_id': 'u150984829',\n", + " 'problem_id': 'p02386',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's799017760',\n", + " 'submission_id_v1': 's414241098',\n", + " 'cpu_time_v0': 150,\n", + " 'cpu_time_v1': 130,\n", + " 'memory_v0': 5608,\n", + " 'memory_v1': 5608,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.33,\n", + " 'input': \"n=int(eval(input()))\\n\\na=[list(map(int,input().split()))for _ in range(n)]\\n\\ndef f():\\n\\n for i in range(n-1):\\n\\n d=a[i][:];d[3],d[4]=d[4],d[3]\\n\\n for j in range(i+1,n):\\n\\n e=a[j][:];e[3],e[4]=e[4],e[3]\\n\\n for p in('012345','152043','215304','302541','410352','514320'):\\n\\n f=[d[int(k)]for k in p]\\n\\n g=f[1:5]*2\\n\\n for k in range(4):\\n\\n if(g[k:k+4]==e[1:5])*(f[0]==e[0])*(f[5]==e[5]):return 'No'\\n\\n return 'Yes'\\n\\nprint((f()))\\n\",\n", + " 'target': \"n=int(eval(input()))\\n\\na=[list(map(int,input().split()))for _ in range(n)]\\n\\ndef f():\\n\\n for i in range(n-1):\\n\\n d=a[i][:];d[3],d[4]=d[4],d[3]\\n\\n for j in range(i+1,n):\\n\\n e=a[j][:];e[3],e[4]=e[4],e[3]\\n\\n for p in('012345','152043','215304','302541','410352','514320'):\\n\\n f=[d[int(k)]for k in p]\\n\\n g=f[1:5]*2\\n\\n for k in range(4):\\n\\n if g[k:k+4]==e[1:5]:\\n\\n if f[0]==e[0]:\\n\\n if f[5]==e[5]:return 'No'\\n\\n return 'Yes'\\n\\nprint((f()))\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 424,\n", + " 'code_v1_num_chars': 442,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\na = [list(map(int, input().split())) for _ in range(n)]\\n\\n\\ndef f():\\n for i in range(n - 1):\\n d = a[i][:]\\n d[3], d[4] = d[4], d[3]\\n for j in range(i + 1, n):\\n e = a[j][:]\\n e[3], e[4] = e[4], e[3]\\n for p in (\"012345\", \"152043\", \"215304\", \"302541\", \"410352\", \"514320\"):\\n f = [d[int(k)] for k in p]\\n g = f[1:5] * 2\\n for k in range(4):\\n if (g[k : k + 4] == e[1:5]) * (f[0] == e[0]) * (f[5] == e[5]):\\n return \"No\"\\n return \"Yes\"\\n\\n\\nprint((f()))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = [list(map(int, input().split())) for _ in range(n)]\\n\\n\\ndef f():\\n for i in range(n - 1):\\n d = a[i][:]\\n d[3], d[4] = d[4], d[3]\\n for j in range(i + 1, n):\\n e = a[j][:]\\n e[3], e[4] = e[4], e[3]\\n for p in (\"012345\", \"152043\", \"215304\", \"302541\", \"410352\", \"514320\"):\\n f = [d[int(k)] for k in p]\\n g = f[1:5] * 2\\n for k in range(4):\\n if g[k : k + 4] == e[1:5]:\\n if f[0] == e[0]:\\n if f[5] == e[5]:\\n return \"No\"\\n return \"Yes\"\\n\\n\\nprint((f()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['- if (g[k : k + 4] == e[1:5]) * (f[0] == e[0]) * (f[5] == e[5]):',\n", + " '- return \"No\"',\n", + " '+ if g[k : k + 4] == e[1:5]:',\n", + " '+ if f[0] == e[0]:',\n", + " '+ if f[5] == e[5]:',\n", + " '+ return \"No\"'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3438470016,\n", + " 'measured_runtime_v1': 0.1932190149,\n", + " 'runtime_lift': 1.7795712385,\n", + " 'key': ['s799017760', 's414241098']},\n", + " {'user_id': 'u638456847',\n", + " 'problem_id': 'p02937',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's386654104',\n", + " 'submission_id_v1': 's129869478',\n", + " 'cpu_time_v0': 375,\n", + " 'cpu_time_v1': 87,\n", + " 'memory_v0': 7284,\n", + " 'memory_v1': 7924,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.8,\n", + " 'input': 'import sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\ndef main():\\n\\n S = readline().strip()\\n\\n T = readline().strip()\\n\\n\\n\\n idx_in_S = []\\n\\n last_idx = 0\\n\\n for t in T:\\n\\n t_idx = S.find(t, last_idx) + 1\\n\\n if t_idx:\\n\\n idx_in_S.append(t_idx)\\n\\n last_idx = t_idx\\n\\n else:\\n\\n t_idx = S.find(t, 0, last_idx) + 1\\n\\n if not t_idx:\\n\\n print((-1))\\n\\n exit()\\n\\n else:\\n\\n idx_in_S.append(t_idx)\\n\\n last_idx = t_idx\\n\\n\\n\\n \\n\\n rep = 0\\n\\n for i in range(len(T) - 1):\\n\\n if idx_in_S[i] < idx_in_S[i+1]:\\n\\n continue\\n\\n else:\\n\\n rep += 1\\n\\n\\n\\n ans = len(S) * rep + idx_in_S[-1]\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': '# S.find()の部分を高速化する\\n\\nfrom collections import defaultdict\\n\\nfrom bisect import bisect_right\\n\\nimport sys\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\n\\n\\ndef main():\\n\\n S = readline().strip()\\n\\n T = readline().strip()\\n\\n\\n\\n S_idx = defaultdict(list)\\n\\n for i, s in enumerate(S):\\n\\n S_idx[s].append(i)\\n\\n \\n\\n rep = 0\\n\\n last_idx = -1\\n\\n for t in T:\\n\\n t_idx_list = S_idx[t]\\n\\n if t_idx_list:\\n\\n t_idx = bisect_right(t_idx_list, last_idx)\\n\\n if t_idx < len(t_idx_list):\\n\\n last_idx = t_idx_list[t_idx]\\n\\n else:\\n\\n last_idx = t_idx_list[0]\\n\\n rep += 1\\n\\n else:\\n\\n print((-1))\\n\\n exit()\\n\\n \\n\\n ans = len(S) * rep + last_idx + 1\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 39,\n", + " 'code_v1_loc': 37,\n", + " 'code_v0_num_chars': 840,\n", + " 'code_v1_num_chars': 855,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\n\\n\\ndef main():\\n S = readline().strip()\\n T = readline().strip()\\n idx_in_S = []\\n last_idx = 0\\n for t in T:\\n t_idx = S.find(t, last_idx) + 1\\n if t_idx:\\n idx_in_S.append(t_idx)\\n last_idx = t_idx\\n else:\\n t_idx = S.find(t, 0, last_idx) + 1\\n if not t_idx:\\n print((-1))\\n exit()\\n else:\\n idx_in_S.append(t_idx)\\n last_idx = t_idx\\n rep = 0\\n for i in range(len(T) - 1):\\n if idx_in_S[i] < idx_in_S[i + 1]:\\n continue\\n else:\\n rep += 1\\n ans = len(S) * rep + idx_in_S[-1]\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# S.find()の部分を高速化する\\nfrom collections import defaultdict\\nfrom bisect import bisect_right\\nimport sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\n\\n\\ndef main():\\n S = readline().strip()\\n T = readline().strip()\\n S_idx = defaultdict(list)\\n for i, s in enumerate(S):\\n S_idx[s].append(i)\\n rep = 0\\n last_idx = -1\\n for t in T:\\n t_idx_list = S_idx[t]\\n if t_idx_list:\\n t_idx = bisect_right(t_idx_list, last_idx)\\n if t_idx < len(t_idx_list):\\n last_idx = t_idx_list[t_idx]\\n else:\\n last_idx = t_idx_list[0]\\n rep += 1\\n else:\\n print((-1))\\n exit()\\n ans = len(S) * rep + last_idx + 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.1282051282,\n", + " 'diff': ['+# S.find()の部分を高速化する',\n", + " '+from collections import defaultdict',\n", + " '+from bisect import bisect_right',\n", + " '- idx_in_S = []',\n", + " '- last_idx = 0',\n", + " '+ S_idx = defaultdict(list)',\n", + " '+ for i, s in enumerate(S):',\n", + " '+ S_idx[s].append(i)',\n", + " '+ rep = 0',\n", + " '+ last_idx = -1',\n", + " '- t_idx = S.find(t, last_idx) + 1',\n", + " '- if t_idx:',\n", + " '- idx_in_S.append(t_idx)',\n", + " '- last_idx = t_idx',\n", + " '+ t_idx_list = S_idx[t]',\n", + " '+ if t_idx_list:',\n", + " '+ t_idx = bisect_right(t_idx_list, last_idx)',\n", + " '+ if t_idx < len(t_idx_list):',\n", + " '+ last_idx = t_idx_list[t_idx]',\n", + " '+ else:',\n", + " '+ last_idx = t_idx_list[0]',\n", + " '+ rep += 1',\n", + " '- t_idx = S.find(t, 0, last_idx) + 1',\n", + " '- if not t_idx:',\n", + " '- print((-1))',\n", + " '- exit()',\n", + " '- else:',\n", + " '- idx_in_S.append(t_idx)',\n", + " '- last_idx = t_idx',\n", + " '- rep = 0',\n", + " '- for i in range(len(T) - 1):',\n", + " '- if idx_in_S[i] < idx_in_S[i + 1]:',\n", + " '- continue',\n", + " '- else:',\n", + " '- rep += 1',\n", + " '- ans = len(S) * rep + idx_in_S[-1]',\n", + " '+ print((-1))',\n", + " '+ exit()',\n", + " '+ ans = len(S) * rep + last_idx + 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3716950469,\n", + " 'measured_runtime_v1': 0.2723373818,\n", + " 'runtime_lift': 1.3648330037,\n", + " 'key': ['s386654104', 's129869478']},\n", + " {'user_id': 'u777923818',\n", + " 'problem_id': 'p03086',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's716593637',\n", + " 'submission_id_v1': 's955967436',\n", + " 'cpu_time_v0': 22,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.73,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\nfrom collections import deque\\n\\ndef inpl(): return list(map(int, input().split()))\\n\\n\\n\\nS = eval(input())\\n\\nA = set(\"ATCG\")\\n\\nans = 0\\n\\nmode = 0\\n\\nfor i, s in enumerate(S):\\n\\n if s in A:\\n\\n if mode == 0:\\n\\n mode = 1\\n\\n start = i\\n\\n else:\\n\\n if mode == 1:\\n\\n ans = max(i - start, ans)\\n\\n mode = 0\\n\\nif mode == 1:\\n\\n ans = max(len(S) - start, ans)\\n\\nprint(ans)',\n", + " 'target': 'def inpl(): return list(map(int, input().split()))\\n\\nS = eval(input())\\n\\nC = set(\"ACGT\")\\n\\n\\n\\ntmp = 0\\n\\nans = 0\\n\\n\\n\\nfor s in S:\\n\\n if s in C:\\n\\n tmp += 1\\n\\n else:\\n\\n ans = max(ans, tmp)\\n\\n tmp = 0\\n\\nans = max(ans, tmp)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 426,\n", + " 'code_v1_num_chars': 239,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nfrom collections import deque\\n\\n\\ndef inpl():\\n return list(map(int, input().split()))\\n\\n\\nS = eval(input())\\nA = set(\"ATCG\")\\nans = 0\\nmode = 0\\nfor i, s in enumerate(S):\\n if s in A:\\n if mode == 0:\\n mode = 1\\n start = i\\n else:\\n if mode == 1:\\n ans = max(i - start, ans)\\n mode = 0\\nif mode == 1:\\n ans = max(len(S) - start, ans)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'def inpl():\\n return list(map(int, input().split()))\\n\\n\\nS = eval(input())\\nC = set(\"ACGT\")\\ntmp = 0\\nans = 0\\nfor s in S:\\n if s in C:\\n tmp += 1\\n else:\\n ans = max(ans, tmp)\\n tmp = 0\\nans = max(ans, tmp)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-# -*- coding: utf-8 -*-',\n", + " '-from collections import deque',\n", + " '-',\n", + " '-',\n", + " '-A = set(\"ATCG\")',\n", + " '+C = set(\"ACGT\")',\n", + " '+tmp = 0',\n", + " '-mode = 0',\n", + " '-for i, s in enumerate(S):',\n", + " '- if s in A:',\n", + " '- if mode == 0:',\n", + " '- mode = 1',\n", + " '- start = i',\n", + " '+for s in S:',\n", + " '+ if s in C:',\n", + " '+ tmp += 1',\n", + " '- if mode == 1:',\n", + " '- ans = max(i - start, ans)',\n", + " '- mode = 0',\n", + " '-if mode == 1:',\n", + " '- ans = max(len(S) - start, ans)',\n", + " '+ ans = max(ans, tmp)',\n", + " '+ tmp = 0',\n", + " '+ans = max(ans, tmp)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1640799,\n", + " 'measured_runtime_v1': 0.006362747,\n", + " 'runtime_lift': 25.7875884356,\n", + " 'key': ['s716593637', 's955967436']},\n", + " {'user_id': 'u968166680',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's703991862',\n", + " 'submission_id_v1': 's702868581',\n", + " 'cpu_time_v0': 61,\n", + " 'cpu_time_v1': 44,\n", + " 'memory_v0': 13352,\n", + " 'memory_v1': 14092,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.87,\n", + " 'input': 'import sys\\n\\nfrom fractions import gcd\\n\\n\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = 1 << 60\\n\\n\\n\\n\\n\\ndef lcm(x, y):\\n\\n return x * y // gcd(x, y)\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, M = list(map(int, input().split()))\\n\\n A = list(set(map(int, input().split(\" \"))))\\n\\n A = [a // 2 for a in A]\\n\\n semi_lcm = 1\\n\\n for a in A:\\n\\n semi_lcm = lcm(semi_lcm, a)\\n\\n if semi_lcm > M:\\n\\n print((0))\\n\\n return\\n\\n\\n\\n for a in A:\\n\\n if semi_lcm // a % 2 == 0:\\n\\n print((0))\\n\\n return\\n\\n\\n\\n print(((M // semi_lcm + 1) // 2))\\n\\n return\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n main()\\n',\n", + " 'target': \"import sys\\n\\n\\n\\nread = sys.stdin.read\\n\\nreadline = sys.stdin.readline\\n\\nreadlines = sys.stdin.readlines\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = 1 << 60\\n\\n\\n\\n\\n\\ndef gcd(a, b):\\n\\n while b:\\n\\n a, b = b, a % b\\n\\n return a\\n\\n\\n\\n\\n\\ndef lcm(a, b):\\n\\n return a * b // gcd(a, b)\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, M, *A = list(map(int, read().split()))\\n\\n A = list(set(A))\\n\\n B = A.copy()\\n\\n\\n\\n while not any(b % 2 for b in B):\\n\\n B = [b // 2 for b in B]\\n\\n\\n\\n if not all(b % 2 for b in B):\\n\\n print((0))\\n\\n return\\n\\n\\n\\n semi_lcm = 1\\n\\n for a in A:\\n\\n semi_lcm = lcm(semi_lcm, a // 2)\\n\\n\\n\\n print(((M // semi_lcm + 1) // 2))\\n\\n return\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 36,\n", + " 'code_v1_loc': 41,\n", + " 'code_v0_num_chars': 690,\n", + " 'code_v1_num_chars': 687,\n", + " 'code_v0_no_empty_lines': 'import sys\\nfrom fractions import gcd\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10**9)\\nINF = 1 << 60\\n\\n\\ndef lcm(x, y):\\n return x * y // gcd(x, y)\\n\\n\\ndef main():\\n N, M = list(map(int, input().split()))\\n A = list(set(map(int, input().split(\" \"))))\\n A = [a // 2 for a in A]\\n semi_lcm = 1\\n for a in A:\\n semi_lcm = lcm(semi_lcm, a)\\n if semi_lcm > M:\\n print((0))\\n return\\n for a in A:\\n if semi_lcm // a % 2 == 0:\\n print((0))\\n return\\n print(((M // semi_lcm + 1) // 2))\\n return\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10**9)\\nINF = 1 << 60\\n\\n\\ndef gcd(a, b):\\n while b:\\n a, b = b, a % b\\n return a\\n\\n\\ndef lcm(a, b):\\n return a * b // gcd(a, b)\\n\\n\\ndef main():\\n N, M, *A = list(map(int, read().split()))\\n A = list(set(A))\\n B = A.copy()\\n while not any(b % 2 for b in B):\\n B = [b // 2 for b in B]\\n if not all(b % 2 for b in B):\\n print((0))\\n return\\n semi_lcm = 1\\n for a in A:\\n semi_lcm = lcm(semi_lcm, a // 2)\\n print(((M // semi_lcm + 1) // 2))\\n return\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.1951219512,\n", + " 'diff': ['-from fractions import gcd',\n", + " '-def lcm(x, y):',\n", + " '- return x * y // gcd(x, y)',\n", + " '+def gcd(a, b):',\n", + " '+ while b:',\n", + " '+ a, b = b, a % b',\n", + " '+ return a',\n", + " '+',\n", + " '+',\n", + " '+def lcm(a, b):',\n", + " '+ return a * b // gcd(a, b)',\n", + " '- N, M = list(map(int, input().split()))',\n", + " '- A = list(set(map(int, input().split(\" \"))))',\n", + " '- A = [a // 2 for a in A]',\n", + " '+ N, M, *A = list(map(int, read().split()))',\n", + " '+ A = list(set(A))',\n", + " '+ B = A.copy()',\n", + " '+ while not any(b % 2 for b in B):',\n", + " '+ B = [b // 2 for b in B]',\n", + " '+ if not all(b % 2 for b in B):',\n", + " '+ print((0))',\n", + " '+ return',\n", + " '- semi_lcm = lcm(semi_lcm, a)',\n", + " '- if semi_lcm > M:',\n", + " '- print((0))',\n", + " '- return',\n", + " '- for a in A:',\n", + " '- if semi_lcm // a % 2 == 0:',\n", + " '- print((0))',\n", + " '- return',\n", + " '+ semi_lcm = lcm(semi_lcm, a // 2)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.284781249,\n", + " 'measured_runtime_v1': 0.212113862,\n", + " 'runtime_lift': 1.3425866952,\n", + " 'key': ['s703991862', 's702868581']},\n", + " {'user_id': 'u585482323',\n", + " 'problem_id': 'p03558',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's378178699',\n", + " 'submission_id_v1': 's370816259',\n", + " 'cpu_time_v0': 982,\n", + " 'cpu_time_v1': 230,\n", + " 'memory_v0': 88880,\n", + " 'memory_v1': 47180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.58,\n", + " 'input': '#!usr/bin/env python3\\n\\nfrom collections import defaultdict\\n\\nfrom collections import deque\\n\\nfrom heapq import heappush, heappop\\n\\nimport sys\\n\\nimport math\\n\\nimport bisect\\n\\nimport random\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LS():return list(map(list, sys.stdin.readline().split()))\\n\\ndef S(): return list(sys.stdin.readline())[:-1]\\n\\ndef IR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = I()\\n\\n return l\\n\\ndef LIR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = LI()\\n\\n return l\\n\\ndef SR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = S()\\n\\n return l\\n\\ndef LSR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = SR()\\n\\n return l\\n\\nmod = 1000000007\\n\\n\\n\\n#A\\n\\ndef A():\\n\\n s = S()\\n\\n t = S()\\n\\n if s+t == t[::-1]+s[::-1]:\\n\\n print(\"YES\")\\n\\n else:\\n\\n print(\"NO\")\\n\\n\\n\\n#B\\n\\ndef B():\\n\\n n = I()\\n\\n for i in range(int(n**0.5)+2)[::-1]:\\n\\n if i*i <= n:\\n\\n print((i*i))\\n\\n quit()\\n\\n#C\\n\\ndef C():\\n\\n n = I()\\n\\n a = LI()\\n\\n b = LI()\\n\\n c = LI()\\n\\n q = [0 for i in range(n)]\\n\\n ans = 0\\n\\n a.sort()\\n\\n b.sort()\\n\\n c.sort()\\n\\n for i in range(n):\\n\\n j = bisect.bisect_left(a,b[i])\\n\\n q[i] = j\\n\\n for i in range(n-1):\\n\\n q[i+1] += q[i]\\n\\n q.insert(0,0)\\n\\n for i in range(n):\\n\\n j = bisect.bisect_left(b,c[i])\\n\\n ans += q[j]\\n\\n print(ans)\\n\\n#D\\n\\ndef D():\\n\\n def dijkstra():\\n\\n d = [float(\"inf\") for i in range(k)]\\n\\n q = [[0,1]]\\n\\n d[1] = 0\\n\\n while q:\\n\\n dx,x = heappop(q)\\n\\n for y,dy in v[x]:\\n\\n if d[y] > dx+dy:\\n\\n d[y] = dx+dy\\n\\n heappush(q,[d[y],y])\\n\\n print((d[0]+1))\\n\\n k = I()\\n\\n if k == 1:\\n\\n print((1))\\n\\n quit()\\n\\n v = [[] for i in range(k)]\\n\\n for i in range(1,k):\\n\\n v[i].append([(i+1)%k,1])\\n\\n v[i].append([i*10%k,0])\\n\\n dijkstra()\\n\\n#E\\n\\ndef E():\\n\\n return\\n\\n\\n\\n#F\\n\\ndef F():\\n\\n return\\n\\n\\n\\n#G\\n\\ndef G():\\n\\n return\\n\\n\\n\\n#H\\n\\ndef H():\\n\\n return\\n\\n\\n\\n#Solve\\n\\nif __name__ == \"__main__\":\\n\\n D()\\n',\n", + " 'target': '#!usr/bin/env python3\\n\\nfrom collections import defaultdict,deque\\n\\nfrom heapq import heappush, heappop\\n\\nfrom itertools import permutations\\n\\nimport sys\\n\\nimport math\\n\\nimport bisect\\n\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LS():return [list(x) for x in sys.stdin.readline().split()]\\n\\ndef S():\\n\\n res = list(sys.stdin.readline())\\n\\n if res[-1] == \"\\\\n\":\\n\\n return res[:-1]\\n\\n return res\\n\\ndef IR(n):\\n\\n return [I() for i in range(n)]\\n\\ndef LIR(n):\\n\\n return [LI() for i in range(n)]\\n\\ndef SR(n):\\n\\n return [S() for i in range(n)]\\n\\ndef LSR(n):\\n\\n return [LS() for i in range(n)]\\n\\n\\n\\nsys.setrecursionlimit(1000000)\\n\\nmod = 1000000007\\n\\n\\n\\ndef solve():\\n\\n def v(n):\\n\\n return [n*10%k, (n+1)%k]\\n\\n k = I()\\n\\n d = [float(\"inf\")]*k\\n\\n d[1] = 1\\n\\n q = deque([1])\\n\\n while q:\\n\\n x = q.popleft()\\n\\n vx = v(x)\\n\\n dx = d[x]\\n\\n for c in range(2):\\n\\n nd = dx+c\\n\\n y = vx[c]\\n\\n if nd < d[y]:\\n\\n d[y] = nd\\n\\n if c:\\n\\n q.append(y)\\n\\n else:\\n\\n q.appendleft(y)\\n\\n print((d[0]))\\n\\n return\\n\\n\\n\\n#Solve\\n\\nif __name__ == \"__main__\":\\n\\n solve()\\n',\n", + " 'code_v0_loc': 108,\n", + " 'code_v1_loc': 53,\n", + " 'code_v0_num_chars': 2164,\n", + " 'code_v1_num_chars': 1252,\n", + " 'code_v0_no_empty_lines': '#!usr/bin/env python3\\nfrom collections import defaultdict\\nfrom collections import deque\\nfrom heapq import heappush, heappop\\nimport sys\\nimport math\\nimport bisect\\nimport random\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LS():\\n return list(map(list, sys.stdin.readline().split()))\\n\\n\\ndef S():\\n return list(sys.stdin.readline())[:-1]\\n\\n\\ndef IR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = I()\\n return l\\n\\n\\ndef LIR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = LI()\\n return l\\n\\n\\ndef SR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = S()\\n return l\\n\\n\\ndef LSR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = SR()\\n return l\\n\\n\\nmod = 1000000007\\n# A\\ndef A():\\n s = S()\\n t = S()\\n if s + t == t[::-1] + s[::-1]:\\n print(\"YES\")\\n else:\\n print(\"NO\")\\n\\n\\n# B\\ndef B():\\n n = I()\\n for i in range(int(n**0.5) + 2)[::-1]:\\n if i * i <= n:\\n print((i * i))\\n quit()\\n\\n\\n# C\\ndef C():\\n n = I()\\n a = LI()\\n b = LI()\\n c = LI()\\n q = [0 for i in range(n)]\\n ans = 0\\n a.sort()\\n b.sort()\\n c.sort()\\n for i in range(n):\\n j = bisect.bisect_left(a, b[i])\\n q[i] = j\\n for i in range(n - 1):\\n q[i + 1] += q[i]\\n q.insert(0, 0)\\n for i in range(n):\\n j = bisect.bisect_left(b, c[i])\\n ans += q[j]\\n print(ans)\\n\\n\\n# D\\ndef D():\\n def dijkstra():\\n d = [float(\"inf\") for i in range(k)]\\n q = [[0, 1]]\\n d[1] = 0\\n while q:\\n dx, x = heappop(q)\\n for y, dy in v[x]:\\n if d[y] > dx + dy:\\n d[y] = dx + dy\\n heappush(q, [d[y], y])\\n print((d[0] + 1))\\n\\n k = I()\\n if k == 1:\\n print((1))\\n quit()\\n v = [[] for i in range(k)]\\n for i in range(1, k):\\n v[i].append([(i + 1) % k, 1])\\n v[i].append([i * 10 % k, 0])\\n dijkstra()\\n\\n\\n# E\\ndef E():\\n return\\n\\n\\n# F\\ndef F():\\n return\\n\\n\\n# G\\ndef G():\\n return\\n\\n\\n# H\\ndef H():\\n return\\n\\n\\n# Solve\\nif __name__ == \"__main__\":\\n D()\\n',\n", + " 'code_v1_no_empty_lines': '#!usr/bin/env python3\\nfrom collections import defaultdict, deque\\nfrom heapq import heappush, heappop\\nfrom itertools import permutations\\nimport sys\\nimport math\\nimport bisect\\n\\n\\ndef LI():\\n return [int(x) for x in sys.stdin.readline().split()]\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LS():\\n return [list(x) for x in sys.stdin.readline().split()]\\n\\n\\ndef S():\\n res = list(sys.stdin.readline())\\n if res[-1] == \"\\\\n\":\\n return res[:-1]\\n return res\\n\\n\\ndef IR(n):\\n return [I() for i in range(n)]\\n\\n\\ndef LIR(n):\\n return [LI() for i in range(n)]\\n\\n\\ndef SR(n):\\n return [S() for i in range(n)]\\n\\n\\ndef LSR(n):\\n return [LS() for i in range(n)]\\n\\n\\nsys.setrecursionlimit(1000000)\\nmod = 1000000007\\n\\n\\ndef solve():\\n def v(n):\\n return [n * 10 % k, (n + 1) % k]\\n\\n k = I()\\n d = [float(\"inf\")] * k\\n d[1] = 1\\n q = deque([1])\\n while q:\\n x = q.popleft()\\n vx = v(x)\\n dx = d[x]\\n for c in range(2):\\n nd = dx + c\\n y = vx[c]\\n if nd < d[y]:\\n d[y] = nd\\n if c:\\n q.append(y)\\n else:\\n q.appendleft(y)\\n print((d[0]))\\n return\\n\\n\\n# Solve\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.9259259259,\n", + " 'diff': ['-from collections import defaultdict',\n", + " '-from collections import deque',\n", + " '+from collections import defaultdict, deque',\n", + " '+from itertools import permutations',\n", + " '-import random',\n", + " '- return list(map(int, sys.stdin.readline().split()))',\n", + " '+ return [int(x) for x in sys.stdin.readline().split()]',\n", + " '- return list(map(list, sys.stdin.readline().split()))',\n", + " '+ return [list(x) for x in sys.stdin.readline().split()]',\n", + " '- return list(sys.stdin.readline())[:-1]',\n", + " '+ res = list(sys.stdin.readline())',\n", + " '+ if res[-1] == \"\\\\n\":',\n", + " '+ return res[:-1]',\n", + " '+ return res',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = I()',\n", + " '- return l',\n", + " '+ return [I() for i in range(n)]',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = LI()',\n", + " '- return l',\n", + " '+ return [LI() for i in range(n)]',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = S()',\n", + " '- return l',\n", + " '+ return [S() for i in range(n)]',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = SR()',\n", + " '- return l',\n", + " '+ return [LS() for i in range(n)]',\n", + " '+sys.setrecursionlimit(1000000)',\n", + " '-# A',\n", + " '-def A():',\n", + " '- s = S()',\n", + " '- t = S()',\n", + " '- if s + t == t[::-1] + s[::-1]:',\n", + " '- print(\"YES\")',\n", + " '- else:',\n", + " '- print(\"NO\")',\n", + " '-# B',\n", + " '-def B():',\n", + " '- n = I()',\n", + " '- for i in range(int(n**0.5) + 2)[::-1]:',\n", + " '- if i * i <= n:',\n", + " '- print((i * i))',\n", + " '- quit()',\n", + " '-',\n", + " '-',\n", + " '-# C',\n", + " '-def C():',\n", + " '- n = I()',\n", + " '- a = LI()',\n", + " '- b = LI()',\n", + " '- c = LI()',\n", + " '- q = [0 for i in range(n)]',\n", + " '- ans = 0',\n", + " '- a.sort()',\n", + " '- b.sort()',\n", + " '- c.sort()',\n", + " '- for i in range(n):',\n", + " '- j = bisect.bisect_left(a, b[i])',\n", + " '- q[i] = j',\n", + " '- for i in range(n - 1):',\n", + " '- q[i + 1] += q[i]',\n", + " '- q.insert(0, 0)',\n", + " '- for i in range(n):',\n", + " '- j = bisect.bisect_left(b, c[i])',\n", + " '- ans += q[j]',\n", + " '- print(ans)',\n", + " '-',\n", + " '-',\n", + " '-# D',\n", + " '-def D():',\n", + " '- def dijkstra():',\n", + " '- d = [float(\"inf\") for i in range(k)]',\n", + " '- q = [[0, 1]]',\n", + " '- d[1] = 0',\n", + " '- while q:',\n", + " '- dx, x = heappop(q)',\n", + " '- for y, dy in v[x]:',\n", + " '- if d[y] > dx + dy:',\n", + " '- d[y] = dx + dy',\n", + " '- heappush(q, [d[y], y])',\n", + " '- print((d[0] + 1))',\n", + " '+def solve():',\n", + " '+ def v(n):',\n", + " '+ return [n * 10 % k, (n + 1) % k]',\n", + " '- if k == 1:',\n", + " '- print((1))',\n", + " '- quit()',\n", + " '- v = [[] for i in range(k)]',\n", + " '- for i in range(1, k):',\n", + " '- v[i].append([(i + 1) % k, 1])',\n", + " '- v[i].append([i * 10 % k, 0])',\n", + " '- dijkstra()',\n", + " '-',\n", + " '-',\n", + " '-# E',\n", + " '-def E():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# F',\n", + " '-def F():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# G',\n", + " '-def G():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# H',\n", + " '-def H():',\n", + " '+ d = [float(\"inf\")] * k',\n", + " '+ d[1] = 1',\n", + " '+ q = deque([1])',\n", + " '+ while q:',\n", + " '+ x = q.popleft()',\n", + " '+ vx = v(x)',\n", + " '+ dx = d[x]',\n", + " '+ for c in range(2):',\n", + " '+ nd = dx + c',\n", + " '+ y = vx[c]',\n", + " '+ if nd < d[y]:',\n", + " '+ d[y] = nd',\n", + " '+ if c:',\n", + " '+ q.append(y)',\n", + " '+ else:',\n", + " '+ q.appendleft(y)',\n", + " '+ print((d[0]))',\n", + " '- D()',\n", + " '+ solve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6112481251,\n", + " 'measured_runtime_v1': 0.2866115916,\n", + " 'runtime_lift': 2.1326706352,\n", + " 'key': ['s378178699', 's370816259']},\n", + " {'user_id': 'u671060652',\n", + " 'problem_id': 'p02952',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's923935687',\n", + " 'submission_id_v1': 's007434774',\n", + " 'cpu_time_v0': 222,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 40940,\n", + " 'memory_v1': 61860,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 72.97,\n", + " 'input': 'n = int(eval(input()))\\n\\n\\n\\n\\n\\ndef countKeta(num):\\n\\n count = 1\\n\\n while num / 10 >= 1:\\n\\n count += 1\\n\\n num = num // 10\\n\\n return count\\n\\n\\n\\n\\n\\ncount = 0\\n\\n\\n\\nfor i in range(1, n+1):\\n\\n if(countKeta(i) % 2 == 1):\\n\\n count += 1\\n\\n\\n\\nprint(count)',\n", + " 'target': 'n = int(eval(input()))\\n\\n\\n\\nif n < 10:\\n\\n print(n)\\n\\nelif n < 100:\\n\\n print((9))\\n\\nelif n < 1000:\\n\\n print((n-90))\\n\\nelif n < 10000:\\n\\n print((909))\\n\\nelif n < 100000:\\n\\n print((n-9090))\\n\\nelif n < 1000000:\\n\\n print((90909))',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 255,\n", + " 'code_v1_num_chars': 213,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\n\\n\\ndef countKeta(num):\\n count = 1\\n while num / 10 >= 1:\\n count += 1\\n num = num // 10\\n return count\\n\\n\\ncount = 0\\nfor i in range(1, n + 1):\\n if countKeta(i) % 2 == 1:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nif n < 10:\\n print(n)\\nelif n < 100:\\n print((9))\\nelif n < 1000:\\n print((n - 90))\\nelif n < 10000:\\n print((909))\\nelif n < 100000:\\n print((n - 9090))\\nelif n < 1000000:\\n print((90909))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.2222222222,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def countKeta(num):',\n", + " '- count = 1',\n", + " '- while num / 10 >= 1:',\n", + " '- count += 1',\n", + " '- num = num // 10',\n", + " '- return count',\n", + " '-',\n", + " '-',\n", + " '-count = 0',\n", + " '-for i in range(1, n + 1):',\n", + " '- if countKeta(i) % 2 == 1:',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+if n < 10:',\n", + " '+ print(n)',\n", + " '+elif n < 100:',\n", + " '+ print((9))',\n", + " '+elif n < 1000:',\n", + " '+ print((n - 90))',\n", + " '+elif n < 10000:',\n", + " '+ print((909))',\n", + " '+elif n < 100000:',\n", + " '+ print((n - 9090))',\n", + " '+elif n < 1000000:',\n", + " '+ print((90909))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2693535981,\n", + " 'measured_runtime_v1': 0.1929554205,\n", + " 'runtime_lift': 1.3959369341,\n", + " 'key': ['s923935687', 's007434774']},\n", + " {'user_id': 'u195054737',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's669133667',\n", + " 'submission_id_v1': 's547309192',\n", + " 'cpu_time_v0': 1799,\n", + " 'cpu_time_v1': 388,\n", + " 'memory_v0': 42816,\n", + " 'memory_v1': 40452,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 78.43,\n", + " 'input': 'import sys\\n\\nimport itertools\\n\\nfrom operator import itemgetter #sortedの対象を決めたい\\n\\nfrom fractions import gcd #最大公約数\\n\\nfrom math import ceil, floor, sqrt, isinf #小数点切り上げ、切り捨て、平方根\\n\\nfrom copy import deepcopy #参照で影響されないコピー\\n\\nfrom collections import Counter, deque #要素ごとの出現回数、双方向アクセス可能データ型\\n\\nimport heapq\\n\\nimport numpy as np\\n\\nfrom functools import reduce\\n\\nsys.setrecursionlimit(200000)\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n# template\\n\\n\\n\\ndef retmax(a, b):\\n\\n if a > b:\\n\\n return a\\n\\n else:\\n\\n return b\\n\\n\\n\\ndef main():\\n\\n n = int(eval(input()))\\n\\n a = [list(map(int, input().split())) for _ in range(n)]\\n\\n\\n\\n dp = np.zeros([3, n+1])\\n\\n\\n\\n for i, a_l in enumerate(a):\\n\\n for j in range(3):\\n\\n for k in range(3):\\n\\n if j != k:\\n\\n dp[k, i+1] = retmax(dp[k, i+1], dp[j, i] + a_l[k])\\n\\n\\n\\n print((int(np.max(dp[:, n], axis=0))))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n\\n\\n',\n", + " 'target': 'import sys\\n\\nimport itertools\\n\\nfrom operator import itemgetter #sortedの対象を決めたい\\n\\nfrom fractions import gcd #最大公約数\\n\\nfrom math import ceil, floor, sqrt, isinf #小数点切り上げ、切り捨て、平方根\\n\\nfrom copy import deepcopy #参照で影響されないコピー\\n\\nfrom collections import Counter, deque #要素ごとの出現回数、双方向アクセス可能データ型\\n\\nimport heapq\\n\\nimport numpy as np\\n\\nfrom functools import reduce\\n\\nsys.setrecursionlimit(200000)\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n# template\\n\\n\\n\\ndef main():\\n\\n n = int(eval(input()))\\n\\n abc = [list(map(int, input().split())) for _ in range(n)]\\n\\n\\n\\n a, b, c = 0, 0, 0\\n\\n for x, y, z in abc:\\n\\n a, b, c = max(b, c) + x, max(a, c) + y, max(a, b) + z\\n\\n\\n\\n print((max(a, b, c)))\\n\\n\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n\\n\\n',\n", + " 'code_v0_loc': 39,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 913,\n", + " 'code_v1_num_chars': 704,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport itertools\\nfrom operator import itemgetter # sortedの対象を決めたい\\nfrom fractions import gcd # 最大公約数\\nfrom math import ceil, floor, sqrt, isinf # 小数点切り上げ、切り捨て、平方根\\nfrom copy import deepcopy # 参照で影響されないコピー\\nfrom collections import Counter, deque # 要素ごとの出現回数、双方向アクセス可能データ型\\nimport heapq\\nimport numpy as np\\nfrom functools import reduce\\n\\nsys.setrecursionlimit(200000)\\ninput = sys.stdin.readline\\n# template\\ndef retmax(a, b):\\n if a > b:\\n return a\\n else:\\n return b\\n\\n\\ndef main():\\n n = int(eval(input()))\\n a = [list(map(int, input().split())) for _ in range(n)]\\n dp = np.zeros([3, n + 1])\\n for i, a_l in enumerate(a):\\n for j in range(3):\\n for k in range(3):\\n if j != k:\\n dp[k, i + 1] = retmax(dp[k, i + 1], dp[j, i] + a_l[k])\\n print((int(np.max(dp[:, n], axis=0))))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport itertools\\nfrom operator import itemgetter # sortedの対象を決めたい\\nfrom fractions import gcd # 最大公約数\\nfrom math import ceil, floor, sqrt, isinf # 小数点切り上げ、切り捨て、平方根\\nfrom copy import deepcopy # 参照で影響されないコピー\\nfrom collections import Counter, deque # 要素ごとの出現回数、双方向アクセス可能データ型\\nimport heapq\\nimport numpy as np\\nfrom functools import reduce\\n\\nsys.setrecursionlimit(200000)\\ninput = sys.stdin.readline\\n# template\\ndef main():\\n n = int(eval(input()))\\n abc = [list(map(int, input().split())) for _ in range(n)]\\n a, b, c = 0, 0, 0\\n for x, y, z in abc:\\n a, b, c = max(b, c) + x, max(a, c) + y, max(a, b) + z\\n print((max(a, b, c)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.0769230769,\n", + " 'diff': ['-def retmax(a, b):',\n", + " '- if a > b:',\n", + " '- return a',\n", + " '- else:',\n", + " '- return b',\n", + " '-',\n", + " '-',\n", + " '- a = [list(map(int, input().split())) for _ in range(n)]',\n", + " '- dp = np.zeros([3, n + 1])',\n", + " '- for i, a_l in enumerate(a):',\n", + " '- for j in range(3):',\n", + " '- for k in range(3):',\n", + " '- if j != k:',\n", + " '- dp[k, i + 1] = retmax(dp[k, i + 1], dp[j, i] + a_l[k])',\n", + " '- print((int(np.max(dp[:, n], axis=0))))',\n", + " '+ abc = [list(map(int, input().split())) for _ in range(n)]',\n", + " '+ a, b, c = 0, 0, 0',\n", + " '+ for x, y, z in abc:',\n", + " '+ a, b, c = max(b, c) + x, max(a, c) + y, max(a, b) + z',\n", + " '+ print((max(a, b, c)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.2678967826,\n", + " 'measured_runtime_v1': 0.4848643332,\n", + " 'runtime_lift': 4.6773842238,\n", + " 'key': ['s669133667', 's547309192']},\n", + " {'user_id': 'u038021590',\n", + " 'problem_id': 'p03171',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's330952971',\n", + " 'submission_id_v1': 's165498833',\n", + " 'cpu_time_v0': 615,\n", + " 'cpu_time_v1': 234,\n", + " 'memory_v0': 115036,\n", + " 'memory_v1': 135316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 61.95,\n", + " 'input': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nn = N % 2\\n\\n\\n\\nDP = [[0] * (N+1) for _ in range(N+1)]\\n\\n\\n\\nfor w in range(1, N+1):\\n\\n for i in range(N):\\n\\n j = i + w\\n\\n if j > N:\\n\\n continue\\n\\n if (w+n) % 2 == 1:\\n\\n DP[i][j] = min(DP[i+1][j] - A[i], DP[i][j-1] - A[j-1])\\n\\n else:\\n\\n DP[i][j] = max(DP[i+1][j] + A[i], DP[i][j-1] + A[j-1])\\n\\n\\n\\nprint((DP[0][N]))\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nDP = [[0] * (N+1) for _ in range(N+1)]\\n\\n\\n\\nfor num in range(1, N + 1):\\n\\n for start in range(N):\\n\\n end = start + num\\n\\n if end > N:\\n\\n break\\n\\n if num == 1:\\n\\n DP[start][end] = A[start]\\n\\n else:\\n\\n DP[start][end] = max(A[start] - DP[start+1][end], A[end - 1] - DP[start][end - 1])\\n\\nprint((DP[0][N]))\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 416,\n", + " 'code_v1_num_chars': 409,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nn = N % 2\\nDP = [[0] * (N + 1) for _ in range(N + 1)]\\nfor w in range(1, N + 1):\\n for i in range(N):\\n j = i + w\\n if j > N:\\n continue\\n if (w + n) % 2 == 1:\\n DP[i][j] = min(DP[i + 1][j] - A[i], DP[i][j - 1] - A[j - 1])\\n else:\\n DP[i][j] = max(DP[i + 1][j] + A[i], DP[i][j - 1] + A[j - 1])\\nprint((DP[0][N]))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = list(map(int, input().split()))\\nDP = [[0] * (N + 1) for _ in range(N + 1)]\\nfor num in range(1, N + 1):\\n for start in range(N):\\n end = start + num\\n if end > N:\\n break\\n if num == 1:\\n DP[start][end] = A[start]\\n else:\\n DP[start][end] = max(\\n A[start] - DP[start + 1][end], A[end - 1] - DP[start][end - 1]\\n )\\nprint((DP[0][N]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.6470588235,\n", + " 'diff': ['-n = N % 2',\n", + " '-for w in range(1, N + 1):',\n", + " '- for i in range(N):',\n", + " '- j = i + w',\n", + " '- if j > N:',\n", + " '- continue',\n", + " '- if (w + n) % 2 == 1:',\n", + " '- DP[i][j] = min(DP[i + 1][j] - A[i], DP[i][j - 1] - A[j - 1])',\n", + " '+for num in range(1, N + 1):',\n", + " '+ for start in range(N):',\n", + " '+ end = start + num',\n", + " '+ if end > N:',\n", + " '+ break',\n", + " '+ if num == 1:',\n", + " '+ DP[start][end] = A[start]',\n", + " '- DP[i][j] = max(DP[i + 1][j] + A[i], DP[i][j - 1] + A[j - 1])',\n", + " '+ DP[start][end] = max(',\n", + " '+ A[start] - DP[start + 1][end], A[end - 1] - DP[start][end - 1]',\n", + " '+ )'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1878290408,\n", + " 'measured_runtime_v1': 0.0068282696,\n", + " 'runtime_lift': 27.5075605354,\n", + " 'key': ['s330952971', 's165498833']},\n", + " {'user_id': 'u597374218',\n", + " 'problem_id': 'p03644',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's675566275',\n", + " 'submission_id_v1': 's569588989',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 28,\n", + " 'memory_v0': 27172,\n", + " 'memory_v1': 9256,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.27,\n", + " 'input': 'import numpy as np\\n\\nN=int(eval(input()))\\n\\nprint((2**int(np.log2(N))))',\n", + " 'target': 'import math\\n\\nN=int(eval(input()))\\n\\nprint((2**int(math.log2(N))))',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 61,\n", + " 'code_v1_num_chars': 56,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nprint((2 ** int(np.log2(N))))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nprint((2 ** int(math.log2(N))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import numpy as np',\n", + " '+import math',\n", + " '-print((2 ** int(np.log2(N))))',\n", + " '+print((2 ** int(math.log2(N))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3166776929,\n", + " 'measured_runtime_v1': 0.2254950373,\n", + " 'runtime_lift': 5.8390539699,\n", + " 'key': ['s675566275', 's569588989']},\n", + " {'user_id': 'u440566786',\n", + " 'problem_id': 'p03164',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's415436180',\n", + " 'submission_id_v1': 's201445864',\n", + " 'cpu_time_v0': 345,\n", + " 'cpu_time_v1': 221,\n", + " 'memory_v0': 70988,\n", + " 'memory_v1': 40176,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.94,\n", + " 'input': 'import sys\\n\\nsys.setrecursionlimit(2147483647)\\n\\nINF=float(\"inf\")\\n\\nMOD=10**9+7\\n\\ninput=lambda :sys.stdin.readline().rstrip()\\n\\ndef resolve():\\n\\n n,W=list(map(int,input().split()))\\n\\n WV=[tuple(map(int,input().split())) for _ in range(n)]\\n\\n\\n\\n V=100000\\n\\n dp=[INF]*(V+1)\\n\\n dp[0]=0\\n\\n\\n\\n for w,v in WV:\\n\\n for x in range(V,-1,-1):\\n\\n if(x+v<=V):\\n\\n dp[x+v]=min(dp[x+v],dp[x]+w)\\n\\n\\n\\n for x in range(V,-1,-1):\\n\\n if(dp[x]<=W):\\n\\n print(x)\\n\\n return\\n\\nresolve()',\n", + " 'target': 'import sys\\n\\nINF = 1 << 60\\n\\nMOD = 10**9 + 7 # 998244353\\n\\nsys.setrecursionlimit(2147483647)\\n\\ninput = lambda:sys.stdin.readline().rstrip()\\n\\ndef resolve():\\n\\n n, W = list(map(int, input().split()))\\n\\n dp = [INF] * (n * 1001 + 1)\\n\\n dp[0] = 0\\n\\n for _ in range(n):\\n\\n w, v = list(map(int, input().split()))\\n\\n for v0 in range(n * 1001, -1, -1):\\n\\n if dp[v0] == INF:\\n\\n continue\\n\\n if v + v0 <= n * 1001:\\n\\n dp[v + v0] = min(dp[v + v0], dp[v0] + w)\\n\\n for v in range(n * 1001, -1, -1):\\n\\n if dp[v] <= W:\\n\\n print(v)\\n\\n return\\n\\nresolve()',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 515,\n", + " 'code_v1_num_chars': 614,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(2147483647)\\nINF = float(\"inf\")\\nMOD = 10**9 + 7\\ninput = lambda: sys.stdin.readline().rstrip()\\n\\n\\ndef resolve():\\n n, W = list(map(int, input().split()))\\n WV = [tuple(map(int, input().split())) for _ in range(n)]\\n V = 100000\\n dp = [INF] * (V + 1)\\n dp[0] = 0\\n for w, v in WV:\\n for x in range(V, -1, -1):\\n if x + v <= V:\\n dp[x + v] = min(dp[x + v], dp[x] + w)\\n for x in range(V, -1, -1):\\n if dp[x] <= W:\\n print(x)\\n return\\n\\n\\nresolve()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nINF = 1 << 60\\nMOD = 10**9 + 7 # 998244353\\nsys.setrecursionlimit(2147483647)\\ninput = lambda: sys.stdin.readline().rstrip()\\n\\n\\ndef resolve():\\n n, W = list(map(int, input().split()))\\n dp = [INF] * (n * 1001 + 1)\\n dp[0] = 0\\n for _ in range(n):\\n w, v = list(map(int, input().split()))\\n for v0 in range(n * 1001, -1, -1):\\n if dp[v0] == INF:\\n continue\\n if v + v0 <= n * 1001:\\n dp[v + v0] = min(dp[v + v0], dp[v0] + w)\\n for v in range(n * 1001, -1, -1):\\n if dp[v] <= W:\\n print(v)\\n return\\n\\n\\nresolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.6956521739,\n", + " 'diff': ['+INF = 1 << 60',\n", + " '+MOD = 10**9 + 7 # 998244353',\n", + " '-INF = float(\"inf\")',\n", + " '-MOD = 10**9 + 7',\n", + " '- WV = [tuple(map(int, input().split())) for _ in range(n)]',\n", + " '- V = 100000',\n", + " '- dp = [INF] * (V + 1)',\n", + " '+ dp = [INF] * (n * 1001 + 1)',\n", + " '- for w, v in WV:',\n", + " '- for x in range(V, -1, -1):',\n", + " '- if x + v <= V:',\n", + " '- dp[x + v] = min(dp[x + v], dp[x] + w)',\n", + " '- for x in range(V, -1, -1):',\n", + " '- if dp[x] <= W:',\n", + " '- print(x)',\n", + " '+ for _ in range(n):',\n", + " '+ w, v = list(map(int, input().split()))',\n", + " '+ for v0 in range(n * 1001, -1, -1):',\n", + " '+ if dp[v0] == INF:',\n", + " '+ continue',\n", + " '+ if v + v0 <= n * 1001:',\n", + " '+ dp[v + v0] = min(dp[v + v0], dp[v0] + w)',\n", + " '+ for v in range(n * 1001, -1, -1):',\n", + " '+ if dp[v] <= W:',\n", + " '+ print(v)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2692114379,\n", + " 'measured_runtime_v1': 0.2021781888,\n", + " 'runtime_lift': 6.2776872491,\n", + " 'key': ['s415436180', 's201445864']},\n", + " {'user_id': 'u014333473',\n", + " 'problem_id': 'p03845',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's045706452',\n", + " 'submission_id_v1': 's705375036',\n", + " 'cpu_time_v0': 29,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 9180,\n", + " 'memory_v1': 9164,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.79,\n", + " 'input': \"n,t=int(input()),list(map(int,input().split()));T=sum(t)\\n\\nprint(*[T-t[i-1]+j for i,j in [list(map(int,input().split())) for _ in range(int(input()))]],sep='\\\\n')\\n\",\n", + " 'target': \"input();t=list(map(int,input().split()));T=sum(t)\\n\\nprint(*[T-t[i-1]+j for i,j in [list(map(int,input().split())) for _ in range(int(input()))]],sep='\\\\n')\\n\",\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 2,\n", + " 'code_v0_num_chars': 160,\n", + " 'code_v1_num_chars': 153,\n", + " 'code_v0_no_empty_lines': 'n, t = int(input()), list(map(int, input().split()))\\nT = sum(t)\\nprint(\\n *[\\n T - t[i - 1] + j\\n for i, j in [list(map(int, input().split())) for _ in range(int(input()))]\\n ],\\n sep=\"\\\\n\"\\n)\\n',\n", + " 'code_v1_no_empty_lines': 'input()\\nt = list(map(int, input().split()))\\nT = sum(t)\\nprint(\\n *[\\n T - t[i - 1] + j\\n for i, j in [list(map(int, input().split())) for _ in range(int(input()))]\\n ],\\n sep=\"\\\\n\"\\n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-n, t = int(input()), list(map(int, input().split()))',\n", + " '+input()',\n", + " '+t = list(map(int, input().split()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.308619008,\n", + " 'measured_runtime_v1': 0.2417461898,\n", + " 'runtime_lift': 1.2766240837,\n", + " 'key': ['s045706452', 's705375036']},\n", + " {'user_id': 'u732870425',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's504204235',\n", + " 'submission_id_v1': 's825991485',\n", + " 'cpu_time_v0': 104,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 9176,\n", + " 'memory_v1': 9180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.0,\n", + " 'input': 'A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\nans = 5000 * 2 * 10 ** 5\\n\\nfor i in range(10 ** 5 + 1):\\n\\n s = i * 2 * C + max(0, X - i) * A + max(0, Y - i) * B\\n\\n ans = min(ans, s)\\n\\n\\n\\nprint(ans)',\n", + " 'target': 'A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\nif X > Y:\\n\\n v = A\\n\\nelse:\\n\\n v = B\\n\\n\\n\\nans = min(A*X+B*Y, C*max(X, Y)*2, C*min(X,Y)*2+(max(X,Y)-min(X,Y))*v)\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 195,\n", + " 'code_v1_num_chars': 170,\n", + " 'code_v0_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nans = 5000 * 2 * 10**5\\nfor i in range(10**5 + 1):\\n s = i * 2 * C + max(0, X - i) * A + max(0, Y - i) * B\\n ans = min(ans, s)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nif X > Y:\\n v = A\\nelse:\\n v = B\\nans = min(\\n A * X + B * Y, C * max(X, Y) * 2, C * min(X, Y) * 2 + (max(X, Y) - min(X, Y)) * v\\n)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-ans = 5000 * 2 * 10**5',\n", + " '-for i in range(10**5 + 1):',\n", + " '- s = i * 2 * C + max(0, X - i) * A + max(0, Y - i) * B',\n", + " '- ans = min(ans, s)',\n", + " '+if X > Y:',\n", + " '+ v = A',\n", + " '+else:',\n", + " '+ v = B',\n", + " '+ans = min(',\n", + " '+ A * X + B * Y, C * max(X, Y) * 2, C * min(X, Y) * 2 + (max(X, Y) - min(X, Y)) * v',\n", + " '+)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5409223008,\n", + " 'measured_runtime_v1': 0.2907806964,\n", + " 'runtime_lift': 5.2992592696,\n", + " 'key': ['s504204235', 's825991485']},\n", + " {'user_id': 'u708556844',\n", + " 'problem_id': 'p02688',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's393142342',\n", + " 'submission_id_v1': 's768184755',\n", + " 'cpu_time_v0': 75,\n", + " 'cpu_time_v1': 62,\n", + " 'memory_v0': 72720,\n", + " 'memory_v1': 67880,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.33,\n", + " 'input': 'N,K=list(map(int,input().split()))\\n\\n\\n\\ncon = 0\\n\\nans = list(int() for _ in range(100000))\\n\\npre = 0\\n\\n\\n\\n\\n\\nfor _ in range(K):\\n\\n\\n\\n D = int(eval(input()))\\n\\n arr = list(map(int,input().split()))\\n\\n\\n\\n for j in range(D):\\n\\n\\n\\n ans[pre+j]=arr[j]\\n\\n\\n\\n pre += D\\n\\n\\n\\n \\n\\nfin = (N+1) - len(set(ans))\\n\\n\\n\\nprint(fin)',\n", + " 'target': 'N,K=list(map(int,input().split()))\\n\\n\\n\\ncon = 0\\n\\nans = list(int() for _ in range(10001))\\n\\npre = 0\\n\\n\\n\\n\\n\\nfor _ in range(K):\\n\\n\\n\\n D = int(eval(input()))\\n\\n arr = list(map(int,input().split()))\\n\\n\\n\\n for j in range(D):\\n\\n\\n\\n ans[pre+j]=arr[j]\\n\\n\\n\\n pre += D\\n\\n\\n\\n \\n\\nfin = (N+1) - len(set(ans))\\n\\n\\n\\nprint(fin)',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 306,\n", + " 'code_v1_num_chars': 305,\n", + " 'code_v0_no_empty_lines': 'N, K = list(map(int, input().split()))\\ncon = 0\\nans = list(int() for _ in range(100000))\\npre = 0\\nfor _ in range(K):\\n D = int(eval(input()))\\n arr = list(map(int, input().split()))\\n for j in range(D):\\n ans[pre + j] = arr[j]\\n pre += D\\nfin = (N + 1) - len(set(ans))\\nprint(fin)\\n',\n", + " 'code_v1_no_empty_lines': 'N, K = list(map(int, input().split()))\\ncon = 0\\nans = list(int() for _ in range(10001))\\npre = 0\\nfor _ in range(K):\\n D = int(eval(input()))\\n arr = list(map(int, input().split()))\\n for j in range(D):\\n ans[pre + j] = arr[j]\\n pre += D\\nfin = (N + 1) - len(set(ans))\\nprint(fin)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-ans = list(int() for _ in range(100000))',\n", + " '+ans = list(int() for _ in range(10001))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3054342192,\n", + " 'measured_runtime_v1': 0.2128900746,\n", + " 'runtime_lift': 1.434703895,\n", + " 'key': ['s393142342', 's768184755']},\n", + " {'user_id': 'u282228874',\n", + " 'problem_id': 'p03353',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's703764972',\n", + " 'submission_id_v1': 's575406884',\n", + " 'cpu_time_v0': 39,\n", + " 'cpu_time_v1': 34,\n", + " 'memory_v0': 4976,\n", + " 'memory_v1': 4592,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 12.82,\n", + " 'input': 'S = eval(input())\\n\\nk = int(eval(input()))\\n\\nA = set()\\n\\nfor l in range(k+1):\\n\\n\\tfor i in range(len(S)-l):\\n\\n\\t\\t\\tA.add(S[i:i+l+1])\\n\\nA = sorted(list(A))\\n\\nprint((A[k-1]))',\n", + " 'target': 'S = eval(input())\\n\\nl = len(S)\\n\\nd = set()\\n\\nK = int(eval(input()))\\n\\nfor i in range(5):\\n\\n for j in range(l-i):\\n\\n d.add(S[j:j+i+1])\\n\\nD = sorted(list(d))\\n\\nprint((D[K-1]))',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 148,\n", + " 'code_v1_num_chars': 161,\n", + " 'code_v0_no_empty_lines': 'S = eval(input())\\nk = int(eval(input()))\\nA = set()\\nfor l in range(k + 1):\\n for i in range(len(S) - l):\\n A.add(S[i : i + l + 1])\\nA = sorted(list(A))\\nprint((A[k - 1]))\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nl = len(S)\\nd = set()\\nK = int(eval(input()))\\nfor i in range(5):\\n for j in range(l - i):\\n d.add(S[j : j + i + 1])\\nD = sorted(list(d))\\nprint((D[K - 1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-k = int(eval(input()))',\n", + " '-A = set()',\n", + " '-for l in range(k + 1):',\n", + " '- for i in range(len(S) - l):',\n", + " '- A.add(S[i : i + l + 1])',\n", + " '-A = sorted(list(A))',\n", + " '-print((A[k - 1]))',\n", + " '+l = len(S)',\n", + " '+d = set()',\n", + " '+K = int(eval(input()))',\n", + " '+for i in range(5):',\n", + " '+ for j in range(l - i):',\n", + " '+ d.add(S[j : j + i + 1])',\n", + " '+D = sorted(list(d))',\n", + " '+print((D[K - 1]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2549800012,\n", + " 'measured_runtime_v1': 0.1151928709,\n", + " 'runtime_lift': 2.2135050485,\n", + " 'key': ['s703764972', 's575406884']},\n", + " {'user_id': 'u837286475',\n", + " 'problem_id': 'p02996',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's244057022',\n", + " 'submission_id_v1': 's796254109',\n", + " 'cpu_time_v0': 1201,\n", + " 'cpu_time_v1': 941,\n", + " 'memory_v0': 53532,\n", + " 'memory_v1': 53600,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.65,\n", + " 'input': \"\\n\\n\\n\\nn = int(eval(input()))\\n\\n\\n\\nabn = [list(map(int,input().split())) for _ in range(n)]\\n\\n\\n\\n\\n\\nabn.sort()\\n\\nabn.sort(key = lambda x:x[1])\\n\\n\\n\\n\\n\\n#print(abn)\\n\\n\\n\\nts = 0 # time_stamp\\n\\nenable = True\\n\\nfor abi in abn:\\n\\n a, b = abi\\n\\n\\n\\n if not ts + a <= b:\\n\\n enable = False\\n\\n break\\n\\n else:\\n\\n ts += a\\n\\n\\n\\nprint(('Yes' if enable else 'No'))\",\n", + " 'target': \"\\n\\nn = int(eval(input()))\\n\\n\\n\\nabn = [list(map(int,input().split())) for _ in range(n)]\\n\\n\\n\\n\\n\\n#abn.sort()\\n\\nabn.sort(key = lambda x:x[1])\\n\\n\\n\\n\\n\\n#print(abn)\\n\\n\\n\\nts = 0 # time_stamp\\n\\nenable = True\\n\\nfor abi in abn:\\n\\n a, b = abi\\n\\n\\n\\n if not ts + a <= b:\\n\\n enable = False\\n\\n break\\n\\n else:\\n\\n ts += a\\n\\n\\n\\nprint(('Yes' if enable else 'No'))\",\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 345,\n", + " 'code_v1_num_chars': 344,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nabn = [list(map(int, input().split())) for _ in range(n)]\\nabn.sort()\\nabn.sort(key=lambda x: x[1])\\n# print(abn)\\nts = 0 # time_stamp\\nenable = True\\nfor abi in abn:\\n a, b = abi\\n if not ts + a <= b:\\n enable = False\\n break\\n else:\\n ts += a\\nprint((\"Yes\" if enable else \"No\"))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nabn = [list(map(int, input().split())) for _ in range(n)]\\n# abn.sort()\\nabn.sort(key=lambda x: x[1])\\n# print(abn)\\nts = 0 # time_stamp\\nenable = True\\nfor abi in abn:\\n a, b = abi\\n if not ts + a <= b:\\n enable = False\\n break\\n else:\\n ts += a\\nprint((\"Yes\" if enable else \"No\"))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.0,\n", + " 'diff': ['-abn.sort()', '+# abn.sort()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.205832685,\n", + " 'measured_runtime_v1': 0.0061624551,\n", + " 'runtime_lift': 33.4010847824,\n", + " 'key': ['s244057022', 's796254109']},\n", + " {'user_id': 'u465961647',\n", + " 'problem_id': 'p02576',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's578033438',\n", + " 'submission_id_v1': 's457299018',\n", + " 'cpu_time_v0': 28,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 9032,\n", + " 'memory_v1': 9096,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.71,\n", + " 'input': 'array = list(map(int, input().split()))\\n\\nif array[0] % array[1] > 0:\\n\\n print(((array[0] // array[1] + 1) * array[2]))\\n\\nelse:\\n\\n print(((array[0] // array[1]) * array[2]))',\n", + " 'target': 'n, x, t = list(map(int, input().split()))\\n\\n\\n\\nprint((0--n//x*t))',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 171,\n", + " 'code_v1_num_chars': 55,\n", + " 'code_v0_no_empty_lines': 'array = list(map(int, input().split()))\\nif array[0] % array[1] > 0:\\n print(((array[0] // array[1] + 1) * array[2]))\\nelse:\\n print(((array[0] // array[1]) * array[2]))\\n',\n", + " 'code_v1_no_empty_lines': 'n, x, t = list(map(int, input().split()))\\nprint((0 - -n // x * t))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 40.0,\n", + " 'diff': ['-array = list(map(int, input().split()))',\n", + " '-if array[0] % array[1] > 0:',\n", + " '- print(((array[0] // array[1] + 1) * array[2]))',\n", + " '-else:',\n", + " '- print(((array[0] // array[1]) * array[2]))',\n", + " '+n, x, t = list(map(int, input().split()))',\n", + " '+print((0 - -n // x * t))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1827679622,\n", + " 'measured_runtime_v1': 0.0061908547,\n", + " 'runtime_lift': 29.5222502437,\n", + " 'key': ['s578033438', 's457299018']},\n", + " {'user_id': 'u647766105',\n", + " 'problem_id': 'p00149',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's470531137',\n", + " 'submission_id_v1': 's067459842',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 4324,\n", + " 'memory_v1': 4316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': 'from bisect import bisect\\n\\nD = [0.2,0.6,1.1]\\n\\nL = [0,0,0,0]\\n\\nR = [0,0,0,0]\\n\\nwhile True:\\n\\n try:\\n\\n left,right = list(map(float,input().split()))\\n\\n except:\\n\\n break\\n\\n L[bisect(D,left)] += 1\\n\\n R[bisect(D,right)] += 1\\n\\nfor left,right in zip(L,R)[::-1]:\\n\\n print(left,right)',\n", + " 'target': 'from bisect import bisect\\n\\nD = [0.2,0.6,1.1]\\n\\nL = [0]*4\\n\\nR = [0]*4\\n\\nwhile True:\\n\\n try:\\n\\n left,right = list(map(float,input().split()))\\n\\n except:\\n\\n break\\n\\n L[bisect(D,left)] += 1\\n\\n R[bisect(D,right)] += 1\\n\\nfor left,right in zip(L,R)[::-1]:\\n\\n print(left,right)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 292,\n", + " 'code_v1_num_chars': 284,\n", + " 'code_v0_no_empty_lines': 'from bisect import bisect\\n\\nD = [0.2, 0.6, 1.1]\\nL = [0, 0, 0, 0]\\nR = [0, 0, 0, 0]\\nwhile True:\\n try:\\n left, right = list(map(float, input().split()))\\n except:\\n break\\n L[bisect(D, left)] += 1\\n R[bisect(D, right)] += 1\\nfor left, right in zip(L, R)[::-1]:\\n print(left, right)\\n',\n", + " 'code_v1_no_empty_lines': 'from bisect import bisect\\n\\nD = [0.2, 0.6, 1.1]\\nL = [0] * 4\\nR = [0] * 4\\nwhile True:\\n try:\\n left, right = list(map(float, input().split()))\\n except:\\n break\\n L[bisect(D, left)] += 1\\n R[bisect(D, right)] += 1\\nfor left, right in zip(L, R)[::-1]:\\n print(left, right)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-L = [0, 0, 0, 0]',\n", + " '-R = [0, 0, 0, 0]',\n", + " '+L = [0] * 4',\n", + " '+R = [0] * 4'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4541368237,\n", + " 'measured_runtime_v1': 0.349680768,\n", + " 'runtime_lift': 1.2987183316,\n", + " 'key': ['s470531137', 's067459842']},\n", + " {'user_id': 'u661290476',\n", + " 'problem_id': 'p00053',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's978814614',\n", + " 'submission_id_v1': 's421101567',\n", + " 'cpu_time_v0': 420,\n", + " 'cpu_time_v1': 210,\n", + " 'memory_v0': 18368,\n", + " 'memory_v1': 51028,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': 'prim=[True]*1000000\\n\\nprim[0],prim[1]=False,False\\n\\nfor i in range(2,1000):\\n\\n if prim[i]:\\n\\n for j in range(i*2,1000000,i):\\n\\n prim[j]=False\\n\\nprime=[i for i,j in enumerate(prim) if j==True]\\n\\n\\n\\nwhile True:\\n\\n n=int(eval(input()))\\n\\n if n==0:\\n\\n break\\n\\n print((sum(prime[:n])))',\n", + " 'target': 'prim=[True]*1000000\\n\\nprim[0]=prim[1]=False\\n\\nfor i in range(2,350):\\n\\n if prim[i]:\\n\\n for j in range(i*2,110000,i):\\n\\n prim[j]=False\\n\\nprime=[i for i,j in enumerate(prim) if j==True]\\n\\n\\n\\nwhile True:\\n\\n n=int(eval(input()))\\n\\n if n==0:\\n\\n break\\n\\n print((sum(prime[:n])))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 297,\n", + " 'code_v1_num_chars': 289,\n", + " 'code_v0_no_empty_lines': 'prim = [True] * 1000000\\nprim[0], prim[1] = False, False\\nfor i in range(2, 1000):\\n if prim[i]:\\n for j in range(i * 2, 1000000, i):\\n prim[j] = False\\nprime = [i for i, j in enumerate(prim) if j == True]\\nwhile True:\\n n = int(eval(input()))\\n if n == 0:\\n break\\n print((sum(prime[:n])))\\n',\n", + " 'code_v1_no_empty_lines': 'prim = [True] * 1000000\\nprim[0] = prim[1] = False\\nfor i in range(2, 350):\\n if prim[i]:\\n for j in range(i * 2, 110000, i):\\n prim[j] = False\\nprime = [i for i, j in enumerate(prim) if j == True]\\nwhile True:\\n n = int(eval(input()))\\n if n == 0:\\n break\\n print((sum(prime[:n])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-prim[0], prim[1] = False, False',\n", + " '-for i in range(2, 1000):',\n", + " '+prim[0] = prim[1] = False',\n", + " '+for i in range(2, 350):',\n", + " '- for j in range(i * 2, 1000000, i):',\n", + " '+ for j in range(i * 2, 110000, i):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.0302433112,\n", + " 'measured_runtime_v1': 0.6551637814,\n", + " 'runtime_lift': 1.5724973516,\n", + " 'key': ['s978814614', 's421101567']},\n", + " {'user_id': 'u940342887',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's060379978',\n", + " 'submission_id_v1': 's122581978',\n", + " 'cpu_time_v0': 1633,\n", + " 'cpu_time_v1': 622,\n", + " 'memory_v0': 43156,\n", + " 'memory_v1': 50048,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 61.91,\n", + " 'input': 'import numpy as np\\n\\nN = int(eval(input()))\\n\\nabc = []\\n\\nfor i in range(N):\\n\\n abc.append(list(map(int, input().split())))\\n\\n \\n\\ndp = np.zeros(shape=(N, 3), dtype=int)\\n\\ndp[0, :] = abc[0]\\n\\nfor i in range(N-1):\\n\\n dp[i+1, 0] = max(dp[i+1, 0], dp[i, 1] + abc[i+1][0], dp[i, 2] + abc[i+1][0])\\n\\n dp[i+1, 1] = max(dp[i+1, 1], dp[i, 0] + abc[i+1][1], dp[i, 2] + abc[i+1][1])\\n\\n dp[i+1, 2] = max(dp[i+1, 2], dp[i, 0] + abc[i+1][2], dp[i, 1] + abc[i+1][2])\\n\\nprint((max(dp[N-1, :])))',\n", + " 'target': 'N = int(eval(input()))\\n\\nabc = []\\n\\nfor i in range(N):\\n\\n data = list(map(int, input().split()))\\n\\n abc.append(data)\\n\\n\\n\\ndp = [[0 for i in range(3)] for j in range(N)]\\n\\ndp[0][0] = abc[0][0]\\n\\ndp[0][1] = abc[0][1]\\n\\ndp[0][2] = abc[0][2]\\n\\n\\n\\nfor i in range(N-1):\\n\\n for j in range(3):\\n\\n if j == 0:\\n\\n dp[i+1][1] = max(dp[i][0] + abc[i+1][1], dp[i+1][1])\\n\\n dp[i+1][2] = max(dp[i][0] + abc[i+1][2], dp[i+1][2])\\n\\n if j == 1:\\n\\n dp[i+1][0] = max(dp[i][1] + abc[i+1][0], dp[i+1][0])\\n\\n dp[i+1][2] = max(dp[i][1] + abc[i+1][2], dp[i+1][2])\\n\\n if j == 2:\\n\\n dp[i+1][1] = max(dp[i][2] + abc[i+1][1], dp[i+1][1])\\n\\n dp[i+1][0] = max(dp[i][2] + abc[i+1][0], dp[i+1][0])\\n\\n\\n\\nprint((max(dp[N-1])))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 472,\n", + " 'code_v1_num_chars': 755,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nabc = []\\nfor i in range(N):\\n abc.append(list(map(int, input().split())))\\ndp = np.zeros(shape=(N, 3), dtype=int)\\ndp[0, :] = abc[0]\\nfor i in range(N - 1):\\n dp[i + 1, 0] = max(dp[i + 1, 0], dp[i, 1] + abc[i + 1][0], dp[i, 2] + abc[i + 1][0])\\n dp[i + 1, 1] = max(dp[i + 1, 1], dp[i, 0] + abc[i + 1][1], dp[i, 2] + abc[i + 1][1])\\n dp[i + 1, 2] = max(dp[i + 1, 2], dp[i, 0] + abc[i + 1][2], dp[i, 1] + abc[i + 1][2])\\nprint((max(dp[N - 1, :])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nabc = []\\nfor i in range(N):\\n data = list(map(int, input().split()))\\n abc.append(data)\\ndp = [[0 for i in range(3)] for j in range(N)]\\ndp[0][0] = abc[0][0]\\ndp[0][1] = abc[0][1]\\ndp[0][2] = abc[0][2]\\nfor i in range(N - 1):\\n for j in range(3):\\n if j == 0:\\n dp[i + 1][1] = max(dp[i][0] + abc[i + 1][1], dp[i + 1][1])\\n dp[i + 1][2] = max(dp[i][0] + abc[i + 1][2], dp[i + 1][2])\\n if j == 1:\\n dp[i + 1][0] = max(dp[i][1] + abc[i + 1][0], dp[i + 1][0])\\n dp[i + 1][2] = max(dp[i][1] + abc[i + 1][2], dp[i + 1][2])\\n if j == 2:\\n dp[i + 1][1] = max(dp[i][2] + abc[i + 1][1], dp[i + 1][1])\\n dp[i + 1][0] = max(dp[i][2] + abc[i + 1][0], dp[i + 1][0])\\nprint((max(dp[N - 1])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 45.8333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '- abc.append(list(map(int, input().split())))',\n", + " '-dp = np.zeros(shape=(N, 3), dtype=int)',\n", + " '-dp[0, :] = abc[0]',\n", + " '+ data = list(map(int, input().split()))',\n", + " '+ abc.append(data)',\n", + " '+dp = [[0 for i in range(3)] for j in range(N)]',\n", + " '+dp[0][0] = abc[0][0]',\n", + " '+dp[0][1] = abc[0][1]',\n", + " '+dp[0][2] = abc[0][2]',\n", + " '- dp[i + 1, 0] = max(dp[i + 1, 0], dp[i, 1] + abc[i + 1][0], dp[i, 2] + abc[i + 1][0])',\n", + " '- dp[i + 1, 1] = max(dp[i + 1, 1], dp[i, 0] + abc[i + 1][1], dp[i, 2] + abc[i + 1][1])',\n", + " '- dp[i + 1, 2] = max(dp[i + 1, 2], dp[i, 0] + abc[i + 1][2], dp[i, 1] + abc[i + 1][2])',\n", + " '-print((max(dp[N - 1, :])))',\n", + " '+ for j in range(3):',\n", + " '+ if j == 0:',\n", + " '+ dp[i + 1][1] = max(dp[i][0] + abc[i + 1][1], dp[i + 1][1])',\n", + " '+ dp[i + 1][2] = max(dp[i][0] + abc[i + 1][2], dp[i + 1][2])',\n", + " '+ if j == 1:',\n", + " '+ dp[i + 1][0] = max(dp[i][1] + abc[i + 1][0], dp[i + 1][0])',\n", + " '+ dp[i + 1][2] = max(dp[i][1] + abc[i + 1][2], dp[i + 1][2])',\n", + " '+ if j == 2:',\n", + " '+ dp[i + 1][1] = max(dp[i][2] + abc[i + 1][1], dp[i + 1][1])',\n", + " '+ dp[i + 1][0] = max(dp[i][2] + abc[i + 1][0], dp[i + 1][0])',\n", + " '+print((max(dp[N - 1])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3918258445,\n", + " 'measured_runtime_v1': 0.1973543379,\n", + " 'runtime_lift': 7.0524208338,\n", + " 'key': ['s060379978', 's122581978']},\n", + " {'user_id': 'u699089116',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's752541577',\n", + " 'submission_id_v1': 's744339126',\n", + " 'cpu_time_v0': 526,\n", + " 'cpu_time_v1': 204,\n", + " 'memory_v0': 42860,\n", + " 'memory_v1': 42220,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 61.22,\n", + " 'input': 'import math\\n\\nn = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef trial_division(n):\\n\\n factor = []\\n\\n tmp = int(math.sqrt(n)) + 1\\n\\n for _ in range(2,tmp):\\n\\n while n % 2 == 0:\\n\\n n //= 2\\n\\n factor.append(2)\\n\\n if not factor:\\n\\n return [n]\\n\\n else:\\n\\n factor.append(n)\\n\\n return factor\\n\\n\\n\\n\\n\\ncount = 0\\n\\nfor i in a:\\n\\n temp = trial_division(i)\\n\\n count += temp.count(2)\\n\\n\\n\\nprint(count)',\n", + " 'target': 'n = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef trial_division(n):\\n\\n #２で割った因数を格納するリスト\\n\\n factor = []\\n\\n #2で割れなくなった時点でストップ\\n\\n while n % 2 == 0:\\n\\n n //= 2 # ２で割った商を切り捨てて代入\\n\\n factor.append(2)\\n\\n #nが一度も２で割れなかったらそのまま返す\\n\\n if not factor:\\n\\n return [n]\\n\\n else:\\n\\n factor.append(n)\\n\\n return factor\\n\\n\\n\\n\\n\\ncount = 0\\n\\nfor i in a:\\n\\n temp = trial_division(i)\\n\\n count += temp.count(2)\\n\\n\\n\\nprint(count)',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 25,\n", + " 'code_v0_num_chars': 452,\n", + " 'code_v1_num_chars': 458,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\na = list(map(int, input().split()))\\n\\n\\ndef trial_division(n):\\n factor = []\\n tmp = int(math.sqrt(n)) + 1\\n for _ in range(2, tmp):\\n while n % 2 == 0:\\n n //= 2\\n factor.append(2)\\n if not factor:\\n return [n]\\n else:\\n factor.append(n)\\n return factor\\n\\n\\ncount = 0\\nfor i in a:\\n temp = trial_division(i)\\n count += temp.count(2)\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\n\\n\\ndef trial_division(n):\\n # ２で割った因数を格納するリスト\\n factor = []\\n # 2で割れなくなった時点でストップ\\n while n % 2 == 0:\\n n //= 2 # ２で割った商を切り捨てて代入\\n factor.append(2)\\n # nが一度も２で割れなかったらそのまま返す\\n if not factor:\\n return [n]\\n else:\\n factor.append(n)\\n return factor\\n\\n\\ncount = 0\\nfor i in a:\\n temp = trial_division(i)\\n count += temp.count(2)\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '+ # ２で割った因数を格納するリスト',\n", + " '- tmp = int(math.sqrt(n)) + 1',\n", + " '- for _ in range(2, tmp):',\n", + " '- while n % 2 == 0:',\n", + " '- n //= 2',\n", + " '- factor.append(2)',\n", + " '+ # 2で割れなくなった時点でストップ',\n", + " '+ while n % 2 == 0:',\n", + " '+ n //= 2 # ２で割った商を切り捨てて代入',\n", + " '+ factor.append(2)',\n", + " '+ # nが一度も２で割れなかったらそのまま返す'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4331856866,\n", + " 'measured_runtime_v1': 0.3346704168,\n", + " 'runtime_lift': 1.2943650373,\n", + " 'key': ['s752541577', 's744339126']},\n", + " {'user_id': 'u803617136',\n", + " 'problem_id': 'p02959',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's395849964',\n", + " 'submission_id_v1': 's383743178',\n", + " 'cpu_time_v0': 279,\n", + " 'cpu_time_v1': 251,\n", + " 'memory_v0': 82148,\n", + " 'memory_v1': 18624,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.04,\n", + " 'input': 'N = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nb = list(map(int, input().split()))\\n\\na.reverse()\\n\\nb.reverse()\\n\\nans = 0\\n\\ncapacity = 0\\n\\nfor i in range(N):\\n\\n ans += min(b[i] + capacity, a[i])\\n\\n capacity = max(b[i] - max(a[i] - capacity, 0), 0)\\n\\nans += min(a[-1], capacity)\\n\\nprint(ans)',\n", + " 'target': 'n = int(eval(input()))\\n\\na = list(map(int, input().split()))\\n\\nb = list(map(int, input().split()))\\n\\n\\n\\na = a[::-1]\\n\\nb = b[::-1]\\n\\nans = 0\\n\\nfor i, bi in enumerate(b):\\n\\n ans += min(a[i], b[i])\\n\\n remain = max(0, b[i] - a[i])\\n\\n ans += min(a[i + 1], remain)\\n\\n a[i + 1] = max(0, a[i + 1] - remain)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 294,\n", + " 'code_v1_num_chars': 305,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.reverse()\\nb.reverse()\\nans = 0\\ncapacity = 0\\nfor i in range(N):\\n ans += min(b[i] + capacity, a[i])\\n capacity = max(b[i] - max(a[i] - capacity, 0), 0)\\nans += min(a[-1], capacity)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = a[::-1]\\nb = b[::-1]\\nans = 0\\nfor i, bi in enumerate(b):\\n ans += min(a[i], b[i])\\n remain = max(0, b[i] - a[i])\\n ans += min(a[i + 1], remain)\\n a[i + 1] = max(0, a[i + 1] - remain)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '+n = int(eval(input()))',\n", + " '-a.reverse()',\n", + " '-b.reverse()',\n", + " '+a = a[::-1]',\n", + " '+b = b[::-1]',\n", + " '-capacity = 0',\n", + " '-for i in range(N):',\n", + " '- ans += min(b[i] + capacity, a[i])',\n", + " '- capacity = max(b[i] - max(a[i] - capacity, 0), 0)',\n", + " '-ans += min(a[-1], capacity)',\n", + " '+for i, bi in enumerate(b):',\n", + " '+ ans += min(a[i], b[i])',\n", + " '+ remain = max(0, b[i] - a[i])',\n", + " '+ ans += min(a[i + 1], remain)',\n", + " '+ a[i + 1] = max(0, a[i + 1] - remain)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2854677742,\n", + " 'measured_runtime_v1': 0.2055514226,\n", + " 'runtime_lift': 1.3887900679,\n", + " 'key': ['s395849964', 's383743178']},\n", + " {'user_id': 'u957843607',\n", + " 'problem_id': 'p02574',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's835620267',\n", + " 'submission_id_v1': 's021486096',\n", + " 'cpu_time_v0': 703,\n", + " 'cpu_time_v1': 584,\n", + " 'memory_v0': 134500,\n", + " 'memory_v1': 134400,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.93,\n", + " 'input': 'from math import gcd\\n\\n\\n\\nN = int(eval(input()))\\n\\nnum_lis = list(map(int, input().split()))\\n\\nc = True\\n\\n\\n\\ndef osa_k(max_num):\\n\\n lis = [i for i in range(max_num+1)]\\n\\n p = 2\\n\\n while p**2 <= max_num:\\n\\n if lis[p] == p:\\n\\n for q in range(2*p, max_num+1, p):\\n\\n if lis[q] == q:\\n\\n lis[q] = p\\n\\n p += 1\\n\\n return lis\\n\\n\\n\\nhoge = 0\\n\\nfor i in num_lis:\\n\\n hoge = gcd(hoge, i)\\n\\nif hoge > 1:\\n\\n print(\"not coprime\")\\n\\n exit()\\n\\n\\n\\nd_lis = osa_k(10**6+10)\\n\\ntmp = set()\\n\\nfor i in num_lis:\\n\\n num = i\\n\\n new_tmp = set()\\n\\n while num > 1:\\n\\n d = d_lis[num]\\n\\n new_tmp.add(d)\\n\\n num //= d\\n\\n for j in new_tmp:\\n\\n if j in tmp:\\n\\n c = False\\n\\n break\\n\\n else:\\n\\n tmp.add(j)\\n\\n else:\\n\\n continue\\n\\n break\\n\\n\\n\\nif c:\\n\\n print(\"pairwise coprime\")\\n\\nelse:\\n\\n print(\"setwise coprime\")',\n", + " 'target': 'from math import gcd\\n\\n\\n\\nN = int(eval(input()))\\n\\nnum_lis = list(map(int, input().split()))\\n\\n\\n\\ndef osa_k(max_num):\\n\\n lis = [i for i in range(max_num+1)]\\n\\n p = 2\\n\\n while p**2 <= max_num:\\n\\n if lis[p] == p:\\n\\n for q in range(2*p, max_num+1, p):\\n\\n if lis[q] == q:\\n\\n lis[q] = p\\n\\n p += 1\\n\\n return lis\\n\\n\\n\\nhoge = 0\\n\\nfor i in num_lis:\\n\\n hoge = gcd(hoge, i)\\n\\nif hoge > 1:\\n\\n print(\"not coprime\")\\n\\n exit()\\n\\n\\n\\nd_lis = osa_k(max(num_lis))\\n\\ntmp = set()\\n\\nfor i in num_lis:\\n\\n num = i\\n\\n new_tmp = set()\\n\\n while num > 1:\\n\\n d = d_lis[num]\\n\\n new_tmp.add(d)\\n\\n num //= d\\n\\n for j in new_tmp:\\n\\n if j in tmp:\\n\\n print(\"setwise coprime\")\\n\\n exit()\\n\\n else:\\n\\n tmp.add(j)\\n\\nprint(\"pairwise coprime\")',\n", + " 'code_v0_loc': 47,\n", + " 'code_v1_loc': 39,\n", + " 'code_v0_num_chars': 793,\n", + " 'code_v1_num_chars': 725,\n", + " 'code_v0_no_empty_lines': 'from math import gcd\\n\\nN = int(eval(input()))\\nnum_lis = list(map(int, input().split()))\\nc = True\\n\\n\\ndef osa_k(max_num):\\n lis = [i for i in range(max_num + 1)]\\n p = 2\\n while p**2 <= max_num:\\n if lis[p] == p:\\n for q in range(2 * p, max_num + 1, p):\\n if lis[q] == q:\\n lis[q] = p\\n p += 1\\n return lis\\n\\n\\nhoge = 0\\nfor i in num_lis:\\n hoge = gcd(hoge, i)\\nif hoge > 1:\\n print(\"not coprime\")\\n exit()\\nd_lis = osa_k(10**6 + 10)\\ntmp = set()\\nfor i in num_lis:\\n num = i\\n new_tmp = set()\\n while num > 1:\\n d = d_lis[num]\\n new_tmp.add(d)\\n num //= d\\n for j in new_tmp:\\n if j in tmp:\\n c = False\\n break\\n else:\\n tmp.add(j)\\n else:\\n continue\\n break\\nif c:\\n print(\"pairwise coprime\")\\nelse:\\n print(\"setwise coprime\")\\n',\n", + " 'code_v1_no_empty_lines': 'from math import gcd\\n\\nN = int(eval(input()))\\nnum_lis = list(map(int, input().split()))\\n\\n\\ndef osa_k(max_num):\\n lis = [i for i in range(max_num + 1)]\\n p = 2\\n while p**2 <= max_num:\\n if lis[p] == p:\\n for q in range(2 * p, max_num + 1, p):\\n if lis[q] == q:\\n lis[q] = p\\n p += 1\\n return lis\\n\\n\\nhoge = 0\\nfor i in num_lis:\\n hoge = gcd(hoge, i)\\nif hoge > 1:\\n print(\"not coprime\")\\n exit()\\nd_lis = osa_k(max(num_lis))\\ntmp = set()\\nfor i in num_lis:\\n num = i\\n new_tmp = set()\\n while num > 1:\\n d = d_lis[num]\\n new_tmp.add(d)\\n num //= d\\n for j in new_tmp:\\n if j in tmp:\\n print(\"setwise coprime\")\\n exit()\\n else:\\n tmp.add(j)\\nprint(\"pairwise coprime\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.0212765957,\n", + " 'diff': ['-c = True',\n", + " '-d_lis = osa_k(10**6 + 10)',\n", + " '+d_lis = osa_k(max(num_lis))',\n", + " '- c = False',\n", + " '- break',\n", + " '+ print(\"setwise coprime\")',\n", + " '+ exit()',\n", + " '- else:',\n", + " '- continue',\n", + " '- break',\n", + " '-if c:',\n", + " '- print(\"pairwise coprime\")',\n", + " '-else:',\n", + " '- print(\"setwise coprime\")',\n", + " '+print(\"pairwise coprime\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.272307416,\n", + " 'measured_runtime_v1': 0.2046107306,\n", + " 'runtime_lift': 11.1055144012,\n", + " 'key': ['s835620267', 's021486096']},\n", + " {'user_id': 'u111365362',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's326793866',\n", + " 'submission_id_v1': 's577051886',\n", + " 'cpu_time_v0': 202,\n", + " 'cpu_time_v1': 174,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.86,\n", + " 'input': 'n = int(eval(input()))\\n\\nr = int(n**.5)\\n\\nfor i in range(r):\\n\\n if n % (r-i) == 0:\\n\\n print(( (r-i) + n//(r-i) - 2 ))\\n\\n break',\n", + " 'target': 'n = int(eval(input()))\\n\\ns = int(n**.5)\\n\\nfor i in range(s):\\n\\n if n % (s-i) == 0:\\n\\n print(((s-i) + n // (s-i) - 2))\\n\\n break',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 120,\n", + " 'code_v1_num_chars': 120,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nr = int(n**0.5)\\nfor i in range(r):\\n if n % (r - i) == 0:\\n print(((r - i) + n // (r - i) - 2))\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\ns = int(n**0.5)\\nfor i in range(s):\\n if n % (s - i) == 0:\\n print(((s - i) + n // (s - i) - 2))\\n break\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-r = int(n**0.5)',\n", + " '-for i in range(r):',\n", + " '- if n % (r - i) == 0:',\n", + " '- print(((r - i) + n // (r - i) - 2))',\n", + " '+s = int(n**0.5)',\n", + " '+for i in range(s):',\n", + " '+ if n % (s - i) == 0:',\n", + " '+ print(((s - i) + n // (s - i) - 2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3217455449,\n", + " 'measured_runtime_v1': 0.1190871449,\n", + " 'runtime_lift': 2.7017655456,\n", + " 'key': ['s326793866', 's577051886']},\n", + " {'user_id': 'u867069435',\n", + " 'problem_id': 'p03399',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's852784971',\n", + " 'submission_id_v1': 's460322800',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'a, b, c, d = int(eval(input())), int(eval(input())), int(eval(input())), int(eval(input())),\\n\\nprint((min(a, b)+min(c, d)))',\n", + " 'target': 'print((min(int(eval(input())), int(eval(input()))) + min(int(eval(input())), int(eval(input())))))',\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 1,\n", + " 'code_v0_num_chars': 96,\n", + " 'code_v1_num_chars': 72,\n", + " 'code_v0_no_empty_lines': 'a, b, c, d = (\\n int(eval(input())),\\n int(eval(input())),\\n int(eval(input())),\\n int(eval(input())),\\n)\\nprint((min(a, b) + min(c, d)))\\n',\n", + " 'code_v1_no_empty_lines': 'print(\\n (\\n min(int(eval(input())), int(eval(input())))\\n + min(int(eval(input())), int(eval(input())))\\n )\\n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-a, b, c, d = (',\n", + " '- int(eval(input())),',\n", + " '- int(eval(input())),',\n", + " '- int(eval(input())),',\n", + " '- int(eval(input())),',\n", + " '+print(',\n", + " '+ (',\n", + " '+ min(int(eval(input())), int(eval(input())))',\n", + " '+ + min(int(eval(input())), int(eval(input())))',\n", + " '+ )',\n", + " '-print((min(a, b) + min(c, d)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2959700694,\n", + " 'measured_runtime_v1': 0.2359499116,\n", + " 'runtime_lift': 1.2543766912,\n", + " 'key': ['s852784971', 's460322800']},\n", + " {'user_id': 'u577170763',\n", + " 'problem_id': 'p03608',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's067652861',\n", + " 'submission_id_v1': 's587574381',\n", + " 'cpu_time_v0': 1958,\n", + " 'cpu_time_v1': 443,\n", + " 'memory_v0': 17188,\n", + " 'memory_v1': 48088,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 77.37,\n", + " 'input': 'import itertools\\n\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\n\\n\\nN, M, R = list(map(int, input().split()))\\n\\nr = tuple(map(int, input().split()))\\n\\n\\n\\nINF = 10**10\\n\\n\\n\\nd = [[INF] * N for _ in range(N)]\\n\\n\\n\\nfor i in range(N):\\n\\n d[i][i] = 0\\n\\n\\n\\nfor _ in range(M):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n if d[a][b] > c:\\n\\n d[a][b] = c\\n\\n d[b][a] = c\\n\\n\\n\\n\\n\\ndef warshall(d):\\n\\n for k in range(N):\\n\\n for i in range(N):\\n\\n for j in range(N):\\n\\n if d[i][j] > d[i][k] + d[k][j]:\\n\\n d[i][j] = d[i][k] + d[k][j]\\n\\n\\n\\n\\n\\n# d = floyd_warshall(d)\\n\\nwarshall(d)\\n\\n\\n\\n\\n\\nans = INF\\n\\nfor p in itertools.permutations(r):\\n\\n dist = 0\\n\\n for i in range(R-1):\\n\\n dist += d[p[i]-1][p[i+1]-1]\\n\\n\\n\\n if ans > dist:\\n\\n ans = dist\\n\\n\\n\\nprint((int(ans)))',\n", + " 'target': 'import itertools\\n\\n\\n\\nN, M, R = list(map(int, input().split()))\\n\\nr = tuple(map(int, input().split()))\\n\\n\\n\\nINF = 10**10\\n\\n\\n\\nd = [[INF] * N for _ in range(N)]\\n\\n\\n\\nfor i in range(N):\\n\\n d[i][i] = 0\\n\\n\\n\\nfor _ in range(M):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n if d[a][b] > c:\\n\\n d[a][b] = c\\n\\n d[b][a] = c\\n\\n\\n\\n\\n\\ndef warshall(d):\\n\\n for k in range(N):\\n\\n for i in range(N):\\n\\n for j in range(N):\\n\\n if d[i][j] > d[i][k] + d[k][j]:\\n\\n d[i][j] = d[i][k] + d[k][j]\\n\\n\\n\\n\\n\\n# d = floyd_warshall(d)\\n\\nwarshall(d)\\n\\n\\n\\n\\n\\nans = INF\\n\\nfor p in itertools.permutations(r):\\n\\n dist = 0\\n\\n for i in range(R-1):\\n\\n dist += d[p[i]-1][p[i+1]-1]\\n\\n\\n\\n if ans > dist:\\n\\n ans = dist\\n\\n\\n\\nprint((int(ans)))\\n',\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 43,\n", + " 'code_v0_num_chars': 820,\n", + " 'code_v1_num_chars': 772,\n", + " 'code_v0_no_empty_lines': 'import itertools\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\nN, M, R = list(map(int, input().split()))\\nr = tuple(map(int, input().split()))\\nINF = 10**10\\nd = [[INF] * N for _ in range(N)]\\nfor i in range(N):\\n d[i][i] = 0\\nfor _ in range(M):\\n a, b, c = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n if d[a][b] > c:\\n d[a][b] = c\\n d[b][a] = c\\n\\n\\ndef warshall(d):\\n for k in range(N):\\n for i in range(N):\\n for j in range(N):\\n if d[i][j] > d[i][k] + d[k][j]:\\n d[i][j] = d[i][k] + d[k][j]\\n\\n\\n# d = floyd_warshall(d)\\nwarshall(d)\\nans = INF\\nfor p in itertools.permutations(r):\\n dist = 0\\n for i in range(R - 1):\\n dist += d[p[i] - 1][p[i + 1] - 1]\\n if ans > dist:\\n ans = dist\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'import itertools\\n\\nN, M, R = list(map(int, input().split()))\\nr = tuple(map(int, input().split()))\\nINF = 10**10\\nd = [[INF] * N for _ in range(N)]\\nfor i in range(N):\\n d[i][i] = 0\\nfor _ in range(M):\\n a, b, c = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n if d[a][b] > c:\\n d[a][b] = c\\n d[b][a] = c\\n\\n\\ndef warshall(d):\\n for k in range(N):\\n for i in range(N):\\n for j in range(N):\\n if d[i][j] > d[i][k] + d[k][j]:\\n d[i][j] = d[i][k] + d[k][j]\\n\\n\\n# d = floyd_warshall(d)\\nwarshall(d)\\nans = INF\\nfor p in itertools.permutations(r):\\n dist = 0\\n for i in range(R - 1):\\n dist += d[p[i] - 1][p[i + 1] - 1]\\n if ans > dist:\\n ans = dist\\nprint((int(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.2727272727,\n", + " 'diff': ['-from scipy.sparse.csgraph import floyd_warshall'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2044888918,\n", + " 'measured_runtime_v1': 0.0065318277,\n", + " 'runtime_lift': 31.3065349069,\n", + " 'key': ['s067652861', 's587574381']},\n", + " {'user_id': 'u390193191',\n", + " 'problem_id': 'p02647',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's850341435',\n", + " 'submission_id_v1': 's306393223',\n", + " 'cpu_time_v0': 1961,\n", + " 'cpu_time_v1': 306,\n", + " 'memory_v0': 185864,\n", + " 'memory_v1': 162940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.4,\n", + " 'input': 'import sys\\n\\nfrom collections import defaultdict, Counter, namedtuple, deque\\n\\nimport itertools\\n\\nimport functools\\n\\nimport bisect\\n\\nimport heapq\\n\\nimport math\\n\\n# from fractions import gcd\\n\\n\\n\\nMOD = 10 ** 9 + 7\\n\\n# MOD = 998244353\\n\\n# sys.setrecursionlimit(10**8)\\n\\n\\n\\nN, k = list(map(int, input().split()))\\n\\nprev_arr = list(map(int, input().split()))\\n\\n\\n\\n# N = k = 200000\\n\\n# prev_arr = [0]*N\\n\\n\\n\\ncount = 0\\n\\nfor i in range(min(k, 3*int(math.log(N))+5)):\\n\\n que = []\\n\\n arr = [0]*N\\n\\n for j in range(N):\\n\\n heapq.heappush(que, j+prev_arr[j])\\n\\n while que[0] < j:\\n\\n heapq.heappop(que)\\n\\n arr[j] += len(que)\\n\\n # print(arr)\\n\\n\\n\\n que = []\\n\\n for j in reversed(list(range(N))):\\n\\n heapq.heappush(que, -(j-prev_arr[j]))\\n\\n while -que[0] > j:\\n\\n heapq.heappop(que)\\n\\n arr[j] += len(que) - 1\\n\\n\\n\\n prev_arr = arr\\n\\n count += 1\\n\\n\\n\\n# print(count)\\n\\nprint((*prev_arr))\\n',\n", + " 'target': 'import sys\\n\\nfrom collections import defaultdict, Counter, namedtuple, deque\\n\\nimport itertools\\n\\nimport functools\\n\\nimport bisect\\n\\nimport heapq\\n\\nimport math\\n\\n# from fractions import gcd\\n\\n\\n\\nMOD = 10 ** 9 + 7\\n\\n# MOD = 998244353\\n\\n# sys.setrecursionlimit(10**8)\\n\\n\\n\\nN, k = list(map(int, input().split()))\\n\\nprev_arr = list(map(int, input().split()))\\n\\n\\n\\ncount = 0\\n\\nfor i in range(min(k, 3*int(math.log(N))+10)):\\n\\n arr = [0]*N\\n\\n for j in range(N):\\n\\n left = max(0, j-prev_arr[j])\\n\\n right = min(N-1, j+prev_arr[j])\\n\\n arr[left] += 1\\n\\n if right < N-1:\\n\\n arr[right+1] -= 1\\n\\n\\n\\n # print(arr)\\n\\n for j in range(1, N):\\n\\n arr[j] += arr[j-1]\\n\\n\\n\\n # print(arr)\\n\\n prev_arr = arr\\n\\n count += 1\\n\\n\\n\\n# print(count)\\n\\nprint((*prev_arr))\\n',\n", + " 'code_v0_loc': 42,\n", + " 'code_v1_loc': 36,\n", + " 'code_v0_num_chars': 902,\n", + " 'code_v1_num_chars': 763,\n", + " 'code_v0_no_empty_lines': 'import sys\\nfrom collections import defaultdict, Counter, namedtuple, deque\\nimport itertools\\nimport functools\\nimport bisect\\nimport heapq\\nimport math\\n\\n# from fractions import gcd\\nMOD = 10**9 + 7\\n# MOD = 998244353\\n# sys.setrecursionlimit(10**8)\\nN, k = list(map(int, input().split()))\\nprev_arr = list(map(int, input().split()))\\n# N = k = 200000\\n# prev_arr = [0]*N\\ncount = 0\\nfor i in range(min(k, 3 * int(math.log(N)) + 5)):\\n que = []\\n arr = [0] * N\\n for j in range(N):\\n heapq.heappush(que, j + prev_arr[j])\\n while que[0] < j:\\n heapq.heappop(que)\\n arr[j] += len(que)\\n # print(arr)\\n que = []\\n for j in reversed(list(range(N))):\\n heapq.heappush(que, -(j - prev_arr[j]))\\n while -que[0] > j:\\n heapq.heappop(que)\\n arr[j] += len(que) - 1\\n prev_arr = arr\\n count += 1\\n# print(count)\\nprint((*prev_arr))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom collections import defaultdict, Counter, namedtuple, deque\\nimport itertools\\nimport functools\\nimport bisect\\nimport heapq\\nimport math\\n\\n# from fractions import gcd\\nMOD = 10**9 + 7\\n# MOD = 998244353\\n# sys.setrecursionlimit(10**8)\\nN, k = list(map(int, input().split()))\\nprev_arr = list(map(int, input().split()))\\ncount = 0\\nfor i in range(min(k, 3 * int(math.log(N)) + 10)):\\n arr = [0] * N\\n for j in range(N):\\n left = max(0, j - prev_arr[j])\\n right = min(N - 1, j + prev_arr[j])\\n arr[left] += 1\\n if right < N - 1:\\n arr[right + 1] -= 1\\n # print(arr)\\n for j in range(1, N):\\n arr[j] += arr[j - 1]\\n # print(arr)\\n prev_arr = arr\\n count += 1\\n# print(count)\\nprint((*prev_arr))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-# N = k = 200000',\n", + " '-# prev_arr = [0]*N',\n", + " '-for i in range(min(k, 3 * int(math.log(N)) + 5)):',\n", + " '- que = []',\n", + " '+for i in range(min(k, 3 * int(math.log(N)) + 10)):',\n", + " '- heapq.heappush(que, j + prev_arr[j])',\n", + " '- while que[0] < j:',\n", + " '- heapq.heappop(que)',\n", + " '- arr[j] += len(que)',\n", + " '+ left = max(0, j - prev_arr[j])',\n", + " '+ right = min(N - 1, j + prev_arr[j])',\n", + " '+ arr[left] += 1',\n", + " '+ if right < N - 1:',\n", + " '+ arr[right + 1] -= 1',\n", + " '- que = []',\n", + " '- for j in reversed(list(range(N))):',\n", + " '- heapq.heappush(que, -(j - prev_arr[j]))',\n", + " '- while -que[0] > j:',\n", + " '- heapq.heappop(que)',\n", + " '- arr[j] += len(que) - 1',\n", + " '+ for j in range(1, N):',\n", + " '+ arr[j] += arr[j - 1]',\n", + " '+ # print(arr)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1608536727,\n", + " 'measured_runtime_v1': 0.1279424147,\n", + " 'runtime_lift': 1.2572349291,\n", + " 'key': ['s850341435', 's306393223']},\n", + " {'user_id': 'u080364835',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's686787991',\n", + " 'submission_id_v1': 's327798112',\n", + " 'cpu_time_v0': 165,\n", + " 'cpu_time_v1': 27,\n", + " 'memory_v0': 13912,\n", + " 'memory_v1': 4468,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.64,\n", + " 'input': \"import numpy as np\\n\\n\\n\\nh, w = map(int, input().split())\\n\\nal = list(list(input()) for _ in range(h))\\n\\nal_n = np.array(al)\\n\\nrow = [0]*w\\n\\ncol = [0]*h\\n\\nfor i in range(h):\\n\\n for j in range(w):\\n\\n if al_n[i][j] == '.':\\n\\n row[j] += 1\\n\\n col[i] += 1\\n\\nrow_ = []\\n\\ncol_ = []\\n\\nfor i in range(w):\\n\\n if row[i] == h:\\n\\n row_.append(i)\\n\\n\\n\\nfor j in range(h):\\n\\n if col[j] == w:\\n\\n col_.append(j)\\n\\n\\n\\nif len(col_) > 0:\\n\\n al_n = np.delete(al_n, col_, axis=0)\\n\\n\\n\\nif len(row_) > 0:\\n\\n al_n = np.delete(al_n, row_, axis=1)\\n\\n\\n\\nfor a in al_n:\\n\\n print(*a, sep='')\\n\",\n", + " 'target': \"h, w = map(int, input().split())\\n\\nal = list(list(input()) for _ in range(h))\\n\\nrow = [0]*w\\n\\ncol = [0]*h\\n\\n\\n\\nfor i in range(h):\\n\\n for j in range(w):\\n\\n if al[i][j] == '#':\\n\\n col[i] += 1\\n\\n row[j] += 1\\n\\nans = []\\n\\nw_len = len(row) - row.count(0)\\n\\nfor i in range(h):\\n\\n tmp = ''\\n\\n if col[i] != 0:\\n\\n for j in range(w):\\n\\n if row[j] != 0:\\n\\n tmp += al[i][j]\\n\\n ans.append(tmp)\\n\\n\\n\\nfor a in ans:\\n\\n print(*a, sep='')\\n\",\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 591,\n", + " 'code_v1_num_chars': 480,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nh, w = map(int, input().split())\\nal = list(list(input()) for _ in range(h))\\nal_n = np.array(al)\\nrow = [0] * w\\ncol = [0] * h\\nfor i in range(h):\\n for j in range(w):\\n if al_n[i][j] == \".\":\\n row[j] += 1\\n col[i] += 1\\nrow_ = []\\ncol_ = []\\nfor i in range(w):\\n if row[i] == h:\\n row_.append(i)\\nfor j in range(h):\\n if col[j] == w:\\n col_.append(j)\\nif len(col_) > 0:\\n al_n = np.delete(al_n, col_, axis=0)\\nif len(row_) > 0:\\n al_n = np.delete(al_n, row_, axis=1)\\nfor a in al_n:\\n print(*a, sep=\"\")\\n',\n", + " 'code_v1_no_empty_lines': 'h, w = map(int, input().split())\\nal = list(list(input()) for _ in range(h))\\nrow = [0] * w\\ncol = [0] * h\\nfor i in range(h):\\n for j in range(w):\\n if al[i][j] == \"#\":\\n col[i] += 1\\n row[j] += 1\\nans = []\\nw_len = len(row) - row.count(0)\\nfor i in range(h):\\n tmp = \"\"\\n if col[i] != 0:\\n for j in range(w):\\n if row[j] != 0:\\n tmp += al[i][j]\\n ans.append(tmp)\\nfor a in ans:\\n print(*a, sep=\"\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-al_n = np.array(al)',\n", + " '- if al_n[i][j] == \".\":',\n", + " '+ if al[i][j] == \"#\":',\n", + " '+ col[i] += 1',\n", + " '- col[i] += 1',\n", + " '-row_ = []',\n", + " '-col_ = []',\n", + " '-for i in range(w):',\n", + " '- if row[i] == h:',\n", + " '- row_.append(i)',\n", + " '-for j in range(h):',\n", + " '- if col[j] == w:',\n", + " '- col_.append(j)',\n", + " '-if len(col_) > 0:',\n", + " '- al_n = np.delete(al_n, col_, axis=0)',\n", + " '-if len(row_) > 0:',\n", + " '- al_n = np.delete(al_n, row_, axis=1)',\n", + " '-for a in al_n:',\n", + " '+ans = []',\n", + " '+w_len = len(row) - row.count(0)',\n", + " '+for i in range(h):',\n", + " '+ tmp = \"\"',\n", + " '+ if col[i] != 0:',\n", + " '+ for j in range(w):',\n", + " '+ if row[j] != 0:',\n", + " '+ tmp += al[i][j]',\n", + " '+ ans.append(tmp)',\n", + " '+for a in ans:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7321008713,\n", + " 'measured_runtime_v1': 0.1549179929,\n", + " 'runtime_lift': 4.7257317083,\n", + " 'key': ['s686787991', 's327798112']},\n", + " {'user_id': 'u625963200',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's320395863',\n", + " 'submission_id_v1': 's758503304',\n", + " 'cpu_time_v0': 1881,\n", + " 'cpu_time_v1': 1669,\n", + " 'memory_v0': 41792,\n", + " 'memory_v1': 43596,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.27,\n", + " 'input': 'import numpy as np\\n\\nn=int(eval(input()))\\n\\nABC=[list(map(int,input().split())) for _ in range(n)]\\n\\n\\n\\ndp=np.zeros((n,3),int)\\n\\nfor i in range(3):\\n\\n dp[0][i]=ABC[0][i]\\n\\nfor i in range(n-1):\\n\\n for j in range(3):\\n\\n dp[i+1][j]=max(dp[i][(j+1)%3]+ABC[i+1][j], dp[i][(j+2)%3]+ABC[i+1][j])\\n\\nprint((max(dp[-1])))',\n", + " 'target': 'import numpy as np\\n\\nn=int(eval(input()))\\n\\nABC=[list(map(int,input().split())) for _ in range(n)]\\n\\n\\n\\ndp=np.zeros((n,3),int)\\n\\nfor i in range(3):\\n\\n dp[0,i]=ABC[0][i]\\n\\nfor i in range(1,n):\\n\\n for j in range(3):\\n\\n dp[i,j]=max(dp[i-1,(j+1)%3]+ABC[i][j],dp[i-1,(j+2)%3]+ABC[i][j])\\n\\nprint((max(dp[-1])))',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 298,\n", + " 'code_v1_num_chars': 291,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nABC = [list(map(int, input().split())) for _ in range(n)]\\ndp = np.zeros((n, 3), int)\\nfor i in range(3):\\n dp[0][i] = ABC[0][i]\\nfor i in range(n - 1):\\n for j in range(3):\\n dp[i + 1][j] = max(\\n dp[i][(j + 1) % 3] + ABC[i + 1][j], dp[i][(j + 2) % 3] + ABC[i + 1][j]\\n )\\nprint((max(dp[-1])))\\n',\n", + " 'code_v1_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nABC = [list(map(int, input().split())) for _ in range(n)]\\ndp = np.zeros((n, 3), int)\\nfor i in range(3):\\n dp[0, i] = ABC[0][i]\\nfor i in range(1, n):\\n for j in range(3):\\n dp[i, j] = max(\\n dp[i - 1, (j + 1) % 3] + ABC[i][j], dp[i - 1, (j + 2) % 3] + ABC[i][j]\\n )\\nprint((max(dp[-1])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- dp[0][i] = ABC[0][i]',\n", + " '-for i in range(n - 1):',\n", + " '+ dp[0, i] = ABC[0][i]',\n", + " '+for i in range(1, n):',\n", + " '- dp[i + 1][j] = max(',\n", + " '- dp[i][(j + 1) % 3] + ABC[i + 1][j], dp[i][(j + 2) % 3] + ABC[i + 1][j]',\n", + " '+ dp[i, j] = max(',\n", + " '+ dp[i - 1, (j + 1) % 3] + ABC[i][j], dp[i - 1, (j + 2) % 3] + ABC[i][j]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5948334725,\n", + " 'measured_runtime_v1': 0.0064303148,\n", + " 'runtime_lift': 248.0179469827,\n", + " 'key': ['s320395863', 's758503304']},\n", + " {'user_id': 'u581187895',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's723376959',\n", + " 'submission_id_v1': 's506730917',\n", + " 'cpu_time_v0': 187,\n", + " 'cpu_time_v1': 105,\n", + " 'memory_v0': 23344,\n", + " 'memory_v1': 25116,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.85,\n", + " 'input': 'import numpy as np\\n\\nimport sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nN, K = list(map(int, readline().split()))\\n\\nA = np.array(readline().split(), dtype=np.int64) + 1\\n\\n\\n\\n\\n\\nAcum = np.zeros(N+1, np.float64)\\n\\nAcum[1:] = A.cumsum()\\n\\n\\n\\nx = Acum[K:] - Acum[:-K]\\n\\nprint((x.max()/2))\\n',\n", + " 'target': 'import sys\\n\\nsys.setrecursionlimit(10 ** 7)\\n\\nread = sys.stdin.buffer.read \\n\\ninput = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines \\n\\n\\n\\nfrom itertools import accumulate\\n\\n\\n\\nN, K = list(map(int, input().split()))\\n\\nP = list(map(int, input().split()))\\n\\nPcum = list(accumulate([0] + [(1+p)/2 for p in P]))\\n\\n\\n\\nans = max(right - left for left, right in zip(Pcum, Pcum[K:]))\\n\\nprint(ans) ',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 339,\n", + " 'code_v1_num_chars': 392,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nN, K = list(map(int, readline().split()))\\nA = np.array(readline().split(), dtype=np.int64) + 1\\nAcum = np.zeros(N + 1, np.float64)\\nAcum[1:] = A.cumsum()\\nx = Acum[K:] - Acum[:-K]\\nprint((x.max() / 2))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(10**7)\\nread = sys.stdin.buffer.read\\ninput = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nfrom itertools import accumulate\\n\\nN, K = list(map(int, input().split()))\\nP = list(map(int, input().split()))\\nPcum = list(accumulate([0] + [(1 + p) / 2 for p in P]))\\nans = max(right - left for left, right in zip(Pcum, Pcum[K:]))\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '+sys.setrecursionlimit(10**7)',\n", + " '-readline = sys.stdin.buffer.readline',\n", + " '+input = sys.stdin.buffer.readline',\n", + " '-N, K = list(map(int, readline().split()))',\n", + " '-A = np.array(readline().split(), dtype=np.int64) + 1',\n", + " '-Acum = np.zeros(N + 1, np.float64)',\n", + " '-Acum[1:] = A.cumsum()',\n", + " '-x = Acum[K:] - Acum[:-K]',\n", + " '-print((x.max() / 2))',\n", + " '+from itertools import accumulate',\n", + " '+',\n", + " '+N, K = list(map(int, input().split()))',\n", + " '+P = list(map(int, input().split()))',\n", + " '+Pcum = list(accumulate([0] + [(1 + p) / 2 for p in P]))',\n", + " '+ans = max(right - left for left, right in zip(Pcum, Pcum[K:]))',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3171086328,\n", + " 'measured_runtime_v1': 0.2014067566,\n", + " 'runtime_lift': 6.539545419,\n", + " 'key': ['s723376959', 's506730917']},\n", + " {'user_id': 'u321071346',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's013135216',\n", + " 'submission_id_v1': 's040740173',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 30,\n", + " 'memory_v0': 27148,\n", + " 'memory_v1': 9044,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 74.58,\n", + " 'input': 'import numpy as np\\n\\nn = int(eval(input()))\\n\\na_list = np.array(list(map(int, input().split())))\\n\\n\\n\\ncounter = 0\\n\\nwhile True:\\n\\n if np.sum(a_list % 2) > 0:\\n\\n break\\n\\n counter += 1\\n\\n a_list = a_list / 2\\n\\nprint(counter)\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\na_list = list(map(int, input().split()))\\n\\n\\n\\nstatus = True\\n\\nexecute = 0\\n\\nwhile status:\\n\\n for i in range(n):\\n\\n if a_list[i] % 2 == 1:\\n\\n status = False\\n\\n break\\n\\n else:\\n\\n a_list[i] = a_list[i] / 2\\n\\n if status:\\n\\n execute += 1\\n\\nprint(execute)\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 15,\n", + " 'code_v0_num_chars': 223,\n", + " 'code_v1_num_chars': 315,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\na_list = np.array(list(map(int, input().split())))\\ncounter = 0\\nwhile True:\\n if np.sum(a_list % 2) > 0:\\n break\\n counter += 1\\n a_list = a_list / 2\\nprint(counter)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na_list = list(map(int, input().split()))\\nstatus = True\\nexecute = 0\\nwhile status:\\n for i in range(n):\\n if a_list[i] % 2 == 1:\\n status = False\\n break\\n else:\\n a_list[i] = a_list[i] / 2\\n if status:\\n execute += 1\\nprint(execute)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.6666666667,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-a_list = np.array(list(map(int, input().split())))',\n", + " '-counter = 0',\n", + " '-while True:',\n", + " '- if np.sum(a_list % 2) > 0:',\n", + " '- break',\n", + " '- counter += 1',\n", + " '- a_list = a_list / 2',\n", + " '-print(counter)',\n", + " '+a_list = list(map(int, input().split()))',\n", + " '+status = True',\n", + " '+execute = 0',\n", + " '+while status:',\n", + " '+ for i in range(n):',\n", + " '+ if a_list[i] % 2 == 1:',\n", + " '+ status = False',\n", + " '+ break',\n", + " '+ else:',\n", + " '+ a_list[i] = a_list[i] / 2',\n", + " '+ if status:',\n", + " '+ execute += 1',\n", + " '+print(execute)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2315113308,\n", + " 'measured_runtime_v1': 0.1929617555,\n", + " 'runtime_lift': 6.3821523985,\n", + " 'key': ['s013135216', 's040740173']},\n", + " {'user_id': 'u094191970',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's633729388',\n", + " 'submission_id_v1': 's318413779',\n", + " 'cpu_time_v0': 213,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 15412,\n", + " 'memory_v1': 3436,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.51,\n", + " 'input': \"from copy import deepcopy\\n\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\n\\n\\nn,m=list(map(int,input().split()))\\n\\nl=[list(map(int,input().split())) for i in range(m)]\\n\\n\\n\\ncnt=0\\n\\nfor i in range(m):\\n\\n ll=deepcopy(l)\\n\\n del ll[i]\\n\\n\\n\\n d=[[float('inf')]*n for i in range(n)]\\n\\n for i in range(n):\\n\\n d[i][i]=0\\n\\n\\n\\n for a,b in ll:\\n\\n a-=1\\n\\n b-=1\\n\\n d[a][b]=1\\n\\n d[b][a]=1\\n\\n\\n\\n s=floyd_warshall(d)\\n\\n for i in s:\\n\\n if float('inf') in i:\\n\\n cnt+=1\\n\\n break\\n\\n\\n\\nprint(cnt)\",\n", + " 'target': 'from collections import deque\\n\\nfrom copy import deepcopy\\n\\n\\n\\nn,m=list(map(int,input().split()))\\n\\nl=[list(map(int,input().split())) for i in range(m)]\\n\\n\\n\\ndef BFS(m):\\n\\n t_l=deepcopy(l)\\n\\n del t_l[m]\\n\\n\\n\\n tree=[[] for j in range(n)]\\n\\n for a,b in t_l:\\n\\n a-=1\\n\\n b-=1\\n\\n tree[a].append(b)\\n\\n tree[b].append(a)\\n\\n\\n\\n dist=[-1 for i in range(n)]\\n\\n dist[0]=0\\n\\n\\n\\n que=deque()\\n\\n que.append(0)\\n\\n\\n\\n while que:\\n\\n x=que.popleft()\\n\\n for i in tree[x]:\\n\\n if dist[i]==-1:\\n\\n que.append(i)\\n\\n dist[i]=dist[x]+1\\n\\n\\n\\n return dist\\n\\n\\n\\nans=0\\n\\nfor i in range(m):\\n\\n d=BFS(i)\\n\\n if -1 in d:\\n\\n ans+=1\\n\\n\\n\\nprint(ans)',\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 39,\n", + " 'code_v0_num_chars': 479,\n", + " 'code_v1_num_chars': 620,\n", + " 'code_v0_no_empty_lines': 'from copy import deepcopy\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\nn, m = list(map(int, input().split()))\\nl = [list(map(int, input().split())) for i in range(m)]\\ncnt = 0\\nfor i in range(m):\\n ll = deepcopy(l)\\n del ll[i]\\n d = [[float(\"inf\")] * n for i in range(n)]\\n for i in range(n):\\n d[i][i] = 0\\n for a, b in ll:\\n a -= 1\\n b -= 1\\n d[a][b] = 1\\n d[b][a] = 1\\n s = floyd_warshall(d)\\n for i in s:\\n if float(\"inf\") in i:\\n cnt += 1\\n break\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque\\nfrom copy import deepcopy\\n\\nn, m = list(map(int, input().split()))\\nl = [list(map(int, input().split())) for i in range(m)]\\n\\n\\ndef BFS(m):\\n t_l = deepcopy(l)\\n del t_l[m]\\n tree = [[] for j in range(n)]\\n for a, b in t_l:\\n a -= 1\\n b -= 1\\n tree[a].append(b)\\n tree[b].append(a)\\n dist = [-1 for i in range(n)]\\n dist[0] = 0\\n que = deque()\\n que.append(0)\\n while que:\\n x = que.popleft()\\n for i in tree[x]:\\n if dist[i] == -1:\\n que.append(i)\\n dist[i] = dist[x] + 1\\n return dist\\n\\n\\nans = 0\\nfor i in range(m):\\n d = BFS(i)\\n if -1 in d:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 28.2051282051,\n", + " 'diff': ['+from collections import deque',\n", + " '-from scipy.sparse.csgraph import floyd_warshall',\n", + " '-cnt = 0',\n", + " '-for i in range(m):',\n", + " '- ll = deepcopy(l)',\n", + " '- del ll[i]',\n", + " '- d = [[float(\"inf\")] * n for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- d[i][i] = 0',\n", + " '- for a, b in ll:',\n", + " '+',\n", + " '+',\n", + " '+def BFS(m):',\n", + " '+ t_l = deepcopy(l)',\n", + " '+ del t_l[m]',\n", + " '+ tree = [[] for j in range(n)]',\n", + " '+ for a, b in t_l:',\n", + " '- d[a][b] = 1',\n", + " '- d[b][a] = 1',\n", + " '- s = floyd_warshall(d)',\n", + " '- for i in s:',\n", + " '- if float(\"inf\") in i:',\n", + " '- cnt += 1',\n", + " '- break',\n", + " '-print(cnt)',\n", + " '+ tree[a].append(b)',\n", + " '+ tree[b].append(a)',\n", + " '+ dist = [-1 for i in range(n)]',\n", + " '+ dist[0] = 0',\n", + " '+ que = deque()',\n", + " '+ que.append(0)',\n", + " '+ while que:',\n", + " '+ x = que.popleft()',\n", + " '+ for i in tree[x]:',\n", + " '+ if dist[i] == -1:',\n", + " '+ que.append(i)',\n", + " '+ dist[i] = dist[x] + 1',\n", + " '+ return dist',\n", + " '+',\n", + " '+',\n", + " '+ans = 0',\n", + " '+for i in range(m):',\n", + " '+ d = BFS(i)',\n", + " '+ if -1 in d:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9204517574,\n", + " 'measured_runtime_v1': 0.2149319355,\n", + " 'runtime_lift': 8.9351624385,\n", + " 'key': ['s633729388', 's318413779']},\n", + " {'user_id': 'u353919145',\n", + " 'problem_id': 'p02959',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's078643579',\n", + " 'submission_id_v1': 's464947070',\n", + " 'cpu_time_v0': 144,\n", + " 'cpu_time_v1': 114,\n", + " 'memory_v0': 24244,\n", + " 'memory_v1': 97748,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.83,\n", + " 'input': 'from sys import stdin,stdout\\n\\n\\n\\nif __name__==\"__main__\":\\n\\n n=int(stdin.readline())\\n\\n\\n\\n a=[int(x) for x in stdin.readline().split()]\\n\\n b=[int(x) for x in stdin.readline().split()]\\n\\n\\n\\n cnt=0\\n\\n\\n\\n for i in range(n):\\n\\n if(a[i]>=b[i]):\\n\\n cnt+=b[i]\\n\\n else:\\n\\n cnt+=a[i]\\n\\n d=b[i]-a[i]\\n\\n cnt+=min(a[i+1],d)\\n\\n if(d>a[i+1]):\\n\\n a[i+1]=0\\n\\n else: a[i+1]-=d\\n\\n \\n\\n stdout.write(str(cnt)+\"\\\\n\")\\n',\n", + " 'target': 'n = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\nB = list(map(int, input().split()))\\n\\na1 = sum(A)\\n\\nfor i in range(n):\\n\\n b = B[i]\\n\\n if A[i] >= b:A[i] -= b\\n\\n else:\\n\\n if A[i+1]+A[i] >= b:\\n\\n A[i+1] = A[i+1]+A[i]-b\\n\\n A[i] = 0\\n\\n else:A[i], A[i+1] = 0, 0\\n\\na2 = sum(A)\\n\\nprint((a1-a2))',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 499,\n", + " 'code_v1_num_chars': 299,\n", + " 'code_v0_no_empty_lines': 'from sys import stdin, stdout\\n\\nif __name__ == \"__main__\":\\n n = int(stdin.readline())\\n a = [int(x) for x in stdin.readline().split()]\\n b = [int(x) for x in stdin.readline().split()]\\n cnt = 0\\n for i in range(n):\\n if a[i] >= b[i]:\\n cnt += b[i]\\n else:\\n cnt += a[i]\\n d = b[i] - a[i]\\n cnt += min(a[i + 1], d)\\n if d > a[i + 1]:\\n a[i + 1] = 0\\n else:\\n a[i + 1] -= d\\n stdout.write(str(cnt) + \"\\\\n\")\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\na1 = sum(A)\\nfor i in range(n):\\n b = B[i]\\n if A[i] >= b:\\n A[i] -= b\\n else:\\n if A[i + 1] + A[i] >= b:\\n A[i + 1] = A[i + 1] + A[i] - b\\n A[i] = 0\\n else:\\n A[i], A[i + 1] = 0, 0\\na2 = sum(A)\\nprint((a1 - a2))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.3636363636,\n", + " 'diff': ['-from sys import stdin, stdout',\n", + " '-',\n", + " '-if __name__ == \"__main__\":',\n", + " '- n = int(stdin.readline())',\n", + " '- a = [int(x) for x in stdin.readline().split()]',\n", + " '- b = [int(x) for x in stdin.readline().split()]',\n", + " '- cnt = 0',\n", + " '- for i in range(n):',\n", + " '- if a[i] >= b[i]:',\n", + " '- cnt += b[i]',\n", + " '+n = int(eval(input()))',\n", + " '+A = list(map(int, input().split()))',\n", + " '+B = list(map(int, input().split()))',\n", + " '+a1 = sum(A)',\n", + " '+for i in range(n):',\n", + " '+ b = B[i]',\n", + " '+ if A[i] >= b:',\n", + " '+ A[i] -= b',\n", + " '+ else:',\n", + " '+ if A[i + 1] + A[i] >= b:',\n", + " '+ A[i + 1] = A[i + 1] + A[i] - b',\n", + " '+ A[i] = 0',\n", + " '- cnt += a[i]',\n", + " '- d = b[i] - a[i]',\n", + " '- cnt += min(a[i + 1], d)',\n", + " '- if d > a[i + 1]:',\n", + " '- a[i + 1] = 0',\n", + " '- else:',\n", + " '- a[i + 1] -= d',\n", + " '- stdout.write(str(cnt) + \"\\\\n\")',\n", + " '+ A[i], A[i + 1] = 0, 0',\n", + " '+a2 = sum(A)',\n", + " '+print((a1 - a2))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2530250838,\n", + " 'measured_runtime_v1': 0.0949857178,\n", + " 'runtime_lift': 2.6638224113,\n", + " 'key': ['s078643579', 's464947070']},\n", + " {'user_id': 'u426534722',\n", + " 'problem_id': 'p02245',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's804728708',\n", + " 'submission_id_v1': 's622088378',\n", + " 'cpu_time_v0': 760,\n", + " 'cpu_time_v1': 650,\n", + " 'memory_v0': 25996,\n", + " 'memory_v1': 31348,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.47,\n", + " 'input': 'from collections import deque\\n\\nfrom copy import deepcopy, copy\\n\\ndy = [-1, 0, 0, 1]\\n\\ndx = [0, -1, 1, 0]\\n\\nN = 3\\n\\ndef g(i, j, a):\\n\\n t = a // (10 ** j) % 10\\n\\n return a - t * (10 ** j) + t * (10 ** i)\\n\\ndef MAIN():\\n\\n m = {8:{7, 5}, 7:{8, 6, 4}, 6:{7, 3}, 5:{8, 4, 2}, 4:{7, 5, 3, 1}, 3:{6, 4, 0}, 2:{5, 1}, 1:{4, 2, 0}, 0:{3, 1}}\\n\\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\\n\\n start = 8 - MAP.find(\"0\")\\n\\n MAP = int(MAP)\\n\\n goal = (\\'1\\', \\'2\\', \\'3\\', \\'4\\', \\'5\\', \\'6\\', \\'7\\', \\'8\\', \\'0\\')\\n\\n goal = 123456780\\n\\n dp = deque([(0, start, MAP)])\\n\\n LOG = {MAP}\\n\\n while dp:\\n\\n cnt, yx, M = dp.popleft()\\n\\n if M == goal:\\n\\n print(cnt)\\n\\n break\\n\\n cnt += 1\\n\\n for nyx in m[yx]:\\n\\n CM = g(yx, nyx, M)\\n\\n if not CM in LOG:\\n\\n dp.append((cnt, nyx, CM))\\n\\n LOG.add(CM)\\n\\nMAIN()\\n\\n\\n',\n", + " 'target': 'from collections import deque\\n\\nfrom copy import deepcopy, copy\\n\\nN = 3\\n\\ndef g(i, j, a):\\n\\n if i > j:\\n\\n i, j = j, i\\n\\n return a[:i] + a[j] + a[i + 1:j] + a[i] + a[j + 1:]\\n\\ndef MAIN():\\n\\n m = {8:{7, 5}, 7:{8, 6, 4}, 6:{7, 3}, 5:{8, 4, 2}, 4:{7, 5, 3, 1}, 3:{6, 4, 0}, 2:{5, 1}, 1:{4, 2, 0}, 0:{3, 1}}\\n\\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\\n\\n start = MAP.find(\"0\")\\n\\n goal = \"123456780\"\\n\\n dp = deque([(0, start, MAP)])\\n\\n LOG = {MAP}\\n\\n while dp:\\n\\n cnt, yx, M = dp.popleft()\\n\\n if M == goal:\\n\\n print(cnt)\\n\\n break\\n\\n cnt += 1\\n\\n for nyx in m[yx]:\\n\\n CM = g(yx, nyx, M)\\n\\n if not CM in LOG:\\n\\n dp.append((cnt, nyx, CM))\\n\\n LOG.add(CM)\\n\\nMAIN()\\n\\n\\n',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 27,\n", + " 'code_v0_num_chars': 885,\n", + " 'code_v1_num_chars': 783,\n", + " 'code_v0_no_empty_lines': 'from collections import deque\\nfrom copy import deepcopy, copy\\n\\ndy = [-1, 0, 0, 1]\\ndx = [0, -1, 1, 0]\\nN = 3\\n\\n\\ndef g(i, j, a):\\n t = a // (10**j) % 10\\n return a - t * (10**j) + t * (10**i)\\n\\n\\ndef MAIN():\\n m = {\\n 8: {7, 5},\\n 7: {8, 6, 4},\\n 6: {7, 3},\\n 5: {8, 4, 2},\\n 4: {7, 5, 3, 1},\\n 3: {6, 4, 0},\\n 2: {5, 1},\\n 1: {4, 2, 0},\\n 0: {3, 1},\\n }\\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\\n start = 8 - MAP.find(\"0\")\\n MAP = int(MAP)\\n goal = (\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"0\")\\n goal = 123456780\\n dp = deque([(0, start, MAP)])\\n LOG = {MAP}\\n while dp:\\n cnt, yx, M = dp.popleft()\\n if M == goal:\\n print(cnt)\\n break\\n cnt += 1\\n for nyx in m[yx]:\\n CM = g(yx, nyx, M)\\n if not CM in LOG:\\n dp.append((cnt, nyx, CM))\\n LOG.add(CM)\\n\\n\\nMAIN()\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque\\nfrom copy import deepcopy, copy\\n\\nN = 3\\n\\n\\ndef g(i, j, a):\\n if i > j:\\n i, j = j, i\\n return a[:i] + a[j] + a[i + 1 : j] + a[i] + a[j + 1 :]\\n\\n\\ndef MAIN():\\n m = {\\n 8: {7, 5},\\n 7: {8, 6, 4},\\n 6: {7, 3},\\n 5: {8, 4, 2},\\n 4: {7, 5, 3, 1},\\n 3: {6, 4, 0},\\n 2: {5, 1},\\n 1: {4, 2, 0},\\n 0: {3, 1},\\n }\\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\\n start = MAP.find(\"0\")\\n goal = \"123456780\"\\n dp = deque([(0, start, MAP)])\\n LOG = {MAP}\\n while dp:\\n cnt, yx, M = dp.popleft()\\n if M == goal:\\n print(cnt)\\n break\\n cnt += 1\\n for nyx in m[yx]:\\n CM = g(yx, nyx, M)\\n if not CM in LOG:\\n dp.append((cnt, nyx, CM))\\n LOG.add(CM)\\n\\n\\nMAIN()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['-dy = [-1, 0, 0, 1]',\n", + " '-dx = [0, -1, 1, 0]',\n", + " '- t = a // (10**j) % 10',\n", + " '- return a - t * (10**j) + t * (10**i)',\n", + " '+ if i > j:',\n", + " '+ i, j = j, i',\n", + " '+ return a[:i] + a[j] + a[i + 1 : j] + a[i] + a[j + 1 :]',\n", + " '- start = 8 - MAP.find(\"0\")',\n", + " '- MAP = int(MAP)',\n", + " '- goal = (\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"0\")',\n", + " '- goal = 123456780',\n", + " '+ start = MAP.find(\"0\")',\n", + " '+ goal = \"123456780\"'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3641724348,\n", + " 'measured_runtime_v1': 0.096000421,\n", + " 'runtime_lift': 3.7934462245,\n", + " 'key': ['s804728708', 's622088378']},\n", + " {'user_id': 'u530383736',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's720124366',\n", + " 'submission_id_v1': 's340965185',\n", + " 'cpu_time_v0': 275,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 9116,\n", + " 'memory_v1': 9000,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.0,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\nimport sys\\n\\n\\n\\n\\n\\ndef main():\\n\\n S = int( sys.stdin.readline() )\\n\\n\\n\\n dp = [0]*(S+1)\\n\\n dp[0] = 1\\n\\n mod = 10**9 + 7\\n\\n\\n\\n for i in range(3, S+1):\\n\\n cnt = 0\\n\\n\\n\\n for j in range(3, i+1):\\n\\n cnt += dp[i-j]\\n\\n cnt %= mod\\n\\n \\n\\n dp[i] = cnt\\n\\n\\n\\n\\n\\n print((dp[-1]))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\nimport sys\\n\\n\\n\\n\\n\\ndef main():\\n\\n S = int( sys.stdin.readline() )\\n\\n\\n\\n dp = [0]*(S+1)\\n\\n dp[0] = 1\\n\\n mod = 10**9 + 7\\n\\n\\n\\n for i in range(3, S+1):\\n\\n dp[i] = dp[i-3] + dp[i-1]\\n\\n dp[i] %= mod\\n\\n \\n\\n\\n\\n print((dp[-1]))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 381,\n", + " 'code_v1_num_chars': 307,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\n\\n\\ndef main():\\n S = int(sys.stdin.readline())\\n dp = [0] * (S + 1)\\n dp[0] = 1\\n mod = 10**9 + 7\\n for i in range(3, S + 1):\\n cnt = 0\\n for j in range(3, i + 1):\\n cnt += dp[i - j]\\n cnt %= mod\\n dp[i] = cnt\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\nimport sys\\n\\n\\ndef main():\\n S = int(sys.stdin.readline())\\n dp = [0] * (S + 1)\\n dp[0] = 1\\n mod = 10**9 + 7\\n for i in range(3, S + 1):\\n dp[i] = dp[i - 3] + dp[i - 1]\\n dp[i] %= mod\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 19.2307692308,\n", + " 'diff': ['- cnt = 0',\n", + " '- for j in range(3, i + 1):',\n", + " '- cnt += dp[i - j]',\n", + " '- cnt %= mod',\n", + " '- dp[i] = cnt',\n", + " '+ dp[i] = dp[i - 3] + dp[i - 1]',\n", + " '+ dp[i] %= mod'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4620170944,\n", + " 'measured_runtime_v1': 0.1881556332,\n", + " 'runtime_lift': 2.4555049799,\n", + " 'key': ['s720124366', 's340965185']},\n", + " {'user_id': 'u207799478',\n", + " 'problem_id': 'p03545',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's023850696',\n", + " 'submission_id_v1': 's177314828',\n", + " 'cpu_time_v0': 173,\n", + " 'cpu_time_v1': 104,\n", + " 'memory_v0': 38512,\n", + " 'memory_v1': 77244,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.88,\n", + " 'input': \"import math\\n\\nimport string\\n\\nimport collections\\n\\nfrom collections import Counter\\n\\n\\n\\n\\n\\ndef readints():\\n\\n return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef nCr(n, r):\\n\\n return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))\\n\\n\\n\\n\\n\\ndef has_duplicates2(seq):\\n\\n seen = []\\n\\n for item in seq:\\n\\n if not(item in seen):\\n\\n seen.append(item)\\n\\n return len(seq) != len(seen)\\n\\n\\n\\n\\n\\ndef divisor(n):\\n\\n divisor = []\\n\\n for i in range(1, n+1):\\n\\n if n % i == 0:\\n\\n divisor.append(i)\\n\\n return divisor\\n\\n\\n\\n\\n\\n# coordinates\\n\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\n\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\n\\na, b, c, d = list(map(int, eval(input())))\\n\\n#print(a, b, c, d)\\n\\nif a+b+c+d == 7:\\n\\n print((str(a)+'+'+str(b)+'+'+str(c)+'+'+str(d)+'=7'))\\n\\n exit()\\n\\nif a+b-c+d == 7:\\n\\n print((str(a)+'+'+str(b)+'-'+str(c)+'+'+str(d)+'=7'))\\n\\n exit()\\n\\nif a+b+c-d == 7:\\n\\n print((str(a)+'+'+str(b)+'+'+str(c)+'-'+str(d)+'=7'))\\n\\n exit()\\n\\nif a+b-c-d == 7:\\n\\n print((str(a)+'+'+str(b)+'-'+str(c)+'-'+str(d)+'=7'))\\n\\n exit()\\n\\nif a-b+c+d == 7:\\n\\n print((str(a)+'-'+str(b)+'+'+str(c)+'+'+str(d)+'=7'))\\n\\n exit()\\n\\nif a-b-c+d == 7:\\n\\n print((str(a)+'-'+str(b)+'-'+str(c)+'+'+str(d)+'=7'))\\n\\n exit()\\n\\nif a-b+c-d == 7:\\n\\n print((str(a)+'-'+str(b)+'+'+str(c)+'-'+str(d)+'=7'))\\n\\n exit()\\n\\nif a-b-c-d == 7:\\n\\n print((str(a)+'-'+str(b)+'-'+str(c)+'-'+str(d)+'=7'))\\n\\n exit()\\n\",\n", + " 'target': \"from copy import deepcopy\\n\\nimport math\\n\\nimport string\\n\\nimport collections\\n\\nfrom collections import Counter\\n\\nfrom collections import deque\\n\\nfrom decimal import Decimal\\n\\nimport sys\\n\\nimport fractions\\n\\nfrom operator import itemgetter\\n\\nimport itertools\\n\\nimport copy\\n\\n\\n\\n\\n\\ndef readints():\\n\\n return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef nCr(n, r):\\n\\n return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))\\n\\n\\n\\n\\n\\ndef has_duplicates2(seq):\\n\\n seen = []\\n\\n for item in seq:\\n\\n if not(item in seen):\\n\\n seen.append(item)\\n\\n return len(seq) != len(seen)\\n\\n\\n\\n\\n\\ndef divisor(n):\\n\\n divisor = []\\n\\n for i in range(1, n+1):\\n\\n if n % i == 0:\\n\\n divisor.append(i)\\n\\n return divisor\\n\\n\\n\\n\\n\\n# coordinates\\n\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\n\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\n\\n\\n\\ns = list(map(int, input()))\\n\\n\\n\\nif s[0]+s[1]+s[2]+s[3] == 7:\\n\\n print(str(s[0]), '+', str(s[1]), '+',\\n\\n str(s[2]), '+', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\\nif s[0]+s[1]-s[2]+s[3] == 7:\\n\\n print(str(s[0]), '+', str(s[1]), '-', str(s[2]),\\n\\n '+', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\\nif s[0]-s[1]+s[2]+s[3] == 7:\\n\\n print(str(s[0]), '-', str(s[1]), '+', str(s[2]),\\n\\n '+', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\\nif s[0]-s[1]-s[2]+s[3] == 7:\\n\\n print(str(s[0]), '-', str(s[1]), '-', str(s[2]),\\n\\n '+', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\\nif s[0]+s[1]+s[2]-s[3] == 7:\\n\\n print(str(s[0]), '+', str(s[1]), '+', str(s[2]),\\n\\n '-', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\\nif s[0]-s[1]-s[2]-s[3] == 7:\\n\\n print(str(s[0]), '-', str(s[1]), '-', str(s[2]),\\n\\n '-', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\\nif s[0]-s[1]+s[2]-s[3] == 7:\\n\\n print(str(s[0]), '-', str(s[1]), '+', str(s[2]),\\n\\n '-', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\\nif s[0]+s[1]-s[2]-s[3] == 7:\\n\\n print(str(s[0]), '+', str(s[1]), '-', str(s[2]),\\n\\n '-', str(s[3]), '=', 7, sep='')\\n\\n exit()\\n\",\n", + " 'code_v0_loc': 59,\n", + " 'code_v1_loc': 76,\n", + " 'code_v0_num_chars': 1378,\n", + " 'code_v1_num_chars': 1963,\n", + " 'code_v0_no_empty_lines': 'import math\\nimport string\\nimport collections\\nfrom collections import Counter\\n\\n\\ndef readints():\\n return list(map(int, input().split()))\\n\\n\\ndef nCr(n, r):\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\n\\ndef has_duplicates2(seq):\\n seen = []\\n for item in seq:\\n if not (item in seen):\\n seen.append(item)\\n return len(seq) != len(seen)\\n\\n\\ndef divisor(n):\\n divisor = []\\n for i in range(1, n + 1):\\n if n % i == 0:\\n divisor.append(i)\\n return divisor\\n\\n\\n# coordinates\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\na, b, c, d = list(map(int, eval(input())))\\n# print(a, b, c, d)\\nif a + b + c + d == 7:\\n print((str(a) + \"+\" + str(b) + \"+\" + str(c) + \"+\" + str(d) + \"=7\"))\\n exit()\\nif a + b - c + d == 7:\\n print((str(a) + \"+\" + str(b) + \"-\" + str(c) + \"+\" + str(d) + \"=7\"))\\n exit()\\nif a + b + c - d == 7:\\n print((str(a) + \"+\" + str(b) + \"+\" + str(c) + \"-\" + str(d) + \"=7\"))\\n exit()\\nif a + b - c - d == 7:\\n print((str(a) + \"+\" + str(b) + \"-\" + str(c) + \"-\" + str(d) + \"=7\"))\\n exit()\\nif a - b + c + d == 7:\\n print((str(a) + \"-\" + str(b) + \"+\" + str(c) + \"+\" + str(d) + \"=7\"))\\n exit()\\nif a - b - c + d == 7:\\n print((str(a) + \"-\" + str(b) + \"-\" + str(c) + \"+\" + str(d) + \"=7\"))\\n exit()\\nif a - b + c - d == 7:\\n print((str(a) + \"-\" + str(b) + \"+\" + str(c) + \"-\" + str(d) + \"=7\"))\\n exit()\\nif a - b - c - d == 7:\\n print((str(a) + \"-\" + str(b) + \"-\" + str(c) + \"-\" + str(d) + \"=7\"))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'from copy import deepcopy\\nimport math\\nimport string\\nimport collections\\nfrom collections import Counter\\nfrom collections import deque\\nfrom decimal import Decimal\\nimport sys\\nimport fractions\\nfrom operator import itemgetter\\nimport itertools\\nimport copy\\n\\n\\ndef readints():\\n return list(map(int, input().split()))\\n\\n\\ndef nCr(n, r):\\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\n\\ndef has_duplicates2(seq):\\n seen = []\\n for item in seq:\\n if not (item in seen):\\n seen.append(item)\\n return len(seq) != len(seen)\\n\\n\\ndef divisor(n):\\n divisor = []\\n for i in range(1, n + 1):\\n if n % i == 0:\\n divisor.append(i)\\n return divisor\\n\\n\\n# coordinates\\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\\ns = list(map(int, input()))\\nif s[0] + s[1] + s[2] + s[3] == 7:\\n print(str(s[0]), \"+\", str(s[1]), \"+\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\nif s[0] + s[1] - s[2] + s[3] == 7:\\n print(str(s[0]), \"+\", str(s[1]), \"-\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\nif s[0] - s[1] + s[2] + s[3] == 7:\\n print(str(s[0]), \"-\", str(s[1]), \"+\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\nif s[0] - s[1] - s[2] + s[3] == 7:\\n print(str(s[0]), \"-\", str(s[1]), \"-\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\nif s[0] + s[1] + s[2] - s[3] == 7:\\n print(str(s[0]), \"+\", str(s[1]), \"+\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\nif s[0] - s[1] - s[2] - s[3] == 7:\\n print(str(s[0]), \"-\", str(s[1]), \"-\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\nif s[0] - s[1] + s[2] - s[3] == 7:\\n print(str(s[0]), \"-\", str(s[1]), \"+\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\nif s[0] + s[1] - s[2] - s[3] == 7:\\n print(str(s[0]), \"+\", str(s[1]), \"-\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.3684210526,\n", + " 'diff': ['+from copy import deepcopy',\n", + " '+from collections import deque',\n", + " '+from decimal import Decimal',\n", + " '+import sys',\n", + " '+import fractions',\n", + " '+from operator import itemgetter',\n", + " '+import itertools',\n", + " '+import copy',\n", + " '-a, b, c, d = list(map(int, eval(input())))',\n", + " '-# print(a, b, c, d)',\n", + " '-if a + b + c + d == 7:',\n", + " '- print((str(a) + \"+\" + str(b) + \"+\" + str(c) + \"+\" + str(d) + \"=7\"))',\n", + " '+s = list(map(int, input()))',\n", + " '+if s[0] + s[1] + s[2] + s[3] == 7:',\n", + " '+ print(str(s[0]), \"+\", str(s[1]), \"+\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")',\n", + " '-if a + b - c + d == 7:',\n", + " '- print((str(a) + \"+\" + str(b) + \"-\" + str(c) + \"+\" + str(d) + \"=7\"))',\n", + " '+if s[0] + s[1] - s[2] + s[3] == 7:',\n", + " '+ print(str(s[0]), \"+\", str(s[1]), \"-\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")',\n", + " '-if a + b + c - d == 7:',\n", + " '- print((str(a) + \"+\" + str(b) + \"+\" + str(c) + \"-\" + str(d) + \"=7\"))',\n", + " '+if s[0] - s[1] + s[2] + s[3] == 7:',\n", + " '+ print(str(s[0]), \"-\", str(s[1]), \"+\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")',\n", + " '-if a + b - c - d == 7:',\n", + " '- print((str(a) + \"+\" + str(b) + \"-\" + str(c) + \"-\" + str(d) + \"=7\"))',\n", + " '+if s[0] - s[1] - s[2] + s[3] == 7:',\n", + " '+ print(str(s[0]), \"-\", str(s[1]), \"-\", str(s[2]), \"+\", str(s[3]), \"=\", 7, sep=\"\")',\n", + " '-if a - b + c + d == 7:',\n", + " '- print((str(a) + \"-\" + str(b) + \"+\" + str(c) + \"+\" + str(d) + \"=7\"))',\n", + " '+if s[0] + s[1] + s[2] - s[3] == 7:',\n", + " '+ print(str(s[0]), \"+\", str(s[1]), \"+\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")',\n", + " '-if a - b - c + d == 7:',\n", + " '- print((str(a) + \"-\" + str(b) + \"-\" + str(c) + \"+\" + str(d) + \"=7\"))',\n", + " '+if s[0] - s[1] - s[2] - s[3] == 7:',\n", + " '+ print(str(s[0]), \"-\", str(s[1]), \"-\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")',\n", + " '-if a - b + c - d == 7:',\n", + " '- print((str(a) + \"-\" + str(b) + \"+\" + str(c) + \"-\" + str(d) + \"=7\"))',\n", + " '+if s[0] - s[1] + s[2] - s[3] == 7:',\n", + " '+ print(str(s[0]), \"-\", str(s[1]), \"+\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")',\n", + " '-if a - b - c - d == 7:',\n", + " '- print((str(a) + \"-\" + str(b) + \"-\" + str(c) + \"-\" + str(d) + \"=7\"))',\n", + " '+if s[0] + s[1] - s[2] - s[3] == 7:',\n", + " '+ print(str(s[0]), \"+\", str(s[1]), \"-\", str(s[2]), \"-\", str(s[3]), \"=\", 7, sep=\"\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2534237525,\n", + " 'measured_runtime_v1': 0.1793848307,\n", + " 'runtime_lift': 1.4127379195,\n", + " 'key': ['s023850696', 's177314828']},\n", + " {'user_id': 'u896741788',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's129241236',\n", + " 'submission_id_v1': 's743438543',\n", + " 'cpu_time_v0': 355,\n", + " 'cpu_time_v1': 218,\n", + " 'memory_v0': 7832,\n", + " 'memory_v1': 15472,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 38.59,\n", + " 'input': 'k,m=list(map(int,input().split()))\\n\\nl=[0 for i in range(k+1)]\\n\\nfor i in range(m):\\n\\n a,s=list(map(int,input().split()))\\n\\n l[a-1]+=1;l[s]-=1\\n\\nans=0\\n\\nf=0\\n\\nfor j in range(k):\\n\\n l[j]+=f\\n\\n f=l[j]\\n\\nprint((len([1 for i in l if i==m])))',\n", + " 'target': 'n,m=list(map(int,input().split()))\\n\\ntable=[0]*(n+2)\\n\\nfor i in range(m):\\n\\n l,r=list(map(int,input().split()))\\n\\n table[l]+=1\\n\\n table[r+1]-=1\\n\\nfrom itertools import accumulate\\n\\nfrom collections import Counter as co\\n\\nvar=co((accumulate(table)))\\n\\n\\n\\nif m not in var:print((0))\\n\\nelse:print((var[m]))\\n\\n\\n\\n\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 217,\n", + " 'code_v1_num_chars': 290,\n", + " 'code_v0_no_empty_lines': 'k, m = list(map(int, input().split()))\\nl = [0 for i in range(k + 1)]\\nfor i in range(m):\\n a, s = list(map(int, input().split()))\\n l[a - 1] += 1\\n l[s] -= 1\\nans = 0\\nf = 0\\nfor j in range(k):\\n l[j] += f\\n f = l[j]\\nprint((len([1 for i in l if i == m])))\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\ntable = [0] * (n + 2)\\nfor i in range(m):\\n l, r = list(map(int, input().split()))\\n table[l] += 1\\n table[r + 1] -= 1\\nfrom itertools import accumulate\\nfrom collections import Counter as co\\n\\nvar = co((accumulate(table)))\\nif m not in var:\\n print((0))\\nelse:\\n print((var[m]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['-k, m = list(map(int, input().split()))',\n", + " '-l = [0 for i in range(k + 1)]',\n", + " '+n, m = list(map(int, input().split()))',\n", + " '+table = [0] * (n + 2)',\n", + " '- a, s = list(map(int, input().split()))',\n", + " '- l[a - 1] += 1',\n", + " '- l[s] -= 1',\n", + " '-ans = 0',\n", + " '-f = 0',\n", + " '-for j in range(k):',\n", + " '- l[j] += f',\n", + " '- f = l[j]',\n", + " '-print((len([1 for i in l if i == m])))',\n", + " '+ l, r = list(map(int, input().split()))',\n", + " '+ table[l] += 1',\n", + " '+ table[r + 1] -= 1',\n", + " '+from itertools import accumulate',\n", + " '+from collections import Counter as co',\n", + " '+',\n", + " '+var = co((accumulate(table)))',\n", + " '+if m not in var:',\n", + " '+ print((0))',\n", + " '+else:',\n", + " '+ print((var[m]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4122046263,\n", + " 'measured_runtime_v1': 0.3202181025,\n", + " 'runtime_lift': 1.2872620978,\n", + " 'key': ['s129241236', 's743438543']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p02661',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's665964860',\n", + " 'submission_id_v1': 's988833610',\n", + " 'cpu_time_v0': 854,\n", + " 'cpu_time_v1': 417,\n", + " 'memory_v0': 47316,\n", + " 'memory_v1': 155828,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 51.17,\n", + " 'input': 'from numpy import*\\n\\na,b=median(t:=loadtxt(open(0),skiprows=1),0)\\n\\nprint((int((a-b)*~(~len(t)%2))+1))',\n", + " 'target': 'from statistics import*\\n\\n(n,),*t=[list(map(int,t.split()))for t in open(0)]\\n\\na,b=list(map(median,list(zip(*t))))\\n\\nprint((int((b-a)*(2-n%2))+1))',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 98,\n", + " 'code_v1_num_chars': 123,\n", + " 'code_v0_no_empty_lines': 'from numpy import *\\n\\na, b = median(t := loadtxt(open(0), skiprows=1), 0)\\nprint((int((a - b) * ~(~len(t) % 2)) + 1))\\n',\n", + " 'code_v1_no_empty_lines': 'from statistics import *\\n\\n(n,), *t = [list(map(int, t.split())) for t in open(0)]\\na, b = list(map(median, list(zip(*t))))\\nprint((int((b - a) * (2 - n % 2)) + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-from numpy import *',\n", + " '+from statistics import *',\n", + " '-a, b = median(t := loadtxt(open(0), skiprows=1), 0)',\n", + " '-print((int((a - b) * ~(~len(t) % 2)) + 1))',\n", + " '+(n,), *t = [list(map(int, t.split())) for t in open(0)]',\n", + " '+a, b = list(map(median, list(zip(*t))))',\n", + " '+print((int((b - a) * (2 - n % 2)) + 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.1291211085,\n", + " 'measured_runtime_v1': 0.4275847787,\n", + " 'runtime_lift': 4.9794127725,\n", + " 'key': ['s665964860', 's988833610']},\n", + " {'user_id': 'u380524497',\n", + " 'problem_id': 'p02850',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's943818401',\n", + " 'submission_id_v1': 's978957689',\n", + " 'cpu_time_v0': 583,\n", + " 'cpu_time_v1': 446,\n", + " 'memory_v0': 25092,\n", + " 'memory_v1': 25184,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.5,\n", + " 'input': 'n = int(eval(input()))\\n\\nedges = []\\n\\n\\n\\nfor id in range(n-1):\\n\\n a, b = list(map(int, input().split()))\\n\\n edges.append([a-1, b-1, id])\\n\\n\\n\\nedges.sort()\\n\\n\\n\\nused = [0]*(n)\\n\\nans = [0]*(n-1)\\n\\nnum = 1\\n\\nprev = 0\\n\\nfor edge in edges:\\n\\n _from, to, id = edge\\n\\n if _from != prev:\\n\\n num = 1\\n\\n if used[_from] == num:\\n\\n num += 1\\n\\n ans[id] = num\\n\\n used[to] = num\\n\\n num += 1\\n\\n prev = _from\\n\\n\\n\\nprint((max(ans)))\\n\\nfor color in ans:\\n\\n print(color)\\n',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nn = int(eval(input()))\\n\\nedges = []\\n\\n\\n\\nfor id in range(n-1):\\n\\n a, b = list(map(int, input().split()))\\n\\n edges.append([a-1, b-1, id])\\n\\n\\n\\nedges.sort()\\n\\n\\n\\nused = [0]*(n)\\n\\nans = [0]*(n-1)\\n\\nnum = 1\\n\\nprev = 0\\n\\nfor edge in edges:\\n\\n _from, to, id = edge\\n\\n if _from != prev:\\n\\n num = 1\\n\\n if used[_from] == num:\\n\\n num += 1\\n\\n ans[id] = num\\n\\n used[to] = num\\n\\n num += 1\\n\\n prev = _from\\n\\n\\n\\nprint((max(ans)))\\n\\nfor color in ans:\\n\\n print(color)\\n',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 455,\n", + " 'code_v1_num_chars': 497,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nedges = []\\nfor id in range(n - 1):\\n a, b = list(map(int, input().split()))\\n edges.append([a - 1, b - 1, id])\\nedges.sort()\\nused = [0] * (n)\\nans = [0] * (n - 1)\\nnum = 1\\nprev = 0\\nfor edge in edges:\\n _from, to, id = edge\\n if _from != prev:\\n num = 1\\n if used[_from] == num:\\n num += 1\\n ans[id] = num\\n used[to] = num\\n num += 1\\n prev = _from\\nprint((max(ans)))\\nfor color in ans:\\n print(color)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nn = int(eval(input()))\\nedges = []\\nfor id in range(n - 1):\\n a, b = list(map(int, input().split()))\\n edges.append([a - 1, b - 1, id])\\nedges.sort()\\nused = [0] * (n)\\nans = [0] * (n - 1)\\nnum = 1\\nprev = 0\\nfor edge in edges:\\n _from, to, id = edge\\n if _from != prev:\\n num = 1\\n if used[_from] == num:\\n num += 1\\n ans[id] = num\\n used[to] = num\\n num += 1\\n prev = _from\\nprint((max(ans)))\\nfor color in ans:\\n print(color)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['+import sys', '+', '+input = sys.stdin.readline'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2558188839,\n", + " 'measured_runtime_v1': 0.0060829046,\n", + " 'runtime_lift': 42.0553832838,\n", + " 'key': ['s943818401', 's978957689']},\n", + " {'user_id': 'u477977638',\n", + " 'problem_id': 'p03752',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's572800870',\n", + " 'submission_id_v1': 's011317183',\n", + " 'cpu_time_v0': 481,\n", + " 'cpu_time_v1': 42,\n", + " 'memory_v0': 12524,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 91.27,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\ninput = sys.stdin.buffer.readline\\n\\n\\n\\n\\n\\ndef RD(): return sys.stdin.read()\\n\\ndef II(): return int(eval(input()))\\n\\ndef MI(): return list(map(int,input().split()))\\n\\ndef LI(): return list(map(int,input().split()))\\n\\ndef TI(): return tuple(map(int,input().split()))\\n\\n\\n\\n# mod=10**9+7\\n\\n# rstrip().decode(\\'utf-8\\')\\n\\n\\n\\nimport numpy as np\\n\\nfrom itertools import combinations\\n\\n\\n\\ndef main():\\n\\n\\tn,k=MI()\\n\\n\\tans=10**18\\n\\n\\n\\n\\tA=LI()\\n\\n\\tA=[A[0]-1]+A\\n\\n\\tA=np.array(A)\\n\\n\\n\\n\\tfor t in combinations(list(range(n)),k):\\n\\n\\t\\tB=A.copy()\\n\\n\\t\\ttmp=0\\n\\n\\t\\tfor i in t:\\n\\n\\t\\t\\ti+=1\\n\\n\\t\\t\\tB[i]=max(B[:i].max()+1,A[i])\\n\\n\\t\\t\\ttmp+=B[i]-A[i]\\n\\n\\t\\tans=min(ans,tmp)\\n\\n\\tprint(ans)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n\\tmain()\\n',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\ninput = sys.stdin.buffer.readline\\n\\n\\n\\n\\n\\ndef RD(): return sys.stdin.read()\\n\\ndef II(): return int(eval(input()))\\n\\ndef MI(): return list(map(int,input().split()))\\n\\ndef LI(): return list(map(int,input().split()))\\n\\ndef TI(): return tuple(map(int,input().split()))\\n\\n\\n\\n# mod=10**9+7\\n\\n# rstrip().decode(\\'utf-8\\')\\n\\n\\n\\n#import numpy as np\\n\\nfrom itertools import combinations\\n\\n\\n\\ndef main():\\n\\n\\tn,k=MI()\\n\\n\\tans=10**18\\n\\n\\n\\n\\tA=LI()\\n\\n\\tA=[A[0]-1]+A\\n\\n\\n\\n\\tfor t in combinations(list(range(n)),k):\\n\\n\\t\\tB=A.copy()\\n\\n\\t\\ttmp=0\\n\\n\\t\\tfor i in t:\\n\\n\\t\\t\\ti+=1\\n\\n\\t\\t\\tB[i]=max(max(B[:i])+1,A[i])\\n\\n\\t\\t\\ttmp+=B[i]-A[i]\\n\\n\\t\\tans=min(ans,tmp)\\n\\n\\tprint(ans)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n\\tmain()\\n',\n", + " 'code_v0_loc': 37,\n", + " 'code_v1_loc': 36,\n", + " 'code_v0_num_chars': 680,\n", + " 'code_v1_num_chars': 664,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\ninput = sys.stdin.buffer.readline\\n\\n\\ndef RD():\\n return sys.stdin.read()\\n\\n\\ndef II():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\ndef TI():\\n return tuple(map(int, input().split()))\\n\\n\\n# mod=10**9+7\\n# rstrip().decode(\\'utf-8\\')\\nimport numpy as np\\nfrom itertools import combinations\\n\\n\\ndef main():\\n n, k = MI()\\n ans = 10**18\\n A = LI()\\n A = [A[0] - 1] + A\\n A = np.array(A)\\n for t in combinations(list(range(n)), k):\\n B = A.copy()\\n tmp = 0\\n for i in t:\\n i += 1\\n B[i] = max(B[:i].max() + 1, A[i])\\n tmp += B[i] - A[i]\\n ans = min(ans, tmp)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\ninput = sys.stdin.buffer.readline\\n\\n\\ndef RD():\\n return sys.stdin.read()\\n\\n\\ndef II():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\ndef TI():\\n return tuple(map(int, input().split()))\\n\\n\\n# mod=10**9+7\\n# rstrip().decode(\\'utf-8\\')\\n# import numpy as np\\nfrom itertools import combinations\\n\\n\\ndef main():\\n n, k = MI()\\n ans = 10**18\\n A = LI()\\n A = [A[0] - 1] + A\\n for t in combinations(list(range(n)), k):\\n B = A.copy()\\n tmp = 0\\n for i in t:\\n i += 1\\n B[i] = max(max(B[:i]) + 1, A[i])\\n tmp += B[i] - A[i]\\n ans = min(ans, tmp)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.7027027027,\n", + " 'diff': ['-import numpy as np',\n", + " '+# import numpy as np',\n", + " '- A = np.array(A)',\n", + " '- B[i] = max(B[:i].max() + 1, A[i])',\n", + " '+ B[i] = max(max(B[:i]) + 1, A[i])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4463615463,\n", + " 'measured_runtime_v1': 0.2103404913,\n", + " 'runtime_lift': 6.8762868115,\n", + " 'key': ['s572800870', 's011317183']},\n", + " {'user_id': 'u164727245',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's738393480',\n", + " 'submission_id_v1': 's821832490',\n", + " 'cpu_time_v0': 29,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 9144,\n", + " 'memory_v1': 9112,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.79,\n", + " 'input': '# coding: utf-8\\n\\n\\n\\n\\n\\ndef solve(*args: str) -> str:\\n\\n x = int(args[0])\\n\\n\\n\\n ret = None\\n\\n for a in range(120):\\n\\n for b in range(120):\\n\\n a5, b5 = pow(a, 5), pow(b, 5)\\n\\n if a5-b5 == x:\\n\\n ret = (a, b)\\n\\n elif a5+b5 == x:\\n\\n ret = (a, -b)\\n\\n\\n\\n return \\' \\'.join(map(str, ret))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'target': '# coding: utf-8\\n\\n\\n\\n\\n\\ndef solve(*args: str) -> str:\\n\\n x = int(args[0])\\n\\n\\n\\n ret = None\\n\\n for b in range(120):\\n\\n for a in range(b, 120):\\n\\n a5, b5 = pow(a, 5), pow(b, 5)\\n\\n if a5-b5 == x:\\n\\n ret = (a, b)\\n\\n elif a5+b5 == x:\\n\\n ret = (a, -b)\\n\\n\\n\\n return \\' \\'.join(map(str, ret))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 429,\n", + " 'code_v1_num_chars': 432,\n", + " 'code_v0_no_empty_lines': '# coding: utf-8\\ndef solve(*args: str) -> str:\\n x = int(args[0])\\n ret = None\\n for a in range(120):\\n for b in range(120):\\n a5, b5 = pow(a, 5), pow(b, 5)\\n if a5 - b5 == x:\\n ret = (a, b)\\n elif a5 + b5 == x:\\n ret = (a, -b)\\n return \" \".join(map(str, ret))\\n\\n\\nif __name__ == \"__main__\":\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\ndef solve(*args: str) -> str:\\n x = int(args[0])\\n ret = None\\n for b in range(120):\\n for a in range(b, 120):\\n a5, b5 = pow(a, 5), pow(b, 5)\\n if a5 - b5 == x:\\n ret = (a, b)\\n elif a5 + b5 == x:\\n ret = (a, -b)\\n return \" \".join(map(str, ret))\\n\\n\\nif __name__ == \"__main__\":\\n print((solve(*(open(0).read().splitlines()))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- for a in range(120):',\n", + " '- for b in range(120):',\n", + " '+ for b in range(120):',\n", + " '+ for a in range(b, 120):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3019295235,\n", + " 'measured_runtime_v1': 0.2210984349,\n", + " 'runtime_lift': 1.3655886964,\n", + " 'key': ['s738393480', 's821832490']},\n", + " {'user_id': 'u312025627',\n", + " 'problem_id': 'p03568',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's088632051',\n", + " 'submission_id_v1': 's935108099',\n", + " 'cpu_time_v0': 196,\n", + " 'cpu_time_v1': 167,\n", + " 'memory_v0': 41068,\n", + " 'memory_v1': 38256,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.8,\n", + " 'input': \"def main():\\n\\n N = int(input())\\n\\n A = [int(i) for i in input().split()]\\n\\n if N == 1:\\n\\n return print(1 if A[0] % 2 == 0 else 2)\\n\\n ans = 0\\n\\n d = (-1, 0, 1)\\n\\n from itertools import product\\n\\n for i in product(range(3), repeat=N):\\n\\n cur = 1\\n\\n for j in range(N):\\n\\n cur *= (A[j] + d[i[j]])\\n\\n if cur % 2 == 0:\\n\\n ans += 1\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"def main():\\n\\n N = int(eval(input()))\\n\\n A = [int(i) for i in input().split()]\\n\\n ans = 3**N\\n\\n cnt = len([a for a in A if a % 2 == 0])\\n\\n ans -= 2**cnt\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 443,\n", + " 'code_v1_num_chars': 217,\n", + " 'code_v0_no_empty_lines': 'def main():\\n N = int(input())\\n A = [int(i) for i in input().split()]\\n if N == 1:\\n return print(1 if A[0] % 2 == 0 else 2)\\n ans = 0\\n d = (-1, 0, 1)\\n from itertools import product\\n\\n for i in product(range(3), repeat=N):\\n cur = 1\\n for j in range(N):\\n cur *= A[j] + d[i[j]]\\n if cur % 2 == 0:\\n ans += 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n N = int(eval(input()))\\n A = [int(i) for i in input().split()]\\n ans = 3**N\\n cnt = len([a for a in A if a % 2 == 0])\\n ans -= 2**cnt\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.1052631579,\n", + " 'diff': ['- N = int(input())',\n", + " '+ N = int(eval(input()))',\n", + " '- if N == 1:',\n", + " '- return print(1 if A[0] % 2 == 0 else 2)',\n", + " '- ans = 0',\n", + " '- d = (-1, 0, 1)',\n", + " '- from itertools import product',\n", + " '-',\n", + " '- for i in product(range(3), repeat=N):',\n", + " '- cur = 1',\n", + " '- for j in range(N):',\n", + " '- cur *= A[j] + d[i[j]]',\n", + " '- if cur % 2 == 0:',\n", + " '- ans += 1',\n", + " '+ ans = 3**N',\n", + " '+ cnt = len([a for a in A if a % 2 == 0])',\n", + " '+ ans -= 2**cnt'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4432550566,\n", + " 'measured_runtime_v1': 0.2109588499,\n", + " 'runtime_lift': 2.1011446393,\n", + " 'key': ['s088632051', 's935108099']},\n", + " {'user_id': 'u392319141',\n", + " 'problem_id': 'p03837',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's034918940',\n", + " 'submission_id_v1': 's264008956',\n", + " 'cpu_time_v0': 415,\n", + " 'cpu_time_v1': 231,\n", + " 'memory_v0': 25716,\n", + " 'memory_v1': 41836,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 44.34,\n", + " 'input': \"from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\\n\\n\\n\\nINF = float('inf')\\n\\n\\n\\ndef sol():\\n\\n N, M = list(map(int, input().split()))\\n\\n\\n\\n edges = []\\n\\n\\n\\n for _ in range(M):\\n\\n fr, to, cost = list(map(int, input().split()))\\n\\n fr -= 1\\n\\n to -= 1\\n\\n edges.append((fr, to, cost))\\n\\n\\n\\n graph = [[INF] * N for _ in range(N)]\\n\\n for fr, to, cost in edges:\\n\\n graph[fr][to] = cost\\n\\n\\n\\n graph = csgraph_from_dense(graph, null_value=INF)\\n\\n\\n\\n dist = floyd_warshall(graph, directed=False)\\n\\n ans = (graph > dist).sum()\\n\\n print(ans)\\n\\n\\n\\nsol()\",\n", + " 'target': 'N, M = list(map(int, input().split()))\\n\\nINF = 10**18\\n\\n\\n\\nminDist = [[INF] * N for _ in range(N)]\\n\\nfor i in range(N):\\n\\n minDist[i][i] = 0\\n\\n\\n\\nedges = []\\n\\nfor _ in range(M):\\n\\n fr, to, d = list(map(int, input().split()))\\n\\n fr -= 1\\n\\n to -= 1\\n\\n edges.append((fr, to, d))\\n\\n minDist[fr][to] = d\\n\\n minDist[to][fr] = d\\n\\n\\n\\nfor k in range(N):\\n\\n for i in range(N):\\n\\n for j in range(N):\\n\\n d = minDist[i][k] + minDist[k][j]\\n\\n if minDist[i][j] > d:\\n\\n minDist[i][j] = d\\n\\n\\n\\nans = 0\\n\\nfor fr, to, d in edges:\\n\\n if minDist[fr][to] < d:\\n\\n ans += 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 28,\n", + " 'code_v0_num_chars': 580,\n", + " 'code_v1_num_chars': 603,\n", + " 'code_v0_no_empty_lines': 'from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\\n\\nINF = float(\"inf\")\\n\\n\\ndef sol():\\n N, M = list(map(int, input().split()))\\n edges = []\\n for _ in range(M):\\n fr, to, cost = list(map(int, input().split()))\\n fr -= 1\\n to -= 1\\n edges.append((fr, to, cost))\\n graph = [[INF] * N for _ in range(N)]\\n for fr, to, cost in edges:\\n graph[fr][to] = cost\\n graph = csgraph_from_dense(graph, null_value=INF)\\n dist = floyd_warshall(graph, directed=False)\\n ans = (graph > dist).sum()\\n print(ans)\\n\\n\\nsol()\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\nINF = 10**18\\nminDist = [[INF] * N for _ in range(N)]\\nfor i in range(N):\\n minDist[i][i] = 0\\nedges = []\\nfor _ in range(M):\\n fr, to, d = list(map(int, input().split()))\\n fr -= 1\\n to -= 1\\n edges.append((fr, to, d))\\n minDist[fr][to] = d\\n minDist[to][fr] = d\\nfor k in range(N):\\n for i in range(N):\\n for j in range(N):\\n d = minDist[i][k] + minDist[k][j]\\n if minDist[i][j] > d:\\n minDist[i][j] = d\\nans = 0\\nfor fr, to, d in edges:\\n if minDist[fr][to] < d:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.1428571429,\n", + " 'diff': ['-from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall',\n", + " '-',\n", + " '-INF = float(\"inf\")',\n", + " '-',\n", + " '-',\n", + " '-def sol():',\n", + " '- N, M = list(map(int, input().split()))',\n", + " '- edges = []',\n", + " '- for _ in range(M):',\n", + " '- fr, to, cost = list(map(int, input().split()))',\n", + " '- fr -= 1',\n", + " '- to -= 1',\n", + " '- edges.append((fr, to, cost))',\n", + " '- graph = [[INF] * N for _ in range(N)]',\n", + " '- for fr, to, cost in edges:',\n", + " '- graph[fr][to] = cost',\n", + " '- graph = csgraph_from_dense(graph, null_value=INF)',\n", + " '- dist = floyd_warshall(graph, directed=False)',\n", + " '- ans = (graph > dist).sum()',\n", + " '- print(ans)',\n", + " '-',\n", + " '-',\n", + " '-sol()',\n", + " '+N, M = list(map(int, input().split()))',\n", + " '+INF = 10**18',\n", + " '+minDist = [[INF] * N for _ in range(N)]',\n", + " '+for i in range(N):',\n", + " '+ minDist[i][i] = 0',\n", + " '+edges = []',\n", + " '+for _ in range(M):',\n", + " '+ fr, to, d = list(map(int, input().split()))',\n", + " '+ fr -= 1',\n", + " '+ to -= 1',\n", + " '+ edges.append((fr, to, d))',\n", + " '+ minDist[fr][to] = d',\n", + " '+ minDist[to][fr] = d',\n", + " '+for k in range(N):',\n", + " '+ for i in range(N):',\n", + " '+ for j in range(N):',\n", + " '+ d = minDist[i][k] + minDist[k][j]',\n", + " '+ if minDist[i][j] > d:',\n", + " '+ minDist[i][j] = d',\n", + " '+ans = 0',\n", + " '+for fr, to, d in edges:',\n", + " '+ if minDist[fr][to] < d:',\n", + " '+ ans += 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8897204494,\n", + " 'measured_runtime_v1': 0.2072854909,\n", + " 'runtime_lift': 9.1165109578,\n", + " 'key': ['s034918940', 's264008956']},\n", + " {'user_id': 'u800396927',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's723979708',\n", + " 'submission_id_v1': 's327831897',\n", + " 'cpu_time_v0': 110,\n", + " 'cpu_time_v1': 67,\n", + " 'memory_v0': 10868,\n", + " 'memory_v1': 66752,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.09,\n", + " 'input': 'N,M = list(map(int,input().split()))\\n\\ndiv =[]\\n\\nfor i in range(2,int(M**(1/2))+2):\\n\\n cur = 0\\n\\n while M%i==0:\\n\\n M = M//i\\n\\n cur += 1\\n\\n if cur >=1:\\n\\n div.append(cur)\\n\\nif M>1: div.append(1)\\n\\ndiv.sort()\\n\\nmod = 10**9+7\\n\\nfrac = [1]*(N+50)\\n\\nnum = len(frac)\\n\\nfor i in range(len(frac)-1):\\n\\n frac[i+1] = frac[i]*(i+1)%mod\\n\\nfinv = [1] * (N+50)\\n\\nfinv[-1] = pow(frac[-1], mod-2, mod)\\n\\nfor i in range(1, num):\\n\\n finv[num-1-i] = finv[num-i] * (num-i) % mod\\n\\nans = 1\\n\\nfor i in div:\\n\\n ans = ans * frac[N+i-1]*finv[N-1]*finv[i]%mod\\n\\nprint(ans)',\n", + " 'target': 'N,M = list(map(int,input().split()))\\n\\ndiv = []\\n\\nfor i in range(2,int(M**(1/2))+2):\\n\\n cur = 0\\n\\n while M%i==0:\\n\\n M//=i\\n\\n cur += 1\\n\\n if cur >=1:\\n\\n div.append(cur)\\n\\nif M>1:div.append(1)\\n\\ndiv.sort()\\n\\nmod = 10**9+7\\n\\nfrac = [1]*(N+50)\\n\\nnum=len(frac)\\n\\nfor i in range(num-1):\\n\\n frac[i+1] = frac[i]*(i+1)%mod\\n\\nfinv = [1]*(N+50)\\n\\nfinv[-1] = pow(frac[-1],mod-2,mod)\\n\\nans = 1\\n\\nfor i in range(1,num):\\n\\n finv[num-1-i] = finv[num-i]*(num-i)%mod\\n\\nfor i in div:\\n\\n ans =ans*frac[N+i-1]*finv[N-1]*finv[i]%mod\\n\\nprint(ans)',\n", + " 'code_v0_loc': 24,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 554,\n", + " 'code_v1_num_chars': 534,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\ndiv = []\\nfor i in range(2, int(M ** (1 / 2)) + 2):\\n cur = 0\\n while M % i == 0:\\n M = M // i\\n cur += 1\\n if cur >= 1:\\n div.append(cur)\\nif M > 1:\\n div.append(1)\\ndiv.sort()\\nmod = 10**9 + 7\\nfrac = [1] * (N + 50)\\nnum = len(frac)\\nfor i in range(len(frac) - 1):\\n frac[i + 1] = frac[i] * (i + 1) % mod\\nfinv = [1] * (N + 50)\\nfinv[-1] = pow(frac[-1], mod - 2, mod)\\nfor i in range(1, num):\\n finv[num - 1 - i] = finv[num - i] * (num - i) % mod\\nans = 1\\nfor i in div:\\n ans = ans * frac[N + i - 1] * finv[N - 1] * finv[i] % mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\ndiv = []\\nfor i in range(2, int(M ** (1 / 2)) + 2):\\n cur = 0\\n while M % i == 0:\\n M //= i\\n cur += 1\\n if cur >= 1:\\n div.append(cur)\\nif M > 1:\\n div.append(1)\\ndiv.sort()\\nmod = 10**9 + 7\\nfrac = [1] * (N + 50)\\nnum = len(frac)\\nfor i in range(num - 1):\\n frac[i + 1] = frac[i] * (i + 1) % mod\\nfinv = [1] * (N + 50)\\nfinv[-1] = pow(frac[-1], mod - 2, mod)\\nans = 1\\nfor i in range(1, num):\\n finv[num - 1 - i] = finv[num - i] * (num - i) % mod\\nfor i in div:\\n ans = ans * frac[N + i - 1] * finv[N - 1] * finv[i] % mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- M = M // i',\n", + " '+ M //= i',\n", + " '-for i in range(len(frac) - 1):',\n", + " '+for i in range(num - 1):',\n", + " '+ans = 1',\n", + " '-ans = 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.47082161,\n", + " 'measured_runtime_v1': 0.3749034932,\n", + " 'runtime_lift': 1.2558474875,\n", + " 'key': ['s723979708', 's327831897']},\n", + " {'user_id': 'u001024152',\n", + " 'problem_id': 'p03806',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's636298531',\n", + " 'submission_id_v1': 's857325561',\n", + " 'cpu_time_v0': 1682,\n", + " 'cpu_time_v1': 292,\n", + " 'memory_v0': 59496,\n", + " 'memory_v1': 48860,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.64,\n", + " 'input': \"G_MAX = 40*10\\n\\nN_MAX = 40\\n\\nINF = float('inf')\\n\\n\\n\\ndp = [[[INF]*(G_MAX+1) for _ in range(G_MAX+1)] \\n\\n for _ in range(N_MAX+1)]\\n\\nN,Ma,Mb = list(map(int, input().split()))\\n\\na,b,c = [],[],[]\\n\\nfor _ in range(N):\\n\\n ai,bi,ci = list(map(int, input().split()))\\n\\n a.append(ai)\\n\\n b.append(bi)\\n\\n c.append(ci)\\n\\n\\n\\ndp[0][0][0] = 0\\n\\nfrom math import isinf\\n\\nfor i in range(N):\\n\\n for ca in range(G_MAX+1):\\n\\n for cb in range(G_MAX+1):\\n\\n if isinf(dp[i][ca][cb]): continue\\n\\n dp[i+1][ca][cb] = min(dp[i+1][ca][cb],\\n\\n dp[i][ca][cb])\\n\\n dp[i+1][ca+a[i]][cb+b[i]] = min(dp[i+1][ca+a[i]][cb+b[i]],\\n\\n dp[i][ca][cb]+c[i])\\n\\n \\n\\n \\n\\nans = INF\\n\\nfor ca in range(1,G_MAX+1):\\n\\n for cb in range(1,G_MAX+1):\\n\\n if ca*Mb==cb*Ma:\\n\\n ans = min(ans, dp[N][ca][cb])\\n\\n \\n\\nif isinf(ans): ans = -1\\n\\nprint(ans)\",\n", + " 'target': \"from math import isinf\\n\\n\\n\\nN, Ma, Mb = list(map(int, input().split()))\\n\\na = [0]*N\\n\\nb = [0]*N\\n\\nc = [0]*N\\n\\nfor i in range(N):\\n\\n a[i],b[i],c[i] = list(map(int, input().split()))\\n\\n\\n\\nW_MAX = 40*10\\n\\ndp = [[float('inf')]*(W_MAX+1) for _ in range(W_MAX+1)]\\n\\ndp[0][0] = 0\\n\\n\\n\\nfor i in range(N):\\n\\n for wa in reversed(list(range(W_MAX+1))):\\n\\n for wb in reversed(list(range(W_MAX+1))):\\n\\n if isinf(dp[wa][wb]): continue\\n\\n if wa+a[i]<=W_MAX and wb+b[i]<=W_MAX:\\n\\n dp[wa+a[i]][wb+b[i]] = min(dp[wa+a[i]][wb+b[i]],\\n\\n dp[wa][wb]+c[i])\\n\\n\\n\\nans = float('inf')\\n\\nfor wa in range(1, W_MAX+1):\\n\\n for wb in range(1, W_MAX+1):\\n\\n if wa*Mb == wb*Ma:\\n\\n ans = min(ans, dp[wa][wb])\\n\\n\\n\\nif isinf(ans): ans = -1\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 34,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 926,\n", + " 'code_v1_num_chars': 775,\n", + " 'code_v0_no_empty_lines': 'G_MAX = 40 * 10\\nN_MAX = 40\\nINF = float(\"inf\")\\ndp = [[[INF] * (G_MAX + 1) for _ in range(G_MAX + 1)] for _ in range(N_MAX + 1)]\\nN, Ma, Mb = list(map(int, input().split()))\\na, b, c = [], [], []\\nfor _ in range(N):\\n ai, bi, ci = list(map(int, input().split()))\\n a.append(ai)\\n b.append(bi)\\n c.append(ci)\\ndp[0][0][0] = 0\\nfrom math import isinf\\n\\nfor i in range(N):\\n for ca in range(G_MAX + 1):\\n for cb in range(G_MAX + 1):\\n if isinf(dp[i][ca][cb]):\\n continue\\n dp[i + 1][ca][cb] = min(dp[i + 1][ca][cb], dp[i][ca][cb])\\n dp[i + 1][ca + a[i]][cb + b[i]] = min(\\n dp[i + 1][ca + a[i]][cb + b[i]], dp[i][ca][cb] + c[i]\\n )\\nans = INF\\nfor ca in range(1, G_MAX + 1):\\n for cb in range(1, G_MAX + 1):\\n if ca * Mb == cb * Ma:\\n ans = min(ans, dp[N][ca][cb])\\nif isinf(ans):\\n ans = -1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from math import isinf\\n\\nN, Ma, Mb = list(map(int, input().split()))\\na = [0] * N\\nb = [0] * N\\nc = [0] * N\\nfor i in range(N):\\n a[i], b[i], c[i] = list(map(int, input().split()))\\nW_MAX = 40 * 10\\ndp = [[float(\"inf\")] * (W_MAX + 1) for _ in range(W_MAX + 1)]\\ndp[0][0] = 0\\nfor i in range(N):\\n for wa in reversed(list(range(W_MAX + 1))):\\n for wb in reversed(list(range(W_MAX + 1))):\\n if isinf(dp[wa][wb]):\\n continue\\n if wa + a[i] <= W_MAX and wb + b[i] <= W_MAX:\\n dp[wa + a[i]][wb + b[i]] = min(\\n dp[wa + a[i]][wb + b[i]], dp[wa][wb] + c[i]\\n )\\nans = float(\"inf\")\\nfor wa in range(1, W_MAX + 1):\\n for wb in range(1, W_MAX + 1):\\n if wa * Mb == wb * Ma:\\n ans = min(ans, dp[wa][wb])\\nif isinf(ans):\\n ans = -1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.7058823529,\n", + " 'diff': ['-G_MAX = 40 * 10',\n", + " '-N_MAX = 40',\n", + " '-INF = float(\"inf\")',\n", + " '-dp = [[[INF] * (G_MAX + 1) for _ in range(G_MAX + 1)] for _ in range(N_MAX + 1)]',\n", + " '-N, Ma, Mb = list(map(int, input().split()))',\n", + " '-a, b, c = [], [], []',\n", + " '-for _ in range(N):',\n", + " '- ai, bi, ci = list(map(int, input().split()))',\n", + " '- a.append(ai)',\n", + " '- b.append(bi)',\n", + " '- c.append(ci)',\n", + " '-dp[0][0][0] = 0',\n", + " '+N, Ma, Mb = list(map(int, input().split()))',\n", + " '+a = [0] * N',\n", + " '+b = [0] * N',\n", + " '+c = [0] * N',\n", + " '- for ca in range(G_MAX + 1):',\n", + " '- for cb in range(G_MAX + 1):',\n", + " '- if isinf(dp[i][ca][cb]):',\n", + " '+ a[i], b[i], c[i] = list(map(int, input().split()))',\n", + " '+W_MAX = 40 * 10',\n", + " '+dp = [[float(\"inf\")] * (W_MAX + 1) for _ in range(W_MAX + 1)]',\n", + " '+dp[0][0] = 0',\n", + " '+for i in range(N):',\n", + " '+ for wa in reversed(list(range(W_MAX + 1))):',\n", + " '+ for wb in reversed(list(range(W_MAX + 1))):',\n", + " '+ if isinf(dp[wa][wb]):',\n", + " '- dp[i + 1][ca][cb] = min(dp[i + 1][ca][cb], dp[i][ca][cb])',\n", + " '- dp[i + 1][ca + a[i]][cb + b[i]] = min(',\n", + " '- dp[i + 1][ca + a[i]][cb + b[i]], dp[i][ca][cb] + c[i]',\n", + " '- )',\n", + " '-ans = INF',\n", + " '-for ca in range(1, G_MAX + 1):',\n", + " '- for cb in range(1, G_MAX + 1):',\n", + " '- if ca * Mb == cb * Ma:',\n", + " '- ans = min(ans, dp[N][ca][cb])',\n", + " '+ if wa + a[i] <= W_MAX and wb + b[i] <= W_MAX:',\n", + " '+ dp[wa + a[i]][wb + b[i]] = min(',\n", + " '+ dp[wa + a[i]][wb + b[i]], dp[wa][wb] + c[i]',\n", + " '+ )',\n", + " '+ans = float(\"inf\")',\n", + " '+for wa in range(1, W_MAX + 1):',\n", + " '+ for wb in range(1, W_MAX + 1):',\n", + " '+ if wa * Mb == wb * Ma:',\n", + " '+ ans = min(ans, dp[wa][wb])'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.4082550259,\n", + " 'measured_runtime_v1': 0.8679478877,\n", + " 'runtime_lift': 2.7746539396,\n", + " 'key': ['s636298531', 's857325561']},\n", + " {'user_id': 'u724687935',\n", + " 'problem_id': 'p02599',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's870922238',\n", + " 'submission_id_v1': 's250640318',\n", + " 'cpu_time_v0': 1686,\n", + " 'cpu_time_v1': 1507,\n", + " 'memory_v0': 281560,\n", + " 'memory_v1': 281720,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.62,\n", + " 'input': \"import sys\\n\\n\\n\\n\\n\\nclass BinaryIndexedTree():\\n\\n '''\\n\\n 1-indexed\\n\\n '''\\n\\n def __init__(self, A):\\n\\n self.__n = len(A)\\n\\n self.__node = [0] * (self.__n + 1)\\n\\n self.__data = [0] * (self.__n + 1)\\n\\n\\n\\n S = [0] * (self.__n + 1)\\n\\n for i in range(1, self.__n + 1):\\n\\n S[i] = S[i - 1] + A[i - 1]\\n\\n self.__data[i] = A[i - 1]\\n\\n self.__node[i] = S[i] - S[i - (i & -i)]\\n\\n\\n\\n def add(self, i, v):\\n\\n self.__data[i] += v\\n\\n while i <= self.__n:\\n\\n self.__node[i] += v\\n\\n i += i & -i\\n\\n\\n\\n def sum(self, i):\\n\\n ''' [1, i]の和\\n\\n '''\\n\\n rst = 0\\n\\n while i > 0:\\n\\n rst += self.__node[i]\\n\\n i -= i & -i\\n\\n return rst\\n\\n \\n\\n def get(self, i, j):\\n\\n '''[i, j]の和\\n\\n '''\\n\\n if i == j:\\n\\n return self.__data[i]\\n\\n else:\\n\\n return self.sum(j) - self.sum(i - 1)\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, Q = map(int, input().split())\\n\\n C = list(map(int, input().split()))\\n\\n\\n\\n P = [[] for _ in range(N)]\\n\\n for i, c in enumerate(C):\\n\\n P[c - 1].append(i)\\n\\n\\n\\n right = [0] * N\\n\\n for p in P:\\n\\n if len(p):\\n\\n right[p.pop()] = 1\\n\\n BIT = BinaryIndexedTree(right)\\n\\n\\n\\n query = [[] for _ in range(N)]\\n\\n for i, s in enumerate(sys.stdin.readlines()):\\n\\n l, r = map(int, s.split())\\n\\n query[r - 1].append((l - 1, i))\\n\\n\\n\\n ans = [None] * Q\\n\\n\\n\\n cur = N - 1\\n\\n for r, q in enumerate(reversed(query)):\\n\\n r = (N - 1) - r\\n\\n while q:\\n\\n l, i = q.pop()\\n\\n while r < cur:\\n\\n c = C[cur] - 1\\n\\n p = P[c]\\n\\n if len(p):\\n\\n BIT.add(p.pop() + 1, 1)\\n\\n cur -= 1\\n\\n tmp = BIT.get(l + 1, r + 1)\\n\\n ans[i] = tmp\\n\\n\\n\\n print(*ans, sep='\\\\n')\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"import sys\\n\\n\\n\\n\\n\\nclass BinaryIndexedTree():\\n\\n '''\\n\\n 1-indexed\\n\\n '''\\n\\n def __init__(self, A):\\n\\n self.__n = len(A)\\n\\n self.__node = [0] * (self.__n + 1)\\n\\n self.__data = [0] * (self.__n + 1)\\n\\n\\n\\n S = [0] * (self.__n + 1)\\n\\n for i in range(self.__n):\\n\\n S[i + 1] = S[i] + A[i]\\n\\n\\n\\n for i in range(1, self.__n + 1):\\n\\n self.__data[i] = A[i - 1]\\n\\n self.__node[i] = S[i] - S[i - (i & -i)]\\n\\n\\n\\n def add(self, i, v):\\n\\n self.__data[i] += v\\n\\n while i <= self.__n:\\n\\n self.__node[i] += v\\n\\n i += i & -i\\n\\n\\n\\n def sum(self, i):\\n\\n ''' [1, i]の和\\n\\n '''\\n\\n rst = 0\\n\\n while i > 0:\\n\\n rst += self.__node[i]\\n\\n i -= i & -i\\n\\n return rst\\n\\n \\n\\n def get(self, i, j):\\n\\n '''[i, j]の和\\n\\n '''\\n\\n if i == j:\\n\\n return self.__data[i]\\n\\n else:\\n\\n return self.sum(j) - self.sum(i - 1)\\n\\n\\n\\n\\n\\ndef main():\\n\\n N, Q = map(int, input().split())\\n\\n C = list(map(int, input().split()))\\n\\n\\n\\n P = [[] for _ in range(N)]\\n\\n for i, c in enumerate(C):\\n\\n P[c - 1].append(i)\\n\\n\\n\\n right = [0] * N\\n\\n for p in P:\\n\\n if len(p):\\n\\n right[p.pop()] = 1\\n\\n BIT = BinaryIndexedTree(right)\\n\\n\\n\\n query = [[] for _ in range(N)]\\n\\n for i, s in enumerate(sys.stdin.readlines()):\\n\\n l, r = map(int, s.split())\\n\\n query[r - 1].append((l - 1, i))\\n\\n\\n\\n ans = [None] * Q\\n\\n\\n\\n cur = N - 1\\n\\n for r, q in enumerate(reversed(query)):\\n\\n r = (N - 1) - r\\n\\n while q:\\n\\n l, i = q.pop()\\n\\n while r < cur:\\n\\n c = C[cur] - 1\\n\\n p = P[c]\\n\\n if len(p):\\n\\n BIT.add(p.pop() + 1, 1)\\n\\n cur -= 1\\n\\n tmp = BIT.get(l + 1, r + 1)\\n\\n ans[i] = tmp\\n\\n\\n\\n print(*ans, sep='\\\\n')\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 82,\n", + " 'code_v1_loc': 84,\n", + " 'code_v0_num_chars': 1906,\n", + " 'code_v1_num_chars': 1939,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\n\\nclass BinaryIndexedTree:\\n \"\"\"\\n 1-indexed\\n \"\"\"\\n\\n def __init__(self, A):\\n self.__n = len(A)\\n self.__node = [0] * (self.__n + 1)\\n self.__data = [0] * (self.__n + 1)\\n S = [0] * (self.__n + 1)\\n for i in range(1, self.__n + 1):\\n S[i] = S[i - 1] + A[i - 1]\\n self.__data[i] = A[i - 1]\\n self.__node[i] = S[i] - S[i - (i & -i)]\\n\\n def add(self, i, v):\\n self.__data[i] += v\\n while i <= self.__n:\\n self.__node[i] += v\\n i += i & -i\\n\\n def sum(self, i):\\n \"\"\"[1, i]の和\"\"\"\\n rst = 0\\n while i > 0:\\n rst += self.__node[i]\\n i -= i & -i\\n return rst\\n\\n def get(self, i, j):\\n \"\"\"[i, j]の和\"\"\"\\n if i == j:\\n return self.__data[i]\\n else:\\n return self.sum(j) - self.sum(i - 1)\\n\\n\\ndef main():\\n N, Q = map(int, input().split())\\n C = list(map(int, input().split()))\\n P = [[] for _ in range(N)]\\n for i, c in enumerate(C):\\n P[c - 1].append(i)\\n right = [0] * N\\n for p in P:\\n if len(p):\\n right[p.pop()] = 1\\n BIT = BinaryIndexedTree(right)\\n query = [[] for _ in range(N)]\\n for i, s in enumerate(sys.stdin.readlines()):\\n l, r = map(int, s.split())\\n query[r - 1].append((l - 1, i))\\n ans = [None] * Q\\n cur = N - 1\\n for r, q in enumerate(reversed(query)):\\n r = (N - 1) - r\\n while q:\\n l, i = q.pop()\\n while r < cur:\\n c = C[cur] - 1\\n p = P[c]\\n if len(p):\\n BIT.add(p.pop() + 1, 1)\\n cur -= 1\\n tmp = BIT.get(l + 1, r + 1)\\n ans[i] = tmp\\n print(*ans, sep=\"\\\\n\")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\nclass BinaryIndexedTree:\\n \"\"\"\\n 1-indexed\\n \"\"\"\\n\\n def __init__(self, A):\\n self.__n = len(A)\\n self.__node = [0] * (self.__n + 1)\\n self.__data = [0] * (self.__n + 1)\\n S = [0] * (self.__n + 1)\\n for i in range(self.__n):\\n S[i + 1] = S[i] + A[i]\\n for i in range(1, self.__n + 1):\\n self.__data[i] = A[i - 1]\\n self.__node[i] = S[i] - S[i - (i & -i)]\\n\\n def add(self, i, v):\\n self.__data[i] += v\\n while i <= self.__n:\\n self.__node[i] += v\\n i += i & -i\\n\\n def sum(self, i):\\n \"\"\"[1, i]の和\"\"\"\\n rst = 0\\n while i > 0:\\n rst += self.__node[i]\\n i -= i & -i\\n return rst\\n\\n def get(self, i, j):\\n \"\"\"[i, j]の和\"\"\"\\n if i == j:\\n return self.__data[i]\\n else:\\n return self.sum(j) - self.sum(i - 1)\\n\\n\\ndef main():\\n N, Q = map(int, input().split())\\n C = list(map(int, input().split()))\\n P = [[] for _ in range(N)]\\n for i, c in enumerate(C):\\n P[c - 1].append(i)\\n right = [0] * N\\n for p in P:\\n if len(p):\\n right[p.pop()] = 1\\n BIT = BinaryIndexedTree(right)\\n query = [[] for _ in range(N)]\\n for i, s in enumerate(sys.stdin.readlines()):\\n l, r = map(int, s.split())\\n query[r - 1].append((l - 1, i))\\n ans = [None] * Q\\n cur = N - 1\\n for r, q in enumerate(reversed(query)):\\n r = (N - 1) - r\\n while q:\\n l, i = q.pop()\\n while r < cur:\\n c = C[cur] - 1\\n p = P[c]\\n if len(p):\\n BIT.add(p.pop() + 1, 1)\\n cur -= 1\\n tmp = BIT.get(l + 1, r + 1)\\n ans[i] = tmp\\n print(*ans, sep=\"\\\\n\")\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 2.380952381,\n", + " 'diff': ['+ for i in range(self.__n):',\n", + " '+ S[i + 1] = S[i] + A[i]',\n", + " '- S[i] = S[i - 1] + A[i - 1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1911105648,\n", + " 'measured_runtime_v1': 0.00684015,\n", + " 'runtime_lift': 27.9395284689,\n", + " 'key': ['s870922238', 's250640318']},\n", + " {'user_id': 'u057109575',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's505874222',\n", + " 'submission_id_v1': 's539286615',\n", + " 'cpu_time_v0': 444,\n", + " 'cpu_time_v1': 182,\n", + " 'memory_v0': 96824,\n", + " 'memory_v1': 96876,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.01,\n", + " 'input': 'from functools import reduce\\n\\nfrom fractions import gcd\\n\\n\\n\\nN, M, *A = list(map(int, open(0).read().split()))\\n\\n\\n\\ndef lcm(x, y):\\n\\n return x * y // gcd(x, y)\\n\\n\\n\\ndef sub_by_2(n):\\n\\n cnt = 0\\n\\n while n % 2 == 0:\\n\\n n //= 2\\n\\n cnt += 1\\n\\n return cnt\\n\\n\\n\\nlcm_2 = [sub_by_2(n // 2) for n in A]\\n\\nif all(lcm_2[0] == v for v in lcm_2):\\n\\n num = reduce(lcm, [v // 2 for v in A])\\n\\n res = M // num\\n\\n print((res // 2 + res % 2))\\n\\nelse:\\n\\n print((0))\\n',\n", + " 'target': 'from math import gcd\\n\\nfrom functools import reduce\\n\\n\\n\\nN, M, *A = list(map(int, open(0).read().split()))\\n\\n\\n\\ndef lcm(x, y):\\n\\n return x * y // gcd(x, y)\\n\\n\\n\\ndef lcm_list(numbers):\\n\\n return reduce(lcm, numbers, 1)\\n\\n\\n\\ndef even_count(n):\\n\\n res = 0\\n\\n while n % 2 == 0:\\n\\n res += 1\\n\\n n //= 2\\n\\n return res\\n\\n\\n\\n\\n\\nx = [v // 2 for v in A]\\n\\nif all(even_count(v) == even_count(x[0]) for v in x):\\n\\n num = lcm_list(x)\\n\\n print((-(-(M // num) // 2)))\\n\\nelse:\\n\\n print((0))\\n\\n\\n',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 455,\n", + " 'code_v1_num_chars': 480,\n", + " 'code_v0_no_empty_lines': 'from functools import reduce\\nfrom fractions import gcd\\n\\nN, M, *A = list(map(int, open(0).read().split()))\\n\\n\\ndef lcm(x, y):\\n return x * y // gcd(x, y)\\n\\n\\ndef sub_by_2(n):\\n cnt = 0\\n while n % 2 == 0:\\n n //= 2\\n cnt += 1\\n return cnt\\n\\n\\nlcm_2 = [sub_by_2(n // 2) for n in A]\\nif all(lcm_2[0] == v for v in lcm_2):\\n num = reduce(lcm, [v // 2 for v in A])\\n res = M // num\\n print((res // 2 + res % 2))\\nelse:\\n print((0))\\n',\n", + " 'code_v1_no_empty_lines': 'from math import gcd\\nfrom functools import reduce\\n\\nN, M, *A = list(map(int, open(0).read().split()))\\n\\n\\ndef lcm(x, y):\\n return x * y // gcd(x, y)\\n\\n\\ndef lcm_list(numbers):\\n return reduce(lcm, numbers, 1)\\n\\n\\ndef even_count(n):\\n res = 0\\n while n % 2 == 0:\\n res += 1\\n n //= 2\\n return res\\n\\n\\nx = [v // 2 for v in A]\\nif all(even_count(v) == even_count(x[0]) for v in x):\\n num = lcm_list(x)\\n print((-(-(M // num) // 2)))\\nelse:\\n print((0))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.3846153846,\n", + " 'diff': ['+from math import gcd',\n", + " '-from fractions import gcd',\n", + " '-def sub_by_2(n):',\n", + " '- cnt = 0',\n", + " '- while n % 2 == 0:',\n", + " '- n //= 2',\n", + " '- cnt += 1',\n", + " '- return cnt',\n", + " '+def lcm_list(numbers):',\n", + " '+ return reduce(lcm, numbers, 1)',\n", + " '-lcm_2 = [sub_by_2(n // 2) for n in A]',\n", + " '-if all(lcm_2[0] == v for v in lcm_2):',\n", + " '- num = reduce(lcm, [v // 2 for v in A])',\n", + " '- res = M // num',\n", + " '- print((res // 2 + res % 2))',\n", + " '+def even_count(n):',\n", + " '+ res = 0',\n", + " '+ while n % 2 == 0:',\n", + " '+ res += 1',\n", + " '+ n //= 2',\n", + " '+ return res',\n", + " '+',\n", + " '+',\n", + " '+x = [v // 2 for v in A]',\n", + " '+if all(even_count(v) == even_count(x[0]) for v in x):',\n", + " '+ num = lcm_list(x)',\n", + " '+ print((-(-(M // num) // 2)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4227621694,\n", + " 'measured_runtime_v1': 0.2989870732,\n", + " 'runtime_lift': 1.4139814302,\n", + " 'key': ['s505874222', 's539286615']},\n", + " {'user_id': 'u868628468',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's517832809',\n", + " 'submission_id_v1': 's490323912',\n", + " 'cpu_time_v0': 151,\n", + " 'cpu_time_v1': 62,\n", + " 'memory_v0': 73984,\n", + " 'memory_v1': 63380,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 58.94,\n", + " 'input': 'from sys import stdin\\n\\ndef solve():\\n\\n s = int(stdin.readline())\\n\\n mod = 10**9+7\\n\\n if s < 3: return 0\\n\\n dp = [0]*(s+1)\\n\\n dp[0] = 1\\n\\n for i in range(3,s+1):\\n\\n for x in range(3,i+1):\\n\\n if x in [i-1,i-2]:\\n\\n continue\\n\\n dp[i] += dp[i-x]\\n\\n return dp[s]%mod\\n\\nprint((solve()))',\n", + " 'target': 'from sys import stdin\\n\\ndef solve():\\n\\n s = int(stdin.readline())\\n\\n mod = 10**9+7\\n\\n if s < 3: return 0\\n\\n dp = [0]*(s+1)\\n\\n dp[0] = 1\\n\\n for i in range(3,s+1):\\n\\n dp[i] = dp[i-1] + dp[i-3]\\n\\n return dp[s]%mod\\n\\nprint((solve()))',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 330,\n", + " 'code_v1_num_chars': 245,\n", + " 'code_v0_no_empty_lines': 'from sys import stdin\\n\\n\\ndef solve():\\n s = int(stdin.readline())\\n mod = 10**9 + 7\\n if s < 3:\\n return 0\\n dp = [0] * (s + 1)\\n dp[0] = 1\\n for i in range(3, s + 1):\\n for x in range(3, i + 1):\\n if x in [i - 1, i - 2]:\\n continue\\n dp[i] += dp[i - x]\\n return dp[s] % mod\\n\\n\\nprint((solve()))\\n',\n", + " 'code_v1_no_empty_lines': 'from sys import stdin\\n\\n\\ndef solve():\\n s = int(stdin.readline())\\n mod = 10**9 + 7\\n if s < 3:\\n return 0\\n dp = [0] * (s + 1)\\n dp[0] = 1\\n for i in range(3, s + 1):\\n dp[i] = dp[i - 1] + dp[i - 3]\\n return dp[s] % mod\\n\\n\\nprint((solve()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.4285714286,\n", + " 'diff': ['- for x in range(3, i + 1):',\n", + " '- if x in [i - 1, i - 2]:',\n", + " '- continue',\n", + " '- dp[i] += dp[i - x]',\n", + " '+ dp[i] = dp[i - 1] + dp[i - 3]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6190335753,\n", + " 'measured_runtime_v1': 0.2015811858,\n", + " 'runtime_lift': 3.0708896406,\n", + " 'key': ['s517832809', 's490323912']},\n", + " {'user_id': 'u989345508',\n", + " 'problem_id': 'p03798',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's244589711',\n", + " 'submission_id_v1': 's160001244',\n", + " 'cpu_time_v0': 1408,\n", + " 'cpu_time_v1': 1267,\n", + " 'memory_v0': 3892,\n", + " 'memory_v1': 3880,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.01,\n", + " 'input': 'n=int(eval(input()))\\n\\ns=eval(input())\\n\\nx=[\"SS\",\"SW\",\"WS\",\"WW\"]\\n\\n\\n\\ndef check0(i):\\n\\n if x[i][0]==\"S\":\\n\\n if s[0]==\"o\":\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n return x[i][1]==\"W\"\\n\\n else:\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"W\"\\n\\n else:\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n if s[0]==\"o\":\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"W\"\\n\\n else:\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n return x[i][1]==\"W\"\\n\\ndef check1(i):\\n\\n if x[i][n-1]==\"S\":\\n\\n if s[n-1]==\"o\":\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n return x[i][0]==\"W\"\\n\\n else:\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"W\"\\n\\n else:\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n if s[n-1]==\"o\":\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"W\"\\n\\n else:\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n return x[i][0]==\"W\"\\n\\n\\n\\n\\n\\nfor i in range(4):\\n\\n for j in range(n-2):\\n\\n if x[i][j+1]==\"S\":\\n\\n if s[j+1]==\"o\":\\n\\n if x[i][j]==\"S\":\\n\\n x[i]+=\"S\"\\n\\n else:\\n\\n x[i]+=\"W\"\\n\\n else:\\n\\n if x[i][j]==\"S\":\\n\\n x[i]+=\"W\"\\n\\n else:\\n\\n x[i]+=\"S\"\\n\\n else:\\n\\n if s[j+1]==\"o\":\\n\\n if x[i][j]==\"S\":\\n\\n x[i]+=\"W\"\\n\\n else:\\n\\n x[i]+=\"S\"\\n\\n else:\\n\\n if x[i][j]==\"S\":\\n\\n x[i]+=\"S\"\\n\\n else:\\n\\n x[i]+=\"W\"\\n\\n #print(x[i])\\n\\n if check0(i) and check1(i):\\n\\n print((x[i]))\\n\\n break\\n\\nelse:\\n\\n print((-1))\\n',\n", + " 'target': 'n=int(eval(input()))\\n\\ns=eval(input())\\n\\nx=[\"SS\",\"SW\",\"WS\",\"WW\"]\\n\\n\\n\\ndef check0(i):\\n\\n if x[i][0]==\"S\":\\n\\n if s[0]==\"o\":\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n return x[i][1]==\"W\"\\n\\n else:\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"W\"\\n\\n else:\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n if s[0]==\"o\":\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"W\"\\n\\n else:\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n if x[i][-1]==\"S\":\\n\\n return x[i][1]==\"S\"\\n\\n else:\\n\\n return x[i][1]==\"W\"\\n\\ndef check1(i):\\n\\n if x[i][n-1]==\"S\":\\n\\n if s[n-1]==\"o\":\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n return x[i][0]==\"W\"\\n\\n else:\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"W\"\\n\\n else:\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n if s[n-1]==\"o\":\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"W\"\\n\\n else:\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n if x[i][n-2]==\"S\":\\n\\n return x[i][0]==\"S\"\\n\\n else:\\n\\n return x[i][0]==\"W\"\\n\\n\\n\\na=[\"S\",\"W\"]\\n\\nfor i in range(4):\\n\\n for j in range(n-2):\\n\\n if x[i][j+1]==\"S\":\\n\\n if s[j+1]==\"o\":\\n\\n x[i]+=a[x[i][j]!=\"S\"]\\n\\n else:\\n\\n x[i]+=a[x[i][j]==\"S\"]\\n\\n else:\\n\\n if s[j+1]==\"o\":\\n\\n x[i]+=a[x[i][j]==\"S\"]\\n\\n else:\\n\\n x[i]+=a[x[i][j]!=\"S\"]\\n\\n if check0(i) and check1(i):\\n\\n print((x[i]))\\n\\n break\\n\\nelse:\\n\\n print((-1))\\n',\n", + " 'code_v0_loc': 82,\n", + " 'code_v1_loc': 69,\n", + " 'code_v0_num_chars': 2079,\n", + " 'code_v1_num_chars': 1752,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\ns = eval(input())\\nx = [\"SS\", \"SW\", \"WS\", \"WW\"]\\n\\n\\ndef check0(i):\\n if x[i][0] == \"S\":\\n if s[0] == \"o\":\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"S\"\\n else:\\n return x[i][1] == \"W\"\\n else:\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"W\"\\n else:\\n return x[i][1] == \"S\"\\n else:\\n if s[0] == \"o\":\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"W\"\\n else:\\n return x[i][1] == \"S\"\\n else:\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"S\"\\n else:\\n return x[i][1] == \"W\"\\n\\n\\ndef check1(i):\\n if x[i][n - 1] == \"S\":\\n if s[n - 1] == \"o\":\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"S\"\\n else:\\n return x[i][0] == \"W\"\\n else:\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"W\"\\n else:\\n return x[i][0] == \"S\"\\n else:\\n if s[n - 1] == \"o\":\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"W\"\\n else:\\n return x[i][0] == \"S\"\\n else:\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"S\"\\n else:\\n return x[i][0] == \"W\"\\n\\n\\nfor i in range(4):\\n for j in range(n - 2):\\n if x[i][j + 1] == \"S\":\\n if s[j + 1] == \"o\":\\n if x[i][j] == \"S\":\\n x[i] += \"S\"\\n else:\\n x[i] += \"W\"\\n else:\\n if x[i][j] == \"S\":\\n x[i] += \"W\"\\n else:\\n x[i] += \"S\"\\n else:\\n if s[j + 1] == \"o\":\\n if x[i][j] == \"S\":\\n x[i] += \"W\"\\n else:\\n x[i] += \"S\"\\n else:\\n if x[i][j] == \"S\":\\n x[i] += \"S\"\\n else:\\n x[i] += \"W\"\\n # print(x[i])\\n if check0(i) and check1(i):\\n print((x[i]))\\n break\\nelse:\\n print((-1))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\ns = eval(input())\\nx = [\"SS\", \"SW\", \"WS\", \"WW\"]\\n\\n\\ndef check0(i):\\n if x[i][0] == \"S\":\\n if s[0] == \"o\":\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"S\"\\n else:\\n return x[i][1] == \"W\"\\n else:\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"W\"\\n else:\\n return x[i][1] == \"S\"\\n else:\\n if s[0] == \"o\":\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"W\"\\n else:\\n return x[i][1] == \"S\"\\n else:\\n if x[i][-1] == \"S\":\\n return x[i][1] == \"S\"\\n else:\\n return x[i][1] == \"W\"\\n\\n\\ndef check1(i):\\n if x[i][n - 1] == \"S\":\\n if s[n - 1] == \"o\":\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"S\"\\n else:\\n return x[i][0] == \"W\"\\n else:\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"W\"\\n else:\\n return x[i][0] == \"S\"\\n else:\\n if s[n - 1] == \"o\":\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"W\"\\n else:\\n return x[i][0] == \"S\"\\n else:\\n if x[i][n - 2] == \"S\":\\n return x[i][0] == \"S\"\\n else:\\n return x[i][0] == \"W\"\\n\\n\\na = [\"S\", \"W\"]\\nfor i in range(4):\\n for j in range(n - 2):\\n if x[i][j + 1] == \"S\":\\n if s[j + 1] == \"o\":\\n x[i] += a[x[i][j] != \"S\"]\\n else:\\n x[i] += a[x[i][j] == \"S\"]\\n else:\\n if s[j + 1] == \"o\":\\n x[i] += a[x[i][j] == \"S\"]\\n else:\\n x[i] += a[x[i][j] != \"S\"]\\n if check0(i) and check1(i):\\n print((x[i]))\\n break\\nelse:\\n print((-1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.8536585366,\n", + " 'diff': ['+a = [\"S\", \"W\"]',\n", + " '- if x[i][j] == \"S\":',\n", + " '- x[i] += \"S\"',\n", + " '- else:',\n", + " '- x[i] += \"W\"',\n", + " '+ x[i] += a[x[i][j] != \"S\"]',\n", + " '- if x[i][j] == \"S\":',\n", + " '- x[i] += \"W\"',\n", + " '- else:',\n", + " '- x[i] += \"S\"',\n", + " '+ x[i] += a[x[i][j] == \"S\"]',\n", + " '- if x[i][j] == \"S\":',\n", + " '- x[i] += \"W\"',\n", + " '- else:',\n", + " '- x[i] += \"S\"',\n", + " '+ x[i] += a[x[i][j] == \"S\"]',\n", + " '- if x[i][j] == \"S\":',\n", + " '- x[i] += \"S\"',\n", + " '- else:',\n", + " '- x[i] += \"W\"',\n", + " '- # print(x[i])',\n", + " '+ x[i] += a[x[i][j] != \"S\"]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.206637172,\n", + " 'measured_runtime_v1': 0.0056119666,\n", + " 'runtime_lift': 36.8208127342,\n", + " 'key': ['s244589711', 's160001244']},\n", + " {'user_id': 'u389910364',\n", + " 'problem_id': 'p03575',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's425131512',\n", + " 'submission_id_v1': 's549163277',\n", + " 'cpu_time_v0': 194,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 14880,\n", + " 'memory_v1': 3188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.72,\n", + " 'input': 'import os\\n\\nimport sys\\n\\n\\n\\nimport numpy as np\\n\\nfrom scipy.sparse import csr_matrix\\n\\nfrom scipy.sparse.csgraph import connected_components\\n\\n\\n\\nif os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"_in.txt\", \"r\")\\n\\n\\n\\nsys.setrecursionlimit(2147483647)\\n\\nINF = float(\"inf\")\\n\\nIINF = 10 ** 18\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\nN, M = list(map(int, sys.stdin.readline().split()))\\n\\nA, B = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(M)]))\\n\\nA = np.array(A) - 1\\n\\nB = np.array(B) - 1\\n\\n\\n\\n\\n\\ndef is_bridge(i):\\n\\n a = np.concatenate([A[:i], A[i + 1:]])\\n\\n b = np.concatenate([B[:i], B[i + 1:]])\\n\\n graph = csr_matrix(([True] * (M - 1), (a, b)), shape=(N, N))\\n\\n _, components = connected_components(graph, directed=False)\\n\\n return components.max() >= 1\\n\\n\\n\\n\\n\\nans = 0\\n\\nfor i in range(M):\\n\\n ans += is_bridge(i)\\n\\nprint(ans)\\n',\n", + " 'target': 'import os\\n\\n\\n\\nimport sys\\n\\n\\n\\nif os.getenv(\"LOCAL\"):\\n\\n sys.stdin = open(\"_in.txt\", \"r\")\\n\\n\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float(\"inf\")\\n\\nIINF = 10 ** 18\\n\\nMOD = 10 ** 9 + 7\\n\\n\\n\\n\\n\\n# MOD = 998244353\\n\\n\\n\\n\\n\\ndef enumerate_bridges(graph):\\n\\n \"\"\"\\n\\n 橋を列挙する\\n\\n http://nupioca.hatenadiary.jp/entry/2013/11/03/200006\\n\\n :param list of (list of int) graph:\\n\\n \"\"\"\\n\\n N = len(graph)\\n\\n ret_bridges = []\\n\\n pres = [-1] * N\\n\\n lows = [-1] * N\\n\\n order = -1\\n\\n for v in range(N):\\n\\n if pres[v] >= 0:\\n\\n continue\\n\\n edges = [(None, v, True)]\\n\\n while edges:\\n\\n v, u, forward = edges.pop()\\n\\n if forward:\\n\\n if pres[u] >= 0:\\n\\n # もう来たことがある\\n\\n lows[v] = min(lows[v], lows[u])\\n\\n continue\\n\\n edges.append((v, u, False))\\n\\n parent, v = v, u\\n\\n order += 1\\n\\n pres[v] = lows[v] = order\\n\\n for u in graph[v]:\\n\\n if u == parent:\\n\\n continue\\n\\n edges.append((v, u, True))\\n\\n else:\\n\\n if v is None:\\n\\n continue\\n\\n if lows[u] == pres[u]:\\n\\n ret_bridges.append((v, u))\\n\\n lows[v] = min(lows[v], lows[u])\\n\\n return ret_bridges\\n\\n\\n\\n\\n\\nN, M = list(map(int, sys.stdin.buffer.readline().split()))\\n\\nAB = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]\\n\\ngraph = [[] for _ in range(N + 1)]\\n\\nfor a, b in AB:\\n\\n graph[a].append(b)\\n\\n graph[b].append(a)\\n\\nbridges = enumerate_bridges(graph)\\n\\nprint((len(bridges)))\\n',\n", + " 'code_v0_loc': 33,\n", + " 'code_v1_loc': 63,\n", + " 'code_v0_num_chars': 815,\n", + " 'code_v1_num_chars': 1657,\n", + " 'code_v0_no_empty_lines': 'import os\\nimport sys\\nimport numpy as np\\nfrom scipy.sparse import csr_matrix\\nfrom scipy.sparse.csgraph import connected_components\\n\\nif os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"_in.txt\", \"r\")\\nsys.setrecursionlimit(2147483647)\\nINF = float(\"inf\")\\nIINF = 10**18\\nMOD = 10**9 + 7\\nN, M = list(map(int, sys.stdin.readline().split()))\\nA, B = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(M)]))\\nA = np.array(A) - 1\\nB = np.array(B) - 1\\n\\n\\ndef is_bridge(i):\\n a = np.concatenate([A[:i], A[i + 1 :]])\\n b = np.concatenate([B[:i], B[i + 1 :]])\\n graph = csr_matrix(([True] * (M - 1), (a, b)), shape=(N, N))\\n _, components = connected_components(graph, directed=False)\\n return components.max() >= 1\\n\\n\\nans = 0\\nfor i in range(M):\\n ans += is_bridge(i)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import os\\nimport sys\\n\\nif os.getenv(\"LOCAL\"):\\n sys.stdin = open(\"_in.txt\", \"r\")\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nIINF = 10**18\\nMOD = 10**9 + 7\\n# MOD = 998244353\\ndef enumerate_bridges(graph):\\n \"\"\"\\n 橋を列挙する\\n http://nupioca.hatenadiary.jp/entry/2013/11/03/200006\\n :param list of (list of int) graph:\\n \"\"\"\\n N = len(graph)\\n ret_bridges = []\\n pres = [-1] * N\\n lows = [-1] * N\\n order = -1\\n for v in range(N):\\n if pres[v] >= 0:\\n continue\\n edges = [(None, v, True)]\\n while edges:\\n v, u, forward = edges.pop()\\n if forward:\\n if pres[u] >= 0:\\n # もう来たことがある\\n lows[v] = min(lows[v], lows[u])\\n continue\\n edges.append((v, u, False))\\n parent, v = v, u\\n order += 1\\n pres[v] = lows[v] = order\\n for u in graph[v]:\\n if u == parent:\\n continue\\n edges.append((v, u, True))\\n else:\\n if v is None:\\n continue\\n if lows[u] == pres[u]:\\n ret_bridges.append((v, u))\\n lows[v] = min(lows[v], lows[u])\\n return ret_bridges\\n\\n\\nN, M = list(map(int, sys.stdin.buffer.readline().split()))\\nAB = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]\\ngraph = [[] for _ in range(N + 1)]\\nfor a, b in AB:\\n graph[a].append(b)\\n graph[b].append(a)\\nbridges = enumerate_bridges(graph)\\nprint((len(bridges)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 47.619047619,\n", + " 'diff': ['-import numpy as np',\n", + " '-from scipy.sparse import csr_matrix',\n", + " '-from scipy.sparse.csgraph import connected_components',\n", + " '-sys.setrecursionlimit(2147483647)',\n", + " '+sys.setrecursionlimit(10**9)',\n", + " '-N, M = list(map(int, sys.stdin.readline().split()))',\n", + " '-A, B = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(M)]))',\n", + " '-A = np.array(A) - 1',\n", + " '-B = np.array(B) - 1',\n", + " '+# MOD = 998244353',\n", + " '+def enumerate_bridges(graph):',\n", + " '+ \"\"\"',\n", + " '+ 橋を列挙する',\n", + " '+ http://nupioca.hatenadiary.jp/entry/2013/11/03/200006',\n", + " '+ :param list of (list of int) graph:',\n", + " '+ \"\"\"',\n", + " '+ N = len(graph)',\n", + " '+ ret_bridges = []',\n", + " '+ pres = [-1] * N',\n", + " '+ lows = [-1] * N',\n", + " '+ order = -1',\n", + " '+ for v in range(N):',\n", + " '+ if pres[v] >= 0:',\n", + " '+ continue',\n", + " '+ edges = [(None, v, True)]',\n", + " '+ while edges:',\n", + " '+ v, u, forward = edges.pop()',\n", + " '+ if forward:',\n", + " '+ if pres[u] >= 0:',\n", + " '+ # もう来たことがある',\n", + " '+ lows[v] = min(lows[v], lows[u])',\n", + " '+ continue',\n", + " '+ edges.append((v, u, False))',\n", + " '+ parent, v = v, u',\n", + " '+ order += 1',\n", + " '+ pres[v] = lows[v] = order',\n", + " '+ for u in graph[v]:',\n", + " '+ if u == parent:',\n", + " '+ continue',\n", + " '+ edges.append((v, u, True))',\n", + " '+ else:',\n", + " '+ if v is None:',\n", + " '+ continue',\n", + " '+ if lows[u] == pres[u]:',\n", + " '+ ret_bridges.append((v, u))',\n", + " '+ lows[v] = min(lows[v], lows[u])',\n", + " '+ return ret_bridges',\n", + " '-def is_bridge(i):',\n", + " '- a = np.concatenate([A[:i], A[i + 1 :]])',\n", + " '- b = np.concatenate([B[:i], B[i + 1 :]])',\n", + " '- graph = csr_matrix(([True] * (M - 1), (a, b)), shape=(N, N))',\n", + " '- _, components = connected_components(graph, directed=False)',\n", + " '- return components.max() >= 1',\n", + " '-',\n", + " '-',\n", + " '-ans = 0',\n", + " '-for i in range(M):',\n", + " '- ans += is_bridge(i)',\n", + " '-print(ans)',\n", + " '+N, M = list(map(int, sys.stdin.buffer.readline().split()))',\n", + " '+AB = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]',\n", + " '+graph = [[] for _ in range(N + 1)]',\n", + " '+for a, b in AB:',\n", + " '+ graph[a].append(b)',\n", + " '+ graph[b].append(a)',\n", + " '+bridges = enumerate_bridges(graph)',\n", + " '+print((len(bridges)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0045171101,\n", + " 'measured_runtime_v1': 0.2124494145,\n", + " 'runtime_lift': 9.4352677545,\n", + " 'key': ['s425131512', 's549163277']},\n", + " {'user_id': 'u860002137',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's837932378',\n", + " 'submission_id_v1': 's385994697',\n", + " 'cpu_time_v0': 458,\n", + " 'cpu_time_v1': 162,\n", + " 'memory_v0': 30188,\n", + " 'memory_v1': 23528,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 64.63,\n", + " 'input': 'import numpy as np\\n\\n\\n\\ns = input()[::-1]\\n\\nlength = len(s)\\n\\na = np.zeros(length, dtype=int)\\n\\nd = np.zeros(length, dtype=int)\\n\\nans = np.zeros(2019, dtype=int)\\n\\nx = 10\\n\\n\\n\\na[0] = int(s[0])\\n\\nd[0] = a[0]\\n\\nans[d[0]] += 1\\n\\n\\n\\nfor i in range(1, length):\\n\\n a[i] = int(s[i]) * x % 2019\\n\\n d[i] = (d[i-1] + a[i]) % 2019\\n\\n ans[d[i]] += 1\\n\\n x = x * 10 % 2019\\n\\n\\n\\nans_c = ans[np.nonzero(ans)]\\n\\n\\n\\nprint((int(sum([ans_c[i] * (ans_c[i]-1) for i in range(ans_c.shape[0])]) / 2) + ans[0]))',\n", + " 'target': 's = input()[::-1]\\n\\nlength = len(s)\\n\\na = [0] * length\\n\\nd = [0] * length\\n\\nans = [0] * 2019\\n\\nx = 10\\n\\n\\n\\na[0] = int(s[0])\\n\\nd[0] = a[0]\\n\\nans[d[0]] += 1\\n\\n\\n\\nfor i in range(1, length):\\n\\n a[i] = int(s[i]) * x % 2019\\n\\n d[i] = (d[i-1] + a[i]) % 2019\\n\\n ans[d[i]] += 1\\n\\n x = x * 10 % 2019\\n\\n\\n\\nprint((int(sum([ans[i] * (ans[i]-1) for i in range(2019)]) / 2) + ans[0]))',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 475,\n", + " 'code_v1_num_chars': 362,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\ns = input()[::-1]\\nlength = len(s)\\na = np.zeros(length, dtype=int)\\nd = np.zeros(length, dtype=int)\\nans = np.zeros(2019, dtype=int)\\nx = 10\\na[0] = int(s[0])\\nd[0] = a[0]\\nans[d[0]] += 1\\nfor i in range(1, length):\\n a[i] = int(s[i]) * x % 2019\\n d[i] = (d[i - 1] + a[i]) % 2019\\n ans[d[i]] += 1\\n x = x * 10 % 2019\\nans_c = ans[np.nonzero(ans)]\\nprint(\\n (int(sum([ans_c[i] * (ans_c[i] - 1) for i in range(ans_c.shape[0])]) / 2) + ans[0])\\n)\\n',\n", + " 'code_v1_no_empty_lines': 's = input()[::-1]\\nlength = len(s)\\na = [0] * length\\nd = [0] * length\\nans = [0] * 2019\\nx = 10\\na[0] = int(s[0])\\nd[0] = a[0]\\nans[d[0]] += 1\\nfor i in range(1, length):\\n a[i] = int(s[i]) * x % 2019\\n d[i] = (d[i - 1] + a[i]) % 2019\\n ans[d[i]] += 1\\n x = x * 10 % 2019\\nprint((int(sum([ans[i] * (ans[i] - 1) for i in range(2019)]) / 2) + ans[0]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.1818181818,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-a = np.zeros(length, dtype=int)',\n", + " '-d = np.zeros(length, dtype=int)',\n", + " '-ans = np.zeros(2019, dtype=int)',\n", + " '+a = [0] * length',\n", + " '+d = [0] * length',\n", + " '+ans = [0] * 2019',\n", + " '-ans_c = ans[np.nonzero(ans)]',\n", + " '-print(',\n", + " '- (int(sum([ans_c[i] * (ans_c[i] - 1) for i in range(ans_c.shape[0])]) / 2) + ans[0])',\n", + " '-)',\n", + " '+print((int(sum([ans[i] * (ans[i] - 1) for i in range(2019)]) / 2) + ans[0]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3979822321,\n", + " 'measured_runtime_v1': 0.206037255,\n", + " 'runtime_lift': 6.785094432,\n", + " 'key': ['s837932378', 's385994697']},\n", + " {'user_id': 'u064505481',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's988049268',\n", + " 'submission_id_v1': 's031685542',\n", + " 'cpu_time_v0': 173,\n", + " 'cpu_time_v1': 74,\n", + " 'memory_v0': 76464,\n", + " 'memory_v1': 70408,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 57.23,\n", + " 'input': 'from sys import stdin, stdout, setrecursionlimit\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import lru_cache\\n\\nimport math\\n\\n\\n\\nsetrecursionlimit(10**6)\\n\\nrl = lambda: stdin.readline()\\n\\nrll = lambda: stdin.readline().split()\\n\\nrli = lambda: list(map(int, stdin.readline().split()))\\n\\nrlf = lambda: list(map(float, stdin.readline().split()))\\n\\n\\n\\nINF, NINF = float(\\'inf\\'), float(\\'-inf\\')\\n\\nMOD = 10**9 + 7\\n\\n\\n\\ndef main():\\n\\n\\ts = int(rl())\\n\\n\\n\\n\\t@lru_cache(None)\\n\\n\\tdef dp(currsum):\\n\\n\\t\\tif currsum == s: return 1\\n\\n\\t\\tcnt = 0\\n\\n\\t\\tfor d in range(3, 2001):\\n\\n\\t\\t\\tif currsum + d <= s:\\n\\n\\t\\t\\t\\tcnt += dp(currsum + d)\\n\\n\\t\\t\\t\\tcnt %= MOD \\n\\n\\t\\treturn cnt\\n\\n\\tprint((dp(0)))\\n\\n\\tstdout.close()\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n\\tmain()',\n", + " 'target': 'from sys import stdin, stdout, setrecursionlimit\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import lru_cache\\n\\nimport math\\n\\n\\n\\n#setrecursionlimit(10**6)\\n\\nrl = lambda: stdin.readline()\\n\\nrll = lambda: stdin.readline().split()\\n\\nrli = lambda: list(map(int, stdin.readline().split()))\\n\\nrlf = lambda: list(map(float, stdin.readline().split()))\\n\\n\\n\\nINF, NINF = float(\\'inf\\'), float(\\'-inf\\')\\n\\nMOD = 10**9 + 7\\n\\n\\n\\ndef main():\\n\\n\\ts = int(rl())\\n\\n\\n\\n\\tdef binom_tables(n, q):\\n\\n\\t\\tfact = [1 for _ in range(n + 1)]\\n\\n\\t\\tinv = [1 for _ in range(n + 1)]\\n\\n\\t\\tfor i in range(1, n+1):\\n\\n\\t\\t\\tfact[i] = (fact[i-1] * i) % q\\n\\n\\t\\t\\tinv[i] = pow(fact[i], q-2, q)\\n\\n\\t\\treturn fact, inv\\n\\n\\n\\n\\tF, I = binom_tables(s + 700, MOD)\\n\\n\\n\\n\\tdef binom(n, k, q):\\n\\n\\t\\treturn (F[n]*((I[k]*I[n-k])%q))%q\\n\\n\\n\\n\\tans = 0\\n\\n\\tfor r in range(1, 700):\\n\\n\\t\\tobjects = s - 3*r\\n\\n\\t\\tif objects + r - 1 < objects or objects < 0: \\n\\n\\t\\t\\tbreak\\n\\n\\t\\tx = binom(objects + r - 1, objects, MOD)\\n\\n\\t\\tans += x\\n\\n\\t\\tans %= MOD \\n\\n\\n\\n\\tprint(ans)\\n\\n\\tstdout.close()\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n\\tmain()',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 45,\n", + " 'code_v0_num_chars': 739,\n", + " 'code_v1_num_chars': 1050,\n", + " 'code_v0_no_empty_lines': 'from sys import stdin, stdout, setrecursionlimit\\nfrom collections import deque, defaultdict, Counter\\nfrom heapq import heappush, heappop\\nfrom functools import lru_cache\\nimport math\\n\\nsetrecursionlimit(10**6)\\nrl = lambda: stdin.readline()\\nrll = lambda: stdin.readline().split()\\nrli = lambda: list(map(int, stdin.readline().split()))\\nrlf = lambda: list(map(float, stdin.readline().split()))\\nINF, NINF = float(\"inf\"), float(\"-inf\")\\nMOD = 10**9 + 7\\n\\n\\ndef main():\\n s = int(rl())\\n\\n @lru_cache(None)\\n def dp(currsum):\\n if currsum == s:\\n return 1\\n cnt = 0\\n for d in range(3, 2001):\\n if currsum + d <= s:\\n cnt += dp(currsum + d)\\n cnt %= MOD\\n return cnt\\n\\n print((dp(0)))\\n stdout.close()\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from sys import stdin, stdout, setrecursionlimit\\nfrom collections import deque, defaultdict, Counter\\nfrom heapq import heappush, heappop\\nfrom functools import lru_cache\\nimport math\\n\\n# setrecursionlimit(10**6)\\nrl = lambda: stdin.readline()\\nrll = lambda: stdin.readline().split()\\nrli = lambda: list(map(int, stdin.readline().split()))\\nrlf = lambda: list(map(float, stdin.readline().split()))\\nINF, NINF = float(\"inf\"), float(\"-inf\")\\nMOD = 10**9 + 7\\n\\n\\ndef main():\\n s = int(rl())\\n\\n def binom_tables(n, q):\\n fact = [1 for _ in range(n + 1)]\\n inv = [1 for _ in range(n + 1)]\\n for i in range(1, n + 1):\\n fact[i] = (fact[i - 1] * i) % q\\n inv[i] = pow(fact[i], q - 2, q)\\n return fact, inv\\n\\n F, I = binom_tables(s + 700, MOD)\\n\\n def binom(n, k, q):\\n return (F[n] * ((I[k] * I[n - k]) % q)) % q\\n\\n ans = 0\\n for r in range(1, 700):\\n objects = s - 3 * r\\n if objects + r - 1 < objects or objects < 0:\\n break\\n x = binom(objects + r - 1, objects, MOD)\\n ans += x\\n ans %= MOD\\n print(ans)\\n stdout.close()\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 28.8888888889,\n", + " 'diff': ['-setrecursionlimit(10**6)',\n", + " '+# setrecursionlimit(10**6)',\n", + " '- @lru_cache(None)',\n", + " '- def dp(currsum):',\n", + " '- if currsum == s:',\n", + " '- return 1',\n", + " '- cnt = 0',\n", + " '- for d in range(3, 2001):',\n", + " '- if currsum + d <= s:',\n", + " '- cnt += dp(currsum + d)',\n", + " '- cnt %= MOD',\n", + " '- return cnt',\n", + " '+ def binom_tables(n, q):',\n", + " '+ fact = [1 for _ in range(n + 1)]',\n", + " '+ inv = [1 for _ in range(n + 1)]',\n", + " '+ for i in range(1, n + 1):',\n", + " '+ fact[i] = (fact[i - 1] * i) % q',\n", + " '+ inv[i] = pow(fact[i], q - 2, q)',\n", + " '+ return fact, inv',\n", + " '- print((dp(0)))',\n", + " '+ F, I = binom_tables(s + 700, MOD)',\n", + " '+',\n", + " '+ def binom(n, k, q):',\n", + " '+ return (F[n] * ((I[k] * I[n - k]) % q)) % q',\n", + " '+',\n", + " '+ ans = 0',\n", + " '+ for r in range(1, 700):',\n", + " '+ objects = s - 3 * r',\n", + " '+ if objects + r - 1 < objects or objects < 0:',\n", + " '+ break',\n", + " '+ x = binom(objects + r - 1, objects, MOD)',\n", + " '+ ans += x',\n", + " '+ ans %= MOD',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7214400458,\n", + " 'measured_runtime_v1': 0.2090635548,\n", + " 'runtime_lift': 3.4508168897,\n", + " 'key': ['s988049268', 's031685542']},\n", + " {'user_id': 'u359358631',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's916466489',\n", + " 'submission_id_v1': 's520315696',\n", + " 'cpu_time_v0': 158,\n", + " 'cpu_time_v1': 44,\n", + " 'memory_v0': 10172,\n", + " 'memory_v1': 8932,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 72.15,\n", + " 'input': 'import math\\n\\n\\n\\n\\n\\ndef main():\\n\\n N = int(eval(input()))\\n\\n power = math.factorial(N)\\n\\n print((power % (10 ** 9 + 7)))\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'def main():\\n\\n N = int(eval(input()))\\n\\n power = 1\\n\\n for i in range(1, N + 1):\\n\\n power *= i\\n\\n power %= 10 ** 9 + 7\\n\\n print(power)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 160,\n", + " 'code_v1_num_chars': 192,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\n\\ndef main():\\n N = int(eval(input()))\\n power = math.factorial(N)\\n print((power % (10**9 + 7)))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'def main():\\n N = int(eval(input()))\\n power = 1\\n for i in range(1, N + 1):\\n power *= i\\n power %= 10**9 + 7\\n print(power)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-',\n", + " '- power = math.factorial(N)',\n", + " '- print((power % (10**9 + 7)))',\n", + " '+ power = 1',\n", + " '+ for i in range(1, N + 1):',\n", + " '+ power *= i',\n", + " '+ power %= 10**9 + 7',\n", + " '+ print(power)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7842813587,\n", + " 'measured_runtime_v1': 0.3569579227,\n", + " 'runtime_lift': 2.1971255121,\n", + " 'key': ['s916466489', 's520315696']},\n", + " {'user_id': 'u298297089',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's092044899',\n", + " 'submission_id_v1': 's679810914',\n", + " 'cpu_time_v0': 352,\n", + " 'cpu_time_v1': 284,\n", + " 'memory_v0': 4760,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 19.32,\n", + " 'input': 'N, M =list(map(int, input().split()))\\n\\nL = [0 for i in range(N+1)]\\n\\nR = [0 for i in range(N+1)]\\n\\nfor i in range(M):\\n\\n l,r = list(map(int, input().split()))\\n\\n L[l] += 1\\n\\n R[r] += 1\\n\\ncnt = 0\\n\\ntmp = 0\\n\\nfor i in range(N+1):\\n\\n tmp += L[i]\\n\\n if tmp == M:\\n\\n cnt += 1\\n\\n tmp -= R[i]\\n\\nprint(cnt)\\n',\n", + " 'target': 'n,m = list(map(int, input().split()))\\n\\nll = 1\\n\\nrr = n\\n\\nfor i in range(m):\\n\\n l,r = list(map(int,input().split()))\\n\\n if l > ll:\\n\\n ll = l\\n\\n if r < rr:\\n\\n rr = r\\n\\nprint((max(rr - ll + 1, 0)))\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 10,\n", + " 'code_v0_num_chars': 299,\n", + " 'code_v1_num_chars': 196,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\nL = [0 for i in range(N + 1)]\\nR = [0 for i in range(N + 1)]\\nfor i in range(M):\\n l, r = list(map(int, input().split()))\\n L[l] += 1\\n R[r] += 1\\ncnt = 0\\ntmp = 0\\nfor i in range(N + 1):\\n tmp += L[i]\\n if tmp == M:\\n cnt += 1\\n tmp -= R[i]\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nll = 1\\nrr = n\\nfor i in range(m):\\n l, r = list(map(int, input().split()))\\n if l > ll:\\n ll = l\\n if r < rr:\\n rr = r\\nprint((max(rr - ll + 1, 0)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-N, M = list(map(int, input().split()))',\n", + " '-L = [0 for i in range(N + 1)]',\n", + " '-R = [0 for i in range(N + 1)]',\n", + " '-for i in range(M):',\n", + " '+n, m = list(map(int, input().split()))',\n", + " '+ll = 1',\n", + " '+rr = n',\n", + " '+for i in range(m):',\n", + " '- L[l] += 1',\n", + " '- R[r] += 1',\n", + " '-cnt = 0',\n", + " '-tmp = 0',\n", + " '-for i in range(N + 1):',\n", + " '- tmp += L[i]',\n", + " '- if tmp == M:',\n", + " '- cnt += 1',\n", + " '- tmp -= R[i]',\n", + " '-print(cnt)',\n", + " '+ if l > ll:',\n", + " '+ ll = l',\n", + " '+ if r < rr:',\n", + " '+ rr = r',\n", + " '+print((max(rr - ll + 1, 0)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2886495962,\n", + " 'measured_runtime_v1': 0.2151292083,\n", + " 'runtime_lift': 1.3417499114,\n", + " 'key': ['s092044899', 's679810914']},\n", + " {'user_id': 'u038408819',\n", + " 'problem_id': 'p03680',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's808331415',\n", + " 'submission_id_v1': 's267927939',\n", + " 'cpu_time_v0': 450,\n", + " 'cpu_time_v1': 202,\n", + " 'memory_v0': 7084,\n", + " 'memory_v1': 7084,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.11,\n", + " 'input': 'N = int(eval(input()))\\n\\na = [int(eval(input())) for _ in range(N)]\\n\\n\\n\\ncnt, i = 0, 0\\n\\nfor j in range(10 ** 6):\\n\\n cnt += 1\\n\\n if a[i] == 2:\\n\\n print(cnt)\\n\\n #break\\n\\n quit()\\n\\n else:\\n\\n i = a[i] - 1\\n\\nprint((-1))',\n", + " 'target': 'N = int(eval(input()))\\n\\na = [int(eval(input())) for _ in range(N)]\\n\\n\\n\\ncnt, i = 0, 0\\n\\nfor j in range(len(a)):\\n\\n cnt += 1\\n\\n if a[i] == 2:\\n\\n print(cnt)\\n\\n #break\\n\\n quit()\\n\\n else:\\n\\n i = a[i] - 1\\n\\nprint((-1))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 226,\n", + " 'code_v1_num_chars': 225,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\na = [int(eval(input())) for _ in range(N)]\\ncnt, i = 0, 0\\nfor j in range(10**6):\\n cnt += 1\\n if a[i] == 2:\\n print(cnt)\\n # break\\n quit()\\n else:\\n i = a[i] - 1\\nprint((-1))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\na = [int(eval(input())) for _ in range(N)]\\ncnt, i = 0, 0\\nfor j in range(len(a)):\\n cnt += 1\\n if a[i] == 2:\\n print(cnt)\\n # break\\n quit()\\n else:\\n i = a[i] - 1\\nprint((-1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-for j in range(10**6):', '+for j in range(len(a)):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6719723573,\n", + " 'measured_runtime_v1': 0.1459480231,\n", + " 'runtime_lift': 4.6041895124,\n", + " 'key': ['s808331415', 's267927939']},\n", + " {'user_id': 'u604774382',\n", + " 'problem_id': 'p02264',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's685908626',\n", + " 'submission_id_v1': 's418135932',\n", + " 'cpu_time_v0': 1410,\n", + " 'cpu_time_v1': 1260,\n", + " 'memory_v0': 17580,\n", + " 'memory_v1': 11516,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.64,\n", + " 'input': 'n, q = [ int( val ) for val in input( ).split( \" \" ) ]\\n\\nps = [0]*n\\n\\nt = [0]*n\\n\\nfor i in range( n ):\\n\\n\\tps[i], t[i] = input( ).split( \" \" )\\n\\n\\n\\n\\n\\noutput = []\\n\\nqsum = 0\\n\\nwhile t:\\n\\n\\tpsi = ps.pop( 0 )\\n\\n\\tti = int( t.pop( 0 ) )\\n\\n\\tif ti <= q:\\n\\n\\t\\tqsum += ti\\t\\n\\n\\t\\toutput.append( psi+\" \"+str( qsum ) )\\n\\n\\telse:\\n\\n\\t\\tt.append( ti - q )\\n\\n\\t\\tps.append( psi )\\n\\n\\t\\tqsum += q\\n\\n\\n\\nprint(( \"\\\\n\".join( output ) ))',\n", + " 'target': 'n, q = [ int( val ) for val in input( ).split( \" \" ) ]\\n\\nps = [0]*n\\n\\nt = [0]*n\\n\\nfor i in range( n ):\\n\\n ps[i], t[i] = input( ).split( \" \" )\\n\\n \\n\\n \\n\\noutput = []\\n\\nqsum = 0\\n\\nwhile t:\\n\\n psi = ps.pop( 0 )\\n\\n ti = int( t.pop( 0 ) )\\n\\n if ti <= q:\\n\\n qsum += ti\\n\\n output.append( \"\".join( ( psi, \" \", str( qsum ) ) ) )\\n\\n else:\\n\\n t.append( ti - q )\\n\\n ps.append( psi )\\n\\n qsum += q\\n\\n \\n\\nprint(( \"\\\\n\".join( output ) ))',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 383,\n", + " 'code_v1_num_chars': 455,\n", + " 'code_v0_no_empty_lines': 'n, q = [int(val) for val in input().split(\" \")]\\nps = [0] * n\\nt = [0] * n\\nfor i in range(n):\\n ps[i], t[i] = input().split(\" \")\\noutput = []\\nqsum = 0\\nwhile t:\\n psi = ps.pop(0)\\n ti = int(t.pop(0))\\n if ti <= q:\\n qsum += ti\\n output.append(psi + \" \" + str(qsum))\\n else:\\n t.append(ti - q)\\n ps.append(psi)\\n qsum += q\\nprint((\"\\\\n\".join(output)))\\n',\n", + " 'code_v1_no_empty_lines': 'n, q = [int(val) for val in input().split(\" \")]\\nps = [0] * n\\nt = [0] * n\\nfor i in range(n):\\n ps[i], t[i] = input().split(\" \")\\noutput = []\\nqsum = 0\\nwhile t:\\n psi = ps.pop(0)\\n ti = int(t.pop(0))\\n if ti <= q:\\n qsum += ti\\n output.append(\"\".join((psi, \" \", str(qsum))))\\n else:\\n t.append(ti - q)\\n ps.append(psi)\\n qsum += q\\nprint((\"\\\\n\".join(output)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- output.append(psi + \" \" + str(qsum))',\n", + " '+ output.append(\"\".join((psi, \" \", str(qsum))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2516228666,\n", + " 'measured_runtime_v1': 0.0710392208,\n", + " 'runtime_lift': 3.5420274002,\n", + " 'key': ['s685908626', 's418135932']},\n", + " {'user_id': 'u294385082',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's823919342',\n", + " 'submission_id_v1': 's499216276',\n", + " 'cpu_time_v0': 175,\n", + " 'cpu_time_v1': 125,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.57,\n", + " 'input': 'a,b = list(map(int,input().split()))\\n\\nc = 0\\n\\n\\n\\nfor i in range(a,b+1):\\n\\n new = list(reversed(list(str(i))))\\n\\n if new == list(str(i)):\\n\\n c += 1\\n\\n \\n\\n \\n\\nprint(c)',\n", + " 'target': 'a,b = list(map(int,input().split()))\\n\\nc = 0\\n\\n\\n\\nfor i in range(a,b+1):\\n\\n if list(str(i)) == list(str(i))[::-1]:\\n\\n c += 1\\n\\n \\n\\n \\n\\nprint(c)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 162,\n", + " 'code_v1_num_chars': 139,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().split()))\\nc = 0\\nfor i in range(a, b + 1):\\n new = list(reversed(list(str(i))))\\n if new == list(str(i)):\\n c += 1\\nprint(c)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = list(map(int, input().split()))\\nc = 0\\nfor i in range(a, b + 1):\\n if list(str(i)) == list(str(i))[::-1]:\\n c += 1\\nprint(c)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.0,\n", + " 'diff': ['- new = list(reversed(list(str(i))))',\n", + " '- if new == list(str(i)):',\n", + " '+ if list(str(i)) == list(str(i))[::-1]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.7237584333,\n", + " 'measured_runtime_v1': 0.3522657444,\n", + " 'runtime_lift': 2.0545807954,\n", + " 'key': ['s823919342', 's499216276']},\n", + " {'user_id': 'u583507988',\n", + " 'problem_id': 'p03835',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's254920914',\n", + " 'submission_id_v1': 's788748142',\n", + " 'cpu_time_v0': 1001,\n", + " 'cpu_time_v1': 785,\n", + " 'memory_v0': 9104,\n", + " 'memory_v1': 9072,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.58,\n", + " 'input': 'k, s = list(map(int, input().split()))\\n\\n\\n\\nans = 0\\n\\nfor x in range(k+1):\\n\\n for y in range(k+1):\\n\\n if 0<=s-x-y<=k:\\n\\n ans += 1\\n\\n \\n\\nprint(ans)',\n", + " 'target': 'k,s=list(map(int,input().split()))\\n\\nans=0\\n\\nfor i in range(k+1):\\n\\n num=s-i\\n\\n for j in range(min(num+1,k+1)):\\n\\n if 0<=num-j<=k:\\n\\n ans+=1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 146,\n", + " 'code_v1_num_chars': 150,\n", + " 'code_v0_no_empty_lines': 'k, s = list(map(int, input().split()))\\nans = 0\\nfor x in range(k + 1):\\n for y in range(k + 1):\\n if 0 <= s - x - y <= k:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'k, s = list(map(int, input().split()))\\nans = 0\\nfor i in range(k + 1):\\n num = s - i\\n for j in range(min(num + 1, k + 1)):\\n if 0 <= num - j <= k:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-for x in range(k + 1):',\n", + " '- for y in range(k + 1):',\n", + " '- if 0 <= s - x - y <= k:',\n", + " '+for i in range(k + 1):',\n", + " '+ num = s - i',\n", + " '+ for j in range(min(num + 1, k + 1)):',\n", + " '+ if 0 <= num - j <= k:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2276177601,\n", + " 'measured_runtime_v1': 0.0063076721,\n", + " 'runtime_lift': 36.0858579862,\n", + " 'key': ['s254920914', 's788748142']},\n", + " {'user_id': 'u638282348',\n", + " 'problem_id': 'p03720',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's487647415',\n", + " 'submission_id_v1': 's133103425',\n", + " 'cpu_time_v0': 149,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12500,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.92,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nncity, nlines = list(map(int, input().rstrip(\"\\\\n\").split()))\\n\\nmatrix = np.zeros((ncity, ncity), dtype=int)\\n\\nfor _ in range(nlines):\\n\\n l, c = [int(x) - 1 for x in input().rstrip(\"\\\\n\").split()]\\n\\n matrix[l][c] += 1\\n\\n matrix[c][l] += 1\\n\\n\\n\\nfor list_ in matrix:\\n\\n print((sum(list_)))',\n", + " 'target': 'n, m = map(int, input().split())\\n\\nroads = [0] * n\\n\\n[exec(\"roads[%d] += 1; roads[%d] += 1\" % tuple(map(lambda c: int(c) - 1, input().split()))) for _ in range(m)]\\n\\nprint(*roads, sep=\"\\\\n\", end=\"\")\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 308,\n", + " 'code_v1_num_chars': 195,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nncity, nlines = list(map(int, input().rstrip(\"\\\\n\").split()))\\nmatrix = np.zeros((ncity, ncity), dtype=int)\\nfor _ in range(nlines):\\n l, c = [int(x) - 1 for x in input().rstrip(\"\\\\n\").split()]\\n matrix[l][c] += 1\\n matrix[c][l] += 1\\nfor list_ in matrix:\\n print((sum(list_)))\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = map(int, input().split())\\nroads = [0] * n\\n[\\n exec(\\n \"roads[%d] += 1; roads[%d] += 1\"\\n % tuple(map(lambda c: int(c) - 1, input().split()))\\n )\\n for _ in range(m)\\n]\\nprint(*roads, sep=\"\\\\n\", end=\"\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 63.6363636364,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-ncity, nlines = list(map(int, input().rstrip(\"\\\\n\").split()))',\n", + " '-matrix = np.zeros((ncity, ncity), dtype=int)',\n", + " '-for _ in range(nlines):',\n", + " '- l, c = [int(x) - 1 for x in input().rstrip(\"\\\\n\").split()]',\n", + " '- matrix[l][c] += 1',\n", + " '- matrix[c][l] += 1',\n", + " '-for list_ in matrix:',\n", + " '- print((sum(list_)))',\n", + " '+n, m = map(int, input().split())',\n", + " '+roads = [0] * n',\n", + " '+[',\n", + " '+ exec(',\n", + " '+ \"roads[%d] += 1; roads[%d] += 1\"',\n", + " '+ % tuple(map(lambda c: int(c) - 1, input().split()))',\n", + " '+ )',\n", + " '+ for _ in range(m)',\n", + " '+]',\n", + " '+print(*roads, sep=\"\\\\n\", end=\"\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.5392445521,\n", + " 'measured_runtime_v1': 0.2919934719,\n", + " 'runtime_lift': 5.2715033054,\n", + " 'key': ['s487647415', 's133103425']},\n", + " {'user_id': 'u977389981',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's559298633',\n", + " 'submission_id_v1': 's569125766',\n", + " 'cpu_time_v0': 231,\n", + " 'cpu_time_v1': 41,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 82.25,\n", + " 'input': 'import math\\n\\nmod = 10 ** 9 + 7\\n\\nn = int(eval(input()))\\n\\nprint((math.factorial(n) % mod))',\n", + " 'target': 'mod = 10 ** 9 + 7\\n\\nn = int(eval(input()))\\n\\nans = 1\\n\\nfor i in range(1, n + 1):\\n\\n ans *= i\\n\\n ans %= mod\\n\\nprint(ans)',\n", + " 'code_v0_loc': 4,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 80,\n", + " 'code_v1_num_chars': 113,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nmod = 10**9 + 7\\nn = int(eval(input()))\\nprint((math.factorial(n) % mod))\\n',\n", + " 'code_v1_no_empty_lines': 'mod = 10**9 + 7\\nn = int(eval(input()))\\nans = 1\\nfor i in range(1, n + 1):\\n ans *= i\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.8571428571,\n", + " 'diff': ['-import math',\n", + " '-',\n", + " '-print((math.factorial(n) % mod))',\n", + " '+ans = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ ans *= i',\n", + " '+ ans %= mod',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5416102607,\n", + " 'measured_runtime_v1': 0.2347814059,\n", + " 'runtime_lift': 2.3068703357,\n", + " 'key': ['s559298633', 's569125766']},\n", + " {'user_id': 'u391731808',\n", + " 'problem_id': 'p03634',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's145761901',\n", + " 'submission_id_v1': 's949294302',\n", + " 'cpu_time_v0': 1740,\n", + " 'cpu_time_v1': 1056,\n", + " 'memory_v0': 98856,\n", + " 'memory_v1': 98636,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.31,\n", + " 'input': 'import heapq\\n\\n\\n\\nN = int(eval(input()))\\n\\nabc = [list(map(int,input().split())) for _ in range(N-1)]\\n\\nQ,K = list(map(int,input().split()))\\n\\nxy = [list(map(int,input().split())) for _ in range(Q)]\\n\\n\\n\\nconnect = [[] for _ in range(N)]\\n\\nINFTY = 10**15\\n\\nfor a,b,c in abc:\\n\\n connect[a-1].append([b-1,c])\\n\\n connect[b-1].append([a-1,c])\\n\\n\\n\\ncost = [[INFTY,False] for _ in range(N)]\\n\\ncost[K-1][0] = 0\\n\\nq = [(0,K-1)]\\n\\nwhile q:\\n\\n _,i = heapq.heappop(q)\\n\\n if cost[i][1]:\\n\\n continue\\n\\n cost[i][1] = True\\n\\n ci0 = cost[i][0]\\n\\n for j,c in connect[i]:\\n\\n if cost[j][1]:\\n\\n continue\\n\\n tmp_cost = ci0+c\\n\\n if tmp_cost < cost[j][0]:\\n\\n cost[j][0] = tmp_cost\\n\\n heapq.heappush(q,(tmp_cost,j))\\n\\n\\n\\nfor x,y in xy:\\n\\n print((cost[x-1][0] + cost[y-1][0]))',\n", + " 'target': 'N = int(eval(input()))\\n\\nABC = [list(map(int,input().split())) for _ in [0]*(N-1)]\\n\\nQ,K = list(map(int,input().split()))\\n\\nXY = [list(map(int,input().split())) for _ in [0]*Q]\\n\\n\\n\\nE = [{} for _ in [0]*N]\\n\\nfor a,b,c in ABC:\\n\\n E[a-1][b-1] = c\\n\\n E[b-1][a-1] = c\\n\\n\\n\\ndef dist_dfs_tree(N,E,start):\\n\\n d = [-1]*N\\n\\n d[start] = 0\\n\\n q = [start]\\n\\n while q:\\n\\n i = q.pop()\\n\\n ci = d[i]\\n\\n for j,cj in list(E[i].items()):\\n\\n if d[j] !=-1:continue\\n\\n d[j] = ci+cj\\n\\n q.append(j)\\n\\n return d\\n\\n\\n\\nd = dist_dfs_tree(N,E,K-1)\\n\\nfor x,y in XY:\\n\\n print((d[x-1]+d[y-1]))',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 797,\n", + " 'code_v1_num_chars': 594,\n", + " 'code_v0_no_empty_lines': 'import heapq\\n\\nN = int(eval(input()))\\nabc = [list(map(int, input().split())) for _ in range(N - 1)]\\nQ, K = list(map(int, input().split()))\\nxy = [list(map(int, input().split())) for _ in range(Q)]\\nconnect = [[] for _ in range(N)]\\nINFTY = 10**15\\nfor a, b, c in abc:\\n connect[a - 1].append([b - 1, c])\\n connect[b - 1].append([a - 1, c])\\ncost = [[INFTY, False] for _ in range(N)]\\ncost[K - 1][0] = 0\\nq = [(0, K - 1)]\\nwhile q:\\n _, i = heapq.heappop(q)\\n if cost[i][1]:\\n continue\\n cost[i][1] = True\\n ci0 = cost[i][0]\\n for j, c in connect[i]:\\n if cost[j][1]:\\n continue\\n tmp_cost = ci0 + c\\n if tmp_cost < cost[j][0]:\\n cost[j][0] = tmp_cost\\n heapq.heappush(q, (tmp_cost, j))\\nfor x, y in xy:\\n print((cost[x - 1][0] + cost[y - 1][0]))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nABC = [list(map(int, input().split())) for _ in [0] * (N - 1)]\\nQ, K = list(map(int, input().split()))\\nXY = [list(map(int, input().split())) for _ in [0] * Q]\\nE = [{} for _ in [0] * N]\\nfor a, b, c in ABC:\\n E[a - 1][b - 1] = c\\n E[b - 1][a - 1] = c\\n\\n\\ndef dist_dfs_tree(N, E, start):\\n d = [-1] * N\\n d[start] = 0\\n q = [start]\\n while q:\\n i = q.pop()\\n ci = d[i]\\n for j, cj in list(E[i].items()):\\n if d[j] != -1:\\n continue\\n d[j] = ci + cj\\n q.append(j)\\n return d\\n\\n\\nd = dist_dfs_tree(N, E, K - 1)\\nfor x, y in XY:\\n print((d[x - 1] + d[y - 1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.75,\n", + " 'diff': ['-import heapq',\n", + " '+N = int(eval(input()))',\n", + " '+ABC = [list(map(int, input().split())) for _ in [0] * (N - 1)]',\n", + " '+Q, K = list(map(int, input().split()))',\n", + " '+XY = [list(map(int, input().split())) for _ in [0] * Q]',\n", + " '+E = [{} for _ in [0] * N]',\n", + " '+for a, b, c in ABC:',\n", + " '+ E[a - 1][b - 1] = c',\n", + " '+ E[b - 1][a - 1] = c',\n", + " '-N = int(eval(input()))',\n", + " '-abc = [list(map(int, input().split())) for _ in range(N - 1)]',\n", + " '-Q, K = list(map(int, input().split()))',\n", + " '-xy = [list(map(int, input().split())) for _ in range(Q)]',\n", + " '-connect = [[] for _ in range(N)]',\n", + " '-INFTY = 10**15',\n", + " '-for a, b, c in abc:',\n", + " '- connect[a - 1].append([b - 1, c])',\n", + " '- connect[b - 1].append([a - 1, c])',\n", + " '-cost = [[INFTY, False] for _ in range(N)]',\n", + " '-cost[K - 1][0] = 0',\n", + " '-q = [(0, K - 1)]',\n", + " '-while q:',\n", + " '- _, i = heapq.heappop(q)',\n", + " '- if cost[i][1]:',\n", + " '- continue',\n", + " '- cost[i][1] = True',\n", + " '- ci0 = cost[i][0]',\n", + " '- for j, c in connect[i]:',\n", + " '- if cost[j][1]:',\n", + " '- continue',\n", + " '- tmp_cost = ci0 + c',\n", + " '- if tmp_cost < cost[j][0]:',\n", + " '- cost[j][0] = tmp_cost',\n", + " '- heapq.heappush(q, (tmp_cost, j))',\n", + " '-for x, y in xy:',\n", + " '- print((cost[x - 1][0] + cost[y - 1][0]))',\n", + " '+',\n", + " '+def dist_dfs_tree(N, E, start):',\n", + " '+ d = [-1] * N',\n", + " '+ d[start] = 0',\n", + " '+ q = [start]',\n", + " '+ while q:',\n", + " '+ i = q.pop()',\n", + " '+ ci = d[i]',\n", + " '+ for j, cj in list(E[i].items()):',\n", + " '+ if d[j] != -1:',\n", + " '+ continue',\n", + " '+ d[j] = ci + cj',\n", + " '+ q.append(j)',\n", + " '+ return d',\n", + " '+',\n", + " '+',\n", + " '+d = dist_dfs_tree(N, E, K - 1)',\n", + " '+for x, y in XY:',\n", + " '+ print((d[x - 1] + d[y - 1]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2932223577,\n", + " 'measured_runtime_v1': 0.2194568303,\n", + " 'runtime_lift': 1.3361277359,\n", + " 'key': ['s145761901', 's949294302']},\n", + " {'user_id': 'u820560680',\n", + " 'problem_id': 'p03457',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's760019873',\n", + " 'submission_id_v1': 's278197966',\n", + " 'cpu_time_v0': 899,\n", + " 'cpu_time_v1': 539,\n", + " 'memory_v0': 38664,\n", + " 'memory_v1': 36444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 40.04,\n", + " 'input': \"import numpy as np\\n\\nN = int(eval(input()))\\n\\nplan = np.array([[0, 0, 0]] + [list(map(int, input().split())) for i in range(N)])\\n\\n\\n\\ndiff = np.diff(plan, axis = 0)\\n\\n\\n\\ndef is_possible(t, x, y):\\n\\n if (t + x + y) % 2 == 0 and abs(x) + abs(y) <= t:\\n\\n return True\\n\\n else:\\n\\n return False\\n\\n\\n\\nfor i in range(N):\\n\\n ti, xi, yi = diff[i]\\n\\n if not is_possible(ti, xi, yi):\\n\\n print('No')\\n\\n exit()\\n\\nprint('Yes')\",\n", + " 'target': \"N = int(eval(input()))\\n\\nplan = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(N)]\\n\\ndiff = [[plan[i + 1][j] - plan[i][j] for j in range(3)] for i in range(N)]\\n\\n\\n\\ndef is_possible(t, x, y):\\n\\n if (t + x + y) % 2 == 0 and abs(x) + abs(y) <= t:\\n\\n return True\\n\\n else:\\n\\n return False\\n\\n\\n\\nfor i in range(N):\\n\\n ti, xi, yi = diff[i]\\n\\n if not is_possible(ti, xi, yi):\\n\\n print('No')\\n\\n exit()\\n\\nprint('Yes')\",\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 428,\n", + " 'code_v1_num_chars': 440,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN = int(eval(input()))\\nplan = np.array([[0, 0, 0]] + [list(map(int, input().split())) for i in range(N)])\\ndiff = np.diff(plan, axis=0)\\n\\n\\ndef is_possible(t, x, y):\\n if (t + x + y) % 2 == 0 and abs(x) + abs(y) <= t:\\n return True\\n else:\\n return False\\n\\n\\nfor i in range(N):\\n ti, xi, yi = diff[i]\\n if not is_possible(ti, xi, yi):\\n print(\"No\")\\n exit()\\nprint(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nplan = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(N)]\\ndiff = [[plan[i + 1][j] - plan[i][j] for j in range(3)] for i in range(N)]\\n\\n\\ndef is_possible(t, x, y):\\n if (t + x + y) % 2 == 0 and abs(x) + abs(y) <= t:\\n return True\\n else:\\n return False\\n\\n\\nfor i in range(N):\\n ti, xi, yi = diff[i]\\n if not is_possible(ti, xi, yi):\\n print(\"No\")\\n exit()\\nprint(\"Yes\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-plan = np.array([[0, 0, 0]] + [list(map(int, input().split())) for i in range(N)])',\n", + " '-diff = np.diff(plan, axis=0)',\n", + " '+plan = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(N)]',\n", + " '+diff = [[plan[i + 1][j] - plan[i][j] for j in range(3)] for i in range(N)]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4244329751,\n", + " 'measured_runtime_v1': 0.2356190042,\n", + " 'runtime_lift': 6.0454927205,\n", + " 'key': ['s760019873', 's278197966']},\n", + " {'user_id': 'u325282913',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's614340278',\n", + " 'submission_id_v1': 's677161923',\n", + " 'cpu_time_v0': 117,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.62,\n", + " 'input': \"A, B, C, X, Y = list(map(int, input().split()))\\n\\nans = float('inf')\\n\\nfor i in range(max(X,Y)+1):\\n\\n cost = 2 * C * i + max(0,X-i)*A +max(0,Y-i)*B\\n\\n ans = min(ans,cost)\\n\\nprint(ans)\",\n", + " 'target': 'A, B, C, X, Y = list(map(int, input().split()))\\n\\ntmp = A*X + B*Y\\n\\nif X >= Y:\\n\\n tmp = min(tmp,2*Y*C+(X-Y)*A)\\n\\nelse:\\n\\n tmp = min(tmp,2*X*C+(Y-X)*B)\\n\\ntmp = min(tmp,max(X,Y)*2*C)\\n\\nprint(tmp)',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 178,\n", + " 'code_v1_num_chars': 186,\n", + " 'code_v0_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in range(max(X, Y) + 1):\\n cost = 2 * C * i + max(0, X - i) * A + max(0, Y - i) * B\\n ans = min(ans, cost)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\ntmp = A * X + B * Y\\nif X >= Y:\\n tmp = min(tmp, 2 * Y * C + (X - Y) * A)\\nelse:\\n tmp = min(tmp, 2 * X * C + (Y - X) * B)\\ntmp = min(tmp, max(X, Y) * 2 * C)\\nprint(tmp)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-ans = float(\"inf\")',\n", + " '-for i in range(max(X, Y) + 1):',\n", + " '- cost = 2 * C * i + max(0, X - i) * A + max(0, Y - i) * B',\n", + " '- ans = min(ans, cost)',\n", + " '-print(ans)',\n", + " '+tmp = A * X + B * Y',\n", + " '+if X >= Y:',\n", + " '+ tmp = min(tmp, 2 * Y * C + (X - Y) * A)',\n", + " '+else:',\n", + " '+ tmp = min(tmp, 2 * X * C + (Y - X) * B)',\n", + " '+tmp = min(tmp, max(X, Y) * 2 * C)',\n", + " '+print(tmp)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.571060118,\n", + " 'measured_runtime_v1': 0.3373241339,\n", + " 'runtime_lift': 1.6929121299,\n", + " 'key': ['s614340278', 's677161923']},\n", + " {'user_id': 'u077291787',\n", + " 'problem_id': 'p03164',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's644346369',\n", + " 'submission_id_v1': 's649660252',\n", + " 'cpu_time_v0': 472,\n", + " 'cpu_time_v1': 351,\n", + " 'memory_v0': 93244,\n", + " 'memory_v1': 70732,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 25.64,\n", + " 'input': '# temp\\n\\nn,w = list(map(int,input().split()))\\n\\nwv = [tuple(map(int,input().split())) for i in range(n)]\\n\\n\\n\\ndp = [0] + [float(\"inf\")]*(10**5)\\n\\nfor i in range(n):\\n\\n for j in range(10**5,wv[i][1]-1,-1):\\n\\n dp[j] = min(dp[j],dp[j-wv[i][1]]+wv[i][0])\\n\\n\\n\\nres = 0\\n\\nfor v,e in enumerate(dp):\\n\\n if e <= w:\\n\\n res = v\\n\\nprint(res)',\n", + " 'target': '# dpE - Knapsack 2\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef main():\\n\\n n, W = tuple(map(int, input().rstrip().split()))\\n\\n A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(n))\\n\\n _, v = list(zip(*A))\\n\\n lim = sum(v)\\n\\n dp = [0] + [float(\"inf\")] * lim\\n\\n for i in range(n):\\n\\n for j in range(lim, A[i][1] - 1, -1):\\n\\n dp[j] = min(dp[j], dp[j - A[i][1]] + A[i][0])\\n\\n ans = max(v for v, w in enumerate(dp) if w <= W)\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 330,\n", + " 'code_v1_num_chars': 522,\n", + " 'code_v0_no_empty_lines': '# temp\\nn, w = list(map(int, input().split()))\\nwv = [tuple(map(int, input().split())) for i in range(n)]\\ndp = [0] + [float(\"inf\")] * (10**5)\\nfor i in range(n):\\n for j in range(10**5, wv[i][1] - 1, -1):\\n dp[j] = min(dp[j], dp[j - wv[i][1]] + wv[i][0])\\nres = 0\\nfor v, e in enumerate(dp):\\n if e <= w:\\n res = v\\nprint(res)\\n',\n", + " 'code_v1_no_empty_lines': '# dpE - Knapsack 2\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n n, W = tuple(map(int, input().rstrip().split()))\\n A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(n))\\n _, v = list(zip(*A))\\n lim = sum(v)\\n dp = [0] + [float(\"inf\")] * lim\\n for i in range(n):\\n for j in range(lim, A[i][1] - 1, -1):\\n dp[j] = min(dp[j], dp[j - A[i][1]] + A[i][0])\\n ans = max(v for v, w in enumerate(dp) if w <= W)\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 26.3157894737,\n", + " 'diff': ['-# temp',\n", + " '-n, w = list(map(int, input().split()))',\n", + " '-wv = [tuple(map(int, input().split())) for i in range(n)]',\n", + " '-dp = [0] + [float(\"inf\")] * (10**5)',\n", + " '-for i in range(n):',\n", + " '- for j in range(10**5, wv[i][1] - 1, -1):',\n", + " '- dp[j] = min(dp[j], dp[j - wv[i][1]] + wv[i][0])',\n", + " '-res = 0',\n", + " '-for v, e in enumerate(dp):',\n", + " '- if e <= w:',\n", + " '- res = v',\n", + " '-print(res)',\n", + " '+# dpE - Knapsack 2',\n", + " '+import sys',\n", + " '+',\n", + " '+input = sys.stdin.readline',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ n, W = tuple(map(int, input().rstrip().split()))',\n", + " '+ A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(n))',\n", + " '+ _, v = list(zip(*A))',\n", + " '+ lim = sum(v)',\n", + " '+ dp = [0] + [float(\"inf\")] * lim',\n", + " '+ for i in range(n):',\n", + " '+ for j in range(lim, A[i][1] - 1, -1):',\n", + " '+ dp[j] = min(dp[j], dp[j - A[i][1]] + A[i][0])',\n", + " '+ ans = max(v for v, w in enumerate(dp) if w <= W)',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6859776349,\n", + " 'measured_runtime_v1': 0.2345220137,\n", + " 'runtime_lift': 7.1889952184,\n", + " 'key': ['s644346369', 's649660252']},\n", + " {'user_id': 'u754022296',\n", + " 'problem_id': 'p04017',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's083196734',\n", + " 'submission_id_v1': 's862767700',\n", + " 'cpu_time_v0': 1272,\n", + " 'cpu_time_v1': 635,\n", + " 'memory_v0': 90144,\n", + " 'memory_v1': 80288,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.08,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nimport bisect\\n\\n\\n\\nn = int(eval(input()))\\n\\nX = list(map(int, input().split()))\\n\\nl = int(eval(input()))\\n\\nU = 17\\n\\ndp = [[0]*n for _ in range(U+1)]\\n\\nfor i, x in enumerate(X):\\n\\n t = bisect.bisect_left(X, x+l)\\n\\n dp[0][i] = bisect.bisect_right(X, x+l) - 1\\n\\nfor k in range(U):\\n\\n for i in range(n):\\n\\n dp[k+1][i] = dp[k][dp[k][i]]\\n\\ndef test(x, a, b):\\n\\n for i in range(U, -1, -1):\\n\\n if x >> i & 1:\\n\\n a = dp[i][a]\\n\\n return a >= b\\n\\ndef solve(a, b):\\n\\n if a > b:\\n\\n a, b = b, a\\n\\n ng = 0\\n\\n ok = n-1\\n\\n while ok - ng > 1:\\n\\n mid = (ng + ok) // 2\\n\\n if test(mid, a, b):\\n\\n ok = mid\\n\\n else:\\n\\n ng = mid\\n\\n print(ok)\\n\\nq = int(eval(input()))\\n\\nfor _ in range(q):\\n\\n a, b = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n solve(a, b)',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\nimport bisect\\n\\n\\n\\nn = int(eval(input()))\\n\\nX = list(map(int, input().split()))\\n\\nl = int(eval(input()))\\n\\nU = 17\\n\\ndp = [[0]*n for _ in range(U+1)]\\n\\nfor i, x in enumerate(X):\\n\\n t = bisect.bisect_left(X, x+l)\\n\\n dp[0][i] = bisect.bisect_right(X, x+l) - 1\\n\\nfor k in range(U):\\n\\n for i in range(n):\\n\\n dp[k+1][i] = dp[k][dp[k][i]]\\n\\nq = int(eval(input()))\\n\\nfor _ in range(q):\\n\\n a, b = list(map(int, input().split()))\\n\\n a -= 1\\n\\n b -= 1\\n\\n if a > b:\\n\\n a, b = b, a\\n\\n res = 1\\n\\n for k in range(U, -1, -1):\\n\\n if dp[k][a] < b:\\n\\n a = dp[k][a]\\n\\n res += (1<> i & 1:\\n a = dp[i][a]\\n return a >= b\\n\\n\\ndef solve(a, b):\\n if a > b:\\n a, b = b, a\\n ng = 0\\n ok = n - 1\\n while ok - ng > 1:\\n mid = (ng + ok) // 2\\n if test(mid, a, b):\\n ok = mid\\n else:\\n ng = mid\\n print(ok)\\n\\n\\nq = int(eval(input()))\\nfor _ in range(q):\\n a, b = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n solve(a, b)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nimport bisect\\n\\nn = int(eval(input()))\\nX = list(map(int, input().split()))\\nl = int(eval(input()))\\nU = 17\\ndp = [[0] * n for _ in range(U + 1)]\\nfor i, x in enumerate(X):\\n t = bisect.bisect_left(X, x + l)\\n dp[0][i] = bisect.bisect_right(X, x + l) - 1\\nfor k in range(U):\\n for i in range(n):\\n dp[k + 1][i] = dp[k][dp[k][i]]\\nq = int(eval(input()))\\nfor _ in range(q):\\n a, b = list(map(int, input().split()))\\n a -= 1\\n b -= 1\\n if a > b:\\n a, b = b, a\\n res = 1\\n for k in range(U, -1, -1):\\n if dp[k][a] < b:\\n a = dp[k][a]\\n res += 1 << k\\n if a == b:\\n break\\n print(res)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 21.0526315789,\n", + " 'diff': ['-',\n", + " '-',\n", + " '-def test(x, a, b):',\n", + " '- for i in range(U, -1, -1):',\n", + " '- if x >> i & 1:',\n", + " '- a = dp[i][a]',\n", + " '- return a >= b',\n", + " '-',\n", + " '-',\n", + " '-def solve(a, b):',\n", + " '- if a > b:',\n", + " '- a, b = b, a',\n", + " '- ng = 0',\n", + " '- ok = n - 1',\n", + " '- while ok - ng > 1:',\n", + " '- mid = (ng + ok) // 2',\n", + " '- if test(mid, a, b):',\n", + " '- ok = mid',\n", + " '- else:',\n", + " '- ng = mid',\n", + " '- print(ok)',\n", + " '-',\n", + " '-',\n", + " '- solve(a, b)',\n", + " '+ if a > b:',\n", + " '+ a, b = b, a',\n", + " '+ res = 1',\n", + " '+ for k in range(U, -1, -1):',\n", + " '+ if dp[k][a] < b:',\n", + " '+ a = dp[k][a]',\n", + " '+ res += 1 << k',\n", + " '+ if a == b:',\n", + " '+ break',\n", + " '+ print(res)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.33038889,\n", + " 'measured_runtime_v1': 0.2620919657,\n", + " 'runtime_lift': 1.2605838152,\n", + " 'key': ['s083196734', 's862767700']},\n", + " {'user_id': 'u579833671',\n", + " 'problem_id': 'p02419',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's913061371',\n", + " 'submission_id_v1': 's394956399',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 4220,\n", + " 'memory_v1': 4212,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': 'W = input().lower()\\n\\ns = []\\n\\nwhile True:\\n\\n T = list(map(str, input().split()))\\n\\n if(T[0] == \"END_OF_TEXT\"):\\n\\n break\\n\\n else:\\n\\n for i in range(len(T)):\\n\\n s.append(T[i].lower())\\n\\nans = 0\\n\\nfor i in range(len(s)):\\n\\n if(s[i] == W):\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'target': 'W = input().lower()\\n\\ns = []\\n\\nans = 0\\n\\nwhile True:\\n\\n T = list(map(str, input().split()))\\n\\n if(T[0] == \"END_OF_TEXT\"):\\n\\n break\\n\\n else:\\n\\n for i in range(len(T)):\\n\\n if(W == T[i].lower()):\\n\\n ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 294,\n", + " 'code_v1_num_chars': 257,\n", + " 'code_v0_no_empty_lines': 'W = input().lower()\\ns = []\\nwhile True:\\n T = list(map(str, input().split()))\\n if T[0] == \"END_OF_TEXT\":\\n break\\n else:\\n for i in range(len(T)):\\n s.append(T[i].lower())\\nans = 0\\nfor i in range(len(s)):\\n if s[i] == W:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'W = input().lower()\\ns = []\\nans = 0\\nwhile True:\\n T = list(map(str, input().split()))\\n if T[0] == \"END_OF_TEXT\":\\n break\\n else:\\n for i in range(len(T)):\\n if W == T[i].lower():\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['+ans = 0',\n", + " '- s.append(T[i].lower())',\n", + " '-ans = 0',\n", + " '-for i in range(len(s)):',\n", + " '- if s[i] == W:',\n", + " '- ans += 1',\n", + " '+ if W == T[i].lower():',\n", + " '+ ans += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1894613738,\n", + " 'measured_runtime_v1': 0.0060594826,\n", + " 'runtime_lift': 31.2669227389,\n", + " 'key': ['s913061371', 's394956399']},\n", + " {'user_id': 'u531220228',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's512634929',\n", + " 'submission_id_v1': 's713379557',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'N,L = list(map(int, input().split()))\\n\\ntaste = [L+i-1 for i in range(1,N+1)]\\n\\nif taste[-1] < 0:\\n\\n print((sum(taste) + min([abs(x) for x in taste])))\\n\\nelse:\\n\\n print((sum(taste) - min([abs(x) for x in taste])))',\n", + " 'target': 'N, L = list(map(int, input().split()))\\n\\n\\n\\ntaste = [L+i-1 for i in range(1, N+1)]\\n\\n\\n\\nif 0 in taste:\\n\\n select = 0\\n\\nelse:\\n\\n select_with_ind = min(enumerate(taste), key = lambda x: abs(x[1]))\\n\\n select = select_with_ind[1]\\n\\n \\n\\nprint((sum(taste) - select))',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 200,\n", + " 'code_v1_num_chars': 254,\n", + " 'code_v0_no_empty_lines': 'N, L = list(map(int, input().split()))\\ntaste = [L + i - 1 for i in range(1, N + 1)]\\nif taste[-1] < 0:\\n print((sum(taste) + min([abs(x) for x in taste])))\\nelse:\\n print((sum(taste) - min([abs(x) for x in taste])))\\n',\n", + " 'code_v1_no_empty_lines': 'N, L = list(map(int, input().split()))\\ntaste = [L + i - 1 for i in range(1, N + 1)]\\nif 0 in taste:\\n select = 0\\nelse:\\n select_with_ind = min(enumerate(taste), key=lambda x: abs(x[1]))\\n select = select_with_ind[1]\\nprint((sum(taste) - select))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 45.4545454545,\n", + " 'diff': ['-if taste[-1] < 0:',\n", + " '- print((sum(taste) + min([abs(x) for x in taste])))',\n", + " '+if 0 in taste:',\n", + " '+ select = 0',\n", + " '- print((sum(taste) - min([abs(x) for x in taste])))',\n", + " '+ select_with_ind = min(enumerate(taste), key=lambda x: abs(x[1]))',\n", + " '+ select = select_with_ind[1]',\n", + " '+print((sum(taste) - select))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3334629779,\n", + " 'measured_runtime_v1': 0.1486533701,\n", + " 'runtime_lift': 2.2432251455,\n", + " 'key': ['s512634929', 's713379557']},\n", + " {'user_id': 'u628335443',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's320196234',\n", + " 'submission_id_v1': 's733866625',\n", + " 'cpu_time_v0': 189,\n", + " 'cpu_time_v1': 163,\n", + " 'memory_v0': 26444,\n", + " 'memory_v1': 26444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.76,\n", + " 'input': 'k, n = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nd = [0] * n\\n\\nd_max = 0\\n\\n\\n\\nfor i in range(n - 1):\\n\\n d[i] = a[i + 1] - a[i]\\n\\n d_max = max(d_max, d[i])\\n\\n\\n\\nd[-1] = (k - a[-1]) + a[0]\\n\\nd_max = max(d_max, d[-1])\\n\\n\\n\\nprint((k - d_max))\\n',\n", + " 'target': 'k, n = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nd_max = 0\\n\\n\\n\\nfor i in range(n - 1):\\n\\n d = a[i + 1] - a[i]\\n\\n d_max = max(d_max, d)\\n\\n\\n\\nd = (k - a[-1]) + a[0]\\n\\nd_max = max(d_max, d)\\n\\n\\n\\nprint((k - d_max))\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 255,\n", + " 'code_v1_num_chars': 228,\n", + " 'code_v0_no_empty_lines': 'k, n = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nd = [0] * n\\nd_max = 0\\nfor i in range(n - 1):\\n d[i] = a[i + 1] - a[i]\\n d_max = max(d_max, d[i])\\nd[-1] = (k - a[-1]) + a[0]\\nd_max = max(d_max, d[-1])\\nprint((k - d_max))\\n',\n", + " 'code_v1_no_empty_lines': 'k, n = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nd_max = 0\\nfor i in range(n - 1):\\n d = a[i + 1] - a[i]\\n d_max = max(d_max, d)\\nd = (k - a[-1]) + a[0]\\nd_max = max(d_max, d)\\nprint((k - d_max))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.6923076923,\n", + " 'diff': ['-d = [0] * n',\n", + " '- d[i] = a[i + 1] - a[i]',\n", + " '- d_max = max(d_max, d[i])',\n", + " '-d[-1] = (k - a[-1]) + a[0]',\n", + " '-d_max = max(d_max, d[-1])',\n", + " '+ d = a[i + 1] - a[i]',\n", + " '+ d_max = max(d_max, d)',\n", + " '+d = (k - a[-1]) + a[0]',\n", + " '+d_max = max(d_max, d)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3049341288,\n", + " 'measured_runtime_v1': 0.200526454,\n", + " 'runtime_lift': 1.5206678356,\n", + " 'key': ['s320196234', 's733866625']},\n", + " {'user_id': 'u934442292',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's609043772',\n", + " 'submission_id_v1': 's337405796',\n", + " 'cpu_time_v0': 74,\n", + " 'cpu_time_v1': 53,\n", + " 'memory_v0': 9148,\n", + " 'memory_v1': 9132,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.38,\n", + " 'input': 'import sys\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef main():\\n\\n X = int(eval(input()))\\n\\n\\n\\n for A in range(-200, 201):\\n\\n for B in range(-200, 201):\\n\\n if A ** 5 - B ** 5 == X:\\n\\n print((A, B))\\n\\n exit()\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'import sys\\n\\n\\n\\ninput = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef main():\\n\\n X = int(eval(input()))\\n\\n\\n\\n for A in range(-119, 120 + 1):\\n\\n for B in range(-119, 120 + 1):\\n\\n if A ** 5 - B ** 5 == X:\\n\\n print((A, B))\\n\\n exit()\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 285,\n", + " 'code_v1_num_chars': 293,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n X = int(eval(input()))\\n for A in range(-200, 201):\\n for B in range(-200, 201):\\n if A**5 - B**5 == X:\\n print((A, B))\\n exit()\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n X = int(eval(input()))\\n for A in range(-119, 120 + 1):\\n for B in range(-119, 120 + 1):\\n if A**5 - B**5 == X:\\n print((A, B))\\n exit()\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- for A in range(-200, 201):',\n", + " '- for B in range(-200, 201):',\n", + " '+ for A in range(-119, 120 + 1):',\n", + " '+ for B in range(-119, 120 + 1):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4475147168,\n", + " 'measured_runtime_v1': 0.2975374639,\n", + " 'runtime_lift': 1.5040617437,\n", + " 'key': ['s609043772', 's337405796']},\n", + " {'user_id': 'u857759499',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's203363465',\n", + " 'submission_id_v1': 's893730989',\n", + " 'cpu_time_v0': 85,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 7096,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.0,\n", + " 'input': 'a,b,c,x,y = list(map(int,input().split()))\\n\\nxy = max(x,y)*2+1\\n\\nprint((min([c*i + max(0,a*(x-i//2)) +max(0,b*(y-i//2)) for i in range(0,xy,2)])))',\n", + " 'target': 'a,b,c,x,y = list(map(int,input().split()))\\n\\nif x < y:\\n\\n a, b, x, y = b, a, y, x\\n\\nprint((min(a*x+b*y,2*c*y + a*(x-y),2*c*x)))',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 136,\n", + " 'code_v1_num_chars': 119,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nxy = max(x, y) * 2 + 1\\nprint(\\n (\\n min(\\n [\\n c * i + max(0, a * (x - i // 2)) + max(0, b * (y - i // 2))\\n for i in range(0, xy, 2)\\n ]\\n )\\n )\\n)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nif x < y:\\n a, b, x, y = b, a, y, x\\nprint((min(a * x + b * y, 2 * c * y + a * (x - y), 2 * c * x)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-xy = max(x, y) * 2 + 1',\n", + " '-print(',\n", + " '- (',\n", + " '- min(',\n", + " '- [',\n", + " '- c * i + max(0, a * (x - i // 2)) + max(0, b * (y - i // 2))',\n", + " '- for i in range(0, xy, 2)',\n", + " '- ]',\n", + " '- )',\n", + " '- )',\n", + " '-)',\n", + " '+if x < y:',\n", + " '+ a, b, x, y = b, a, y, x',\n", + " '+print((min(a * x + b * y, 2 * c * y + a * (x - y), 2 * c * x)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2887920134,\n", + " 'measured_runtime_v1': 0.2046661584,\n", + " 'runtime_lift': 1.4110394,\n", + " 'key': ['s203363465', 's893730989']},\n", + " {'user_id': 'u764401543',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's157366337',\n", + " 'submission_id_v1': 's208344914',\n", + " 'cpu_time_v0': 114,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.09,\n", + " 'input': \"A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\nans = float('inf')\\n\\n\\n\\nfor i in range(10 ** 5 + 1):\\n\\n ans = min(ans, A * max(X - i, 0) + B * max(Y - i, 0) + 2 * C * i)\\n\\nprint(ans)\",\n", + " 'target': \"A, B, C, X, Y = list(map(int, input().split()))\\n\\n\\n\\n# ans = float('inf')\\n\\n\\n\\n# for i in range(10 ** 5 + 1):\\n\\n# ans = min(ans, A * max(X - i, 0) + B * max(Y - i, 0) + 2 * C * i)\\n\\n# print(ans)\\n\\n\\n\\nmin_xy = min(X, Y)\\n\\nmax_xy = max(X, Y)\\n\\nans1 = 2 * C * min_xy + A * (X - min_xy) + B * (Y - min_xy)\\n\\nans2 = A * X + B * Y\\n\\nans3 = 2 * C * max_xy\\n\\nprint((min(ans1, ans2, ans3)))\",\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 178,\n", + " 'code_v1_num_chars': 364,\n", + " 'code_v0_no_empty_lines': 'A, B, C, X, Y = list(map(int, input().split()))\\nans = float(\"inf\")\\nfor i in range(10**5 + 1):\\n ans = min(ans, A * max(X - i, 0) + B * max(Y - i, 0) + 2 * C * i)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': \"A, B, C, X, Y = list(map(int, input().split()))\\n# ans = float('inf')\\n# for i in range(10 ** 5 + 1):\\n# ans = min(ans, A * max(X - i, 0) + B * max(Y - i, 0) + 2 * C * i)\\n# print(ans)\\nmin_xy = min(X, Y)\\nmax_xy = max(X, Y)\\nans1 = 2 * C * min_xy + A * (X - min_xy) + B * (Y - min_xy)\\nans2 = A * X + B * Y\\nans3 = 2 * C * max_xy\\nprint((min(ans1, ans2, ans3)))\\n\",\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-ans = float(\"inf\")',\n", + " '-for i in range(10**5 + 1):',\n", + " '- ans = min(ans, A * max(X - i, 0) + B * max(Y - i, 0) + 2 * C * i)',\n", + " '-print(ans)',\n", + " \"+# ans = float('inf')\",\n", + " '+# for i in range(10 ** 5 + 1):',\n", + " '+# ans = min(ans, A * max(X - i, 0) + B * max(Y - i, 0) + 2 * C * i)',\n", + " '+# print(ans)',\n", + " '+min_xy = min(X, Y)',\n", + " '+max_xy = max(X, Y)',\n", + " '+ans1 = 2 * C * min_xy + A * (X - min_xy) + B * (Y - min_xy)',\n", + " '+ans2 = A * X + B * Y',\n", + " '+ans3 = 2 * C * max_xy',\n", + " '+print((min(ans1, ans2, ans3)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8766576855,\n", + " 'measured_runtime_v1': 0.1948450158,\n", + " 'runtime_lift': 4.4992564066,\n", + " 'key': ['s157366337', 's208344914']},\n", + " {'user_id': 'u023958502',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's928848207',\n", + " 'submission_id_v1': 's406476908',\n", + " 'cpu_time_v0': 1927,\n", + " 'cpu_time_v1': 827,\n", + " 'memory_v0': 4720,\n", + " 'memory_v1': 4592,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 57.08,\n", + " 'input': 'X,Y,Z,K = list(map(int,input().split()))\\n\\nA = list(map(int,input().split()))\\n\\nB = list(map(int,input().split()))\\n\\nC = list(map(int,input().split()))\\n\\nasort,bsort,csort = sorted(A,reverse=True),sorted(B,reverse=True),sorted(C,reverse=True)\\n\\nprint((asort[0] + bsort[0] + csort[0]))\\n\\nalready = [[0,0,0]]\\n\\nx,y,z = 0,0,0\\n\\nplace_sum = []\\n\\ncheck = []\\n\\nfor k in range(K - 1):\\n\\n if [x + 1,y,z] not in already and x + 1 < X:\\n\\n already.append([x + 1,y,z])\\n\\n place_sum.append([x + 1,y,z])\\n\\n check.append(asort[x + 1] + bsort[y] + csort[z])\\n\\n if [x,y + 1,z] not in already and y + 1 < Y:\\n\\n already.append([x,y + 1,z])\\n\\n place_sum.append([x,y + 1,z])\\n\\n check.append(asort[x] + bsort[y + 1] + csort[z])\\n\\n if [x,y,z + 1] not in already and z + 1 < Z:\\n\\n already.append([x,y,z + 1])\\n\\n place_sum.append([x,y,z + 1])\\n\\n check.append(asort[x] + bsort[y] + csort[z + 1])\\n\\n print((max(check)))\\n\\n x,y,z = place_sum[check.index(max(check))][0],place_sum[check.index(max(check))][1],place_sum[check.index(max(check))][2]\\n\\n place_sum.pop(check.index(max(check)))\\n\\n check.remove(max(check))',\n", + " 'target': 'import heapq\\n\\nX,Y,Z,K = list(map(int,input().split()))\\n\\nA = list(map(int,input().split()))\\n\\nB = list(map(int,input().split()))\\n\\nC = list(map(int,input().split()))\\n\\nasort,bsort,csort = sorted(A,reverse=True),sorted(B,reverse=True),sorted(C,reverse=True)\\n\\nalready = [[0,0,0]]\\n\\nprint((asort[0] + bsort[0] + csort[0]))\\n\\nx,y,z = 0,0,0\\n\\ncheck = []\\n\\nfor k in range(K - 1):\\n\\n if [x + 1,y,z] not in already and x + 1 < X:\\n\\n already.append([x + 1,y,z])\\n\\n heapq.heappush(check,(-(asort[x + 1] + bsort[y] + csort[z]),x + 1,y,z))\\n\\n if [x,y + 1,z] not in already and y + 1 < Y:\\n\\n already.append([x,y + 1,z])\\n\\n heapq.heappush(check,(-(asort[x] + bsort[y + 1] + csort[z]),x,y + 1,z))\\n\\n if [x,y,z + 1] not in already and z + 1 < Z:\\n\\n already.append([x,y,z + 1])\\n\\n heapq.heappush(check,(-(asort[x] + bsort[y] + csort[z + 1]),x,y,z + 1))\\n\\n maxsum = heapq.heappop(check)\\n\\n print((-maxsum[0]))\\n\\n x,y,z = maxsum[1],maxsum[2],maxsum[3]',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 1135,\n", + " 'code_v1_num_chars': 962,\n", + " 'code_v0_no_empty_lines': 'X, Y, Z, K = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nasort, bsort, csort = (\\n sorted(A, reverse=True),\\n sorted(B, reverse=True),\\n sorted(C, reverse=True),\\n)\\nprint((asort[0] + bsort[0] + csort[0]))\\nalready = [[0, 0, 0]]\\nx, y, z = 0, 0, 0\\nplace_sum = []\\ncheck = []\\nfor k in range(K - 1):\\n if [x + 1, y, z] not in already and x + 1 < X:\\n already.append([x + 1, y, z])\\n place_sum.append([x + 1, y, z])\\n check.append(asort[x + 1] + bsort[y] + csort[z])\\n if [x, y + 1, z] not in already and y + 1 < Y:\\n already.append([x, y + 1, z])\\n place_sum.append([x, y + 1, z])\\n check.append(asort[x] + bsort[y + 1] + csort[z])\\n if [x, y, z + 1] not in already and z + 1 < Z:\\n already.append([x, y, z + 1])\\n place_sum.append([x, y, z + 1])\\n check.append(asort[x] + bsort[y] + csort[z + 1])\\n print((max(check)))\\n x, y, z = (\\n place_sum[check.index(max(check))][0],\\n place_sum[check.index(max(check))][1],\\n place_sum[check.index(max(check))][2],\\n )\\n place_sum.pop(check.index(max(check)))\\n check.remove(max(check))\\n',\n", + " 'code_v1_no_empty_lines': 'import heapq\\n\\nX, Y, Z, K = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nB = list(map(int, input().split()))\\nC = list(map(int, input().split()))\\nasort, bsort, csort = (\\n sorted(A, reverse=True),\\n sorted(B, reverse=True),\\n sorted(C, reverse=True),\\n)\\nalready = [[0, 0, 0]]\\nprint((asort[0] + bsort[0] + csort[0]))\\nx, y, z = 0, 0, 0\\ncheck = []\\nfor k in range(K - 1):\\n if [x + 1, y, z] not in already and x + 1 < X:\\n already.append([x + 1, y, z])\\n heapq.heappush(check, (-(asort[x + 1] + bsort[y] + csort[z]), x + 1, y, z))\\n if [x, y + 1, z] not in already and y + 1 < Y:\\n already.append([x, y + 1, z])\\n heapq.heappush(check, (-(asort[x] + bsort[y + 1] + csort[z]), x, y + 1, z))\\n if [x, y, z + 1] not in already and z + 1 < Z:\\n already.append([x, y, z + 1])\\n heapq.heappush(check, (-(asort[x] + bsort[y] + csort[z + 1]), x, y, z + 1))\\n maxsum = heapq.heappop(check)\\n print((-maxsum[0]))\\n x, y, z = maxsum[1], maxsum[2], maxsum[3]\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.8148148148,\n", + " 'diff': ['+import heapq',\n", + " '+',\n", + " '+already = [[0, 0, 0]]',\n", + " '-already = [[0, 0, 0]]',\n", + " '-place_sum = []',\n", + " '- place_sum.append([x + 1, y, z])',\n", + " '- check.append(asort[x + 1] + bsort[y] + csort[z])',\n", + " '+ heapq.heappush(check, (-(asort[x + 1] + bsort[y] + csort[z]), x + 1, y, z))',\n", + " '- place_sum.append([x, y + 1, z])',\n", + " '- check.append(asort[x] + bsort[y + 1] + csort[z])',\n", + " '+ heapq.heappush(check, (-(asort[x] + bsort[y + 1] + csort[z]), x, y + 1, z))',\n", + " '- place_sum.append([x, y, z + 1])',\n", + " '- check.append(asort[x] + bsort[y] + csort[z + 1])',\n", + " '- print((max(check)))',\n", + " '- x, y, z = (',\n", + " '- place_sum[check.index(max(check))][0],',\n", + " '- place_sum[check.index(max(check))][1],',\n", + " '- place_sum[check.index(max(check))][2],',\n", + " '- )',\n", + " '- place_sum.pop(check.index(max(check)))',\n", + " '- check.remove(max(check))',\n", + " '+ heapq.heappush(check, (-(asort[x] + bsort[y] + csort[z + 1]), x, y, z + 1))',\n", + " '+ maxsum = heapq.heappop(check)',\n", + " '+ print((-maxsum[0]))',\n", + " '+ x, y, z = maxsum[1], maxsum[2], maxsum[3]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2974797392,\n", + " 'measured_runtime_v1': 0.2210724421,\n", + " 'runtime_lift': 1.3456210843,\n", + " 'key': ['s928848207', 's406476908']},\n", + " {'user_id': 'u078042885',\n", + " 'problem_id': 'p01138',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's367659771',\n", + " 'submission_id_v1': 's546819347',\n", + " 'cpu_time_v0': 8280,\n", + " 'cpu_time_v1': 5620,\n", + " 'memory_v0': 11712,\n", + " 'memory_v1': 11664,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 32.13,\n", + " 'input': \"def f(s):\\n\\n s=list(map(int,s.split(':')))\\n\\n return (s[0]*60+s[1])*60+s[2]\\n\\na=86401\\n\\nwhile 1:\\n\\n t=[0]*a\\n\\n n=int(eval(input()))\\n\\n if n==0:break\\n\\n for _ in range(n):\\n\\n b,c=input().split()\\n\\n t[f(b)]+=1;t[f(c)]-=1\\n\\n d=0\\n\\n for i in range(1,a):\\n\\n t[i]+=t[i-1]\\n\\n d=max(d,t[i])\\n\\n print(d)\",\n", + " 'target': \"def f(s):\\n\\n return (s[0]*60+s[1])*60+s[2]\\n\\na=86400\\n\\nwhile 1:\\n\\n t=[0]*a\\n\\n n=int(eval(input()))\\n\\n if n==0:break\\n\\n for _ in range(n):\\n\\n b,c = [list(map(int,x.split(':'))) for x in input().split()]\\n\\n t[f(b)]+=1;t[f(c)]-=1\\n\\n d=0\\n\\n for i in range(1,a):\\n\\n t[i]+=t[i-1]\\n\\n if d= 0, so A must be over C (A > C).\\n\\n #\\n\\n # If C is aliquot of N-1 (N-1 % C = 0), A is also aliquot of N-1\\n\\n # (N-1 % A = 0) because A + kC = N-1. Therefore when A is less than\\n\\n # or equal kC, the A's value is already used by kC.\\n\\n if A < C or ((N-1) % C == 0 and A <= k*C):\\n\\n break\\n\\n\\n\\n point += S[A] + S[k*C]\\n\\n ans = max(ans, point)\\n\\n\\n\\n return ans\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n print((main()))\\n\",\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 33,\n", + " 'code_v0_num_chars': 563,\n", + " 'code_v1_num_chars': 905,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\n\\ndef main():\\n input = sys.stdin.readline\\n N = int(eval(input()))\\n S = list(map(int, input().split()))\\n ans = 0\\n for C in range(1, N // 2):\\n n = N // C\\n point = 0\\n used = set([0])\\n for k in range(1, n):\\n A = N - 1 - k * C\\n if A in used or k * C in used or A == k * C:\\n break\\n used.add(A)\\n used.add(k * C)\\n point += S[A] + S[k * C]\\n ans = max(ans, point)\\n return ans\\n\\n\\nif __name__ == \"__main__\":\\n print((main()))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef main():\\n input = sys.stdin.readline\\n N = int(eval(input()))\\n S = list(map(int, input().split()))\\n ans = 0\\n # C = A - B\\n for C in range(1, N // 2):\\n n = (N - 1) // C\\n point = 0\\n for k in range(1, n):\\n A = N - 1 - k * C\\n # Check A and B are positive integer, and S_i is not used twice.\\n #\\n # B = A - C and B >= 0, so A must be over C (A > C).\\n #\\n # If C is aliquot of N-1 (N-1 % C = 0), A is also aliquot of N-1\\n # (N-1 % A = 0) because A + kC = N-1. Therefore when A is less than\\n # or equal kC, the A\\'s value is already used by kC.\\n if A < C or ((N - 1) % C == 0 and A <= k * C):\\n break\\n point += S[A] + S[k * C]\\n ans = max(ans, point)\\n return ans\\n\\n\\nif __name__ == \"__main__\":\\n print((main()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.1515151515,\n", + " 'diff': ['+ # C = A - B',\n", + " '- n = N // C',\n", + " '+ n = (N - 1) // C',\n", + " '- used = set([0])',\n", + " '- if A in used or k * C in used or A == k * C:',\n", + " '+ # Check A and B are positive integer, and S_i is not used twice.',\n", + " '+ #',\n", + " '+ # B = A - C and B >= 0, so A must be over C (A > C).',\n", + " '+ #',\n", + " '+ # If C is aliquot of N-1 (N-1 % C = 0), A is also aliquot of N-1',\n", + " '+ # (N-1 % A = 0) because A + kC = N-1. Therefore when A is less than',\n", + " \"+ # or equal kC, the A's value is already used by kC.\",\n", + " '+ if A < C or ((N - 1) % C == 0 and A <= k * C):',\n", + " '- used.add(A)',\n", + " '- used.add(k * C)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3095349545,\n", + " 'measured_runtime_v1': 0.0814658375,\n", + " 'runtime_lift': 3.7995675745,\n", + " 'key': ['s001695168', 's404140535']},\n", + " {'user_id': 'u046187684',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's323317183',\n", + " 'submission_id_v1': 's843253005',\n", + " 'cpu_time_v0': 35,\n", + " 'cpu_time_v1': 24,\n", + " 'memory_v0': 11112,\n", + " 'memory_v1': 9128,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 31.43,\n", + " 'input': 'def solve(string):\\n\\n x = int(string)\\n\\n a = {i**5: i for i in range(-10000, 10000)}\\n\\n for i in range(-10000, 10000):\\n\\n if x + i ** 5 in a:\\n\\n return str(f\"{a[x+i**5]} {i}\")\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n import sys\\n\\n print((solve(sys.stdin.read().strip())))\\n',\n", + " 'target': 'def solve(string):\\n\\n x = int(string)\\n\\n a = {i**5: i for i in range(-120, 121)}\\n\\n for i in range(-121, 121):\\n\\n if x + i ** 5 in a:\\n\\n return str(f\"{a[x+i**5]} {i}\")\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n import sys\\n\\n print((solve(sys.stdin.read().strip())))\\n',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 290,\n", + " 'code_v1_num_chars': 282,\n", + " 'code_v0_no_empty_lines': 'def solve(string):\\n x = int(string)\\n a = {i**5: i for i in range(-10000, 10000)}\\n for i in range(-10000, 10000):\\n if x + i**5 in a:\\n return str(f\"{a[x+i**5]} {i}\")\\n\\n\\nif __name__ == \"__main__\":\\n import sys\\n\\n print((solve(sys.stdin.read().strip())))\\n',\n", + " 'code_v1_no_empty_lines': 'def solve(string):\\n x = int(string)\\n a = {i**5: i for i in range(-120, 121)}\\n for i in range(-121, 121):\\n if x + i**5 in a:\\n return str(f\"{a[x+i**5]} {i}\")\\n\\n\\nif __name__ == \"__main__\":\\n import sys\\n\\n print((solve(sys.stdin.read().strip())))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- a = {i**5: i for i in range(-10000, 10000)}',\n", + " '- for i in range(-10000, 10000):',\n", + " '+ a = {i**5: i for i in range(-120, 121)}',\n", + " '+ for i in range(-121, 121):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3328460753,\n", + " 'measured_runtime_v1': 0.2083550632,\n", + " 'runtime_lift': 1.5974945373,\n", + " 'key': ['s323317183', 's843253005']},\n", + " {'user_id': 'u179169725',\n", + " 'problem_id': 'p02780',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's465820766',\n", + " 'submission_id_v1': 's149560631',\n", + " 'cpu_time_v0': 414,\n", + " 'cpu_time_v1': 235,\n", + " 'memory_v0': 27932,\n", + " 'memory_v1': 25720,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 43.24,\n", + " 'input': \"import sys\\n\\nread = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef read_ints():\\n\\n return list(map(int, read().split()))\\n\\n\\n\\n\\n\\ndef read_a_int():\\n\\n return int(read())\\n\\n\\n\\n\\n\\ndef read_matrix(H):\\n\\n '''\\n\\n H is number of rows\\n\\n '''\\n\\n return [list(map(int, read().split())) for _ in range(H)]\\n\\n\\n\\n\\n\\ndef read_map(H):\\n\\n '''\\n\\n H is number of rows\\n\\n 文字列で与えられた盤面を読み取る用\\n\\n '''\\n\\n return [read()[:-1] for _ in range(H)]\\n\\n\\n\\n\\n\\ndef read_tuple(H):\\n\\n '''\\n\\n H is number of rows\\n\\n '''\\n\\n ret = []\\n\\n for _ in range(H):\\n\\n ret.append(tuple(map(int, read().split())))\\n\\n return ret\\n\\n\\n\\n\\n\\ndef read_col(H, n_cols):\\n\\n '''\\n\\n H is number of rows\\n\\n n_cols is number of cols\\n\\n\\n\\n A列、B列が与えられるようなとき\\n\\n '''\\n\\n ret = [[] for _ in range(n_cols)]\\n\\n for _ in range(H):\\n\\n tmp = list(map(int, read().split()))\\n\\n for col in range(n_cols):\\n\\n ret[col].append(tmp[col])\\n\\n\\n\\n return ret\\n\\n\\n\\n\\n\\nN, K = read_ints()\\n\\nP = read_ints()\\n\\n\\n\\n\\n\\ndef ret_mean(X):\\n\\n return (X + 1) / 2\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nimport numpy as np\\n\\nP_mean = np.array([ret_mean(p) for p in P])\\n\\nP_accum = np.zeros(N+1)\\n\\nP_accum[1:] = P_mean.cumsum()\\n\\n\\n\\nans = 0\\n\\n# print(P_accum)\\n\\nfor i in range(N - K + 1):\\n\\n j = i + K\\n\\n ans = max(ans, P_accum[j] - P_accum[i])\\n\\nprint(ans)\\n\",\n", + " 'target': \"import sys\\n\\nread = sys.stdin.readline\\n\\n\\n\\n\\n\\ndef read_ints():\\n\\n return list(map(int, read().split()))\\n\\n\\n\\n\\n\\ndef read_a_int():\\n\\n return int(read())\\n\\n\\n\\n\\n\\ndef read_matrix(H):\\n\\n '''\\n\\n H is number of rows\\n\\n '''\\n\\n return [list(map(int, read().split())) for _ in range(H)]\\n\\n\\n\\n\\n\\ndef read_map(H):\\n\\n '''\\n\\n H is number of rows\\n\\n 文字列で与えられた盤面を読み取る用\\n\\n '''\\n\\n return [read()[:-1] for _ in range(H)]\\n\\n\\n\\n\\n\\ndef read_tuple(H):\\n\\n '''\\n\\n H is number of rows\\n\\n '''\\n\\n ret = []\\n\\n for _ in range(H):\\n\\n ret.append(tuple(map(int, read().split())))\\n\\n return ret\\n\\n\\n\\n\\n\\ndef read_col(H, n_cols):\\n\\n '''\\n\\n H is number of rows\\n\\n n_cols is number of cols\\n\\n\\n\\n A列、B列が与えられるようなとき\\n\\n '''\\n\\n ret = [[] for _ in range(n_cols)]\\n\\n for _ in range(H):\\n\\n tmp = list(map(int, read().split()))\\n\\n for col in range(n_cols):\\n\\n ret[col].append(tmp[col])\\n\\n\\n\\n return ret\\n\\n\\n\\n\\n\\nN, K = read_ints()\\n\\nP = read_ints()\\n\\n\\n\\n\\n\\ndef ret_mean(X):\\n\\n return (X + 1) / 2\\n\\n\\n\\n\\n\\n\\n\\nclass cumsum1d:\\n\\n def __init__(self, ls: list):\\n\\n '''\\n\\n 1次元リストを受け取る\\n\\n '''\\n\\n from itertools import accumulate\\n\\n self.ls_accum = [0] + list(accumulate(ls))\\n\\n\\n\\n def total(self, i, j):\\n\\n # もとの配列lsにおける[i,j)の中合計\\n\\n return self.ls_accum[j] - self.ls_accum[i]\\n\\n \\n\\nP_mean = [ret_mean(p) for p in P]\\n\\nP_accum = cumsum1d(P_mean)\\n\\n\\n\\nans = 0\\n\\n# print(P_accum)\\n\\nfor i in range(N - K + 1):\\n\\n j = i + K\\n\\n ans = max(ans, P_accum.total(i,j))\\n\\nprint(ans)\\n\",\n", + " 'code_v0_loc': 74,\n", + " 'code_v1_loc': 83,\n", + " 'code_v0_num_chars': 1260,\n", + " 'code_v1_num_chars': 1510,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.readline\\n\\n\\ndef read_ints():\\n return list(map(int, read().split()))\\n\\n\\ndef read_a_int():\\n return int(read())\\n\\n\\ndef read_matrix(H):\\n \"\"\"\\n H is number of rows\\n \"\"\"\\n return [list(map(int, read().split())) for _ in range(H)]\\n\\n\\ndef read_map(H):\\n \"\"\"\\n H is number of rows\\n 文字列で与えられた盤面を読み取る用\\n \"\"\"\\n return [read()[:-1] for _ in range(H)]\\n\\n\\ndef read_tuple(H):\\n \"\"\"\\n H is number of rows\\n \"\"\"\\n ret = []\\n for _ in range(H):\\n ret.append(tuple(map(int, read().split())))\\n return ret\\n\\n\\ndef read_col(H, n_cols):\\n \"\"\"\\n H is number of rows\\n n_cols is number of cols\\n A列、B列が与えられるようなとき\\n \"\"\"\\n ret = [[] for _ in range(n_cols)]\\n for _ in range(H):\\n tmp = list(map(int, read().split()))\\n for col in range(n_cols):\\n ret[col].append(tmp[col])\\n return ret\\n\\n\\nN, K = read_ints()\\nP = read_ints()\\n\\n\\ndef ret_mean(X):\\n return (X + 1) / 2\\n\\n\\nimport numpy as np\\n\\nP_mean = np.array([ret_mean(p) for p in P])\\nP_accum = np.zeros(N + 1)\\nP_accum[1:] = P_mean.cumsum()\\nans = 0\\n# print(P_accum)\\nfor i in range(N - K + 1):\\n j = i + K\\n ans = max(ans, P_accum[j] - P_accum[i])\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.readline\\n\\n\\ndef read_ints():\\n return list(map(int, read().split()))\\n\\n\\ndef read_a_int():\\n return int(read())\\n\\n\\ndef read_matrix(H):\\n \"\"\"\\n H is number of rows\\n \"\"\"\\n return [list(map(int, read().split())) for _ in range(H)]\\n\\n\\ndef read_map(H):\\n \"\"\"\\n H is number of rows\\n 文字列で与えられた盤面を読み取る用\\n \"\"\"\\n return [read()[:-1] for _ in range(H)]\\n\\n\\ndef read_tuple(H):\\n \"\"\"\\n H is number of rows\\n \"\"\"\\n ret = []\\n for _ in range(H):\\n ret.append(tuple(map(int, read().split())))\\n return ret\\n\\n\\ndef read_col(H, n_cols):\\n \"\"\"\\n H is number of rows\\n n_cols is number of cols\\n A列、B列が与えられるようなとき\\n \"\"\"\\n ret = [[] for _ in range(n_cols)]\\n for _ in range(H):\\n tmp = list(map(int, read().split()))\\n for col in range(n_cols):\\n ret[col].append(tmp[col])\\n return ret\\n\\n\\nN, K = read_ints()\\nP = read_ints()\\n\\n\\ndef ret_mean(X):\\n return (X + 1) / 2\\n\\n\\nclass cumsum1d:\\n def __init__(self, ls: list):\\n \"\"\"\\n 1次元リストを受け取る\\n \"\"\"\\n from itertools import accumulate\\n\\n self.ls_accum = [0] + list(accumulate(ls))\\n\\n def total(self, i, j):\\n # もとの配列lsにおける[i,j)の中合計\\n return self.ls_accum[j] - self.ls_accum[i]\\n\\n\\nP_mean = [ret_mean(p) for p in P]\\nP_accum = cumsum1d(P_mean)\\nans = 0\\n# print(P_accum)\\nfor i in range(N - K + 1):\\n j = i + K\\n ans = max(ans, P_accum.total(i, j))\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.843373494,\n", + " 'diff': ['-import numpy as np',\n", + " '+class cumsum1d:',\n", + " '+ def __init__(self, ls: list):',\n", + " '+ \"\"\"',\n", + " '+ 1次元リストを受け取る',\n", + " '+ \"\"\"',\n", + " '+ from itertools import accumulate',\n", + " '-P_mean = np.array([ret_mean(p) for p in P])',\n", + " '-P_accum = np.zeros(N + 1)',\n", + " '-P_accum[1:] = P_mean.cumsum()',\n", + " '+ self.ls_accum = [0] + list(accumulate(ls))',\n", + " '+',\n", + " '+ def total(self, i, j):',\n", + " '+ # もとの配列lsにおける[i,j)の中合計',\n", + " '+ return self.ls_accum[j] - self.ls_accum[i]',\n", + " '+',\n", + " '+',\n", + " '+P_mean = [ret_mean(p) for p in P]',\n", + " '+P_accum = cumsum1d(P_mean)',\n", + " '- ans = max(ans, P_accum[j] - P_accum[i])',\n", + " '+ ans = max(ans, P_accum.total(i, j))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.407651695,\n", + " 'measured_runtime_v1': 0.2221130846,\n", + " 'runtime_lift': 6.3375451193,\n", + " 'key': ['s465820766', 's149560631']},\n", + " {'user_id': 'u344655022',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's549296835',\n", + " 'submission_id_v1': 's211921463',\n", + " 'cpu_time_v0': 71,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 64940,\n", + " 'memory_v1': 63572,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.49,\n", + " 'input': 's = int(eval(input()))\\n\\nmod = 10**9 + 7\\n\\n\\n\\n# dp[i]: 最後に切った場所がi\\n\\ndp = [0]*(s + 1)\\n\\ndp[0] = 1\\n\\n\\n\\nfor i in range(3, s+1):\\n\\n for j in range(0, (i-3)+1):\\n\\n dp[i] += dp[j]\\n\\n dp[i] %= mod\\n\\n\\n\\nprint((dp[s]))',\n", + " 'target': 's = int(eval(input()))\\n\\nmod = 10**9 + 7\\n\\n\\n\\n# dp[i]: 最後に切った場所がi\\n\\ndp = [0]*(s + 1)\\n\\ndp[0] = 1\\n\\ntotal = 0\\n\\nfor i in range(3, s+1):\\n\\n total += dp[i-3]\\n\\n total %= mod\\n\\n dp[i] = total\\n\\n\\n\\nprint((dp[s]))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 207,\n", + " 'code_v1_num_chars': 196,\n", + " 'code_v0_no_empty_lines': 's = int(eval(input()))\\nmod = 10**9 + 7\\n# dp[i]: 最後に切った場所がi\\ndp = [0] * (s + 1)\\ndp[0] = 1\\nfor i in range(3, s + 1):\\n for j in range(0, (i - 3) + 1):\\n dp[i] += dp[j]\\n dp[i] %= mod\\nprint((dp[s]))\\n',\n", + " 'code_v1_no_empty_lines': 's = int(eval(input()))\\nmod = 10**9 + 7\\n# dp[i]: 最後に切った場所がi\\ndp = [0] * (s + 1)\\ndp[0] = 1\\ntotal = 0\\nfor i in range(3, s + 1):\\n total += dp[i - 3]\\n total %= mod\\n dp[i] = total\\nprint((dp[s]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['+total = 0',\n", + " '- for j in range(0, (i - 3) + 1):',\n", + " '- dp[i] += dp[j]',\n", + " '- dp[i] %= mod',\n", + " '+ total += dp[i - 3]',\n", + " '+ total %= mod',\n", + " '+ dp[i] = total'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6875757372,\n", + " 'measured_runtime_v1': 0.2074076123,\n", + " 'runtime_lift': 3.3150940291,\n", + " 'key': ['s549296835', 's211921463']},\n", + " {'user_id': 'u046187684',\n", + " 'problem_id': 'p03480',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's964601714',\n", + " 'submission_id_v1': 's413566853',\n", + " 'cpu_time_v0': 40,\n", + " 'cpu_time_v1': 33,\n", + " 'memory_v0': 6244,\n", + " 'memory_v1': 6388,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.5,\n", + " 'input': '#!/usr/bin/env python3\\n\\n# coding=utf-8\\n\\n\\n\\nimport sys\\n\\n\\n\\ns = sys.stdin.readline().strip()\\n\\nl = [_s is \"1\" for _s in list(s)]\\n\\nl_r = l[::-1]\\n\\nindex = 0\\n\\nfor i, (c, n, c_r, n_r) in enumerate(\\n\\n zip(l[:len(s) // 2], l[1:len(s) // 2 + 1], l_r[:len(s) // 2], l_r[1:len(s) // 2 + 1])):\\n\\n if c ^ n or c_r ^ n_r:\\n\\n index = i + 1\\n\\nprint((len(s) - index))',\n", + " 'target': 'def solve(string):\\n\\n l = [s == \"1\" for s in string]\\n\\n l_r = l[::-1]\\n\\n index = 0\\n\\n h = len(string) // 2\\n\\n for i, (c, n, c_r, n_r) in enumerate(zip(l[:h], l[1:h + 1], l_r[:h], l_r[1:h + 1])):\\n\\n if c ^ n or c_r ^ n_r:\\n\\n index = i + 1\\n\\n return str(len(string) - index)\\n\\n\\n\\n\\n\\nif __name__ == \\'__main__\\':\\n\\n print((solve(eval(input()))))\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 359,\n", + " 'code_v1_num_chars': 360,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env python3\\n# coding=utf-8\\nimport sys\\n\\ns = sys.stdin.readline().strip()\\nl = [_s is \"1\" for _s in list(s)]\\nl_r = l[::-1]\\nindex = 0\\nfor i, (c, n, c_r, n_r) in enumerate(\\n zip(\\n l[: len(s) // 2],\\n l[1 : len(s) // 2 + 1],\\n l_r[: len(s) // 2],\\n l_r[1 : len(s) // 2 + 1],\\n )\\n):\\n if c ^ n or c_r ^ n_r:\\n index = i + 1\\nprint((len(s) - index))\\n',\n", + " 'code_v1_no_empty_lines': 'def solve(string):\\n l = [s == \"1\" for s in string]\\n l_r = l[::-1]\\n index = 0\\n h = len(string) // 2\\n for i, (c, n, c_r, n_r) in enumerate(\\n zip(l[:h], l[1 : h + 1], l_r[:h], l_r[1 : h + 1])\\n ):\\n if c ^ n or c_r ^ n_r:\\n index = i + 1\\n return str(len(string) - index)\\n\\n\\nif __name__ == \"__main__\":\\n print((solve(eval(input()))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 7.1428571429,\n", + " 'diff': ['-#!/usr/bin/env python3',\n", + " '-# coding=utf-8',\n", + " '-import sys',\n", + " '+def solve(string):',\n", + " '+ l = [s == \"1\" for s in string]',\n", + " '+ l_r = l[::-1]',\n", + " '+ index = 0',\n", + " '+ h = len(string) // 2',\n", + " '+ for i, (c, n, c_r, n_r) in enumerate(',\n", + " '+ zip(l[:h], l[1 : h + 1], l_r[:h], l_r[1 : h + 1])',\n", + " '+ ):',\n", + " '+ if c ^ n or c_r ^ n_r:',\n", + " '+ index = i + 1',\n", + " '+ return str(len(string) - index)',\n", + " '-s = sys.stdin.readline().strip()',\n", + " '-l = [_s is \"1\" for _s in list(s)]',\n", + " '-l_r = l[::-1]',\n", + " '-index = 0',\n", + " '-for i, (c, n, c_r, n_r) in enumerate(',\n", + " '- zip(',\n", + " '- l[: len(s) // 2],',\n", + " '- l[1 : len(s) // 2 + 1],',\n", + " '- l_r[: len(s) // 2],',\n", + " '- l_r[1 : len(s) // 2 + 1],',\n", + " '- )',\n", + " '-):',\n", + " '- if c ^ n or c_r ^ n_r:',\n", + " '- index = i + 1',\n", + " '-print((len(s) - index))',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ print((solve(eval(input()))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3417459049,\n", + " 'measured_runtime_v1': 0.2085829885,\n", + " 'runtime_lift': 1.6384169551,\n", + " 'key': ['s964601714', 's413566853']},\n", + " {'user_id': 'u054556734',\n", + " 'problem_id': 'p03828',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's442927172',\n", + " 'submission_id_v1': 's952876179',\n", + " 'cpu_time_v0': 83,\n", + " 'cpu_time_v1': 25,\n", + " 'memory_v0': 3316,\n", + " 'memory_v1': 3316,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 69.88,\n", + " 'input': 'import collections as col\\n\\n\\n\\ndef prime(n):\\n\\n ans = []\\n\\n num = n\\n\\n for i in range(2,n+1):\\n\\n if i%2==0 and i!=2: continue\\n\\n while num%i == 0: num //= i ; ans.append(i)\\n\\n return ans\\n\\n\\n\\nn = int(eval(input()))\\n\\nmod = 10**9 + 7\\n\\n\\n\\nprimes = []\\n\\nfor i in range(2,n+1): primes += prime(i)\\n\\n\\n\\ncnt = col.Counter(primes)\\n\\nans = 1\\n\\nfor key,val in list(cnt.items()): ans *= (val + 1) ; ans %= mod\\n\\nprint(ans)\\n',\n", + " 'target': 'import collections as col\\n\\n\\n\\ndef prime(n):\\n\\n ans = []\\n\\n num = n\\n\\n for i in range(2,int(n**0.5)+1):\\n\\n if i%2==0 and i!=2: continue\\n\\n while num%i == 0: num //= i ; ans.append(i)\\n\\n if num != 1: ans.append(num)\\n\\n return ans\\n\\n\\n\\nn = int(eval(input()))\\n\\nmod = 10**9 + 7\\n\\n\\n\\nprimes = []\\n\\nfor i in range(2,n+1): primes += prime(i)\\n\\n\\n\\ncnt = col.Counter(primes)\\n\\nans = 1\\n\\nfor key,val in list(cnt.items()): ans *= (val + 1) ; ans %= mod\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 409,\n", + " 'code_v1_num_chars': 453,\n", + " 'code_v0_no_empty_lines': 'import collections as col\\n\\n\\ndef prime(n):\\n ans = []\\n num = n\\n for i in range(2, n + 1):\\n if i % 2 == 0 and i != 2:\\n continue\\n while num % i == 0:\\n num //= i\\n ans.append(i)\\n return ans\\n\\n\\nn = int(eval(input()))\\nmod = 10**9 + 7\\nprimes = []\\nfor i in range(2, n + 1):\\n primes += prime(i)\\ncnt = col.Counter(primes)\\nans = 1\\nfor key, val in list(cnt.items()):\\n ans *= val + 1\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import collections as col\\n\\n\\ndef prime(n):\\n ans = []\\n num = n\\n for i in range(2, int(n**0.5) + 1):\\n if i % 2 == 0 and i != 2:\\n continue\\n while num % i == 0:\\n num //= i\\n ans.append(i)\\n if num != 1:\\n ans.append(num)\\n return ans\\n\\n\\nn = int(eval(input()))\\nmod = 10**9 + 7\\nprimes = []\\nfor i in range(2, n + 1):\\n primes += prime(i)\\ncnt = col.Counter(primes)\\nans = 1\\nfor key, val in list(cnt.items()):\\n ans *= val + 1\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.7619047619,\n", + " 'diff': ['- for i in range(2, n + 1):',\n", + " '+ for i in range(2, int(n**0.5) + 1):',\n", + " '+ if num != 1:',\n", + " '+ ans.append(num)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3365422637,\n", + " 'measured_runtime_v1': 0.2564944384,\n", + " 'runtime_lift': 1.3120840585,\n", + " 'key': ['s442927172', 's952876179']},\n", + " {'user_id': 'u463655976',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's227334045',\n", + " 'submission_id_v1': 's524241188',\n", + " 'cpu_time_v0': 285,\n", + " 'cpu_time_v1': 189,\n", + " 'memory_v0': 22940,\n", + " 'memory_v1': 7836,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 33.68,\n", + " 'input': 'from functools import lru_cache\\n\\nimport sys\\n\\nsys.setrecursionlimit(30000)\\n\\n\\n\\nN, M = list(map(int, input().split()))\\n\\na = list(int(eval(input())) for _ in range(M))\\n\\n\\n\\nMOD = pow(10, 9) + 7\\n\\n\\n\\nisOk = True\\n\\nfor i in range(M-1):\\n\\n if a[i] + 1 == a[i+1]:\\n\\n isOk = False\\n\\n \\n\\nfuncb = [-1] * 100001\\n\\ndef func(n):\\n\\n if n <= 0:\\n\\n return 1\\n\\n cnt = funcb[n]\\n\\n if cnt > 0:\\n\\n return cnt\\n\\n cnt = 0\\n\\n if n >= 2:\\n\\n cnt += func(n-2)\\n\\n if n >= 1:\\n\\n cnt += func(n-1)\\n\\n funcb[n] = cnt % MOD\\n\\n return funcb[n]\\n\\n\\n\\nfunc(30000)\\n\\nfunc(50000)\\n\\nfunc(80000)\\n\\nfunc(100000)\\n\\n\\n\\nif not isOk:\\n\\n print((0))\\n\\nelse:\\n\\n ans = 1\\n\\n s = 0\\n\\n for i in range(M+1):\\n\\n if i >= M:\\n\\n e = N\\n\\n else:\\n\\n e = a[i] - 1\\n\\n\\n\\n ans = ans * func(e-s) % MOD\\n\\n\\n\\n if i >= M:\\n\\n break\\n\\n\\n\\n s = a[i] + 1\\n\\n\\n\\n print(ans)\\n',\n", + " 'target': 'N, M = list(map(int, input().split()))\\n\\na = list(int(eval(input())) for _ in range(M))\\n\\n\\n\\nMOD = pow(10, 9) + 7\\n\\n\\n\\nMAP = [0] * (N + 1)\\n\\n\\n\\nfor x in a:\\n\\n MAP[x] = -1\\n\\n\\n\\nMAP[0] = 1 \\n\\nfor i in range(N):\\n\\n if MAP[i] < 0:\\n\\n continue\\n\\n\\n\\n MAP[i] %= MOD\\n\\n if i + 1 <= N and MAP[i+1] >= 0:\\n\\n MAP[i+1] += MAP[i]\\n\\n if i + 2 <= N and MAP[i+2] >= 0:\\n\\n MAP[i+2] += MAP[i]\\n\\n\\n\\nprint((MAP[N] % MOD))\\n',\n", + " 'code_v0_loc': 53,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 885,\n", + " 'code_v1_num_chars': 403,\n", + " 'code_v0_no_empty_lines': 'from functools import lru_cache\\nimport sys\\n\\nsys.setrecursionlimit(30000)\\nN, M = list(map(int, input().split()))\\na = list(int(eval(input())) for _ in range(M))\\nMOD = pow(10, 9) + 7\\nisOk = True\\nfor i in range(M - 1):\\n if a[i] + 1 == a[i + 1]:\\n isOk = False\\nfuncb = [-1] * 100001\\n\\n\\ndef func(n):\\n if n <= 0:\\n return 1\\n cnt = funcb[n]\\n if cnt > 0:\\n return cnt\\n cnt = 0\\n if n >= 2:\\n cnt += func(n - 2)\\n if n >= 1:\\n cnt += func(n - 1)\\n funcb[n] = cnt % MOD\\n return funcb[n]\\n\\n\\nfunc(30000)\\nfunc(50000)\\nfunc(80000)\\nfunc(100000)\\nif not isOk:\\n print((0))\\nelse:\\n ans = 1\\n s = 0\\n for i in range(M + 1):\\n if i >= M:\\n e = N\\n else:\\n e = a[i] - 1\\n ans = ans * func(e - s) % MOD\\n if i >= M:\\n break\\n s = a[i] + 1\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M = list(map(int, input().split()))\\na = list(int(eval(input())) for _ in range(M))\\nMOD = pow(10, 9) + 7\\nMAP = [0] * (N + 1)\\nfor x in a:\\n MAP[x] = -1\\nMAP[0] = 1\\nfor i in range(N):\\n if MAP[i] < 0:\\n continue\\n MAP[i] %= MOD\\n if i + 1 <= N and MAP[i + 1] >= 0:\\n MAP[i + 1] += MAP[i]\\n if i + 2 <= N and MAP[i + 2] >= 0:\\n MAP[i + 2] += MAP[i]\\nprint((MAP[N] % MOD))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 58.4905660377,\n", + " 'diff': ['-from functools import lru_cache',\n", + " '-import sys',\n", + " '-',\n", + " '-sys.setrecursionlimit(30000)',\n", + " '-isOk = True',\n", + " '-for i in range(M - 1):',\n", + " '- if a[i] + 1 == a[i + 1]:',\n", + " '- isOk = False',\n", + " '-funcb = [-1] * 100001',\n", + " '-',\n", + " '-',\n", + " '-def func(n):',\n", + " '- if n <= 0:',\n", + " '- return 1',\n", + " '- cnt = funcb[n]',\n", + " '- if cnt > 0:',\n", + " '- return cnt',\n", + " '- cnt = 0',\n", + " '- if n >= 2:',\n", + " '- cnt += func(n - 2)',\n", + " '- if n >= 1:',\n", + " '- cnt += func(n - 1)',\n", + " '- funcb[n] = cnt % MOD',\n", + " '- return funcb[n]',\n", + " '-',\n", + " '-',\n", + " '-func(30000)',\n", + " '-func(50000)',\n", + " '-func(80000)',\n", + " '-func(100000)',\n", + " '-if not isOk:',\n", + " '- print((0))',\n", + " '-else:',\n", + " '- ans = 1',\n", + " '- s = 0',\n", + " '- for i in range(M + 1):',\n", + " '- if i >= M:',\n", + " '- e = N',\n", + " '- else:',\n", + " '- e = a[i] - 1',\n", + " '- ans = ans * func(e - s) % MOD',\n", + " '- if i >= M:',\n", + " '- break',\n", + " '- s = a[i] + 1',\n", + " '- print(ans)',\n", + " '+MAP = [0] * (N + 1)',\n", + " '+for x in a:',\n", + " '+ MAP[x] = -1',\n", + " '+MAP[0] = 1',\n", + " '+for i in range(N):',\n", + " '+ if MAP[i] < 0:',\n", + " '+ continue',\n", + " '+ MAP[i] %= MOD',\n", + " '+ if i + 1 <= N and MAP[i + 1] >= 0:',\n", + " '+ MAP[i + 1] += MAP[i]',\n", + " '+ if i + 2 <= N and MAP[i + 2] >= 0:',\n", + " '+ MAP[i + 2] += MAP[i]',\n", + " '+print((MAP[N] % MOD))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.0640589638,\n", + " 'measured_runtime_v1': 0.2648930094,\n", + " 'runtime_lift': 4.0169386351,\n", + " 'key': ['s227334045', 's524241188']},\n", + " {'user_id': 'u869919400',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's127994042',\n", + " 'submission_id_v1': 's163960956',\n", + " 'cpu_time_v0': 229,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 83.84,\n", + " 'input': 'from math import factorial as f\\n\\nn = int(eval(input()))\\n\\nprint((f(n) % (10 ** 9 + 7)))',\n", + " 'target': 'n = int(eval(input()))\\n\\np = 1\\n\\nfor i in range(n):\\n\\n p = (p * (i+1)) % (10 ** 9 + 7)\\n\\nprint(p)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 78,\n", + " 'code_v1_num_chars': 90,\n", + " 'code_v0_no_empty_lines': 'from math import factorial as f\\n\\nn = int(eval(input()))\\nprint((f(n) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\np = 1\\nfor i in range(n):\\n p = (p * (i + 1)) % (10**9 + 7)\\nprint(p)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 40.0,\n", + " 'diff': ['-from math import factorial as f',\n", + " '-',\n", + " '-print((f(n) % (10**9 + 7)))',\n", + " '+p = 1',\n", + " '+for i in range(n):',\n", + " '+ p = (p * (i + 1)) % (10**9 + 7)',\n", + " '+print(p)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8111317687,\n", + " 'measured_runtime_v1': 0.3589184887,\n", + " 'runtime_lift': 2.2599330882,\n", + " 'key': ['s127994042', 's163960956']},\n", + " {'user_id': 'u562935282',\n", + " 'problem_id': 'p04005',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's576816693',\n", + " 'submission_id_v1': 's557622241',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': \"'''\\n\\nある平面のブロック数×(0,1)\\n\\n一つでも偶数があれば、均等分割可能\\n\\nすべて奇数のとき、\\n\\nある平面のブロック数を最小となるようにすると、その数が答えになる\\n\\n'''\\n\\n\\n\\narr = list(map(int, input().split()))\\n\\n\\n\\nret = -1\\n\\nif 0 in list([x % 2 for x in arr]):\\n\\n ret = 0\\n\\nelse:\\n\\n arr_sorted = sorted(arr)\\n\\n ret = arr_sorted[0] * arr_sorted[1]\\n\\nprint(ret)\",\n", + " 'target': 'a = list(map(int, input().split()))\\n\\n\\n\\nif any([x % 2 == 0 for x in a]):\\n\\n print((0))\\n\\nelse:\\n\\n a = list(sorted(a))\\n\\n print((a[0] * a[1]))\\n',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 288,\n", + " 'code_v1_num_chars': 147,\n", + " 'code_v0_no_empty_lines': '\"\"\"\\nある平面のブロック数×(0,1)\\n一つでも偶数があれば、均等分割可能\\nすべて奇数のとき、\\nある平面のブロック数を最小となるようにすると、その数が答えになる\\n\"\"\"\\narr = list(map(int, input().split()))\\nret = -1\\nif 0 in list([x % 2 for x in arr]):\\n ret = 0\\nelse:\\n arr_sorted = sorted(arr)\\n ret = arr_sorted[0] * arr_sorted[1]\\nprint(ret)\\n',\n", + " 'code_v1_no_empty_lines': 'a = list(map(int, input().split()))\\nif any([x % 2 == 0 for x in a]):\\n print((0))\\nelse:\\n a = list(sorted(a))\\n print((a[0] * a[1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 56.25,\n", + " 'diff': ['-\"\"\"',\n", + " '-ある平面のブロック数×(0,1)',\n", + " '-一つでも偶数があれば、均等分割可能',\n", + " '-すべて奇数のとき、',\n", + " '-ある平面のブロック数を最小となるようにすると、その数が答えになる',\n", + " '-\"\"\"',\n", + " '-arr = list(map(int, input().split()))',\n", + " '-ret = -1',\n", + " '-if 0 in list([x % 2 for x in arr]):',\n", + " '- ret = 0',\n", + " '+a = list(map(int, input().split()))',\n", + " '+if any([x % 2 == 0 for x in a]):',\n", + " '+ print((0))',\n", + " '- arr_sorted = sorted(arr)',\n", + " '- ret = arr_sorted[0] * arr_sorted[1]',\n", + " '-print(ret)',\n", + " '+ a = list(sorted(a))',\n", + " '+ print((a[0] * a[1]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1621806974,\n", + " 'measured_runtime_v1': 0.0068150451,\n", + " 'runtime_lift': 23.7974502571,\n", + " 'key': ['s576816693', 's557622241']},\n", + " {'user_id': 'u864197622',\n", + " 'problem_id': 'p02794',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's167224132',\n", + " 'submission_id_v1': 's245735210',\n", + " 'cpu_time_v0': 294,\n", + " 'cpu_time_v1': 228,\n", + " 'memory_v0': 50156,\n", + " 'memory_v1': 49128,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.45,\n", + " 'input': 'N = int(eval(input()))\\n\\nX = [[] for i in range(N)]\\n\\nfor i in range(N-1):\\n\\n x, y = list(map(int, input().split()))\\n\\n X[x-1].append(y-1)\\n\\n X[y-1].append(x-1)\\n\\n\\n\\nP = [-1] * N\\n\\nDE = [0] * N\\n\\nQ = [0]\\n\\nwhile Q:\\n\\n i = Q.pop()\\n\\n for a in X[i][::-1]:\\n\\n if a != P[i]:\\n\\n P[a] = i\\n\\n DE[a] = DE[i] + 1\\n\\n X[a].remove(i)\\n\\n Q.append(a)\\n\\n\\n\\ndef lp(u, v):\\n\\n t = 0\\n\\n while u != v:\\n\\n if DE[u] > DE[v]:\\n\\n t += 1 << u-1\\n\\n u = P[u]\\n\\n elif DE[u] < DE[v]:\\n\\n t += 1 << v-1\\n\\n v = P[v]\\n\\n else:\\n\\n t += 1 << u-1\\n\\n t += 1 << v-1\\n\\n u = P[u]\\n\\n v = P[v]\\n\\n \\n\\n return t\\n\\n\\n\\nY = []\\n\\nM = int(eval(input()))\\n\\nfor _ in range(M):\\n\\n a, b = list(map(int, input().split()))\\n\\n a, b = a-1, b-1\\n\\n Y.append(lp(a, b))\\n\\n\\n\\nD = {1<>= 17\\n\\n bc += BC[aa % (1<<17)]\\n\\n aa >>= 17\\n\\n bc += BC[aa]\\n\\n CC[N - 1 - bc] += (1 if BC[m%1024] + BC[m>>10] & 1 == 0 else -1)\\n\\n\\n\\nprint((sum([2 ** i * CC[i] for i in range(N)])))',\n", + " 'target': 'N = int(eval(input()))\\n\\nX = [[] for i in range(N)]\\n\\nfor i in range(N-1):\\n\\n x, y = list(map(int, input().split()))\\n\\n X[x-1].append(y-1)\\n\\n X[y-1].append(x-1)\\n\\n\\n\\nP = [-1] * N\\n\\nDE = [0] * N\\n\\nQ = [0]\\n\\nwhile Q:\\n\\n i = Q.pop()\\n\\n for a in X[i][::-1]:\\n\\n if a != P[i]:\\n\\n P[a] = i\\n\\n DE[a] = DE[i] + 1\\n\\n X[a].remove(i)\\n\\n Q.append(a)\\n\\n\\n\\ndef lp(u, v):\\n\\n t = 0\\n\\n while u != v:\\n\\n if DE[u] > DE[v]:\\n\\n t += 1 << u-1\\n\\n u = P[u]\\n\\n elif DE[u] < DE[v]:\\n\\n t += 1 << v-1\\n\\n v = P[v]\\n\\n else:\\n\\n t += 1 << u-1\\n\\n t += 1 << v-1\\n\\n u = P[u]\\n\\n v = P[v]\\n\\n \\n\\n return t\\n\\n\\n\\nY = []\\n\\nM = int(eval(input()))\\n\\nfor _ in range(M):\\n\\n a, b = list(map(int, input().split()))\\n\\n a, b = a-1, b-1\\n\\n Y.append(lp(a, b))\\n\\n\\n\\ndef popcnt(n):\\n\\n c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555)\\n\\n c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333)\\n\\n c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f)\\n\\n c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff)\\n\\n c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff)\\n\\n c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff)\\n\\n return c\\n\\n\\n\\nD = {1< DE[v]:\\n t += 1 << u - 1\\n u = P[u]\\n elif DE[u] < DE[v]:\\n t += 1 << v - 1\\n v = P[v]\\n else:\\n t += 1 << u - 1\\n t += 1 << v - 1\\n u = P[u]\\n v = P[v]\\n return t\\n\\n\\nY = []\\nM = int(eval(input()))\\nfor _ in range(M):\\n a, b = list(map(int, input().split()))\\n a, b = a - 1, b - 1\\n Y.append(lp(a, b))\\nD = {1 << i: i for i in range(50)}\\nZ = [0] * (1 << M)\\nans = 0\\nCC = [0] * N\\nBC = [0] * (1 << 17)\\nfor m in range(1, 1 << 17):\\n a = m & (-m)\\n BC[m] = BC[m ^ a] + 1\\nfor m in range(1 << M):\\n a = m & (-m)\\n if a == m:\\n if a == 0:\\n Z[m] = 0\\n else:\\n Z[m] = Y[D[a]]\\n else:\\n Z[m] = Z[m ^ a] | Y[D[a]]\\n aa = Z[m]\\n bc = BC[aa % (1 << 17)]\\n aa >>= 17\\n bc += BC[aa % (1 << 17)]\\n aa >>= 17\\n bc += BC[aa]\\n CC[N - 1 - bc] += 1 if BC[m % 1024] + BC[m >> 10] & 1 == 0 else -1\\nprint((sum([2**i * CC[i] for i in range(N)])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nX = [[] for i in range(N)]\\nfor i in range(N - 1):\\n x, y = list(map(int, input().split()))\\n X[x - 1].append(y - 1)\\n X[y - 1].append(x - 1)\\nP = [-1] * N\\nDE = [0] * N\\nQ = [0]\\nwhile Q:\\n i = Q.pop()\\n for a in X[i][::-1]:\\n if a != P[i]:\\n P[a] = i\\n DE[a] = DE[i] + 1\\n X[a].remove(i)\\n Q.append(a)\\n\\n\\ndef lp(u, v):\\n t = 0\\n while u != v:\\n if DE[u] > DE[v]:\\n t += 1 << u - 1\\n u = P[u]\\n elif DE[u] < DE[v]:\\n t += 1 << v - 1\\n v = P[v]\\n else:\\n t += 1 << u - 1\\n t += 1 << v - 1\\n u = P[u]\\n v = P[v]\\n return t\\n\\n\\nY = []\\nM = int(eval(input()))\\nfor _ in range(M):\\n a, b = list(map(int, input().split()))\\n a, b = a - 1, b - 1\\n Y.append(lp(a, b))\\n\\n\\ndef popcnt(n):\\n c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)\\n c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)\\n c = (c & 0x0F0F0F0F0F0F0F0F) + ((c >> 4) & 0x0F0F0F0F0F0F0F0F)\\n c = (c & 0x00FF00FF00FF00FF) + ((c >> 8) & 0x00FF00FF00FF00FF)\\n c = (c & 0x0000FFFF0000FFFF) + ((c >> 16) & 0x0000FFFF0000FFFF)\\n c = (c & 0x00000000FFFFFFFF) + ((c >> 32) & 0x00000000FFFFFFFF)\\n return c\\n\\n\\nD = {1 << i: i for i in range(50)}\\nZ = [0] * (1 << M)\\nans = 0\\nCC = [0] * N\\nfor m in range(1 << M):\\n a = m & (-m)\\n if a == m:\\n if a == 0:\\n Z[m] = 0\\n else:\\n Z[m] = Y[D[a]]\\n else:\\n Z[m] = Z[m ^ a] | Y[D[a]]\\n CC[N - 1 - popcnt(Z[m])] += 1 if popcnt(m) & 1 == 0 else -1\\nprint((sum([2**i * CC[i] for i in range(N)])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 1.4285714286,\n", + " 'diff': ['+',\n", + " '+',\n", + " '+def popcnt(n):',\n", + " '+ c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)',\n", + " '+ c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)',\n", + " '+ c = (c & 0x0F0F0F0F0F0F0F0F) + ((c >> 4) & 0x0F0F0F0F0F0F0F0F)',\n", + " '+ c = (c & 0x00FF00FF00FF00FF) + ((c >> 8) & 0x00FF00FF00FF00FF)',\n", + " '+ c = (c & 0x0000FFFF0000FFFF) + ((c >> 16) & 0x0000FFFF0000FFFF)',\n", + " '+ c = (c & 0x00000000FFFFFFFF) + ((c >> 32) & 0x00000000FFFFFFFF)',\n", + " '+ return c',\n", + " '+',\n", + " '+',\n", + " '-BC = [0] * (1 << 17)',\n", + " '-for m in range(1, 1 << 17):',\n", + " '- a = m & (-m)',\n", + " '- BC[m] = BC[m ^ a] + 1',\n", + " '- aa = Z[m]',\n", + " '- bc = BC[aa % (1 << 17)]',\n", + " '- aa >>= 17',\n", + " '- bc += BC[aa % (1 << 17)]',\n", + " '- aa >>= 17',\n", + " '- bc += BC[aa]',\n", + " '- CC[N - 1 - bc] += 1 if BC[m % 1024] + BC[m >> 10] & 1 == 0 else -1',\n", + " '+ CC[N - 1 - popcnt(Z[m])] += 1 if popcnt(m) & 1 == 0 else -1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4825011034,\n", + " 'measured_runtime_v1': 0.2223737774,\n", + " 'runtime_lift': 2.1697751823,\n", + " 'key': ['s167224132', 's245735210']},\n", + " {'user_id': 'u135454978',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's681762997',\n", + " 'submission_id_v1': 's948041496',\n", + " 'cpu_time_v0': 154,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.96,\n", + " 'input': '# AtCoder Beginner Contest 095 C - Half and Half\\n\\nimport sys\\n\\n\\n\\nA, B, C, X, Y = list(map(int, sys.stdin.readline().strip().split()))\\n\\n\\n\\nans = A * X + B * Y\\n\\nfor z in range(2, 2 * 10 ** 5 + 1, 2):\\n\\n x = max(X - int(z / 2), 0)\\n\\n y = max(Y - int(z / 2), 0)\\n\\n\\n\\n price = A * x + B * y + C * z\\n\\n ans = min(price, ans)\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': '# AtCoder Beginner Contest 095 C - Half and Half\\n\\nimport sys\\n\\n\\n\\nA, B, C, X, Y = list(map(int, sys.stdin.readline().strip().split()))\\n\\n\\n\\n\"\"\"\\n\\nans = A * X + B * Y\\n\\nfor z in range(2, 2 * 10 ** 5 + 1, 2):\\n\\n x = max(X - int(z / 2), 0)\\n\\n y = max(Y - int(z / 2), 0)\\n\\n\\n\\n price = A * x + B * y + C * z\\n\\n ans = min(price, ans)\\n\\n\\n\\nprint(ans)\\n\\n\"\"\"\\n\\n\\n\\nprice1 = A * X + B * Y\\n\\nprice2 = C * 2 * X + B * max(Y - X, 0)\\n\\nprice3 = A * max(X - Y, 0) + C * 2 * Y\\n\\nprint((min(price1, price2, price3)))\\n\\n\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 332,\n", + " 'code_v1_num_chars': 486,\n", + " 'code_v0_no_empty_lines': '# AtCoder Beginner Contest 095 C - Half and Half\\nimport sys\\n\\nA, B, C, X, Y = list(map(int, sys.stdin.readline().strip().split()))\\nans = A * X + B * Y\\nfor z in range(2, 2 * 10**5 + 1, 2):\\n x = max(X - int(z / 2), 0)\\n y = max(Y - int(z / 2), 0)\\n price = A * x + B * y + C * z\\n ans = min(price, ans)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# AtCoder Beginner Contest 095 C - Half and Half\\nimport sys\\n\\nA, B, C, X, Y = list(map(int, sys.stdin.readline().strip().split()))\\n\"\"\"\\nans = A * X + B * Y\\nfor z in range(2, 2 * 10 ** 5 + 1, 2):\\n x = max(X - int(z / 2), 0)\\n y = max(Y - int(z / 2), 0)\\n price = A * x + B * y + C * z\\n ans = min(price, ans)\\nprint(ans)\\n\"\"\"\\nprice1 = A * X + B * Y\\nprice2 = C * 2 * X + B * max(Y - X, 0)\\nprice3 = A * max(X - Y, 0) + C * 2 * Y\\nprint((min(price1, price2, price3)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.3636363636,\n", + " 'diff': ['+\"\"\"',\n", + " '-for z in range(2, 2 * 10**5 + 1, 2):',\n", + " '+for z in range(2, 2 * 10 ** 5 + 1, 2):',\n", + " '+\"\"\"',\n", + " '+price1 = A * X + B * Y',\n", + " '+price2 = C * 2 * X + B * max(Y - X, 0)',\n", + " '+price3 = A * max(X - Y, 0) + C * 2 * Y',\n", + " '+print((min(price1, price2, price3)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7125969741,\n", + " 'measured_runtime_v1': 0.2827094927,\n", + " 'runtime_lift': 6.0577979106,\n", + " 'key': ['s681762997', 's948041496']},\n", + " {'user_id': 'u936985471',\n", + " 'problem_id': 'p03608',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's080314510',\n", + " 'submission_id_v1': 's650231829',\n", + " 'cpu_time_v0': 661,\n", + " 'cpu_time_v1': 174,\n", + " 'memory_v0': 18216,\n", + " 'memory_v1': 74412,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 73.68,\n", + " 'input': '# ワーシャルフロイドで、各町間の最短距離の更新は200^3 = 8,000,000\\n\\n# 訪れるべき町Rはたかだか8個なので、順番の全通りを試して8! = 約40000通り\\n\\n\\n\\nimport numpy as np\\n\\nfrom scipy.sparse.csgraph import shortest_path, floyd_warshall\\n\\nfrom scipy.sparse import csr_matrix\\n\\n\\n\\nN,M,R = list(map(int,input().split()))\\n\\nr = list(map(int,input().split()))\\n\\nr = list([x-1 for x in r])\\n\\n\\n\\nE = [[0 for j in range(N)] for i in range(N)]\\n\\nfor i in range(M):\\n\\n a,b,c = list(map(int,input().split()))\\n\\n E[a-1][b-1] = c\\n\\n E[b-1][a-1] = c\\n\\n\\n\\nE = np.array(E)\\n\\nE = shortest_path(E,method = \"FW\")\\n\\n\\n\\n# DFSですべての数を試す\\n\\nstack = []\\n\\nfor i in range(len(r)):\\n\\n stack.append([r[i],[],0])\\n\\nans = 10 ** 18\\n\\nwhile stack:\\n\\n v,visited,dist = stack.pop()\\n\\n if len(visited) != 0:\\n\\n dist += E[visited[-1]][v]\\n\\n visited2 = visited.copy()\\n\\n visited2.append(v)\\n\\n if len(visited2) == len(r):\\n\\n if dist < ans:\\n\\n ans = dist\\n\\n continue\\n\\n for i in range(len(r)):\\n\\n if r[i] not in visited2:\\n\\n stack.append([r[i],visited2,dist])\\n\\n \\n\\nprint((int(ans)))',\n", + " 'target': 'import sys\\n\\nreadline = sys.stdin.readline\\n\\n\\n\\nN,M,R = list(map(int,readline().split()))\\n\\nr = list(map(int,readline().split()))\\n\\nINF = 10 ** 10\\n\\n\\n\\nG = [[INF] * N for i in range(N)]\\n\\nfor i in range(M):\\n\\n a,b,c = list(map(int,readline().split()))\\n\\n G[a - 1][b - 1] = c\\n\\n G[b - 1][a - 1] = c\\n\\n \\n\\nfor i in range(N):\\n\\n G[i][i] = 0\\n\\n \\n\\nfor k in range(N):\\n\\n for i in range(N):\\n\\n for j in range(N):\\n\\n G[i][j] = min(G[i][j], G[i][k] + G[k][j])\\n\\n \\n\\nimport itertools\\n\\nans = INF\\n\\nfor perm in itertools.permutations(list(range(R))):\\n\\n dist = 0\\n\\n for i in range(1, len(perm)):\\n\\n dist += G[r[perm[i - 1]] - 1][r[perm[i]] - 1]\\n\\n if ans > dist:\\n\\n ans = dist\\n\\n \\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 40,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 969,\n", + " 'code_v1_num_chars': 668,\n", + " 'code_v0_no_empty_lines': '# ワーシャルフロイドで、各町間の最短距離の更新は200^3 = 8,000,000\\n# 訪れるべき町Rはたかだか8個なので、順番の全通りを試して8! = 約40000通り\\nimport numpy as np\\nfrom scipy.sparse.csgraph import shortest_path, floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nN, M, R = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nr = list([x - 1 for x in r])\\nE = [[0 for j in range(N)] for i in range(N)]\\nfor i in range(M):\\n a, b, c = list(map(int, input().split()))\\n E[a - 1][b - 1] = c\\n E[b - 1][a - 1] = c\\nE = np.array(E)\\nE = shortest_path(E, method=\"FW\")\\n# DFSですべての数を試す\\nstack = []\\nfor i in range(len(r)):\\n stack.append([r[i], [], 0])\\nans = 10**18\\nwhile stack:\\n v, visited, dist = stack.pop()\\n if len(visited) != 0:\\n dist += E[visited[-1]][v]\\n visited2 = visited.copy()\\n visited2.append(v)\\n if len(visited2) == len(r):\\n if dist < ans:\\n ans = dist\\n continue\\n for i in range(len(r)):\\n if r[i] not in visited2:\\n stack.append([r[i], visited2, dist])\\nprint((int(ans)))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nreadline = sys.stdin.readline\\nN, M, R = list(map(int, readline().split()))\\nr = list(map(int, readline().split()))\\nINF = 10**10\\nG = [[INF] * N for i in range(N)]\\nfor i in range(M):\\n a, b, c = list(map(int, readline().split()))\\n G[a - 1][b - 1] = c\\n G[b - 1][a - 1] = c\\nfor i in range(N):\\n G[i][i] = 0\\nfor k in range(N):\\n for i in range(N):\\n for j in range(N):\\n G[i][j] = min(G[i][j], G[i][k] + G[k][j])\\nimport itertools\\n\\nans = INF\\nfor perm in itertools.permutations(list(range(R))):\\n dist = 0\\n for i in range(1, len(perm)):\\n dist += G[r[perm[i - 1]] - 1][r[perm[i]] - 1]\\n if ans > dist:\\n ans = dist\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 22.5,\n", + " 'diff': ['-# ワーシャルフロイドで、各町間の最短距離の更新は200^3 = 8,000,000',\n", + " '-# 訪れるべき町Rはたかだか8個なので、順番の全通りを試して8! = 約40000通り',\n", + " '-import numpy as np',\n", + " '-from scipy.sparse.csgraph import shortest_path, floyd_warshall',\n", + " '-from scipy.sparse import csr_matrix',\n", + " '+import sys',\n", + " '-N, M, R = list(map(int, input().split()))',\n", + " '-r = list(map(int, input().split()))',\n", + " '-r = list([x - 1 for x in r])',\n", + " '-E = [[0 for j in range(N)] for i in range(N)]',\n", + " '+readline = sys.stdin.readline',\n", + " '+N, M, R = list(map(int, readline().split()))',\n", + " '+r = list(map(int, readline().split()))',\n", + " '+INF = 10**10',\n", + " '+G = [[INF] * N for i in range(N)]',\n", + " '- a, b, c = list(map(int, input().split()))',\n", + " '- E[a - 1][b - 1] = c',\n", + " '- E[b - 1][a - 1] = c',\n", + " '-E = np.array(E)',\n", + " '-E = shortest_path(E, method=\"FW\")',\n", + " '-# DFSですべての数を試す',\n", + " '-stack = []',\n", + " '-for i in range(len(r)):',\n", + " '- stack.append([r[i], [], 0])',\n", + " '-ans = 10**18',\n", + " '-while stack:',\n", + " '- v, visited, dist = stack.pop()',\n", + " '- if len(visited) != 0:',\n", + " '- dist += E[visited[-1]][v]',\n", + " '- visited2 = visited.copy()',\n", + " '- visited2.append(v)',\n", + " '- if len(visited2) == len(r):',\n", + " '- if dist < ans:',\n", + " '- ans = dist',\n", + " '- continue',\n", + " '- for i in range(len(r)):',\n", + " '- if r[i] not in visited2:',\n", + " '- stack.append([r[i], visited2, dist])',\n", + " '-print((int(ans)))',\n", + " '+ a, b, c = list(map(int, readline().split()))',\n", + " '+ G[a - 1][b - 1] = c',\n", + " '+ G[b - 1][a - 1] = c',\n", + " '+for i in range(N):',\n", + " '+ G[i][i] = 0',\n", + " '+for k in range(N):',\n", + " '+ for i in range(N):',\n", + " '+ for j in range(N):',\n", + " '+ G[i][j] = min(G[i][j], G[i][k] + G[k][j])',\n", + " '+import itertools',\n", + " '+',\n", + " '+ans = INF',\n", + " '+for perm in itertools.permutations(list(range(R))):',\n", + " '+ dist = 0',\n", + " '+ for i in range(1, len(perm)):',\n", + " '+ dist += G[r[perm[i - 1]] - 1][r[perm[i]] - 1]',\n", + " '+ if ans > dist:',\n", + " '+ ans = dist',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8536462879,\n", + " 'measured_runtime_v1': 0.2095541062,\n", + " 'runtime_lift': 8.8456691264,\n", + " 'key': ['s080314510', 's650231829']},\n", + " {'user_id': 'u337765821',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's578367863',\n", + " 'submission_id_v1': 's821092078',\n", + " 'cpu_time_v0': 1959,\n", + " 'cpu_time_v1': 1759,\n", + " 'memory_v0': 14660,\n", + " 'memory_v1': 4712,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.21,\n", + " 'input': \"import numpy as np\\n\\nimport itertools\\n\\n\\n\\nX, Y, Z, K = tuple([int(x) for x in str(eval(input())).split(' ')])\\n\\n\\n\\nA = np.array(sorted([int(x) for x in str(eval(input())).split(' ')], reverse=True))\\n\\nB = np.array(sorted([int(x) for x in str(eval(input())).split(' ')], reverse=True))\\n\\nC = np.array(sorted([int(x) for x in str(eval(input())).split(' ')], reverse=True))\\n\\n\\n\\ntmp = {(0, 0, 0) : A[0] + B[0] + C[0]}\\n\\ntmp_keys = [(0, 0 ,0)]\\n\\nout = []\\n\\n\\n\\nfor i in range(K):\\n\\n (a, b, c), p = max(list(tmp.items()), key=lambda x : x[1])\\n\\n out.append(tmp.pop((a, b, c)))\\n\\n\\n\\n keys = []\\n\\n if a < X - 1:\\n\\n keys.append((a+1, b, c))\\n\\n if b < Y - 1:\\n\\n keys.append((a, b+1, c))\\n\\n if c < Z - 1:\\n\\n keys.append((a, b, c+1))\\n\\n \\n\\n for key in keys:\\n\\n if key not in tmp_keys:\\n\\n tmp[key] = A[key[0]] + B[key[1]] + C[key[2]]\\n\\n tmp_keys.append(key)\\n\\n\\n\\nfor x in out:\\n\\n print(x)\",\n", + " 'target': \"import itertools\\n\\n\\n\\nX, Y, Z, K = tuple([int(x) for x in str(eval(input())).split(' ')])\\n\\n\\n\\nA = sorted([int(x) for x in str(eval(input())).split(' ')], reverse=True)\\n\\nB = sorted([int(x) for x in str(eval(input())).split(' ')], reverse=True)\\n\\nC = sorted([int(x) for x in str(eval(input())).split(' ')], reverse=True)\\n\\n\\n\\ntmp = {(0, 0, 0) : A[0] + B[0] + C[0]}\\n\\ntmp_keys = [(0, 0 ,0)]\\n\\nout = []\\n\\n\\n\\nfor i in range(K):\\n\\n (a, b, c), p = max(list(tmp.items()), key=lambda x : x[1])\\n\\n out.append(tmp.pop((a, b, c)))\\n\\n\\n\\n keys = []\\n\\n if a < X - 1:\\n\\n keys.append((a+1, b, c))\\n\\n if b < Y - 1:\\n\\n keys.append((a, b+1, c))\\n\\n if c < Z - 1:\\n\\n keys.append((a, b, c+1))\\n\\n \\n\\n for key in keys:\\n\\n if key not in tmp_keys:\\n\\n tmp[key] = A[key[0]] + B[key[1]] + C[key[2]]\\n\\n tmp_keys.append(key)\\n\\n\\n\\nfor x in out:\\n\\n print(x)\",\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 893,\n", + " 'code_v1_num_chars': 843,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\nimport itertools\\n\\nX, Y, Z, K = tuple([int(x) for x in str(eval(input())).split(\" \")])\\nA = np.array(sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True))\\nB = np.array(sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True))\\nC = np.array(sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True))\\ntmp = {(0, 0, 0): A[0] + B[0] + C[0]}\\ntmp_keys = [(0, 0, 0)]\\nout = []\\nfor i in range(K):\\n (a, b, c), p = max(list(tmp.items()), key=lambda x: x[1])\\n out.append(tmp.pop((a, b, c)))\\n keys = []\\n if a < X - 1:\\n keys.append((a + 1, b, c))\\n if b < Y - 1:\\n keys.append((a, b + 1, c))\\n if c < Z - 1:\\n keys.append((a, b, c + 1))\\n for key in keys:\\n if key not in tmp_keys:\\n tmp[key] = A[key[0]] + B[key[1]] + C[key[2]]\\n tmp_keys.append(key)\\nfor x in out:\\n print(x)\\n',\n", + " 'code_v1_no_empty_lines': 'import itertools\\n\\nX, Y, Z, K = tuple([int(x) for x in str(eval(input())).split(\" \")])\\nA = sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True)\\nB = sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True)\\nC = sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True)\\ntmp = {(0, 0, 0): A[0] + B[0] + C[0]}\\ntmp_keys = [(0, 0, 0)]\\nout = []\\nfor i in range(K):\\n (a, b, c), p = max(list(tmp.items()), key=lambda x: x[1])\\n out.append(tmp.pop((a, b, c)))\\n keys = []\\n if a < X - 1:\\n keys.append((a + 1, b, c))\\n if b < Y - 1:\\n keys.append((a, b + 1, c))\\n if c < Z - 1:\\n keys.append((a, b, c + 1))\\n for key in keys:\\n if key not in tmp_keys:\\n tmp[key] = A[key[0]] + B[key[1]] + C[key[2]]\\n tmp_keys.append(key)\\nfor x in out:\\n print(x)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.125,\n", + " 'diff': ['-import numpy as np',\n", + " '-A = np.array(sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True))',\n", + " '-B = np.array(sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True))',\n", + " '-C = np.array(sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True))',\n", + " '+A = sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True)',\n", + " '+B = sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True)',\n", + " '+C = sorted([int(x) for x in str(eval(input())).split(\" \")], reverse=True)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3399388783,\n", + " 'measured_runtime_v1': 0.2194988892,\n", + " 'runtime_lift': 6.1045360324,\n", + " 'key': ['s578367863', 's821092078']},\n", + " {'user_id': 'u632413369',\n", + " 'problem_id': 'p02595',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's512106161',\n", + " 'submission_id_v1': 's251902862',\n", + " 'cpu_time_v0': 491,\n", + " 'cpu_time_v1': 390,\n", + " 'memory_v0': 9080,\n", + " 'memory_v1': 9188,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.57,\n", + " 'input': 'N, D = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor _ in range(N):\\n\\n x, y = list(map(int, input().split()))\\n\\n if x ** 2 + y ** 2 <= D ** 2:\\n\\n cnt += 1\\n\\n \\n\\nprint(cnt)',\n", + " 'target': 'N, D = list(map(int, input().split()))\\n\\ncnt = 0\\n\\nfor _ in range(N):\\n\\n x, y = list(map(int, input().split()))\\n\\n if x * x + y * y <= D * D:\\n\\n cnt += 1\\n\\n \\n\\nprint(cnt)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 174,\n", + " 'code_v1_num_chars': 171,\n", + " 'code_v0_no_empty_lines': 'N, D = list(map(int, input().split()))\\ncnt = 0\\nfor _ in range(N):\\n x, y = list(map(int, input().split()))\\n if x**2 + y**2 <= D**2:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'N, D = list(map(int, input().split()))\\ncnt = 0\\nfor _ in range(N):\\n x, y = list(map(int, input().split()))\\n if x * x + y * y <= D * D:\\n cnt += 1\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- if x**2 + y**2 <= D**2:', '+ if x * x + y * y <= D * D:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1756704731,\n", + " 'measured_runtime_v1': 0.0073727348,\n", + " 'runtime_lift': 23.8270435573,\n", + " 'key': ['s512106161', 's251902862']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p03013',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's826622254',\n", + " 'submission_id_v1': 's766798908',\n", + " 'cpu_time_v0': 66,\n", + " 'cpu_time_v1': 55,\n", + " 'memory_v0': 20944,\n", + " 'memory_v1': 20944,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 16.67,\n", + " 'input': 'import sys\\n\\n\\n\\nmod = 10 ** 9 + 7\\n\\nn, m, *a = [int(x) for x in sys.stdin.read().split()]\\n\\n\\n\\nsafe = sorted(set(range(1,n+1)) - set(a))\\n\\ndp = [0] * (n + 2)\\n\\ndp[0] = 0\\n\\ndp[1] = 1\\n\\nfor i in safe:\\n\\n dp[i+1] = (dp[i] + dp[i-1]) % mod\\n\\n\\n\\nprint((dp[-1]))',\n", + " 'target': '\\n\\n# 2019-11-14 10:01:24(JST)\\n\\nimport sys\\n\\n# import collections\\n\\n# import math\\n\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\n\\n# import itertools\\n\\n# from functools import reduce\\n\\n# import operator as op\\n\\n# from scipy.misc import comb # float\\n\\n# import numpy as np \\n\\n\\n\\nmod = 10 ** 9 + 7\\n\\ndef main():\\n\\n n, m, *a = [int(x) for x in sys.stdin.read().split()]\\n\\n\\n\\n safe = sorted(set(range(1,n+1)) - set(a))\\n\\n dp = [0] * (n + 2) # dp[i+1]: i段目までいくパターン数\\n\\n dp[0] = 0 # -1段目にはいけない\\n\\n dp[1] = 1 # 初期条件(0段目にいる)\\n\\n for i in safe:\\n\\n dp[i+1] = (dp[i] + dp[i-1]) % mod\\n\\n\\n\\n print((dp[-1]))\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 28,\n", + " 'code_v0_num_chars': 245,\n", + " 'code_v1_num_chars': 720,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nmod = 10**9 + 7\\nn, m, *a = [int(x) for x in sys.stdin.read().split()]\\nsafe = sorted(set(range(1, n + 1)) - set(a))\\ndp = [0] * (n + 2)\\ndp[0] = 0\\ndp[1] = 1\\nfor i in safe:\\n dp[i + 1] = (dp[i] + dp[i - 1]) % mod\\nprint((dp[-1]))\\n',\n", + " 'code_v1_no_empty_lines': '# 2019-11-14 10:01:24(JST)\\nimport sys\\n\\n# import collections\\n# import math\\n# from string import ascii_lowercase, ascii_uppercase, digits\\n# from bisect import bisect_left as bi_l, bisect_right as bi_r\\n# import itertools\\n# from functools import reduce\\n# import operator as op\\n# from scipy.misc import comb # float\\n# import numpy as np\\nmod = 10**9 + 7\\n\\n\\ndef main():\\n n, m, *a = [int(x) for x in sys.stdin.read().split()]\\n safe = sorted(set(range(1, n + 1)) - set(a))\\n dp = [0] * (n + 2) # dp[i+1]: i段目までいくパターン数\\n dp[0] = 0 # -1段目にはいけない\\n dp[1] = 1 # 初期条件(0段目にいる)\\n for i in safe:\\n dp[i + 1] = (dp[i] + dp[i - 1]) % mod\\n print((dp[-1]))\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 53.5714285714,\n", + " 'diff': ['+# 2019-11-14 10:01:24(JST)',\n", + " '+# import collections',\n", + " '+# import math',\n", + " '+# from string import ascii_lowercase, ascii_uppercase, digits',\n", + " '+# from bisect import bisect_left as bi_l, bisect_right as bi_r',\n", + " '+# import itertools',\n", + " '+# from functools import reduce',\n", + " '+# import operator as op',\n", + " '+# from scipy.misc import comb # float',\n", + " '+# import numpy as np',\n", + " '-n, m, *a = [int(x) for x in sys.stdin.read().split()]',\n", + " '-safe = sorted(set(range(1, n + 1)) - set(a))',\n", + " '-dp = [0] * (n + 2)',\n", + " '-dp[0] = 0',\n", + " '-dp[1] = 1',\n", + " '-for i in safe:',\n", + " '- dp[i + 1] = (dp[i] + dp[i - 1]) % mod',\n", + " '-print((dp[-1]))',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ n, m, *a = [int(x) for x in sys.stdin.read().split()]',\n", + " '+ safe = sorted(set(range(1, n + 1)) - set(a))',\n", + " '+ dp = [0] * (n + 2) # dp[i+1]: i段目までいくパターン数',\n", + " '+ dp[0] = 0 # -1段目にはいけない',\n", + " '+ dp[1] = 1 # 初期条件(0段目にいる)',\n", + " '+ for i in safe:',\n", + " '+ dp[i + 1] = (dp[i] + dp[i - 1]) % mod',\n", + " '+ print((dp[-1]))',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2316791441,\n", + " 'measured_runtime_v1': 0.0060535467,\n", + " 'runtime_lift': 38.2716375213,\n", + " 'key': ['s826622254', 's766798908']},\n", + " {'user_id': 'u994988729',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's376874744',\n", + " 'submission_id_v1': 's887269917',\n", + " 'cpu_time_v0': 337,\n", + " 'cpu_time_v1': 135,\n", + " 'memory_v0': 16640,\n", + " 'memory_v1': 9800,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.94,\n", + " 'input': 'from collections import Counter\\n\\nS = input()[::-1]\\n\\n\\n\\nmemo = [0]\\n\\nd = 0\\n\\nmod = 2019\\n\\n\\n\\nfor s in S:\\n\\n tmp = int(s) * pow(10, d, mod) % mod\\n\\n tmp = memo[-1] + tmp\\n\\n memo.append(tmp % mod)\\n\\n d += 1\\n\\n\\n\\nc = Counter(memo)\\n\\nans = sum(v * (v - 1) // 2 for v in list(c.values()))\\n\\nprint(ans)',\n", + " 'target': 'from collections import defaultdict\\n\\nS = eval(input())\\n\\nN = len(S)\\n\\n\\n\\nmemo = defaultdict(int)\\n\\nmemo[0] += 1\\n\\n\\n\\nmod = 2019\\n\\nd = 1\\n\\nval = 0\\n\\n\\n\\nfor s in S[::-1]:\\n\\n s = int(s)\\n\\n val += s * d\\n\\n val %= mod\\n\\n memo[val] += 1\\n\\n d *= 10\\n\\n d %= mod\\n\\n\\n\\nprint((sum(v * (v - 1) // 2 for v in list(memo.values()))))',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 20,\n", + " 'code_v0_num_chars': 288,\n", + " 'code_v1_num_chars': 304,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\n\\nS = input()[::-1]\\nmemo = [0]\\nd = 0\\nmod = 2019\\nfor s in S:\\n tmp = int(s) * pow(10, d, mod) % mod\\n tmp = memo[-1] + tmp\\n memo.append(tmp % mod)\\n d += 1\\nc = Counter(memo)\\nans = sum(v * (v - 1) // 2 for v in list(c.values()))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\nS = eval(input())\\nN = len(S)\\nmemo = defaultdict(int)\\nmemo[0] += 1\\nmod = 2019\\nd = 1\\nval = 0\\nfor s in S[::-1]:\\n s = int(s)\\n val += s * d\\n val %= mod\\n memo[val] += 1\\n d *= 10\\n d %= mod\\nprint((sum(v * (v - 1) // 2 for v in list(memo.values()))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['-from collections import Counter',\n", + " '+from collections import defaultdict',\n", + " '-S = input()[::-1]',\n", + " '-memo = [0]',\n", + " '-d = 0',\n", + " '+S = eval(input())',\n", + " '+N = len(S)',\n", + " '+memo = defaultdict(int)',\n", + " '+memo[0] += 1',\n", + " '-for s in S:',\n", + " '- tmp = int(s) * pow(10, d, mod) % mod',\n", + " '- tmp = memo[-1] + tmp',\n", + " '- memo.append(tmp % mod)',\n", + " '- d += 1',\n", + " '-c = Counter(memo)',\n", + " '-ans = sum(v * (v - 1) // 2 for v in list(c.values()))',\n", + " '-print(ans)',\n", + " '+d = 1',\n", + " '+val = 0',\n", + " '+for s in S[::-1]:',\n", + " '+ s = int(s)',\n", + " '+ val += s * d',\n", + " '+ val %= mod',\n", + " '+ memo[val] += 1',\n", + " '+ d *= 10',\n", + " '+ d %= mod',\n", + " '+print((sum(v * (v - 1) // 2 for v in list(memo.values()))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2615414739,\n", + " 'measured_runtime_v1': 0.0063235409,\n", + " 'runtime_lift': 41.3599716541,\n", + " 'key': ['s376874744', 's887269917']},\n", + " {'user_id': 'u242518667',\n", + " 'problem_id': 'p03424',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's488879497',\n", + " 'submission_id_v1': 's152130126',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.0,\n", + " 'input': \"n=int(eval(input()))\\n\\ns=list(map(str,input().split()))\\n\\ntotal=[]\\n\\nfor i in range(n):\\n\\n if s[i] not in total:\\n\\n total.append(s[i])\\n\\nprint(('Three' if len(total)==3 else 'Four'))\",\n", + " 'target': \"eval(input())\\n\\nl=list(map(str,input().split()))\\n\\nprint(('Three' if len(set(l))==3 else 'Four'))\",\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 178,\n", + " 'code_v1_num_chars': 81,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\ns = list(map(str, input().split()))\\ntotal = []\\nfor i in range(n):\\n if s[i] not in total:\\n total.append(s[i])\\nprint((\"Three\" if len(total) == 3 else \"Four\"))\\n',\n", + " 'code_v1_no_empty_lines': 'eval(input())\\nl = list(map(str, input().split()))\\nprint((\"Three\" if len(set(l)) == 3 else \"Four\"))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 57.1428571429,\n", + " 'diff': ['-n = int(eval(input()))',\n", + " '-s = list(map(str, input().split()))',\n", + " '-total = []',\n", + " '-for i in range(n):',\n", + " '- if s[i] not in total:',\n", + " '- total.append(s[i])',\n", + " '-print((\"Three\" if len(total) == 3 else \"Four\"))',\n", + " '+eval(input())',\n", + " '+l = list(map(str, input().split()))',\n", + " '+print((\"Three\" if len(set(l)) == 3 else \"Four\"))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3119253957,\n", + " 'measured_runtime_v1': 0.2361336248,\n", + " 'runtime_lift': 1.3209698364,\n", + " 'key': ['s488879497', 's152130126']},\n", + " {'user_id': 'u927807968',\n", + " 'problem_id': 'p02777',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's786603084',\n", + " 'submission_id_v1': 's913426920',\n", + " 'cpu_time_v0': 19,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.53,\n", + " 'input': 'S, T = input().split()\\n\\nA, B= list(map(int, input().split()))\\n\\nU = eval(input())\\n\\nif S == U:\\n\\n print((A - 1, B))\\n\\nelse:\\n\\n print((A, B - 1))',\n", + " 'target': 'S, T = input().split()\\n\\nA, B= list(map(int, input().split()))\\n\\nU = eval(input())\\n\\nif S == U:\\n\\n A-=1\\n\\nelse:\\n\\n B-=1\\n\\nprint((A,B))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 129,\n", + " 'code_v1_num_chars': 119,\n", + " 'code_v0_no_empty_lines': 'S, T = input().split()\\nA, B = list(map(int, input().split()))\\nU = eval(input())\\nif S == U:\\n print((A - 1, B))\\nelse:\\n print((A, B - 1))\\n',\n", + " 'code_v1_no_empty_lines': 'S, T = input().split()\\nA, B = list(map(int, input().split()))\\nU = eval(input())\\nif S == U:\\n A -= 1\\nelse:\\n B -= 1\\nprint((A, B))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['- print((A - 1, B))',\n", + " '+ A -= 1',\n", + " '- print((A, B - 1))',\n", + " '+ B -= 1',\n", + " '+print((A, B))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2984414142,\n", + " 'measured_runtime_v1': 0.2207367195,\n", + " 'runtime_lift': 1.3520243248,\n", + " 'key': ['s786603084', 's913426920']},\n", + " {'user_id': 'u175034939',\n", + " 'problem_id': 'p03353',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's387813464',\n", + " 'submission_id_v1': 's460839958',\n", + " 'cpu_time_v0': 62,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 5068,\n", + " 'memory_v1': 5068,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 35.48,\n", + " 'input': 'S = eval(input())\\n\\nK = int(eval(input()))\\n\\na = list(set(S))\\n\\na.sort()\\n\\n\\n\\nk = []\\n\\nl = 0\\n\\nwhile l < len(a):\\n\\n for i in range(len(S)):\\n\\n if S[i] == a[l]:\\n\\n for j in range(1,6):\\n\\n if i+j <= len(S):\\n\\n k.append(S[i:i+j])\\n\\n else:\\n\\n break\\n\\n l += 1\\n\\n\\n\\nk = list(set(k))\\n\\nk.sort()\\n\\nprint((k[K-1]))',\n", + " 'target': 'S = eval(input())\\n\\nK = int(eval(input()))\\n\\na = []\\n\\nfor i in range(len(S)+1):\\n\\n for j in range(1,6):\\n\\n if i+j <= len(S):\\n\\n a.append(S[i:i+j])\\n\\n else:\\n\\n break\\n\\n \\n\\na = list(set(a))\\n\\na.sort()\\n\\nprint((a[K-1]))',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 364,\n", + " 'code_v1_num_chars': 240,\n", + " 'code_v0_no_empty_lines': 'S = eval(input())\\nK = int(eval(input()))\\na = list(set(S))\\na.sort()\\nk = []\\nl = 0\\nwhile l < len(a):\\n for i in range(len(S)):\\n if S[i] == a[l]:\\n for j in range(1, 6):\\n if i + j <= len(S):\\n k.append(S[i : i + j])\\n else:\\n break\\n l += 1\\nk = list(set(k))\\nk.sort()\\nprint((k[K - 1]))\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nK = int(eval(input()))\\na = []\\nfor i in range(len(S) + 1):\\n for j in range(1, 6):\\n if i + j <= len(S):\\n a.append(S[i : i + j])\\n else:\\n break\\na = list(set(a))\\na.sort()\\nprint((a[K - 1]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 35.0,\n", + " 'diff': ['-a = list(set(S))',\n", + " '+a = []',\n", + " '+for i in range(len(S) + 1):',\n", + " '+ for j in range(1, 6):',\n", + " '+ if i + j <= len(S):',\n", + " '+ a.append(S[i : i + j])',\n", + " '+ else:',\n", + " '+ break',\n", + " '+a = list(set(a))',\n", + " '-k = []',\n", + " '-l = 0',\n", + " '-while l < len(a):',\n", + " '- for i in range(len(S)):',\n", + " '- if S[i] == a[l]:',\n", + " '- for j in range(1, 6):',\n", + " '- if i + j <= len(S):',\n", + " '- k.append(S[i : i + j])',\n", + " '- else:',\n", + " '- break',\n", + " '- l += 1',\n", + " '-k = list(set(k))',\n", + " '-k.sort()',\n", + " '-print((k[K - 1]))',\n", + " '+print((a[K - 1]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3274912031,\n", + " 'measured_runtime_v1': 0.2526222069,\n", + " 'runtime_lift': 1.2963674375,\n", + " 'key': ['s387813464', 's460839958']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03363',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's190694143',\n", + " 'submission_id_v1': 's770093154',\n", + " 'cpu_time_v0': 295,\n", + " 'cpu_time_v1': 188,\n", + " 'memory_v0': 39356,\n", + " 'memory_v1': 41444,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 36.27,\n", + " 'input': 'from collections import Counter\\n\\nimport numpy as np\\n\\n\\n\\nN = int(eval(input()))\\n\\nA = np.array(input().split(), dtype = np.int64)\\n\\n\\n\\nc = Counter(A.cumsum())\\n\\nc[0] += 1\\n\\nanswer = sum(x*(x-1)//2 for x in list(c.values()))\\n\\nprint(answer)',\n", + " 'target': 'import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nimport itertools\\n\\nfrom collections import defaultdict\\n\\n\\n\\nN,*A = list(map(int,read().split()))\\n\\n\\n\\nAcum = [0] + list(itertools.accumulate(A))\\n\\n\\n\\ncounter = defaultdict(int)\\n\\nanswer = 0\\n\\nfor x in Acum:\\n\\n answer += counter[x]\\n\\n counter[x] += 1\\n\\n\\n\\nprint(answer)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 219,\n", + " 'code_v1_num_chars': 377,\n", + " 'code_v0_no_empty_lines': 'from collections import Counter\\nimport numpy as np\\n\\nN = int(eval(input()))\\nA = np.array(input().split(), dtype=np.int64)\\nc = Counter(A.cumsum())\\nc[0] += 1\\nanswer = sum(x * (x - 1) // 2 for x in list(c.values()))\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nimport itertools\\nfrom collections import defaultdict\\n\\nN, *A = list(map(int, read().split()))\\nAcum = [0] + list(itertools.accumulate(A))\\ncounter = defaultdict(int)\\nanswer = 0\\nfor x in Acum:\\n answer += counter[x]\\n counter[x] += 1\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 47.3684210526,\n", + " 'diff': ['-from collections import Counter',\n", + " '-import numpy as np',\n", + " '+import sys',\n", + " '-N = int(eval(input()))',\n", + " '-A = np.array(input().split(), dtype=np.int64)',\n", + " '-c = Counter(A.cumsum())',\n", + " '-c[0] += 1',\n", + " '-answer = sum(x * (x - 1) // 2 for x in list(c.values()))',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '+import itertools',\n", + " '+from collections import defaultdict',\n", + " '+',\n", + " '+N, *A = list(map(int, read().split()))',\n", + " '+Acum = [0] + list(itertools.accumulate(A))',\n", + " '+counter = defaultdict(int)',\n", + " '+answer = 0',\n", + " '+for x in Acum:',\n", + " '+ answer += counter[x]',\n", + " '+ counter[x] += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3316387413,\n", + " 'measured_runtime_v1': 0.2116157196,\n", + " 'runtime_lift': 6.2927212779,\n", + " 'key': ['s190694143', 's770093154']},\n", + " {'user_id': 'u562016607',\n", + " 'problem_id': 'p03558',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's159640382',\n", + " 'submission_id_v1': 's651180421',\n", + " 'cpu_time_v0': 376,\n", + " 'cpu_time_v1': 167,\n", + " 'memory_v0': 8948,\n", + " 'memory_v1': 6060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.59,\n", + " 'input': 'import heapq\\n\\nK=int(eval(input()))\\n\\ndist=[10**15 for i in range(K)]\\n\\ndist[1]=1\\n\\nq=[]\\n\\nheapq.heappush(q,(0,1))\\n\\nwhile (len(q)!=0):\\n\\n prc,src=heapq.heappop(q)\\n\\n if dist[src]dist[src]+1:\\n\\n dist[(src+1)%K]=dist[src]+1\\n\\n heapq.heappush(q,(dist[(src+1)%K],(src+1)%K))\\n\\n if dist[(10*src)%K]>dist[src]:\\n\\n dist[(10*src)%K]=dist[src]\\n\\n heapq.heappush(q,(dist[(src*10)%K],(src*10)%K))\\n\\nprint((dist[0]))\\n',\n", + " 'target': 'from collections import deque\\n\\nK=int(eval(input()))\\n\\ndist=[10**15 for i in range(K)]\\n\\ndist[1]=1\\n\\nq=deque([1])\\n\\nwhile(len(q)>0):\\n\\n r=q.popleft()\\n\\n s=(r+1)%K\\n\\n if dist[r]+1 dist[src] + 1:\\n dist[(src + 1) % K] = dist[src] + 1\\n heapq.heappush(q, (dist[(src + 1) % K], (src + 1) % K))\\n if dist[(10 * src) % K] > dist[src]:\\n dist[(10 * src) % K] = dist[src]\\n heapq.heappush(q, (dist[(src * 10) % K], (src * 10) % K))\\nprint((dist[0]))\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import deque\\n\\nK = int(eval(input()))\\ndist = [10**15 for i in range(K)]\\ndist[1] = 1\\nq = deque([1])\\nwhile len(q) > 0:\\n r = q.popleft()\\n s = (r + 1) % K\\n if dist[r] + 1 < dist[s]:\\n dist[s] = dist[r] + 1\\n q.append(s)\\n t = (r * 10) % K\\n if dist[r] < dist[t]:\\n dist[t] = dist[r]\\n q.appendleft(t)\\nprint((dist[0]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.8823529412,\n", + " 'diff': ['-import heapq',\n", + " '+from collections import deque',\n", + " '-q = []',\n", + " '-heapq.heappush(q, (0, 1))',\n", + " '-while len(q) != 0:',\n", + " '- prc, src = heapq.heappop(q)',\n", + " '- if dist[src] < prc:',\n", + " '- continue',\n", + " '- if dist[(src + 1) % K] > dist[src] + 1:',\n", + " '- dist[(src + 1) % K] = dist[src] + 1',\n", + " '- heapq.heappush(q, (dist[(src + 1) % K], (src + 1) % K))',\n", + " '- if dist[(10 * src) % K] > dist[src]:',\n", + " '- dist[(10 * src) % K] = dist[src]',\n", + " '- heapq.heappush(q, (dist[(src * 10) % K], (src * 10) % K))',\n", + " '+q = deque([1])',\n", + " '+while len(q) > 0:',\n", + " '+ r = q.popleft()',\n", + " '+ s = (r + 1) % K',\n", + " '+ if dist[r] + 1 < dist[s]:',\n", + " '+ dist[s] = dist[r] + 1',\n", + " '+ q.append(s)',\n", + " '+ t = (r * 10) % K',\n", + " '+ if dist[r] < dist[t]:',\n", + " '+ dist[t] = dist[r]',\n", + " '+ q.appendleft(t)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4453229659,\n", + " 'measured_runtime_v1': 0.2901842129,\n", + " 'runtime_lift': 1.5346216162,\n", + " 'key': ['s159640382', 's651180421']},\n", + " {'user_id': 'u724687935',\n", + " 'problem_id': 'p02622',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's346270661',\n", + " 'submission_id_v1': 's299240564',\n", + " 'cpu_time_v0': 67,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 9408,\n", + " 'memory_v1': 9320,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 10.45,\n", + " 'input': 'S = eval(input())\\n\\nT = eval(input())\\n\\nN = len(S)\\n\\ncnt = 0\\n\\nfor i in range(N):\\n\\n cnt += (S[i] != T[i])\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'target': 'S = eval(input())\\n\\nT = eval(input())\\n\\ncnt = 0\\n\\nfor i in range(len(S)):\\n\\n cnt += (S[i] != T[i])\\n\\n\\n\\nprint(cnt)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 107,\n", + " 'code_v1_num_chars': 99,\n", + " 'code_v0_no_empty_lines': 'S = eval(input())\\nT = eval(input())\\nN = len(S)\\ncnt = 0\\nfor i in range(N):\\n cnt += S[i] != T[i]\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'S = eval(input())\\nT = eval(input())\\ncnt = 0\\nfor i in range(len(S)):\\n cnt += S[i] != T[i]\\nprint(cnt)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-N = len(S)', '-for i in range(N):', '+for i in range(len(S)):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3924936354,\n", + " 'measured_runtime_v1': 0.2147260756,\n", + " 'runtime_lift': 1.8278806345,\n", + " 'key': ['s346270661', 's299240564']},\n", + " {'user_id': 'u296518383',\n", + " 'problem_id': 'p03806',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's823150149',\n", + " 'submission_id_v1': 's174409855',\n", + " 'cpu_time_v0': 255,\n", + " 'cpu_time_v1': 220,\n", + " 'memory_v0': 44124,\n", + " 'memory_v1': 43356,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.73,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\n\\n\\n\\nN, Ma, Mb = list(map(int, input().split()))\\n\\nABC = [list(map(int, input().split())) for _ in range(N)]\\n\\n\\n\\nINF = 10 ** 15\\n\\ndp = [[INF for j in range(401)] for i in range(401)]\\n\\ndp[0][0] = 0\\n\\n\\n\\nfor a, b, c in ABC:\\n\\n for i in range(400, -1, -1):\\n\\n for j in range(400, -1, -1):\\n\\n if dp[i][j] != INF:\\n\\n dp[i + a][j + b] = min(dp[i + a][j + b], dp[i][j] + c)\\n\\n\\n\\nanswer = INF\\n\\nfor i in range(1, 401):\\n\\n for j in range(1, 401):\\n\\n if dp[i][j] != INF and i / j == Ma / Mb:\\n\\n answer = min(answer, dp[i][j])\\n\\n \\n\\nprint((answer if answer != INF else -1))',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\n\\n\\n\\nN, Ma, Mb = list(map(int, input().split()))\\n\\nABC = [list(map(int, input().split())) for _ in range(N)]\\n\\n\\n\\nsumA = sum([ABC[i][0] for i in range(N)])\\n\\nsumB = sum([ABC[i][1] for i in range(N)])\\n\\n\\n\\nINF = 10 ** 15\\n\\ndp = [[INF for j in range(sumB + 1)] for i in range(sumA + 1)]\\n\\ndp[0][0] = 0\\n\\n\\n\\nfor a, b, c in ABC:\\n\\n for i in range(sumA, -1, -1):\\n\\n for j in range(sumB, -1, -1):\\n\\n if dp[i][j] != INF:\\n\\n dp[i + a][j + b] = min(dp[i + a][j + b], dp[i][j] + c)\\n\\n\\n\\nanswer = INF\\n\\nfor i in range(1, sumA + 1):\\n\\n for j in range(1, sumB + 1):\\n\\n if dp[i][j] != INF and i / j == Ma / Mb:\\n\\n answer = min(answer, dp[i][j])\\n\\n \\n\\nprint((answer if answer != INF else -1))',\n", + " 'code_v0_loc': 23,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 611,\n", + " 'code_v1_num_chars': 721,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\nN, Ma, Mb = list(map(int, input().split()))\\nABC = [list(map(int, input().split())) for _ in range(N)]\\nINF = 10**15\\ndp = [[INF for j in range(401)] for i in range(401)]\\ndp[0][0] = 0\\nfor a, b, c in ABC:\\n for i in range(400, -1, -1):\\n for j in range(400, -1, -1):\\n if dp[i][j] != INF:\\n dp[i + a][j + b] = min(dp[i + a][j + b], dp[i][j] + c)\\nanswer = INF\\nfor i in range(1, 401):\\n for j in range(1, 401):\\n if dp[i][j] != INF and i / j == Ma / Mb:\\n answer = min(answer, dp[i][j])\\nprint((answer if answer != INF else -1))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.buffer.readline\\nN, Ma, Mb = list(map(int, input().split()))\\nABC = [list(map(int, input().split())) for _ in range(N)]\\nsumA = sum([ABC[i][0] for i in range(N)])\\nsumB = sum([ABC[i][1] for i in range(N)])\\nINF = 10**15\\ndp = [[INF for j in range(sumB + 1)] for i in range(sumA + 1)]\\ndp[0][0] = 0\\nfor a, b, c in ABC:\\n for i in range(sumA, -1, -1):\\n for j in range(sumB, -1, -1):\\n if dp[i][j] != INF:\\n dp[i + a][j + b] = min(dp[i + a][j + b], dp[i][j] + c)\\nanswer = INF\\nfor i in range(1, sumA + 1):\\n for j in range(1, sumB + 1):\\n if dp[i][j] != INF and i / j == Ma / Mb:\\n answer = min(answer, dp[i][j])\\nprint((answer if answer != INF else -1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.5384615385,\n", + " 'diff': ['+sumA = sum([ABC[i][0] for i in range(N)])',\n", + " '+sumB = sum([ABC[i][1] for i in range(N)])',\n", + " '-dp = [[INF for j in range(401)] for i in range(401)]',\n", + " '+dp = [[INF for j in range(sumB + 1)] for i in range(sumA + 1)]',\n", + " '- for i in range(400, -1, -1):',\n", + " '- for j in range(400, -1, -1):',\n", + " '+ for i in range(sumA, -1, -1):',\n", + " '+ for j in range(sumB, -1, -1):',\n", + " '-for i in range(1, 401):',\n", + " '- for j in range(1, 401):',\n", + " '+for i in range(1, sumA + 1):',\n", + " '+ for j in range(1, sumB + 1):'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8101779278,\n", + " 'measured_runtime_v1': 0.2126889092,\n", + " 'runtime_lift': 3.8092156792,\n", + " 'key': ['s823150149', 's174409855']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's416055764',\n", + " 'submission_id_v1': 's218640380',\n", + " 'cpu_time_v0': 227,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.51,\n", + " 'input': 'a,b,c,x,y=list(map(int,input().split()));print((min(k*c*2+a*max(x-k,0)+b*max(y-k,0)for k in range(max(x,y)*3))))',\n", + " 'target': 'a,b,c,x,y=list(map(int,input().split()));print((min(x*a+y*b,2*x*c+b*max(0,y-x),2*y*c+a*max(0,x-y))))',\n", + " 'code_v0_loc': 1,\n", + " 'code_v1_loc': 1,\n", + " 'code_v0_num_chars': 104,\n", + " 'code_v1_num_chars': 92,\n", + " 'code_v0_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nprint(\\n (\\n min(\\n k * c * 2 + a * max(x - k, 0) + b * max(y - k, 0)\\n for k in range(max(x, y) * 3)\\n )\\n )\\n)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c, x, y = list(map(int, input().split()))\\nprint(\\n (min(x * a + y * b, 2 * x * c + b * max(0, y - x), 2 * y * c + a * max(0, x - y)))\\n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- (',\n", + " '- min(',\n", + " '- k * c * 2 + a * max(x - k, 0) + b * max(y - k, 0)',\n", + " '- for k in range(max(x, y) * 3)',\n", + " '- )',\n", + " '- )',\n", + " '+ (min(x * a + y * b, 2 * x * c + b * max(0, y - x), 2 * y * c + a * max(0, x - y)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4340552337,\n", + " 'measured_runtime_v1': 0.2001633718,\n", + " 'runtime_lift': 2.1685048058,\n", + " 'key': ['s416055764', 's218640380']},\n", + " {'user_id': 'u260980560',\n", + " 'problem_id': 'p01105',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's457180384',\n", + " 'submission_id_v1': 's699385465',\n", + " 'cpu_time_v0': 130,\n", + " 'cpu_time_v1': 50,\n", + " 'memory_v0': 7848,\n", + " 'memory_v1': 7824,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 61.54,\n", + " 'input': 'a=65280; b=61680; c=52428; d=43690; e=65535\\n\\nL = {el: 1 for el in [a, b, c, d, e, 0]}\\n\\nfor i in range(6):\\n\\n R = sorted(L.items(), key=lambda x: x[1])\\n\\n for p, l in R:\\n\\n if l < 16:\\n\\n L[p ^ e] = min(L.get(p ^ e, 16), l+1)\\n\\n if l+3 < 16:\\n\\n for q, r in R:\\n\\n if l+r+3 <= 16:\\n\\n L[p & q] = min(L.get(p & q, 16), l+r+3)\\n\\n L[p ^ q] = min(L.get(p ^ q, 16), l+r+3)\\n\\n else: break\\n\\n else: break\\n\\nprint(*(L[e & eval(s)] for s in open(0).read().replace(*\"-~\").replace(*\"*&\").replace(*\"1e\").split()[:-1]),sep=\\'\\\\n\\')\\n',\n", + " 'target': 'a=65280; b=61680; c=52428; d=43690; e=65535\\n\\nfrom heapq import heappush, heappop\\n\\nbase = [a, b, c, d, e, 0]\\n\\nQ = [(1, el) for el in base]\\n\\nL = {el: 1 for el in base}\\n\\nH = []\\n\\nwhile Q:\\n\\n l, p = heappop(Q)\\n\\n if L[p] < l: continue\\n\\n if l+1 < L.get(p ^ e, 17):\\n\\n L[p^e] = l+1\\n\\n if l+1 < 16: heappush(Q, (l+1, p^e))\\n\\n if l+3 < 16:\\n\\n for q, r in H:\\n\\n if l+r+3 <= 16:\\n\\n if l+r+3 < L.get(p & q, 17):\\n\\n L[p & q] = l+r+3\\n\\n if l+r+3 < 16: heappush(Q, (l+r+3, p & q))\\n\\n if l+r+3 < L.get(p ^ q, 17):\\n\\n L[p ^ q] = l+r+3\\n\\n if l+r+3 < 16: heappush(Q, (l+r+3, p ^ q))\\n\\n else: break\\n\\n if l < 7: H.append((p, l))\\n\\nprint(*(L[e & eval(s)] for s in open(0).read().replace(*\"-~\").replace(*\"*&\").replace(*\"1e\").split()[:-1]),sep=\\'\\\\n\\')\\n',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 639,\n", + " 'code_v1_num_chars': 874,\n", + " 'code_v0_no_empty_lines': 'a = 65280\\nb = 61680\\nc = 52428\\nd = 43690\\ne = 65535\\nL = {el: 1 for el in [a, b, c, d, e, 0]}\\nfor i in range(6):\\n R = sorted(L.items(), key=lambda x: x[1])\\n for p, l in R:\\n if l < 16:\\n L[p ^ e] = min(L.get(p ^ e, 16), l + 1)\\n if l + 3 < 16:\\n for q, r in R:\\n if l + r + 3 <= 16:\\n L[p & q] = min(L.get(p & q, 16), l + r + 3)\\n L[p ^ q] = min(L.get(p ^ q, 16), l + r + 3)\\n else:\\n break\\n else:\\n break\\nprint(\\n *(\\n L[e & eval(s)]\\n for s in open(0)\\n .read()\\n .replace(*\"-~\")\\n .replace(*\"*&\")\\n .replace(*\"1e\")\\n .split()[:-1]\\n ),\\n sep=\"\\\\n\"\\n)\\n',\n", + " 'code_v1_no_empty_lines': 'a = 65280\\nb = 61680\\nc = 52428\\nd = 43690\\ne = 65535\\nfrom heapq import heappush, heappop\\n\\nbase = [a, b, c, d, e, 0]\\nQ = [(1, el) for el in base]\\nL = {el: 1 for el in base}\\nH = []\\nwhile Q:\\n l, p = heappop(Q)\\n if L[p] < l:\\n continue\\n if l + 1 < L.get(p ^ e, 17):\\n L[p ^ e] = l + 1\\n if l + 1 < 16:\\n heappush(Q, (l + 1, p ^ e))\\n if l + 3 < 16:\\n for q, r in H:\\n if l + r + 3 <= 16:\\n if l + r + 3 < L.get(p & q, 17):\\n L[p & q] = l + r + 3\\n if l + r + 3 < 16:\\n heappush(Q, (l + r + 3, p & q))\\n if l + r + 3 < L.get(p ^ q, 17):\\n L[p ^ q] = l + r + 3\\n if l + r + 3 < 16:\\n heappush(Q, (l + r + 3, p ^ q))\\n else:\\n break\\n if l < 7:\\n H.append((p, l))\\nprint(\\n *(\\n L[e & eval(s)]\\n for s in open(0)\\n .read()\\n .replace(*\"-~\")\\n .replace(*\"*&\")\\n .replace(*\"1e\")\\n .split()[:-1]\\n ),\\n sep=\"\\\\n\"\\n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 37.5,\n", + " 'diff': ['-L = {el: 1 for el in [a, b, c, d, e, 0]}',\n", + " '-for i in range(6):',\n", + " '- R = sorted(L.items(), key=lambda x: x[1])',\n", + " '- for p, l in R:',\n", + " '- if l < 16:',\n", + " '- L[p ^ e] = min(L.get(p ^ e, 16), l + 1)',\n", + " '- if l + 3 < 16:',\n", + " '- for q, r in R:',\n", + " '- if l + r + 3 <= 16:',\n", + " '- L[p & q] = min(L.get(p & q, 16), l + r + 3)',\n", + " '- L[p ^ q] = min(L.get(p ^ q, 16), l + r + 3)',\n", + " '- else:',\n", + " '- break',\n", + " '- else:',\n", + " '- break',\n", + " '+from heapq import heappush, heappop',\n", + " '+',\n", + " '+base = [a, b, c, d, e, 0]',\n", + " '+Q = [(1, el) for el in base]',\n", + " '+L = {el: 1 for el in base}',\n", + " '+H = []',\n", + " '+while Q:',\n", + " '+ l, p = heappop(Q)',\n", + " '+ if L[p] < l:',\n", + " '+ continue',\n", + " '+ if l + 1 < L.get(p ^ e, 17):',\n", + " '+ L[p ^ e] = l + 1',\n", + " '+ if l + 1 < 16:',\n", + " '+ heappush(Q, (l + 1, p ^ e))',\n", + " '+ if l + 3 < 16:',\n", + " '+ for q, r in H:',\n", + " '+ if l + r + 3 <= 16:',\n", + " '+ if l + r + 3 < L.get(p & q, 17):',\n", + " '+ L[p & q] = l + r + 3',\n", + " '+ if l + r + 3 < 16:',\n", + " '+ heappush(Q, (l + r + 3, p & q))',\n", + " '+ if l + r + 3 < L.get(p ^ q, 17):',\n", + " '+ L[p ^ q] = l + r + 3',\n", + " '+ if l + r + 3 < 16:',\n", + " '+ heappush(Q, (l + r + 3, p ^ q))',\n", + " '+ else:',\n", + " '+ break',\n", + " '+ if l < 7:',\n", + " '+ H.append((p, l))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.012686343,\n", + " 'measured_runtime_v1': 0.2560091887,\n", + " 'runtime_lift': 3.9556640457,\n", + " 'key': ['s457180384', 's699385465']},\n", + " {'user_id': 'u027685417',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's124992398',\n", + " 'submission_id_v1': 's099446399',\n", + " 'cpu_time_v0': 678,\n", + " 'cpu_time_v1': 544,\n", + " 'memory_v0': 33104,\n", + " 'memory_v1': 28888,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 19.76,\n", + " 'input': 'from heapq import *\\n\\n\\n\\n\\n\\nn, m = list(map(int, input().split()))\\n\\nPAIRS = [[-a, -1] for a in map(int, input().split())]\\n\\nheapify(PAIRS)\\n\\n\\n\\nfor _ in range(m):\\n\\n b, c = list(map(int, input().split()))\\n\\n heappush(PAIRS, [-c, -b])\\n\\n\\n\\nanswer = 0\\n\\nfor _ in range(n):\\n\\n pair = heappop(PAIRS)\\n\\n answer += -pair[0]\\n\\n pair[1] += 1\\n\\n if pair[1] != 0:\\n\\n heappush(PAIRS, pair)\\n\\n\\n\\nprint(answer)\\n',\n", + " 'target': 'n, m = list(map(int, input().split()))\\n\\nPAIRS = [(a, 1) for a in map(int, input().split())]\\n\\n\\n\\nfor _ in range(m):\\n\\n b, c = list(map(int, input().split()))\\n\\n PAIRS.append((c, b))\\n\\nPAIRS.sort(reverse = True)\\n\\n\\n\\nanswer, count = 0, 0\\n\\nfor pair in PAIRS:\\n\\n answer += pair[0] * pair[1]\\n\\n count += pair[1]\\n\\n if count > n:\\n\\n answer -= pair[0] * (count - n)\\n\\n break\\n\\n\\n\\nprint(answer)\\n',\n", + " 'code_v0_loc': 20,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 393,\n", + " 'code_v1_num_chars': 391,\n", + " 'code_v0_no_empty_lines': 'from heapq import *\\n\\nn, m = list(map(int, input().split()))\\nPAIRS = [[-a, -1] for a in map(int, input().split())]\\nheapify(PAIRS)\\nfor _ in range(m):\\n b, c = list(map(int, input().split()))\\n heappush(PAIRS, [-c, -b])\\nanswer = 0\\nfor _ in range(n):\\n pair = heappop(PAIRS)\\n answer += -pair[0]\\n pair[1] += 1\\n if pair[1] != 0:\\n heappush(PAIRS, pair)\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'n, m = list(map(int, input().split()))\\nPAIRS = [(a, 1) for a in map(int, input().split())]\\nfor _ in range(m):\\n b, c = list(map(int, input().split()))\\n PAIRS.append((c, b))\\nPAIRS.sort(reverse=True)\\nanswer, count = 0, 0\\nfor pair in PAIRS:\\n answer += pair[0] * pair[1]\\n count += pair[1]\\n if count > n:\\n answer -= pair[0] * (count - n)\\n break\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 15.0,\n", + " 'diff': ['-from heapq import *',\n", + " '-',\n", + " '-PAIRS = [[-a, -1] for a in map(int, input().split())]',\n", + " '-heapify(PAIRS)',\n", + " '+PAIRS = [(a, 1) for a in map(int, input().split())]',\n", + " '- heappush(PAIRS, [-c, -b])',\n", + " '-answer = 0',\n", + " '-for _ in range(n):',\n", + " '- pair = heappop(PAIRS)',\n", + " '- answer += -pair[0]',\n", + " '- pair[1] += 1',\n", + " '- if pair[1] != 0:',\n", + " '- heappush(PAIRS, pair)',\n", + " '+ PAIRS.append((c, b))',\n", + " '+PAIRS.sort(reverse=True)',\n", + " '+answer, count = 0, 0',\n", + " '+for pair in PAIRS:',\n", + " '+ answer += pair[0] * pair[1]',\n", + " '+ count += pair[1]',\n", + " '+ if count > n:',\n", + " '+ answer -= pair[0] * (count - n)',\n", + " '+ break'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2969929054,\n", + " 'measured_runtime_v1': 0.0828762929,\n", + " 'runtime_lift': 3.5835688928,\n", + " 'key': ['s124992398', 's099446399']},\n", + " {'user_id': 'u390727364',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's461844743',\n", + " 'submission_id_v1': 's642120834',\n", + " 'cpu_time_v0': 51,\n", + " 'cpu_time_v1': 44,\n", + " 'memory_v0': 9132,\n", + " 'memory_v1': 9172,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.73,\n", + " 'input': 'x = int(eval(input()))\\n\\na = 0\\n\\nb = 0\\n\\nfor i in range(-120, 120):\\n\\n for j in range(-120, 120):\\n\\n if i ** 5 - j ** 5 == x:\\n\\n a = i\\n\\n b = j\\n\\nprint((a, b))\\n',\n", + " 'target': 'x = int(eval(input()))\\n\\nfor i in range(-120, 120):\\n\\n for j in range(-120, 120):\\n\\n if i ** 5 - j ** 5 == x:\\n\\n print((i, j))\\n\\n exit()\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 176,\n", + " 'code_v1_num_chars': 156,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\na = 0\\nb = 0\\nfor i in range(-120, 120):\\n for j in range(-120, 120):\\n if i**5 - j**5 == x:\\n a = i\\n b = j\\nprint((a, b))\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nfor i in range(-120, 120):\\n for j in range(-120, 120):\\n if i**5 - j**5 == x:\\n print((i, j))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-a = 0',\n", + " '-b = 0',\n", + " '- a = i',\n", + " '- b = j',\n", + " '-print((a, b))',\n", + " '+ print((i, j))',\n", + " '+ exit()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4738806367,\n", + " 'measured_runtime_v1': 0.3552351197,\n", + " 'runtime_lift': 1.3339915184,\n", + " 'key': ['s461844743', 's642120834']},\n", + " {'user_id': 'u540631540',\n", + " 'problem_id': 'p02767',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's304816826',\n", + " 'submission_id_v1': 's138180908',\n", + " 'cpu_time_v0': 22,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 13.64,\n", + " 'input': 'n = int(eval(input()))\\n\\nx = [int(i) for i in input().split()]\\n\\np = 10000000\\n\\nfor i in range(100):\\n\\n pi = 0\\n\\n for j in range(n):\\n\\n pi += (x[j] - (i + 1))**2\\n\\n if pi < p:\\n\\n p = pi\\n\\n # else:\\n\\n # break\\n\\n # p[i] += (x[j]-(i+1))**2\\n\\nprint(p)',\n", + " 'target': 'n = int(eval(input()))\\n\\nx = [int(i) for i in input().split()]\\n\\np = 10000000\\n\\nfor i in range(100):\\n\\n pi = 0\\n\\n for j in range(n):\\n\\n pi += (x[j] - (i + 1))**2\\n\\n if pi < p:\\n\\n p = pi\\n\\n else:\\n\\n break\\n\\n # p[i] += (x[j]-(i+1))**2\\n\\nprint(p)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 269,\n", + " 'code_v1_num_chars': 265,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nx = [int(i) for i in input().split()]\\np = 10000000\\nfor i in range(100):\\n pi = 0\\n for j in range(n):\\n pi += (x[j] - (i + 1)) ** 2\\n if pi < p:\\n p = pi\\n # else:\\n # break\\n # p[i] += (x[j]-(i+1))**2\\nprint(p)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nx = [int(i) for i in input().split()]\\np = 10000000\\nfor i in range(100):\\n pi = 0\\n for j in range(n):\\n pi += (x[j] - (i + 1)) ** 2\\n if pi < p:\\n p = pi\\n else:\\n break\\n # p[i] += (x[j]-(i+1))**2\\nprint(p)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- # else:',\n", + " '- # break',\n", + " '- # p[i] += (x[j]-(i+1))**2',\n", + " '+ else:',\n", + " '+ break',\n", + " '+ # p[i] += (x[j]-(i+1))**2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.18753242,\n", + " 'measured_runtime_v1': 0.0060767163,\n", + " 'runtime_lift': 30.860815536,\n", + " 'key': ['s304816826', 's138180908']},\n", + " {'user_id': 'u268210555',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's447095273',\n", + " 'submission_id_v1': 's107946427',\n", + " 'cpu_time_v0': 620,\n", + " 'cpu_time_v1': 135,\n", + " 'memory_v0': 27172,\n", + " 'memory_v1': 9292,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 78.23,\n", + " 'input': 'import numpy as np\\n\\ns = eval(input())\\n\\ny = 2019\\n\\ndp = np.zeros(y, dtype=\"int64\")\\n\\ntmp = np.zeros(y, dtype=\"int64\")\\n\\nk = 1\\n\\nr = 0\\n\\nfor c in s[::-1]:\\n\\n i = int(c)*k%y\\n\\n tmp[i:] = dp[:y-i]\\n\\n tmp[:i] = dp[y-i:]\\n\\n tmp[i] += 1\\n\\n dp, tmp = tmp, dp\\n\\n r += dp[0]\\n\\n k *= 10\\n\\n k %= y\\n\\nprint(r)',\n", + " 'target': 'y=2019\\n\\na=[0]*y\\n\\nk=1\\n\\nr=p=0\\n\\nfor c in input()[::-1]:\\n\\n a[p]+=1\\n\\n p-=int(c)*k\\n\\n p%=y\\n\\n r+=a[p]\\n\\n k*=10\\n\\n k%=y\\n\\nprint(r)\\n\\n\\n',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 300,\n", + " 'code_v1_num_chars': 139,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\ns = eval(input())\\ny = 2019\\ndp = np.zeros(y, dtype=\"int64\")\\ntmp = np.zeros(y, dtype=\"int64\")\\nk = 1\\nr = 0\\nfor c in s[::-1]:\\n i = int(c) * k % y\\n tmp[i:] = dp[: y - i]\\n tmp[:i] = dp[y - i :]\\n tmp[i] += 1\\n dp, tmp = tmp, dp\\n r += dp[0]\\n k *= 10\\n k %= y\\nprint(r)\\n',\n", + " 'code_v1_no_empty_lines': 'y = 2019\\na = [0] * y\\nk = 1\\nr = p = 0\\nfor c in input()[::-1]:\\n a[p] += 1\\n p -= int(c) * k\\n p %= y\\n r += a[p]\\n k *= 10\\n k %= y\\nprint(r)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 23.5294117647,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-s = eval(input())',\n", + " '-dp = np.zeros(y, dtype=\"int64\")',\n", + " '-tmp = np.zeros(y, dtype=\"int64\")',\n", + " '+a = [0] * y',\n", + " '-r = 0',\n", + " '-for c in s[::-1]:',\n", + " '- i = int(c) * k % y',\n", + " '- tmp[i:] = dp[: y - i]',\n", + " '- tmp[:i] = dp[y - i :]',\n", + " '- tmp[i] += 1',\n", + " '- dp, tmp = tmp, dp',\n", + " '- r += dp[0]',\n", + " '+r = p = 0',\n", + " '+for c in input()[::-1]:',\n", + " '+ a[p] += 1',\n", + " '+ p -= int(c) * k',\n", + " '+ p %= y',\n", + " '+ r += a[p]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.860732609,\n", + " 'measured_runtime_v1': 0.344029563,\n", + " 'runtime_lift': 5.4086416092,\n", + " 'key': ['s447095273', 's107946427']},\n", + " {'user_id': 'u427344224',\n", + " 'problem_id': 'p03253',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's043094515',\n", + " 'submission_id_v1': 's952701444',\n", + " 'cpu_time_v0': 1290,\n", + " 'cpu_time_v1': 20,\n", + " 'memory_v0': 5164,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 98.45,\n", + " 'input': 'def prime_factorize(num):\\n\\n \"\"\"\\n\\n This function performs prime factorization on the input natural number.\\n\\n The result is returned in the form of a dictionary with the prime number as the key\\n\\n and its number as the value.\\n\\n :param num:\\n\\n :return prime_factor: Dictionary with the prime number as the key and its number as the value.\\n\\n \"\"\"\\n\\n prime_factor = {}\\n\\n i = 2\\n\\n while i ** 2 <= num:\\n\\n while num % i == 0:\\n\\n num //= i\\n\\n if i in list(prime_factor.keys()):\\n\\n prime_factor[i] += 1\\n\\n else:\\n\\n prime_factor[i] = 1\\n\\n i += 1\\n\\n if num > 1:\\n\\n prime_factor[num] = 1\\n\\n return prime_factor\\n\\n\\n\\n\\n\\nfrom math import factorial\\n\\n\\n\\n\\n\\ndef comb(n, r, R):\\n\\n if n not in R:\\n\\n a = factorial(n)\\n\\n R[n] = a\\n\\n else:\\n\\n a = R[n]\\n\\n\\n\\n if n - r not in R:\\n\\n b = factorial(n - r)\\n\\n R[n - r] = b\\n\\n else:\\n\\n b = R[n - r]\\n\\n\\n\\n if r not in R:\\n\\n c = factorial(r)\\n\\n R[r] = c\\n\\n else:\\n\\n c = R[r]\\n\\n return a // (b * c)\\n\\n\\n\\n\\n\\nn, m = list(map(int, input().split()))\\n\\nr = 1\\n\\n\\n\\nR = dict()\\n\\nprime_fac = prime_factorize(m)\\n\\nfor v in list(prime_fac.values()):\\n\\n r *= comb(v + n - 1, v, R)\\n\\nmod = 1000000000 + 7\\n\\nprint((r % mod))\\n',\n", + " 'target': 'def prime_factorize(num):\\n\\n \"\"\"\\n\\n This function performs prime factorization on the input natural number.\\n\\n The result is returned in the form of a dictionary with the prime number as the key\\n\\n and its number as the value.\\n\\n :param num:\\n\\n :return prime_factor: Dictionary with the prime number as the key and its number as the value.\\n\\n \"\"\"\\n\\n prime_factor = {}\\n\\n i = 2\\n\\n while i ** 2 <= num:\\n\\n while num % i == 0:\\n\\n num //= i\\n\\n if i in list(prime_factor.keys()):\\n\\n prime_factor[i] += 1\\n\\n else:\\n\\n prime_factor[i] = 1\\n\\n i += 1\\n\\n if num > 1:\\n\\n prime_factor[num] = 1\\n\\n return prime_factor\\n\\n\\n\\n\\n\\n\\n\\ndef combination(n, r):\\n\\n r = min(n-r, r)\\n\\n result = 1\\n\\n for i in range(n, n-r, -1):\\n\\n result *= i\\n\\n for i in range(1, r+1):\\n\\n result //= i\\n\\n return result\\n\\n\\n\\n\\n\\nn, m = list(map(int, input().split()))\\n\\nr = 1\\n\\n\\n\\nprime_fac = prime_factorize(m)\\n\\nfor v in list(prime_fac.values()):\\n\\n r *= combination(v + n - 1, v)\\n\\nmod = 1000000000 + 7\\n\\nprint((r % mod))\\n',\n", + " 'code_v0_loc': 56,\n", + " 'code_v1_loc': 42,\n", + " 'code_v0_num_chars': 1269,\n", + " 'code_v1_num_chars': 1072,\n", + " 'code_v0_no_empty_lines': 'def prime_factorize(num):\\n \"\"\"\\n This function performs prime factorization on the input natural number.\\n The result is returned in the form of a dictionary with the prime number as the key\\n and its number as the value.\\n :param num:\\n :return prime_factor: Dictionary with the prime number as the key and its number as the value.\\n \"\"\"\\n prime_factor = {}\\n i = 2\\n while i**2 <= num:\\n while num % i == 0:\\n num //= i\\n if i in list(prime_factor.keys()):\\n prime_factor[i] += 1\\n else:\\n prime_factor[i] = 1\\n i += 1\\n if num > 1:\\n prime_factor[num] = 1\\n return prime_factor\\n\\n\\nfrom math import factorial\\n\\n\\ndef comb(n, r, R):\\n if n not in R:\\n a = factorial(n)\\n R[n] = a\\n else:\\n a = R[n]\\n if n - r not in R:\\n b = factorial(n - r)\\n R[n - r] = b\\n else:\\n b = R[n - r]\\n if r not in R:\\n c = factorial(r)\\n R[r] = c\\n else:\\n c = R[r]\\n return a // (b * c)\\n\\n\\nn, m = list(map(int, input().split()))\\nr = 1\\nR = dict()\\nprime_fac = prime_factorize(m)\\nfor v in list(prime_fac.values()):\\n r *= comb(v + n - 1, v, R)\\nmod = 1000000000 + 7\\nprint((r % mod))\\n',\n", + " 'code_v1_no_empty_lines': 'def prime_factorize(num):\\n \"\"\"\\n This function performs prime factorization on the input natural number.\\n The result is returned in the form of a dictionary with the prime number as the key\\n and its number as the value.\\n :param num:\\n :return prime_factor: Dictionary with the prime number as the key and its number as the value.\\n \"\"\"\\n prime_factor = {}\\n i = 2\\n while i**2 <= num:\\n while num % i == 0:\\n num //= i\\n if i in list(prime_factor.keys()):\\n prime_factor[i] += 1\\n else:\\n prime_factor[i] = 1\\n i += 1\\n if num > 1:\\n prime_factor[num] = 1\\n return prime_factor\\n\\n\\ndef combination(n, r):\\n r = min(n - r, r)\\n result = 1\\n for i in range(n, n - r, -1):\\n result *= i\\n for i in range(1, r + 1):\\n result //= i\\n return result\\n\\n\\nn, m = list(map(int, input().split()))\\nr = 1\\nprime_fac = prime_factorize(m)\\nfor v in list(prime_fac.values()):\\n r *= combination(v + n - 1, v)\\nmod = 1000000000 + 7\\nprint((r % mod))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-from math import factorial',\n", + " '-',\n", + " '-',\n", + " '-def comb(n, r, R):',\n", + " '- if n not in R:',\n", + " '- a = factorial(n)',\n", + " '- R[n] = a',\n", + " '- else:',\n", + " '- a = R[n]',\n", + " '- if n - r not in R:',\n", + " '- b = factorial(n - r)',\n", + " '- R[n - r] = b',\n", + " '- else:',\n", + " '- b = R[n - r]',\n", + " '- if r not in R:',\n", + " '- c = factorial(r)',\n", + " '- R[r] = c',\n", + " '- else:',\n", + " '- c = R[r]',\n", + " '- return a // (b * c)',\n", + " '+def combination(n, r):',\n", + " '+ r = min(n - r, r)',\n", + " '+ result = 1',\n", + " '+ for i in range(n, n - r, -1):',\n", + " '+ result *= i',\n", + " '+ for i in range(1, r + 1):',\n", + " '+ result //= i',\n", + " '+ return result',\n", + " '-R = dict()',\n", + " '- r *= comb(v + n - 1, v, R)',\n", + " '+ r *= combination(v + n - 1, v)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4743831277,\n", + " 'measured_runtime_v1': 0.1920195122,\n", + " 'runtime_lift': 2.4704943903,\n", + " 'key': ['s043094515', 's952701444']},\n", + " {'user_id': 'u678167152',\n", + " 'problem_id': 'p03608',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's000797516',\n", + " 'submission_id_v1': 's627408472',\n", + " 'cpu_time_v0': 303,\n", + " 'cpu_time_v1': 214,\n", + " 'memory_v0': 70760,\n", + " 'memory_v1': 74992,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 29.37,\n", + " 'input': \"N, M, R = list(map(int, input().split()))\\n\\nr = list(map(int, input().split()))\\n\\nd = [[float('inf')]*N for _ in range(N)]\\n\\nfor i in range(M): #ひとまず枝があるペアは枝の長さをセット\\n\\n a,b,t = list(map(int, input().split()))\\n\\n d[a-1][b-1] = t\\n\\n d[b-1][a-1] = t\\n\\n\\n\\nfor i in range(N):\\n\\n d[i][i] = 0 #自身への最短経路は0\\n\\n#三重ループ\\n\\nfor k in range(N):\\n\\n for i in range(N):\\n\\n for j in range(N):\\n\\n d[i][j] = min(d[i][j], d[i][k]+d[k][j])\\n\\n\\n\\nfrom itertools import groupby, accumulate, product, permutations, combinations\\n\\n\\n\\nans = float('inf')\\n\\nfor p in permutations(r,R):\\n\\n cnt = 0\\n\\n for i in range(1,R):\\n\\n cnt += d[p[i-1]-1][p[i]-1]\\n\\n ans = min(ans,cnt)\\n\\nprint(ans)\",\n", + " 'target': 'N, M, r = list(map(int, input().split()))\\n\\nR = list([int(x)-1 for x in input().split()])\\n\\nd = [[1<<30]*N for _ in range(N)]\\n\\nfor i in range(M): #ひとまず枝があるペアは枝の長さをセット\\n\\n a,b,t = list(map(int, input().split()))\\n\\n d[a-1][b-1] = t\\n\\n d[b-1][a-1] = t\\n\\n\\n\\nfor i in range(N):\\n\\n d[i][i] = 0 #自身への最短経路は0\\n\\n#三重ループ\\n\\nfor k in range(N):\\n\\n for i in range(N):\\n\\n for j in range(N):\\n\\n d[i][j] = min(d[i][j], d[i][k]+d[k][j])\\n\\nfrom itertools import groupby, accumulate, product, permutations, combinations\\n\\nans = 1<<30\\n\\nfor per in permutations(R,r):\\n\\n cnt = 0\\n\\n for i in range(r-1):\\n\\n cnt += d[per[i]][per[i+1]]\\n\\n ans = min(ans, cnt)\\n\\nprint(ans)',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 634,\n", + " 'code_v1_num_chars': 633,\n", + " 'code_v0_no_empty_lines': 'N, M, R = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nd = [[float(\"inf\")] * N for _ in range(N)]\\nfor i in range(M): # ひとまず枝があるペアは枝の長さをセット\\n a, b, t = list(map(int, input().split()))\\n d[a - 1][b - 1] = t\\n d[b - 1][a - 1] = t\\nfor i in range(N):\\n d[i][i] = 0 # 自身への最短経路は0\\n# 三重ループ\\nfor k in range(N):\\n for i in range(N):\\n for j in range(N):\\n d[i][j] = min(d[i][j], d[i][k] + d[k][j])\\nfrom itertools import groupby, accumulate, product, permutations, combinations\\n\\nans = float(\"inf\")\\nfor p in permutations(r, R):\\n cnt = 0\\n for i in range(1, R):\\n cnt += d[p[i - 1] - 1][p[i] - 1]\\n ans = min(ans, cnt)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N, M, r = list(map(int, input().split()))\\nR = list([int(x) - 1 for x in input().split()])\\nd = [[1 << 30] * N for _ in range(N)]\\nfor i in range(M): # ひとまず枝があるペアは枝の長さをセット\\n a, b, t = list(map(int, input().split()))\\n d[a - 1][b - 1] = t\\n d[b - 1][a - 1] = t\\nfor i in range(N):\\n d[i][i] = 0 # 自身への最短経路は0\\n# 三重ループ\\nfor k in range(N):\\n for i in range(N):\\n for j in range(N):\\n d[i][j] = min(d[i][j], d[i][k] + d[k][j])\\nfrom itertools import groupby, accumulate, product, permutations, combinations\\n\\nans = 1 << 30\\nfor per in permutations(R, r):\\n cnt = 0\\n for i in range(r - 1):\\n cnt += d[per[i]][per[i + 1]]\\n ans = min(ans, cnt)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.0,\n", + " 'diff': ['-N, M, R = list(map(int, input().split()))',\n", + " '-r = list(map(int, input().split()))',\n", + " '-d = [[float(\"inf\")] * N for _ in range(N)]',\n", + " '+N, M, r = list(map(int, input().split()))',\n", + " '+R = list([int(x) - 1 for x in input().split()])',\n", + " '+d = [[1 << 30] * N for _ in range(N)]',\n", + " '-ans = float(\"inf\")',\n", + " '-for p in permutations(r, R):',\n", + " '+ans = 1 << 30',\n", + " '+for per in permutations(R, r):',\n", + " '- for i in range(1, R):',\n", + " '- cnt += d[p[i - 1] - 1][p[i] - 1]',\n", + " '+ for i in range(r - 1):',\n", + " '+ cnt += d[per[i]][per[i + 1]]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2899598975,\n", + " 'measured_runtime_v1': 0.2122670105,\n", + " 'runtime_lift': 1.3660148927,\n", + " 'key': ['s000797516', 's627408472']},\n", + " {'user_id': 'u488127128',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's848409194',\n", + " 'submission_id_v1': 's870468874',\n", + " 'cpu_time_v0': 231,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 4020,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.85,\n", + " 'input': 'import math\\n\\nN = int(eval(input()))\\n\\nprint((math.factorial(N)%(10**9+7)))',\n", + " 'target': 'import math\\n\\nN = int(eval(input()))\\n\\na = 1\\n\\nfor n in range(2,N+1):\\n\\n a = a*n % (10**9+7)\\n\\nprint(a)',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 65,\n", + " 'code_v1_num_chars': 95,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\nprint((math.factorial(N) % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nN = int(eval(input()))\\na = 1\\nfor n in range(2, N + 1):\\n a = a * n % (10**9 + 7)\\nprint(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-print((math.factorial(N) % (10**9 + 7)))',\n", + " '+a = 1',\n", + " '+for n in range(2, N + 1):',\n", + " '+ a = a * n % (10**9 + 7)',\n", + " '+print(a)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8454835632,\n", + " 'measured_runtime_v1': 0.3383059211,\n", + " 'runtime_lift': 2.4991686828,\n", + " 'key': ['s848409194', 's870468874']},\n", + " {'user_id': 'u728498511',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's773095214',\n", + " 'submission_id_v1': 's841162290',\n", + " 'cpu_time_v0': 111,\n", + " 'cpu_time_v1': 67,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 39.64,\n", + " 'input': 'n, m = list(map(int, input().split()))\\n\\nans = 0\\n\\nfor i in range(n, m+1):\\n\\n if str(i)[0]+str(i)[1] == str(i)[-1]+str(i)[-2]: ans += 1\\n\\nprint(ans)',\n", + " 'target': 'a, b = list(map(int, input().split()))\\n\\nans = 0\\n\\nfor n in range(a, b+1):\\n\\n if str(n) == str(n)[::-1]: ans += 1\\n\\nprint(ans)',\n", + " 'code_v0_loc': 5,\n", + " 'code_v1_loc': 5,\n", + " 'code_v0_num_chars': 141,\n", + " 'code_v1_num_chars': 119,\n", + " 'code_v0_no_empty_lines': 'n, m = list(map(int, input().split()))\\nans = 0\\nfor i in range(n, m + 1):\\n if str(i)[0] + str(i)[1] == str(i)[-1] + str(i)[-2]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = list(map(int, input().split()))\\nans = 0\\nfor n in range(a, b + 1):\\n if str(n) == str(n)[::-1]:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-n, m = list(map(int, input().split()))',\n", + " '+a, b = list(map(int, input().split()))',\n", + " '-for i in range(n, m + 1):',\n", + " '- if str(i)[0] + str(i)[1] == str(i)[-1] + str(i)[-2]:',\n", + " '+for n in range(a, b + 1):',\n", + " '+ if str(n) == str(n)[::-1]:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6137721554,\n", + " 'measured_runtime_v1': 0.3378130706,\n", + " 'runtime_lift': 1.8168987785,\n", + " 'key': ['s773095214', 's841162290']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03747',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's216230376',\n", + " 'submission_id_v1': 's376589884',\n", + " 'cpu_time_v0': 268,\n", + " 'cpu_time_v1': 169,\n", + " 'memory_v0': 34272,\n", + " 'memory_v1': 41876,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 36.94,\n", + " 'input': \"import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nN,L,T = list(map(int,input().split()))\\n\\nXW = [[int(x) for x in input().split()] for _ in range(N)]\\n\\n\\n\\nX,W = list(zip(*XW))\\n\\n\\n\\nDX = [1 if w == 1 else -1 for w in W]\\n\\n\\n\\nY = [(x+dx*T)%L for x,dx in zip(X,DX)]\\n\\ny0 = Y[0]\\n\\nY.sort()\\n\\n\\n\\n# 番号1がすれ違わず進んだ場所に相当するアリの番号\\n\\n# すれ違うたびに1増える（W1=1） or 1減る（W1=-1）\\n\\n# T秒ちょうどもすれ違い終わったと考える\\n\\n\\n\\nx = 0\\n\\nx0,dx0 = X[0],DX[0]\\n\\nfor y,dy in zip(X[1:],DX[1:]):\\n\\n if dx0 == dy:\\n\\n continue\\n\\n if dx0 == 1 and dy == -1:\\n\\n # 正の向きに追い越すので番号がひとつ増える\\n\\n x += (2*T-(y-x0)-1)//L + 1\\n\\n if dx0 == -1 and dy == 1:\\n\\n x -= (2*T-(L+x0-y))//L + 1\\n\\nx %= N\\n\\n\\n\\ni = Y.index(y0)\\n\\n\\n\\nY += Y\\n\\n\\n\\nanswer = [None] * N\\n\\nanswer[x:N] = Y[i:i+N-x]\\n\\nanswer[0:x] = Y[i+N-x:i+N]\\n\\n\\n\\nprint(('\\\\n'.join(map(str,answer))))\\n\\n\\n\",\n", + " 'target': 'import sys\\n\\nimport numpy as np\\n\\n\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\n\"\"\"\\n\\n・順序が固定されるので、区間だったら簡単\\n\\n・円のときも、地点 0 をそれぞれの方向に通った人数を見れば計算できる\\n\\n\"\"\"\\n\\n\\n\\nN, L, T = list(map(int, readline().split()))\\n\\nXW = np.array(read().split(), np.int64)\\n\\nX = XW[::2]\\n\\nW = XW[1::2]\\n\\n\\n\\nspeed = np.where(W == 1, 1, -1)\\n\\n\\n\\nY = X + speed * T\\n\\n\\n\\nn = (Y // L - X // L).sum()\\n\\nn %= N\\n\\n\\n\\nY %= L\\n\\nY.sort()\\n\\nY = np.concatenate((Y[n:], Y[:n]))\\n\\n\\n\\nprint((\\'\\\\n\\'.join(map(str, Y.tolist()))))',\n", + " 'code_v0_loc': 40,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 763,\n", + " 'code_v1_num_chars': 514,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nN, L, T = list(map(int, input().split()))\\nXW = [[int(x) for x in input().split()] for _ in range(N)]\\nX, W = list(zip(*XW))\\nDX = [1 if w == 1 else -1 for w in W]\\nY = [(x + dx * T) % L for x, dx in zip(X, DX)]\\ny0 = Y[0]\\nY.sort()\\n# 番号1がすれ違わず進んだ場所に相当するアリの番号\\n# すれ違うたびに1増える（W1=1） or 1減る（W1=-1）\\n# T秒ちょうどもすれ違い終わったと考える\\nx = 0\\nx0, dx0 = X[0], DX[0]\\nfor y, dy in zip(X[1:], DX[1:]):\\n if dx0 == dy:\\n continue\\n if dx0 == 1 and dy == -1:\\n # 正の向きに追い越すので番号がひとつ増える\\n x += (2 * T - (y - x0) - 1) // L + 1\\n if dx0 == -1 and dy == 1:\\n x -= (2 * T - (L + x0 - y)) // L + 1\\nx %= N\\ni = Y.index(y0)\\nY += Y\\nanswer = [None] * N\\nanswer[x:N] = Y[i : i + N - x]\\nanswer[0:x] = Y[i + N - x : i + N]\\nprint((\"\\\\n\".join(map(str, answer))))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\n\"\"\"\\n・順序が固定されるので、区間だったら簡単\\n・円のときも、地点 0 をそれぞれの方向に通った人数を見れば計算できる\\n\"\"\"\\nN, L, T = list(map(int, readline().split()))\\nXW = np.array(read().split(), np.int64)\\nX = XW[::2]\\nW = XW[1::2]\\nspeed = np.where(W == 1, 1, -1)\\nY = X + speed * T\\nn = (Y // L - X // L).sum()\\nn %= N\\nY %= L\\nY.sort()\\nY = np.concatenate((Y[n:], Y[:n]))\\nprint((\"\\\\n\".join(map(str, Y.tolist()))))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.5,\n", + " 'diff': ['+import numpy as np',\n", + " '-input = sys.stdin.readline',\n", + " '-N, L, T = list(map(int, input().split()))',\n", + " '-XW = [[int(x) for x in input().split()] for _ in range(N)]',\n", + " '-X, W = list(zip(*XW))',\n", + " '-DX = [1 if w == 1 else -1 for w in W]',\n", + " '-Y = [(x + dx * T) % L for x, dx in zip(X, DX)]',\n", + " '-y0 = Y[0]',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '+\"\"\"',\n", + " '+・順序が固定されるので、区間だったら簡単',\n", + " '+・円のときも、地点 0 をそれぞれの方向に通った人数を見れば計算できる',\n", + " '+\"\"\"',\n", + " '+N, L, T = list(map(int, readline().split()))',\n", + " '+XW = np.array(read().split(), np.int64)',\n", + " '+X = XW[::2]',\n", + " '+W = XW[1::2]',\n", + " '+speed = np.where(W == 1, 1, -1)',\n", + " '+Y = X + speed * T',\n", + " '+n = (Y // L - X // L).sum()',\n", + " '+n %= N',\n", + " '+Y %= L',\n", + " '-# 番号1がすれ違わず進んだ場所に相当するアリの番号',\n", + " '-# すれ違うたびに1増える（W1=1） or 1減る（W1=-1）',\n", + " '-# T秒ちょうどもすれ違い終わったと考える',\n", + " '-x = 0',\n", + " '-x0, dx0 = X[0], DX[0]',\n", + " '-for y, dy in zip(X[1:], DX[1:]):',\n", + " '- if dx0 == dy:',\n", + " '- continue',\n", + " '- if dx0 == 1 and dy == -1:',\n", + " '- # 正の向きに追い越すので番号がひとつ増える',\n", + " '- x += (2 * T - (y - x0) - 1) // L + 1',\n", + " '- if dx0 == -1 and dy == 1:',\n", + " '- x -= (2 * T - (L + x0 - y)) // L + 1',\n", + " '-x %= N',\n", + " '-i = Y.index(y0)',\n", + " '-Y += Y',\n", + " '-answer = [None] * N',\n", + " '-answer[x:N] = Y[i : i + N - x]',\n", + " '-answer[0:x] = Y[i + N - x : i + N]',\n", + " '-print((\"\\\\n\".join(map(str, answer))))',\n", + " '+Y = np.concatenate((Y[n:], Y[:n]))',\n", + " '+print((\"\\\\n\".join(map(str, Y.tolist()))))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2011978789,\n", + " 'measured_runtime_v1': 0.0059206796,\n", + " 'runtime_lift': 33.9822267906,\n", + " 'key': ['s216230376', 's376589884']},\n", + " {'user_id': 'u170183831',\n", + " 'problem_id': 'p03568',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's971455595',\n", + " 'submission_id_v1': 's272804435',\n", + " 'cpu_time_v0': 148,\n", + " 'cpu_time_v1': 29,\n", + " 'memory_v0': 9116,\n", + " 'memory_v1': 9072,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 80.41,\n", + " 'input': 'from itertools import product\\n\\n\\n\\nn = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\ncount = 0\\n\\nfor C in product((-1, 0, 1), repeat=n):\\n\\n total = 1\\n\\n for a, c in zip(A, C):\\n\\n total *= (a + c)\\n\\n if total % 2 == 0:\\n\\n count += 1\\n\\nprint(count)',\n", + " 'target': 'n = int(eval(input()))\\n\\nA = list(map(int, input().split()))\\n\\n\\n\\ncount = 1\\n\\nfor a in A:\\n\\n count *= 2 if a % 2 == 0 else 1\\n\\nprint((3 ** n - count))',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 253,\n", + " 'code_v1_num_chars': 137,\n", + " 'code_v0_no_empty_lines': 'from itertools import product\\n\\nn = int(eval(input()))\\nA = list(map(int, input().split()))\\ncount = 0\\nfor C in product((-1, 0, 1), repeat=n):\\n total = 1\\n for a, c in zip(A, C):\\n total *= a + c\\n if total % 2 == 0:\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nA = list(map(int, input().split()))\\ncount = 1\\nfor a in A:\\n count *= 2 if a % 2 == 0 else 1\\nprint((3**n - count))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 46.1538461538,\n", + " 'diff': ['-from itertools import product',\n", + " '-',\n", + " '-count = 0',\n", + " '-for C in product((-1, 0, 1), repeat=n):',\n", + " '- total = 1',\n", + " '- for a, c in zip(A, C):',\n", + " '- total *= a + c',\n", + " '- if total % 2 == 0:',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+count = 1',\n", + " '+for a in A:',\n", + " '+ count *= 2 if a % 2 == 0 else 1',\n", + " '+print((3**n - count))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2956474931,\n", + " 'measured_runtime_v1': 0.0067464924,\n", + " 'runtime_lift': 43.8224007049,\n", + " 'key': ['s971455595', 's272804435']},\n", + " {'user_id': 'u780962115',\n", + " 'problem_id': 'p02850',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's056526441',\n", + " 'submission_id_v1': 's495635102',\n", + " 'cpu_time_v0': 872,\n", + " 'cpu_time_v1': 745,\n", + " 'memory_v0': 119396,\n", + " 'memory_v1': 45168,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.56,\n", + " 'input': 'n=int(eval(input()))\\n\\nnode={i:[] for i in range(1,n+1)}\\n\\nvisited=[False for i in range(n+1)]\\n\\nq=[]\\n\\nfor _ in range(n-1):\\n\\n a,b=list(map(int,input().split()))\\n\\n node[a].append(b)\\n\\n node[b].append(a)\\n\\n q.append((a,b))\\n\\n\\n\\nmother=q[0][0]\\n\\nvisited[mother]=True\\n\\n\\n\\nd=[]\\n\\ne=[]\\n\\n\\n\\n\\n\\npaint={i:{} for i in range(1,n+1)}\\n\\n\\n\\nmother_paint=[0 for i in range(n+1)]\\n\\n\\n\\n#使う要素 node visited paint mother_paint の四つのリスト\\n\\nc=1\\n\\nfor child in node[mother]:\\n\\n visited[child]=True\\n\\n paint[mother][child]=c\\n\\n paint[child][mother]=c\\n\\n mother_paint[child]=c\\n\\n c+=1\\n\\n d.append(child)\\n\\n \\n\\nwhile d:\\n\\n for parent in d:\\n\\n p=1 \\n\\n for child in node[parent]:\\n\\n if visited[child]==False:\\n\\n visited[child]=True\\n\\n if p!=mother_paint[parent]:\\n\\n paint[parent][child]=p\\n\\n paint[child][parent]=p\\n\\n mother_paint[child]=p\\n\\n p+=1\\n\\n e.append(child)\\n\\n else:\\n\\n p+=1\\n\\n paint[parent][child]=p\\n\\n paint[child][parent]=p\\n\\n mother_paint[child]=p\\n\\n p+=1\\n\\n e.append(child)\\n\\n if e:\\n\\n d=e\\n\\n e=[]\\n\\n else:\\n\\n d=[]\\n\\n e=[]\\n\\nK=0\\n\\nfor i in range(1,n+1):\\n\\n K=max(K,len(node[i]))\\n\\nprint(K)\\n\\nfor i in range(n-1):\\n\\n s,t=q[i][0],q[i][1]\\n\\n print((paint[s][t]))',\n", + " 'target': '#problem1\\n\\nfrom collections import deque\\n\\nd=deque()\\n\\ne=deque()\\n\\n\\n\\nN=int(eval(input()))\\n\\ngraph=[[] for i in range(N+1)]\\n\\nD=[]\\n\\nfor _ in range(N-1):\\n\\n a,b=list(map(int,input().split()))\\n\\n graph[a].append(b)\\n\\n graph[b].append(a)\\n\\n D.append((a,b))\\n\\n \\n\\n#頂点1からスタート\\n\\nK=0\\n\\nd.append(1)\\n\\nvisited=[False for i in range(N+1)]\\n\\ncolor=[-1 for i in range(N+1)]\\n\\nvisited[1]=True\\n\\ncolor[1]=-1\\n\\ndic={}\\n\\nwhile d:\\n\\n while d:\\n\\n x=d.popleft()\\n\\n par_color=color[x]\\n\\n c=1\\n\\n for node in graph[x]:\\n\\n if visited[node]==False:\\n\\n visited[node]=True\\n\\n e.append(node) \\n\\n if c!=par_color:\\n\\n color[node]=c\\n\\n dic[(x,node)]=c\\n\\n elif c==par_color:\\n\\n c+=1\\n\\n color[node]=c\\n\\n dic[(x,node)]=c\\n\\n c+=1\\n\\n if e:\\n\\n d=e\\n\\n e=deque()\\n\\n\\n\\nA=max(color)\\n\\nprint(A)\\n\\nfor que in D:\\n\\n a,b=que\\n\\n if (a,b) in list(dic.keys()):\\n\\n print((dic[que]))\\n\\n else:\\n\\n print((dic[(b,a)]))\\n\\n ',\n", + " 'code_v0_loc': 63,\n", + " 'code_v1_loc': 52,\n", + " 'code_v0_num_chars': 1430,\n", + " 'code_v1_num_chars': 1084,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nnode = {i: [] for i in range(1, n + 1)}\\nvisited = [False for i in range(n + 1)]\\nq = []\\nfor _ in range(n - 1):\\n a, b = list(map(int, input().split()))\\n node[a].append(b)\\n node[b].append(a)\\n q.append((a, b))\\nmother = q[0][0]\\nvisited[mother] = True\\nd = []\\ne = []\\npaint = {i: {} for i in range(1, n + 1)}\\nmother_paint = [0 for i in range(n + 1)]\\n# 使う要素 node visited paint mother_paint の四つのリスト\\nc = 1\\nfor child in node[mother]:\\n visited[child] = True\\n paint[mother][child] = c\\n paint[child][mother] = c\\n mother_paint[child] = c\\n c += 1\\n d.append(child)\\nwhile d:\\n for parent in d:\\n p = 1\\n for child in node[parent]:\\n if visited[child] == False:\\n visited[child] = True\\n if p != mother_paint[parent]:\\n paint[parent][child] = p\\n paint[child][parent] = p\\n mother_paint[child] = p\\n p += 1\\n e.append(child)\\n else:\\n p += 1\\n paint[parent][child] = p\\n paint[child][parent] = p\\n mother_paint[child] = p\\n p += 1\\n e.append(child)\\n if e:\\n d = e\\n e = []\\n else:\\n d = []\\n e = []\\nK = 0\\nfor i in range(1, n + 1):\\n K = max(K, len(node[i]))\\nprint(K)\\nfor i in range(n - 1):\\n s, t = q[i][0], q[i][1]\\n print((paint[s][t]))\\n',\n", + " 'code_v1_no_empty_lines': '# problem1\\nfrom collections import deque\\n\\nd = deque()\\ne = deque()\\nN = int(eval(input()))\\ngraph = [[] for i in range(N + 1)]\\nD = []\\nfor _ in range(N - 1):\\n a, b = list(map(int, input().split()))\\n graph[a].append(b)\\n graph[b].append(a)\\n D.append((a, b))\\n# 頂点1からスタート\\nK = 0\\nd.append(1)\\nvisited = [False for i in range(N + 1)]\\ncolor = [-1 for i in range(N + 1)]\\nvisited[1] = True\\ncolor[1] = -1\\ndic = {}\\nwhile d:\\n while d:\\n x = d.popleft()\\n par_color = color[x]\\n c = 1\\n for node in graph[x]:\\n if visited[node] == False:\\n visited[node] = True\\n e.append(node)\\n if c != par_color:\\n color[node] = c\\n dic[(x, node)] = c\\n elif c == par_color:\\n c += 1\\n color[node] = c\\n dic[(x, node)] = c\\n c += 1\\n if e:\\n d = e\\n e = deque()\\nA = max(color)\\nprint(A)\\nfor que in D:\\n a, b = que\\n if (a, b) in list(dic.keys()):\\n print((dic[que]))\\n else:\\n print((dic[(b, a)]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.4603174603,\n", + " 'diff': ['-n = int(eval(input()))',\n", + " '-node = {i: [] for i in range(1, n + 1)}',\n", + " '-visited = [False for i in range(n + 1)]',\n", + " '-q = []',\n", + " '-for _ in range(n - 1):',\n", + " '+# problem1',\n", + " '+from collections import deque',\n", + " '+',\n", + " '+d = deque()',\n", + " '+e = deque()',\n", + " '+N = int(eval(input()))',\n", + " '+graph = [[] for i in range(N + 1)]',\n", + " '+D = []',\n", + " '+for _ in range(N - 1):',\n", + " '- node[a].append(b)',\n", + " '- node[b].append(a)',\n", + " '- q.append((a, b))',\n", + " '-mother = q[0][0]',\n", + " '-visited[mother] = True',\n", + " '-d = []',\n", + " '-e = []',\n", + " '-paint = {i: {} for i in range(1, n + 1)}',\n", + " '-mother_paint = [0 for i in range(n + 1)]',\n", + " '-# 使う要素 node visited paint mother_paint の四つのリスト',\n", + " '-c = 1',\n", + " '-for child in node[mother]:',\n", + " '- visited[child] = True',\n", + " '- paint[mother][child] = c',\n", + " '- paint[child][mother] = c',\n", + " '- mother_paint[child] = c',\n", + " '- c += 1',\n", + " '- d.append(child)',\n", + " '+ graph[a].append(b)',\n", + " '+ graph[b].append(a)',\n", + " '+ D.append((a, b))',\n", + " '+# 頂点1からスタート',\n", + " '+K = 0',\n", + " '+d.append(1)',\n", + " '+visited = [False for i in range(N + 1)]',\n", + " '+color = [-1 for i in range(N + 1)]',\n", + " '+visited[1] = True',\n", + " '+color[1] = -1',\n", + " '+dic = {}',\n", + " '- for parent in d:',\n", + " '- p = 1',\n", + " '- for child in node[parent]:',\n", + " '- if visited[child] == False:',\n", + " '- visited[child] = True',\n", + " '- if p != mother_paint[parent]:',\n", + " '- paint[parent][child] = p',\n", + " '- paint[child][parent] = p',\n", + " '- mother_paint[child] = p',\n", + " '- p += 1',\n", + " '- e.append(child)',\n", + " '- else:',\n", + " '- p += 1',\n", + " '- paint[parent][child] = p',\n", + " '- paint[child][parent] = p',\n", + " '- mother_paint[child] = p',\n", + " '- p += 1',\n", + " '- e.append(child)',\n", + " '+ while d:',\n", + " '+ x = d.popleft()',\n", + " '+ par_color = color[x]',\n", + " '+ c = 1',\n", + " '+ for node in graph[x]:',\n", + " '+ if visited[node] == False:',\n", + " '+ visited[node] = True',\n", + " '+ e.append(node)',\n", + " '+ if c != par_color:',\n", + " '+ color[node] = c',\n", + " '+ dic[(x, node)] = c',\n", + " '+ elif c == par_color:',\n", + " '+ c += 1',\n", + " '+ color[node] = c',\n", + " '+ dic[(x, node)] = c',\n", + " '+ c += 1',\n", + " '- e = []',\n", + " '+ e = deque()',\n", + " '+A = max(color)',\n", + " '+print(A)',\n", + " '+for que in D:',\n", + " '+ a, b = que',\n", + " '+ if (a, b) in list(dic.keys()):',\n", + " '+ print((dic[que]))',\n", + " '- d = []',\n", + " '- e = []',\n", + " '-K = 0',\n", + " '-for i in range(1, n + 1):',\n", + " '- K = max(K, len(node[i]))',\n", + " '-print(K)',\n", + " '-for i in range(n - 1):',\n", + " '- s, t = q[i][0], q[i][1]',\n", + " '- print((paint[s][t]))',\n", + " '+ print((dic[(b, a)]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3284679053,\n", + " 'measured_runtime_v1': 0.2336777339,\n", + " 'runtime_lift': 1.4056448588,\n", + " 'key': ['s056526441', 's495635102']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's318797824',\n", + " 'submission_id_v1': 's144298652',\n", + " 'cpu_time_v0': 728,\n", + " 'cpu_time_v1': 566,\n", + " 'memory_v0': 25020,\n", + " 'memory_v1': 16292,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.25,\n", + " 'input': 'import sys\\n\\nimport numpy as np\\n\\nfrom fractions import gcd\\n\\nfrom functools import reduce\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN, M = lr()\\n\\nA = np.array(lr())\\n\\nB = A // 2\\n\\n# Bの要素が全て2の同じ冪乗\\n\\n# Bの最小公倍数を求める\\n\\ndef merge(a, b):\\n\\n g = gcd(a, b)\\n\\n a, b = a // g, b // g\\n\\n if a%2 == 0 or b%2 == 0:\\n\\n return 0\\n\\n ret = a * b * g\\n\\n if ret > 10 ** 9:\\n\\n return 0\\n\\n return ret\\n\\n\\n\\nx = reduce(merge, B)\\n\\nif x == 0:\\n\\n answer = 0\\n\\nelse:\\n\\n answer = M // x - M // (2*x)\\n\\n\\n\\nprint(answer)\\n\\n# 56',\n", + " 'target': 'import sys\\n\\nfrom fractions import gcd\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\n# A が2で何回割れるか\\n\\nN, M = lr()\\n\\nA = lr()\\n\\nA = [x // 2 for x in A]\\n\\ncnt = 0\\n\\nwhile all(x%2 == 0 for x in A):\\n\\n cnt += 1\\n\\n A = [x // 2 for x in A]\\n\\n\\n\\nif any(x%2 == 0 for x in A):\\n\\n print((0)); exit()\\n\\n\\n\\nlcm = 1\\n\\nfor a in A:\\n\\n lcm *= a // gcd(lcm, a)\\n\\n\\n\\nanswer = M // (2 ** cnt * lcm) - M // (2 ** (cnt+1) * lcm)\\n\\nprint(answer)\\n\\n# 21\\n',\n", + " 'code_v0_loc': 32,\n", + " 'code_v1_loc': 26,\n", + " 'code_v0_num_chars': 585,\n", + " 'code_v1_num_chars': 491,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\nfrom fractions import gcd\\nfrom functools import reduce\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN, M = lr()\\nA = np.array(lr())\\nB = A // 2\\n# Bの要素が全て2の同じ冪乗\\n# Bの最小公倍数を求める\\ndef merge(a, b):\\n g = gcd(a, b)\\n a, b = a // g, b // g\\n if a % 2 == 0 or b % 2 == 0:\\n return 0\\n ret = a * b * g\\n if ret > 10**9:\\n return 0\\n return ret\\n\\n\\nx = reduce(merge, B)\\nif x == 0:\\n answer = 0\\nelse:\\n answer = M // x - M // (2 * x)\\nprint(answer)\\n# 56\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom fractions import gcd\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\n# A が2で何回割れるか\\nN, M = lr()\\nA = lr()\\nA = [x // 2 for x in A]\\ncnt = 0\\nwhile all(x % 2 == 0 for x in A):\\n cnt += 1\\n A = [x // 2 for x in A]\\nif any(x % 2 == 0 for x in A):\\n print((0))\\n exit()\\nlcm = 1\\nfor a in A:\\n lcm *= a // gcd(lcm, a)\\nanswer = M // (2**cnt * lcm) - M // (2 ** (cnt + 1) * lcm)\\nprint(answer)\\n# 21\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 18.75,\n", + " 'diff': ['-import numpy as np',\n", + " '-from functools import reduce',\n", + " '+# A が2で何回割れるか',\n", + " '-A = np.array(lr())',\n", + " '-B = A // 2',\n", + " '-# Bの要素が全て2の同じ冪乗',\n", + " '-# Bの最小公倍数を求める',\n", + " '-def merge(a, b):',\n", + " '- g = gcd(a, b)',\n", + " '- a, b = a // g, b // g',\n", + " '- if a % 2 == 0 or b % 2 == 0:',\n", + " '- return 0',\n", + " '- ret = a * b * g',\n", + " '- if ret > 10**9:',\n", + " '- return 0',\n", + " '- return ret',\n", + " '-',\n", + " '-',\n", + " '-x = reduce(merge, B)',\n", + " '-if x == 0:',\n", + " '- answer = 0',\n", + " '-else:',\n", + " '- answer = M // x - M // (2 * x)',\n", + " '+A = lr()',\n", + " '+A = [x // 2 for x in A]',\n", + " '+cnt = 0',\n", + " '+while all(x % 2 == 0 for x in A):',\n", + " '+ cnt += 1',\n", + " '+ A = [x // 2 for x in A]',\n", + " '+if any(x % 2 == 0 for x in A):',\n", + " '+ print((0))',\n", + " '+ exit()',\n", + " '+lcm = 1',\n", + " '+for a in A:',\n", + " '+ lcm *= a // gcd(lcm, a)',\n", + " '+answer = M // (2**cnt * lcm) - M // (2 ** (cnt + 1) * lcm)',\n", + " '-# 56',\n", + " '+# 21'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3948377199,\n", + " 'measured_runtime_v1': 0.2599134052,\n", + " 'runtime_lift': 5.3665478273,\n", + " 'key': ['s318797824', 's144298652']},\n", + " {'user_id': 'u732061897',\n", + " 'problem_id': 'p03273',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's132976376',\n", + " 'submission_id_v1': 's531161710',\n", + " 'cpu_time_v0': 40,\n", + " 'cpu_time_v1': 32,\n", + " 'memory_v0': 9468,\n", + " 'memory_v1': 9364,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.0,\n", + " 'input': \"H, W = list(map(int, input().split()))\\n\\nHW_list = [list(eval(input())) for i in range(H)]\\n\\nimport copy\\n\\n\\n\\ntmp = copy.deepcopy(HW_list)\\n\\nh_index = 0\\n\\nfor i, HW in enumerate(HW_list):\\n\\n is_all_shiro = True\\n\\n for hw in HW:\\n\\n if hw == '#':\\n\\n is_all_shiro = False\\n\\n h_index += 1\\n\\n break\\n\\n if is_all_shiro:\\n\\n tmp.pop(h_index)\\n\\nw_index = 0\\n\\nans = copy.deepcopy(tmp)\\n\\nfor w in range(W):\\n\\n is_all_shiro = True\\n\\n for t in tmp:\\n\\n if t[w] == '#':\\n\\n is_all_shiro = False\\n\\n w_index += 1\\n\\n break\\n\\n if is_all_shiro:\\n\\n for a in ans:\\n\\n a.pop(w_index)\\n\\nfor A in ans:\\n\\n print((''.join(A)))\\n\",\n", + " 'target': \"H, W = list(map(int, input().split()))\\n\\nHW_list = [list(eval(input())) for i in range(H)]\\n\\nimport copy\\n\\n\\n\\ntate = [False] * H\\n\\nyoko = [False] * W\\n\\n\\n\\nfor h in range(H):\\n\\n for w in range(W):\\n\\n if HW_list[h][w] == '#':\\n\\n tate[h] = True\\n\\n yoko[w] = True\\n\\n\\n\\nfor h in range(H):\\n\\n tmp = ''\\n\\n for w in range(W):\\n\\n if tate[h] and yoko[w]:\\n\\n tmp += HW_list[h][w]\\n\\n if tmp == '':\\n\\n continue\\n\\n print(tmp)\\n\",\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 682,\n", + " 'code_v1_num_chars': 449,\n", + " 'code_v0_no_empty_lines': 'H, W = list(map(int, input().split()))\\nHW_list = [list(eval(input())) for i in range(H)]\\nimport copy\\n\\ntmp = copy.deepcopy(HW_list)\\nh_index = 0\\nfor i, HW in enumerate(HW_list):\\n is_all_shiro = True\\n for hw in HW:\\n if hw == \"#\":\\n is_all_shiro = False\\n h_index += 1\\n break\\n if is_all_shiro:\\n tmp.pop(h_index)\\nw_index = 0\\nans = copy.deepcopy(tmp)\\nfor w in range(W):\\n is_all_shiro = True\\n for t in tmp:\\n if t[w] == \"#\":\\n is_all_shiro = False\\n w_index += 1\\n break\\n if is_all_shiro:\\n for a in ans:\\n a.pop(w_index)\\nfor A in ans:\\n print((\"\".join(A)))\\n',\n", + " 'code_v1_no_empty_lines': 'H, W = list(map(int, input().split()))\\nHW_list = [list(eval(input())) for i in range(H)]\\nimport copy\\n\\ntate = [False] * H\\nyoko = [False] * W\\nfor h in range(H):\\n for w in range(W):\\n if HW_list[h][w] == \"#\":\\n tate[h] = True\\n yoko[w] = True\\nfor h in range(H):\\n tmp = \"\"\\n for w in range(W):\\n if tate[h] and yoko[w]:\\n tmp += HW_list[h][w]\\n if tmp == \"\":\\n continue\\n print(tmp)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 27.5862068966,\n", + " 'diff': ['-tmp = copy.deepcopy(HW_list)',\n", + " '-h_index = 0',\n", + " '-for i, HW in enumerate(HW_list):',\n", + " '- is_all_shiro = True',\n", + " '- for hw in HW:',\n", + " '- if hw == \"#\":',\n", + " '- is_all_shiro = False',\n", + " '- h_index += 1',\n", + " '- break',\n", + " '- if is_all_shiro:',\n", + " '- tmp.pop(h_index)',\n", + " '-w_index = 0',\n", + " '-ans = copy.deepcopy(tmp)',\n", + " '-for w in range(W):',\n", + " '- is_all_shiro = True',\n", + " '- for t in tmp:',\n", + " '- if t[w] == \"#\":',\n", + " '- is_all_shiro = False',\n", + " '- w_index += 1',\n", + " '- break',\n", + " '- if is_all_shiro:',\n", + " '- for a in ans:',\n", + " '- a.pop(w_index)',\n", + " '-for A in ans:',\n", + " '- print((\"\".join(A)))',\n", + " '+tate = [False] * H',\n", + " '+yoko = [False] * W',\n", + " '+for h in range(H):',\n", + " '+ for w in range(W):',\n", + " '+ if HW_list[h][w] == \"#\":',\n", + " '+ tate[h] = True',\n", + " '+ yoko[w] = True',\n", + " '+for h in range(H):',\n", + " '+ tmp = \"\"',\n", + " '+ for w in range(W):',\n", + " '+ if tate[h] and yoko[w]:',\n", + " '+ tmp += HW_list[h][w]',\n", + " '+ if tmp == \"\":',\n", + " '+ continue',\n", + " '+ print(tmp)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2898663879,\n", + " 'measured_runtime_v1': 0.204775079,\n", + " 'runtime_lift': 1.415535471,\n", + " 'key': ['s132976376', 's531161710']},\n", + " {'user_id': 'u881590806',\n", + " 'problem_id': 'p02264',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's309974156',\n", + " 'submission_id_v1': 's779537604',\n", + " 'cpu_time_v0': 780,\n", + " 'cpu_time_v1': 600,\n", + " 'memory_v0': 14072,\n", + " 'memory_v1': 28548,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.08,\n", + " 'input': \"class Queue:\\n\\n def __init__(self,values):\\n\\n self.values = values\\n\\n\\n\\n def empty(self):\\n\\n if len(self.values) == 0:\\n\\n return True\\n\\n else:\\n\\n return False\\n\\n\\n\\n def enqueue(self,v):\\n\\n self.values.append(v)\\n\\n\\n\\n def dequeue(self):\\n\\n if len(self.values) <= 0:\\n\\n raise\\n\\n else:\\n\\n v = self.values[0]\\n\\n del self.values[0]\\n\\n return v\\n\\n\\n\\nn,q = list(map(int,input().split(' ')))\\n\\nprocesses = []\\n\\nfor i in range(n):\\n\\n n,t = input().split(' ')\\n\\n processes.append((n,int(t)))\\n\\n\\n\\nqueue = Queue(processes)\\n\\n\\n\\nclock = 0\\n\\ndone = []\\n\\nwhile not queue.empty():\\n\\n p = queue.dequeue()\\n\\n n = p[0]\\n\\n t = p[1]\\n\\n if t <= q:\\n\\n clock+=t\\n\\n done.append((n,clock))\\n\\n else:\\n\\n queue.enqueue((n,t-q))\\n\\n clock+=q\\n\\n\\n\\nfor p in done:\\n\\n print(p[0],p[1])\",\n", + " 'target': \"class Queue:\\n\\n def __init__(self,l):\\n\\n self.values = []\\n\\n self.l = l\\n\\n for _ in range(l):\\n\\n self.values.append(None)\\n\\n self.head = 0\\n\\n self.tail = 0\\n\\n def inc(self,n):\\n\\n if n+1 >= self.l:\\n\\n return 0\\n\\n else:\\n\\n return n+1\\n\\n def enqueue(self,v):\\n\\n if self.inc(self.head) == self.tail:\\n\\n print('overflow')\\n\\n exit()\\n\\n self.values[self.head] = v\\n\\n self.head = self.inc(self.head)\\n\\n def dequeue(self):\\n\\n if self.head == self.tail:\\n\\n print('underflow')\\n\\n exit()\\n\\n v = self.values[self.tail]\\n\\n self.tail = self.inc(self.tail)\\n\\n return v\\n\\n def size(self):\\n\\n if self.head >= self.tail:\\n\\n return self.head-self.tail\\n\\n else:\\n\\n self.head + (self.l-self.tail)\\n\\n\\n\\nn,q = list(map(int,input().split(' ')))\\n\\nqueue = Queue(200000)\\n\\nfor _ in range(n):\\n\\n n,t = input().split(' ')\\n\\n t = int(t)\\n\\n queue.enqueue((n,t))\\n\\n\\n\\nc = 0\\n\\nwhile queue.size()>0:\\n\\n n,t = queue.dequeue()\\n\\n if t <= q:\\n\\n c += t\\n\\n print(n,c)\\n\\n else:\\n\\n queue.enqueue((n,t-q))\\n\\n c += q\",\n", + " 'code_v0_loc': 44,\n", + " 'code_v1_loc': 48,\n", + " 'code_v0_num_chars': 881,\n", + " 'code_v1_num_chars': 1197,\n", + " 'code_v0_no_empty_lines': 'class Queue:\\n def __init__(self, values):\\n self.values = values\\n\\n def empty(self):\\n if len(self.values) == 0:\\n return True\\n else:\\n return False\\n\\n def enqueue(self, v):\\n self.values.append(v)\\n\\n def dequeue(self):\\n if len(self.values) <= 0:\\n raise\\n else:\\n v = self.values[0]\\n del self.values[0]\\n return v\\n\\n\\nn, q = list(map(int, input().split(\" \")))\\nprocesses = []\\nfor i in range(n):\\n n, t = input().split(\" \")\\n processes.append((n, int(t)))\\nqueue = Queue(processes)\\nclock = 0\\ndone = []\\nwhile not queue.empty():\\n p = queue.dequeue()\\n n = p[0]\\n t = p[1]\\n if t <= q:\\n clock += t\\n done.append((n, clock))\\n else:\\n queue.enqueue((n, t - q))\\n clock += q\\nfor p in done:\\n print(p[0], p[1])\\n',\n", + " 'code_v1_no_empty_lines': 'class Queue:\\n def __init__(self, l):\\n self.values = []\\n self.l = l\\n for _ in range(l):\\n self.values.append(None)\\n self.head = 0\\n self.tail = 0\\n\\n def inc(self, n):\\n if n + 1 >= self.l:\\n return 0\\n else:\\n return n + 1\\n\\n def enqueue(self, v):\\n if self.inc(self.head) == self.tail:\\n print(\"overflow\")\\n exit()\\n self.values[self.head] = v\\n self.head = self.inc(self.head)\\n\\n def dequeue(self):\\n if self.head == self.tail:\\n print(\"underflow\")\\n exit()\\n v = self.values[self.tail]\\n self.tail = self.inc(self.tail)\\n return v\\n\\n def size(self):\\n if self.head >= self.tail:\\n return self.head - self.tail\\n else:\\n self.head + (self.l - self.tail)\\n\\n\\nn, q = list(map(int, input().split(\" \")))\\nqueue = Queue(200000)\\nfor _ in range(n):\\n n, t = input().split(\" \")\\n t = int(t)\\n queue.enqueue((n, t))\\nc = 0\\nwhile queue.size() > 0:\\n n, t = queue.dequeue()\\n if t <= q:\\n c += t\\n print(n, c)\\n else:\\n queue.enqueue((n, t - q))\\n c += q\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['- def __init__(self, values):',\n", + " '- self.values = values',\n", + " '+ def __init__(self, l):',\n", + " '+ self.values = []',\n", + " '+ self.l = l',\n", + " '+ for _ in range(l):',\n", + " '+ self.values.append(None)',\n", + " '+ self.head = 0',\n", + " '+ self.tail = 0',\n", + " '- def empty(self):',\n", + " '- if len(self.values) == 0:',\n", + " '- return True',\n", + " '+ def inc(self, n):',\n", + " '+ if n + 1 >= self.l:',\n", + " '+ return 0',\n", + " '- return False',\n", + " '+ return n + 1',\n", + " '- self.values.append(v)',\n", + " '+ if self.inc(self.head) == self.tail:',\n", + " '+ print(\"overflow\")',\n", + " '+ exit()',\n", + " '+ self.values[self.head] = v',\n", + " '+ self.head = self.inc(self.head)',\n", + " '- if len(self.values) <= 0:',\n", + " '- raise',\n", + " '+ if self.head == self.tail:',\n", + " '+ print(\"underflow\")',\n", + " '+ exit()',\n", + " '+ v = self.values[self.tail]',\n", + " '+ self.tail = self.inc(self.tail)',\n", + " '+ return v',\n", + " '+',\n", + " '+ def size(self):',\n", + " '+ if self.head >= self.tail:',\n", + " '+ return self.head - self.tail',\n", + " '- v = self.values[0]',\n", + " '- del self.values[0]',\n", + " '- return v',\n", + " '+ self.head + (self.l - self.tail)',\n", + " '-processes = []',\n", + " '-for i in range(n):',\n", + " '+queue = Queue(200000)',\n", + " '+for _ in range(n):',\n", + " '- processes.append((n, int(t)))',\n", + " '-queue = Queue(processes)',\n", + " '-clock = 0',\n", + " '-done = []',\n", + " '-while not queue.empty():',\n", + " '- p = queue.dequeue()',\n", + " '- n = p[0]',\n", + " '- t = p[1]',\n", + " '+ t = int(t)',\n", + " '+ queue.enqueue((n, t))',\n", + " '+c = 0',\n", + " '+while queue.size() > 0:',\n", + " '+ n, t = queue.dequeue()',\n", + " '- clock += t',\n", + " '- done.append((n, clock))',\n", + " '+ c += t',\n", + " '+ print(n, c)',\n", + " '- clock += q',\n", + " '-for p in done:',\n", + " '- print(p[0], p[1])',\n", + " '+ c += q'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3044010155,\n", + " 'measured_runtime_v1': 0.1198908706,\n", + " 'runtime_lift': 2.5389841115,\n", + " 'key': ['s309974156', 's779537604']},\n", + " {'user_id': 'u394853232',\n", + " 'problem_id': 'p03457',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's138460182',\n", + " 'submission_id_v1': 's158223063',\n", + " 'cpu_time_v0': 868,\n", + " 'cpu_time_v1': 399,\n", + " 'memory_v0': 21636,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.03,\n", + " 'input': \"import numpy as np\\n\\nn = int(eval(input()))\\n\\nT = []\\n\\nX = []\\n\\nY = []\\n\\nt1 = 0\\n\\nx1 = 0\\n\\ny1 = 0\\n\\nfor i in range(n):\\n\\n m = input().split()\\n\\n T.append(int(m[0]) - t1)\\n\\n t1 = int(m[0])\\n\\n X.append(abs(int(m[1]) - x1))\\n\\n x1 = int(m[1])\\n\\n Y.append(abs(int(m[2]) - y1))\\n\\n y1 = int(m[2])\\n\\nT = np.array(T)\\n\\nX = np.array(X)\\n\\nY = np.array(Y)\\n\\nfor i in range(n):\\n\\n if X[i] + Y[i] > T[i] or (X[i] + Y[i] + T[i]) % 2 == 1:\\n\\n print('No')\\n\\n break\\n\\nelse:\\n\\n print('Yes')\",\n", + " 'target': \"n = int(eval(input()))\\n\\nt1 = 0\\n\\nx1 = 0\\n\\ny1 = 0\\n\\nboolean = True\\n\\n\\n\\nfor __ in range(n):\\n\\n t, x, y = [int(_) for _ in input().split()]\\n\\n if boolean:\\n\\n temp1 = x\\n\\n temp2 = t\\n\\n x = abs(x - x1) + abs(y - y1)\\n\\n t -= t1\\n\\n x1 = temp1\\n\\n y1 = y\\n\\n t1 = temp2\\n\\n if x > t or (x + t) % 2 == 1:\\n\\n boolean = False\\n\\nif boolean:\\n\\n print('Yes')\\n\\nelse:\\n\\n print('No')\",\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 482,\n", + " 'code_v1_num_chars': 418,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nT = []\\nX = []\\nY = []\\nt1 = 0\\nx1 = 0\\ny1 = 0\\nfor i in range(n):\\n m = input().split()\\n T.append(int(m[0]) - t1)\\n t1 = int(m[0])\\n X.append(abs(int(m[1]) - x1))\\n x1 = int(m[1])\\n Y.append(abs(int(m[2]) - y1))\\n y1 = int(m[2])\\nT = np.array(T)\\nX = np.array(X)\\nY = np.array(Y)\\nfor i in range(n):\\n if X[i] + Y[i] > T[i] or (X[i] + Y[i] + T[i]) % 2 == 1:\\n print(\"No\")\\n break\\nelse:\\n print(\"Yes\")\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\nt1 = 0\\nx1 = 0\\ny1 = 0\\nboolean = True\\nfor __ in range(n):\\n t, x, y = [int(_) for _ in input().split()]\\n if boolean:\\n temp1 = x\\n temp2 = t\\n x = abs(x - x1) + abs(y - y1)\\n t -= t1\\n x1 = temp1\\n y1 = y\\n t1 = temp2\\n if x > t or (x + t) % 2 == 1:\\n boolean = False\\nif boolean:\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-T = []',\n", + " '-X = []',\n", + " '-Y = []',\n", + " '-for i in range(n):',\n", + " '- m = input().split()',\n", + " '- T.append(int(m[0]) - t1)',\n", + " '- t1 = int(m[0])',\n", + " '- X.append(abs(int(m[1]) - x1))',\n", + " '- x1 = int(m[1])',\n", + " '- Y.append(abs(int(m[2]) - y1))',\n", + " '- y1 = int(m[2])',\n", + " '-T = np.array(T)',\n", + " '-X = np.array(X)',\n", + " '-Y = np.array(Y)',\n", + " '-for i in range(n):',\n", + " '- if X[i] + Y[i] > T[i] or (X[i] + Y[i] + T[i]) % 2 == 1:',\n", + " '- print(\"No\")',\n", + " '- break',\n", + " '+boolean = True',\n", + " '+for __ in range(n):',\n", + " '+ t, x, y = [int(_) for _ in input().split()]',\n", + " '+ if boolean:',\n", + " '+ temp1 = x',\n", + " '+ temp2 = t',\n", + " '+ x = abs(x - x1) + abs(y - y1)',\n", + " '+ t -= t1',\n", + " '+ x1 = temp1',\n", + " '+ y1 = y',\n", + " '+ t1 = temp2',\n", + " '+ if x > t or (x + t) % 2 == 1:',\n", + " '+ boolean = False',\n", + " '+if boolean:',\n", + " '+ print(\"Yes\")',\n", + " '- print(\"Yes\")',\n", + " '+ print(\"No\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.386622709,\n", + " 'measured_runtime_v1': 0.2001591682,\n", + " 'runtime_lift': 6.927600275,\n", + " 'key': ['s138460182', 's158223063']},\n", + " {'user_id': 'u437215432',\n", + " 'problem_id': 'p02983',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's509898718',\n", + " 'submission_id_v1': 's212066250',\n", + " 'cpu_time_v0': 170,\n", + " 'cpu_time_v1': 37,\n", + " 'memory_v0': 12504,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 78.24,\n", + " 'input': 'import numpy as np\\n\\n\\n\\ndef ABC133C(l, r):\\n\\n Min = np.inf\\n\\n for i in range(l, r):\\n\\n for j in range(i+1, r+1):\\n\\n a = (i * j) % 2019\\n\\n if a < Min:\\n\\n Min = a\\n\\n if a == 0: # ここに注目\\n\\n print(Min)\\n\\n return\\n\\n print(Min)\\n\\n\\n\\nl, r = list(map(int, input().split()))\\n\\nABC133C(l, r)\\n',\n", + " 'target': 'def ABC133C(l, r):\\n\\n Min = 1e10\\n\\n for i in range(l, r):\\n\\n for j in range(i+1, r+1):\\n\\n a = (i * j) % 2019\\n\\n if a < Min:\\n\\n Min = a\\n\\n if a == 0: # ここに注目\\n\\n print(Min)\\n\\n return\\n\\n print(Min)\\n\\n\\n\\nl, r = list(map(int, input().split()))\\n\\nABC133C(l, r)\\n',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 366,\n", + " 'code_v1_num_chars': 342,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n\\ndef ABC133C(l, r):\\n Min = np.inf\\n for i in range(l, r):\\n for j in range(i + 1, r + 1):\\n a = (i * j) % 2019\\n if a < Min:\\n Min = a\\n if a == 0: # ここに注目\\n print(Min)\\n return\\n print(Min)\\n\\n\\nl, r = list(map(int, input().split()))\\nABC133C(l, r)\\n',\n", + " 'code_v1_no_empty_lines': 'def ABC133C(l, r):\\n Min = 1e10\\n for i in range(l, r):\\n for j in range(i + 1, r + 1):\\n a = (i * j) % 2019\\n if a < Min:\\n Min = a\\n if a == 0: # ここに注目\\n print(Min)\\n return\\n print(Min)\\n\\n\\nl, r = list(map(int, input().split()))\\nABC133C(l, r)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-',\n", + " '- Min = np.inf',\n", + " '+ Min = 1e10'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 3.2830341155,\n", + " 'measured_runtime_v1': 0.4719189459,\n", + " 'runtime_lift': 6.956775403,\n", + " 'key': ['s509898718', 's212066250']},\n", + " {'user_id': 'u285891772',\n", + " 'problem_id': 'p02725',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's026186608',\n", + " 'submission_id_v1': 's563865299',\n", + " 'cpu_time_v0': 309,\n", + " 'cpu_time_v1': 236,\n", + " 'memory_v0': 35140,\n", + " 'memory_v1': 27236,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 23.62,\n", + " 'input': \"import sys, re\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\n\\nfrom itertools import accumulate, permutations, combinations, product, groupby\\n\\nfrom operator import itemgetter, mul\\n\\nfrom copy import deepcopy\\n\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\n\\nfrom bisect import bisect, bisect_left\\n\\nfrom fractions import gcd\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import reduce\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\ndef ZIP(n): return list(zip(*(MAP() for _ in range(n))))\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float('inf')\\n\\nmod = 10 ** 9 + 7\\n\\nimport numpy as np\\n\\n\\n\\nK, N = MAP()\\n\\nA = LIST()\\n\\nA.append(A[0]+K)\\n\\n\\n\\nB = np.zeros(N)\\n\\nfor i in range(N):\\n\\n \\t\\tB[i] = A[i+1] - A[i]\\n\\n\\n\\nprint((int(K - max(B))))\",\n", + " 'target': \"import sys, re\\n\\nfrom collections import deque, defaultdict, Counter\\n\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\n\\nfrom itertools import accumulate, permutations, combinations, product, groupby\\n\\nfrom operator import itemgetter, mul\\n\\nfrom copy import deepcopy\\n\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\n\\nfrom bisect import bisect, bisect_left\\n\\nfrom fractions import gcd\\n\\nfrom heapq import heappush, heappop\\n\\nfrom functools import reduce\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\ndef INT(): return int(eval(input()))\\n\\ndef MAP(): return list(map(int, input().split()))\\n\\ndef LIST(): return list(map(int, input().split()))\\n\\ndef ZIP(n): return list(zip(*(MAP() for _ in range(n))))\\n\\nsys.setrecursionlimit(10 ** 9)\\n\\nINF = float('inf')\\n\\nmod = 10 ** 9 + 7\\n\\n\\n\\nK, N = MAP()\\n\\nA = LIST()\\n\\ndiff = abs(K - A[-1] + A[0])\\n\\nd = abs(K - A[-1] + A[0])\\n\\nif N == 2:\\n\\n print((min(d, A[1] - A[0])))\\n\\n exit()\\n\\nfor i in range(1, N):\\n\\n d += abs(A[i] - A[i-1])\\n\\n diff = max(diff, abs(A[i] - A[i-1]))\\n\\nprint((d - diff))\",\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 936,\n", + " 'code_v1_num_chars': 1023,\n", + " 'code_v0_no_empty_lines': 'import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\nfrom itertools import accumulate, permutations, combinations, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left\\nfrom fractions import gcd\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST():\\n return list(map(int, input().split()))\\n\\n\\ndef ZIP(n):\\n return list(zip(*(MAP() for _ in range(n))))\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nmod = 10**9 + 7\\nimport numpy as np\\n\\nK, N = MAP()\\nA = LIST()\\nA.append(A[0] + K)\\nB = np.zeros(N)\\nfor i in range(N):\\n B[i] = A[i + 1] - A[i]\\nprint((int(K - max(B))))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\\nfrom itertools import accumulate, permutations, combinations, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left\\nfrom fractions import gcd\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef INT():\\n return int(eval(input()))\\n\\n\\ndef MAP():\\n return list(map(int, input().split()))\\n\\n\\ndef LIST():\\n return list(map(int, input().split()))\\n\\n\\ndef ZIP(n):\\n return list(zip(*(MAP() for _ in range(n))))\\n\\n\\nsys.setrecursionlimit(10**9)\\nINF = float(\"inf\")\\nmod = 10**9 + 7\\nK, N = MAP()\\nA = LIST()\\ndiff = abs(K - A[-1] + A[0])\\nd = abs(K - A[-1] + A[0])\\nif N == 2:\\n print((min(d, A[1] - A[0])))\\n exit()\\nfor i in range(1, N):\\n d += abs(A[i] - A[i - 1])\\n diff = max(diff, abs(A[i] - A[i - 1]))\\nprint((d - diff))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 3.2258064516,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-A.append(A[0] + K)',\n", + " '-B = np.zeros(N)',\n", + " '-for i in range(N):',\n", + " '- B[i] = A[i + 1] - A[i]',\n", + " '-print((int(K - max(B))))',\n", + " '+diff = abs(K - A[-1] + A[0])',\n", + " '+d = abs(K - A[-1] + A[0])',\n", + " '+if N == 2:',\n", + " '+ print((min(d, A[1] - A[0])))',\n", + " '+ exit()',\n", + " '+for i in range(1, N):',\n", + " '+ d += abs(A[i] - A[i - 1])',\n", + " '+ diff = max(diff, abs(A[i] - A[i - 1]))',\n", + " '+print((d - diff))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.6886389652,\n", + " 'measured_runtime_v1': 0.2032547581,\n", + " 'runtime_lift': 8.3079922987,\n", + " 'key': ['s026186608', 's563865299']},\n", + " {'user_id': 'u333190709',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's264866690',\n", + " 'submission_id_v1': 's762683898',\n", + " 'cpu_time_v0': 127,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 5304,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 86.61,\n", + " 'input': \"#!/usr/bin/env python3\\n\\nimport sys, math, fractions, itertools\\n\\n\\n\\n\\n\\ndef solve(A: int, B: int, C: int, X: int, Y: int):\\n\\n mn = 1e9\\n\\n for i in range(0, 2*(max(X, Y)+1), 2):\\n\\n mn = min(mn, C*i+A*max(X-i//2, 0)+B*max(Y-i//2, 0))\\n\\n print((int(mn)))\\n\\n return\\n\\n\\n\\n\\n\\n# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\\n\\ndef main():\\n\\n def iterate_tokens():\\n\\n for line in sys.stdin:\\n\\n for word in line.split():\\n\\n yield word\\n\\n tokens = iterate_tokens()\\n\\n A = int(next(tokens)) # type: int\\n\\n B = int(next(tokens)) # type: int\\n\\n C = int(next(tokens)) # type: int\\n\\n X = int(next(tokens)) # type: int\\n\\n Y = int(next(tokens)) # type: int\\n\\n solve(A, B, C, X, Y)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'target': \"#!/usr/bin/env python3\\n\\nimport sys\\n\\n\\n\\n\\n\\ndef solve(A: int, B: int, C: int, X: int, Y: int):\\n\\n c = 0\\n\\n if (A + B < 2 * C):\\n\\n c += min(X, Y) * (A + B)\\n\\n else:\\n\\n c += min(X, Y) * 2 * C\\n\\n if X > Y:\\n\\n c += (X - Y) * min(A, 2 * C)\\n\\n else:\\n\\n c += (Y - X) * min(B, 2 * C)\\n\\n print(c)\\n\\n return\\n\\n\\n\\n\\n\\n# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\\n\\ndef main():\\n\\n def iterate_tokens():\\n\\n for line in sys.stdin:\\n\\n for word in line.split():\\n\\n yield word\\n\\n tokens = iterate_tokens()\\n\\n A = int(next(tokens)) # type: int\\n\\n B = int(next(tokens)) # type: int\\n\\n C = int(next(tokens)) # type: int\\n\\n X = int(next(tokens)) # type: int\\n\\n Y = int(next(tokens)) # type: int\\n\\n solve(A, B, C, X, Y)\\n\\n\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 34,\n", + " 'code_v0_num_chars': 879,\n", + " 'code_v1_num_chars': 941,\n", + " 'code_v0_no_empty_lines': '#!/usr/bin/env python3\\nimport sys, math, fractions, itertools\\n\\n\\ndef solve(A: int, B: int, C: int, X: int, Y: int):\\n mn = 1e9\\n for i in range(0, 2 * (max(X, Y) + 1), 2):\\n mn = min(mn, C * i + A * max(X - i // 2, 0) + B * max(Y - i // 2, 0))\\n print((int(mn)))\\n return\\n\\n\\n# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\\ndef main():\\n def iterate_tokens():\\n for line in sys.stdin:\\n for word in line.split():\\n yield word\\n\\n tokens = iterate_tokens()\\n A = int(next(tokens)) # type: int\\n B = int(next(tokens)) # type: int\\n C = int(next(tokens)) # type: int\\n X = int(next(tokens)) # type: int\\n Y = int(next(tokens)) # type: int\\n solve(A, B, C, X, Y)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': '#!/usr/bin/env python3\\nimport sys\\n\\n\\ndef solve(A: int, B: int, C: int, X: int, Y: int):\\n c = 0\\n if A + B < 2 * C:\\n c += min(X, Y) * (A + B)\\n else:\\n c += min(X, Y) * 2 * C\\n if X > Y:\\n c += (X - Y) * min(A, 2 * C)\\n else:\\n c += (Y - X) * min(B, 2 * C)\\n print(c)\\n return\\n\\n\\n# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\\ndef main():\\n def iterate_tokens():\\n for line in sys.stdin:\\n for word in line.split():\\n yield word\\n\\n tokens = iterate_tokens()\\n A = int(next(tokens)) # type: int\\n B = int(next(tokens)) # type: int\\n C = int(next(tokens)) # type: int\\n X = int(next(tokens)) # type: int\\n Y = int(next(tokens)) # type: int\\n solve(A, B, C, X, Y)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.6470588235,\n", + " 'diff': ['-import sys, math, fractions, itertools',\n", + " '+import sys',\n", + " '- mn = 1e9',\n", + " '- for i in range(0, 2 * (max(X, Y) + 1), 2):',\n", + " '- mn = min(mn, C * i + A * max(X - i // 2, 0) + B * max(Y - i // 2, 0))',\n", + " '- print((int(mn)))',\n", + " '+ c = 0',\n", + " '+ if A + B < 2 * C:',\n", + " '+ c += min(X, Y) * (A + B)',\n", + " '+ else:',\n", + " '+ c += min(X, Y) * 2 * C',\n", + " '+ if X > Y:',\n", + " '+ c += (X - Y) * min(A, 2 * C)',\n", + " '+ else:',\n", + " '+ c += (Y - X) * min(B, 2 * C)',\n", + " '+ print(c)',\n", + " '-# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)',\n", + " '+# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4482344875,\n", + " 'measured_runtime_v1': 0.3314408262,\n", + " 'runtime_lift': 1.3523816383,\n", + " 'key': ['s264866690', 's762683898']},\n", + " {'user_id': 'u018679195',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's697147605',\n", + " 'submission_id_v1': 's734272026',\n", + " 'cpu_time_v0': 243,\n", + " 'cpu_time_v1': 200,\n", + " 'memory_v0': 90436,\n", + " 'memory_v1': 74632,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.7,\n", + " 'input': 'n = int(eval(input()))\\n\\n\\n\\nfelicidade = []\\n\\n\\n\\nfor x in range(n):\\n\\n felicidade.append(list(map(int,input().split())))\\n\\n\\n\\nDP = [0,0,0]\\n\\n\\n\\nif n == 1:\\n\\n print((max(felicidade[0])))\\n\\n\\n\\nelse:\\n\\n\\n\\n for x in range(3):\\n\\n DP[x] = felicidade[0][x]\\n\\n\\n\\n\\n\\n for dia in range(1,n):\\n\\n m = [0] * 3\\n\\n for x in range(3):#As duas possíveis escolhas são x e y\\n\\n for y in range(3):\\n\\n if x != y: #Se elas forem diferentes\\n\\n m[x] = max(m[x], DP[y] + felicidade[dia][x])\\n\\n DP = m\\n\\n \\n\\n print((max(DP)))\\n',\n", + " 'target': 'nDays = int(eval(input()))\\n\\n\\n\\ntoday = [int(x) for x in input().split()]\\n\\n\\n\\nfor i in range(nDays - 1):\\n\\n tomorrow = [int(x) for x in input().split()]\\n\\n tomorrow[0] += max(today[1], today[2])\\n\\n tomorrow[1] += max(today[0], today[2])\\n\\n tomorrow[2] += max(today[0], today[1])\\n\\n today = tomorrow\\n\\n\\n\\nprint((max(today)))',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 557,\n", + " 'code_v1_num_chars': 320,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nfelicidade = []\\nfor x in range(n):\\n felicidade.append(list(map(int, input().split())))\\nDP = [0, 0, 0]\\nif n == 1:\\n print((max(felicidade[0])))\\nelse:\\n for x in range(3):\\n DP[x] = felicidade[0][x]\\n for dia in range(1, n):\\n m = [0] * 3\\n for x in range(3): # As duas possíveis escolhas são x e y\\n for y in range(3):\\n if x != y: # Se elas forem diferentes\\n m[x] = max(m[x], DP[y] + felicidade[dia][x])\\n DP = m\\n print((max(DP)))\\n',\n", + " 'code_v1_no_empty_lines': 'nDays = int(eval(input()))\\ntoday = [int(x) for x in input().split()]\\nfor i in range(nDays - 1):\\n tomorrow = [int(x) for x in input().split()]\\n tomorrow[0] += max(today[1], today[2])\\n tomorrow[1] += max(today[0], today[2])\\n tomorrow[2] += max(today[0], today[1])\\n today = tomorrow\\nprint((max(today)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.5555555556,\n", + " 'diff': ['-n = int(eval(input()))',\n", + " '-felicidade = []',\n", + " '-for x in range(n):',\n", + " '- felicidade.append(list(map(int, input().split())))',\n", + " '-DP = [0, 0, 0]',\n", + " '-if n == 1:',\n", + " '- print((max(felicidade[0])))',\n", + " '-else:',\n", + " '- for x in range(3):',\n", + " '- DP[x] = felicidade[0][x]',\n", + " '- for dia in range(1, n):',\n", + " '- m = [0] * 3',\n", + " '- for x in range(3): # As duas possíveis escolhas são x e y',\n", + " '- for y in range(3):',\n", + " '- if x != y: # Se elas forem diferentes',\n", + " '- m[x] = max(m[x], DP[y] + felicidade[dia][x])',\n", + " '- DP = m',\n", + " '- print((max(DP)))',\n", + " '+nDays = int(eval(input()))',\n", + " '+today = [int(x) for x in input().split()]',\n", + " '+for i in range(nDays - 1):',\n", + " '+ tomorrow = [int(x) for x in input().split()]',\n", + " '+ tomorrow[0] += max(today[1], today[2])',\n", + " '+ tomorrow[1] += max(today[0], today[2])',\n", + " '+ tomorrow[2] += max(today[0], today[1])',\n", + " '+ today = tomorrow',\n", + " '+print((max(today)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2760919194,\n", + " 'measured_runtime_v1': 0.0735631361,\n", + " 'runtime_lift': 3.7531287275,\n", + " 'key': ['s697147605', 's734272026']},\n", + " {'user_id': 'u879870653',\n", + " 'problem_id': 'p03325',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's933212033',\n", + " 'submission_id_v1': 's130104970',\n", + " 'cpu_time_v0': 143,\n", + " 'cpu_time_v1': 121,\n", + " 'memory_v0': 4148,\n", + " 'memory_v1': 4148,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.38,\n", + " 'input': 'answer = 0\\n\\nN = int(eval(input()))\\n\\nA = list(map(int,input().split()))\\n\\nfor i in range(N) :\\n\\n while A[i] % 2 == 0 :\\n\\n A[i] = A[i] / 2\\n\\n answer += 1\\n\\nprint(answer)\\n\\n\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nL = list(map(int,input().split()))\\n\\n\\n\\nans = 0\\n\\nfor i in range(N) :\\n\\n flag = 0\\n\\n while flag == 0 :\\n\\n if (L[i] % 2) == 0 :\\n\\n ans += 1\\n\\n L[i] = L[i]//2\\n\\n else :\\n\\n flag = 1\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 176,\n", + " 'code_v1_num_chars': 252,\n", + " 'code_v0_no_empty_lines': 'answer = 0\\nN = int(eval(input()))\\nA = list(map(int, input().split()))\\nfor i in range(N):\\n while A[i] % 2 == 0:\\n A[i] = A[i] / 2\\n answer += 1\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nL = list(map(int, input().split()))\\nans = 0\\nfor i in range(N):\\n flag = 0\\n while flag == 0:\\n if (L[i] % 2) == 0:\\n ans += 1\\n L[i] = L[i] // 2\\n else:\\n flag = 1\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.7692307692,\n", + " 'diff': ['-answer = 0',\n", + " '-A = list(map(int, input().split()))',\n", + " '+L = list(map(int, input().split()))',\n", + " '+ans = 0',\n", + " '- while A[i] % 2 == 0:',\n", + " '- A[i] = A[i] / 2',\n", + " '- answer += 1',\n", + " '-print(answer)',\n", + " '+ flag = 0',\n", + " '+ while flag == 0:',\n", + " '+ if (L[i] % 2) == 0:',\n", + " '+ ans += 1',\n", + " '+ L[i] = L[i] // 2',\n", + " '+ else:',\n", + " '+ flag = 1',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2890260706,\n", + " 'measured_runtime_v1': 0.1461268132,\n", + " 'runtime_lift': 1.9779126383,\n", + " 'key': ['s933212033', 's130104970']},\n", + " {'user_id': 'u924353076',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's982585501',\n", + " 'submission_id_v1': 's413088188',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 66.1,\n", + " 'input': 'n=eval(input())\\n\\nn=int(n)\\n\\na=1\\n\\nfor i in range(n):\\n\\n a=a*(i+1)\\n\\n if a>=pow(10,9)+7:\\n\\n a=a%(pow(10,9)+7)\\n\\nprint(a)',\n", + " 'target': 'n=int(eval(input()))\\n\\na=1\\n\\nfor i in range(1,n+1):\\n\\n a*=i\\n\\n a %= (10**9+7)\\n\\nprint(a)',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 120,\n", + " 'code_v1_num_chars': 83,\n", + " 'code_v0_no_empty_lines': 'n = eval(input())\\nn = int(n)\\na = 1\\nfor i in range(n):\\n a = a * (i + 1)\\n if a >= pow(10, 9) + 7:\\n a = a % (pow(10, 9) + 7)\\nprint(a)\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\na = 1\\nfor i in range(1, n + 1):\\n a *= i\\n a %= 10**9 + 7\\nprint(a)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['-n = eval(input())',\n", + " '-n = int(n)',\n", + " '+n = int(eval(input()))',\n", + " '-for i in range(n):',\n", + " '- a = a * (i + 1)',\n", + " '- if a >= pow(10, 9) + 7:',\n", + " '- a = a % (pow(10, 9) + 7)',\n", + " '+for i in range(1, n + 1):',\n", + " '+ a *= i',\n", + " '+ a %= 10**9 + 7'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4161043401,\n", + " 'measured_runtime_v1': 0.2489673834,\n", + " 'runtime_lift': 1.6713206943,\n", + " 'key': ['s982585501', 's413088188']},\n", + " {'user_id': 'u060938295',\n", + " 'problem_id': 'p03039',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's392943696',\n", + " 'submission_id_v1': 's780766335',\n", + " 'cpu_time_v0': 987,\n", + " 'cpu_time_v1': 315,\n", + " 'memory_v0': 26896,\n", + " 'memory_v1': 27024,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 68.09,\n", + " 'input': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nCreated on Sat May 25 21:24:29 2019\\n\\n\\n\\n@author: Yamazaki Kenichi\\n\\n\"\"\"\\n\\n\\n\\nN, M, K = list(map(int,input().split()))\\n\\nmod = 10**9+7\\n\\n\\n\\ndef cmb(n, r, mod):\\n\\n if (r < 0 or r > n):\\n\\n return 0\\n\\n r = min(r, n-r)\\n\\n return g1[n] * g2[r] * g2[n-r] % mod\\n\\n\\n\\ng1 = [1, 1] # 元テーブル\\n\\ng2 = [1, 1] # 逆元テーブル\\n\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\n\\n\\nfor i in range(2, N*M+1):\\n\\n g1.append((g1[-1] * i) % mod)\\n\\n inv.append((-inv[mod % i] * (mod//i)) % mod)\\n\\n g2.append((g2[-1] * inv[-1]) % mod)\\n\\n\\n\\ndef a(N,M):\\n\\n return N*(N+1)//2*(M+1) + M*(M+1)//2*(N+1)\\n\\ndef b(N):\\n\\n return N*(N+1)//2\\n\\n\\n\\nans = 0\\n\\nfor i in range(N):\\n\\n for j in range(M):\\n\\n ans += a(i,j) + a(N-i-1,j) + a(i,M-j-1) + a(N-i-1,M-j-1)\\n\\n ans -= b(i) + b(j) + b(N-i-1) + b(M-j-1)\\n\\n ans %= mod\\n\\n# print(i,j,a(i,j),a(N-i-1,j),a(i,M-j-1),a(N-i-1,M-j-1),b(i),b(j),ans)\\n\\nans *= g2[2]\\n\\n\\n\\nans *= cmb(N*M-2,K-2,mod)\\n\\nans %= mod\\n\\n\\n\\nprint(ans)\\n',\n", + " 'target': '# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nCreated on Wed May 29 22:49:19 2019\\n\\n\\n\\n@author: Yamazaki Kenichi\\n\\n\"\"\"\\n\\n\\n\\n# -*- coding: utf-8 -*-\\n\\n\"\"\"\\n\\nCreated on Sat May 25 21:24:29 2019\\n\\n\\n\\n@author: Yamazaki Kenichi\\n\\n\"\"\"\\n\\n\\n\\nN, M, K = list(map(int,input().split()))\\n\\nmod = 10**9+7\\n\\n\\n\\ndef cmb(n, r, mod):\\n\\n if (r < 0 or r > n):\\n\\n return 0\\n\\n r = min(r, n-r)\\n\\n return g1[n] * g2[r] * g2[n-r] % mod\\n\\n\\n\\ng1 = [1, 1] # 元テーブル\\n\\ng2 = [1, 1] # 逆元テーブル\\n\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\n\\n\\n\\nfor i in range(2, N*M+1):\\n\\n g1.append((g1[-1] * i) % mod)\\n\\n inv.append((-inv[mod % i] * (mod//i)) % mod)\\n\\n g2.append((g2[-1] * inv[-1]) % mod)\\n\\n\\n\\nans1 = 0\\n\\ndef c(N,M):\\n\\n res = 0\\n\\n for i in range(1,N):\\n\\n res += i*(N-i)*M*M\\n\\n return res\\n\\nans1 += c(N,M) + c(M,N)\\n\\nans1 %= mod\\n\\n\\n\\nans1 *= cmb(N*M-2,K-2,mod)\\n\\nans1 %= mod\\n\\n\\n\\nprint(ans1)\\n',\n", + " 'code_v0_loc': 43,\n", + " 'code_v1_loc': 45,\n", + " 'code_v0_num_chars': 949,\n", + " 'code_v1_num_chars': 820,\n", + " 'code_v0_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nCreated on Sat May 25 21:24:29 2019\\n@author: Yamazaki Kenichi\\n\"\"\"\\nN, M, K = list(map(int, input().split()))\\nmod = 10**9 + 7\\n\\n\\ndef cmb(n, r, mod):\\n if r < 0 or r > n:\\n return 0\\n r = min(r, n - r)\\n return g1[n] * g2[r] * g2[n - r] % mod\\n\\n\\ng1 = [1, 1] # 元テーブル\\ng2 = [1, 1] # 逆元テーブル\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\nfor i in range(2, N * M + 1):\\n g1.append((g1[-1] * i) % mod)\\n inv.append((-inv[mod % i] * (mod // i)) % mod)\\n g2.append((g2[-1] * inv[-1]) % mod)\\n\\n\\ndef a(N, M):\\n return N * (N + 1) // 2 * (M + 1) + M * (M + 1) // 2 * (N + 1)\\n\\n\\ndef b(N):\\n return N * (N + 1) // 2\\n\\n\\nans = 0\\nfor i in range(N):\\n for j in range(M):\\n ans += a(i, j) + a(N - i - 1, j) + a(i, M - j - 1) + a(N - i - 1, M - j - 1)\\n ans -= b(i) + b(j) + b(N - i - 1) + b(M - j - 1)\\n ans %= mod\\n# print(i,j,a(i,j),a(N-i-1,j),a(i,M-j-1),a(N-i-1,M-j-1),b(i),b(j),ans)\\nans *= g2[2]\\nans *= cmb(N * M - 2, K - 2, mod)\\nans %= mod\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# -*- coding: utf-8 -*-\\n\"\"\"\\nCreated on Wed May 29 22:49:19 2019\\n@author: Yamazaki Kenichi\\n\"\"\"\\n# -*- coding: utf-8 -*-\\n\"\"\"\\nCreated on Sat May 25 21:24:29 2019\\n@author: Yamazaki Kenichi\\n\"\"\"\\nN, M, K = list(map(int, input().split()))\\nmod = 10**9 + 7\\n\\n\\ndef cmb(n, r, mod):\\n if r < 0 or r > n:\\n return 0\\n r = min(r, n - r)\\n return g1[n] * g2[r] * g2[n - r] % mod\\n\\n\\ng1 = [1, 1] # 元テーブル\\ng2 = [1, 1] # 逆元テーブル\\ninv = [0, 1] # 逆元テーブル計算用テーブル\\nfor i in range(2, N * M + 1):\\n g1.append((g1[-1] * i) % mod)\\n inv.append((-inv[mod % i] * (mod // i)) % mod)\\n g2.append((g2[-1] * inv[-1]) % mod)\\nans1 = 0\\n\\n\\ndef c(N, M):\\n res = 0\\n for i in range(1, N):\\n res += i * (N - i) * M * M\\n return res\\n\\n\\nans1 += c(N, M) + c(M, N)\\nans1 %= mod\\nans1 *= cmb(N * M - 2, K - 2, mod)\\nans1 %= mod\\nprint(ans1)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.4444444444,\n", + " 'diff': ['+# -*- coding: utf-8 -*-',\n", + " '+\"\"\"',\n", + " '+Created on Wed May 29 22:49:19 2019',\n", + " '+@author: Yamazaki Kenichi',\n", + " '+\"\"\"',\n", + " '+ans1 = 0',\n", + " '-def a(N, M):',\n", + " '- return N * (N + 1) // 2 * (M + 1) + M * (M + 1) // 2 * (N + 1)',\n", + " '+def c(N, M):',\n", + " '+ res = 0',\n", + " '+ for i in range(1, N):',\n", + " '+ res += i * (N - i) * M * M',\n", + " '+ return res',\n", + " '-def b(N):',\n", + " '- return N * (N + 1) // 2',\n", + " '-',\n", + " '-',\n", + " '-ans = 0',\n", + " '-for i in range(N):',\n", + " '- for j in range(M):',\n", + " '- ans += a(i, j) + a(N - i - 1, j) + a(i, M - j - 1) + a(N - i - 1, M - j - 1)',\n", + " '- ans -= b(i) + b(j) + b(N - i - 1) + b(M - j - 1)',\n", + " '- ans %= mod',\n", + " '-# print(i,j,a(i,j),a(N-i-1,j),a(i,M-j-1),a(N-i-1,M-j-1),b(i),b(j),ans)',\n", + " '-ans *= g2[2]',\n", + " '-ans *= cmb(N * M - 2, K - 2, mod)',\n", + " '-ans %= mod',\n", + " '-print(ans)',\n", + " '+ans1 += c(N, M) + c(M, N)',\n", + " '+ans1 %= mod',\n", + " '+ans1 *= cmb(N * M - 2, K - 2, mod)',\n", + " '+ans1 %= mod',\n", + " '+print(ans1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3568273056,\n", + " 'measured_runtime_v1': 0.2588016932,\n", + " 'runtime_lift': 1.3787672759,\n", + " 'key': ['s392943696', 's780766335']},\n", + " {'user_id': 'u633068244',\n", + " 'problem_id': 'p00122',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's871701752',\n", + " 'submission_id_v1': 's889694954',\n", + " 'cpu_time_v0': 20,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 4272,\n", + " 'memory_v1': 4268,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 50.0,\n", + " 'input': 'dX = [2,2,2,1,0,-1,-2,-2,-2,-1,0,1]\\n\\ndY = [-1,0,1,2,2,2,1,0,-1,-2,-2,-2]\\n\\ndef solve(x,y,XY):\\n\\n\\txy = XY[:]\\n\\n\\tif len(xy) == 0: return \"OK\"\\n\\n\\tsx,sy = xy.pop(0),xy.pop(0)\\n\\n\\tfor dx,dy in zip(dX,dY):\\n\\n\\t\\tif doa(x+dx,y+dy,sx,sy): \\n\\n\\t\\t\\tr = solve(x+dx,y+dy,xy)\\n\\n\\t\\t\\tif r: return r\\n\\n\\n\\ndef doa(x,y,sx,sy):\\n\\n\\tif not (0 <= x <= 9 and 0 <= y <= 9): return False\\n\\n\\treturn True if abs(x-sx) < 2 and abs(y-sy) < 2 else False\\n\\n\\n\\nwhile 1:\\n\\n\\tx,y = list(map(int,input().split()))\\n\\n\\tif x == y == 0: break\\n\\n\\tn = eval(input())\\n\\n\\txy = list(map(int,input().split()))\\n\\n\\tans = solve(x,y,xy)\\n\\n\\tprint(ans if ans else \"NA\")',\n", + " 'target': 'dX = [2,2,2,1,0,-1,-2,-2,-2,-1,0,1]\\n\\ndY = [-1,0,1,2,2,2,1,0,-1,-2,-2,-2]\\n\\ndef solve(x,y,XY):\\n\\n\\txy = XY[:]\\n\\n\\tif len(xy) == 0: return True\\n\\n\\tsx,sy = xy.pop(0),xy.pop(0)\\n\\n\\tfor dx,dy in zip(dX,dY):\\n\\n\\t\\tif doa(x+dx,y+dy,sx,sy): \\n\\n\\t\\t\\tr = solve(x+dx,y+dy,xy)\\n\\n\\t\\t\\tif r: return r\\n\\n\\n\\ndef doa(x,y,sx,sy):\\n\\n\\tif not (0 <= x <= 9 and 0 <= y <= 9): return False\\n\\n\\treturn True if abs(x-sx) < 2 and abs(y-sy) < 2 else False\\n\\n\\n\\nwhile 1:\\n\\n\\tx,y = list(map(int,input().split()))\\n\\n\\tif x == y == 0: break\\n\\n\\tn = eval(input())\\n\\n\\txy = list(map(int,input().split()))\\n\\n\\tprint(\"OK\" if solve(x,y,xy) else \"NA\")',\n", + " 'code_v0_loc': 22,\n", + " 'code_v1_loc': 21,\n", + " 'code_v0_num_chars': 579,\n", + " 'code_v1_num_chars': 568,\n", + " 'code_v0_no_empty_lines': 'dX = [2, 2, 2, 1, 0, -1, -2, -2, -2, -1, 0, 1]\\ndY = [-1, 0, 1, 2, 2, 2, 1, 0, -1, -2, -2, -2]\\n\\n\\ndef solve(x, y, XY):\\n xy = XY[:]\\n if len(xy) == 0:\\n return \"OK\"\\n sx, sy = xy.pop(0), xy.pop(0)\\n for dx, dy in zip(dX, dY):\\n if doa(x + dx, y + dy, sx, sy):\\n r = solve(x + dx, y + dy, xy)\\n if r:\\n return r\\n\\n\\ndef doa(x, y, sx, sy):\\n if not (0 <= x <= 9 and 0 <= y <= 9):\\n return False\\n return True if abs(x - sx) < 2 and abs(y - sy) < 2 else False\\n\\n\\nwhile 1:\\n x, y = list(map(int, input().split()))\\n if x == y == 0:\\n break\\n n = eval(input())\\n xy = list(map(int, input().split()))\\n ans = solve(x, y, xy)\\n print(ans if ans else \"NA\")\\n',\n", + " 'code_v1_no_empty_lines': 'dX = [2, 2, 2, 1, 0, -1, -2, -2, -2, -1, 0, 1]\\ndY = [-1, 0, 1, 2, 2, 2, 1, 0, -1, -2, -2, -2]\\n\\n\\ndef solve(x, y, XY):\\n xy = XY[:]\\n if len(xy) == 0:\\n return True\\n sx, sy = xy.pop(0), xy.pop(0)\\n for dx, dy in zip(dX, dY):\\n if doa(x + dx, y + dy, sx, sy):\\n r = solve(x + dx, y + dy, xy)\\n if r:\\n return r\\n\\n\\ndef doa(x, y, sx, sy):\\n if not (0 <= x <= 9 and 0 <= y <= 9):\\n return False\\n return True if abs(x - sx) < 2 and abs(y - sy) < 2 else False\\n\\n\\nwhile 1:\\n x, y = list(map(int, input().split()))\\n if x == y == 0:\\n break\\n n = eval(input())\\n xy = list(map(int, input().split()))\\n print(\"OK\" if solve(x, y, xy) else \"NA\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['- return \"OK\"',\n", + " '+ return True',\n", + " '- ans = solve(x, y, xy)',\n", + " '- print(ans if ans else \"NA\")',\n", + " '+ print(\"OK\" if solve(x, y, xy) else \"NA\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2335389843,\n", + " 'measured_runtime_v1': 0.183096947,\n", + " 'runtime_lift': 1.2754936015,\n", + " 'key': ['s871701752', 's889694954']},\n", + " {'user_id': 'u732159958',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's130057185',\n", + " 'submission_id_v1': 's637640023',\n", + " 'cpu_time_v0': 68,\n", + " 'cpu_time_v1': 50,\n", + " 'memory_v0': 3060,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.47,\n", + " 'input': \"counter = 0\\n\\nc = list(map(int, input().split(' ')))\\n\\nfor i in range(c[0], c[1] + 1):\\n\\n if str(i)[0] != str(i)[4]:\\n\\n continue\\n\\n if str(i)[1] != str(i)[3]:\\n\\n continue\\n\\n counter += 1\\n\\n\\n\\nprint(counter)\",\n", + " 'target': 'a = list(map(int, input().split()))\\n\\ncounter = 0\\n\\nfor i in range(a[0], a[1] + 1):\\n\\n stri = str(i)\\n\\n if (stri[0] == stri[4] and stri[1] == stri[3]):\\n\\n counter += 1\\n\\n \\n\\nprint(counter)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 206,\n", + " 'code_v1_num_chars': 189,\n", + " 'code_v0_no_empty_lines': 'counter = 0\\nc = list(map(int, input().split(\" \")))\\nfor i in range(c[0], c[1] + 1):\\n if str(i)[0] != str(i)[4]:\\n continue\\n if str(i)[1] != str(i)[3]:\\n continue\\n counter += 1\\nprint(counter)\\n',\n", + " 'code_v1_no_empty_lines': 'a = list(map(int, input().split()))\\ncounter = 0\\nfor i in range(a[0], a[1] + 1):\\n stri = str(i)\\n if stri[0] == stri[4] and stri[1] == stri[3]:\\n counter += 1\\nprint(counter)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 20.0,\n", + " 'diff': ['+a = list(map(int, input().split()))',\n", + " '-c = list(map(int, input().split(\" \")))',\n", + " '-for i in range(c[0], c[1] + 1):',\n", + " '- if str(i)[0] != str(i)[4]:',\n", + " '- continue',\n", + " '- if str(i)[1] != str(i)[3]:',\n", + " '- continue',\n", + " '- counter += 1',\n", + " '+for i in range(a[0], a[1] + 1):',\n", + " '+ stri = str(i)',\n", + " '+ if stri[0] == stri[4] and stri[1] == stri[3]:',\n", + " '+ counter += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.442622024,\n", + " 'measured_runtime_v1': 0.3161446974,\n", + " 'runtime_lift': 1.4000615148,\n", + " 'key': ['s130057185', 's637640023']},\n", + " {'user_id': 'u298297089',\n", + " 'problem_id': 'p03608',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's886496644',\n", + " 'submission_id_v1': 's630862877',\n", + " 'cpu_time_v0': 754,\n", + " 'cpu_time_v1': 614,\n", + " 'memory_v0': 22600,\n", + " 'memory_v1': 17008,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 18.57,\n", + " 'input': \"from scipy.sparse.csgraph import dijkstra as di\\n\\nfrom itertools import permutations\\n\\nN,M,R = list(map(int, input().split()))\\n\\nr = list(map(int, input().split()))\\n\\n\\n\\nroute = [[0 for i in range(N)] for j in range(N)]\\n\\nfor i in range(M):\\n\\n a,b,c = list(map(int, input().split()))\\n\\n route[a-1][b-1] = route[b-1][a-1] = c\\n\\n# for i in range(N):\\n\\n# print(route[i])\\n\\n\\n\\n\\n\\np_route = di(route)\\n\\n# print(p_route)\\n\\n\\n\\nmn = float('INF')\\n\\nfor tmp in permutations(r):\\n\\n t_sum = 0\\n\\n for i in range(len(tmp)-1):\\n\\n t_sum += p_route[tmp[i]-1][tmp[i+1]-1]\\n\\n if t_sum < mn:\\n\\n mn = t_sum\\n\\n\\n\\nprint((int(mn)))\",\n", + " 'target': \"from itertools import permutations as perm\\n\\nfrom scipy.sparse.csgraph import dijkstra as di\\n\\n\\n\\ndef warshall(d, n):\\n\\n for k in range(n):\\n\\n for i in range(n):\\n\\n for j in range(n):\\n\\n if d[i][k] + d[k][j] < d[i][j]:\\n\\n d[i][j] = d[i][k] + d[k][j]\\n\\n\\n\\nn,m,r = list(map(int, input().split()))\\n\\nrr = [i-1 for i in map(int, input().split())]\\n\\n\\n\\ninf = float('INF')\\n\\nroute = [[0 for j in range(n)] for i in range(n)]\\n\\nfor _ in range(m):\\n\\n a,b,c = list(map(int, input().split()))\\n\\n route[a-1][b-1] = route[b-1][a-1] = c\\n\\n\\n\\nroute = di(route, n)\\n\\n\\n\\nans = inf\\n\\nfor tmp in perm(rr):\\n\\n cost = 0\\n\\n for i in range(r-1):\\n\\n cost += route[tmp[i]][tmp[i+1]]\\n\\n if cost < ans:\\n\\n ans = cost\\n\\nprint((int(ans)))\\n\",\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 602,\n", + " 'code_v1_num_chars': 753,\n", + " 'code_v0_no_empty_lines': 'from scipy.sparse.csgraph import dijkstra as di\\nfrom itertools import permutations\\n\\nN, M, R = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nroute = [[0 for i in range(N)] for j in range(N)]\\nfor i in range(M):\\n a, b, c = list(map(int, input().split()))\\n route[a - 1][b - 1] = route[b - 1][a - 1] = c\\n# for i in range(N):\\n# print(route[i])\\np_route = di(route)\\n# print(p_route)\\nmn = float(\"INF\")\\nfor tmp in permutations(r):\\n t_sum = 0\\n for i in range(len(tmp) - 1):\\n t_sum += p_route[tmp[i] - 1][tmp[i + 1] - 1]\\n if t_sum < mn:\\n mn = t_sum\\nprint((int(mn)))\\n',\n", + " 'code_v1_no_empty_lines': 'from itertools import permutations as perm\\nfrom scipy.sparse.csgraph import dijkstra as di\\n\\n\\ndef warshall(d, n):\\n for k in range(n):\\n for i in range(n):\\n for j in range(n):\\n if d[i][k] + d[k][j] < d[i][j]:\\n d[i][j] = d[i][k] + d[k][j]\\n\\n\\nn, m, r = list(map(int, input().split()))\\nrr = [i - 1 for i in map(int, input().split())]\\ninf = float(\"INF\")\\nroute = [[0 for j in range(n)] for i in range(n)]\\nfor _ in range(m):\\n a, b, c = list(map(int, input().split()))\\n route[a - 1][b - 1] = route[b - 1][a - 1] = c\\nroute = di(route, n)\\nans = inf\\nfor tmp in perm(rr):\\n cost = 0\\n for i in range(r - 1):\\n cost += route[tmp[i]][tmp[i + 1]]\\n if cost < ans:\\n ans = cost\\nprint((int(ans)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 13.7931034483,\n", + " 'diff': ['+from itertools import permutations as perm',\n", + " '-from itertools import permutations',\n", + " '-N, M, R = list(map(int, input().split()))',\n", + " '-r = list(map(int, input().split()))',\n", + " '-route = [[0 for i in range(N)] for j in range(N)]',\n", + " '-for i in range(M):',\n", + " '+',\n", + " '+def warshall(d, n):',\n", + " '+ for k in range(n):',\n", + " '+ for i in range(n):',\n", + " '+ for j in range(n):',\n", + " '+ if d[i][k] + d[k][j] < d[i][j]:',\n", + " '+ d[i][j] = d[i][k] + d[k][j]',\n", + " '+',\n", + " '+',\n", + " '+n, m, r = list(map(int, input().split()))',\n", + " '+rr = [i - 1 for i in map(int, input().split())]',\n", + " '+inf = float(\"INF\")',\n", + " '+route = [[0 for j in range(n)] for i in range(n)]',\n", + " '+for _ in range(m):',\n", + " '-# for i in range(N):',\n", + " '-# print(route[i])',\n", + " '-p_route = di(route)',\n", + " '-# print(p_route)',\n", + " '-mn = float(\"INF\")',\n", + " '-for tmp in permutations(r):',\n", + " '- t_sum = 0',\n", + " '- for i in range(len(tmp) - 1):',\n", + " '- t_sum += p_route[tmp[i] - 1][tmp[i + 1] - 1]',\n", + " '- if t_sum < mn:',\n", + " '- mn = t_sum',\n", + " '-print((int(mn)))',\n", + " '+route = di(route, n)',\n", + " '+ans = inf',\n", + " '+for tmp in perm(rr):',\n", + " '+ cost = 0',\n", + " '+ for i in range(r - 1):',\n", + " '+ cost += route[tmp[i]][tmp[i + 1]]',\n", + " '+ if cost < ans:',\n", + " '+ ans = cost',\n", + " '+print((int(ans)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.8585113499,\n", + " 'measured_runtime_v1': 0.6205561209,\n", + " 'runtime_lift': 1.3834548094,\n", + " 'key': ['s886496644', 's630862877']},\n", + " {'user_id': 'u021548497',\n", + " 'problem_id': 'p03723',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's378337044',\n", + " 'submission_id_v1': 's805175233',\n", + " 'cpu_time_v0': 287,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 18992,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 94.08,\n", + " 'input': 'import numpy as np\\n\\ncookies = np.array([int(x) for x in input().split()])\\n\\n\\n\\nif any(cookies%2):\\n\\n ans = 0\\n\\nelif cookies[0] == cookies[1] == cookies[2]:\\n\\n ans = -1\\n\\nelse:\\n\\n ans = 0\\n\\n while True:\\n\\n if not any(cookies%2):\\n\\n cookies = cookies//2\\n\\n ans += 1\\n\\n continue\\n\\n if all(cookies%2):\\n\\n ans += 1\\n\\n break\\n\\nprint(ans)',\n", + " 'target': 'a, b, c = list(map(int, input().split()))\\n\\nif a == b == c and a%2 == 0:\\n\\n print((-1))\\n\\nelif a%2 or b%2 or c%2:\\n\\n print((0))\\n\\nelse:\\n\\n ans = 0\\n\\n while a%2 == b%2 == c%2 == 0:\\n\\n a, b, c = (b+c)//2, (a+c)//2, (a+b)//2\\n\\n ans += 1\\n\\n print(ans)',\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 348,\n", + " 'code_v1_num_chars': 238,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\ncookies = np.array([int(x) for x in input().split()])\\nif any(cookies % 2):\\n ans = 0\\nelif cookies[0] == cookies[1] == cookies[2]:\\n ans = -1\\nelse:\\n ans = 0\\n while True:\\n if not any(cookies % 2):\\n cookies = cookies // 2\\n ans += 1\\n continue\\n if all(cookies % 2):\\n ans += 1\\n break\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\nif a == b == c and a % 2 == 0:\\n print((-1))\\nelif a % 2 or b % 2 or c % 2:\\n print((0))\\nelse:\\n ans = 0\\n while a % 2 == b % 2 == c % 2 == 0:\\n a, b, c = (b + c) // 2, (a + c) // 2, (a + b) // 2\\n ans += 1\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 38.8888888889,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-cookies = np.array([int(x) for x in input().split()])',\n", + " '-if any(cookies % 2):',\n", + " '- ans = 0',\n", + " '-elif cookies[0] == cookies[1] == cookies[2]:',\n", + " '- ans = -1',\n", + " '+a, b, c = list(map(int, input().split()))',\n", + " '+if a == b == c and a % 2 == 0:',\n", + " '+ print((-1))',\n", + " '+elif a % 2 or b % 2 or c % 2:',\n", + " '+ print((0))',\n", + " '- while True:',\n", + " '- if not any(cookies % 2):',\n", + " '- cookies = cookies // 2',\n", + " '- ans += 1',\n", + " '- continue',\n", + " '- if all(cookies % 2):',\n", + " '- ans += 1',\n", + " '- break',\n", + " '-print(ans)',\n", + " '+ while a % 2 == b % 2 == c % 2 == 0:',\n", + " '+ a, b, c = (b + c) // 2, (a + c) // 2, (a + b) // 2',\n", + " '+ ans += 1',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.4413467925,\n", + " 'measured_runtime_v1': 0.1942887537,\n", + " 'runtime_lift': 7.4185806671,\n", + " 'key': ['s378337044', 's805175233']},\n", + " {'user_id': 'u561231954',\n", + " 'problem_id': 'p03545',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's357290049',\n", + " 'submission_id_v1': 's861261131',\n", + " 'cpu_time_v0': 152,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 12488,\n", + " 'memory_v1': 3064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.16,\n", + " 'input': \"import numpy as np\\n\\nnum=np.array(list(eval(input())))\\n\\n\\n\\nfor bit in range(1<<3):\\n\\n op=np.array(['-']*3)\\n\\n for i in range(3):\\n\\n if (bit>>i)&1:\\n\\n op[i]='+'\\n\\n formula=np.insert(num,[1,2,3],op)\\n\\n \\n\\n if eval(''.join(formula))==7:\\n\\n flag=True\\n\\n print((''.join(formula)+'=7'))\\n\\n break\",\n", + " 'target': \"INF = 10 ** 9\\n\\nimport sys\\n\\nsys.setrecursionlimit(100000000)\\n\\ndy = (-1,0,1,0)\\n\\ndx = (0,1,0,-1)\\n\\nfrom heapq import heappop,heapify,heappush\\n\\nfrom bisect import bisect_left\\n\\n\\n\\ndef main():\\n\\n s = eval(input())\\n\\n for bit in range(8):\\n\\n op = []\\n\\n for i in range(3):\\n\\n if (bit>>i)&1:\\n\\n op.append('+')\\n\\n else:\\n\\n op.append('-')\\n\\n \\n\\n tmp = s[0]\\n\\n for i in range(3):\\n\\n tmp += op[i]\\n\\n tmp += s[i + 1]\\n\\n\\n\\n if eval(tmp) == 7:\\n\\n ans = tmp + '=7'\\n\\n break\\n\\n print(ans)\\n\\nif __name__ == '__main__':\\n\\n main()\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 292,\n", + " 'code_v1_num_chars': 633,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nnum = np.array(list(eval(input())))\\nfor bit in range(1 << 3):\\n op = np.array([\"-\"] * 3)\\n for i in range(3):\\n if (bit >> i) & 1:\\n op[i] = \"+\"\\n formula = np.insert(num, [1, 2, 3], op)\\n if eval(\"\".join(formula)) == 7:\\n flag = True\\n print((\"\".join(formula) + \"=7\"))\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'INF = 10**9\\nimport sys\\n\\nsys.setrecursionlimit(100000000)\\ndy = (-1, 0, 1, 0)\\ndx = (0, 1, 0, -1)\\nfrom heapq import heappop, heapify, heappush\\nfrom bisect import bisect_left\\n\\n\\ndef main():\\n s = eval(input())\\n for bit in range(8):\\n op = []\\n for i in range(3):\\n if (bit >> i) & 1:\\n op.append(\"+\")\\n else:\\n op.append(\"-\")\\n tmp = s[0]\\n for i in range(3):\\n tmp += op[i]\\n tmp += s[i + 1]\\n if eval(tmp) == 7:\\n ans = tmp + \"=7\"\\n break\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 51.724137931,\n", + " 'diff': ['-import numpy as np',\n", + " '+INF = 10**9',\n", + " '+import sys',\n", + " '-num = np.array(list(eval(input())))',\n", + " '-for bit in range(1 << 3):',\n", + " '- op = np.array([\"-\"] * 3)',\n", + " '- for i in range(3):',\n", + " '- if (bit >> i) & 1:',\n", + " '- op[i] = \"+\"',\n", + " '- formula = np.insert(num, [1, 2, 3], op)',\n", + " '- if eval(\"\".join(formula)) == 7:',\n", + " '- flag = True',\n", + " '- print((\"\".join(formula) + \"=7\"))',\n", + " '- break',\n", + " '+sys.setrecursionlimit(100000000)',\n", + " '+dy = (-1, 0, 1, 0)',\n", + " '+dx = (0, 1, 0, -1)',\n", + " '+from heapq import heappop, heapify, heappush',\n", + " '+from bisect import bisect_left',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ s = eval(input())',\n", + " '+ for bit in range(8):',\n", + " '+ op = []',\n", + " '+ for i in range(3):',\n", + " '+ if (bit >> i) & 1:',\n", + " '+ op.append(\"+\")',\n", + " '+ else:',\n", + " '+ op.append(\"-\")',\n", + " '+ tmp = s[0]',\n", + " '+ for i in range(3):',\n", + " '+ tmp += op[i]',\n", + " '+ tmp += s[i + 1]',\n", + " '+ if eval(tmp) == 7:',\n", + " '+ ans = tmp + \"=7\"',\n", + " '+ break',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+if __name__ == \"__main__\":',\n", + " '+ main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.58260882,\n", + " 'measured_runtime_v1': 0.259734097,\n", + " 'runtime_lift': 6.0931885269,\n", + " 'key': ['s357290049', 's861261131']},\n", + " {'user_id': 'u230717961',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's450924156',\n", + " 'submission_id_v1': 's743009434',\n", + " 'cpu_time_v0': 229,\n", + " 'cpu_time_v1': 35,\n", + " 'memory_v0': 3984,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.72,\n", + " 'input': 'import math\\n\\nn = int(eval(input()))\\n\\n\\n\\npower = math.factorial(n)\\n\\n\\n\\nprint((power % (10**9 + 7)))\\n',\n", + " 'target': 'import math\\n\\nn = int(eval(input()))\\n\\n\\n\\npower = 1\\n\\n\\n\\nfor i in range(1, n+1):\\n\\n power = i * power % (10**9 + 7)\\n\\n\\n\\nprint(power)\\n',\n", + " 'code_v0_loc': 6,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 89,\n", + " 'code_v1_num_chars': 123,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\npower = math.factorial(n)\\nprint((power % (10**9 + 7)))\\n',\n", + " 'code_v1_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\npower = 1\\nfor i in range(1, n + 1):\\n power = i * power % (10**9 + 7)\\nprint(power)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 33.3333333333,\n", + " 'diff': ['-power = math.factorial(n)',\n", + " '-print((power % (10**9 + 7)))',\n", + " '+power = 1',\n", + " '+for i in range(1, n + 1):',\n", + " '+ power = i * power % (10**9 + 7)',\n", + " '+print(power)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5500237288,\n", + " 'measured_runtime_v1': 0.2133381867,\n", + " 'runtime_lift': 2.5781775744,\n", + " 'key': ['s450924156', 's743009434']},\n", + " {'user_id': 'u600402037',\n", + " 'problem_id': 'p03037',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's181457641',\n", + " 'submission_id_v1': 's911516772',\n", + " 'cpu_time_v0': 300,\n", + " 'cpu_time_v1': 197,\n", + " 'memory_v0': 11012,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 34.33,\n", + " 'input': 'N,M = list(map(int,input().split()))\\n\\nL,R = [],[]\\n\\nfor i in range(M):\\n\\n l,r = list(map(int,input().split()))\\n\\n L.append(l)\\n\\n R.append(r)\\n\\nans = min(R)-max(L)+1\\n\\nprint((ans if ans >= 0 else 0))',\n", + " 'target': '# coding: utf-8\\n\\nimport sys\\n\\n\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\n\\nir = lambda: int(sr())\\n\\nlr = lambda: list(map(int, sr().split()))\\n\\n\\n\\nN, M = lr()\\n\\nL = 0; R = 10 ** 6\\n\\nfor _ in range(M):\\n\\n l, r = lr()\\n\\n if l > L:\\n\\n L = l\\n\\n if r < R:\\n\\n R = r\\n\\n\\n\\nanswer = max(0, R - L + 1)\\n\\nprint(answer)\\n',\n", + " 'code_v0_loc': 8,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 187,\n", + " 'code_v1_num_chars': 318,\n", + " 'code_v0_no_empty_lines': 'N, M = list(map(int, input().split()))\\nL, R = [], []\\nfor i in range(M):\\n l, r = list(map(int, input().split()))\\n L.append(l)\\n R.append(r)\\nans = min(R) - max(L) + 1\\nprint((ans if ans >= 0 else 0))\\n',\n", + " 'code_v1_no_empty_lines': '# coding: utf-8\\nimport sys\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\nN, M = lr()\\nL = 0\\nR = 10**6\\nfor _ in range(M):\\n l, r = lr()\\n if l > L:\\n L = l\\n if r < R:\\n R = r\\nanswer = max(0, R - L + 1)\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.5555555556,\n", + " 'diff': ['-N, M = list(map(int, input().split()))',\n", + " '-L, R = [], []',\n", + " '-for i in range(M):',\n", + " '- l, r = list(map(int, input().split()))',\n", + " '- L.append(l)',\n", + " '- R.append(r)',\n", + " '-ans = min(R) - max(L) + 1',\n", + " '-print((ans if ans >= 0 else 0))',\n", + " '+# coding: utf-8',\n", + " '+import sys',\n", + " '+',\n", + " '+sr = lambda: sys.stdin.readline().rstrip()',\n", + " '+ir = lambda: int(sr())',\n", + " '+lr = lambda: list(map(int, sr().split()))',\n", + " '+N, M = lr()',\n", + " '+L = 0',\n", + " '+R = 10**6',\n", + " '+for _ in range(M):',\n", + " '+ l, r = lr()',\n", + " '+ if l > L:',\n", + " '+ L = l',\n", + " '+ if r < R:',\n", + " '+ R = r',\n", + " '+answer = max(0, R - L + 1)',\n", + " '+print(answer)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2034662783,\n", + " 'measured_runtime_v1': 0.0060762894,\n", + " 'runtime_lift': 33.4852842041,\n", + " 'key': ['s181457641', 's911516772']},\n", + " {'user_id': 'u729133443',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's039277419',\n", + " 'submission_id_v1': 's210669705',\n", + " 'cpu_time_v0': 66,\n", + " 'cpu_time_v1': 51,\n", + " 'memory_v0': 29052,\n", + " 'memory_v1': 22328,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.73,\n", + " 'input': \"a,b,c=1,0,0\\n\\nexec('a,b,c=b,c,(a+c)%(10**9+7);'*(int(eval(input()))-2))\\n\\nprint(c)\",\n", + " 'target': \"a,b,c=1,0,0\\n\\nexec('a,b,c=b,c,a+c;'*(int(eval(input()))-2))\\n\\nprint((c%(10**9+7)))\",\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 74,\n", + " 'code_v1_num_chars': 72,\n", + " 'code_v0_no_empty_lines': 'a, b, c = 1, 0, 0\\nexec(\"a,b,c=b,c,(a+c)%(10**9+7);\" * (int(eval(input())) - 2))\\nprint(c)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b, c = 1, 0, 0\\nexec(\"a,b,c=b,c,a+c;\" * (int(eval(input())) - 2))\\nprint((c % (10**9 + 7)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-exec(\"a,b,c=b,c,(a+c)%(10**9+7);\" * (int(eval(input())) - 2))',\n", + " '-print(c)',\n", + " '+exec(\"a,b,c=b,c,a+c;\" * (int(eval(input())) - 2))',\n", + " '+print((c % (10**9 + 7)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4045331192,\n", + " 'measured_runtime_v1': 0.1489405618,\n", + " 'runtime_lift': 2.7160708565,\n", + " 'key': ['s039277419', 's210669705']},\n", + " {'user_id': 'u894258749',\n", + " 'problem_id': 'p03126',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's237503515',\n", + " 'submission_id_v1': 's632748027',\n", + " 'cpu_time_v0': 156,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12396,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 89.1,\n", + " 'input': 'import numpy as np\\n\\n\\n\\n(N,M) = list(map(int,input().split()))\\n\\nB = np.ones(M,dtype=np.int)\\n\\n\\n\\nfor _ in range(N):\\n\\n A = np.array(list(map(int,input().split())))[1:]\\n\\n for i in range(M):\\n\\n if not i+1 in A:\\n\\n B[i] = 0\\n\\nprint((B.sum()))',\n", + " 'target': '(N,M) = list(map(int,input().split()))\\n\\nr = int(-1)\\n\\nfor i in range(N):\\n\\n A = list(map(int,input().split()))\\n\\n A.pop(0)\\n\\n c = 0\\n\\n for a in A:\\n\\n c |= (1 << (a-1))\\n\\n r &= c\\n\\n\\n\\nans = sum([(r>>n)&1 for n in range(M)])\\n\\nprint(ans)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 12,\n", + " 'code_v0_num_chars': 247,\n", + " 'code_v1_num_chars': 227,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n(N, M) = list(map(int, input().split()))\\nB = np.ones(M, dtype=np.int)\\nfor _ in range(N):\\n A = np.array(list(map(int, input().split())))[1:]\\n for i in range(M):\\n if not i + 1 in A:\\n B[i] = 0\\nprint((B.sum()))\\n',\n", + " 'code_v1_no_empty_lines': '(N, M) = list(map(int, input().split()))\\nr = int(-1)\\nfor i in range(N):\\n A = list(map(int, input().split()))\\n A.pop(0)\\n c = 0\\n for a in A:\\n c |= 1 << (a - 1)\\n r &= c\\nans = sum([(r >> n) & 1 for n in range(M)])\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.3333333333,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-B = np.ones(M, dtype=np.int)',\n", + " '-for _ in range(N):',\n", + " '- A = np.array(list(map(int, input().split())))[1:]',\n", + " '- for i in range(M):',\n", + " '- if not i + 1 in A:',\n", + " '- B[i] = 0',\n", + " '-print((B.sum()))',\n", + " '+r = int(-1)',\n", + " '+for i in range(N):',\n", + " '+ A = list(map(int, input().split()))',\n", + " '+ A.pop(0)',\n", + " '+ c = 0',\n", + " '+ for a in A:',\n", + " '+ c |= 1 << (a - 1)',\n", + " '+ r &= c',\n", + " '+ans = sum([(r >> n) & 1 for n in range(M)])',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7091809404,\n", + " 'measured_runtime_v1': 0.2837385476,\n", + " 'runtime_lift': 6.0237882903,\n", + " 'key': ['s237503515', 's632748027']},\n", + " {'user_id': 'u585482323',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's026349855',\n", + " 'submission_id_v1': 's676818074',\n", + " 'cpu_time_v0': 206,\n", + " 'cpu_time_v1': 183,\n", + " 'memory_v0': 40944,\n", + " 'memory_v1': 39408,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 11.17,\n", + " 'input': '#!usr/bin/env python3\\n\\nfrom collections import defaultdict\\n\\nfrom collections import deque\\n\\nfrom heapq import heappush, heappop\\n\\nimport sys\\n\\nimport math\\n\\nimport bisect\\n\\nimport random\\n\\ndef LI(): return list(map(int, sys.stdin.readline().split()))\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LS():return list(map(list, sys.stdin.readline().split()))\\n\\ndef S(): return list(sys.stdin.readline())[:-1]\\n\\ndef IR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = I()\\n\\n return l\\n\\ndef LIR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = LI()\\n\\n return l\\n\\ndef SR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = S()\\n\\n return l\\n\\ndef LSR(n):\\n\\n l = [None for i in range(n)]\\n\\n for i in range(n):l[i] = LS()\\n\\n return l\\n\\nsys.setrecursionlimit(1000000)\\n\\nmod = 1000000007\\n\\n\\n\\n#A\\n\\ndef A():\\n\\n return\\n\\n\\n\\n#B\\n\\ndef B():\\n\\n return\\n\\n\\n\\n#C\\n\\ndef C():\\n\\n return\\n\\n\\n\\n#D\\n\\ndef D():\\n\\n return\\n\\n\\n\\n#E\\n\\ndef E():\\n\\n return\\n\\n\\n\\n#F\\n\\ndef F():\\n\\n a,b,c,X,Y = LI()\\n\\n ans = float(\"inf\")\\n\\n for z in range(300001):\\n\\n if z%2 == 0:\\n\\n m = c*z\\n\\n x = z//2\\n\\n y = z//2\\n\\n m += a*max(0,X-x)\\n\\n m += b*max(0,Y-y)\\n\\n if m < ans:\\n\\n ans = m\\n\\n print(ans)\\n\\n return\\n\\n\\n\\n#G\\n\\ndef G():\\n\\n n = I()\\n\\n x = LI()\\n\\n f = [(i,x[i]) for i in range(n)]\\n\\n f.sort(key = lambda x:x[1])\\n\\n g = [(f[i][0],i) for i in range(n)]\\n\\n g.sort(key = lambda x:x[0])\\n\\n for i in range(n):\\n\\n if g[i][1] < n//2:\\n\\n print((f[n//2][1]))\\n\\n else:\\n\\n print((f[n//2-1][1]))\\n\\n return\\n\\n\\n\\n#H\\n\\ndef H():\\n\\n return\\n\\n\\n\\n#I\\n\\ndef I_():\\n\\n return\\n\\n\\n\\n#J\\n\\ndef J():\\n\\n return\\n\\n\\n\\n#Solve\\n\\nif __name__ == \"__main__\":\\n\\n F()\\n',\n", + " 'target': '#!usr/bin/env python3\\n\\nfrom collections import defaultdict,deque\\n\\nfrom heapq import heappush, heappop\\n\\nfrom itertools import permutations\\n\\nimport sys\\n\\nimport math\\n\\nimport bisect\\n\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\n\\ndef I(): return int(sys.stdin.readline())\\n\\ndef LS():return [list(x) for x in sys.stdin.readline().split()]\\n\\ndef S():\\n\\n res = list(sys.stdin.readline())\\n\\n if res[-1] == \"\\\\n\":\\n\\n return res[:-1]\\n\\n return res\\n\\ndef IR(n):\\n\\n return [I() for i in range(n)]\\n\\ndef LIR(n):\\n\\n return [LI() for i in range(n)]\\n\\ndef SR(n):\\n\\n return [S() for i in range(n)]\\n\\ndef LSR(n):\\n\\n return [LS() for i in range(n)]\\n\\n\\n\\nsys.setrecursionlimit(1000000)\\n\\nmod = 1000000007\\n\\n\\n\\ndef solve():\\n\\n A,B,C,x,y = LI()\\n\\n ans = float(\"inf\")\\n\\n for c in range(200001)[::2]:\\n\\n a = b = c >> 1\\n\\n a = max(0,x-a)\\n\\n b = max(0,y-b)\\n\\n s = A*a+B*b+C*c\\n\\n if s < ans:\\n\\n ans = s\\n\\n print(ans)\\n\\n return\\n\\n\\n\\n#Solve\\n\\nif __name__ == \"__main__\":\\n\\n solve()\\n',\n", + " 'code_v0_loc': 97,\n", + " 'code_v1_loc': 43,\n", + " 'code_v0_num_chars': 1751,\n", + " 'code_v1_num_chars': 1027,\n", + " 'code_v0_no_empty_lines': '#!usr/bin/env python3\\nfrom collections import defaultdict\\nfrom collections import deque\\nfrom heapq import heappush, heappop\\nimport sys\\nimport math\\nimport bisect\\nimport random\\n\\n\\ndef LI():\\n return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LS():\\n return list(map(list, sys.stdin.readline().split()))\\n\\n\\ndef S():\\n return list(sys.stdin.readline())[:-1]\\n\\n\\ndef IR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = I()\\n return l\\n\\n\\ndef LIR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = LI()\\n return l\\n\\n\\ndef SR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = S()\\n return l\\n\\n\\ndef LSR(n):\\n l = [None for i in range(n)]\\n for i in range(n):\\n l[i] = LS()\\n return l\\n\\n\\nsys.setrecursionlimit(1000000)\\nmod = 1000000007\\n# A\\ndef A():\\n return\\n\\n\\n# B\\ndef B():\\n return\\n\\n\\n# C\\ndef C():\\n return\\n\\n\\n# D\\ndef D():\\n return\\n\\n\\n# E\\ndef E():\\n return\\n\\n\\n# F\\ndef F():\\n a, b, c, X, Y = LI()\\n ans = float(\"inf\")\\n for z in range(300001):\\n if z % 2 == 0:\\n m = c * z\\n x = z // 2\\n y = z // 2\\n m += a * max(0, X - x)\\n m += b * max(0, Y - y)\\n if m < ans:\\n ans = m\\n print(ans)\\n return\\n\\n\\n# G\\ndef G():\\n n = I()\\n x = LI()\\n f = [(i, x[i]) for i in range(n)]\\n f.sort(key=lambda x: x[1])\\n g = [(f[i][0], i) for i in range(n)]\\n g.sort(key=lambda x: x[0])\\n for i in range(n):\\n if g[i][1] < n // 2:\\n print((f[n // 2][1]))\\n else:\\n print((f[n // 2 - 1][1]))\\n return\\n\\n\\n# H\\ndef H():\\n return\\n\\n\\n# I\\ndef I_():\\n return\\n\\n\\n# J\\ndef J():\\n return\\n\\n\\n# Solve\\nif __name__ == \"__main__\":\\n F()\\n',\n", + " 'code_v1_no_empty_lines': '#!usr/bin/env python3\\nfrom collections import defaultdict, deque\\nfrom heapq import heappush, heappop\\nfrom itertools import permutations\\nimport sys\\nimport math\\nimport bisect\\n\\n\\ndef LI():\\n return [int(x) for x in sys.stdin.readline().split()]\\n\\n\\ndef I():\\n return int(sys.stdin.readline())\\n\\n\\ndef LS():\\n return [list(x) for x in sys.stdin.readline().split()]\\n\\n\\ndef S():\\n res = list(sys.stdin.readline())\\n if res[-1] == \"\\\\n\":\\n return res[:-1]\\n return res\\n\\n\\ndef IR(n):\\n return [I() for i in range(n)]\\n\\n\\ndef LIR(n):\\n return [LI() for i in range(n)]\\n\\n\\ndef SR(n):\\n return [S() for i in range(n)]\\n\\n\\ndef LSR(n):\\n return [LS() for i in range(n)]\\n\\n\\nsys.setrecursionlimit(1000000)\\nmod = 1000000007\\n\\n\\ndef solve():\\n A, B, C, x, y = LI()\\n ans = float(\"inf\")\\n for c in range(200001)[::2]:\\n a = b = c >> 1\\n a = max(0, x - a)\\n b = max(0, y - b)\\n s = A * a + B * b + C * c\\n if s < ans:\\n ans = s\\n print(ans)\\n return\\n\\n\\n# Solve\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.6701030928,\n", + " 'diff': ['-from collections import defaultdict',\n", + " '-from collections import deque',\n", + " '+from collections import defaultdict, deque',\n", + " '+from itertools import permutations',\n", + " '-import random',\n", + " '- return list(map(int, sys.stdin.readline().split()))',\n", + " '+ return [int(x) for x in sys.stdin.readline().split()]',\n", + " '- return list(map(list, sys.stdin.readline().split()))',\n", + " '+ return [list(x) for x in sys.stdin.readline().split()]',\n", + " '- return list(sys.stdin.readline())[:-1]',\n", + " '+ res = list(sys.stdin.readline())',\n", + " '+ if res[-1] == \"\\\\n\":',\n", + " '+ return res[:-1]',\n", + " '+ return res',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = I()',\n", + " '- return l',\n", + " '+ return [I() for i in range(n)]',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = LI()',\n", + " '- return l',\n", + " '+ return [LI() for i in range(n)]',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = S()',\n", + " '- return l',\n", + " '+ return [S() for i in range(n)]',\n", + " '- l = [None for i in range(n)]',\n", + " '- for i in range(n):',\n", + " '- l[i] = LS()',\n", + " '- return l',\n", + " '+ return [LS() for i in range(n)]',\n", + " '-# A',\n", + " '-def A():',\n", + " '- return',\n", + " '-# B',\n", + " '-def B():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# C',\n", + " '-def C():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# D',\n", + " '-def D():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# E',\n", + " '-def E():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# F',\n", + " '-def F():',\n", + " '- a, b, c, X, Y = LI()',\n", + " '+def solve():',\n", + " '+ A, B, C, x, y = LI()',\n", + " '- for z in range(300001):',\n", + " '- if z % 2 == 0:',\n", + " '- m = c * z',\n", + " '- x = z // 2',\n", + " '- y = z // 2',\n", + " '- m += a * max(0, X - x)',\n", + " '- m += b * max(0, Y - y)',\n", + " '- if m < ans:',\n", + " '- ans = m',\n", + " '+ for c in range(200001)[::2]:',\n", + " '+ a = b = c >> 1',\n", + " '+ a = max(0, x - a)',\n", + " '+ b = max(0, y - b)',\n", + " '+ s = A * a + B * b + C * c',\n", + " '+ if s < ans:',\n", + " '+ ans = s',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# G',\n", + " '-def G():',\n", + " '- n = I()',\n", + " '- x = LI()',\n", + " '- f = [(i, x[i]) for i in range(n)]',\n", + " '- f.sort(key=lambda x: x[1])',\n", + " '- g = [(f[i][0], i) for i in range(n)]',\n", + " '- g.sort(key=lambda x: x[0])',\n", + " '- for i in range(n):',\n", + " '- if g[i][1] < n // 2:',\n", + " '- print((f[n // 2][1]))',\n", + " '- else:',\n", + " '- print((f[n // 2 - 1][1]))',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# H',\n", + " '-def H():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# I',\n", + " '-def I_():',\n", + " '- return',\n", + " '-',\n", + " '-',\n", + " '-# J',\n", + " '-def J():',\n", + " '- F()',\n", + " '+ solve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3533082061,\n", + " 'measured_runtime_v1': 0.0063346879,\n", + " 'runtime_lift': 213.6345491689,\n", + " 'key': ['s026349855', 's676818074']},\n", + " {'user_id': 'u102461423',\n", + " 'problem_id': 'p03718',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's887046149',\n", + " 'submission_id_v1': 's961575139',\n", + " 'cpu_time_v0': 1273,\n", + " 'cpu_time_v1': 312,\n", + " 'memory_v0': 17580,\n", + " 'memory_v1': 4724,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 75.49,\n", + " 'input': \"import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nfrom scipy.sparse.csgraph import dijkstra\\n\\n\\n\\nH,W = list(map(int,input().split()))\\n\\n\\n\\n# start = 0\\n\\n# rows = 1,2,...,H\\n\\n# cols = H+1,...,H+W\\n\\n# goal = H+W+1\\n\\n\\n\\nINF = 10 ** 9\\n\\nstart = 0\\n\\ngoal = H+W+1\\n\\nV = H+W+2\\n\\ngraph = [[0] * V for _ in range(V)]\\n\\nedges = [] # 隣接リスト\\n\\nfor i in range(H):\\n\\n row = eval(input())\\n\\n for j,cell in enumerate(row):\\n\\n if cell == 'o':\\n\\n graph[1+i][1+H+j] = 1\\n\\n graph[1+H+j][1+i] = 1\\n\\n s = row.find('S')\\n\\n t = row.find('T')\\n\\n if s != -1:\\n\\n graph[start][1+i] = INF\\n\\n graph[start][1+H+s] = INF\\n\\n if t != -1:\\n\\n graph[1+i][goal] = INF\\n\\n graph[1+H+t][goal] = INF\\n\\n\\n\\n# あとは max flow を求めればよい\\n\\n\\n\\ndef max_flow(graph):\\n\\n f = 0\\n\\n while True:\\n\\n if f > 200:\\n\\n return -1\\n\\n dist,pred = dijkstra(graph, indices = start, unweighted = True, return_predecessors = True)\\n\\n if dist[goal] > INF:\\n\\n return f\\n\\n f += 1\\n\\n after = goal\\n\\n while after != start:\\n\\n before = pred[after]\\n\\n graph[before][after] -= 1\\n\\n graph[after][before] += 1\\n\\n after = before\\n\\n\\n\\nanswer = max_flow(graph)\\n\\nprint(answer)\",\n", + " 'target': \"import sys\\n\\nread = sys.stdin.buffer.read\\n\\nreadline = sys.stdin.buffer.readline\\n\\nreadlines = sys.stdin.buffer.readlines\\n\\n\\n\\nfrom collections import defaultdict\\n\\n\\n\\nH,W = list(map(int,readline().split()))\\n\\nA = [line.rstrip().decode('utf-8') for line in readlines()]\\n\\n\\n\\nsource = 0\\n\\nsink = H+W+1\\n\\n\\n\\ngraph = [defaultdict(int) for _ in range(H+W+2)]\\n\\n\\n\\nINF = 10 ** 18\\n\\nfor h in range(1,H+1):\\n\\n for w,ox in enumerate(A[h-1],1):\\n\\n if ox == 'x':\\n\\n continue\\n\\n elif ox == 'o':\\n\\n graph[h][H+w] = 1\\n\\n graph[H+w][h] = 1\\n\\n elif ox == 'S':\\n\\n graph[source][h] = INF\\n\\n graph[h][source] = INF\\n\\n graph[source][H+w] = INF\\n\\n graph[H+w][source] = INF\\n\\n elif ox == 'T':\\n\\n graph[sink][h] = INF\\n\\n graph[h][sink] = INF\\n\\n graph[sink][H+w] = INF\\n\\n graph[H+w][sink] = INF\\n\\n\\n\\n\\n\\nclass Dinic():\\n\\n def __init__(self,graph,V,source,sink):\\n\\n self.graph = graph\\n\\n self.sink = sink\\n\\n self.source = source\\n\\n self.V = V\\n\\n# self.compress()\\n\\n self.N = len(V)\\n\\n \\n\\n def compress(self):\\n\\n self.N = len(self.V)\\n\\n v_to_i = {x:i for i,x in enumerate(self.V)}\\n\\n self.sink = v_to_i[self.sink]\\n\\n self.source = v_to_i[self.source]\\n\\n g = [dict() for _ in range(self.N)]\\n\\n for v,e in list(self.graph.items()):\\n\\n vn = v_to_i[v]\\n\\n g[vn] = {v_to_i[w]:c for w,c in list(e.items())}\\n\\n self.graph = g\\n\\n \\n\\n def bfs(self):\\n\\n level = [0]*self.N\\n\\n q = [self.source]\\n\\n level[self.source] = 1\\n\\n d = 1\\n\\n while q:\\n\\n if level[self.sink]:\\n\\n break\\n\\n qq = []\\n\\n d += 1\\n\\n for v in q:\\n\\n for w,cap in list(self.graph[v].items()):\\n\\n if cap == 0:\\n\\n continue\\n\\n if level[w]:\\n\\n continue\\n\\n level[w] = d\\n\\n qq.append(w)\\n\\n q = qq\\n\\n self.level = level\\n\\n \\n\\n def dfs(self,v,f):\\n\\n if v == self.sink:\\n\\n return f\\n\\n for w,cap in self.itr[v]:\\n\\n if cap == 0 or self.level[w] != self.level[v] + 1:\\n\\n continue\\n\\n d = self.dfs(w,min(f,cap))\\n\\n if d:\\n\\n self.graph[v][w] -= d\\n\\n self.graph[w][v] += d\\n\\n return d\\n\\n return 0\\n\\n \\n\\n def max_flow(self):\\n\\n INF = 10**18\\n\\n flow = 0\\n\\n while True:\\n\\n self.bfs()\\n\\n if self.level[self.sink] == 0:\\n\\n break\\n\\n self.itr = [iter(list(e.items())) for e in self.graph]\\n\\n while True:\\n\\n f = self.dfs(self.source,INF)\\n\\n if f == 0:\\n\\n break\\n\\n flow += f\\n\\n return flow\\n\\n\\n\\nanswer = Dinic(graph=graph,V=list(range(H+W+2)),source=0,sink=H+W+1).max_flow()\\n\\nif answer >= INF:\\n\\n answer = -1\\n\\nprint(answer)\",\n", + " 'code_v0_loc': 53,\n", + " 'code_v1_loc': 108,\n", + " 'code_v0_num_chars': 1210,\n", + " 'code_v1_num_chars': 3016,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nfrom scipy.sparse.csgraph import dijkstra\\n\\nH, W = list(map(int, input().split()))\\n# start = 0\\n# rows = 1,2,...,H\\n# cols = H+1,...,H+W\\n# goal = H+W+1\\nINF = 10**9\\nstart = 0\\ngoal = H + W + 1\\nV = H + W + 2\\ngraph = [[0] * V for _ in range(V)]\\nedges = [] # 隣接リスト\\nfor i in range(H):\\n row = eval(input())\\n for j, cell in enumerate(row):\\n if cell == \"o\":\\n graph[1 + i][1 + H + j] = 1\\n graph[1 + H + j][1 + i] = 1\\n s = row.find(\"S\")\\n t = row.find(\"T\")\\n if s != -1:\\n graph[start][1 + i] = INF\\n graph[start][1 + H + s] = INF\\n if t != -1:\\n graph[1 + i][goal] = INF\\n graph[1 + H + t][goal] = INF\\n# あとは max flow を求めればよい\\ndef max_flow(graph):\\n f = 0\\n while True:\\n if f > 200:\\n return -1\\n dist, pred = dijkstra(\\n graph, indices=start, unweighted=True, return_predecessors=True\\n )\\n if dist[goal] > INF:\\n return f\\n f += 1\\n after = goal\\n while after != start:\\n before = pred[after]\\n graph[before][after] -= 1\\n graph[after][before] += 1\\n after = before\\n\\n\\nanswer = max_flow(graph)\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nfrom collections import defaultdict\\n\\nH, W = list(map(int, readline().split()))\\nA = [line.rstrip().decode(\"utf-8\") for line in readlines()]\\nsource = 0\\nsink = H + W + 1\\ngraph = [defaultdict(int) for _ in range(H + W + 2)]\\nINF = 10**18\\nfor h in range(1, H + 1):\\n for w, ox in enumerate(A[h - 1], 1):\\n if ox == \"x\":\\n continue\\n elif ox == \"o\":\\n graph[h][H + w] = 1\\n graph[H + w][h] = 1\\n elif ox == \"S\":\\n graph[source][h] = INF\\n graph[h][source] = INF\\n graph[source][H + w] = INF\\n graph[H + w][source] = INF\\n elif ox == \"T\":\\n graph[sink][h] = INF\\n graph[h][sink] = INF\\n graph[sink][H + w] = INF\\n graph[H + w][sink] = INF\\n\\n\\nclass Dinic:\\n def __init__(self, graph, V, source, sink):\\n self.graph = graph\\n self.sink = sink\\n self.source = source\\n self.V = V\\n # self.compress()\\n self.N = len(V)\\n\\n def compress(self):\\n self.N = len(self.V)\\n v_to_i = {x: i for i, x in enumerate(self.V)}\\n self.sink = v_to_i[self.sink]\\n self.source = v_to_i[self.source]\\n g = [dict() for _ in range(self.N)]\\n for v, e in list(self.graph.items()):\\n vn = v_to_i[v]\\n g[vn] = {v_to_i[w]: c for w, c in list(e.items())}\\n self.graph = g\\n\\n def bfs(self):\\n level = [0] * self.N\\n q = [self.source]\\n level[self.source] = 1\\n d = 1\\n while q:\\n if level[self.sink]:\\n break\\n qq = []\\n d += 1\\n for v in q:\\n for w, cap in list(self.graph[v].items()):\\n if cap == 0:\\n continue\\n if level[w]:\\n continue\\n level[w] = d\\n qq.append(w)\\n q = qq\\n self.level = level\\n\\n def dfs(self, v, f):\\n if v == self.sink:\\n return f\\n for w, cap in self.itr[v]:\\n if cap == 0 or self.level[w] != self.level[v] + 1:\\n continue\\n d = self.dfs(w, min(f, cap))\\n if d:\\n self.graph[v][w] -= d\\n self.graph[w][v] += d\\n return d\\n return 0\\n\\n def max_flow(self):\\n INF = 10**18\\n flow = 0\\n while True:\\n self.bfs()\\n if self.level[self.sink] == 0:\\n break\\n self.itr = [iter(list(e.items())) for e in self.graph]\\n while True:\\n f = self.dfs(self.source, INF)\\n if f == 0:\\n break\\n flow += f\\n return flow\\n\\n\\nanswer = Dinic(\\n graph=graph, V=list(range(H + W + 2)), source=0, sink=H + W + 1\\n).max_flow()\\nif answer >= INF:\\n answer = -1\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.9259259259,\n", + " 'diff': ['-input = sys.stdin.readline',\n", + " '-from scipy.sparse.csgraph import dijkstra',\n", + " '+read = sys.stdin.buffer.read',\n", + " '+readline = sys.stdin.buffer.readline',\n", + " '+readlines = sys.stdin.buffer.readlines',\n", + " '+from collections import defaultdict',\n", + " '-H, W = list(map(int, input().split()))',\n", + " '-# start = 0',\n", + " '-# rows = 1,2,...,H',\n", + " '-# cols = H+1,...,H+W',\n", + " '-# goal = H+W+1',\n", + " '-INF = 10**9',\n", + " '-start = 0',\n", + " '-goal = H + W + 1',\n", + " '-V = H + W + 2',\n", + " '-graph = [[0] * V for _ in range(V)]',\n", + " '-edges = [] # 隣接リスト',\n", + " '-for i in range(H):',\n", + " '- row = eval(input())',\n", + " '- for j, cell in enumerate(row):',\n", + " '- if cell == \"o\":',\n", + " '- graph[1 + i][1 + H + j] = 1',\n", + " '- graph[1 + H + j][1 + i] = 1',\n", + " '- s = row.find(\"S\")',\n", + " '- t = row.find(\"T\")',\n", + " '- if s != -1:',\n", + " '- graph[start][1 + i] = INF',\n", + " '- graph[start][1 + H + s] = INF',\n", + " '- if t != -1:',\n", + " '- graph[1 + i][goal] = INF',\n", + " '- graph[1 + H + t][goal] = INF',\n", + " '-# あとは max flow を求めればよい',\n", + " '-def max_flow(graph):',\n", + " '- f = 0',\n", + " '- while True:',\n", + " '- if f > 200:',\n", + " '- return -1',\n", + " '- dist, pred = dijkstra(',\n", + " '- graph, indices=start, unweighted=True, return_predecessors=True',\n", + " '- )',\n", + " '- if dist[goal] > INF:',\n", + " '- return f',\n", + " '- f += 1',\n", + " '- after = goal',\n", + " '- while after != start:',\n", + " '- before = pred[after]',\n", + " '- graph[before][after] -= 1',\n", + " '- graph[after][before] += 1',\n", + " '- after = before',\n", + " '+H, W = list(map(int, readline().split()))',\n", + " '+A = [line.rstrip().decode(\"utf-8\") for line in readlines()]',\n", + " '+source = 0',\n", + " '+sink = H + W + 1',\n", + " '+graph = [defaultdict(int) for _ in range(H + W + 2)]',\n", + " '+INF = 10**18',\n", + " '+for h in range(1, H + 1):',\n", + " '+ for w, ox in enumerate(A[h - 1], 1):',\n", + " '+ if ox == \"x\":',\n", + " '+ continue',\n", + " '+ elif ox == \"o\":',\n", + " '+ graph[h][H + w] = 1',\n", + " '+ graph[H + w][h] = 1',\n", + " '+ elif ox == \"S\":',\n", + " '+ graph[source][h] = INF',\n", + " '+ graph[h][source] = INF',\n", + " '+ graph[source][H + w] = INF',\n", + " '+ graph[H + w][source] = INF',\n", + " '+ elif ox == \"T\":',\n", + " '+ graph[sink][h] = INF',\n", + " '+ graph[h][sink] = INF',\n", + " '+ graph[sink][H + w] = INF',\n", + " '+ graph[H + w][sink] = INF',\n", + " '-answer = max_flow(graph)',\n", + " '+class Dinic:',\n", + " '+ def __init__(self, graph, V, source, sink):',\n", + " '+ self.graph = graph',\n", + " '+ self.sink = sink',\n", + " '+ self.source = source',\n", + " '+ self.V = V',\n", + " '+ # self.compress()',\n", + " '+ self.N = len(V)',\n", + " '+',\n", + " '+ def compress(self):',\n", + " '+ self.N = len(self.V)',\n", + " '+ v_to_i = {x: i for i, x in enumerate(self.V)}',\n", + " '+ self.sink = v_to_i[self.sink]',\n", + " '+ self.source = v_to_i[self.source]',\n", + " '+ g = [dict() for _ in range(self.N)]',\n", + " '+ for v, e in list(self.graph.items()):',\n", + " '+ vn = v_to_i[v]',\n", + " '+ g[vn] = {v_to_i[w]: c for w, c in list(e.items())}',\n", + " '+ self.graph = g',\n", + " '+',\n", + " '+ def bfs(self):',\n", + " '+ level = [0] * self.N',\n", + " '+ q = [self.source]',\n", + " '+ level[self.source] = 1',\n", + " '+ d = 1',\n", + " '+ while q:',\n", + " '+ if level[self.sink]:',\n", + " '+ break',\n", + " '+ qq = []',\n", + " '+ d += 1',\n", + " '+ for v in q:',\n", + " '+ for w, cap in list(self.graph[v].items()):',\n", + " '+ if cap == 0:',\n", + " '+ continue',\n", + " '+ if level[w]:',\n", + " '+ continue',\n", + " '+ level[w] = d',\n", + " '+ qq.append(w)',\n", + " '+ q = qq',\n", + " '+ self.level = level',\n", + " '+',\n", + " '+ def dfs(self, v, f):',\n", + " '+ if v == self.sink:',\n", + " '+ return f',\n", + " '+ for w, cap in self.itr[v]:',\n", + " '+ if cap == 0 or self.level[w] != self.level[v] + 1:',\n", + " '+ continue',\n", + " '+ d = self.dfs(w, min(f, cap))',\n", + " '+ if d:',\n", + " '+ self.graph[v][w] -= d',\n", + " '+ self.graph[w][v] += d',\n", + " '+ return d',\n", + " '+ return 0',\n", + " '+',\n", + " '+ def max_flow(self):',\n", + " '+ INF = 10**18',\n", + " '+ flow = 0',\n", + " '+ while True:',\n", + " '+ self.bfs()',\n", + " '+ if self.level[self.sink] == 0:',\n", + " '+ break',\n", + " '+ self.itr = [iter(list(e.items())) for e in self.graph]',\n", + " '+ while True:',\n", + " '+ f = self.dfs(self.source, INF)',\n", + " '+ if f == 0:',\n", + " '+ break',\n", + " '+ flow += f',\n", + " '+ return flow',\n", + " '+',\n", + " '+',\n", + " '+answer = Dinic(',\n", + " '+ graph=graph, V=list(range(H + W + 2)), source=0, sink=H + W + 1',\n", + " '+).max_flow()',\n", + " '+if answer >= INF:',\n", + " '+ answer = -1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 2.0169065313,\n", + " 'measured_runtime_v1': 0.3407753515,\n", + " 'runtime_lift': 5.9185810307,\n", + " 'key': ['s887046149', 's961575139']},\n", + " {'user_id': 'u655663334',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's658520982',\n", + " 'submission_id_v1': 's071725046',\n", + " 'cpu_time_v0': 70,\n", + " 'cpu_time_v1': 60,\n", + " 'memory_v0': 65588,\n", + " 'memory_v1': 63880,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 14.29,\n", + " 'input': 'X = int(eval(input()))\\n\\n\\n\\ngojyous = []\\n\\n\\n\\nfor i in range(-200, 201):\\n\\n gojyous.append(i ** 5)\\n\\n\\n\\n#print(gojyous)\\n\\n\\n\\nfor i in range(-200,201):\\n\\n for j in range(-200,201):\\n\\n if(X == (int(i**5) - int(j**5))):\\n\\n print((i, j))\\n\\n exit()',\n", + " 'target': 'import sys\\n\\n\\n\\nX= int(eval(input()))\\n\\n\\n\\n#添字の最大値を算出\\n\\n\\n\\na = 1\\n\\nb = 0\\n\\ndif = 0\\n\\nwhile dif < 10**9:\\n\\n a += 1\\n\\n b += 1\\n\\n\\n\\n dif = a ** 5 - b ** 5\\n\\n\\n\\nloop_sequence = a - 1\\n\\n\\n\\nfor i in range(-(loop_sequence),loop_sequence):\\n\\n\\tfor j in range(-(loop_sequence),loop_sequence):\\n\\n\\t\\tif(X == i ** 5 - j ** 5):\\n\\n\\t\\t\\tprint((i,j))\\n\\n\\t\\t\\tsys.exit()\\n',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 257,\n", + " 'code_v1_num_chars': 327,\n", + " 'code_v0_no_empty_lines': 'X = int(eval(input()))\\ngojyous = []\\nfor i in range(-200, 201):\\n gojyous.append(i**5)\\n# print(gojyous)\\nfor i in range(-200, 201):\\n for j in range(-200, 201):\\n if X == (int(i**5) - int(j**5)):\\n print((i, j))\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nX = int(eval(input()))\\n# 添字の最大値を算出\\na = 1\\nb = 0\\ndif = 0\\nwhile dif < 10**9:\\n a += 1\\n b += 1\\n dif = a**5 - b**5\\nloop_sequence = a - 1\\nfor i in range(-(loop_sequence), loop_sequence):\\n for j in range(-(loop_sequence), loop_sequence):\\n if X == i**5 - j**5:\\n print((i, j))\\n sys.exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.3636363636,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '-gojyous = []',\n", + " '-for i in range(-200, 201):',\n", + " '- gojyous.append(i**5)',\n", + " '-# print(gojyous)',\n", + " '-for i in range(-200, 201):',\n", + " '- for j in range(-200, 201):',\n", + " '- if X == (int(i**5) - int(j**5)):',\n", + " '+# 添字の最大値を算出',\n", + " '+a = 1',\n", + " '+b = 0',\n", + " '+dif = 0',\n", + " '+while dif < 10**9:',\n", + " '+ a += 1',\n", + " '+ b += 1',\n", + " '+ dif = a**5 - b**5',\n", + " '+loop_sequence = a - 1',\n", + " '+for i in range(-(loop_sequence), loop_sequence):',\n", + " '+ for j in range(-(loop_sequence), loop_sequence):',\n", + " '+ if X == i**5 - j**5:',\n", + " '- exit()',\n", + " '+ sys.exit()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5855294764,\n", + " 'measured_runtime_v1': 0.26911816,\n", + " 'runtime_lift': 2.175733798,\n", + " 'key': ['s658520982', 's071725046']},\n", + " {'user_id': 'u186838327',\n", + " 'problem_id': 'p02881',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's806961932',\n", + " 'submission_id_v1': 's386327339',\n", + " 'cpu_time_v0': 218,\n", + " 'cpu_time_v1': 179,\n", + " 'memory_v0': 40428,\n", + " 'memory_v1': 39280,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.89,\n", + " 'input': 'n = int(eval(input()))\\n\\nimport math\\n\\nm = int(math.sqrt(n))+1\\n\\nanss = []\\n\\nfor x in range(1, m+1):\\n\\n y = n//x\\n\\n z = n%x\\n\\n if z == 0:\\n\\n anss.append(abs(x-1)+abs(y-1))\\n\\nprint((min(anss)))\\n',\n", + " 'target': \"n = int(eval(input()))\\n\\ndef make_divisors(n):\\n\\n divisors = []\\n\\n for i in range(1, int(n**0.5)+1):\\n\\n if n % i == 0:\\n\\n divisors.append(i)\\n\\n if i != n // i:\\n\\n divisors.append(n//i)\\n\\n\\n\\n #divisors.sort(reverse=True)\\n\\n return divisors\\n\\n\\n\\nl = make_divisors(n)\\n\\nmin_ = float('inf')\\n\\nfor i in range(len(l)):\\n\\n min_ = min(min_, l[i]-1+n//l[i]-1)\\n\\nprint(min_)\\n\",\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 182,\n", + " 'code_v1_num_chars': 402,\n", + " 'code_v0_no_empty_lines': 'n = int(eval(input()))\\nimport math\\n\\nm = int(math.sqrt(n)) + 1\\nanss = []\\nfor x in range(1, m + 1):\\n y = n // x\\n z = n % x\\n if z == 0:\\n anss.append(abs(x - 1) + abs(y - 1))\\nprint((min(anss)))\\n',\n", + " 'code_v1_no_empty_lines': 'n = int(eval(input()))\\n\\n\\ndef make_divisors(n):\\n divisors = []\\n for i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n divisors.append(i)\\n if i != n // i:\\n divisors.append(n // i)\\n # divisors.sort(reverse=True)\\n return divisors\\n\\n\\nl = make_divisors(n)\\nmin_ = float(\"inf\")\\nfor i in range(len(l)):\\n min_ = min(min_, l[i] - 1 + n // l[i] - 1)\\nprint(min_)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.1764705882,\n", + " 'diff': ['-import math',\n", + " '-m = int(math.sqrt(n)) + 1',\n", + " '-anss = []',\n", + " '-for x in range(1, m + 1):',\n", + " '- y = n // x',\n", + " '- z = n % x',\n", + " '- if z == 0:',\n", + " '- anss.append(abs(x - 1) + abs(y - 1))',\n", + " '-print((min(anss)))',\n", + " '+',\n", + " '+def make_divisors(n):',\n", + " '+ divisors = []',\n", + " '+ for i in range(1, int(n**0.5) + 1):',\n", + " '+ if n % i == 0:',\n", + " '+ divisors.append(i)',\n", + " '+ if i != n // i:',\n", + " '+ divisors.append(n // i)',\n", + " '+ # divisors.sort(reverse=True)',\n", + " '+ return divisors',\n", + " '+',\n", + " '+',\n", + " '+l = make_divisors(n)',\n", + " '+min_ = float(\"inf\")',\n", + " '+for i in range(len(l)):',\n", + " '+ min_ = min(min_, l[i] - 1 + n // l[i] - 1)',\n", + " '+print(min_)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3428507342,\n", + " 'measured_runtime_v1': 0.2632945333,\n", + " 'runtime_lift': 1.302156676,\n", + " 'key': ['s806961932', 's386327339']},\n", + " {'user_id': 'u706786134',\n", + " 'problem_id': 'p03162',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's594464036',\n", + " 'submission_id_v1': 's976355345',\n", + " 'cpu_time_v0': 1103,\n", + " 'cpu_time_v1': 647,\n", + " 'memory_v0': 56196,\n", + " 'memory_v1': 47192,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 41.34,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nn = int(eval(input()))\\n\\nX = np.array([input().split() for _ in range(n)], np.int64)\\n\\ndp = np.zeros((n + 1, 3), np.int64)\\n\\ndp[0, 0] = dp[0, 1] = dp[0, 2] = 0\\n\\nfor i in range(n):\\n\\n for j in range(3):\\n\\n dp[i + 1, j] = X[i, j] + max(dp[i, k] for k in range(3) if j != k)\\n\\nprint((max(dp[n])))',\n", + " 'target': 'N = int(eval(input()))\\n\\nx, y, z = 0, 0, 0\\n\\nfor _ in range(N):\\n\\n a, b, c = list(map(int, input().split()))\\n\\n x, y, z = max(y, z) + a, max(z, x) + b, max(x, y) + c\\n\\nprint((max(x, y, z)))',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 311,\n", + " 'code_v1_num_chars': 176,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nn = int(eval(input()))\\nX = np.array([input().split() for _ in range(n)], np.int64)\\ndp = np.zeros((n + 1, 3), np.int64)\\ndp[0, 0] = dp[0, 1] = dp[0, 2] = 0\\nfor i in range(n):\\n for j in range(3):\\n dp[i + 1, j] = X[i, j] + max(dp[i, k] for k in range(3) if j != k)\\nprint((max(dp[n])))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nx, y, z = 0, 0, 0\\nfor _ in range(N):\\n a, b, c = list(map(int, input().split()))\\n x, y, z = max(y, z) + a, max(z, x) + b, max(x, y) + c\\nprint((max(x, y, z)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 40.0,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-n = int(eval(input()))',\n", + " '-X = np.array([input().split() for _ in range(n)], np.int64)',\n", + " '-dp = np.zeros((n + 1, 3), np.int64)',\n", + " '-dp[0, 0] = dp[0, 1] = dp[0, 2] = 0',\n", + " '-for i in range(n):',\n", + " '- for j in range(3):',\n", + " '- dp[i + 1, j] = X[i, j] + max(dp[i, k] for k in range(3) if j != k)',\n", + " '-print((max(dp[n])))',\n", + " '+N = int(eval(input()))',\n", + " '+x, y, z = 0, 0, 0',\n", + " '+for _ in range(N):',\n", + " '+ a, b, c = list(map(int, input().split()))',\n", + " '+ x, y, z = max(y, z) + a, max(z, x) + b, max(x, y) + c',\n", + " '+print((max(x, y, z)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.9783216975,\n", + " 'measured_runtime_v1': 0.3213120236,\n", + " 'runtime_lift': 6.157011104,\n", + " 'key': ['s594464036', 's976355345']},\n", + " {'user_id': 'u156896646',\n", + " 'problem_id': 'p03854',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's725954700',\n", + " 'submission_id_v1': 's400985362',\n", + " 'cpu_time_v0': 76,\n", + " 'cpu_time_v1': 64,\n", + " 'memory_v0': 21348,\n", + " 'memory_v1': 21348,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 15.79,\n", + " 'input': \"import sys\\n\\nsys.setrecursionlimit(1000000)\\n\\n\\n\\nS = eval(input())\\n\\n\\n\\nT = ['dream', 'dreamer', 'erase', 'eraser']\\n\\nlenT = [len(i) for i in T]\\n\\n\\n\\ndef dayDream(pin):\\n\\n global isDream #;print('dayDream: ', pin, S[pin:])\\n\\n for i, d in enumerate(T):\\n\\n #print('d:', d)\\n\\n if S[pin:pin+lenT[i]] == d: \\n\\n pout = pin + lenT[i] #; print(d, pout)\\n\\n if pout == len(S): \\n\\n isDream = True #; print('YES')\\n\\n return \\n\\n else:\\n\\n dayDream(pout)\\n\\n #print('dayDream return', pin)\\n\\n return\\n\\n \\n\\nisDream = False\\n\\ndayDream(0)\\n\\nif isDream:\\n\\n print('YES')\\n\\nelse:\\n\\n print('NO')\",\n", + " 'target': \"import sys\\n\\nsys.setrecursionlimit(1000000)\\n\\n\\n\\nS = eval(input())\\n\\n\\n\\nT = ['dream', 'dreamer', 'erase', 'eraser']\\n\\nlenT = [len(i) for i in T]\\n\\n\\n\\ndef dayDream(pin):\\n\\n global isGoal #;print('dayDream: ', pin, S[pin:])\\n\\n for i, d in enumerate(T):\\n\\n if isGoal:\\n\\n return\\n\\n #print('i, d:', i, d)\\n\\n if S[pin:pin+lenT[i]] == d: \\n\\n pout = pin + lenT[i] #;print(d, pout)\\n\\n if pout == len(S): \\n\\n isGoal = True #;print('YES')\\n\\n return \\n\\n else:\\n\\n dayDream(pout)\\n\\n #print('dayDream return', pin)\\n\\n return\\n\\n \\n\\nisGoal = False\\n\\ndayDream(0)\\n\\nif isGoal:\\n\\n print('YES')\\n\\nelse:\\n\\n print('NO')\",\n", + " 'code_v0_loc': 28,\n", + " 'code_v1_loc': 30,\n", + " 'code_v0_num_chars': 694,\n", + " 'code_v1_num_chars': 735,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(1000000)\\nS = eval(input())\\nT = [\"dream\", \"dreamer\", \"erase\", \"eraser\"]\\nlenT = [len(i) for i in T]\\n\\n\\ndef dayDream(pin):\\n global isDream # ;print(\\'dayDream: \\', pin, S[pin:])\\n for i, d in enumerate(T):\\n # print(\\'d:\\', d)\\n if S[pin : pin + lenT[i]] == d:\\n pout = pin + lenT[i] # ; print(d, pout)\\n if pout == len(S):\\n isDream = True # ; print(\\'YES\\')\\n return\\n else:\\n dayDream(pout)\\n # print(\\'dayDream return\\', pin)\\n return\\n\\n\\nisDream = False\\ndayDream(0)\\nif isDream:\\n print(\"YES\")\\nelse:\\n print(\"NO\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(1000000)\\nS = eval(input())\\nT = [\"dream\", \"dreamer\", \"erase\", \"eraser\"]\\nlenT = [len(i) for i in T]\\n\\n\\ndef dayDream(pin):\\n global isGoal # ;print(\\'dayDream: \\', pin, S[pin:])\\n for i, d in enumerate(T):\\n if isGoal:\\n return\\n # print(\\'i, d:\\', i, d)\\n if S[pin : pin + lenT[i]] == d:\\n pout = pin + lenT[i] # ;print(d, pout)\\n if pout == len(S):\\n isGoal = True # ;print(\\'YES\\')\\n return\\n else:\\n dayDream(pout)\\n # print(\\'dayDream return\\', pin)\\n return\\n\\n\\nisGoal = False\\ndayDream(0)\\nif isGoal:\\n print(\"YES\")\\nelse:\\n print(\"NO\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 6.6666666667,\n", + " 'diff': [\"- global isDream # ;print('dayDream: ', pin, S[pin:])\",\n", + " \"+ global isGoal # ;print('dayDream: ', pin, S[pin:])\",\n", + " \"- # print('d:', d)\",\n", + " '+ if isGoal:',\n", + " '+ return',\n", + " \"+ # print('i, d:', i, d)\",\n", + " '- pout = pin + lenT[i] # ; print(d, pout)',\n", + " '+ pout = pin + lenT[i] # ;print(d, pout)',\n", + " \"- isDream = True # ; print('YES')\",\n", + " \"+ isGoal = True # ;print('YES')\",\n", + " '-isDream = False',\n", + " '+isGoal = False',\n", + " '-if isDream:',\n", + " '+if isGoal:'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3036904747,\n", + " 'measured_runtime_v1': 0.2140211895,\n", + " 'runtime_lift': 1.4189738666,\n", + " 'key': ['s725954700', 's400985362']},\n", + " {'user_id': 'u045939752',\n", + " 'problem_id': 'p03814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's574890983',\n", + " 'submission_id_v1': 's839527046',\n", + " 'cpu_time_v0': 23,\n", + " 'cpu_time_v1': 18,\n", + " 'memory_v0': 3516,\n", + " 'memory_v1': 3500,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 21.74,\n", + " 'input': \"S=eval(input())\\n\\nprint((S.rfind('Z')-S.find('A')+1))\",\n", + " 'target': \"s=input().strip()\\n\\na = s.find('A')\\n\\nz = s.rfind('Z')\\n\\nprint((z-a+1))\\n\",\n", + " 'code_v0_loc': 2,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 44,\n", + " 'code_v1_num_chars': 67,\n", + " 'code_v0_no_empty_lines': 'S = eval(input())\\nprint((S.rfind(\"Z\") - S.find(\"A\") + 1))\\n',\n", + " 'code_v1_no_empty_lines': 's = input().strip()\\na = s.find(\"A\")\\nz = s.rfind(\"Z\")\\nprint((z - a + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-S = eval(input())',\n", + " '-print((S.rfind(\"Z\") - S.find(\"A\") + 1))',\n", + " '+s = input().strip()',\n", + " '+a = s.find(\"A\")',\n", + " '+z = s.rfind(\"Z\")',\n", + " '+print((z - a + 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.286565238,\n", + " 'measured_runtime_v1': 0.2292430663,\n", + " 'runtime_lift': 1.2500497511,\n", + " 'key': ['s574890983', 's839527046']},\n", + " {'user_id': 'u761320129',\n", + " 'problem_id': 'p03425',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's293375746',\n", + " 'submission_id_v1': 's279901441',\n", + " 'cpu_time_v0': 180,\n", + " 'cpu_time_v1': 149,\n", + " 'memory_v0': 10112,\n", + " 'memory_v1': 10876,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 17.22,\n", + " 'input': \"import itertools\\n\\nfrom collections import Counter\\n\\nN = int(eval(input()))\\n\\nsrc = [eval(input()) for i in range(N)]\\n\\nctr = Counter()\\n\\nfor s in src:\\n\\n ctr[s[0]] += 1\\n\\n\\n\\nans = 0\\n\\nfor ptn in itertools.combinations('MARCH',3):\\n\\n a,b,c = ptn\\n\\n ans += ctr[a]*ctr[b]*ctr[c]\\n\\nprint(ans)\",\n", + " 'target': \"N = int(eval(input()))\\n\\nS = [eval(input()) for i in range(N)]\\n\\nfrom collections import Counter\\n\\nctr = Counter([s[0] for s in S])\\n\\n\\n\\nans = 0\\n\\nimport itertools\\n\\nfor ptn in itertools.combinations('MARCH', 3):\\n\\n t = 1\\n\\n for c in ptn:\\n\\n t *= ctr[c]\\n\\n ans += t\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 274,\n", + " 'code_v1_num_chars': 270,\n", + " 'code_v0_no_empty_lines': 'import itertools\\nfrom collections import Counter\\n\\nN = int(eval(input()))\\nsrc = [eval(input()) for i in range(N)]\\nctr = Counter()\\nfor s in src:\\n ctr[s[0]] += 1\\nans = 0\\nfor ptn in itertools.combinations(\"MARCH\", 3):\\n a, b, c = ptn\\n ans += ctr[a] * ctr[b] * ctr[c]\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nS = [eval(input()) for i in range(N)]\\nfrom collections import Counter\\n\\nctr = Counter([s[0] for s in S])\\nans = 0\\nimport itertools\\n\\nfor ptn in itertools.combinations(\"MARCH\", 3):\\n t = 1\\n for c in ptn:\\n t *= ctr[c]\\n ans += t\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-import itertools',\n", + " '+N = int(eval(input()))',\n", + " '+S = [eval(input()) for i in range(N)]',\n", + " '-N = int(eval(input()))',\n", + " '-src = [eval(input()) for i in range(N)]',\n", + " '-ctr = Counter()',\n", + " '-for s in src:',\n", + " '- ctr[s[0]] += 1',\n", + " '+ctr = Counter([s[0] for s in S])',\n", + " '+import itertools',\n", + " '+',\n", + " '- a, b, c = ptn',\n", + " '- ans += ctr[a] * ctr[b] * ctr[c]',\n", + " '+ t = 1',\n", + " '+ for c in ptn:',\n", + " '+ t *= ctr[c]',\n", + " '+ ans += t'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.206595207,\n", + " 'measured_runtime_v1': 0.1454657862,\n", + " 'runtime_lift': 1.420232292,\n", + " 'key': ['s293375746', 's279901441']},\n", + " {'user_id': 'u678167152',\n", + " 'problem_id': 'p02773',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's779115559',\n", + " 'submission_id_v1': 's953043553',\n", + " 'cpu_time_v0': 682,\n", + " 'cpu_time_v1': 392,\n", + " 'memory_v0': 32096,\n", + " 'memory_v1': 38716,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 42.52,\n", + " 'input': 'N = int(eval(input()))\\n\\ns_list = {}\\n\\nfor i in range(N):\\n\\n S = eval(input())\\n\\n if S in list(s_list.keys()):\\n\\n s_list[S] += 1\\n\\n else:\\n\\n s_list[S] = 0\\n\\nmax = 0\\n\\nmaxs = []\\n\\nfor s,c in list(s_list.items()):\\n\\n if c > max:\\n\\n maxs = [s]\\n\\n max = c\\n\\n elif c == max:\\n\\n maxs.append(s)\\n\\nmaxs.sort()\\n\\nfor m in maxs:\\n\\n print(m)',\n", + " 'target': \"from collections import Counter\\n\\ndef solve():\\n\\n N = int(input())\\n\\n S = [input() for _ in range(N)]\\n\\n c = Counter(S)\\n\\n M = max(c.values())\\n\\n ans = []\\n\\n for k,v in c.items():\\n\\n if v==M:\\n\\n ans.append(k)\\n\\n ans.sort()\\n\\n return ans\\n\\nprint(*solve(),sep='\\\\n')\\n\",\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 13,\n", + " 'code_v0_num_chars': 309,\n", + " 'code_v1_num_chars': 267,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\ns_list = {}\\nfor i in range(N):\\n S = eval(input())\\n if S in list(s_list.keys()):\\n s_list[S] += 1\\n else:\\n s_list[S] = 0\\nmax = 0\\nmaxs = []\\nfor s, c in list(s_list.items()):\\n if c > max:\\n maxs = [s]\\n max = c\\n elif c == max:\\n maxs.append(s)\\nmaxs.sort()\\nfor m in maxs:\\n print(m)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import Counter\\n\\n\\ndef solve():\\n N = int(input())\\n S = [input() for _ in range(N)]\\n c = Counter(S)\\n M = max(c.values())\\n ans = []\\n for k, v in c.items():\\n if v == M:\\n ans.append(k)\\n ans.sort()\\n return ans\\n\\n\\nprint(*solve(), sep=\"\\\\n\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 31.5789473684,\n", + " 'diff': ['-N = int(eval(input()))',\n", + " '-s_list = {}',\n", + " '-for i in range(N):',\n", + " '- S = eval(input())',\n", + " '- if S in list(s_list.keys()):',\n", + " '- s_list[S] += 1',\n", + " '- else:',\n", + " '- s_list[S] = 0',\n", + " '-max = 0',\n", + " '-maxs = []',\n", + " '-for s, c in list(s_list.items()):',\n", + " '- if c > max:',\n", + " '- maxs = [s]',\n", + " '- max = c',\n", + " '- elif c == max:',\n", + " '- maxs.append(s)',\n", + " '-maxs.sort()',\n", + " '-for m in maxs:',\n", + " '- print(m)',\n", + " '+from collections import Counter',\n", + " '+',\n", + " '+',\n", + " '+def solve():',\n", + " '+ N = int(input())',\n", + " '+ S = [input() for _ in range(N)]',\n", + " '+ c = Counter(S)',\n", + " '+ M = max(c.values())',\n", + " '+ ans = []',\n", + " '+ for k, v in c.items():',\n", + " '+ if v == M:',\n", + " '+ ans.append(k)',\n", + " '+ ans.sort()',\n", + " '+ return ans',\n", + " '+',\n", + " '+',\n", + " '+print(*solve(), sep=\"\\\\n\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1935686147,\n", + " 'measured_runtime_v1': 0.0062823365,\n", + " 'runtime_lift': 30.8115643329,\n", + " 'key': ['s779115559', 's953043553']},\n", + " {'user_id': 'u379716238',\n", + " 'problem_id': 'p03494',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's321227388',\n", + " 'submission_id_v1': 's000982817',\n", + " 'cpu_time_v0': 155,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12448,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.74,\n", + " 'input': 'import numpy as np\\n\\n\\n\\nx = int(eval(input()))\\n\\ny = input().split()\\n\\ny = [int(i) for i in y]\\n\\ny = np.array(y)\\n\\ncount = 0\\n\\nwhile sum([y[i] % 2 for i in range(len(y))]) == 0:\\n\\n y = y/2\\n\\n count += 1\\n\\nprint(count)',\n", + " 'target': 'N = int(eval(input()))\\n\\nA = input().split()\\n\\nA = [int(i) for i in A]\\n\\n\\n\\nc = 0 \\n\\n\\n\\nwhile True:\\n\\n exist_odd = False\\n\\n for a in A:\\n\\n if a % 2 != 0:\\n\\n exist_odd = True\\n\\n \\n\\n if exist_odd: break\\n\\n\\n\\n for i in range(N):\\n\\n A[i] = A[i] / 2\\n\\n \\n\\n c = c + 1\\n\\nprint(c)',\n", + " 'code_v0_loc': 11,\n", + " 'code_v1_loc': 19,\n", + " 'code_v0_num_chars': 207,\n", + " 'code_v1_num_chars': 268,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nx = int(eval(input()))\\ny = input().split()\\ny = [int(i) for i in y]\\ny = np.array(y)\\ncount = 0\\nwhile sum([y[i] % 2 for i in range(len(y))]) == 0:\\n y = y / 2\\n count += 1\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nA = input().split()\\nA = [int(i) for i in A]\\nc = 0\\nwhile True:\\n exist_odd = False\\n for a in A:\\n if a % 2 != 0:\\n exist_odd = True\\n if exist_odd:\\n break\\n for i in range(N):\\n A[i] = A[i] / 2\\n c = c + 1\\nprint(c)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 42.1052631579,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-x = int(eval(input()))',\n", + " '-y = input().split()',\n", + " '-y = [int(i) for i in y]',\n", + " '-y = np.array(y)',\n", + " '-count = 0',\n", + " '-while sum([y[i] % 2 for i in range(len(y))]) == 0:',\n", + " '- y = y / 2',\n", + " '- count += 1',\n", + " '-print(count)',\n", + " '+N = int(eval(input()))',\n", + " '+A = input().split()',\n", + " '+A = [int(i) for i in A]',\n", + " '+c = 0',\n", + " '+while True:',\n", + " '+ exist_odd = False',\n", + " '+ for a in A:',\n", + " '+ if a % 2 != 0:',\n", + " '+ exist_odd = True',\n", + " '+ if exist_odd:',\n", + " '+ break',\n", + " '+ for i in range(N):',\n", + " '+ A[i] = A[i] / 2',\n", + " '+ c = c + 1',\n", + " '+print(c)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7057790201,\n", + " 'measured_runtime_v1': 0.3239225752,\n", + " 'runtime_lift': 5.2660084552,\n", + " 'key': ['s321227388', 's000982817']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's785699428',\n", + " 'submission_id_v1': 's355827371',\n", + " 'cpu_time_v0': 419,\n", + " 'cpu_time_v1': 84,\n", + " 'memory_v0': 67256,\n", + " 'memory_v1': 9548,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.95,\n", + " 'input': \"import sys\\n\\nimport numpy as np\\n\\n\\n\\nx, y, z, k = map(int, sys.stdin.readline().split())\\n\\na, b, c = (np.array(sys.stdin.readline().split(), dtype=np.int64) for _ in range(3))\\n\\n\\n\\ndef main():\\n\\n res = np.sort(np.ravel(a[:, None] + b))[::-1]\\n\\n res = np.sort(np.ravel(c[:, None] + res[:min(k, x*y)]))[::-1]\\n\\n return res[:k]\\n\\n\\n\\nif __name__ == '__main__':\\n\\n ans = main()\\n\\n print(*ans, sep='\\\\n')\\n\",\n", + " 'target': \"import sys\\n\\n\\n\\nx, y, z, K = map(int, sys.stdin.readline().split())\\n\\na, b, c = (sorted(map(int, sys.stdin.readline().split()), reverse=True) for _ in range(3))\\n\\ndef main():\\n\\n res = []\\n\\n for i in range(1, min(K, x) + 1):\\n\\n for j in range(1, min(K // i, y) + 1):\\n\\n for k in range(1, min(K // (i * j), z) + 1):\\n\\n res.append(a[i-1] + b[j-1] + c[k-1])\\n\\n\\n\\n return sorted(res, reverse=True)[:K]\\n\\n\\n\\nif __name__ == '__main__':\\n\\n ans = main()\\n\\n print(*ans, sep='\\\\n')\\n\",\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 399,\n", + " 'code_v1_num_chars': 502,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nx, y, z, k = map(int, sys.stdin.readline().split())\\na, b, c = (np.array(sys.stdin.readline().split(), dtype=np.int64) for _ in range(3))\\n\\n\\ndef main():\\n res = np.sort(np.ravel(a[:, None] + b))[::-1]\\n res = np.sort(np.ravel(c[:, None] + res[: min(k, x * y)]))[::-1]\\n return res[:k]\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(*ans, sep=\"\\\\n\")\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nx, y, z, K = map(int, sys.stdin.readline().split())\\na, b, c = (\\n sorted(map(int, sys.stdin.readline().split()), reverse=True) for _ in range(3)\\n)\\n\\n\\ndef main():\\n res = []\\n for i in range(1, min(K, x) + 1):\\n for j in range(1, min(K // i, y) + 1):\\n for k in range(1, min(K // (i * j), z) + 1):\\n res.append(a[i - 1] + b[j - 1] + c[k - 1])\\n return sorted(res, reverse=True)[:K]\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(*ans, sep=\"\\\\n\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-import numpy as np',\n", + " '-x, y, z, k = map(int, sys.stdin.readline().split())',\n", + " '-a, b, c = (np.array(sys.stdin.readline().split(), dtype=np.int64) for _ in range(3))',\n", + " '+x, y, z, K = map(int, sys.stdin.readline().split())',\n", + " '+a, b, c = (',\n", + " '+ sorted(map(int, sys.stdin.readline().split()), reverse=True) for _ in range(3)',\n", + " '+)',\n", + " '- res = np.sort(np.ravel(a[:, None] + b))[::-1]',\n", + " '- res = np.sort(np.ravel(c[:, None] + res[: min(k, x * y)]))[::-1]',\n", + " '- return res[:k]',\n", + " '+ res = []',\n", + " '+ for i in range(1, min(K, x) + 1):',\n", + " '+ for j in range(1, min(K // i, y) + 1):',\n", + " '+ for k in range(1, min(K // (i * j), z) + 1):',\n", + " '+ res.append(a[i - 1] + b[j - 1] + c[k - 1])',\n", + " '+ return sorted(res, reverse=True)[:K]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2671924386,\n", + " 'measured_runtime_v1': 0.2012458158,\n", + " 'runtime_lift': 6.2967393076,\n", + " 'key': ['s785699428', 's355827371']},\n", + " {'user_id': 'u163320134',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's506243349',\n", + " 'submission_id_v1': 's621495959',\n", + " 'cpu_time_v0': 131,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 38348,\n", + " 'memory_v1': 9100,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 69.47,\n", + " 'input': 'x=int(eval(input()))\\n\\ndic={}\\n\\nfor i in range(10**5):\\n\\n dic[i**5]=i\\n\\n dic[(-i)**5]=-i\\n\\nfor i in range(10**5):\\n\\n if i**5+x in dic:\\n\\n print((dic[i**5+x],i))\\n\\n break\\n\\n if (-i)**5+x in dic:\\n\\n print((dic[(-i)**5+x],-i))\\n\\n break',\n", + " 'target': 'x=int(eval(input()))\\n\\nfor a in range(-118,120):\\n\\n for b in range(-119,119):\\n\\n if a**5-b**5==x:\\n\\n print((a,b))\\n\\n exit()',\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 239,\n", + " 'code_v1_num_chars': 124,\n", + " 'code_v0_no_empty_lines': 'x = int(eval(input()))\\ndic = {}\\nfor i in range(10**5):\\n dic[i**5] = i\\n dic[(-i) ** 5] = -i\\nfor i in range(10**5):\\n if i**5 + x in dic:\\n print((dic[i**5 + x], i))\\n break\\n if (-i) ** 5 + x in dic:\\n print((dic[(-i) ** 5 + x], -i))\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'x = int(eval(input()))\\nfor a in range(-118, 120):\\n for b in range(-119, 119):\\n if a**5 - b**5 == x:\\n print((a, b))\\n exit()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 50.0,\n", + " 'diff': ['-dic = {}',\n", + " '-for i in range(10**5):',\n", + " '- dic[i**5] = i',\n", + " '- dic[(-i) ** 5] = -i',\n", + " '-for i in range(10**5):',\n", + " '- if i**5 + x in dic:',\n", + " '- print((dic[i**5 + x], i))',\n", + " '- break',\n", + " '- if (-i) ** 5 + x in dic:',\n", + " '- print((dic[(-i) ** 5 + x], -i))',\n", + " '- break',\n", + " '+for a in range(-118, 120):',\n", + " '+ for b in range(-119, 119):',\n", + " '+ if a**5 - b**5 == x:',\n", + " '+ print((a, b))',\n", + " '+ exit()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.2600205839,\n", + " 'measured_runtime_v1': 0.3441586594,\n", + " 'runtime_lift': 3.6611619365,\n", + " 'key': ['s506243349', 's621495959']},\n", + " {'user_id': 'u633068244',\n", + " 'problem_id': 'p01438',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's057521298',\n", + " 'submission_id_v1': 's672157071',\n", + " 'cpu_time_v0': 350,\n", + " 'cpu_time_v1': 160,\n", + " 'memory_v0': 16636,\n", + " 'memory_v1': 11468,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 54.29,\n", + " 'input': 'from collections import defaultdict\\n\\nwhile 1:\\n\\n n = int(input())\\n\\n if n == 0: break\\n\\n L = [0]*n\\n\\n D = [0]*n\\n\\n for man in range(n):\\n\\n m,l = list(map(int,input().split()))\\n\\n L[man] = l\\n\\n t = 0\\n\\n for date in range(m):\\n\\n s,e = list(map(int,input().split()))\\n\\n for s in range(s-6,e-6):\\n\\n t |= 1 << s\\n\\n D[man] = t\\n\\n\\n\\n dp = [defaultdict(int) for i in range(n)]\\n\\n dp[0][D[0]] = L[0]\\n\\n for i in range(1,n):\\n\\n for bit in list(dp[i-1].keys()):\\n\\n if bit&D[i] == 0:\\n\\n dp[i][bit|D[i]] = max(dp[i][bit|D[i]], dp[i-1][bit]+L[i])\\n\\n dp[i][bit] = max(dp[i][bit],dp[i-1][bit])\\n\\n dp[i][D[i]] = max(dp[i][D[i]], L[i])\\n\\n \\n\\n ans = max(max(dp[i].values()) for i in range(n))\\n\\n print(ans)',\n", + " 'target': 'from collections import defaultdict\\n\\nwhile 1:\\n\\n n = int(input())\\n\\n if n == 0: break\\n\\n L = [0]*n\\n\\n T = [0]*n\\n\\n for man in range(n):\\n\\n m,l = list(map(int,input().split()))\\n\\n L[man] = l\\n\\n t = 0\\n\\n for date in range(m):\\n\\n s,e = list(map(int,input().split()))\\n\\n t |= 2**(e-6)-2**(s-6)\\n\\n T[man] = t\\n\\n\\n\\n dp = defaultdict(int)\\n\\n dp[T[0]] = L[0]\\n\\n for i in range(1,n):\\n\\n for bit in list(dp.keys()):\\n\\n if bit&T[i] == 0:\\n\\n dp[bit|T[i]] = max(dp[bit|T[i]], dp[bit]+L[i])\\n\\n dp[T[i]] = max(dp[T[i]], L[i])\\n\\n \\n\\n print(max(dp.values()))',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 24,\n", + " 'code_v0_num_chars': 821,\n", + " 'code_v1_num_chars': 646,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\n\\nwhile 1:\\n n = int(input())\\n if n == 0:\\n break\\n L = [0] * n\\n D = [0] * n\\n for man in range(n):\\n m, l = list(map(int, input().split()))\\n L[man] = l\\n t = 0\\n for date in range(m):\\n s, e = list(map(int, input().split()))\\n for s in range(s - 6, e - 6):\\n t |= 1 << s\\n D[man] = t\\n dp = [defaultdict(int) for i in range(n)]\\n dp[0][D[0]] = L[0]\\n for i in range(1, n):\\n for bit in list(dp[i - 1].keys()):\\n if bit & D[i] == 0:\\n dp[i][bit | D[i]] = max(dp[i][bit | D[i]], dp[i - 1][bit] + L[i])\\n dp[i][bit] = max(dp[i][bit], dp[i - 1][bit])\\n dp[i][D[i]] = max(dp[i][D[i]], L[i])\\n ans = max(max(dp[i].values()) for i in range(n))\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\nwhile 1:\\n n = int(input())\\n if n == 0:\\n break\\n L = [0] * n\\n T = [0] * n\\n for man in range(n):\\n m, l = list(map(int, input().split()))\\n L[man] = l\\n t = 0\\n for date in range(m):\\n s, e = list(map(int, input().split()))\\n t |= 2 ** (e - 6) - 2 ** (s - 6)\\n T[man] = t\\n dp = defaultdict(int)\\n dp[T[0]] = L[0]\\n for i in range(1, n):\\n for bit in list(dp.keys()):\\n if bit & T[i] == 0:\\n dp[bit | T[i]] = max(dp[bit | T[i]], dp[bit] + L[i])\\n dp[T[i]] = max(dp[T[i]], L[i])\\n print(max(dp.values()))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.1111111111,\n", + " 'diff': ['- D = [0] * n',\n", + " '+ T = [0] * n',\n", + " '- for s in range(s - 6, e - 6):',\n", + " '- t |= 1 << s',\n", + " '- D[man] = t',\n", + " '- dp = [defaultdict(int) for i in range(n)]',\n", + " '- dp[0][D[0]] = L[0]',\n", + " '+ t |= 2 ** (e - 6) - 2 ** (s - 6)',\n", + " '+ T[man] = t',\n", + " '+ dp = defaultdict(int)',\n", + " '+ dp[T[0]] = L[0]',\n", + " '- for bit in list(dp[i - 1].keys()):',\n", + " '- if bit & D[i] == 0:',\n", + " '- dp[i][bit | D[i]] = max(dp[i][bit | D[i]], dp[i - 1][bit] + L[i])',\n", + " '- dp[i][bit] = max(dp[i][bit], dp[i - 1][bit])',\n", + " '- dp[i][D[i]] = max(dp[i][D[i]], L[i])',\n", + " '- ans = max(max(dp[i].values()) for i in range(n))',\n", + " '- print(ans)',\n", + " '+ for bit in list(dp.keys()):',\n", + " '+ if bit & T[i] == 0:',\n", + " '+ dp[bit | T[i]] = max(dp[bit | T[i]], dp[bit] + L[i])',\n", + " '+ dp[T[i]] = max(dp[T[i]], L[i])',\n", + " '+ print(max(dp.values()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.0352676418,\n", + " 'measured_runtime_v1': 0.6319530358,\n", + " 'runtime_lift': 1.6382034472,\n", + " 'key': ['s057521298', 's672157071']},\n", + " {'user_id': 'u753803401',\n", + " 'problem_id': 'p03078',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's362357786',\n", + " 'submission_id_v1': 's175109634',\n", + " 'cpu_time_v0': 451,\n", + " 'cpu_time_v1': 323,\n", + " 'memory_v0': 62572,\n", + " 'memory_v1': 53208,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 28.38,\n", + " 'input': \"def slove():\\n\\n import sys\\n\\n import heapq\\n\\n import collections\\n\\n input = sys.stdin.readline\\n\\n x, y, z, k = list(map(int, input().rstrip('\\\\n').split()))\\n\\n a = list(map(int, input().rstrip('\\\\n').split()))\\n\\n a.sort(reverse=True)\\n\\n b = list(map(int, input().rstrip('\\\\n').split()))\\n\\n b.sort(reverse=True)\\n\\n c = list(map(int, input().rstrip('\\\\n').split()))\\n\\n c.sort(reverse=True)\\n\\n q = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]\\n\\n heapq.heapify(q)\\n\\n fq = collections.defaultdict(list)\\n\\n fq[(-(a[0] + b[0] + c[0]), 0, 0, 0), 1] = 1\\n\\n t = 0\\n\\n for _ in range(k):\\n\\n if len(q) != 0:\\n\\n p = heapq.heappop(q)\\n\\n t = p[0]\\n\\n aq = p[1]\\n\\n bq = p[2]\\n\\n cq = p[3]\\n\\n if aq + 1 < len(a):\\n\\n if (-(a[aq+1] + b[bq] + c[cq]), aq+1, bq, cq) not in fq:\\n\\n heapq.heappush(q, [-(a[aq+1] + b[bq] + c[cq]), aq+1, bq, cq])\\n\\n fq[(-(a[aq+1] + b[bq] + c[cq]), aq+1, bq, cq)] = 1\\n\\n if bq + 1 < len(b):\\n\\n if (-(a[aq] + b[bq+1] + c[cq]), aq, bq+1, cq) not in fq:\\n\\n heapq.heappush(q, [-(a[aq] + b[bq+1] + c[cq]), aq, bq+1, cq])\\n\\n fq[(-(a[aq] + b[bq+1] + c[cq]), aq, bq+1, cq)] = 1\\n\\n if cq + 1 < len(c):\\n\\n if (-(a[aq] + b[bq] + c[cq+1]), aq, bq, cq+1) not in fq:\\n\\n heapq.heappush(q, [-(a[aq] + b[bq] + c[cq+1]), aq, bq, cq+1])\\n\\n fq[(-(a[aq] + b[bq] + c[cq+1]), aq, bq, cq+1)] = 1\\n\\n print((-t))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n slove()\\n\",\n", + " 'target': \"import sys\\n\\nimport collections\\n\\nimport heapq\\n\\n\\n\\n\\n\\ndef solve():\\n\\n input = sys.stdin.readline\\n\\n mod = 10 ** 9 + 7\\n\\n x, y, z, k = list(map(int, input().rstrip('\\\\n').split()))\\n\\n a = list(map(int, input().rstrip('\\\\n').split()))\\n\\n b = list(map(int, input().rstrip('\\\\n').split()))\\n\\n c = list(map(int, input().rstrip('\\\\n').split()))\\n\\n a.sort(reverse=True)\\n\\n b.sort(reverse=True)\\n\\n c.sort(reverse=True)\\n\\n ql = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]\\n\\n heapq.heapify(ql)\\n\\n fq = collections.defaultdict(int)\\n\\n fq[0, 0, 0]\\n\\n for i in range(k):\\n\\n s, ap, bp, cp = heapq.heappop(ql)\\n\\n for app, bpp, cpp in ([[ap+1, bp, cp], [ap, bp+1, cp], [ap, bp, cp+1]]):\\n\\n if app < x and bpp < y and cpp < z:\\n\\n if (app, bpp, cpp) not in fq:\\n\\n heapq.heappush(ql, [-(a[app] + b[bpp] + c[cpp]), app, bpp, cpp])\\n\\n fq[app, bpp, cpp]\\n\\n print((-s))\\n\\n\\n\\n\\n\\nif __name__ == '__main__':\\n\\n solve()\\n\",\n", + " 'code_v0_loc': 41,\n", + " 'code_v1_loc': 31,\n", + " 'code_v0_num_chars': 1596,\n", + " 'code_v1_num_chars': 979,\n", + " 'code_v0_no_empty_lines': 'def slove():\\n import sys\\n import heapq\\n import collections\\n\\n input = sys.stdin.readline\\n x, y, z, k = list(map(int, input().rstrip(\"\\\\n\").split()))\\n a = list(map(int, input().rstrip(\"\\\\n\").split()))\\n a.sort(reverse=True)\\n b = list(map(int, input().rstrip(\"\\\\n\").split()))\\n b.sort(reverse=True)\\n c = list(map(int, input().rstrip(\"\\\\n\").split()))\\n c.sort(reverse=True)\\n q = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]\\n heapq.heapify(q)\\n fq = collections.defaultdict(list)\\n fq[(-(a[0] + b[0] + c[0]), 0, 0, 0), 1] = 1\\n t = 0\\n for _ in range(k):\\n if len(q) != 0:\\n p = heapq.heappop(q)\\n t = p[0]\\n aq = p[1]\\n bq = p[2]\\n cq = p[3]\\n if aq + 1 < len(a):\\n if (-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq) not in fq:\\n heapq.heappush(q, [-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq])\\n fq[(-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq)] = 1\\n if bq + 1 < len(b):\\n if (-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq) not in fq:\\n heapq.heappush(q, [-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq])\\n fq[(-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq)] = 1\\n if cq + 1 < len(c):\\n if (-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1) not in fq:\\n heapq.heappush(q, [-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1])\\n fq[(-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1)] = 1\\n print((-t))\\n\\n\\nif __name__ == \"__main__\":\\n slove()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nimport collections\\nimport heapq\\n\\n\\ndef solve():\\n input = sys.stdin.readline\\n mod = 10**9 + 7\\n x, y, z, k = list(map(int, input().rstrip(\"\\\\n\").split()))\\n a = list(map(int, input().rstrip(\"\\\\n\").split()))\\n b = list(map(int, input().rstrip(\"\\\\n\").split()))\\n c = list(map(int, input().rstrip(\"\\\\n\").split()))\\n a.sort(reverse=True)\\n b.sort(reverse=True)\\n c.sort(reverse=True)\\n ql = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]\\n heapq.heapify(ql)\\n fq = collections.defaultdict(int)\\n fq[0, 0, 0]\\n for i in range(k):\\n s, ap, bp, cp = heapq.heappop(ql)\\n for app, bpp, cpp in [[ap + 1, bp, cp], [ap, bp + 1, cp], [ap, bp, cp + 1]]:\\n if app < x and bpp < y and cpp < z:\\n if (app, bpp, cpp) not in fq:\\n heapq.heappush(ql, [-(a[app] + b[bpp] + c[cpp]), app, bpp, cpp])\\n fq[app, bpp, cpp]\\n print((-s))\\n\\n\\nif __name__ == \"__main__\":\\n solve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 24.3902439024,\n", + " 'diff': ['-def slove():',\n", + " '- import sys',\n", + " '- import heapq',\n", + " '- import collections',\n", + " '+import sys',\n", + " '+import collections',\n", + " '+import heapq',\n", + " '+',\n", + " '+def solve():',\n", + " '+ mod = 10**9 + 7',\n", + " '+ b = list(map(int, input().rstrip(\"\\\\n\").split()))',\n", + " '+ c = list(map(int, input().rstrip(\"\\\\n\").split()))',\n", + " '- b = list(map(int, input().rstrip(\"\\\\n\").split()))',\n", + " '- c = list(map(int, input().rstrip(\"\\\\n\").split()))',\n", + " '- q = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]',\n", + " '- heapq.heapify(q)',\n", + " '- fq = collections.defaultdict(list)',\n", + " '- fq[(-(a[0] + b[0] + c[0]), 0, 0, 0), 1] = 1',\n", + " '- t = 0',\n", + " '- for _ in range(k):',\n", + " '- if len(q) != 0:',\n", + " '- p = heapq.heappop(q)',\n", + " '- t = p[0]',\n", + " '- aq = p[1]',\n", + " '- bq = p[2]',\n", + " '- cq = p[3]',\n", + " '- if aq + 1 < len(a):',\n", + " '- if (-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq) not in fq:',\n", + " '- heapq.heappush(q, [-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq])',\n", + " '- fq[(-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq)] = 1',\n", + " '- if bq + 1 < len(b):',\n", + " '- if (-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq) not in fq:',\n", + " '- heapq.heappush(q, [-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq])',\n", + " '- fq[(-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq)] = 1',\n", + " '- if cq + 1 < len(c):',\n", + " '- if (-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1) not in fq:',\n", + " '- heapq.heappush(q, [-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1])',\n", + " '- fq[(-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1)] = 1',\n", + " '- print((-t))',\n", + " '+ ql = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]',\n", + " '+ heapq.heapify(ql)',\n", + " '+ fq = collections.defaultdict(int)',\n", + " '+ fq[0, 0, 0]',\n", + " '+ for i in range(k):',\n", + " '+ s, ap, bp, cp = heapq.heappop(ql)',\n", + " '+ for app, bpp, cpp in [[ap + 1, bp, cp], [ap, bp + 1, cp], [ap, bp, cp + 1]]:',\n", + " '+ if app < x and bpp < y and cpp < z:',\n", + " '+ if (app, bpp, cpp) not in fq:',\n", + " '+ heapq.heappush(ql, [-(a[app] + b[bpp] + c[cpp]), app, bpp, cpp])',\n", + " '+ fq[app, bpp, cpp]',\n", + " '+ print((-s))',\n", + " '- slove()',\n", + " '+ solve()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3093440776,\n", + " 'measured_runtime_v1': 0.1565137908,\n", + " 'runtime_lift': 1.9764653063,\n", + " 'key': ['s362357786', 's175109634']},\n", + " {'user_id': 'u545368057',\n", + " 'problem_id': 'p02537',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's767194684',\n", + " 'submission_id_v1': 's838681052',\n", + " 'cpu_time_v0': 1543,\n", + " 'cpu_time_v1': 497,\n", + " 'memory_v0': 111052,\n", + " 'memory_v1': 90604,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 67.79,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nn,k = list(map(int, input().split()))\\n\\nAs = [int(eval(input())) for i in range(n)]\\n\\n\\n\\n# N: 処理する区間の長さ\\n\\n\\n\\nINF = 0\\n\\n\\n\\nmx = 300001\\n\\nLV = (mx-1).bit_length()\\n\\nN0 = 2**LV\\n\\ndata = [INF]*(2*N0)\\n\\nlazy = [None]*(2*N0)\\n\\n\\n\\n# 伝搬対象の区間を求める\\n\\ndef gindex(l, r):\\n\\n L = (l + N0) >> 1; R = (r + N0) >> 1\\n\\n lc = 0 if l & 1 else (L & -L).bit_length()\\n\\n rc = 0 if r & 1 else (R & -R).bit_length()\\n\\n for i in range(LV):\\n\\n if rc <= i:\\n\\n yield R\\n\\n if L < R and lc <= i:\\n\\n yield L\\n\\n L >>= 1; R >>= 1\\n\\n\\n\\n# 遅延伝搬処理\\n\\ndef propagates(*ids):\\n\\n for i in reversed(ids):\\n\\n v = lazy[i-1]\\n\\n if v is None:\\n\\n continue\\n\\n lazy[2*i-1] = data[2*i-1] = lazy[2*i] = data[2*i] = v\\n\\n lazy[i-1] = None\\n\\n\\n\\n# 区間[l, r)をxで更新\\n\\ndef update(l, r, x):\\n\\n *ids, = gindex(l, r)\\n\\n propagates(*ids)\\n\\n\\n\\n L = N0 + l; R = N0 + r\\n\\n while L < R:\\n\\n if R & 1:\\n\\n R -= 1\\n\\n lazy[R-1] = data[R-1] = x\\n\\n if L & 1:\\n\\n lazy[L-1] = data[L-1] = x\\n\\n L += 1\\n\\n L >>= 1; R >>= 1\\n\\n for i in ids:\\n\\n data[i-1] = max(data[2*i-1], data[2*i])\\n\\n\\n\\n# 区間[l, r)内の最小値を求める\\n\\ndef query(l, r):\\n\\n propagates(*gindex(l, r))\\n\\n L = N0 + l; R = N0 + r\\n\\n\\n\\n s = INF\\n\\n while L < R:\\n\\n if R & 1:\\n\\n R -= 1\\n\\n s = max(s, data[R-1])\\n\\n if L & 1:\\n\\n s = max(s, data[L-1])\\n\\n L += 1\\n\\n L >>= 1; R >>= 1\\n\\n return s\\n\\n\\n\\nans = 0\\n\\nupdate(As[0],As[0]+1,1)\\n\\nfor i, a in enumerate(As[1:]):\\n\\n l = max(0,a-k)\\n\\n r = min(mx,a+k)\\n\\n upd = query(l,r+1)\\n\\n if upd == -1:continue\\n\\n # print(\"i\",i,\"a\",a,\"upd\",upd,\"l\",l,\"r\",r)\\n\\n update(a, a+1, upd+1)\\n\\n ans = max(ans, upd+1)\\n\\nprint(ans)\\n\\n\\n',\n", + " 'target': '# セグメント木\\n\\n# segment tree\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nclass segmented_tree:\\n\\n X_unit = 0\\n\\n X_f = lambda self, a, b: max(a,b)\\n\\n def __init__(self, N):\\n\\n self.N = N\\n\\n self.X = [self.X_unit] * (2*N)\\n\\n \\n\\n def build(self, seq):\\n\\n for i, x in enumerate(seq, self.N):\\n\\n self.X[i] = x \\n\\n # 後ろから入れていく\\n\\n for i in range(self.N-1, 0, -1):\\n\\n self.X[i] = self.X_f(self.X[i<<1], self.X[i<<1|1])\\n\\n\\n\\n # 1点更新\\n\\n def set_val(self, i, x):\\n\\n i += self.N\\n\\n self.X[i] = x\\n\\n while i > 1:\\n\\n i >>= 1\\n\\n self.X[i] = self.X_f(self.X[i<<1],self.X[i<<1|1])\\n\\n \\n\\n # 区間取得\\n\\n def fold(self, l, r):\\n\\n l += self.N\\n\\n r += self.N\\n\\n vl = self.X_unit\\n\\n vr = self.X_unit\\n\\n # 外から決めていく\\n\\n while l < r:\\n\\n # print(l,r)\\n\\n if l & 1:\\n\\n vl = self.X_f(vl, self.X[l])\\n\\n l += 1\\n\\n if r & 1:\\n\\n r -= 1\\n\\n vr = self.X_f(vr, self.X[r])\\n\\n l >>= 1\\n\\n r >>= 1\\n\\n return self.X_f(vl,vr)\\n\\n\\n\\nn,k = list(map(int, input().split()))\\n\\nAs = [int(eval(input())) for i in range(n)]\\n\\nmx = 300001\\n\\nans = 0\\n\\nsg = segmented_tree(330000)\\n\\n\\n\\nfor a in As:\\n\\n l = max(0,a-k)\\n\\n r = min(mx,a+k)\\n\\n\\n\\n upd = sg.fold(l,r+1)\\n\\n ans = max(ans, upd+1)\\n\\n\\n\\n sg.set_val(a, upd+1)\\n\\nprint(ans)\\n\\n\\n',\n", + " 'code_v0_loc': 82,\n", + " 'code_v1_loc': 62,\n", + " 'code_v0_num_chars': 1762,\n", + " 'code_v1_num_chars': 1410,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nn, k = list(map(int, input().split()))\\nAs = [int(eval(input())) for i in range(n)]\\n# N: 処理する区間の長さ\\nINF = 0\\nmx = 300001\\nLV = (mx - 1).bit_length()\\nN0 = 2**LV\\ndata = [INF] * (2 * N0)\\nlazy = [None] * (2 * N0)\\n# 伝搬対象の区間を求める\\ndef gindex(l, r):\\n L = (l + N0) >> 1\\n R = (r + N0) >> 1\\n lc = 0 if l & 1 else (L & -L).bit_length()\\n rc = 0 if r & 1 else (R & -R).bit_length()\\n for i in range(LV):\\n if rc <= i:\\n yield R\\n if L < R and lc <= i:\\n yield L\\n L >>= 1\\n R >>= 1\\n\\n\\n# 遅延伝搬処理\\ndef propagates(*ids):\\n for i in reversed(ids):\\n v = lazy[i - 1]\\n if v is None:\\n continue\\n lazy[2 * i - 1] = data[2 * i - 1] = lazy[2 * i] = data[2 * i] = v\\n lazy[i - 1] = None\\n\\n\\n# 区間[l, r)をxで更新\\ndef update(l, r, x):\\n (*ids,) = gindex(l, r)\\n propagates(*ids)\\n L = N0 + l\\n R = N0 + r\\n while L < R:\\n if R & 1:\\n R -= 1\\n lazy[R - 1] = data[R - 1] = x\\n if L & 1:\\n lazy[L - 1] = data[L - 1] = x\\n L += 1\\n L >>= 1\\n R >>= 1\\n for i in ids:\\n data[i - 1] = max(data[2 * i - 1], data[2 * i])\\n\\n\\n# 区間[l, r)内の最小値を求める\\ndef query(l, r):\\n propagates(*gindex(l, r))\\n L = N0 + l\\n R = N0 + r\\n s = INF\\n while L < R:\\n if R & 1:\\n R -= 1\\n s = max(s, data[R - 1])\\n if L & 1:\\n s = max(s, data[L - 1])\\n L += 1\\n L >>= 1\\n R >>= 1\\n return s\\n\\n\\nans = 0\\nupdate(As[0], As[0] + 1, 1)\\nfor i, a in enumerate(As[1:]):\\n l = max(0, a - k)\\n r = min(mx, a + k)\\n upd = query(l, r + 1)\\n if upd == -1:\\n continue\\n # print(\"i\",i,\"a\",a,\"upd\",upd,\"l\",l,\"r\",r)\\n update(a, a + 1, upd + 1)\\n ans = max(ans, upd + 1)\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': '# セグメント木\\n# segment tree\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\nclass segmented_tree:\\n X_unit = 0\\n X_f = lambda self, a, b: max(a, b)\\n\\n def __init__(self, N):\\n self.N = N\\n self.X = [self.X_unit] * (2 * N)\\n\\n def build(self, seq):\\n for i, x in enumerate(seq, self.N):\\n self.X[i] = x\\n # 後ろから入れていく\\n for i in range(self.N - 1, 0, -1):\\n self.X[i] = self.X_f(self.X[i << 1], self.X[i << 1 | 1])\\n\\n # 1点更新\\n def set_val(self, i, x):\\n i += self.N\\n self.X[i] = x\\n while i > 1:\\n i >>= 1\\n self.X[i] = self.X_f(self.X[i << 1], self.X[i << 1 | 1])\\n\\n # 区間取得\\n def fold(self, l, r):\\n l += self.N\\n r += self.N\\n vl = self.X_unit\\n vr = self.X_unit\\n # 外から決めていく\\n while l < r:\\n # print(l,r)\\n if l & 1:\\n vl = self.X_f(vl, self.X[l])\\n l += 1\\n if r & 1:\\n r -= 1\\n vr = self.X_f(vr, self.X[r])\\n l >>= 1\\n r >>= 1\\n return self.X_f(vl, vr)\\n\\n\\nn, k = list(map(int, input().split()))\\nAs = [int(eval(input())) for i in range(n)]\\nmx = 300001\\nans = 0\\nsg = segmented_tree(330000)\\nfor a in As:\\n l = max(0, a - k)\\n r = min(mx, a + k)\\n upd = sg.fold(l, r + 1)\\n ans = max(ans, upd + 1)\\n sg.set_val(a, upd + 1)\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 24.3902439024,\n", + " 'diff': ['+# セグメント木',\n", + " '+# segment tree',\n", + " '+',\n", + " '+',\n", + " '+class segmented_tree:',\n", + " '+ X_unit = 0',\n", + " '+ X_f = lambda self, a, b: max(a, b)',\n", + " '+',\n", + " '+ def __init__(self, N):',\n", + " '+ self.N = N',\n", + " '+ self.X = [self.X_unit] * (2 * N)',\n", + " '+',\n", + " '+ def build(self, seq):',\n", + " '+ for i, x in enumerate(seq, self.N):',\n", + " '+ self.X[i] = x',\n", + " '+ # 後ろから入れていく',\n", + " '+ for i in range(self.N - 1, 0, -1):',\n", + " '+ self.X[i] = self.X_f(self.X[i << 1], self.X[i << 1 | 1])',\n", + " '+',\n", + " '+ # 1点更新',\n", + " '+ def set_val(self, i, x):',\n", + " '+ i += self.N',\n", + " '+ self.X[i] = x',\n", + " '+ while i > 1:',\n", + " '+ i >>= 1',\n", + " '+ self.X[i] = self.X_f(self.X[i << 1], self.X[i << 1 | 1])',\n", + " '+',\n", + " '+ # 区間取得',\n", + " '+ def fold(self, l, r):',\n", + " '+ l += self.N',\n", + " '+ r += self.N',\n", + " '+ vl = self.X_unit',\n", + " '+ vr = self.X_unit',\n", + " '+ # 外から決めていく',\n", + " '+ while l < r:',\n", + " '+ # print(l,r)',\n", + " '+ if l & 1:',\n", + " '+ vl = self.X_f(vl, self.X[l])',\n", + " '+ l += 1',\n", + " '+ if r & 1:',\n", + " '+ r -= 1',\n", + " '+ vr = self.X_f(vr, self.X[r])',\n", + " '+ l >>= 1',\n", + " '+ r >>= 1',\n", + " '+ return self.X_f(vl, vr)',\n", + " '+',\n", + " '+',\n", + " '-# N: 処理する区間の長さ',\n", + " '-INF = 0',\n", + " '-LV = (mx - 1).bit_length()',\n", + " '-N0 = 2**LV',\n", + " '-data = [INF] * (2 * N0)',\n", + " '-lazy = [None] * (2 * N0)',\n", + " '-# 伝搬対象の区間を求める',\n", + " '-def gindex(l, r):',\n", + " '- L = (l + N0) >> 1',\n", + " '- R = (r + N0) >> 1',\n", + " '- lc = 0 if l & 1 else (L & -L).bit_length()',\n", + " '- rc = 0 if r & 1 else (R & -R).bit_length()',\n", + " '- for i in range(LV):',\n", + " '- if rc <= i:',\n", + " '- yield R',\n", + " '- if L < R and lc <= i:',\n", + " '- yield L',\n", + " '- L >>= 1',\n", + " '- R >>= 1',\n", + " '-',\n", + " '-',\n", + " '-# 遅延伝搬処理',\n", + " '-def propagates(*ids):',\n", + " '- for i in reversed(ids):',\n", + " '- v = lazy[i - 1]',\n", + " '- if v is None:',\n", + " '- continue',\n", + " '- lazy[2 * i - 1] = data[2 * i - 1] = lazy[2 * i] = data[2 * i] = v',\n", + " '- lazy[i - 1] = None',\n", + " '-',\n", + " '-',\n", + " '-# 区間[l, r)をxで更新',\n", + " '-def update(l, r, x):',\n", + " '- (*ids,) = gindex(l, r)',\n", + " '- propagates(*ids)',\n", + " '- L = N0 + l',\n", + " '- R = N0 + r',\n", + " '- while L < R:',\n", + " '- if R & 1:',\n", + " '- R -= 1',\n", + " '- lazy[R - 1] = data[R - 1] = x',\n", + " '- if L & 1:',\n", + " '- lazy[L - 1] = data[L - 1] = x',\n", + " '- L += 1',\n", + " '- L >>= 1',\n", + " '- R >>= 1',\n", + " '- for i in ids:',\n", + " '- data[i - 1] = max(data[2 * i - 1], data[2 * i])',\n", + " '-',\n", + " '-',\n", + " '-# 区間[l, r)内の最小値を求める',\n", + " '-def query(l, r):',\n", + " '- propagates(*gindex(l, r))',\n", + " '- L = N0 + l',\n", + " '- R = N0 + r',\n", + " '- s = INF',\n", + " '- while L < R:',\n", + " '- if R & 1:',\n", + " '- R -= 1',\n", + " '- s = max(s, data[R - 1])',\n", + " '- if L & 1:',\n", + " '- s = max(s, data[L - 1])',\n", + " '- L += 1',\n", + " '- L >>= 1',\n", + " '- R >>= 1',\n", + " '- return s',\n", + " '-',\n", + " '-',\n", + " '-update(As[0], As[0] + 1, 1)',\n", + " '-for i, a in enumerate(As[1:]):',\n", + " '+sg = segmented_tree(330000)',\n", + " '+for a in As:',\n", + " '- upd = query(l, r + 1)',\n", + " '- if upd == -1:',\n", + " '- continue',\n", + " '- # print(\"i\",i,\"a\",a,\"upd\",upd,\"l\",l,\"r\",r)',\n", + " '- update(a, a + 1, upd + 1)',\n", + " '+ upd = sg.fold(l, r + 1)',\n", + " '+ sg.set_val(a, upd + 1)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.5116031129,\n", + " 'measured_runtime_v1': 0.2937918727,\n", + " 'runtime_lift': 1.7413793927,\n", + " 'key': ['s767194684', 's838681052']},\n", + " {'user_id': 'u810356688',\n", + " 'problem_id': 'p02690',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's967484686',\n", + " 'submission_id_v1': 's277151448',\n", + " 'cpu_time_v0': 118,\n", + " 'cpu_time_v1': 28,\n", + " 'memory_v0': 9176,\n", + " 'memory_v1': 9040,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 76.27,\n", + " 'input': \"import sys\\n\\ndef input(): return sys.stdin.readline().rstrip()\\n\\ndef main():\\n\\n x=int(eval(input()))\\n\\n for i in range(-300,300):\\n\\n for j in range(-300,300):\\n\\n if i**5-j**5==x:\\n\\n print((i,j))\\n\\n sys.exit()\\n\\n\\n\\nif __name__=='__main__':\\n\\n main()\",\n", + " 'target': \"import sys\\n\\ndef input(): return sys.stdin.readline().rstrip()\\n\\ndef main():\\n\\n x=int(eval(input()))\\n\\n for a in range(-118,120):\\n\\n for diff in range(238):\\n\\n if a**5-(a-diff)**5>10**9:\\n\\n break\\n\\n if a**5-(a-diff)**5==x:\\n\\n print((a,a-diff))\\n\\n sys.exit()\\n\\n\\n\\nif __name__=='__main__':\\n\\n main()\",\n", + " 'code_v0_loc': 12,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 286,\n", + " 'code_v1_num_chars': 359,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\n\\ndef input():\\n return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n x = int(eval(input()))\\n for i in range(-300, 300):\\n for j in range(-300, 300):\\n if i**5 - j**5 == x:\\n print((i, j))\\n sys.exit()\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef input():\\n return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n x = int(eval(input()))\\n for a in range(-118, 120):\\n for diff in range(238):\\n if a**5 - (a - diff) ** 5 > 10**9:\\n break\\n if a**5 - (a - diff) ** 5 == x:\\n print((a, a - diff))\\n sys.exit()\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['- for i in range(-300, 300):',\n", + " '- for j in range(-300, 300):',\n", + " '- if i**5 - j**5 == x:',\n", + " '- print((i, j))',\n", + " '+ for a in range(-118, 120):',\n", + " '+ for diff in range(238):',\n", + " '+ if a**5 - (a - diff) ** 5 > 10**9:',\n", + " '+ break',\n", + " '+ if a**5 - (a - diff) ** 5 == x:',\n", + " '+ print((a, a - diff))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.0260130386,\n", + " 'measured_runtime_v1': 0.2234877924,\n", + " 'runtime_lift': 4.5909131207,\n", + " 'key': ['s967484686', 's277151448']},\n", + " {'user_id': 'u254871849',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's625520179',\n", + " 'submission_id_v1': 's190948033',\n", + " 'cpu_time_v0': 151,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 12488,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 88.74,\n", + " 'input': \"import sys\\n\\nimport numpy as np \\n\\n\\n\\nn, l = list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\ndef main():\\n\\n f = l + np.arange(1, n+1) - 1\\n\\n s = f.sum()\\n\\n a = np.absolute(f)\\n\\n mi = np.amin(a)\\n\\n i = np.argwhere(a == mi)[0, 0]\\n\\n return s - f[i]\\n\\n\\n\\nif __name__ == '__main__':\\n\\n ans = main()\\n\\n print(ans)\",\n", + " 'target': \"import sys\\n\\n\\n\\nn, l = list(map(int, sys.stdin.readline().split()))\\n\\n\\n\\ndef main():\\n\\n s = (l - 1) * n + (1 + n) * n // 2\\n\\n res = []\\n\\n for i in range(1, n+1):\\n\\n f = l + i - 1\\n\\n res.append((abs(f), s - f))\\n\\n \\n\\n res.sort()\\n\\n return res[0][1]\\n\\n\\n\\nif __name__=='__main__':\\n\\n ans = main()\\n\\n print(ans)\",\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 313,\n", + " 'code_v1_num_chars': 323,\n", + " 'code_v0_no_empty_lines': 'import sys\\nimport numpy as np\\n\\nn, l = list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef main():\\n f = l + np.arange(1, n + 1) - 1\\n s = f.sum()\\n a = np.absolute(f)\\n mi = np.amin(a)\\n i = np.argwhere(a == mi)[0, 0]\\n return s - f[i]\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nn, l = list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef main():\\n s = (l - 1) * n + (1 + n) * n // 2\\n res = []\\n for i in range(1, n + 1):\\n f = l + i - 1\\n res.append((abs(f), s - f))\\n res.sort()\\n return res[0][1]\\n\\n\\nif __name__ == \"__main__\":\\n ans = main()\\n print(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.8823529412,\n", + " 'diff': ['-import numpy as np',\n", + " '- f = l + np.arange(1, n + 1) - 1',\n", + " '- s = f.sum()',\n", + " '- a = np.absolute(f)',\n", + " '- mi = np.amin(a)',\n", + " '- i = np.argwhere(a == mi)[0, 0]',\n", + " '- return s - f[i]',\n", + " '+ s = (l - 1) * n + (1 + n) * n // 2',\n", + " '+ res = []',\n", + " '+ for i in range(1, n + 1):',\n", + " '+ f = l + i - 1',\n", + " '+ res.append((abs(f), s - f))',\n", + " '+ res.sort()',\n", + " '+ return res[0][1]'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3280655489,\n", + " 'measured_runtime_v1': 0.2091949449,\n", + " 'runtime_lift': 6.3484590879,\n", + " 'key': ['s625520179', 's190948033']},\n", + " {'user_id': 'u404676457',\n", + " 'problem_id': 'p03287',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's015457447',\n", + " 'submission_id_v1': 's379753461',\n", + " 'cpu_time_v0': 295,\n", + " 'cpu_time_v1': 119,\n", + " 'memory_v0': 23108,\n", + " 'memory_v1': 14224,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 59.66,\n", + " 'input': 'import numpy as np\\n\\n(n, m) = list(map(int, input().split()))\\n\\na = np.array(list(map(int, input().split()))).astype(\"int64\") \\n\\na = np.cumsum(a)\\n\\na %= m\\n\\ncount = np.sum(a == 0)\\n\\na.sort()\\n\\ntc = 1\\n\\nfor i in range(1, n):\\n\\n if a[i - 1] == a[i]:\\n\\n tc += 1\\n\\n else:\\n\\n count += tc * (tc - 1) // 2\\n\\n tc = 1\\n\\nelse:\\n\\n count += tc * (tc - 1) // 2\\n\\nprint(count)',\n", + " 'target': '(n, m) = list(map(int, input().split()))\\n\\na = list(map(int, input().split()))\\n\\nunique_a = {a[0] % m: 1}\\n\\nfor i in range(1, n):\\n\\n a[i] += a[i - 1]\\n\\n a[i] %= m\\n\\n if a[i] in unique_a:\\n\\n unique_a[a[i]] += 1\\n\\n else:\\n\\n unique_a[a[i]] = 1\\n\\ncount = 0\\n\\nif 0 in unique_a:\\n\\n count += unique_a[0]\\n\\nfor k in unique_a:\\n\\n count += unique_a[k] * (unique_a[k] - 1) // 2\\n\\nprint(count)',\n", + " 'code_v0_loc': 17,\n", + " 'code_v1_loc': 16,\n", + " 'code_v0_num_chars': 376,\n", + " 'code_v1_num_chars': 398,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\n(n, m) = list(map(int, input().split()))\\na = np.array(list(map(int, input().split()))).astype(\"int64\")\\na = np.cumsum(a)\\na %= m\\ncount = np.sum(a == 0)\\na.sort()\\ntc = 1\\nfor i in range(1, n):\\n if a[i - 1] == a[i]:\\n tc += 1\\n else:\\n count += tc * (tc - 1) // 2\\n tc = 1\\nelse:\\n count += tc * (tc - 1) // 2\\nprint(count)\\n',\n", + " 'code_v1_no_empty_lines': '(n, m) = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nunique_a = {a[0] % m: 1}\\nfor i in range(1, n):\\n a[i] += a[i - 1]\\n a[i] %= m\\n if a[i] in unique_a:\\n unique_a[a[i]] += 1\\n else:\\n unique_a[a[i]] = 1\\ncount = 0\\nif 0 in unique_a:\\n count += unique_a[0]\\nfor k in unique_a:\\n count += unique_a[k] * (unique_a[k] - 1) // 2\\nprint(count)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 5.8823529412,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-a = np.array(list(map(int, input().split()))).astype(\"int64\")',\n", + " '-a = np.cumsum(a)',\n", + " '-a %= m',\n", + " '-count = np.sum(a == 0)',\n", + " '-a.sort()',\n", + " '-tc = 1',\n", + " '+a = list(map(int, input().split()))',\n", + " '+unique_a = {a[0] % m: 1}',\n", + " '- if a[i - 1] == a[i]:',\n", + " '- tc += 1',\n", + " '+ a[i] += a[i - 1]',\n", + " '+ a[i] %= m',\n", + " '+ if a[i] in unique_a:',\n", + " '+ unique_a[a[i]] += 1',\n", + " '- count += tc * (tc - 1) // 2',\n", + " '- tc = 1',\n", + " '-else:',\n", + " '- count += tc * (tc - 1) // 2',\n", + " '+ unique_a[a[i]] = 1',\n", + " '+count = 0',\n", + " '+if 0 in unique_a:',\n", + " '+ count += unique_a[0]',\n", + " '+for k in unique_a:',\n", + " '+ count += unique_a[k] * (unique_a[k] - 1) // 2'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.3542102392,\n", + " 'measured_runtime_v1': 0.1979701376,\n", + " 'runtime_lift': 6.8404773343,\n", + " 'key': ['s015457447', 's379753461']},\n", + " {'user_id': 'u497046426',\n", + " 'problem_id': 'p03568',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's711599117',\n", + " 'submission_id_v1': 's424536945',\n", + " 'cpu_time_v0': 181,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 3572,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 90.61,\n", + " 'input': 'from functools import reduce\\n\\nfrom itertools import product\\n\\n\\n\\nN = int(eval(input()))\\n\\n*A, = list(map(int, input().split()))\\n\\nans = 0\\n\\nfor t in product([-1, 0, 1], repeat=N):\\n\\n prod = reduce(lambda x, y: x*y, [a + t[i] for i, a in enumerate(A)])\\n\\n if prod % 2 == 0: ans += 1\\n\\nprint(ans)',\n", + " 'target': 'N = int(eval(input()))\\n\\n*A, = list(map(int, input().split()))\\n\\nevens = 0\\n\\nfor a in A:\\n\\n if a % 2 == 0: evens += 1\\n\\nans = 3**N - 2**evens\\n\\nprint(ans)',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 7,\n", + " 'code_v0_num_chars': 280,\n", + " 'code_v1_num_chars': 139,\n", + " 'code_v0_no_empty_lines': 'from functools import reduce\\nfrom itertools import product\\n\\nN = int(eval(input()))\\n(*A,) = list(map(int, input().split()))\\nans = 0\\nfor t in product([-1, 0, 1], repeat=N):\\n prod = reduce(lambda x, y: x * y, [a + t[i] for i, a in enumerate(A)])\\n if prod % 2 == 0:\\n ans += 1\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\n(*A,) = list(map(int, input().split()))\\nevens = 0\\nfor a in A:\\n if a % 2 == 0:\\n evens += 1\\nans = 3**N - 2**evens\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.0,\n", + " 'diff': ['-from functools import reduce',\n", + " '-from itertools import product',\n", + " '-',\n", + " '-ans = 0',\n", + " '-for t in product([-1, 0, 1], repeat=N):',\n", + " '- prod = reduce(lambda x, y: x * y, [a + t[i] for i, a in enumerate(A)])',\n", + " '- if prod % 2 == 0:',\n", + " '- ans += 1',\n", + " '+evens = 0',\n", + " '+for a in A:',\n", + " '+ if a % 2 == 0:',\n", + " '+ evens += 1',\n", + " '+ans = 3**N - 2**evens'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6547077734,\n", + " 'measured_runtime_v1': 0.2760411811,\n", + " 'runtime_lift': 2.3717757287,\n", + " 'key': ['s711599117', 's424536945']},\n", + " {'user_id': 'u531220228',\n", + " 'problem_id': 'p02994',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's833148158',\n", + " 'submission_id_v1': 's512634929',\n", + " 'cpu_time_v0': 155,\n", + " 'cpu_time_v1': 19,\n", + " 'memory_v0': 12404,\n", + " 'memory_v1': 3060,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 87.74,\n", + " 'input': 'import numpy as np\\n\\nN,L = list(map(int, input().split()))\\n\\ntaste = np.array([L+i-1 for i in range(1,N+1)])\\n\\nif taste[-1] < 0:\\n\\n print((sum(taste) + min(np.abs(taste))))\\n\\nelse:\\n\\n print((sum(taste) - min(np.abs(taste))))',\n", + " 'target': 'N,L = list(map(int, input().split()))\\n\\ntaste = [L+i-1 for i in range(1,N+1)]\\n\\nif taste[-1] < 0:\\n\\n print((sum(taste) + min([abs(x) for x in taste])))\\n\\nelse:\\n\\n print((sum(taste) - min([abs(x) for x in taste])))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 6,\n", + " 'code_v0_num_chars': 210,\n", + " 'code_v1_num_chars': 200,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nN, L = list(map(int, input().split()))\\ntaste = np.array([L + i - 1 for i in range(1, N + 1)])\\nif taste[-1] < 0:\\n print((sum(taste) + min(np.abs(taste))))\\nelse:\\n print((sum(taste) - min(np.abs(taste))))\\n',\n", + " 'code_v1_no_empty_lines': 'N, L = list(map(int, input().split()))\\ntaste = [L + i - 1 for i in range(1, N + 1)]\\nif taste[-1] < 0:\\n print((sum(taste) + min([abs(x) for x in taste])))\\nelse:\\n print((sum(taste) - min([abs(x) for x in taste])))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 14.2857142857,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-taste = np.array([L + i - 1 for i in range(1, N + 1)])',\n", + " '+taste = [L + i - 1 for i in range(1, N + 1)]',\n", + " '- print((sum(taste) + min(np.abs(taste))))',\n", + " '+ print((sum(taste) + min([abs(x) for x in taste])))',\n", + " '- print((sum(taste) - min(np.abs(taste))))',\n", + " '+ print((sum(taste) - min([abs(x) for x in taste])))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.945645529,\n", + " 'measured_runtime_v1': 0.3334629779,\n", + " 'runtime_lift': 5.8346672884,\n", + " 'key': ['s833148158', 's512634929']},\n", + " {'user_id': 'u624689667',\n", + " 'problem_id': 'p03835',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's909731438',\n", + " 'submission_id_v1': 's120194088',\n", + " 'cpu_time_v0': 274,\n", + " 'cpu_time_v1': 201,\n", + " 'memory_v0': 40684,\n", + " 'memory_v1': 41308,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 26.64,\n", + " 'input': 'K, S = [int(i) for i in input().split()]\\n\\n\\n\\nc = 0\\n\\nfor X in range(K + 1):\\n\\n for Y in range(K + 1):\\n\\n Z = S - X - Y\\n\\n if 0 <= Z <= K:\\n\\n c += 1\\n\\n\\n\\nprint(c)',\n", + " 'target': 'K, S = [int(i) for i in input().split()]\\n\\n\\n\\nans = 0\\n\\n# X <= Y <= Zとしても一般性を失わない\\n\\nfor x in range(K + 1):\\n\\n for y in range(x, K + 1):\\n\\n z = S - x - y\\n\\n if z < y:\\n\\n break\\n\\n if z <= K:\\n\\n if x == y == z:\\n\\n ans += 1\\n\\n elif x == y or y == z or z == x:\\n\\n ans += 3\\n\\n else:\\n\\n ans += 6\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 10,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 181,\n", + " 'code_v1_num_chars': 399,\n", + " 'code_v0_no_empty_lines': 'K, S = [int(i) for i in input().split()]\\nc = 0\\nfor X in range(K + 1):\\n for Y in range(K + 1):\\n Z = S - X - Y\\n if 0 <= Z <= K:\\n c += 1\\nprint(c)\\n',\n", + " 'code_v1_no_empty_lines': 'K, S = [int(i) for i in input().split()]\\nans = 0\\n# X <= Y <= Zとしても一般性を失わない\\nfor x in range(K + 1):\\n for y in range(x, K + 1):\\n z = S - x - y\\n if z < y:\\n break\\n if z <= K:\\n if x == y == z:\\n ans += 1\\n elif x == y or y == z or z == x:\\n ans += 3\\n else:\\n ans += 6\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 41.1764705882,\n", + " 'diff': ['-c = 0',\n", + " '-for X in range(K + 1):',\n", + " '- for Y in range(K + 1):',\n", + " '- Z = S - X - Y',\n", + " '- if 0 <= Z <= K:',\n", + " '- c += 1',\n", + " '-print(c)',\n", + " '+ans = 0',\n", + " '+# X <= Y <= Zとしても一般性を失わない',\n", + " '+for x in range(K + 1):',\n", + " '+ for y in range(x, K + 1):',\n", + " '+ z = S - x - y',\n", + " '+ if z < y:',\n", + " '+ break',\n", + " '+ if z <= K:',\n", + " '+ if x == y == z:',\n", + " '+ ans += 1',\n", + " '+ elif x == y or y == z or z == x:',\n", + " '+ ans += 3',\n", + " '+ else:',\n", + " '+ ans += 6',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2592413317,\n", + " 'measured_runtime_v1': 0.105755719,\n", + " 'runtime_lift': 2.4513221044,\n", + " 'key': ['s909731438', 's120194088']},\n", + " {'user_id': 'u654470292',\n", + " 'problem_id': 'p03828',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's594973511',\n", + " 'submission_id_v1': 's914422541',\n", + " 'cpu_time_v0': 386,\n", + " 'cpu_time_v1': 305,\n", + " 'memory_v0': 54360,\n", + " 'memory_v1': 67304,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.98,\n", + " 'input': 'import math\\n\\nn=int(eval(input()))\\n\\nwaru=10**9+7\\n\\n\\n\\nli=[]\\n\\nli2=[]\\n\\n\\n\\nfor i in range(2,n+1):\\n\\n tmp=math.factorial(n)\\n\\n flag=1\\n\\n for j in range(len(li)):\\n\\n if i%li[j]==0:\\n\\n flag=0\\n\\n break\\n\\n if flag==1:\\n\\n li.append(i)\\n\\n li2.append(0)\\n\\n while tmp%i==0:\\n\\n li2[len(li)-1]+=1\\n\\n tmp=tmp//i\\n\\nans=1\\n\\n# print(li)\\n\\n# print(li2)\\n\\nfor i in range(len(li2)):\\n\\n ans*=li2[i]+1\\n\\nprint((ans%waru))',\n", + " 'target': \"import sys\\n\\nfrom collections import *\\n\\nimport heapq\\n\\nimport math\\n\\nimport bisect\\n\\nfrom itertools import permutations,accumulate,combinations,product\\n\\nfrom fractions import gcd\\n\\ndef input():\\n\\n return sys.stdin.readline()[:-1]\\n\\ndef ruiseki(lst):\\n\\n return [0]+list(accumulate(lst))\\n\\nmod=pow(10,9)+7\\n\\nal=[chr(ord('a') + i) for i in range(26)]\\n\\n\\n\\ndef factorization(n):\\n\\n arr = []\\n\\n temp = n\\n\\n for i in range(2, int(-(-n**0.5//1))+1):\\n\\n if temp%i==0:\\n\\n cnt=0\\n\\n while temp%i==0:\\n\\n cnt+=1\\n\\n temp //= i\\n\\n arr.append([i, cnt])\\n\\n if temp!=1:\\n\\n arr.append([temp, 1])\\n\\n if arr==[]:\\n\\n arr.append([n, 1])\\n\\n return arr\\n\\n\\n\\nn=int(eval(input()))\\n\\nif n==1:\\n\\n print((1))\\n\\n exit()\\n\\nd=defaultdict(int)\\n\\nfor i in range(2,n+1):\\n\\n tmp=factorization(i)\\n\\n for j in tmp:\\n\\n yaku,ko=j\\n\\n d[yaku]+=ko\\n\\n# print(d)\\n\\nans=1\\n\\nfor i in list(d.values()):\\n\\n ans*=i+1\\n\\n ans%=mod\\n\\nprint(ans)\",\n", + " 'code_v0_loc': 26,\n", + " 'code_v1_loc': 46,\n", + " 'code_v0_num_chars': 455,\n", + " 'code_v1_num_chars': 973,\n", + " 'code_v0_no_empty_lines': 'import math\\n\\nn = int(eval(input()))\\nwaru = 10**9 + 7\\nli = []\\nli2 = []\\nfor i in range(2, n + 1):\\n tmp = math.factorial(n)\\n flag = 1\\n for j in range(len(li)):\\n if i % li[j] == 0:\\n flag = 0\\n break\\n if flag == 1:\\n li.append(i)\\n li2.append(0)\\n while tmp % i == 0:\\n li2[len(li) - 1] += 1\\n tmp = tmp // i\\nans = 1\\n# print(li)\\n# print(li2)\\nfor i in range(len(li2)):\\n ans *= li2[i] + 1\\nprint((ans % waru))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\nfrom collections import *\\nimport heapq\\nimport math\\nimport bisect\\nfrom itertools import permutations, accumulate, combinations, product\\nfrom fractions import gcd\\n\\n\\ndef input():\\n return sys.stdin.readline()[:-1]\\n\\n\\ndef ruiseki(lst):\\n return [0] + list(accumulate(lst))\\n\\n\\nmod = pow(10, 9) + 7\\nal = [chr(ord(\"a\") + i) for i in range(26)]\\n\\n\\ndef factorization(n):\\n arr = []\\n temp = n\\n for i in range(2, int(-(-(n**0.5) // 1)) + 1):\\n if temp % i == 0:\\n cnt = 0\\n while temp % i == 0:\\n cnt += 1\\n temp //= i\\n arr.append([i, cnt])\\n if temp != 1:\\n arr.append([temp, 1])\\n if arr == []:\\n arr.append([n, 1])\\n return arr\\n\\n\\nn = int(eval(input()))\\nif n == 1:\\n print((1))\\n exit()\\nd = defaultdict(int)\\nfor i in range(2, n + 1):\\n tmp = factorization(i)\\n for j in tmp:\\n yaku, ko = j\\n d[yaku] += ko\\n# print(d)\\nans = 1\\nfor i in list(d.values()):\\n ans *= i + 1\\n ans %= mod\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 43.4782608696,\n", + " 'diff': ['+import sys',\n", + " '+from collections import *',\n", + " '+import heapq',\n", + " '+import bisect',\n", + " '+from itertools import permutations, accumulate, combinations, product',\n", + " '+from fractions import gcd',\n", + " '+',\n", + " '+',\n", + " '+def input():',\n", + " '+ return sys.stdin.readline()[:-1]',\n", + " '+',\n", + " '+',\n", + " '+def ruiseki(lst):',\n", + " '+ return [0] + list(accumulate(lst))',\n", + " '+',\n", + " '+',\n", + " '+mod = pow(10, 9) + 7',\n", + " '+al = [chr(ord(\"a\") + i) for i in range(26)]',\n", + " '+',\n", + " '+',\n", + " '+def factorization(n):',\n", + " '+ arr = []',\n", + " '+ temp = n',\n", + " '+ for i in range(2, int(-(-(n**0.5) // 1)) + 1):',\n", + " '+ if temp % i == 0:',\n", + " '+ cnt = 0',\n", + " '+ while temp % i == 0:',\n", + " '+ cnt += 1',\n", + " '+ temp //= i',\n", + " '+ arr.append([i, cnt])',\n", + " '+ if temp != 1:',\n", + " '+ arr.append([temp, 1])',\n", + " '+ if arr == []:',\n", + " '+ arr.append([n, 1])',\n", + " '+ return arr',\n", + " '+',\n", + " '-waru = 10**9 + 7',\n", + " '-li = []',\n", + " '-li2 = []',\n", + " '+if n == 1:',\n", + " '+ print((1))',\n", + " '+ exit()',\n", + " '+d = defaultdict(int)',\n", + " '- tmp = math.factorial(n)',\n", + " '- flag = 1',\n", + " '- for j in range(len(li)):',\n", + " '- if i % li[j] == 0:',\n", + " '- flag = 0',\n", + " '- break',\n", + " '- if flag == 1:',\n", + " '- li.append(i)',\n", + " '- li2.append(0)',\n", + " '- while tmp % i == 0:',\n", + " '- li2[len(li) - 1] += 1',\n", + " '- tmp = tmp // i',\n", + " '+ tmp = factorization(i)',\n", + " '+ for j in tmp:',\n", + " '+ yaku, ko = j',\n", + " '+ d[yaku] += ko',\n", + " '+# print(d)',\n", + " '-# print(li)',\n", + " '-# print(li2)',\n", + " '-for i in range(len(li2)):',\n", + " '- ans *= li2[i] + 1',\n", + " '-print((ans % waru))',\n", + " '+for i in list(d.values()):',\n", + " '+ ans *= i + 1',\n", + " '+ ans %= mod',\n", + " '+print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4593854201,\n", + " 'measured_runtime_v1': 0.0895126674,\n", + " 'runtime_lift': 5.1320716194,\n", + " 'key': ['s594973511', 's914422541']},\n", + " {'user_id': 'u498487134',\n", + " 'problem_id': 'p03038',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's547925628',\n", + " 'submission_id_v1': 's764313725',\n", + " 'cpu_time_v0': 649,\n", + " 'cpu_time_v1': 471,\n", + " 'memory_v0': 68588,\n", + " 'memory_v1': 102672,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 27.43,\n", + " 'input': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef I(): return int(eval(input()))\\n\\ndef MI(): return list(map(int, input().split()))\\n\\ndef LI(): return list(map(int, input().split()))\\n\\n\\n\\ndef main():\\n\\n mod=10**9+7\\n\\n N,M=MI()\\n\\n A=LI()\\n\\n CB=[[0,0]for _ in range(M)]\\n\\n A.sort()\\n\\n for i in range(M):\\n\\n CB[i][1],CB[i][0]=MI()\\n\\n \\n\\n CB.sort(reverse=True)\\n\\n now=0\\n\\n \\n\\n for i in range(N):\\n\\n if CB[now][1]<=0:\\n\\n now+=1\\n\\n \\n\\n if now>=M:\\n\\n break \\n\\n \\n\\n ch=CB[now][0]\\n\\n if A[i]=c:\\n\\n heapq.heappush(A,a)\\n\\n break\\n\\n else:\\n\\n heapq.heappush(A,c)\\n\\n \\n\\n ans=0\\n\\n for i in range(N):\\n\\n a=heapq.heappop(A)\\n\\n ans+=a\\n\\n \\n\\n print(ans)\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 37,\n", + " 'code_v1_loc': 42,\n", + " 'code_v0_num_chars': 685,\n", + " 'code_v1_num_chars': 804,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef I():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\ndef main():\\n mod = 10**9 + 7\\n N, M = MI()\\n A = LI()\\n CB = [[0, 0] for _ in range(M)]\\n A.sort()\\n for i in range(M):\\n CB[i][1], CB[i][0] = MI()\\n CB.sort(reverse=True)\\n now = 0\\n for i in range(N):\\n if CB[now][1] <= 0:\\n now += 1\\n if now >= M:\\n break\\n ch = CB[now][0]\\n if A[i] < ch:\\n A[i] = ch\\n CB[now][1] -= 1\\n else:\\n break\\n print((sum(A)))\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef I():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\ndef main():\\n mod = 10**9 + 7\\n N, M = MI()\\n A = LI()\\n B = [0] * M\\n C = [0] * M\\n for i in range(M):\\n B[i], C[i] = MI()\\n C, B = list(zip(*sorted(zip(C, B))))\\n B = B[::-1]\\n C = C[::-1]\\n import heapq\\n\\n heapq.heapify(A)\\n for i in range(M):\\n b = B[i]\\n c = C[i]\\n for _ in range(b):\\n a = heapq.heappop(A)\\n if a >= c:\\n heapq.heappush(A, a)\\n break\\n else:\\n heapq.heappush(A, c)\\n ans = 0\\n for i in range(N):\\n a = heapq.heappop(A)\\n ans += a\\n print(ans)\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 11.9047619048,\n", + " 'diff': ['- CB = [[0, 0] for _ in range(M)]',\n", + " '- A.sort()',\n", + " '+ B = [0] * M',\n", + " '+ C = [0] * M',\n", + " '- CB[i][1], CB[i][0] = MI()',\n", + " '- CB.sort(reverse=True)',\n", + " '- now = 0',\n", + " '+ B[i], C[i] = MI()',\n", + " '+ C, B = list(zip(*sorted(zip(C, B))))',\n", + " '+ B = B[::-1]',\n", + " '+ C = C[::-1]',\n", + " '+ import heapq',\n", + " '+',\n", + " '+ heapq.heapify(A)',\n", + " '+ for i in range(M):',\n", + " '+ b = B[i]',\n", + " '+ c = C[i]',\n", + " '+ for _ in range(b):',\n", + " '+ a = heapq.heappop(A)',\n", + " '+ if a >= c:',\n", + " '+ heapq.heappush(A, a)',\n", + " '+ break',\n", + " '+ else:',\n", + " '+ heapq.heappush(A, c)',\n", + " '+ ans = 0',\n", + " '- if CB[now][1] <= 0:',\n", + " '- now += 1',\n", + " '- if now >= M:',\n", + " '- break',\n", + " '- ch = CB[now][0]',\n", + " '- if A[i] < ch:',\n", + " '- A[i] = ch',\n", + " '- CB[now][1] -= 1',\n", + " '- else:',\n", + " '- break',\n", + " '- print((sum(A)))',\n", + " '+ a = heapq.heappop(A)',\n", + " '+ ans += a',\n", + " '+ print(ans)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2322117374,\n", + " 'measured_runtime_v1': 0.1336252203,\n", + " 'runtime_lift': 1.7377837571,\n", + " 'key': ['s547925628', 's764313725']},\n", + " {'user_id': 'u130900604',\n", + " 'problem_id': 'p03796',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's800410916',\n", + " 'submission_id_v1': 's728597484',\n", + " 'cpu_time_v0': 374,\n", + " 'cpu_time_v1': 55,\n", + " 'memory_v0': 13144,\n", + " 'memory_v1': 6884,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 85.29,\n", + " 'input': 'import numpy as np\\n\\nmod=10**9+7\\n\\nd=np.zeros(100100,dtype=np.int64)\\n\\nd[0]=1\\n\\nfor i in range(1,10**5+1):\\n\\n d[i]=d[i-1]*i%mod\\n\\nprint((d[int(eval(input()))]))',\n", + " 'target': 'd,mod=[1]+[0]*100100,10**9+7\\n\\nfor i in range(1,10**5+1):d[i]=d[i-1]*i%mod\\n\\nprint((d[int(eval(input()))]))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 3,\n", + " 'code_v0_num_chars': 147,\n", + " 'code_v1_num_chars': 97,\n", + " 'code_v0_no_empty_lines': 'import numpy as np\\n\\nmod = 10**9 + 7\\nd = np.zeros(100100, dtype=np.int64)\\nd[0] = 1\\nfor i in range(1, 10**5 + 1):\\n d[i] = d[i - 1] * i % mod\\nprint((d[int(eval(input()))]))\\n',\n", + " 'code_v1_no_empty_lines': 'd, mod = [1] + [0] * 100100, 10**9 + 7\\nfor i in range(1, 10**5 + 1):\\n d[i] = d[i - 1] * i % mod\\nprint((d[int(eval(input()))]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 57.1428571429,\n", + " 'diff': ['-import numpy as np',\n", + " '-',\n", + " '-mod = 10**9 + 7',\n", + " '-d = np.zeros(100100, dtype=np.int64)',\n", + " '-d[0] = 1',\n", + " '+d, mod = [1] + [0] * 100100, 10**9 + 7'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.8401680753,\n", + " 'measured_runtime_v1': 0.4502561843,\n", + " 'runtime_lift': 4.086935703,\n", + " 'key': ['s800410916', 's728597484']},\n", + " {'user_id': 'u146816547',\n", + " 'problem_id': 'p00005',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's153581221',\n", + " 'submission_id_v1': 's486237781',\n", + " 'cpu_time_v0': 30,\n", + " 'cpu_time_v1': 10,\n", + " 'memory_v0': 5872,\n", + " 'memory_v1': 6452,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 66.67,\n", + " 'input': \"import fractions\\n\\nwhile True:\\n\\n\\ttry:\\n\\n\\t\\tx,y = list(map(int,input().split()))\\n\\n\\t\\tprint('%d %d' % (fractions.gcd(x,y),x/fractions.gcd(x,y)*y))\\n\\n\\texcept EOFError:\\n\\n\\t\\tbreak\",\n", + " 'target': 'def gcd(x, y):\\n\\n if y == 0:\\n\\n return x\\n\\n else:\\n\\n return gcd(y, x%y)\\n\\n\\n\\n\\n\\ndef lcm(x,y):\\n\\n return x/gcd(x, y)*y\\n\\n\\n\\n\\n\\nwhile True:\\n\\n try:\\n\\n x, y = list(map(int, input().split()))\\n\\n except EOFError:\\n\\n break\\n\\n\\n\\n print(\"%d %d\" % (gcd(x, y), lcm(x, y)))',\n", + " 'code_v0_loc': 7,\n", + " 'code_v1_loc': 18,\n", + " 'code_v0_num_chars': 165,\n", + " 'code_v1_num_chars': 288,\n", + " 'code_v0_no_empty_lines': 'import fractions\\n\\nwhile True:\\n try:\\n x, y = list(map(int, input().split()))\\n print(\"%d %d\" % (fractions.gcd(x, y), x / fractions.gcd(x, y) * y))\\n except EOFError:\\n break\\n',\n", + " 'code_v1_no_empty_lines': 'def gcd(x, y):\\n if y == 0:\\n return x\\n else:\\n return gcd(y, x % y)\\n\\n\\ndef lcm(x, y):\\n return x / gcd(x, y) * y\\n\\n\\nwhile True:\\n try:\\n x, y = list(map(int, input().split()))\\n except EOFError:\\n break\\n print(\"%d %d\" % (gcd(x, y), lcm(x, y)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 61.1111111111,\n", + " 'diff': ['-import fractions',\n", + " '+def gcd(x, y):',\n", + " '+ if y == 0:',\n", + " '+ return x',\n", + " '+ else:',\n", + " '+ return gcd(y, x % y)',\n", + " '+',\n", + " '+',\n", + " '+def lcm(x, y):',\n", + " '+ return x / gcd(x, y) * y',\n", + " '+',\n", + " '- print(\"%d %d\" % (fractions.gcd(x, y), x / fractions.gcd(x, y) * y))',\n", + " '+ print(\"%d %d\" % (gcd(x, y), lcm(x, y)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2843708012,\n", + " 'measured_runtime_v1': 0.2133130357,\n", + " 'runtime_lift': 1.3331149699,\n", + " 'key': ['s153581221', 's486237781']},\n", + " {'user_id': 'u687343821',\n", + " 'problem_id': 'p03074',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's599311447',\n", + " 'submission_id_v1': 's168736691',\n", + " 'cpu_time_v0': 62,\n", + " 'cpu_time_v1': 44,\n", + " 'memory_v0': 5568,\n", + " 'memory_v1': 4596,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 29.03,\n", + " 'input': 'import sys\\n\\nstdin = sys.stdin \\n\\nni = lambda: int(ns())\\n\\nna = lambda: list(map(int, stdin.readline().split()))\\n\\nns = lambda: stdin.readline()\\n\\n\\n\\ndef Solve():\\n\\n N,K=na()\\n\\n S=[int(d) for d in eval(input())]\\n\\n l=[]\\n\\n N=len(S)\\n\\n if(S[0]==0):\\n\\n l.append(0)\\n\\n b=S[0]\\n\\n ct=1\\n\\n for i in S[1:]:\\n\\n if(b!=i):\\n\\n l.append(ct)\\n\\n ct=1\\n\\n b=i\\n\\n else:\\n\\n ct+=1\\n\\n l.append(ct)\\n\\n len_l=len(l)\\n\\n if(len_l//2 <= K):\\n\\n return sum(l)\\n\\n ans = res = sum(l[:2*K+1])\\n\\n \\n\\n if(len_l%2==0):\\n\\n l.append(0)\\n\\n len_l+=1\\n\\n g = K * 2 + 1\\n\\n for i in range(K*2+1,len_l-1,2):\\n\\n ans -= l[i-g] + l[i-g+1]\\n\\n ans += l[i] + l[1+i]\\n\\n if(resK:\\n\\n break\\n\\n dp[n+a]=1\\n\\n\\n\\nanswer = 'First' if dp[-1] else 'Second'\\n\\nprint(answer)\",\n", + " 'code_v0_loc': 19,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 396,\n", + " 'code_v1_num_chars': 369,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nfrom operator import xor\\nfrom functools import reduce\\n\\nN, K, *A = list(map(int, read().split()))\\na = reduce(xor, (1 << a for a in A))\\ndp = 0 # bitset\\nfor n in range(K):\\n if not (dp & (1 << n)):\\n dp |= a << n\\nanswer = \"First\" if dp & (1 << K) else \"Second\"\\nprint(answer)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nN, K, *A = list(map(int, read().split()))\\ndp = [0] * (K + 1) # bitset\\nfor n in range(K):\\n if not dp[n]:\\n for a in A:\\n if n + a > K:\\n break\\n dp[n + a] = 1\\nanswer = \"First\" if dp[-1] else \"Second\"\\nprint(answer)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 10.5263157895,\n", + " 'diff': ['-from operator import xor',\n", + " '-from functools import reduce',\n", + " '-',\n", + " '-a = reduce(xor, (1 << a for a in A))',\n", + " '-dp = 0 # bitset',\n", + " '+dp = [0] * (K + 1) # bitset',\n", + " '- if not (dp & (1 << n)):',\n", + " '- dp |= a << n',\n", + " '-answer = \"First\" if dp & (1 << K) else \"Second\"',\n", + " '+ if not dp[n]:',\n", + " '+ for a in A:',\n", + " '+ if n + a > K:',\n", + " '+ break',\n", + " '+ dp[n + a] = 1',\n", + " '+answer = \"First\" if dp[-1] else \"Second\"'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.510753959,\n", + " 'measured_runtime_v1': 0.2748723721,\n", + " 'runtime_lift': 1.8581494935,\n", + " 'key': ['s503646377', 's803807514']},\n", + " {'user_id': 'u433532588',\n", + " 'problem_id': 'p03164',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's155060992',\n", + " 'submission_id_v1': 's347020442',\n", + " 'cpu_time_v0': 1982,\n", + " 'cpu_time_v1': 1050,\n", + " 'memory_v0': 320832,\n", + " 'memory_v1': 314932,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 47.02,\n", + " 'input': \"\\n\\n\\n\\n# N個の荷物、ナップザックの容量はW\\n\\nN, W = list(map(int, input().split()))\\n\\nw = [0] * N\\n\\nv = [0] * N\\n\\n\\n\\nfor i in range(N):\\n\\n a, b = list(map(int, input().split()))\\n\\n w[i] = a\\n\\n v[i] = b\\n\\n\\n\\n# 1 <= W <= 10^9なので横軸をWにするとテーブルがでかすぎる\\n\\n# そのかわりにVの方を横軸にする\\n\\n\\n\\n# 価値の総合計はまだ不明なので、適当にでかい値にしとく\\n\\n# 最上部と最左部に0が入るので、その分を+1\\n\\nV = N*1000+1\\n\\ndp = [ [float('inf') for _ in range(V+1)] for _ in range(N+1) ]\\n\\n\\n\\n# 最小値を求めるので、上記でinfが入ってるので、初期値は0をいれる必要がある\\n\\ndp[0][0] = 0\\n\\n\\n\\n# dp[i][sum_v] = これまで(i-1)番目までの品物から価値がsum_v以上になるように選んだときの、重さの総和の最小値\\n\\nfor i in range(N):\\n\\n for sum_v in range(V):\\n\\n if sum_v - v[i] >= 0:\\n\\n dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v-v[i]]+w[i])\\n\\n\\n\\n dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v])\\n\\n\\n\\n\\n\\n# 中身がWなので、W以下であるうちのsum_vの最大値を求めればいい\\n\\nfor sum_v in range(V):\\n\\n # 最終行だけ見ればいいので、端からsum_vの最大値をなめるだけ\\n\\n if dp[N][sum_v] <= W:\\n\\n ans = sum_v\\n\\n\\n\\nprint(ans)\",\n", + " 'target': '\\n\\n\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\nsys.setrecursionlimit(2147483647)\\n\\nINF=float(\"inf\")\\n\\nMOD=10**9+7\\n\\n# A = [ int(input()) for _ in range(N) ]\\n\\n##############################\\n\\n\\n\\nN, W = list(map(int, input().split()))\\n\\nw = []\\n\\nv = []\\n\\nfor i in range(N):\\n\\n a, b = list(map(int, input().split()))\\n\\n w.append(a)\\n\\n v.append(b)\\n\\n\\n\\nV = sum(v)\\n\\n\\n\\ndp = [ [INF for _ in range(V+1)] for _ in range(N+1) ]\\n\\n\\n\\ndp[0][0] = 0\\n\\n\\n\\nfor i in range(N):\\n\\n for j in range(V+1):\\n\\n if j - v[i] < 0:\\n\\n dp[i+1][j] = dp[i][j]\\n\\n else:\\n\\n dp[i+1][j] = min(dp[i][j], dp[i][j-v[i]]+w[i])\\n\\n\\n\\n#print(dp[N])\\n\\n\\n\\nans = 0\\n\\nfor v in range(V+1):\\n\\n if dp[N][v] <= W:\\n\\n ans = v\\n\\n\\n\\nprint(ans)\\n',\n", + " 'code_v0_loc': 39,\n", + " 'code_v1_loc': 39,\n", + " 'code_v0_num_chars': 877,\n", + " 'code_v1_num_chars': 703,\n", + " 'code_v0_no_empty_lines': '# N個の荷物、ナップザックの容量はW\\nN, W = list(map(int, input().split()))\\nw = [0] * N\\nv = [0] * N\\nfor i in range(N):\\n a, b = list(map(int, input().split()))\\n w[i] = a\\n v[i] = b\\n# 1 <= W <= 10^9なので横軸をWにするとテーブルがでかすぎる\\n# そのかわりにVの方を横軸にする\\n# 価値の総合計はまだ不明なので、適当にでかい値にしとく\\n# 最上部と最左部に0が入るので、その分を+1\\nV = N * 1000 + 1\\ndp = [[float(\"inf\") for _ in range(V + 1)] for _ in range(N + 1)]\\n# 最小値を求めるので、上記でinfが入ってるので、初期値は0をいれる必要がある\\ndp[0][0] = 0\\n# dp[i][sum_v] = これまで(i-1)番目までの品物から価値がsum_v以上になるように選んだときの、重さの総和の最小値\\nfor i in range(N):\\n for sum_v in range(V):\\n if sum_v - v[i] >= 0:\\n dp[i + 1][sum_v] = min(dp[i + 1][sum_v], dp[i][sum_v - v[i]] + w[i])\\n dp[i + 1][sum_v] = min(dp[i + 1][sum_v], dp[i][sum_v])\\n# 中身がWなので、W以下であるうちのsum_vの最大値を求めればいい\\nfor sum_v in range(V):\\n # 最終行だけ見ればいいので、端からsum_vの最大値をなめるだけ\\n if dp[N][sum_v] <= W:\\n ans = sum_v\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nsys.setrecursionlimit(2147483647)\\nINF = float(\"inf\")\\nMOD = 10**9 + 7\\n# A = [ int(input()) for _ in range(N) ]\\n##############################\\nN, W = list(map(int, input().split()))\\nw = []\\nv = []\\nfor i in range(N):\\n a, b = list(map(int, input().split()))\\n w.append(a)\\n v.append(b)\\nV = sum(v)\\ndp = [[INF for _ in range(V + 1)] for _ in range(N + 1)]\\ndp[0][0] = 0\\nfor i in range(N):\\n for j in range(V + 1):\\n if j - v[i] < 0:\\n dp[i + 1][j] = dp[i][j]\\n else:\\n dp[i + 1][j] = min(dp[i][j], dp[i][j - v[i]] + w[i])\\n# print(dp[N])\\nans = 0\\nfor v in range(V + 1):\\n if dp[N][v] <= W:\\n ans = v\\nprint(ans)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['-# N個の荷物、ナップザックの容量はW',\n", + " '+import sys',\n", + " '+',\n", + " '+input = sys.stdin.readline',\n", + " '+sys.setrecursionlimit(2147483647)',\n", + " '+INF = float(\"inf\")',\n", + " '+MOD = 10**9 + 7',\n", + " '+# A = [ int(input()) for _ in range(N) ]',\n", + " '+##############################',\n", + " '-w = [0] * N',\n", + " '-v = [0] * N',\n", + " '+w = []',\n", + " '+v = []',\n", + " '- w[i] = a',\n", + " '- v[i] = b',\n", + " '-# 1 <= W <= 10^9なので横軸をWにするとテーブルがでかすぎる',\n", + " '-# そのかわりにVの方を横軸にする',\n", + " '-# 価値の総合計はまだ不明なので、適当にでかい値にしとく',\n", + " '-# 最上部と最左部に0が入るので、その分を+1',\n", + " '-V = N * 1000 + 1',\n", + " '-dp = [[float(\"inf\") for _ in range(V + 1)] for _ in range(N + 1)]',\n", + " '-# 最小値を求めるので、上記でinfが入ってるので、初期値は0をいれる必要がある',\n", + " '+ w.append(a)',\n", + " '+ v.append(b)',\n", + " '+V = sum(v)',\n", + " '+dp = [[INF for _ in range(V + 1)] for _ in range(N + 1)]',\n", + " '-# dp[i][sum_v] = これまで(i-1)番目までの品物から価値がsum_v以上になるように選んだときの、重さの総和の最小値',\n", + " '- for sum_v in range(V):',\n", + " '- if sum_v - v[i] >= 0:',\n", + " '- dp[i + 1][sum_v] = min(dp[i + 1][sum_v], dp[i][sum_v - v[i]] + w[i])',\n", + " '- dp[i + 1][sum_v] = min(dp[i + 1][sum_v], dp[i][sum_v])',\n", + " '-# 中身がWなので、W以下であるうちのsum_vの最大値を求めればいい',\n", + " '-for sum_v in range(V):',\n", + " '- # 最終行だけ見ればいいので、端からsum_vの最大値をなめるだけ',\n", + " '- if dp[N][sum_v] <= W:',\n", + " '- ans = sum_v',\n", + " '+ for j in range(V + 1):',\n", + " '+ if j - v[i] < 0:',\n", + " '+ dp[i + 1][j] = dp[i][j]',\n", + " '+ else:',\n", + " '+ dp[i + 1][j] = min(dp[i][j], dp[i][j - v[i]] + w[i])',\n", + " '+# print(dp[N])',\n", + " '+ans = 0',\n", + " '+for v in range(V + 1):',\n", + " '+ if dp[N][v] <= W:',\n", + " '+ ans = v'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3746892574,\n", + " 'measured_runtime_v1': 0.2039975414,\n", + " 'runtime_lift': 1.8367341819,\n", + " 'key': ['s155060992', 's347020442']},\n", + " {'user_id': 'u057964173',\n", + " 'problem_id': 'p03371',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's236240914',\n", + " 'submission_id_v1': 's892922951',\n", + " 'cpu_time_v0': 286,\n", + " 'cpu_time_v1': 86,\n", + " 'memory_v0': 62304,\n", + " 'memory_v1': 7064,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 69.93,\n", + " 'input': 'import sys\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n\\n\\ndef resolve():\\n\\n import math\\n\\n a,b,c,x,y=list(map(int, input().split()))\\n\\n cmax=max(x,y)*2\\n\\n l=[]\\n\\n for i in range(cmax+1):\\n\\n amai = max(math.ceil(x - 0.5 * i),0)\\n\\n bmai = max(math.ceil(y - 0.5 * i),0)\\n\\n l.append(amai*a+bmai*b+i*c)\\n\\n print((min(l)))\\n\\nresolve()',\n", + " 'target': 'import sys\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n\\n\\ndef resolve():\\n\\n import math\\n\\n a,b,c,x,y=list(map(int, input().split()))\\n\\n # ABピザを奇数枚買っても1枚無駄になるから、ABピザは2枚を1枚だと考える\\n\\n # cの値段を2倍にして枚数を半分に\\n\\n cmax=max(x,y) # ABピザの最大枚数(2枚を1枚と考えたとき)\\n\\n c=2*c\\n\\n l=[]\\n\\n for i in range(cmax+1):\\n\\n amai = max(x - i,0)\\n\\n bmai = max(y - i,0)\\n\\n l.append(amai*a+bmai*b+i*c)\\n\\n print((min(l)))\\n\\nresolve()',\n", + " 'code_v0_loc': 14,\n", + " 'code_v1_loc': 17,\n", + " 'code_v0_num_chars': 355,\n", + " 'code_v1_num_chars': 424,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef resolve():\\n import math\\n\\n a, b, c, x, y = list(map(int, input().split()))\\n cmax = max(x, y) * 2\\n l = []\\n for i in range(cmax + 1):\\n amai = max(math.ceil(x - 0.5 * i), 0)\\n bmai = max(math.ceil(y - 0.5 * i), 0)\\n l.append(amai * a + bmai * b + i * c)\\n print((min(l)))\\n\\n\\nresolve()\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\n\\ndef input():\\n return sys.stdin.readline().strip()\\n\\n\\ndef resolve():\\n import math\\n\\n a, b, c, x, y = list(map(int, input().split()))\\n # ABピザを奇数枚買っても1枚無駄になるから、ABピザは2枚を1枚だと考える\\n # cの値段を2倍にして枚数を半分に\\n cmax = max(x, y) # ABピザの最大枚数(2枚を1枚と考えたとき)\\n c = 2 * c\\n l = []\\n for i in range(cmax + 1):\\n amai = max(x - i, 0)\\n bmai = max(y - i, 0)\\n l.append(amai * a + bmai * b + i * c)\\n print((min(l)))\\n\\n\\nresolve()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 17.6470588235,\n", + " 'diff': ['- cmax = max(x, y) * 2',\n", + " '+ # ABピザを奇数枚買っても1枚無駄になるから、ABピザは2枚を1枚だと考える',\n", + " '+ # cの値段を2倍にして枚数を半分に',\n", + " '+ cmax = max(x, y) # ABピザの最大枚数(2枚を1枚と考えたとき)',\n", + " '+ c = 2 * c',\n", + " '- amai = max(math.ceil(x - 0.5 * i), 0)',\n", + " '- bmai = max(math.ceil(y - 0.5 * i), 0)',\n", + " '+ amai = max(x - i, 0)',\n", + " '+ bmai = max(y - i, 0)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4395413058,\n", + " 'measured_runtime_v1': 0.288304507,\n", + " 'runtime_lift': 1.5245731338,\n", + " 'key': ['s236240914', 's892922951']},\n", + " {'user_id': 'u153665391',\n", + " 'problem_id': 'p02268',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's156684058',\n", + " 'submission_id_v1': 's820654012',\n", + " 'cpu_time_v0': 520,\n", + " 'cpu_time_v1': 390,\n", + " 'memory_v0': 16712,\n", + " 'memory_v1': 16712,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 25.0,\n", + " 'input': 'N = int(eval(input()))\\n\\nS = list(map(int, input().split()))\\n\\nQ = int(eval(input()))\\n\\nT = list(map(int, input().split()))\\n\\n\\n\\ndef binary_search(target_num, head, tail):\\n\\n idx = int((head+tail)/2)\\n\\n if target_num == S[idx]:\\n\\n return True\\n\\n elif target_num < S[idx]:\\n\\n if head == idx:\\n\\n return False\\n\\n return binary_search(target_num, head, idx-1)\\n\\n else:\\n\\n if tail == idx:\\n\\n return False\\n\\n return binary_search(target_num, idx+1, tail)\\n\\n\\n\\n\\n\\nmatch_count = 0\\n\\nfor target_num in T:\\n\\n if binary_search(target_num, 0, len(S)-1):\\n\\n match_count += 1\\n\\n\\n\\nprint((str(match_count)))\\n',\n", + " 'target': 'N = int(eval(input()))\\n\\nS = list(map(int, input().split()))\\n\\nQ = int(eval(input()))\\n\\nT = list(map(int, input().split()))\\n\\n\\n\\ndef binary_search(target_num, head, tail):\\n\\n while head <= tail:\\n\\n idx = int((head+tail)/2)\\n\\n if target_num == S[idx]:\\n\\n return True\\n\\n elif target_num < S[idx]:\\n\\n tail = idx - 1\\n\\n else:\\n\\n head = idx + 1\\n\\n return False\\n\\n\\n\\n\\n\\nmatch_count = 0\\n\\nfor target_num in T:\\n\\n if binary_search(target_num, 0, len(S)-1):\\n\\n match_count += 1\\n\\n\\n\\nprint((str(match_count)))\\n',\n", + " 'code_v0_loc': 25,\n", + " 'code_v1_loc': 23,\n", + " 'code_v0_num_chars': 634,\n", + " 'code_v1_num_chars': 541,\n", + " 'code_v0_no_empty_lines': 'N = int(eval(input()))\\nS = list(map(int, input().split()))\\nQ = int(eval(input()))\\nT = list(map(int, input().split()))\\n\\n\\ndef binary_search(target_num, head, tail):\\n idx = int((head + tail) / 2)\\n if target_num == S[idx]:\\n return True\\n elif target_num < S[idx]:\\n if head == idx:\\n return False\\n return binary_search(target_num, head, idx - 1)\\n else:\\n if tail == idx:\\n return False\\n return binary_search(target_num, idx + 1, tail)\\n\\n\\nmatch_count = 0\\nfor target_num in T:\\n if binary_search(target_num, 0, len(S) - 1):\\n match_count += 1\\nprint((str(match_count)))\\n',\n", + " 'code_v1_no_empty_lines': 'N = int(eval(input()))\\nS = list(map(int, input().split()))\\nQ = int(eval(input()))\\nT = list(map(int, input().split()))\\n\\n\\ndef binary_search(target_num, head, tail):\\n while head <= tail:\\n idx = int((head + tail) / 2)\\n if target_num == S[idx]:\\n return True\\n elif target_num < S[idx]:\\n tail = idx - 1\\n else:\\n head = idx + 1\\n return False\\n\\n\\nmatch_count = 0\\nfor target_num in T:\\n if binary_search(target_num, 0, len(S) - 1):\\n match_count += 1\\nprint((str(match_count)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 8.0,\n", + " 'diff': ['- idx = int((head + tail) / 2)',\n", + " '- if target_num == S[idx]:',\n", + " '- return True',\n", + " '- elif target_num < S[idx]:',\n", + " '- if head == idx:',\n", + " '- return False',\n", + " '- return binary_search(target_num, head, idx - 1)',\n", + " '- else:',\n", + " '- if tail == idx:',\n", + " '- return False',\n", + " '- return binary_search(target_num, idx + 1, tail)',\n", + " '+ while head <= tail:',\n", + " '+ idx = int((head + tail) / 2)',\n", + " '+ if target_num == S[idx]:',\n", + " '+ return True',\n", + " '+ elif target_num < S[idx]:',\n", + " '+ tail = idx - 1',\n", + " '+ else:',\n", + " '+ head = idx + 1',\n", + " '+ return False'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3635195796,\n", + " 'measured_runtime_v1': 0.2206529045,\n", + " 'runtime_lift': 1.6474724429,\n", + " 'key': ['s156684058', 's820654012']},\n", + " {'user_id': 'u047796752',\n", + " 'problem_id': 'p02700',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's232689719',\n", + " 'submission_id_v1': 's065315130',\n", + " 'cpu_time_v0': 74,\n", + " 'cpu_time_v1': 57,\n", + " 'memory_v0': 64716,\n", + " 'memory_v1': 61776,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 22.97,\n", + " 'input': \"import sys\\n\\ninput = sys.stdin.readline\\n\\nfrom collections import *\\n\\n\\n\\nA, B, C, D = list(map(int, input().split()))\\n\\n\\n\\nwhile True:\\n\\n C -= B\\n\\n \\n\\n if C<=0:\\n\\n print('Yes')\\n\\n exit()\\n\\n \\n\\n A -= D\\n\\n \\n\\n if A<=0:\\n\\n print('No')\\n\\n exit()\",\n", + " 'target': \"A, B, C, D = list(map(int, input().split()))\\n\\nc1 = (C+B-1)//B\\n\\nc2 = (A+D-1)//D\\n\\n\\n\\nif c1<=c2:\\n\\n print('Yes')\\n\\nelse:\\n\\n print('No')\",\n", + " 'code_v0_loc': 18,\n", + " 'code_v1_loc': 8,\n", + " 'code_v0_num_chars': 267,\n", + " 'code_v1_num_chars': 128,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\nfrom collections import *\\n\\nA, B, C, D = list(map(int, input().split()))\\nwhile True:\\n C -= B\\n if C <= 0:\\n print(\"Yes\")\\n exit()\\n A -= D\\n if A <= 0:\\n print(\"No\")\\n exit()\\n',\n", + " 'code_v1_no_empty_lines': 'A, B, C, D = list(map(int, input().split()))\\nc1 = (C + B - 1) // B\\nc2 = (A + D - 1) // D\\nif c1 <= c2:\\n print(\"Yes\")\\nelse:\\n print(\"No\")\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 55.5555555556,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-input = sys.stdin.readline',\n", + " '-from collections import *',\n", + " '-',\n", + " '-while True:',\n", + " '- C -= B',\n", + " '- if C <= 0:',\n", + " '- print(\"Yes\")',\n", + " '- exit()',\n", + " '- A -= D',\n", + " '- if A <= 0:',\n", + " '- print(\"No\")',\n", + " '- exit()',\n", + " '+c1 = (C + B - 1) // B',\n", + " '+c2 = (A + D - 1) // D',\n", + " '+if c1 <= c2:',\n", + " '+ print(\"Yes\")',\n", + " '+else:',\n", + " '+ print(\"No\")'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.2898896478,\n", + " 'measured_runtime_v1': 0.0638447898,\n", + " 'runtime_lift': 4.5405372711,\n", + " 'key': ['s232689719', 's065315130']},\n", + " {'user_id': 'u576335153',\n", + " 'problem_id': 'p03723',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's032726803',\n", + " 'submission_id_v1': 's012708150',\n", + " 'cpu_time_v0': 58,\n", + " 'cpu_time_v1': 26,\n", + " 'memory_v0': 32492,\n", + " 'memory_v1': 9200,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 55.17,\n", + " 'input': 'a, b, c = list(map(int, input().split()))\\n\\n\\n\\nif any(i % 2 != 0 for i in [a, b, c]):\\n\\n print((0))\\n\\n exit()\\n\\n\\n\\nif a == b and b == c:\\n\\n print((-1))\\n\\n exit()\\n\\n\\n\\ncnt = 0\\n\\na_list = [0]*(1001001)\\n\\nb_list = [0]*(1001001)\\n\\nc_list = [0]*(1001001)\\n\\na_list[0] = a\\n\\nb_list[0] = b\\n\\nc_list[0] = c\\n\\n\\n\\nfor i in range(1, 1001001):\\n\\n a_list[i] = (b_list[i-1] + c_list[i-1]) // 2\\n\\n b_list[i] = (c_list[i-1] + a_list[i-1]) // 2\\n\\n c_list[i] = (a_list[i-1] + b_list[i-1]) // 2\\n\\n cnt += 1\\n\\n if a_list[i] % 2 != 0 or b_list[i] % 2 != 0 or c_list[i] % 2 != 0:\\n\\n break\\n\\n\\n\\nprint(cnt)\\n',\n", + " 'target': 'def solve(a, b, c):\\n\\n if any(i % 2 == 1 for i in [a, b, c]):\\n\\n return 0\\n\\n if a == b == c:\\n\\n return -1\\n\\n a, b, c = (b + c) // 2, (c + a) // 2, (a + b) // 2\\n\\n return solve(a, b, c) + 1\\n\\n\\n\\na, b, c = list(map(int, input().split()))\\n\\n\\n\\nprint((solve(a, b, c)))',\n", + " 'code_v0_loc': 27,\n", + " 'code_v1_loc': 11,\n", + " 'code_v0_num_chars': 580,\n", + " 'code_v1_num_chars': 272,\n", + " 'code_v0_no_empty_lines': 'a, b, c = list(map(int, input().split()))\\nif any(i % 2 != 0 for i in [a, b, c]):\\n print((0))\\n exit()\\nif a == b and b == c:\\n print((-1))\\n exit()\\ncnt = 0\\na_list = [0] * (1001001)\\nb_list = [0] * (1001001)\\nc_list = [0] * (1001001)\\na_list[0] = a\\nb_list[0] = b\\nc_list[0] = c\\nfor i in range(1, 1001001):\\n a_list[i] = (b_list[i - 1] + c_list[i - 1]) // 2\\n b_list[i] = (c_list[i - 1] + a_list[i - 1]) // 2\\n c_list[i] = (a_list[i - 1] + b_list[i - 1]) // 2\\n cnt += 1\\n if a_list[i] % 2 != 0 or b_list[i] % 2 != 0 or c_list[i] % 2 != 0:\\n break\\nprint(cnt)\\n',\n", + " 'code_v1_no_empty_lines': 'def solve(a, b, c):\\n if any(i % 2 == 1 for i in [a, b, c]):\\n return 0\\n if a == b == c:\\n return -1\\n a, b, c = (b + c) // 2, (c + a) // 2, (a + b) // 2\\n return solve(a, b, c) + 1\\n\\n\\na, b, c = list(map(int, input().split()))\\nprint((solve(a, b, c)))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 59.2592592593,\n", + " 'diff': ['+def solve(a, b, c):',\n", + " '+ if any(i % 2 == 1 for i in [a, b, c]):',\n", + " '+ return 0',\n", + " '+ if a == b == c:',\n", + " '+ return -1',\n", + " '+ a, b, c = (b + c) // 2, (c + a) // 2, (a + b) // 2',\n", + " '+ return solve(a, b, c) + 1',\n", + " '+',\n", + " '+',\n", + " '-if any(i % 2 != 0 for i in [a, b, c]):',\n", + " '- print((0))',\n", + " '- exit()',\n", + " '-if a == b and b == c:',\n", + " '- print((-1))',\n", + " '- exit()',\n", + " '-cnt = 0',\n", + " '-a_list = [0] * (1001001)',\n", + " '-b_list = [0] * (1001001)',\n", + " '-c_list = [0] * (1001001)',\n", + " '-a_list[0] = a',\n", + " '-b_list[0] = b',\n", + " '-c_list[0] = c',\n", + " '-for i in range(1, 1001001):',\n", + " '- a_list[i] = (b_list[i - 1] + c_list[i - 1]) // 2',\n", + " '- b_list[i] = (c_list[i - 1] + a_list[i - 1]) // 2',\n", + " '- c_list[i] = (a_list[i - 1] + b_list[i - 1]) // 2',\n", + " '- cnt += 1',\n", + " '- if a_list[i] % 2 != 0 or b_list[i] % 2 != 0 or c_list[i] % 2 != 0:',\n", + " '- break',\n", + " '-print(cnt)',\n", + " '+print((solve(a, b, c)))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.6101216149,\n", + " 'measured_runtime_v1': 0.3266951015,\n", + " 'runtime_lift': 1.8675566671,\n", + " 'key': ['s032726803', 's012708150']},\n", + " {'user_id': 'u780475861',\n", + " 'problem_id': 'p03416',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's789877064',\n", + " 'submission_id_v1': 's762526319',\n", + " 'cpu_time_v0': 111,\n", + " 'cpu_time_v1': 17,\n", + " 'memory_v0': 2940,\n", + " 'memory_v1': 2940,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 84.68,\n", + " 'input': 'a,b = list(map(int, input().split()))\\n\\nn = 0\\n\\nfor i in range(a, b + 1):\\n\\n f = True\\n\\n s = str(i)\\n\\n l = len(s)\\n\\n for j in range(l//2 + 1):\\n\\n if s[j] != s[- j - 1]:\\n\\n f = False\\n\\n break\\n\\n if f:\\n\\n n += 1\\n\\nprint(n)',\n", + " 'target': 'a,b = list(map(int, input().split()))\\n\\nn = 0\\n\\nfor i in range(1, 10):\\n\\n for j in range(10):\\n\\n for k in range(10):\\n\\n s = 10000 * i + 1000 * j + 100 * k + 10 * j + i\\n\\n if a <= s <= b:\\n\\n n += 1\\n\\nprint(n)',\n", + " 'code_v0_loc': 13,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 253,\n", + " 'code_v1_num_chars': 240,\n", + " 'code_v0_no_empty_lines': 'a, b = list(map(int, input().split()))\\nn = 0\\nfor i in range(a, b + 1):\\n f = True\\n s = str(i)\\n l = len(s)\\n for j in range(l // 2 + 1):\\n if s[j] != s[-j - 1]:\\n f = False\\n break\\n if f:\\n n += 1\\nprint(n)\\n',\n", + " 'code_v1_no_empty_lines': 'a, b = list(map(int, input().split()))\\nn = 0\\nfor i in range(1, 10):\\n for j in range(10):\\n for k in range(10):\\n s = 10000 * i + 1000 * j + 100 * k + 10 * j + i\\n if a <= s <= b:\\n n += 1\\nprint(n)\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 30.7692307692,\n", + " 'diff': ['-for i in range(a, b + 1):',\n", + " '- f = True',\n", + " '- s = str(i)',\n", + " '- l = len(s)',\n", + " '- for j in range(l // 2 + 1):',\n", + " '- if s[j] != s[-j - 1]:',\n", + " '- f = False',\n", + " '- break',\n", + " '- if f:',\n", + " '- n += 1',\n", + " '+for i in range(1, 10):',\n", + " '+ for j in range(10):',\n", + " '+ for k in range(10):',\n", + " '+ s = 10000 * i + 1000 * j + 100 * k + 10 * j + i',\n", + " '+ if a <= s <= b:',\n", + " '+ n += 1'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.319382349,\n", + " 'measured_runtime_v1': 0.1601409102,\n", + " 'runtime_lift': 1.99438325,\n", + " 'key': ['s789877064', 's762526319']},\n", + " {'user_id': 'u135847648',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's407946242',\n", + " 'submission_id_v1': 's697976094',\n", + " 'cpu_time_v0': 286,\n", + " 'cpu_time_v1': 107,\n", + " 'memory_v0': 27184,\n", + " 'memory_v1': 9584,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.59,\n", + " 'input': 'from collections import defaultdict\\n\\nimport numpy as np\\n\\ndef main():\\n\\n s = eval(input())\\n\\n n = len(s)\\n\\n d = np.zeros(2019,np.int64)\\n\\n ans = 0\\n\\n num = 0\\n\\n pow10 = 1\\n\\n d[0] = 1\\n\\n for i in reversed(list(range(n))):\\n\\n pow10 = pow10 * 10 % 2019\\n\\n num += int(s[i]) * pow10\\n\\n #print(num, num % 2019, i)\\n\\n mod = num % 2019\\n\\n ans += d[mod]\\n\\n d[mod] += 1\\n\\n print(ans)\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'from collections import defaultdict\\n\\n\\n\\ndef main():\\n\\n s = eval(input())\\n\\n n = len(s)\\n\\n ans = 0\\n\\n num = 0\\n\\n pow10 = 1\\n\\n d = defaultdict(int)\\n\\n d[0] = 1\\n\\n for i in reversed(list(range(n))):\\n\\n # pow10を10 ** (n-1-i)にしてるだけでTLEしていた\\n\\n pow10 = pow10 * 10 % 2019\\n\\n num += int(s[i]) * pow10\\n\\n mod = num % 2019\\n\\n ans += d[mod]\\n\\n d[mod] += 1\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 21,\n", + " 'code_v1_loc': 22,\n", + " 'code_v0_num_chars': 457,\n", + " 'code_v1_num_chars': 443,\n", + " 'code_v0_no_empty_lines': 'from collections import defaultdict\\nimport numpy as np\\n\\n\\ndef main():\\n s = eval(input())\\n n = len(s)\\n d = np.zeros(2019, np.int64)\\n ans = 0\\n num = 0\\n pow10 = 1\\n d[0] = 1\\n for i in reversed(list(range(n))):\\n pow10 = pow10 * 10 % 2019\\n num += int(s[i]) * pow10\\n # print(num, num % 2019, i)\\n mod = num % 2019\\n ans += d[mod]\\n d[mod] += 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from collections import defaultdict\\n\\n\\ndef main():\\n s = eval(input())\\n n = len(s)\\n ans = 0\\n num = 0\\n pow10 = 1\\n d = defaultdict(int)\\n d[0] = 1\\n for i in reversed(list(range(n))):\\n # pow10を10 ** (n-1-i)にしてるだけでTLEしていた\\n pow10 = pow10 * 10 % 2019\\n num += int(s[i]) * pow10\\n mod = num % 2019\\n ans += d[mod]\\n d[mod] += 1\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 4.5454545455,\n", + " 'diff': ['-import numpy as np',\n", + " '- d = np.zeros(2019, np.int64)',\n", + " '+ d = defaultdict(int)',\n", + " '+ # pow10を10 ** (n-1-i)にしてるだけでTLEしていた',\n", + " '- # print(num, num % 2019, i)'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 1.7964013727,\n", + " 'measured_runtime_v1': 0.2822417974,\n", + " 'runtime_lift': 6.3647602476,\n", + " 'key': ['s407946242', 's697976094']},\n", + " {'user_id': 'u837673618',\n", + " 'problem_id': 'p02721',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's949081681',\n", + " 'submission_id_v1': 's434725940',\n", + " 'cpu_time_v0': 326,\n", + " 'cpu_time_v1': 177,\n", + " 'memory_v0': 12688,\n", + " 'memory_v1': 12576,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 45.71,\n", + " 'input': 'N, K, C = list(map(int, input().split()))\\n\\nS = eval(input())\\n\\n\\n\\nlatest = [None]*K\\n\\ni = len(S)+C\\n\\nfor j in range(K-1, -1, -1):\\n\\n i = S.rindex(\"o\", 0, i-C)\\n\\n latest[j] = i\\n\\n\\n\\nif i<=C or \"o\" not in S[:i-C]:\\n\\n i = -C-1\\n\\n for j in latest:\\n\\n i = S.index(\"o\", i+C+1)\\n\\n if i == j:\\n\\n print((i+1))\\n',\n", + " 'target': 'def solve():\\n\\n N, K, C = list(map(int, input().split()))\\n\\n workable = [i for i, s in enumerate(eval(input())) if s==\"o\"]\\n\\n if len(workable) == K:\\n\\n return workable\\n\\n \\n\\n prev = workable[-1]\\n\\n latest = {prev}\\n\\n i = len(workable)-1\\n\\n while i > 0:\\n\\n i -= 1\\n\\n if prev - workable[i] > C:\\n\\n latest.add(workable[i])\\n\\n prev = workable[i]\\n\\n if len(latest) > K:\\n\\n return []\\n\\n must = []\\n\\n i = -1\\n\\n prev = -C-1\\n\\n while i < len(workable)-1:\\n\\n i += 1\\n\\n if workable[i] - prev > C:\\n\\n if workable[i] in latest:\\n\\n must.append(workable[i])\\n\\n prev = workable[i]\\n\\n return must\\n\\n\\n\\nfor i in solve():\\n\\n print((i+1))',\n", + " 'code_v0_loc': 15,\n", + " 'code_v1_loc': 29,\n", + " 'code_v0_num_chars': 289,\n", + " 'code_v1_num_chars': 646,\n", + " 'code_v0_no_empty_lines': 'N, K, C = list(map(int, input().split()))\\nS = eval(input())\\nlatest = [None] * K\\ni = len(S) + C\\nfor j in range(K - 1, -1, -1):\\n i = S.rindex(\"o\", 0, i - C)\\n latest[j] = i\\nif i <= C or \"o\" not in S[: i - C]:\\n i = -C - 1\\n for j in latest:\\n i = S.index(\"o\", i + C + 1)\\n if i == j:\\n print((i + 1))\\n',\n", + " 'code_v1_no_empty_lines': 'def solve():\\n N, K, C = list(map(int, input().split()))\\n workable = [i for i, s in enumerate(eval(input())) if s == \"o\"]\\n if len(workable) == K:\\n return workable\\n prev = workable[-1]\\n latest = {prev}\\n i = len(workable) - 1\\n while i > 0:\\n i -= 1\\n if prev - workable[i] > C:\\n latest.add(workable[i])\\n prev = workable[i]\\n if len(latest) > K:\\n return []\\n must = []\\n i = -1\\n prev = -C - 1\\n while i < len(workable) - 1:\\n i += 1\\n if workable[i] - prev > C:\\n if workable[i] in latest:\\n must.append(workable[i])\\n prev = workable[i]\\n return must\\n\\n\\nfor i in solve():\\n print((i + 1))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 48.275862069,\n", + " 'diff': ['-N, K, C = list(map(int, input().split()))',\n", + " '-S = eval(input())',\n", + " '-latest = [None] * K',\n", + " '-i = len(S) + C',\n", + " '-for j in range(K - 1, -1, -1):',\n", + " '- i = S.rindex(\"o\", 0, i - C)',\n", + " '- latest[j] = i',\n", + " '-if i <= C or \"o\" not in S[: i - C]:',\n", + " '- i = -C - 1',\n", + " '- for j in latest:',\n", + " '- i = S.index(\"o\", i + C + 1)',\n", + " '- if i == j:',\n", + " '- print((i + 1))',\n", + " '+def solve():',\n", + " '+ N, K, C = list(map(int, input().split()))',\n", + " '+ workable = [i for i, s in enumerate(eval(input())) if s == \"o\"]',\n", + " '+ if len(workable) == K:',\n", + " '+ return workable',\n", + " '+ prev = workable[-1]',\n", + " '+ latest = {prev}',\n", + " '+ i = len(workable) - 1',\n", + " '+ while i > 0:',\n", + " '+ i -= 1',\n", + " '+ if prev - workable[i] > C:',\n", + " '+ latest.add(workable[i])',\n", + " '+ prev = workable[i]',\n", + " '+ if len(latest) > K:',\n", + " '+ return []',\n", + " '+ must = []',\n", + " '+ i = -1',\n", + " '+ prev = -C - 1',\n", + " '+ while i < len(workable) - 1:',\n", + " '+ i += 1',\n", + " '+ if workable[i] - prev > C:',\n", + " '+ if workable[i] in latest:',\n", + " '+ must.append(workable[i])',\n", + " '+ prev = workable[i]',\n", + " '+ return must',\n", + " '+',\n", + " '+',\n", + " '+for i in solve():',\n", + " '+ print((i + 1))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3840038183,\n", + " 'measured_runtime_v1': 0.2943901448,\n", + " 'runtime_lift': 1.3044044613,\n", + " 'key': ['s949081681', 's434725940']},\n", + " {'user_id': 'u150984829',\n", + " 'problem_id': 'p02414',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's966401245',\n", + " 'submission_id_v1': 's281717363',\n", + " 'cpu_time_v0': 630,\n", + " 'cpu_time_v1': 130,\n", + " 'memory_v0': 7076,\n", + " 'memory_v1': 6584,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 79.37,\n", + " 'input': 'n,m,l=list(map(int,input().split()))\\n\\ne=[input().split()for _ in[0]*(n+m)]\\n\\nfor c in e[:n]:print((*[sum(int(s)*int(t)for s,t in zip(c,l))for l in zip(*e[n:])]))\\n',\n", + " 'target': 'import sys\\n\\nn,m,l=list(map(int,input().split()))\\n\\ne=[list(map(int,e.split()))for e in sys.stdin]\\n\\nfor c in e[:n]:print((*[sum(s*t for s,t in zip(c,l))for l in zip(*e[n:])]))\\n',\n", + " 'code_v0_loc': 3,\n", + " 'code_v1_loc': 4,\n", + " 'code_v0_num_chars': 153,\n", + " 'code_v1_num_chars': 166,\n", + " 'code_v0_no_empty_lines': 'n, m, l = list(map(int, input().split()))\\ne = [input().split() for _ in [0] * (n + m)]\\nfor c in e[:n]:\\n print((*[sum(int(s) * int(t) for s, t in zip(c, l)) for l in zip(*e[n:])]))\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\nn, m, l = list(map(int, input().split()))\\ne = [list(map(int, e.split())) for e in sys.stdin]\\nfor c in e[:n]:\\n print((*[sum(s * t for s, t in zip(c, l)) for l in zip(*e[n:])]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 25.0,\n", + " 'diff': ['+import sys',\n", + " '+',\n", + " '-e = [input().split() for _ in [0] * (n + m)]',\n", + " '+e = [list(map(int, e.split())) for e in sys.stdin]',\n", + " '- print((*[sum(int(s) * int(t) for s, t in zip(c, l)) for l in zip(*e[n:])]))',\n", + " '+ print((*[sum(s * t for s, t in zip(c, l)) for l in zip(*e[n:])]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3404335606,\n", + " 'measured_runtime_v1': 0.2443783689,\n", + " 'runtime_lift': 1.3930593047,\n", + " 'key': ['s966401245', 's281717363']},\n", + " {'user_id': 'u498487134',\n", + " 'problem_id': 'p02814',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's444255215',\n", + " 'submission_id_v1': 's830443344',\n", + " 'cpu_time_v0': 445,\n", + " 'cpu_time_v1': 157,\n", + " 'memory_v0': 85440,\n", + " 'memory_v1': 85732,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 64.72,\n", + " 'input': 'import fractions\\n\\nimport sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\nN,M=list(map(int,input().split()))\\n\\na = list(map(int, input().split()))\\n\\n\\n\\n\\n\\nlcm = a[0]\\n\\nfor i in range(1, N):\\n\\n g= fractions.gcd(lcm, a[i])\\n\\n lcm = lcm * a[i] // g\\n\\n\\n\\n\\n\\ng=a[0]\\n\\nfor i in range(N):\\n\\n g=fractions.gcd(g,a[i])\\n\\n\\n\\nfor i in range(N):\\n\\n if (a[i]//g)%2==0:\\n\\n lcm=0\\n\\n break \\n\\n \\n\\n \\n\\nans=0\\n\\nl=lcm//2\\n\\nif l:\\n\\n ans=(M//l)-(M//(l+l))\\n\\nprint(ans)\\n\\n\\n',\n", + " 'target': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\n\\ndef I(): return int(eval(input()))\\n\\ndef MI(): return list(map(int, input().split()))\\n\\ndef LI(): return list(map(int, input().split()))\\n\\n\\n\\n\"\"\"\\n\\n2X = ak * (2p+1)\\n\\n基本的には最小公倍数/2を基本とし，これの奇数倍か．\\n\\n\\n\\nX = (ak//2) * (2p+1)\\n\\nと書ける．第二項が奇数なので，各akが2で割り切れれう回数が同じでなければならない\\n\\na=[2,4]だと無理\\n\\n\"\"\"\\n\\ndef main():\\n\\n from math import gcd\\n\\n N,M=MI()\\n\\n A=LI()\\n\\n \\n\\n def count(X):\\n\\n cnt=0\\n\\n while X%2==0:\\n\\n cnt+=1\\n\\n X=X//2\\n\\n return cnt\\n\\n \\n\\n C=count(A[0])\\n\\n for i in range(1,N):\\n\\n if count(A[i])!=C:\\n\\n print((0))\\n\\n exit()\\n\\n \\n\\n lca=1\\n\\n for i in range(N):\\n\\n g=gcd(lca,A[i])\\n\\n lca=(lca*A[i])//g\\n\\n \\n\\n lca2=lca//2\\n\\n ans=M//lca2 - M//lca\\n\\n \\n\\n print(ans)\\n\\n \\n\\n \\n\\n \\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 30,\n", + " 'code_v1_loc': 47,\n", + " 'code_v0_num_chars': 443,\n", + " 'code_v1_num_chars': 825,\n", + " 'code_v0_no_empty_lines': 'import fractions\\nimport sys\\n\\ninput = sys.stdin.readline\\nN, M = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nlcm = a[0]\\nfor i in range(1, N):\\n g = fractions.gcd(lcm, a[i])\\n lcm = lcm * a[i] // g\\ng = a[0]\\nfor i in range(N):\\n g = fractions.gcd(g, a[i])\\nfor i in range(N):\\n if (a[i] // g) % 2 == 0:\\n lcm = 0\\n break\\nans = 0\\nl = lcm // 2\\nif l:\\n ans = (M // l) - (M // (l + l))\\nprint(ans)\\n',\n", + " 'code_v1_no_empty_lines': 'import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef I():\\n return int(eval(input()))\\n\\n\\ndef MI():\\n return list(map(int, input().split()))\\n\\n\\ndef LI():\\n return list(map(int, input().split()))\\n\\n\\n\"\"\"\\n2X = ak * (2p+1)\\n基本的には最小公倍数/2を基本とし，これの奇数倍か．\\nX = (ak//2) * (2p+1)\\nと書ける．第二項が奇数なので，各akが2で割り切れれう回数が同じでなければならない\\na=[2,4]だと無理\\n\"\"\"\\n\\n\\ndef main():\\n from math import gcd\\n\\n N, M = MI()\\n A = LI()\\n\\n def count(X):\\n cnt = 0\\n while X % 2 == 0:\\n cnt += 1\\n X = X // 2\\n return cnt\\n\\n C = count(A[0])\\n for i in range(1, N):\\n if count(A[i]) != C:\\n print((0))\\n exit()\\n lca = 1\\n for i in range(N):\\n g = gcd(lca, A[i])\\n lca = (lca * A[i]) // g\\n lca2 = lca // 2\\n ans = M // lca2 - M // lca\\n print(ans)\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.170212766,\n", + " 'diff': ['-import fractions',\n", + " '-N, M = list(map(int, input().split()))',\n", + " '-a = list(map(int, input().split()))',\n", + " '-lcm = a[0]',\n", + " '-for i in range(1, N):',\n", + " '- g = fractions.gcd(lcm, a[i])',\n", + " '- lcm = lcm * a[i] // g',\n", + " '-g = a[0]',\n", + " '-for i in range(N):',\n", + " '- g = fractions.gcd(g, a[i])',\n", + " '-for i in range(N):',\n", + " '- if (a[i] // g) % 2 == 0:',\n", + " '- lcm = 0',\n", + " '- break',\n", + " '-ans = 0',\n", + " '-l = lcm // 2',\n", + " '-if l:',\n", + " '- ans = (M // l) - (M // (l + l))',\n", + " '-print(ans)',\n", + " '+',\n", + " '+',\n", + " '+def I():',\n", + " '+ return int(eval(input()))',\n", + " '+',\n", + " '+',\n", + " '+def MI():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+def LI():',\n", + " '+ return list(map(int, input().split()))',\n", + " '+',\n", + " '+',\n", + " '+\"\"\"',\n", + " '+2X = ak * (2p+1)',\n", + " '+基本的には最小公倍数/2を基本とし，これの奇数倍か．',\n", + " '+X = (ak//2) * (2p+1)',\n", + " '+と書ける．第二項が奇数なので，各akが2で割り切れれう回数が同じでなければならない',\n", + " '+a=[2,4]だと無理',\n", + " '+\"\"\"',\n", + " '+',\n", + " '+',\n", + " '+def main():',\n", + " '+ from math import gcd',\n", + " '+',\n", + " '+ N, M = MI()',\n", + " '+ A = LI()',\n", + " '+',\n", + " '+ def count(X):',\n", + " '+ cnt = 0',\n", + " '+ while X % 2 == 0:',\n", + " '+ cnt += 1',\n", + " '+ X = X // 2',\n", + " '+ return cnt',\n", + " '+',\n", + " '+ C = count(A[0])',\n", + " '+ for i in range(1, N):',\n", + " '+ if count(A[i]) != C:',\n", + " '+ print((0))',\n", + " '+ exit()',\n", + " '+ lca = 1',\n", + " '+ for i in range(N):',\n", + " '+ g = gcd(lca, A[i])',\n", + " '+ lca = (lca * A[i]) // g',\n", + " '+ lca2 = lca // 2',\n", + " '+ ans = M // lca2 - M // lca',\n", + " '+ print(ans)',\n", + " '+',\n", + " '+',\n", + " '+main()'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.4226276507,\n", + " 'measured_runtime_v1': 0.3026728499,\n", + " 'runtime_lift': 1.396318338,\n", + " 'key': ['s444255215', 's830443344']},\n", + " {'user_id': 'u402629484',\n", + " 'problem_id': 'p02702',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's641082621',\n", + " 'submission_id_v1': 's046213774',\n", + " 'cpu_time_v0': 1692,\n", + " 'cpu_time_v1': 128,\n", + " 'memory_v0': 75572,\n", + " 'memory_v1': 24100,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 92.43,\n", + " 'input': \"import sys\\n\\nsys.setrecursionlimit(1000000000)\\n\\nimport math\\n\\nfrom math import gcd\\n\\ndef lcm(a, b): return a * b // gcd(a, b)\\n\\nfrom itertools import count, permutations, chain\\n\\nfrom functools import lru_cache\\n\\nfrom collections import deque, defaultdict\\n\\nfrom pprint import pprint\\n\\nii = lambda: int(eval(input()))\\n\\nmis = lambda: list(map(int, input().split()))\\n\\nlmis = lambda: list(mis())\\n\\nINF = float('inf')\\n\\nN1097 = 10**9 + 7\\n\\n\\n\\ndef meg(f, ok, ng):\\n\\n while abs(ok-ng)>1:\\n\\n mid = (ok+ng)//2\\n\\n if f(mid):\\n\\n ok=mid\\n\\n else:\\n\\n ng=mid\\n\\n return ok\\n\\n\\n\\ndef get_inv(n, modp):\\n\\n return pow(n, modp-2, modp)\\n\\n\\n\\ndef factorials_list(n, modp): # 10**6\\n\\n fs = [1]\\n\\n for i in range(1, n+1):\\n\\n fs.append(fs[-1] * i % modp)\\n\\n return fs\\n\\n\\n\\ndef invs_list(n, fs, modp): # 10**6\\n\\n invs = [get_inv(fs[-1], modp)]\\n\\n for i in range(n, 1-1, -1):\\n\\n invs.append(invs[-1] * i % modp)\\n\\n invs.reverse()\\n\\n return invs\\n\\n\\n\\ndef comb(n, k, modp):\\n\\n num = 1\\n\\n for i in range(n, n-k, -1):\\n\\n num = num * i % modp\\n\\n den = 1\\n\\n for i in range(2, k+1):\\n\\n den = den * i % modp\\n\\n return num * get_inv(den, modp) % modp\\n\\n\\n\\ndef comb_from_list(n, k, modp, fs, invs): \\n\\n return fs[n] * invs[n-k] * invs[k] % modp\\n\\n\\n\\n#\\n\\n\\n\\nclass UnionFindEx:\\n\\n def __init__(self, size):\\n\\n #正なら根の番号、負ならグループサイズ\\n\\n self.roots = [-1] * size\\n\\n def getRootID(self, i):\\n\\n r = self.roots[i]\\n\\n if r < 0: #負なら根\\n\\n return i\\n\\n else:\\n\\n r = self.getRootID(r)\\n\\n self.roots[i] = r\\n\\n return r\\n\\n def getGroupSize(self, i):\\n\\n return -self.roots[self.getRootID(i)]\\n\\n def connect(self, i, j):\\n\\n r1, r2 = self.getRootID(i), self.getRootID(j)\\n\\n if r1 == r2:\\n\\n return False\\n\\n if self.getGroupSize(r1) < self.getGroupSize(r2):\\n\\n r1, r2 = r2, r1\\n\\n self.roots[r1] += self.roots[r2] #サイズ更新\\n\\n self.roots[r2] = r1\\n\\n return True\\n\\n\\n\\nYes = 'Yes'\\n\\nNo = 'No'\\n\\n\\n\\n\\n\\ndef main():\\n\\n S = eval(input())\\n\\n d = [0]*2019\\n\\n dn = [0]*2019\\n\\n ans = 0\\n\\n for s in S:\\n\\n sn = int(s)\\n\\n dn[sn] += 1\\n\\n for i in range(2019):\\n\\n dn[(i*10+sn)%2019] += d[i]\\n\\n d, dn = dn, d\\n\\n for i in range(2019):\\n\\n dn[i] = 0\\n\\n ans += d[0]\\n\\n print(ans)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nmain()\\n\\n\\n\",\n", + " 'target': '\\'\\'\\'\\n\\n[point 1]\\n\\n1817181712114 の部分 \"18171\"について考える...\\n\\n\\n\\n 181710000 / 10000 ≡ 0 (MOD 2019) ならば、2019の倍数\\n\\n 181710000 ≡ 0 (MOD 2019) でよい\\n\\n\\n\\n[point 2]\\n\\n 181710000\\n\\n =\\n\\n 181712114\\n\\n -\\n\\n 2114\\n\\n\\n\\n なので、特定区間の値 は 累積和の差 から瞬時に求められる。\\n\\n さらに、181710000 ≡ 0 (MOD 2019) を考えると、\\n\\n\\n\\n 0 ≡ 181712114 - 2114\\n\\n → 181712114 ≡ 2114\\n\\n\\n\\n となる。\\n\\n 結局の所、MOD2019において合同な累積和のペアの数の数え上げ。\\n\\n\\'\\'\\'\\n\\n\\n\\nfrom collections import defaultdict\\n\\n\\n\\ndef gen_10exp_mod(n, mod):\\n\\n a = 1\\n\\n yield a\\n\\n for _ in range(1, n):\\n\\n a = (a*10) % mod\\n\\n yield a\\n\\n\\n\\ndef main():\\n\\n MOD = 2019\\n\\n S = input()[::-1]\\n\\n # 桁ごとの実際の値を計算 (MOD)\\n\\n A = [int(s)*n % MOD for s, n in zip(S, gen_10exp_mod(len(S), MOD))]\\n\\n # 累積和を計算\\n\\n ACC = [0]\\n\\n for a in A:\\n\\n ACC.append((ACC[-1] + a) % MOD)\\n\\n # ペア数え上げ\\n\\n d = defaultdict(int)\\n\\n for acc in ACC:\\n\\n d[acc] += 1\\n\\n ans = sum(v*(v-1)//2 for v in list(d.values()))\\n\\n print(ans)\\n\\n\\n\\n\\n\\nmain()\\n',\n", + " 'code_v0_loc': 105,\n", + " 'code_v1_loc': 51,\n", + " 'code_v0_num_chars': 2384,\n", + " 'code_v1_num_chars': 956,\n", + " 'code_v0_no_empty_lines': 'import sys\\n\\nsys.setrecursionlimit(1000000000)\\nimport math\\nfrom math import gcd\\n\\n\\ndef lcm(a, b):\\n return a * b // gcd(a, b)\\n\\n\\nfrom itertools import count, permutations, chain\\nfrom functools import lru_cache\\nfrom collections import deque, defaultdict\\nfrom pprint import pprint\\n\\nii = lambda: int(eval(input()))\\nmis = lambda: list(map(int, input().split()))\\nlmis = lambda: list(mis())\\nINF = float(\"inf\")\\nN1097 = 10**9 + 7\\n\\n\\ndef meg(f, ok, ng):\\n while abs(ok - ng) > 1:\\n mid = (ok + ng) // 2\\n if f(mid):\\n ok = mid\\n else:\\n ng = mid\\n return ok\\n\\n\\ndef get_inv(n, modp):\\n return pow(n, modp - 2, modp)\\n\\n\\ndef factorials_list(n, modp): # 10**6\\n fs = [1]\\n for i in range(1, n + 1):\\n fs.append(fs[-1] * i % modp)\\n return fs\\n\\n\\ndef invs_list(n, fs, modp): # 10**6\\n invs = [get_inv(fs[-1], modp)]\\n for i in range(n, 1 - 1, -1):\\n invs.append(invs[-1] * i % modp)\\n invs.reverse()\\n return invs\\n\\n\\ndef comb(n, k, modp):\\n num = 1\\n for i in range(n, n - k, -1):\\n num = num * i % modp\\n den = 1\\n for i in range(2, k + 1):\\n den = den * i % modp\\n return num * get_inv(den, modp) % modp\\n\\n\\ndef comb_from_list(n, k, modp, fs, invs):\\n return fs[n] * invs[n - k] * invs[k] % modp\\n\\n\\n#\\nclass UnionFindEx:\\n def __init__(self, size):\\n # 正なら根の番号、負ならグループサイズ\\n self.roots = [-1] * size\\n\\n def getRootID(self, i):\\n r = self.roots[i]\\n if r < 0: # 負なら根\\n return i\\n else:\\n r = self.getRootID(r)\\n self.roots[i] = r\\n return r\\n\\n def getGroupSize(self, i):\\n return -self.roots[self.getRootID(i)]\\n\\n def connect(self, i, j):\\n r1, r2 = self.getRootID(i), self.getRootID(j)\\n if r1 == r2:\\n return False\\n if self.getGroupSize(r1) < self.getGroupSize(r2):\\n r1, r2 = r2, r1\\n self.roots[r1] += self.roots[r2] # サイズ更新\\n self.roots[r2] = r1\\n return True\\n\\n\\nYes = \"Yes\"\\nNo = \"No\"\\n\\n\\ndef main():\\n S = eval(input())\\n d = [0] * 2019\\n dn = [0] * 2019\\n ans = 0\\n for s in S:\\n sn = int(s)\\n dn[sn] += 1\\n for i in range(2019):\\n dn[(i * 10 + sn) % 2019] += d[i]\\n d, dn = dn, d\\n for i in range(2019):\\n dn[i] = 0\\n ans += d[0]\\n print(ans)\\n\\n\\nmain()\\n',\n", + " 'code_v1_no_empty_lines': '\"\"\"\\n[point 1]\\n1817181712114 の部分 \"18171\"について考える...\\n 181710000 / 10000 ≡ 0 (MOD 2019) ならば、2019の倍数\\n 181710000 ≡ 0 (MOD 2019) でよい\\n[point 2]\\n 181710000\\n =\\n 181712114\\n -\\n 2114\\n なので、特定区間の値 は 累積和の差 から瞬時に求められる。\\n さらに、181710000 ≡ 0 (MOD 2019) を考えると、\\n 0 ≡ 181712114 - 2114\\n → 181712114 ≡ 2114\\n となる。\\n 結局の所、MOD2019において合同な累積和のペアの数の数え上げ。\\n\"\"\"\\nfrom collections import defaultdict\\n\\n\\ndef gen_10exp_mod(n, mod):\\n a = 1\\n yield a\\n for _ in range(1, n):\\n a = (a * 10) % mod\\n yield a\\n\\n\\ndef main():\\n MOD = 2019\\n S = input()[::-1]\\n # 桁ごとの実際の値を計算 (MOD)\\n A = [int(s) * n % MOD for s, n in zip(S, gen_10exp_mod(len(S), MOD))]\\n # 累積和を計算\\n ACC = [0]\\n for a in A:\\n ACC.append((ACC[-1] + a) % MOD)\\n # ペア数え上げ\\n d = defaultdict(int)\\n for acc in ACC:\\n d[acc] += 1\\n ans = sum(v * (v - 1) // 2 for v in list(d.values()))\\n print(ans)\\n\\n\\nmain()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 51.4285714286,\n", + " 'diff': ['-import sys',\n", + " '-',\n", + " '-sys.setrecursionlimit(1000000000)',\n", + " '-import math',\n", + " '-from math import gcd',\n", + " '+\"\"\"',\n", + " '+[point 1]',\n", + " '+1817181712114 の部分 \"18171\"について考える...',\n", + " '+ 181710000 / 10000 ≡ 0 (MOD 2019) ならば、2019の倍数',\n", + " '+ 181710000 ≡ 0 (MOD 2019) でよい',\n", + " '+[point 2]',\n", + " '+ 181710000',\n", + " '+ =',\n", + " '+ 181712114',\n", + " '+ -',\n", + " '+ 2114',\n", + " '+ なので、特定区間の値 は 累積和の差 から瞬時に求められる。',\n", + " '+ さらに、181710000 ≡ 0 (MOD 2019) を考えると、',\n", + " '+ 0 ≡ 181712114 - 2114',\n", + " '+ → 181712114 ≡ 2114',\n", + " '+ となる。',\n", + " '+ 結局の所、MOD2019において合同な累積和のペアの数の数え上げ。',\n", + " '+\"\"\"',\n", + " '+from collections import defaultdict',\n", + " '-def lcm(a, b):',\n", + " '- return a * b // gcd(a, b)',\n", + " '-',\n", + " '-',\n", + " '-from itertools import count, permutations, chain',\n", + " '-from functools import lru_cache',\n", + " '-from collections import deque, defaultdict',\n", + " '-from pprint import pprint',\n", + " '-',\n", + " '-ii = lambda: int(eval(input()))',\n", + " '-mis = lambda: list(map(int, input().split()))',\n", + " '-lmis = lambda: list(mis())',\n", + " '-INF = float(\"inf\")',\n", + " '-N1097 = 10**9 + 7',\n", + " '-',\n", + " '-',\n", + " '-def meg(f, ok, ng):',\n", + " '- while abs(ok - ng) > 1:',\n", + " '- mid = (ok + ng) // 2',\n", + " '- if f(mid):',\n", + " '- ok = mid',\n", + " '- else:',\n", + " '- ng = mid',\n", + " '- return ok',\n", + " '-',\n", + " '-',\n", + " '-def get_inv(n, modp):',\n", + " '- return pow(n, modp - 2, modp)',\n", + " '-',\n", + " '-',\n", + " '-def factorials_list(n, modp): # 10**6',\n", + " '- fs = [1]',\n", + " '- for i in range(1, n + 1):',\n", + " '- fs.append(fs[-1] * i % modp)',\n", + " '- return fs',\n", + " '-',\n", + " '-',\n", + " '-def invs_list(n, fs, modp): # 10**6',\n", + " '- invs = [get_inv(fs[-1], modp)]',\n", + " '- for i in range(n, 1 - 1, -1):',\n", + " '- invs.append(invs[-1] * i % modp)',\n", + " '- invs.reverse()',\n", + " '- return invs',\n", + " '-',\n", + " '-',\n", + " '-def comb(n, k, modp):',\n", + " '- num = 1',\n", + " '- for i in range(n, n - k, -1):',\n", + " '- num = num * i % modp',\n", + " '- den = 1',\n", + " '- for i in range(2, k + 1):',\n", + " '- den = den * i % modp',\n", + " '- return num * get_inv(den, modp) % modp',\n", + " '-',\n", + " '-',\n", + " '-def comb_from_list(n, k, modp, fs, invs):',\n", + " '- return fs[n] * invs[n - k] * invs[k] % modp',\n", + " '-',\n", + " '-',\n", + " '-#',\n", + " '-class UnionFindEx:',\n", + " '- def __init__(self, size):',\n", + " '- # 正なら根の番号、負ならグループサイズ',\n", + " '- self.roots = [-1] * size',\n", + " '-',\n", + " '- def getRootID(self, i):',\n", + " '- r = self.roots[i]',\n", + " '- if r < 0: # 負なら根',\n", + " '- return i',\n", + " '- else:',\n", + " '- r = self.getRootID(r)',\n", + " '- self.roots[i] = r',\n", + " '- return r',\n", + " '-',\n", + " '- def getGroupSize(self, i):',\n", + " '- return -self.roots[self.getRootID(i)]',\n", + " '-',\n", + " '- def connect(self, i, j):',\n", + " '- r1, r2 = self.getRootID(i), self.getRootID(j)',\n", + " '- if r1 == r2:',\n", + " '- return False',\n", + " '- if self.getGroupSize(r1) < self.getGroupSize(r2):',\n", + " '- r1, r2 = r2, r1',\n", + " '- self.roots[r1] += self.roots[r2] # サイズ更新',\n", + " '- self.roots[r2] = r1',\n", + " '- return True',\n", + " '-',\n", + " '-',\n", + " '-Yes = \"Yes\"',\n", + " '-No = \"No\"',\n", + " '+def gen_10exp_mod(n, mod):',\n", + " '+ a = 1',\n", + " '+ yield a',\n", + " '+ for _ in range(1, n):',\n", + " '+ a = (a * 10) % mod',\n", + " '+ yield a',\n", + " '- S = eval(input())',\n", + " '- d = [0] * 2019',\n", + " '- dn = [0] * 2019',\n", + " '- ans = 0',\n", + " '- for s in S:',\n", + " '- sn = int(s)',\n", + " '- dn[sn] += 1',\n", + " '- for i in range(2019):',\n", + " '- dn[(i * 10 + sn) % 2019] += d[i]',\n", + " '- d, dn = dn, d',\n", + " '- for i in range(2019):',\n", + " '- dn[i] = 0',\n", + " '- ans += d[0]',\n", + " '+ MOD = 2019',\n", + " '+ S = input()[::-1]',\n", + " '+ # 桁ごとの実際の値を計算 (MOD)',\n", + " '+ A = [int(s) * n % MOD for s, n in zip(S, gen_10exp_mod(len(S), MOD))]',\n", + " '+ # 累積和を計算',\n", + " '+ ACC = [0]',\n", + " '+ for a in A:',\n", + " '+ ACC.append((ACC[-1] + a) % MOD)',\n", + " '+ # ペア数え上げ',\n", + " '+ d = defaultdict(int)',\n", + " '+ for acc in ACC:',\n", + " '+ d[acc] += 1',\n", + " '+ ans = sum(v * (v - 1) // 2 for v in list(d.values()))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3964794042,\n", + " 'measured_runtime_v1': 0.2964991529,\n", + " 'runtime_lift': 1.3372024855,\n", + " 'key': ['s641082621', 's046213774']},\n", + " {'user_id': 'u161164709',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's764735536',\n", + " 'submission_id_v1': 's736916531',\n", + " 'cpu_time_v0': 121,\n", + " 'cpu_time_v1': 27,\n", + " 'memory_v0': 9164,\n", + " 'memory_v1': 9180,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 77.69,\n", + " 'input': 'from math import factorial\\n\\n\\n\\ns = int(eval(input()))\\n\\nmod = pow(10, 9) + 7\\n\\n\\n\\n\\n\\ndef nCr(n, r):\\n\\n return int(factorial(n) // factorial(r) // factorial (n - r) % mod)\\n\\n\\n\\nans = 0\\n\\nseq_len = s // 3\\n\\n\\n\\nfor i in range(1, seq_len + 1):\\n\\n ans += nCr(s - 3 * i + (i - 1), i - 1)\\n\\n\\n\\nprint((ans % mod))',\n", + " 'target': '# 動的計画法による解法\\n\\n\\n\\ns = int(eval(input()))\\n\\nmod = pow(10, 9) + 7\\n\\n\\n\\nA = [0] * (s + 1)\\n\\n\\n\\nif s >= 3:\\n\\n A[3] = 1\\n\\n\\n\\nfor i in range(4, s + 1):\\n\\n A[i] = (A[i - 3] + A[i - 1]) % mod\\n\\n\\n\\nprint((A[s]))',\n", + " 'code_v0_loc': 16,\n", + " 'code_v1_loc': 14,\n", + " 'code_v0_num_chars': 289,\n", + " 'code_v1_num_chars': 187,\n", + " 'code_v0_no_empty_lines': 'from math import factorial\\n\\ns = int(eval(input()))\\nmod = pow(10, 9) + 7\\n\\n\\ndef nCr(n, r):\\n return int(factorial(n) // factorial(r) // factorial(n - r) % mod)\\n\\n\\nans = 0\\nseq_len = s // 3\\nfor i in range(1, seq_len + 1):\\n ans += nCr(s - 3 * i + (i - 1), i - 1)\\nprint((ans % mod))\\n',\n", + " 'code_v1_no_empty_lines': '# 動的計画法による解法\\ns = int(eval(input()))\\nmod = pow(10, 9) + 7\\nA = [0] * (s + 1)\\nif s >= 3:\\n A[3] = 1\\nfor i in range(4, s + 1):\\n A[i] = (A[i - 3] + A[i - 1]) % mod\\nprint((A[s]))\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 12.5,\n", + " 'diff': ['-from math import factorial',\n", + " '-',\n", + " '+# 動的計画法による解法',\n", + " '-',\n", + " '-',\n", + " '-def nCr(n, r):',\n", + " '- return int(factorial(n) // factorial(r) // factorial(n - r) % mod)',\n", + " '-',\n", + " '-',\n", + " '-ans = 0',\n", + " '-seq_len = s // 3',\n", + " '-for i in range(1, seq_len + 1):',\n", + " '- ans += nCr(s - 3 * i + (i - 1), i - 1)',\n", + " '-print((ans % mod))',\n", + " '+A = [0] * (s + 1)',\n", + " '+if s >= 3:',\n", + " '+ A[3] = 1',\n", + " '+for i in range(4, s + 1):',\n", + " '+ A[i] = (A[i - 3] + A[i - 1]) % mod',\n", + " '+print((A[s]))'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3023663192,\n", + " 'measured_runtime_v1': 0.197884347,\n", + " 'runtime_lift': 1.5279951336,\n", + " 'key': ['s764735536', 's736916531']},\n", + " {'user_id': 'u503227287',\n", + " 'problem_id': 'p02555',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's596282425',\n", + " 'submission_id_v1': 's780625634',\n", + " 'cpu_time_v0': 177,\n", + " 'cpu_time_v1': 66,\n", + " 'memory_v0': 73480,\n", + " 'memory_v1': 64124,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 62.71,\n", + " 'input': 'from sys import stdin\\n\\nfrom math import factorial\\n\\n\\n\\n\\n\\ndef combinations_count(n, r):\\n\\n return factorial(n) // (factorial(n - r) * factorial(r))\\n\\n\\n\\n\\n\\ndef combinations_with_replacement_count(n, r):\\n\\n return combinations_count(n + r - 1, r)\\n\\n\\n\\n\\n\\ndef main():\\n\\n _in = [_.rstrip() for _ in stdin.readlines()]\\n\\n S = int(_in[0]) # type:int\\n\\n # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv\\n\\n min_ = 1\\n\\n max_ = S // 3\\n\\n ans = 0\\n\\n for i in range(min_, max_ + 1):\\n\\n mod = S - i * 3\\n\\n ans += combinations_with_replacement_count(mod + 1, i - 1) % (10**9 + 7)\\n\\n ans %= (10**9 + 7)\\n\\n # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'target': 'from sys import stdin\\n\\n\\n\\n\\n\\nclass ModComb():\\n\\n def __init__(self, n_max, mod):\\n\\n self.fac = None\\n\\n self.mod = mod\\n\\n self.make_fac_table(n_max)\\n\\n\\n\\n def make_fac_table(self, n_max):\\n\\n self.fac = [1] + [0] * n_max\\n\\n for i in range(1, n_max + 1):\\n\\n self.fac[i] = self.fac[i - 1] * i % self.mod\\n\\n\\n\\n def mod_comb(self, n, k):\\n\\n if n == 0 and k == 0:\\n\\n return 1\\n\\n elif n < k or k < 0:\\n\\n return 0\\n\\n else:\\n\\n return self.fac[n] * pow(self.fac[n - k], self.mod - 2, self.mod) * \\\\\\n\\n pow(self.fac[k], self.mod - 2, self.mod) % self.mod\\n\\n\\n\\n def mod_comb_with_rep(self, n, k):\\n\\n return self.mod_comb(n + k - 1, k)\\n\\n\\n\\n\\n\\ndef main():\\n\\n _in = [_.rstrip() for _ in stdin.readlines()]\\n\\n S = int(_in[0]) # type:int\\n\\n # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv\\n\\n ans = 0\\n\\n MOD = 10**9 + 7\\n\\n modcomb = ModComb(S + 1, MOD)\\n\\n min_ = 1\\n\\n max_ = S // 3\\n\\n for i in range(min_, max_ + 1):\\n\\n res = S - i * 3\\n\\n ans += modcomb.mod_comb_with_rep(res + 1, i - 1)\\n\\n ans %= MOD\\n\\n # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\\n\\n print(ans)\\n\\n\\n\\n\\n\\nif __name__ == \"__main__\":\\n\\n main()\\n',\n", + " 'code_v0_loc': 29,\n", + " 'code_v1_loc': 46,\n", + " 'code_v0_num_chars': 737,\n", + " 'code_v1_num_chars': 1252,\n", + " 'code_v0_no_empty_lines': 'from sys import stdin\\nfrom math import factorial\\n\\n\\ndef combinations_count(n, r):\\n return factorial(n) // (factorial(n - r) * factorial(r))\\n\\n\\ndef combinations_with_replacement_count(n, r):\\n return combinations_count(n + r - 1, r)\\n\\n\\ndef main():\\n _in = [_.rstrip() for _ in stdin.readlines()]\\n S = int(_in[0]) # type:int\\n # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv\\n min_ = 1\\n max_ = S // 3\\n ans = 0\\n for i in range(min_, max_ + 1):\\n mod = S - i * 3\\n ans += combinations_with_replacement_count(mod + 1, i - 1) % (10**9 + 7)\\n ans %= 10**9 + 7\\n # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_v1_no_empty_lines': 'from sys import stdin\\n\\n\\nclass ModComb:\\n def __init__(self, n_max, mod):\\n self.fac = None\\n self.mod = mod\\n self.make_fac_table(n_max)\\n\\n def make_fac_table(self, n_max):\\n self.fac = [1] + [0] * n_max\\n for i in range(1, n_max + 1):\\n self.fac[i] = self.fac[i - 1] * i % self.mod\\n\\n def mod_comb(self, n, k):\\n if n == 0 and k == 0:\\n return 1\\n elif n < k or k < 0:\\n return 0\\n else:\\n return (\\n self.fac[n]\\n * pow(self.fac[n - k], self.mod - 2, self.mod)\\n * pow(self.fac[k], self.mod - 2, self.mod)\\n % self.mod\\n )\\n\\n def mod_comb_with_rep(self, n, k):\\n return self.mod_comb(n + k - 1, k)\\n\\n\\ndef main():\\n _in = [_.rstrip() for _ in stdin.readlines()]\\n S = int(_in[0]) # type:int\\n # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv\\n ans = 0\\n MOD = 10**9 + 7\\n modcomb = ModComb(S + 1, MOD)\\n min_ = 1\\n max_ = S // 3\\n for i in range(min_, max_ + 1):\\n res = S - i * 3\\n ans += modcomb.mod_comb_with_rep(res + 1, i - 1)\\n ans %= MOD\\n # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\\n print(ans)\\n\\n\\nif __name__ == \"__main__\":\\n main()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 36.9565217391,\n", + " 'diff': ['-from math import factorial',\n", + " '-def combinations_count(n, r):',\n", + " '- return factorial(n) // (factorial(n - r) * factorial(r))',\n", + " '+class ModComb:',\n", + " '+ def __init__(self, n_max, mod):',\n", + " '+ self.fac = None',\n", + " '+ self.mod = mod',\n", + " '+ self.make_fac_table(n_max)',\n", + " '+ def make_fac_table(self, n_max):',\n", + " '+ self.fac = [1] + [0] * n_max',\n", + " '+ for i in range(1, n_max + 1):',\n", + " '+ self.fac[i] = self.fac[i - 1] * i % self.mod',\n", + " '-def combinations_with_replacement_count(n, r):',\n", + " '- return combinations_count(n + r - 1, r)',\n", + " '+ def mod_comb(self, n, k):',\n", + " '+ if n == 0 and k == 0:',\n", + " '+ return 1',\n", + " '+ elif n < k or k < 0:',\n", + " '+ return 0',\n", + " '+ else:',\n", + " '+ return (',\n", + " '+ self.fac[n]',\n", + " '+ * pow(self.fac[n - k], self.mod - 2, self.mod)',\n", + " '+ * pow(self.fac[k], self.mod - 2, self.mod)',\n", + " '+ % self.mod',\n", + " '+ )',\n", + " '+',\n", + " '+ def mod_comb_with_rep(self, n, k):',\n", + " '+ return self.mod_comb(n + k - 1, k)',\n", + " '+ ans = 0',\n", + " '+ MOD = 10**9 + 7',\n", + " '+ modcomb = ModComb(S + 1, MOD)',\n", + " '- ans = 0',\n", + " '- mod = S - i * 3',\n", + " '- ans += combinations_with_replacement_count(mod + 1, i - 1) % (10**9 + 7)',\n", + " '- ans %= 10**9 + 7',\n", + " '+ res = S - i * 3',\n", + " '+ ans += modcomb.mod_comb_with_rep(res + 1, i - 1)',\n", + " '+ ans %= MOD'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.1465539389,\n", + " 'measured_runtime_v1': 0.1122963901,\n", + " 'runtime_lift': 1.3050636693,\n", + " 'key': ['s596282425', 's780625634']},\n", + " {'user_id': 'u600065151',\n", + " 'problem_id': 'p02268',\n", + " 'language': 'python',\n", + " 'submission_id_v0': 's783851867',\n", + " 'submission_id_v1': 's366216704',\n", + " 'cpu_time_v0': 50,\n", + " 'cpu_time_v1': 40,\n", + " 'memory_v0': 18684,\n", + " 'memory_v1': 20588,\n", + " 'status_v0': 'Accepted',\n", + " 'status_v1': 'Accepted',\n", + " 'improvement_frac': 20.0,\n", + " 'input': 'def binarySearch():\\n\\n n = int(eval(input()))\\n\\n S = set(map(int, input().split()))\\n\\n q = int(eval(input()))\\n\\n T = set(map(int, input().split()))\\n\\n print((len(S.intersection(T))))\\n\\n \\n\\n\\n\\nbinarySearch()',\n", + " 'target': 'def binarySearch():\\n\\n n = int(eval(input()))\\n\\n S = set(input().split())\\n\\n q = int(eval(input()))\\n\\n T = set(input().split())\\n\\n print((len(S.intersection(T))))\\n\\n \\n\\n\\n\\nbinarySearch()',\n", + " 'code_v0_loc': 9,\n", + " 'code_v1_loc': 9,\n", + " 'code_v0_num_chars': 202,\n", + " 'code_v1_num_chars': 182,\n", + " 'code_v0_no_empty_lines': 'def binarySearch():\\n n = int(eval(input()))\\n S = set(map(int, input().split()))\\n q = int(eval(input()))\\n T = set(map(int, input().split()))\\n print((len(S.intersection(T))))\\n\\n\\nbinarySearch()\\n',\n", + " 'code_v1_no_empty_lines': 'def binarySearch():\\n n = int(eval(input()))\\n S = set(input().split())\\n q = int(eval(input()))\\n T = set(input().split())\\n print((len(S.intersection(T))))\\n\\n\\nbinarySearch()\\n',\n", + " 'code_same': False,\n", + " 'relative_loc_diff_percent': 0.0,\n", + " 'diff': ['- S = set(map(int, input().split()))',\n", + " '+ S = set(input().split())',\n", + " '- T = set(map(int, input().split()))',\n", + " '+ T = set(input().split())'],\n", + " 'diff_only_import_comment': False,\n", + " 'measured_runtime_v0': 0.3310329242,\n", + " 'measured_runtime_v1': 0.2247743328,\n", + " 'runtime_lift': 1.4727345427,\n", + " 'key': ['s783851867', 's366216704']}]" + ] + }, + "execution_count": 11, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "import pandas as pd\n", + "import jsonlines\n", + "\n", + "chunksize = 1000 \n", + "file_path = \"../processed_data/python/train_split.jsonl\"\n", + "data = []\n", + "with jsonlines.open(file_path) as reader:\n", + " for obj in reader:\n", + " data.append(obj)\n", + "data" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + " user_id problem_id language submission_id_v0 submission_id_v1 \\\n", + "0 u824144553 p02647 python s947547146 s829816575 \n", + "1 u864197622 p02599 python s844952454 s272405166 \n", + "2 u017415492 p02690 python s441153846 s191790319 \n", + "3 u378157957 p03796 python s064171222 s323999427 \n", + "4 u803617136 p03325 python s116805601 s513357045 \n", + "\n", + " cpu_time_v0 cpu_time_v1 memory_v0 memory_v1 status_v0 ... \\\n", + "0 897 312 129220 169716 Accepted ... \n", + "1 1464 1163 208840 175860 Accepted ... \n", + "2 115 38 28112 9176 Accepted ... \n", + "3 230 58 3984 2940 Accepted ... \n", + "4 184 27 40560 4148 Accepted ... \n", + "\n", + " code_v0_no_empty_lines \\\n", + "0 import copy\\nfrom functools import lru_cache\\n... \n", + "1 NN = 19\\nXX = [0] * (2 ** (NN + 1) - 1)\\n\\n\\nd... \n", + "2 import numpy as np\\n\\nx = int(eval(input()))\\n... \n", + "3 import math\\n\\nN = int(eval(input()))\\nnum = m... \n", + "4 N = int(eval(input()))\\nseq = list(map(int, in... \n", + "\n", + " code_v1_no_empty_lines code_same \\\n", + "0 import copy\\nfrom functools import lru_cache\\n... False \n", + "1 ##### https://atcoder.jp/contests/abc174/submi... False \n", + "2 x = int(eval(input()))\\nflag = True\\nfor i in ... False \n", + "3 N = int(eval(input()))\\nFACTOR = 10**9 + 7\\nnu... False \n", + "4 n = int(eval(input()))\\na = list(map(int, inpu... False \n", + "\n", + " relative_loc_diff_percent \\\n", + "0 28.846154 \n", + "1 53.846154 \n", + "2 66.666667 \n", + "3 27.272727 \n", + "4 50.000000 \n", + "\n", + " diff \\\n", + "0 [-import numpy as np, -from numba import njit,... \n", + "1 [-NN = 19, -XX = [0] * (2 ** (NN + 1) - 1), +#... \n", + "2 [-import numpy as np, -, -# ａ⁵－ｂ⁵＝(ａ－ｂ)(ａ⁴＋ａ³ｂ... \n", + "3 [-import math, -, -num = math.factorial(N), -k... \n", + "4 [-N = int(eval(input())), -seq = list(map(int,... \n", + "\n", + " diff_only_import_comment measured_runtime_v0 measured_runtime_v1 \\\n", + "0 False 1.355173 0.215763 \n", + "1 False 0.389271 0.218414 \n", + "2 False 1.419297 0.006882 \n", + "3 False 0.657900 0.376834 \n", + "4 False 0.157480 0.006185 \n", + "\n", + " runtime_lift key \n", + "0 6.280828 [s947547146, s829816575] \n", + "1 1.782267 [s844952454, s272405166] \n", + "2 206.236071 [s441153846, s191790319] \n", + "3 1.745859 [s064171222, s323999427] \n", + "4 25.462591 [s116805601, s513357045] \n", + "\n", + "[5 rows x 28 columns]\n" + ] + } + ], + "source": [ + "# list to df\n", + "df = pd.DataFrame(data)\n", + "print(df.head())" + ] + }, + { + "cell_type": "code", + "execution_count": 19, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "\n", + "RangeIndex: 800 entries, 0 to 799\n", + "Data columns (total 28 columns):\n", + " # Column Non-Null Count Dtype \n", + "--- ------ -------------- ----- \n", + " 0 user_id 800 non-null object \n", + " 1 problem_id 800 non-null object \n", + " 2 language 800 non-null object \n", + " 3 submission_id_v0 800 non-null object \n", + " 4 submission_id_v1 800 non-null object \n", + " 5 cpu_time_v0 800 non-null int64 \n", + " 6 cpu_time_v1 800 non-null int64 \n", + " 7 memory_v0 800 non-null int64 \n", + " 8 memory_v1 800 non-null int64 \n", + " 9 status_v0 800 non-null object \n", + " 10 status_v1 800 non-null object \n", + " 11 improvement_frac 800 non-null float64\n", + " 12 input 800 non-null object \n", + " 13 target 800 non-null object \n", + " 14 code_v0_loc 800 non-null int64 \n", + " 15 code_v1_loc 800 non-null int64 \n", + " 16 code_v0_num_chars 800 non-null int64 \n", + " 17 code_v1_num_chars 800 non-null int64 \n", + " 18 code_v0_no_empty_lines 800 non-null object \n", + " 19 code_v1_no_empty_lines 800 non-null object \n", + " 20 code_same 800 non-null bool \n", + " 21 relative_loc_diff_percent 800 non-null float64\n", + " 22 diff 800 non-null object \n", + " 23 diff_only_import_comment 800 non-null bool \n", + " 24 measured_runtime_v0 800 non-null float64\n", + " 25 measured_runtime_v1 800 non-null float64\n", + " 26 runtime_lift 800 non-null float64\n", + " 27 key 800 non-null object \n", + "dtypes: bool(2), float64(5), int64(8), object(13)\n", + "memory usage: 164.2+ KB\n" + ] + } + ], + "source": [ + "# Get a summary of the DataFrame\n", + "df.info()\n" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + " cpu_time_v0 cpu_time_v1 memory_v0 memory_v1 \\\n", + "count 800.000000 800.000000 8.000000e+02 800.000000 \n", + "mean 513.725000 267.905000 3.350826e+04 26973.925000 \n", + "std 1641.551466 1286.887855 5.940300e+04 51187.957421 \n", + "min 12.000000 10.000000 2.572000e+03 2568.000000 \n", + "25% 118.000000 26.000000 5.606000e+03 3064.000000 \n", + "50% 231.000000 83.000000 1.410200e+04 9128.000000 \n", + "75% 568.250000 232.500000 3.903200e+04 32047.000000 \n", + "max 32130.000000 27750.000000 1.000052e+06 915508.000000 \n", + "\n", + " improvement_frac code_v0_loc code_v1_loc code_v0_num_chars \\\n", + "count 800.000000 800.000000 800.000000 800.000000 \n", + "mean 50.169500 21.096250 20.473750 464.036250 \n", + "std 28.730427 17.833452 17.831623 433.001204 \n", + "min 10.010000 1.000000 1.000000 14.000000 \n", + "25% 21.807500 10.000000 9.000000 200.000000 \n", + "50% 48.880000 16.000000 15.000000 312.500000 \n", + "75% 79.875000 26.250000 26.000000 566.250000 \n", + "max 98.620000 128.000000 115.000000 3630.000000 \n", + "\n", + " code_v1_num_chars relative_loc_diff_percent measured_runtime_v0 \\\n", + "count 800.000000 800.000000 800.000000 \n", + "mean 452.038750 22.423522 0.790640 \n", + "std 447.249035 18.773733 0.673797 \n", + "min 13.000000 0.000000 0.121831 \n", + "25% 177.000000 7.142857 0.296901 \n", + "50% 305.000000 18.090909 0.441960 \n", + "75% 572.500000 34.711538 1.345625 \n", + "max 3284.000000 69.230769 4.093387 \n", + "\n", + " measured_runtime_v1 runtime_lift \n", + "count 800.000000 800.000000 \n", + "mean 0.244775 7.515840 \n", + "std 0.222898 18.718699 \n", + "min 0.005612 1.250050 \n", + "25% 0.179697 1.436157 \n", + "50% 0.215849 2.261863 \n", + "75% 0.279489 6.432147 \n", + "max 3.075522 259.475973 \n" + ] + } + ], + "source": [ + "print(df.describe())" + ] + }, + { + "cell_type": "code", + "execution_count": 22, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "[{'original_code': 'from scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\nimport numpy as np\\nn = int(eval(input()))\\na = np.array([list(map(int, input().split())) for _ in range(n)])\\ng = csr_matrix(a)\\ndist = floyd_warshall(g)\\nif (dist == a).all():\\n sm = a.sum()\\n INF = 10**18 + 1\\n for i in range(n):\\n a[i, i] = INF\\n for u in range(n):\\n for v in range(n):\\n if u == v:\\n continue\\n mn = np.min(a[u] + a[v])\\n if mn == a[u, v]:\\n sm -= a[u, v]\\n ans = sm // 2\\n print(ans)\\nelse:\\n print((-1))',\n", + " 'optimized_code': '\\nfrom scipy.sparse.csgraph import floyd_warshall\\nimport numpy as np\\nn = int(input())\\na = np.array([list(map(int, input().split())) for _ in range(n)], dtype=np.int64)\\ng = csr_matrix(a)\\ndist, _ = floyd_warshall(g)\\nif np.all(dist == a):\\n sm = np.sum(a)\\n INF = 10 ** 18 + 1\\n np.fill_diagonal(a, INF)\\n a += a.T\\n ans = np.sum(np.min(a, axis=0)) // 2\\n print(ans)\\nelse:\\n print(-1)'},\n", + " {'original_code': 's = input()\\ns = s.split(\" \")\\na, b = int(s[0]), int(s[1])\\nif 1 <= a <= 9 and 1 <= b <= 9:\\n print(a * b)\\nelse:\\n print(-1)',\n", + " 'optimized_code': '\\ns = list(map(int, input().split()))\\nif 1 <= s[0] <= 9 and 1 <= s[1] <= 9:\\n print(s[0] * s[1])\\nelse:\\n print(-1)'},\n", + " {'original_code': 'from functools import reduce\\nk = int(eval(input()))\\ndef gcd(a, b):\\n while b:\\n a, b = b, a % b\\n return a\\ndef gcds(*nums):\\n return reduce(gcd, nums)\\nres = 0\\nfor a in range(1, k + 1):\\n for b in range(1, k + 1):\\n for c in range(1, k + 1):\\n res += gcds(a, b, c)\\nprint(res)',\n", + " 'optimized_code': \"\\nHere's the optimized code:\\nfrom functools import reduce\\nk = int(input())\\ndef gcd(a, b):\\n return a if b == 0 else gcd(b, a % b)\\ndef gcds(*nums):\\n return reduce(lambda a, b: a if not b else gcd(a, b), nums, 0)\\nN = 3\\nres = sum(gcds(*combinations(range(1, k + 1), r) for r in range(1, 4)))\\nprint(res)\\nThis optimized code uses itertools to generate combinations instead of nested loops, and memoizes the gcd function to avoid redundant calculations. Additionally, it uses a lambda function in reduce to make the function call more efficient.\"},\n", + " {'original_code': 'n = int(eval(input()))\\n(*a,) = list(map(int, input().split()))\\nret = 10**15\\ns = 0\\nt = sum(a)\\na.pop() \\nfor x in a:\\n s += x\\n t -= x\\n ret = min(ret, abs(s - t))\\nprint(ret)',\n", + " 'optimized_code': \"\\nHere's the optimized version:\\nn = int(input())\\na = list(map(int, input().split()))[:-1]\\nret = max(abs(sum(a) - sum(a[:i]) - sum(a[i+1:])), 0) \\\\\\n for i in range(len(a))\\nprint(ret)\\nExplanation:\\n- We can remove the initial conversion of the input string to an integer using `int(input())` because `map` already applies the `int` function to each element of the input list.\\n- We don't need to store the sum of all elements in a separate variable since we can calculate it repeatedly as the difference between the current sum and the sum of the subarray ending at the current index.\\n- We can also remove the initial assignment of `ret` to a large number since we will be calculating the minimum absolute difference, so the initial value can be 0.\\n- We can use a `for` loop with list comprehension to calculate the differences for all subarrays in a single line, and then take the maximum of those differences.\\n- We can also remove the unnecessary assignment and use of `s` and `t` variables.\\n- Lastly, we don't need to call the `pop()` method since we don't need the last element of the list. We can simply slice the list to exclude it.\"},\n", + " {'original_code': 'from math import factorial\\nmod = 10**9 + 7\\nn = int(eval(input()))\\nans = factorial(n)\\nprint((ans % mod))',\n", + " 'optimized_code': \"\\nHere's the optimized code using memoization technique to store and reuse factorial values:\\n```python\\nmod = 10**9 + 7\\nfact = {1: 1}\\ndef factorial(n):\\n if n not in fact:\\n fact[n] = (fact[n-1] if n > 1 else 1) * (10**9 + 7) % mod\\n fact[n] %= mod\\n return fact[n]\\nn = int(input())\\nprint(factorial(n))\\n```\\nThis optimized code uses a dictionary to store previously computed factorial values and reuses them to avoid repeated computation, which significantly improves the efficiency.\"},\n", + " {'original_code': 'from numpy import cumsum\\nN = int(eval(input()))\\nS = eval(input())\\nss = S.replace(\"#\", \"1\").replace(\".\", \"0\")\\n(*ls,) = list(map(int, ss))\\ncum_ls = cumsum(ls)\\nfirst_black = -1\\nlast_black = N\\nfor i in range(N):\\n if S[i] == \"#\":\\n first_black = i\\n break\\nfor i in reversed(list(range(N))):\\n if S[i] == \"#\":\\n last_black = i\\n else:\\n break\\nif first_black == -1:\\n print((0))\\nelse:\\n mans = 10**10\\n for i in range(N):\\n mans = min(mans, cum_ls[i] + (N - (i + 1) - (cum_ls[-1] - cum_ls[i])))\\n ans = min(\\n S[first_black:].count(\".\"),\\n S[first_black:].count(\"#\"),\\n S[:last_black].count(\"#\"),\\n mans,\\n )\\n print(ans)',\n", + " 'optimized_code': '\\n\\nHere\\'s the optimized code:\\n\\n```python\\nimport numpy as np\\nN = int(input())\\nS = input().replace(\"#\", \"1\").replace(\".\", \"0\")\\ncumsum_S = np.cumsum(list(map(int, S)))\\nfirst_black_index = np.where(S == \"#\")[0][0]\\nlast_black_index = np.where(S == \"#\")[-1]\\nif first_black_index == -1:\\n print(0)\\nelse:\\n manhattan_dist = np.min(\\n np.cumsum(np.array([1 if S[i] == \"#\" else 0 for i in range(N)]))\\n + (N - (np.where(np.array(S) == \"#\")[0] +'},\n", + " {'original_code': 'N = int(eval(input()))\\nans = 0\\nfor i in range(1, N + 1):\\n if len(str(i)) % 2 == 1:\\n ans += 1\\nprint(ans)',\n", + " 'optimized_code': '\\nHere is the optimized code:\\nN = int(input())\\nans = sum(int(digit) % 2 == 1 for digit in str(N))'},\n", + " {'original_code': 'N = int(eval(input()))\\ndp = [[0 for i in range(3)] for j in range(N + 1)]\\nfor i in range(N):\\n a, b, c = list(map(int, input().split()))\\n dp[i + 1][0] = max(dp[i][1] + a, dp[i][2] + a)\\n dp[i + 1][1] = max(dp[i][0] + b, dp[i][2] + b)\\n dp[i + 1][2] = max(dp[i][1] + c, dp[i][0] + c)\\nprint((max(dp[N])))',\n", + " 'optimized_code': \"\\nHere's the optimized code using dynamic programming:\\nN = int(input())\\ndp = [[0] * 3 for _ in range(N + 1)]\\nfor i in range(1, N + 1):\\n a, b, c = map(int, input().split())\\n dp[i][0] = max(dp[i - 1][1] + a, dp[i - 1][2] + a)\\n dp[i][1] = max(dp[i - 1][0] + b, dp[i - 1][2] + b)\\n dp[i][2] = max(dp[i - 1][1] + c, dp[i - 1][0] + c)\\nprint(max(dp[-1]))\"},\n", + " {'original_code': 'n = int(eval(input()))\\na = list(map(int, input().split()))\\ndp = [0 for j in range(n)]\\ndp[0] = 1000\\nfor i in range(n):\\n ai = a[i]\\n m = dp[i]\\n s = m // ai\\n for j in range(i + 1, n):\\n dp[j] = max(dp[j], m + s * (a[j] - ai))\\n for j in range(n - 1):\\n dp[j + 1] = max(dp[j + 1], dp[j])\\nprint((dp[-1]))',\n", + " 'optimized_code': \"\\nHere's the optimized code:\\nn = int(input())\\na = list(map(int, input().split()))\\ndp = [0] * n\\ndp[0] = 1000\\nfor i in range(1, n):\\n dp[i] = dp[i - 1] + dp[i - 1] // a[i - 1] * (a[i] - a[i - 1])\\nprint(dp[-1])\"},\n", + " {'original_code': 's = eval(input())\\nprint((\"ARC\" if s == \"ABC\" else \"ABC\"))',\n", + " 'optimized_code': '\\ns = s.upper() if type(s) is str else s\\nif s == \"ABC\":\\n print(\"ARC\")\\nelse:\\n print(\"ABC\")'},\n", + " {'original_code': 'INF = float(\"inf\")\\nn, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\ncost = [2, 5, 5, 4, 5, 6, 3, 7, 6]\\nl = [[x, cost[x - 1]] for x in a]\\nl = sorted(l, key=lambda x: x[1] * 10 - x[0])\\nr = l[0]\\n_max = [0] + [-INF] * n\\nfor i in range(1, n + 1):\\n for x in l:\\n ind = i - x[1]\\n if ind >= 0:\\n _max[i] = max(_max[i], _max[ind] * 10 + x[0])\\nans = str(_max[n])\\nprint(ans)',\n", + " 'optimized_code': '\\nHere\\'s the optimized code:\\nINF = float(\"inf\")\\nn, m = map(int, input().split())\\na = list(map(int, input().split()))\\ncost = [0] + [x * 10 for x in sorted(set(a) - {0}, key=lambda x: cost[x - 1])]\\n_max = [0] * (n + 1)\\nfor i, x in enumerate(a):\\n j = next_index(i + x, _max)\\n _max[j] = max(_max[j], x + _max[i])\\nprint(_max[-1])\\nDefinitions:\\nnext_index(index, arr): Returns the index of the next empty slot in array arr, starting from index + 1.\\nThis optimized code reduces the number of list comprehensions and sorting steps by using a set to store unique elements and calculating the cost as the cost multiplied by 10. It also uses enumerate to get the index and value of each element in the list at the same time, and uses next_index instead of iterating through the list to find the next'},\n", + " {'original_code': 'n, k = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nD = 60 \\nMAX_N = 200005 \\nto = [[0 for _ in range(MAX_N)] for _ in range(D)]\\nfor i in range(n):\\n to[0][i] = A[i]\\n to[0][i] -= 1\\nfor i in range(D - 1):\\n for j in range(n):\\n to[i + 1][j] = to[i][to[i][j]]\\nv = 0\\nfor i in range(D - 1, -1, -1):\\n l = 1 << i \\n if l <= k:\\n v = to[i][v]\\n k -= l\\nprint((v + 1))',\n", + " 'optimized_code': \"\\nHere's the optimized code:\\nn, k = map(int, input().split())\\nA = list(map(int, input().split()))\\nD = 60\\nMAX_N = 200005\\nto = [[-1] * MAX_N for _ in range(D)]\\nfor i in range(n):\\n to[0][A[i]] = i\\nfor i in range(1, D):\\n for j in range(MAX_N):\\n to[i][j] = to[i - 1][to[i - 1][j]]\\nv = n - 1\\nfor i in range(D - 1, -1, -1):\\n if k & (1 << i):\\n v = to[i][v]\\nprint(A[v] + 1)\"},\n", + " {'original_code': 'import math\\nn = int(eval(input()))\\nprint((int(math.floor(n**0.5) ** 2)))',\n", + " 'optimized_code': '\\nimport math\\nn = int(input())\\nprint(int(n ** 0.5) ** 2)'},\n", + " {'original_code': 'from math import factorial\\ndef comb(x, y):\\n return factorial(x) // factorial(x - y) // factorial(y)\\nw, h, ax, ay, bx, by = list(map(int, input().split()))\\ndx = abs(ax - bx)\\ndx = min(dx, w - dx)\\ndy = abs(ay - by)\\ndy = min(dy, h - dy)\\nans = 1\\nif dx * 2 == w:\\n ans *= 2\\nif dy * 2 == h:\\n ans *= 2\\nans *= comb(dx + dy, dx)\\nprint((ans % 100000007))',\n", + " 'optimized_code': '\\nfrom math import comb\\ndef comb(x, y):\\n return comb(x, y) if x >= y else comb(y, x)\\nw, h, ax, ay, bx, by = list(map(int, input().split()))\\ndx, dy = abs(ax - bx), abs(ay - by)\\ndx, dy = min(dx, w - dx), min(dy, h - dy)\\nans = comb(dx + dy, dx) if (dx * 2 != w or dy * 2 != h) else ans * 2\\nprint((ans % 100000007))'},\n", + " {'original_code': 'def main():\\n N = int(eval(input()))\\n L = [int(i) for i in input().split()]\\n L.sort()\\n L_pair = []\\n for i in range(N):\\n for j in range(i + 1, N):\\n L_pair.append((i, j))\\n def is_ok(mid, i, j):\\n if L[mid] < L[i] + L[j]:\\n return True\\n else:\\n return False\\n def binary_search_meguru(i, j):\\n left = j\\n right = N\\n while right - left > 1:\\n mid = left + ((right - left) // 2)\\n if is_ok(mid, i, j):\\n left = mid\\n else:\\n right = mid\\n return right\\n ans = 0\\n for i, j in L_pair:\\n r = binary_search_meguru(i, j)\\n ans += r - (j + 1)\\n print(ans)\\nif __name__ == \"__main__\":\\n main()',\n", + " 'optimized_code': '\\n```\\nHere is the optimized version of the code:\\n```\\ndef main():\\n N = int(input())\\n L = list(map(int, input().split()))\\n L.sort()\\n ans = 0\\n for i in range(N - 1):\\n j = bisect_right(L, L[i] + L[i+1]) - 1\\n ans += j - i\\n print(ans)\\nif __name__ == \"__main__\":\\n import bisect\\n main()\\n```\\nExplanation:\\n1. Used list comprehension instead of list slicing for creating `L_pair` list.\\n2. Imported `bisect` module and used its `bisect_right` function instead of implementing binary search ourselves.\\n3. Replaced the nested for loop with a single for loop and used `bisect_'},\n", + " {'original_code': 'import sys\\ninput = sys.stdin.readline\\nn, m = list(map(int, input().split()))\\ndef find(x):\\n if par[x] < 0:\\n return x\\n else:\\n par[x] = find(par[x])\\n return par[x]\\ndef unite(x, y):\\n x = find(x)\\n y = find(y)\\n if x == y:\\n return False\\n else:\\n if par[x] > par[y]:\\n x, y = y, x\\n par[x] += par[y]\\n par[y] = x\\n return True\\ndef same(x, y):\\n return find(x) == find(y)\\ndef size(x):\\n return -par[find(x)]\\npar = [-1] * n\\nfor _ in range(m):\\n x, y, z = [int(x) for x in input().split()]\\n unite(x - 1, y - 1)\\nA = set()\\nfor i in range(n):\\n A.add(find(i))\\nprint((len(A)))',\n", + " 'optimized_code': '\\nimport sys, math\\ninput = sys.stdin.readline\\nn, m = map(int, input().split())\\npar, rank = [-1] * n, [0] * n\\nfor i in range(n):\\n par[i] = i\\ndef find(x):\\n if par[x] != x:\\n par[x] = find(par[x])\\n rank[x] += rank[par[x]]\\n return par[x]\\ndef union(x, y):\\n x, y = find(x), find(y)\\n if x == y:\\n return\\n if rank[x] > rank[y]:\\n x, y = y, x\\n par[x] = y\\n rank[y] += rank[x]\\nfor _ in range(m):\\n x, y ='},\n", + " {'original_code': 'import numpy as np\\nn, m = list(map(int, input().split()))\\nh = list(map(int, input().split()))\\nab = []\\ng = []\\nfor _ in range(n):\\n g.append([])\\nfor _ in range(m):\\n a, b = list(map(int, input().split()))\\n ab.append([a, b])\\n g[a - 1].append(b - 1)\\n g[b - 1].append(a - 1)\\nans = 0\\nfor i in range(n):\\n check = True\\n for j in g[i]:\\n if h[j] >= h[i]:\\n check = False\\n if check:\\n ans += 1\\nprint(ans)',\n", + " 'optimized_code': '\\nimport numpy as np\\nn, m = map(int, input().split())\\nh = np.array(list(map(int, input().split())), dtype=int)\\nab = [list(map(int, input().split())) for _ in range(m)]\\ng = np.zeros((n, m), dtype=int)\\nfor a, b in ab:\\n g[a - 1][np.where(b - 1 == np.array(h))[0].flatten()] = 1\\n g[b - 1][np.where(a - 1 == np.array(h))[0].flatten()] = 1\\nans = np.sum(np.logical_and(np.eye(n, dtype=bool), np.logical_not(np.any(g, axis=1))))\\nprint(int(ans.sum()))'},\n", + " {'original_code': 'import heapq\\nn, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\naa = list([x * (-1) for x in a])\\nheapq.heapify(aa)\\nfor i in range(m):\\n max = heapq.heappop(aa)\\n heapq.heappush(aa, max // 2 + max % 2)\\nprint((-1 * sum(aa)))',\n", + " 'optimized_code': '\\nimport heapq\\nn, m = map(int, input().split())\\na = list(map(int, input().split()))\\nheapq.heappush(heapq.merge([-i for i in a], a), None)\\nans = 0\\nfor _ in range(m):\\n ans += heapq.heappop(heapq.merge([-i for i in a], a)) // 2 + heapq.heappop(heapq.merge([-i for i in a], a)) % 2\\nprint(-ans)'},\n", + " {'original_code': 'import sys\\ninput = sys.stdin.readline\\ndef f2(n, p):\\n dp = [0.0] * (n + 1)\\n dp[0] = 1.0\\n for i in range(n):\\n dp_ = list(dp)\\n pi_ = 1 - p[i]\\n for j in range(n + 1):\\n dp[j] = dp_[j - 1] * p[i] + dp_[j] * pi_\\n return sum(dp[n // 2 + 1 :])\\nn = int(eval(input())) \\np = list(map(float, input().split())) \\nprint((f2(n, p)))',\n", + " 'optimized_code': \"\\n```\\nHere's the optimized code:\\n```python\\nimport sys, functools\\ninput = sys.stdin.readline\\n@functools.lru_cache(maxsize=None)\\ndef f2(n, p):\\n dp = [0.0] * (n + 1)\\n dp[0] = 1.0\\n for i in range(1, n + 1):\\n dp[i] = dp[i - 1] * (1 - p[i - 1]) + dp[i] * p[i - 1]\\n return dp[n]\\nn = int(input())\\np = list(map(float, input().split()))\\nprint(f2(n, p))\\n```\\nExplanation:\\n1. I've imported `functools` to use the `lru_cache` decorator.\\n2. I've added the `@functools.lru_cache(maxsize=None)` decorator to the `f2` function to cache its results for optimization.\\n3. I've changed the loop index in the `for` loop of the `f2` function from `i` to `i-1` to avoid unnecessary array slicing in each iteration.\\n4. I've changed the return statement of\"},\n", + " {'original_code': 'import sys\\nreadline = sys.stdin.readline\\ndef main():\\n N = int(readline())\\n S = readline().rstrip()\\n e_right = S.count(\"E\")\\n w_right = S.count(\"W\")\\n e_left, w_left = 0, 0\\n res = N\\n for i in range(N):\\n if S[i] == \"E\":\\n e_right -= 1\\n res = min(res, e_right + w_left)\\n e_left += 1\\n else:\\n w_right -= 1\\n res = min(res, e_right + w_left)\\n w_left += 1\\n print(res)\\nif __name__ == \"__main__\":\\n main()',\n", + " 'optimized_code': '\\nimport sys\\nimport string\\nreadline = sys.stdin.buffer.readline\\ndef main():\\n N = int(readline().decode(\"utf-8\"))\\n S = readline().rstrip().decode(\"utf-8\")\\n e, w = 0, 0\\n res = N\\n for char in S:\\n if char == \"E\":\\n e += 1\\n res = min(res, w + e)\\n else:\\n w += 1\\n res = min(res, w + e)\\n print(res)\\nif __name__ == \"__main__\":\\n main()\\nThis optimized code uses string decoding, buffer reading, and in-place variable updates to improve efficiency. It does not require multiple separate variable assignments for each character count, and instead uses a single variable update for both sides.'},\n", + " {'original_code': 'N = int(eval(input()))\\nA = [int(a) - 1 for a in eval(input())]\\nr = 1 if 1 in A else 2\\nprint((sum([1 if A[i] & r and (N - 1 & i) == i else 0 for i in range(N)]) % 2 * r))',\n", + " 'optimized_code': \"\\nHere's the optimized code:\\nN = int(input())\\nA = list(map(int - 1, list(map(int, input().split()))))\\nr = 2 if not 1 in A else 1\\nans = sum([1 if (A[i] & r and (N - 1 & i) == i) else 0 for i in range(N)])\\nprint((ans % 2 * r))\"},\n", + " {'original_code': 'n, k = list(map(int, input().split()))\\nA = list(map(int, input().split()))\\nif len(set(A)) <= k:\\n print((0))\\nelse:\\n d = {i: 0 for i in set(A)}\\n for a in A:\\n d[a] += 1\\n ans = list(d.values())\\n ans.sort(reverse=True)\\n print((sum(ans[k:])))',\n", + " 'optimized_code': \"\\nHere's an optimized version of the given code:\\n```python\\nn, k = map(int, input().split())\\nA = list(map(int, input().split()))\\nif len(A) <= k:\\n print(0)\\nelse:\\n counter = {}\\n for num in A:\\n counter[num] = counter.get(num, 0) + 1\\n freq = {num: count for num, count in counter.items() if count > 0}\\n if len(freq) > k:\\n freq = {k: len(A) - k, **freq}\\n print(sum(freq.values()))\\n```\\nThis optimized version uses a dictionary `counter` to count the frequency of each number in `A` instead of using a set and then converting it back to a dictionary. It also initializes the dictionary with `{}` instead of an empty list comprehension to avoid the need for the `len(set(A))` check. Additionally, it calculates the frequency of the most common `k` numbers directly instead of sorting the list of values. Finally, it uses an unpacking expression to merge the new dictionary element with the existing dictionary `freq`.\"},\n", + " {'original_code': 'n, m = list(map(int, input().split()))\\narr = []\\nfor i in range(m):\\n ls = list(map(int, input().split())) + [i]\\n arr.append(ls)\\narr.sort(key=lambda x: x[1])\\ndef st(a):\\n b = list(str(a))\\n while len(b) <= 5:\\n b.insert(0, \"0\")\\n c = \"\".join(b)\\n return c\\ndic = {}\\nfor j in range(m):\\n if arr[j][0] in dic:\\n dic[arr[j][0]] += 1\\n arr[j] += [dic[arr[j][0]]]\\n else:\\n dic[arr[j][0]] = 1\\n arr[j] += [dic[arr[j][0]]]\\narr.sort(key=lambda x: x[2])\\nfor y in range(m):\\n print((\"{}{}\".format(st(arr[y][0]), st(arr[y][3]))))',\n", + " 'optimized_code': '\\nHere\\'s the optimized code:\\n```python\\nn, m = map(int, input().split())\\narr = [[0] * (3 + m) for _ in range(m)]\\nfor i in range(m):\\n arr[i][1:] = list(map(int, input().split())) + [i]\\narr.sort(key=lambda x: x[1])\\ndic = {}\\nfor i in arr:\\n if i[0] not in dic:\\n dic[i[0]] = 1\\n i += [dic[i[0]]]\\nfor i in arr:\\n if i[0] in dic:\\n i[2] += dic[i[0]]\\narr.sort(key=lambda x: (x[1], -x[2]))\\nfor i in arr:\\n print((\"{}{}\".format(*[str(x) for x'},\n", + " {'original_code': 'x, y = list(map(int, input().split()))\\nans = 1\\nwhile x <= y:\\n x *= 2\\n if x > y:\\n break\\n ans += 1\\nprint(ans)',\n", + " 'optimized_code': '\\nx, y = map(int, input().split())\\nans = int(log2(max(x, y)) + 1) if x <= y else x // 2 - (x % 2 == 0 and y % 2 == 0)\\nprint(ans)'},\n", + " {'original_code': 'N, M = list(map(int, input().split()))\\ne = []\\nfor _ in range(N):\\n a, b = list(map(int, input().split()))\\n e.append([a, b])\\ne = list(sorted(e, key=lambda x: x[0]))\\ncost = 0\\ncnt = M\\ne_i = 0\\nwhile cnt > 0:\\n can_buy = min(cnt, e[e_i][1])\\n cost += can_buy * e[e_i][0]\\n e[e_i][1] -= can_buy\\n cnt -= can_buy\\n if e[e_i][1] == 0:\\n e_i += 1\\nprint(cost)',\n", + " 'optimized_code': \"\\nHere's the optimized code:\\nN, M = map(int, input().split())\\nedges = []\\nfor _ in range(N):\\n a, b = map(int, input().split())\\n edges.append((a, b))\\nedges.sort()\\ncost = 0\\nfor edge in edges:\\n if M > 0 and edge[1] > 0:\\n cost += min(M, edge[1]) * edge[0]\\n M -= min(M, edge[1])\\nprint(cost)\"},\n", + " {'original_code': 'h, w = list(map(int, input().split()))\\ns = [list(eval(input())) for _ in range(h)]\\nfor i in range(h):\\n ans = []\\n for j in range(w):\\n bomb = 0\\n if s[i][j] == \".\":\\n for k in [0, -1, 1]:\\n for n in [0, -1, 1]:\\n if i + k < h and j + n < w:\\n if i + k < 0 or j + n < 0:\\n continue\\n if s[i + k][j + n] == \"#\":\\n bomb += 1\\n ans.append(str(bomb))\\n else:\\n ans.append(\"#\")\\n print((\"\".join(ans)))',\n", + " 'optimized_code': '\\n```python\\nimport sys\\nh, w = map(int, sys.stdin.readline().split())\\ns = [list(map(lambda x: \"#\" if \".\" not in x else \".\", x)) for x in map(list, (sys.stdin.readline() for _ in range(h)))]\\nfor row in s:\\n print(\"\".join(map(lambda x: str(sum(1 for j, bomb in enumerate(x) if j >= 0 and j < w and x[j] == \"#\")), row)))\\n```\\nExplanation:\\n1. Use `map` and `sys.stdin.readline()` instead of `list` and `input()` to read input for better performance.\\n2. Use list comprehension to initialize `s` instead of nested `for` loops.\\n3. Use `lambda` functions and list comprehension to replace nested `for` loops and check for bomb count.\\n4. Use `sum` function with generator expression to count bomb count in a list.\\n5. Use `join` function to concatenate list elements instead of using `\"\".join(ans)` in a loop.'},\n", + " {'original_code': 'c = [10 * [0] for _ in range(10)]\\nn = int(eval(input()))\\nfor i in range(1, n + 1):\\n a = int(str(i)[0])\\n b = int(str(i)[-1])\\n c[a][b] += 1\\nans = 0\\nfor i in range(1, 10):\\n for j in range(1, 10):\\n ans += c[i][j] * c[j][i]\\nprint(ans)',\n", + " 'optimized_code': '\\nOptimized code:\\nc = [[0] * 10 for _ in range(10)]\\nn = int(input())\\nfor i in range(1, n + 1):\\n a, b = map(int, str(i)[::-1])\\n c[a][b] += 1\\nans = sum(sum(c[i][j] * c[j][i] for j in range(1, 10)) for i in range(1, 10))\\nprint(ans)'},\n", + " {'original_code': 'n, m = list(map(int, input().split()))\\nl, r = 1, n\\nfor i in range(m):\\n a, b = list(map(int, input().split()))\\n l = max(l, a)\\n r = min(r, b)\\nprint((r - l + 1 if r >= l else 0))',\n", + " 'optimized_code': '\\nn, m = map(int, input().split())\\nl, r = 1, max(map(min, (map(int, input().split()) for _ in range(m))))\\nprint((r - l + 1 if r >= l else 0))\\n# This code uses map twice and the first map is used to convert strings to integers and the second map is used to find the min for each input.\\n# Instead, we can directly use max to find the maximum minimum value across all inputs, thus reducing the number of map calls.'},\n", + " {'original_code': 'import sys\\nfrom collections import deque\\ndef input():\\n return sys.stdin.readline().strip()\\ndef main():\\n K = int(eval(input()))\\n ans = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])\\n for _ in range(K - 1):\\n a = ans.popleft()\\n if a % 10 == 0:\\n ans.append(a * 10)\\n ans.append(a * 10 + 1)\\n elif a % 10 == 9:\\n ans.append(a * 10 + 8)\\n ans.append(a * 10 + 9)\\n else:\\n w = a % 10\\n ans.append(a * 10 + w - 1)\\n ans.append(a * 10 + w)\\n ans.append(a * 10 + w + 1)\\n print((ans.popleft()))\\nif __name__ == \"__main__\":\\n main()',\n", + " 'optimized_code': '\\nimport sys\\nfrom collections import deque\\ndef input():\\n return sys.stdin.readline().strip()\\ndef main():\\n K = int(input())\\n ans = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])\\n for _ in range(K - 1):\\n a = ans.popleft()\\n w = a % 10\\n ans += deque([a * 10 + i for i in range(w, w + 3)])\\n print(ans.popleft())\\nif __name__ == \"__main__\":\\n main()'},\n", + " {'original_code': 'n, m = list(map(int, input().split()))\\ncost = [0] * m\\nkeys = [0] * m\\nfor i in range(m):\\n a, b = list(map(int, input().split()))\\n cost[i] = a\\n k = list(map(int, input().split()))\\n for j in range(b):\\n keys[i] |= 1 << (k[j] - 1)\\nINF = 10**9 + 1\\ndp = [INF] * (2**n)\\ndp[0] = 0\\nfor i in range(len(keys)):\\n for j in range(len(dp) - 1, -1, -1):\\n if dp[j] != INF:\\n dp[j | keys[i]] = min(dp[j | keys[i]], dp[j] + cost[i])\\nif dp[-1] != INF:\\n print((dp[-1]))\\nelse:\\n print((-1))',\n", + " 'optimized_code': '\\n# Optimized code\\nimport sys\\nsys.setrecursionlimit(100000)\\nn, m = map(int, input().split())\\ncost = [0] * m\\nkeys = [[0] * (n + 1) for _ in range(m)]\\nfor i in range(m):\\n a, b = map(int, input().split())\\n cost[i] = a\\n for j in range(b):\\n keys[i][1 << (ord(input().strip()) - ord(\\'A\\'))] += 1\\nINF = float(\"inf\")\\ndp = [[INF] * (1 << n) for _ in range(m+1)]\\ndp[0][0] = 0\\nfor i in range(1, m+1):\\n for j in range(1 << n):\\n dp[i][j] = min(dp[i][j], dp[i-1][j], dp[i-1][j ^ keys[i-1]]) +'},\n", + " {'original_code': 'k, s = list(map(int, input().split()))\\ncount = 0\\nfor i in range(k + 1):\\n for j in range(k + 1):\\n t = s - i - j\\n if t <= k and t >= 0:\\n count += 1\\n else:\\n pass\\nprint(count)',\n", + " 'optimized_code': \"\\nHere's the optimized code:\\nk, s = map(int, input().split())\\nleft, right = 0, min(s, k)\\ncount = 0\\nwhile left <= right:\\n total = s - left - right\\n if total <= k and total >= 0:\\n count += 1\\n left += 1\\n right -= 1\\nprint(count)\"},\n", + " {'original_code': 'N = int(eval(input()))\\na = list(map(int, input().split()))\\nans = 0\\nimport math\\nfor i in range(N):\\n if a[i] % 2 != 0:\\n continue\\n while a[i] % 2 == 0:\\n a[i] = a[i] / 2\\n ans += 1\\nprint(ans)',\n", + " 'optimized_code': '\\nOptimized code:\\nN = int(input())\\na = list(map(int, input().split()))\\nans = sum(1 for i in a if i % 2 == 0 and i != 0)\\nprint(ans)'},\n", + " {'original_code': 'N = int(eval(input()))\\nP = [list(map(int, input().split())) for i in range(N)]\\nINF = 10**18\\nfrom heapq import heappush, heappop\\nl0, r0 = P[0]\\nL = [-l0 + 1]\\nR = [l0 - 1]\\ns = t = 0\\nres = 0\\nfor i in range(N - 1):\\n l0, r0 = P[i]\\n l1, r1 = P[i + 1]\\n s += r1 - l1\\n t += r0 - l0\\n if -s - L[0] <= l1 - 1 <= t + R[0]:\\n heappush(L, -l1 + 1 - s)\\n heappush(R, l1 - 1 - t)\\n elif l1 - 1 < -s - L[0]:\\n heappush(L, -l1 + 1 - s)\\n heappush(L, -l1 + 1 - s)\\n p = -heappop(L) - s\\n heappush(R, p - t)\\n res += p - (l1 - 1)\\n elif t + R[0] < l1 - 1:\\n heappush(R, l1 - 1 - t)\\n heappush(R, l1 - 1 - t)\\n p = heappop(R) + t\\n heappush(L, -p - s)\\n res += l1 - 1 - p\\nprint(res)',\n", + " 'optimized_code': \"\\nN = int(input())\\nP = [list(map(int, input().split())) for _ in range(N)]\\nINF = float('inf')\\nl, r, h = [[] for _ in range(3)], []\\nl[0], r[0] = P[0]\\nh.append((l[0], 0))\\nans = 0\"},\n", + " {'original_code': 'def main():\\n N = int(eval(input()))\\n A = list(map(int, input().split(\" \")))\\n A, count = selectionSort(A, N)\\n print((\" \".join([str(a) for a in A])))\\n print(count)\\ndef selectionSort(A, N):\\n count = 0\\n for i in range(0, N - 1):\\n minj = i\\n for j in range(i, N):\\n if A[j] < A[minj]:\\n minj = j\\n if i != minj:\\n A[i], A[minj] = A[minj], A[i]\\n count += 1\\n return A, count\\nif __name__ == \"__main__\":\\n main()',\n", + " 'optimized_code': '\\nHere\\'s the optimized code:\\n```python\\ndef main():\\n N = int(input())\\n A = list(map(int, input().split()))\\n A = sorted(A)\\n print(\" \".join(map(str, A)))\\n print(len(A) - N)\\n```\\nI removed the implementation of selection sort and used Python\\'s built-in sorting function `sorted` instead. Also, I changed the way to calculate the count of swaps. In this case, the count is simply the difference between the length of the sorted array and the initial array length.'}]" + ] + }, + "execution_count": 22, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "import pandas as pd\n", + "import jsonlines\n", + "\n", + "chunksize = 1000 \n", + "file_path = \"../outputs/optimized_code.jsonl\"\n", + "optimized_code = []\n", + "with jsonlines.open(file_path) as reader:\n", + " for obj in reader:\n", + " optimized_code.append(obj)\n", + "optimized_code" + ] + }, + { + "cell_type": "code", + "execution_count": 29, + "metadata": {}, + "outputs": [ + { + "data": { + "text/html": [ + "
\n", + "\n", + "\n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + "
original_codeoptimized_code
0from scipy.sparse.csgraph import floyd_warshal...\\nfrom scipy.sparse.csgraph import floyd_warsh...
1s = input()\\ns = s.split(\" \")\\na, b = int(s[0]...\\ns = list(map(int, input().split()))\\nif 1 <=...
2from functools import reduce\\nk = int(eval(inp...\\nHere's the optimized code:\\nfrom functools i...
3n = int(eval(input()))\\n(*a,) = list(map(int, ...\\nHere's the optimized version:\\nn = int(input...
4from math import factorial\\nmod = 10**9 + 7\\nn...\\nHere's the optimized code using memoization ...
\n", + "
" + ], + "text/plain": [ + " original_code \\\n", + "0 from scipy.sparse.csgraph import floyd_warshal... \n", + "1 s = input()\\ns = s.split(\" \")\\na, b = int(s[0]... \n", + "2 from functools import reduce\\nk = int(eval(inp... \n", + "3 n = int(eval(input()))\\n(*a,) = list(map(int, ... \n", + "4 from math import factorial\\nmod = 10**9 + 7\\nn... \n", + "\n", + " optimized_code \n", + "0 \\nfrom scipy.sparse.csgraph import floyd_warsh... \n", + "1 \\ns = list(map(int, input().split()))\\nif 1 <=... \n", + "2 \\nHere's the optimized code:\\nfrom functools i... \n", + "3 \\nHere's the optimized version:\\nn = int(input... \n", + "4 \\nHere's the optimized code using memoization ... " + ] + }, + "execution_count": 29, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "# list to df \n", + "optimized_code_df = pd.DataFrame(optimized_code)\n", + "optimized_code_df.head()" + ] + }, + { + "cell_type": "code", + "execution_count": 25, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Collecting radon\n", + " Downloading radon-6.0.1-py2.py3-none-any.whl.metadata (8.2 kB)\n", + "Collecting mando<0.8,>=0.6 (from radon)\n", + " Downloading mando-0.7.1-py2.py3-none-any.whl.metadata (7.4 kB)\n", + "Requirement already satisfied: colorama>=0.4.1 in c:\\users\\user\\appdata\\local\\programs\\python\\python310\\lib\\site-packages (from radon) (0.4.6)\n", + "Requirement already satisfied: six in c:\\users\\user\\appdata\\local\\programs\\python\\python310\\lib\\site-packages (from mando<0.8,>=0.6->radon) (1.16.0)\n", + "Downloading radon-6.0.1-py2.py3-none-any.whl (52 kB)\n", + "Downloading mando-0.7.1-py2.py3-none-any.whl (28 kB)\n", + "Installing collected packages: mando, radon\n", + "Successfully installed mando-0.7.1 radon-6.0.1\n" + ] + } + ], + "source": [ + "!pip install radon" + ] + }, + { + "cell_type": "code", + "execution_count": 35, + "metadata": {}, + "outputs": [], + "source": [ + "from radon.complexity import cc_visit\n", + "from radon.visitors import ComplexityVisitor\n", + "\n", + "def calculate_cyclomatic_complexity(code_snippet):\n", + " \"\"\"\n", + " Calculates the cyclomatic complexity of a given code snippet.\n", + " \n", + " Parameters:\n", + " code_snippet (str): The code to analyze.\n", + " \n", + " Returns:\n", + " int: Total cyclomatic complexity of the code.\n", + " \"\"\"\n", + " try:\n", + " # Wrap the code snippet into a dummy function to ensure it's parseable\n", + " wrapped_code = f\"def dummy_function():\\n\"\n", + " indented_code = \"\\n\".join([\" \" + line for line in code_snippet.split('\\n')])\n", + " wrapped_code += indented_code\n", + " \n", + " \n", + " # Use radon to parse the wrapped code\n", + " blocks = cc_visit(wrapped_code)\n", + " \n", + " # Sum the cyclomatic complexity of all blocks\n", + " total_cc = sum(block.complexity for block in blocks)\n", + " return total_cc\n", + " except Exception as e:\n", + " # print(f\"Error processing code: {e}\")\n", + " return None\n" + ] + }, + { + "cell_type": "code", + "execution_count": 37, + "metadata": {}, + "outputs": [ + { + "data": { + "text/html": [ + "
\n", + "\n", + "\n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + " \n", + "
original_codeoriginal_ccoptimized_codeoptimized_cc
0from scipy.sparse.csgraph import floyd_warshal...8\\nfrom scipy.sparse.csgraph import floyd_warsh...3.0
1s = input()\\ns = s.split(\" \")\\na, b = int(s[0]...3\\ns = list(map(int, input().split()))\\nif 1 <=...3.0
2from functools import reduce\\nk = int(eval(inp...4\\nHere's the optimized code:\\nfrom functools i...NaN
3n = int(eval(input()))\\n(*a,) = list(map(int, ...2\\nHere's the optimized version:\\nn = int(input...NaN
4from math import factorial\\nmod = 10**9 + 7\\nn...1\\nHere's the optimized code using memoization ...NaN
\n", + "
" + ], + "text/plain": [ + " original_code original_cc \\\n", + "0 from scipy.sparse.csgraph import floyd_warshal... 8 \n", + "1 s = input()\\ns = s.split(\" \")\\na, b = int(s[0]... 3 \n", + "2 from functools import reduce\\nk = int(eval(inp... 4 \n", + "3 n = int(eval(input()))\\n(*a,) = list(map(int, ... 2 \n", + "4 from math import factorial\\nmod = 10**9 + 7\\nn... 1 \n", + "\n", + " optimized_code optimized_cc \n", + "0 \\nfrom scipy.sparse.csgraph import floyd_warsh... 3.0 \n", + "1 \\ns = list(map(int, input().split()))\\nif 1 <=... 3.0 \n", + "2 \\nHere's the optimized code:\\nfrom functools i... NaN \n", + "3 \\nHere's the optimized version:\\nn = int(input... NaN \n", + "4 \\nHere's the optimized code using memoization ... NaN " + ] + }, + "execution_count": 37, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "# Apply the cyclomatic complexity calculation\n", + "optimized_code_df['original_cc'] = optimized_code_df['original_code'].apply(calculate_cyclomatic_complexity)\n", + "optimized_code_df['optimized_cc'] = optimized_code_df['optimized_code'].apply(calculate_cyclomatic_complexity)\n", + "\n", + "# Display the updated DataFrame\n", + "optimized_code_df[['original_code', 'original_cc', 'optimized_code', 'optimized_cc']].head()\n" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] } ], "metadata": { diff --git a/src/main.py b/src/main.py index 646610a..eb6d5ff 100644 --- a/src/main.py +++ b/src/main.py @@ -65,7 +65,7 @@ def main(): logging.info(f"Testing dataset size: {len(test_loader.dataset)}") - subset_size = 2 + subset_size = 1 test_subset = create_random_subset((test_loader.dataset), subset_size) test_loader = DataLoader(test_subset, batch_size=config["batch_size"], shuffle=False) logging.info(f"Limited testing dataset size: {len(test_loader.dataset)}") diff --git a/src/optimizer.py b/src/optimizer.py index 4bae5d0..b63f100 100644 --- a/src/optimizer.py +++ b/src/optimizer.py @@ -59,6 +59,7 @@ def single_pass_optimization(self, query, problem_id, test_cases_path): logits_processor=self.logits_processors, max_tokens=self.config["max_new_tokens"] ) + logging.info(f"in single Optimized Code:\n{response['choices'][0]['text'].strip()}") generated_text = response['choices'][0]['text'].strip() parsed_response = json.loads(generated_text) optimized_code = parsed_response["optimized_code"] From 5dec0a18403f9b760fa48f69b93276924799df37 Mon Sep 17 00:00:00 2001 From: agron911 Date: Mon, 9 Dec 2024 20:57:12 -0800 Subject: [PATCH 2/2] anay --- notebooks/exploratory_analysis.ipynb | 4 ++-- src/main.py | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/notebooks/exploratory_analysis.ipynb b/notebooks/exploratory_analysis.ipynb index 8ddcf23..9589606 100644 --- a/notebooks/exploratory_analysis.ipynb +++ b/notebooks/exploratory_analysis.ipynb @@ -38621,7 +38621,7 @@ }, { "cell_type": "code", - "execution_count": 37, + "execution_count": 38, "metadata": {}, "outputs": [ { @@ -38707,7 +38707,7 @@ "4 \\nHere's the optimized code using memoization ... NaN " ] }, - "execution_count": 37, + "execution_count": 38, "metadata": {}, "output_type": "execute_result" } diff --git a/src/main.py b/src/main.py index d8ea1ee..7451db7 100644 --- a/src/main.py +++ b/src/main.py @@ -65,7 +65,7 @@ def main(): logging.info(f"Testing dataset size: {len(test_loader.dataset)}") - subset_size = 1 + subset_size = 2 test_subset = create_random_subset((test_loader.dataset), subset_size) test_loader = DataLoader(test_subset, batch_size=config["batch_size"], shuffle=False) logging.info(f"Limited testing dataset size: {len(test_loader.dataset)}")