{"user_id": "u056277698", "problem_id": "p03078", "language": "python", "submission_id_v0": "s581139547", "submission_id_v1": "s213757381", "cpu_time_v0": 104, "cpu_time_v1": 36, "memory_v0": 8708, "memory_v1": 4976, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 65.38, "input": "# -*- coding: utf-8 -*-\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\nabc = []\n\n\n\nfor i, _a in enumerate(a):\n\n for j, _b in enumerate(b):\n\n if (i+1) * (j+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", "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", "code_v0_loc": 24, "code_v1_loc": 33, "code_v0_num_chars": 566, "code_v1_num_chars": 841, "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", "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", "code_same": false, "relative_loc_diff_percent": 27.2727272727, "diff": ["+import heapq", "+", "+la, lb, lc = len(a), len(b), len(c)", "-abc = []", "-for i, _a in enumerate(a):", "- for j, _b in enumerate(b):", "- if (i + 1) * (j + 1) > k:", "- break", "- for l, _c in enumerate(c):", "- if (i + 1) * (j + 1) * (l + 1) > k:", "- break", "- abc.append(_a + _b + _c)", "-abc.sort(reverse=True)", "-for x in abc[:k]:", "- print(x)", "+fix = set()", "+q = [(-(a[0] + b[0] + c[0]), 0, 0, 0)]", "+for _ in range(k):", "+ abc, i, j, l = heapq.heappop(q)", "+ print((-abc))", "+ if i + 1 < la and (i + 1, j, l) not in fix:", "+ heapq.heappush(q, (-(a[i + 1] + b[j] + c[l]), i + 1, j, l))", "+ fix.add((i + 1, j, l))", "+ if j + 1 < lb and (i, j + 1, l) not in fix:", "+ heapq.heappush(q, (-(a[i] + b[j + 1] + c[l]), i, j + 1, l))", "+ fix.add((i, j + 1, l))", "+ if l + 1 < lc and (i, j, l + 1) not in fix:", "+ heapq.heappush(q, (-(a[i] + b[j] + c[l + 1]), i, j, l + 1))", "+ fix.add((i, j, l + 1))"], "diff_only_import_comment": false, "measured_runtime_v0": 0.4343315315, "measured_runtime_v1": 0.2096420834, "runtime_lift": 2.0717764508, "key": ["s581139547", "s213757381"]} {"user_id": "u127499732", "problem_id": "p03608", "language": "python", "submission_id_v0": "s266235653", "submission_id_v1": "s503227515", "cpu_time_v0": 246, "cpu_time_v1": 190, "memory_v0": 83588, "memory_v1": 83656, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 22.76, "input": "def main():\n\n from itertools import permutations\n\n\n\n n, m, r, *x = list(map(int, open(0).read().split()))\n\n to = x[:r]\n\n\n\n dis = [[float(\"Inf\")] * (n + 1) for _ in range(n + 1)]\n\n for i in range(1, n + 1):\n\n dis[i][i] = 0\n\n\n\n for a, b, c in zip(*[iter(x[r:])] * 3):\n\n dis[a][b] = c\n\n dis[b][a] = c\n\n\n\n for k in range(1, n + 1):\n\n for i in range(1, n + 1):\n\n for j in range(1, n + 1):\n\n dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j])\n\n\n\n ans = float(\"Inf\")\n\n for p in permutations(to):\n\n tmp = 0\n\n nw = p[0]\n\n for nx in p[1:]:\n\n tmp += dis[nw][nx]\n\n nw = nx\n\n\n\n ans = min(ans, tmp)\n\n\n\n print(ans)\n\n\n\n\n\nif __name__ == '__main__':\n\n main()\n", "target": "def main():\n\n from itertools import permutations\n\n\n\n n, m, r, *x = list(map(int, open(0).read().split()))\n\n to = x[:r]\n\n\n\n dis = [[10 ** 8] * (n + 1) for _ in range(n + 1)]\n\n for i in range(1, n + 1):\n\n dis[i][i] = 0\n\n\n\n for a, b, c in zip(*[iter(x[r:])] * 3):\n\n dis[a][b] = c\n\n dis[b][a] = c\n\n\n\n for k in range(1, n + 1):\n\n for i in range(1, n + 1):\n\n for j in range(1, n + 1):\n\n dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j])\n\n\n\n ans = 10 ** 8\n\n for p in permutations(to):\n\n tmp = 0\n\n nw = p[0]\n\n for nx in p[1:]:\n\n tmp += dis[nw][nx]\n\n nw = nx\n\n\n\n ans = min(ans, tmp)\n\n\n\n print(ans)\n\n\n\n\n\nif __name__ == '__main__':\n\n main()\n", "code_v0_loc": 34, "code_v1_loc": 34, "code_v0_num_chars": 771, "code_v1_num_chars": 761, "code_v0_no_empty_lines": "def main():\n from itertools import permutations\n\n n, m, r, *x = list(map(int, open(0).read().split()))\n to = x[:r]\n dis = [[float(\"Inf\")] * (n + 1) for _ in range(n + 1)]\n for i in range(1, n + 1):\n dis[i][i] = 0\n for a, b, c in zip(*[iter(x[r:])] * 3):\n dis[a][b] = c\n dis[b][a] = c\n for k in range(1, n + 1):\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j])\n ans = float(\"Inf\")\n for p in permutations(to):\n tmp = 0\n nw = p[0]\n for nx in p[1:]:\n tmp += dis[nw][nx]\n nw = nx\n ans = min(ans, tmp)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "code_v1_no_empty_lines": "def main():\n from itertools import permutations\n\n n, m, r, *x = list(map(int, open(0).read().split()))\n to = x[:r]\n dis = [[10**8] * (n + 1) for _ in range(n + 1)]\n for i in range(1, n + 1):\n dis[i][i] = 0\n for a, b, c in zip(*[iter(x[r:])] * 3):\n dis[a][b] = c\n dis[b][a] = c\n for k in range(1, n + 1):\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j])\n ans = 10**8\n for p in permutations(to):\n tmp = 0\n nw = p[0]\n for nx in p[1:]:\n tmp += dis[nw][nx]\n nw = nx\n ans = min(ans, tmp)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "code_same": false, "relative_loc_diff_percent": 0.0, "diff": ["- dis = [[float(\"Inf\")] * (n + 1) for _ in range(n + 1)]", "+ dis = [[10**8] * (n + 1) for _ in range(n + 1)]", "- ans = float(\"Inf\")", "+ ans = 10**8"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3828251469, "measured_runtime_v1": 0.1865792952, "runtime_lift": 2.0518093745, "key": ["s266235653", "s503227515"]} {"user_id": "u279493135", "problem_id": "p02555", "language": "python", "submission_id_v0": "s706729835", "submission_id_v1": "s005580579", "cpu_time_v0": 319, "cpu_time_v1": 39, "memory_v0": 10348, "memory_v1": 11860, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 87.77, "input": "import sys, re\n\nfrom collections import deque, defaultdict, Counter\n\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd\n\nfrom itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement\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 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 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\nS = INT()\n\n\n\n@lru_cache(maxsize=None)\n\ndef rec(x):\n\n if x == 0: return 1\n\n\n\n ret = 0\n\n for i in range(x-2):\n\n ret += rec(i)\n\n ret %= mod\n\n return ret\n\n\n\nprint((rec(S)))\n", "target": "import sys, re\n\nfrom collections import deque, defaultdict, Counter\n\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd\n\nfrom itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement\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 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 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\nS = INT()\n\n\n\n@lru_cache(maxsize=None)\n\ndef rec(x):\n\n if x == 0: return 1\n\n\n\n ret = 0\n\n if x >= 3:\n\n return (rec(x-1)+rec(x-3))%mod\n\n else:\n\n return 0\n\n\n\nprint((rec(S)))\n", "code_v0_loc": 32, "code_v1_loc": 32, "code_v0_num_chars": 996, "code_v1_num_chars": 996, "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, gcd\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n groupby,\n combinations_with_replacement,\n)\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_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 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\nS = INT()\n\n\n@lru_cache(maxsize=None)\ndef rec(x):\n if x == 0:\n return 1\n ret = 0\n for i in range(x - 2):\n ret += rec(i)\n ret %= mod\n return ret\n\n\nprint((rec(S)))\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, gcd\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n groupby,\n combinations_with_replacement,\n)\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_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 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\nS = INT()\n\n\n@lru_cache(maxsize=None)\ndef rec(x):\n if x == 0:\n return 1\n ret = 0\n if x >= 3:\n return (rec(x - 1) + rec(x - 3)) % mod\n else:\n return 0\n\n\nprint((rec(S)))\n", "code_same": false, "relative_loc_diff_percent": 0.0, "diff": ["- for i in range(x - 2):", "- ret += rec(i)", "- ret %= mod", "- return ret", "+ if x >= 3:", "+ return (rec(x - 1) + rec(x - 3)) % mod", "+ else:", "+ return 0"], "diff_only_import_comment": false, "measured_runtime_v0": 0.4423550682, "measured_runtime_v1": 0.2103828435, "runtime_lift": 2.1026194952, "key": ["s706729835", "s005580579"]} {"user_id": "u227082700", "problem_id": "p02834", "language": "python", "submission_id_v0": "s854767798", "submission_id_v1": "s662268715", "cpu_time_v0": 780, "cpu_time_v1": 670, "memory_v0": 84508, "memory_v1": 38312, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 14.1, "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)", "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", "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", "code_same": false, "relative_loc_diff_percent": 31.25, "diff": ["-anss = 0", "-d = [[] for _ in range(n)]", "-inf = float(\"inf\")", "-aoki = [inf] * n", "+e = [[] for _ in range(n)]", "- d[a].append(b)", "- d[b].append(a)", "-Q = d[v]", "-aoki[v] = 0", "-dis = 1", "-visited = {v}", "-while Q:", "- P = []", "- for i in Q:", "- visited.add(i)", "- for j in d[i]:", "- if j not in visited:", "- P.append(j)", "- aoki[i] = dis", "- dis += 1", "- Q = P", "-Q = d[u]", "-chokudai = [-1] * n", "-chokudai[u] = 0", "-dis = 1", "-visited = {u}", "-point = -1", "-while Q:", "- P = []", "- for i in Q:", "- visited.add(i)", "- for j in d[i]:", "- if aoki[j] <= dis + 1:", "- if aoki[j] == dis + 1:", "- anss = 1", "- if point < 0:", "- point = i", "+ e[a].append(b)", "+ e[b].append(a)", "+cho = [u]", "+cho_dis = [10**7] * n", "+cho_dis[u] = 0", "+cho_visited = {u}", "+countt = 1", "+while cho:", "+ CHO = []", "+ for i in cho:", "+ for j in e[i]:", "+ if j in cho_visited:", "- if j not in visited:", "- P.append(j)", "- chokudai[i] = dis", "- dis += 1", "- Q = P", "-Q = d[point]", "-dis = chokudai[point] + 1", "-visited = {point}", "-while Q:", "- P = []", "- for i in Q:", "- visited.add(i)", "- if chokudai[i] == -1:", "- continue", "- chokudai[i] = max(dis, chokudai[i])", "- for j in d[i]:", "- if j not in visited:", "- P.append(j)", "- dis += 1", "- Q = P", "+ cho_visited.add(j)", "+ CHO.append(j)", "+ cho_dis[j] = countt", "+ countt += 1", "+ cho = CHO", "+aok = [v]", "+aok_dis = [10**7] * n", "+aok_dis[v] = 0", "+aok_visited = {v}", "+countt = 1", "+while aok:", "+ AOK = []", "+ for i in aok:", "+ for j in e[i]:", "+ if j in aok_visited:", "+ continue", "+ aok_visited.add(j)", "+ AOK.append(j)", "+ aok_dis[j] = countt", "+ countt += 1", "+ aok = AOK", "- if aoki[i] > chokudai[i]:", "- ans = max(ans, chokudai[i])", "-print((ans + anss))", "-# print(aoki)", "-# print(chokudai)", "+ if cho_dis[i] < aok_dis[i]:", "+ ans = max(ans, aok_dis[i] - 1)", "+print(ans)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2686464586, "measured_runtime_v1": 0.0699197628, "runtime_lift": 3.842210666, "key": ["s854767798", "s662268715"]} {"user_id": "u311379832", "problem_id": "p02537", "language": "python", "submission_id_v0": "s277145927", "submission_id_v1": "s770419806", "cpu_time_v0": 790, "cpu_time_v1": 668, "memory_v0": 119112, "memory_v1": 103304, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 15.44, "input": "def segfunc(x, y): return max(x, y)\n\n\n\nclass SegmentTree:\n\n def __init__(self, arr):\n\n size = len(arr)\n\n n = 2 ** (size - 1).bit_length()\n\n self.n = n\n\n self.node = [0] * (2*n)\n\n for i in range(size):\n\n self.node[i+n-1] = arr[i]\n\n for i in reversed(list(range(n-2))):\n\n self.node[i] = segfunc(self.node[2*i+1], self.node[2*i+2])\n\n\n\n def update(self, i, x):\n\n i += self.n - 1\n\n self.node[i] = x\n\n while i > 0:\n\n i = (i - 1) // 2\n\n self.node[i] = segfunc(self.node[i * 2 + 1], self.node[i * 2 + 2])\n\n\n\n def update(self, x, val):\n\n x += (self.n - 1)\n\n self.node[x] = val\n\n while x > 0:\n\n x = (x - 1) // 2\n\n self.node[x] = segfunc(self.node[2 * x + 1], self.node[2 * x + 2])\n\n\n\n def query(self, a, b):\n\n res = 0\n\n l = self.n - 1 + a\n\n r = self.n - 1 + (b - 1)\n\n\n\n while l <= r:\n\n if l == r:\n\n res = segfunc(res, self.node[l])\n\n break\n\n\n\n if l % 2 == 0:\n\n res = segfunc(res, self.node[l])\n\n if r % 2 == 1:\n\n res = segfunc(res, self.node[r])\n\n l = l // 2\n\n r = r // 2 - 1\n\n\n\n return res\n\n\n\nN, K = list(map(int, input().split()))\n\nINF = 0\n\nseg = SegmentTree([0] * 300000)\n\nfor i in range(N):\n\n a = int(input())\n\n tmp = seg.query(max(a - K, 0), min(a + K, 300000) + 1) + 1\n\n seg.update(a, tmp)\n\nprint((seg.query(0, 300000)))\n", "target": "def segfunc(x, y): return max(x, y)\n\ndef update(i, x):\n\n i += MAX_N-1\n\n node[i] = x\n\n while i:\n\n i = (i-1)//2\n\n node[i] = segfunc(node[i*2+1], node[i*2+2])\n\n\n\ndef query(l, r):\n\n L = l + MAX_N\n\n R = r + MAX_N\n\n s = INF\n\n while L < R:\n\n if R & 1:\n\n R -= 1\n\n s = segfunc(s, node[R - 1])\n\n if L & 1:\n\n s = segfunc(s, node[L - 1])\n\n L += 1\n\n L >>= 1\n\n R >>= 1\n\n return s\n\n\n\nN, K = list(map(int, input().split()))\n\nMAX_N = 2**(300005).bit_length()\n\na = [int(input()) for _ in range(N)]\n\nnode = [0] * (2 * MAX_N)\n\nINF = 0\n\nans = 0\n\n\n\n#for i in range(N):\n\n# update(i, a[i])\n\n\n\nfor i in a:\n\n tmp = query(max(i - K, 0), min(300005, i + K) + 1)\n\n update(i, tmp + 1)\n\n ans = max(ans, tmp + 1)\n\nprint(ans)\n", "code_v0_loc": 54, "code_v1_loc": 38, "code_v0_num_chars": 1524, "code_v1_num_chars": 809, "code_v0_no_empty_lines": "def segfunc(x, y):\n return max(x, y)\n\n\nclass SegmentTree:\n def __init__(self, arr):\n size = len(arr)\n n = 2 ** (size - 1).bit_length()\n self.n = n\n self.node = [0] * (2 * n)\n for i in range(size):\n self.node[i + n - 1] = arr[i]\n for i in reversed(list(range(n - 2))):\n self.node[i] = segfunc(self.node[2 * i + 1], self.node[2 * i + 2])\n\n def update(self, i, x):\n i += self.n - 1\n self.node[i] = x\n while i > 0:\n i = (i - 1) // 2\n self.node[i] = segfunc(self.node[i * 2 + 1], self.node[i * 2 + 2])\n\n def update(self, x, val):\n x += self.n - 1\n self.node[x] = val\n while x > 0:\n x = (x - 1) // 2\n self.node[x] = segfunc(self.node[2 * x + 1], self.node[2 * x + 2])\n\n def query(self, a, b):\n res = 0\n l = self.n - 1 + a\n r = self.n - 1 + (b - 1)\n while l <= r:\n if l == r:\n res = segfunc(res, self.node[l])\n break\n if l % 2 == 0:\n res = segfunc(res, self.node[l])\n if r % 2 == 1:\n res = segfunc(res, self.node[r])\n l = l // 2\n r = r // 2 - 1\n return res\n\n\nN, K = list(map(int, input().split()))\nINF = 0\nseg = SegmentTree([0] * 300000)\nfor i in range(N):\n a = int(input())\n tmp = seg.query(max(a - K, 0), min(a + K, 300000) + 1) + 1\n seg.update(a, tmp)\nprint((seg.query(0, 300000)))\n", "code_v1_no_empty_lines": "def segfunc(x, y):\n return max(x, y)\n\n\ndef update(i, x):\n i += MAX_N - 1\n node[i] = x\n while i:\n i = (i - 1) // 2\n node[i] = segfunc(node[i * 2 + 1], node[i * 2 + 2])\n\n\ndef query(l, r):\n L = l + MAX_N\n R = r + MAX_N\n s = INF\n while L < R:\n if R & 1:\n R -= 1\n s = segfunc(s, node[R - 1])\n if L & 1:\n s = segfunc(s, node[L - 1])\n L += 1\n L >>= 1\n R >>= 1\n return s\n\n\nN, K = list(map(int, input().split()))\nMAX_N = 2 ** (300005).bit_length()\na = [int(input()) for _ in range(N)]\nnode = [0] * (2 * MAX_N)\nINF = 0\nans = 0\n# for i in range(N):\n# update(i, a[i])\nfor i in a:\n tmp = query(max(i - K, 0), min(300005, i + K) + 1)\n update(i, tmp + 1)\n ans = max(ans, tmp + 1)\nprint(ans)\n", "code_same": false, "relative_loc_diff_percent": 29.6296296296, "diff": ["-class SegmentTree:", "- def __init__(self, arr):", "- size = len(arr)", "- n = 2 ** (size - 1).bit_length()", "- self.n = n", "- self.node = [0] * (2 * n)", "- for i in range(size):", "- self.node[i + n - 1] = arr[i]", "- for i in reversed(list(range(n - 2))):", "- self.node[i] = segfunc(self.node[2 * i + 1], self.node[2 * i + 2])", "+def update(i, x):", "+ i += MAX_N - 1", "+ node[i] = x", "+ while i:", "+ i = (i - 1) // 2", "+ node[i] = segfunc(node[i * 2 + 1], node[i * 2 + 2])", "- def update(self, i, x):", "- i += self.n - 1", "- self.node[i] = x", "- while i > 0:", "- i = (i - 1) // 2", "- self.node[i] = segfunc(self.node[i * 2 + 1], self.node[i * 2 + 2])", "- def update(self, x, val):", "- x += self.n - 1", "- self.node[x] = val", "- while x > 0:", "- x = (x - 1) // 2", "- self.node[x] = segfunc(self.node[2 * x + 1], self.node[2 * x + 2])", "-", "- def query(self, a, b):", "- res = 0", "- l = self.n - 1 + a", "- r = self.n - 1 + (b - 1)", "- while l <= r:", "- if l == r:", "- res = segfunc(res, self.node[l])", "- break", "- if l % 2 == 0:", "- res = segfunc(res, self.node[l])", "- if r % 2 == 1:", "- res = segfunc(res, self.node[r])", "- l = l // 2", "- r = r // 2 - 1", "- return res", "+def query(l, r):", "+ L = l + MAX_N", "+ R = r + MAX_N", "+ s = INF", "+ while L < R:", "+ if R & 1:", "+ R -= 1", "+ s = segfunc(s, node[R - 1])", "+ if L & 1:", "+ s = segfunc(s, node[L - 1])", "+ L += 1", "+ L >>= 1", "+ R >>= 1", "+ return s", "+MAX_N = 2 ** (300005).bit_length()", "+a = [int(input()) for _ in range(N)]", "+node = [0] * (2 * MAX_N)", "-seg = SegmentTree([0] * 300000)", "-for i in range(N):", "- a = int(input())", "- tmp = seg.query(max(a - K, 0), min(a + K, 300000) + 1) + 1", "- seg.update(a, tmp)", "-print((seg.query(0, 300000)))", "+ans = 0", "+# for i in range(N):", "+# update(i, a[i])", "+for i in a:", "+ tmp = query(max(i - K, 0), min(300005, i + K) + 1)", "+ update(i, tmp + 1)", "+ ans = max(ans, tmp + 1)", "+print(ans)"], "diff_only_import_comment": false, "measured_runtime_v0": 2.9777374048, "measured_runtime_v1": 0.391063194, "runtime_lift": 7.6144660253, "key": ["s277145927", "s770419806"]} {"user_id": "u564589929", "problem_id": "p03371", "language": "python", "submission_id_v0": "s501790970", "submission_id_v1": "s324668886", "cpu_time_v0": 93, "cpu_time_v1": 17, "memory_v0": 3064, "memory_v1": 3064, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 81.72, "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(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 a, b, c, x, y = MI()\n\n\n\n ans = INF\n\n for k in range(100001):\n\n yen = 2 * c * k + max(0, x-k) * a + max(0, y-k) * b\n\n ans = min(ans, yen)\n\n print(ans)\n\n\n\n\n\nif __name__ == '__main__':\n\n solve()\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(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 a, b, c, x, y = MI()\n\n\n\n ans = 0\n\n if a + b <= 2 * c:\n\n mn = min(x, y)\n\n ans = a * mn + b * mn + max(0, x-mn) * min(a, 2*c) + max(0, y-mn) * min(b, 2*c)\n\n\n\n else:\n\n mn = min(x, y)\n\n ans = mn * 2 * c + max(0, x-mn) * min(a, 2*c) + max(0, y-mn) * min(b, 2*c)\n\n\n\n print(ans)\n\n\n\n\n\n\n\nif __name__ == '__main__':\n\n solve()\n", "code_v0_loc": 28, "code_v1_loc": 34, "code_v0_num_chars": 727, "code_v1_num_chars": 868, "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(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 a, b, c, x, y = MI()\n ans = INF\n for k in range(100001):\n yen = 2 * c * k + max(0, x - k) * a + max(0, y - k) * b\n ans = min(ans, yen)\n print(ans)\n\n\nif __name__ == \"__main__\":\n solve()\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(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 a, b, c, x, y = MI()\n ans = 0\n if a + b <= 2 * c:\n mn = min(x, y)\n ans = (\n a * mn\n + b * mn\n + max(0, x - mn) * min(a, 2 * c)\n + max(0, y - mn) * min(b, 2 * c)\n )\n else:\n mn = min(x, y)\n ans = (\n mn * 2 * c + max(0, x - mn) * min(a, 2 * c) + max(0, y - mn) * min(b, 2 * c)\n )\n print(ans)\n\n\nif __name__ == \"__main__\":\n solve()\n", "code_same": false, "relative_loc_diff_percent": 17.6470588235, "diff": ["- ans = INF", "- for k in range(100001):", "- yen = 2 * c * k + max(0, x - k) * a + max(0, y - k) * b", "- ans = min(ans, yen)", "+ ans = 0", "+ if a + b <= 2 * c:", "+ mn = min(x, y)", "+ ans = (", "+ a * mn", "+ + b * mn", "+ + max(0, x - mn) * min(a, 2 * c)", "+ + max(0, y - mn) * min(b, 2 * c)", "+ )", "+ else:", "+ mn = min(x, y)", "+ ans = (", "+ mn * 2 * c + max(0, x - mn) * min(a, 2 * c) + max(0, y - mn) * min(b, 2 * c)", "+ )"], "diff_only_import_comment": false, "measured_runtime_v0": 1.2337559407, "measured_runtime_v1": 0.3123451986, "runtime_lift": 3.9499756873, "key": ["s501790970", "s324668886"]} {"user_id": "u333190709", "problem_id": "p03371", "language": "python", "submission_id_v0": "s264866690", "submission_id_v1": "s762683898", "cpu_time_v0": 127, "cpu_time_v1": 17, "memory_v0": 5304, "memory_v1": 3064, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 86.61, "input": "#!/usr/bin/env python3\n\nimport sys, math, math, 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", "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", "code_v0_loc": 28, "code_v1_loc": 34, "code_v0_num_chars": 879, "code_v1_num_chars": 941, "code_v0_no_empty_lines": "#!/usr/bin/env python3\nimport sys, math, math, 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", "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", "code_same": false, "relative_loc_diff_percent": 17.6470588235, "diff": ["-import sys, math, math, itertools", "+import sys", "- mn = 1e9", "- for i in range(0, 2 * (max(X, Y) + 1), 2):", "- mn = min(mn, C * i + A * max(X - i // 2, 0) + B * max(Y - i // 2, 0))", "- print((int(mn)))", "+ c = 0", "+ if A + B < 2 * C:", "+ c += min(X, Y) * (A + B)", "+ else:", "+ c += min(X, Y) * 2 * C", "+ if X > Y:", "+ c += (X - Y) * min(A, 2 * C)", "+ else:", "+ c += (Y - X) * min(B, 2 * C)", "+ print(c)", "-# 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)", "+# 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)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.4482344875, "measured_runtime_v1": 0.3314408262, "runtime_lift": 1.3523816383, "key": ["s264866690", "s762683898"]} {"user_id": "u696805736", "problem_id": "p03837", "language": "python", "submission_id_v0": "s032580281", "submission_id_v1": "s724625000", "cpu_time_v0": 677, "cpu_time_v1": 276, "memory_v0": 62548, "memory_v1": 41072, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 59.23, "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", "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", "code_v0_loc": 46, "code_v1_loc": 37, "code_v0_num_chars": 1060, "code_v1_num_chars": 907, "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", "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", "code_same": false, "relative_loc_diff_percent": 19.5652173913, "diff": ["-import queue", "-", "- G = [[] for _ in range(n)]", "- for _ in range(m):", "- a, b, c = list(map(int, input().split()))", "- a -= 1", "- b -= 1", "- G[a].append((b, c))", "- G[b].append((a, c))", "- used = set()", "+ d = [[INF for i in range(n)] for j in range(n)]", "- d = [INF for _ in range(n)]", "- par = [-1 for _ in range(n)]", "- # dijkstra", "- que = queue.PriorityQueue()", "- d[i] = 0", "- que.put((0, i))", "- while not que.empty():", "- p = que.get()", "- v = p[1]", "- if d[v] < p[0]:", "- continue", "- for (to, cost) in G[v]:", "- if d[to] > d[v] + cost:", "- d[to] = d[v] + cost", "- par[to] = v", "- que.put((d[to], to))", "+ d[i][i] = 0", "+ a = [0 for _ in range(m)]", "+ b = [0 for _ in range(m)]", "+ c = [0 for _ in range(m)]", "+ for i in range(m):", "+ a[i], b[i], c[i] = list(map(int, input().split()))", "+ a[i] -= 1", "+ b[i] -= 1", "+ d[a[i]][b[i]] = min(d[a[i]][b[i]], c[i])", "+ d[b[i]][a[i]] = min(d[b[i]][a[i]], c[i])", "+ # Warshall-Floyd", "+ for k in range(n):", "+ for i in range(n):", "+ for j in range(n):", "+ d[i][j] = min(d[i][j], d[i][k] + d[k][j])", "+ ans = 0", "+ for i in range(m):", "+ found = 1", "- if i != j:", "- a, b = j, par[j]", "- if a > b:", "- a, b = b, a", "- used.add((a, b))", "- print((m - len(used)))", "+ if d[j][a[i]] + c[i] == d[j][b[i]]:", "+ found = 0", "+ break", "+ ans += found", "+ print(ans)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3167709551, "measured_runtime_v1": 0.2522355395, "runtime_lift": 1.2558537773, "key": ["s032580281", "s724625000"]} {"user_id": "u426534722", "problem_id": "p02248", "language": "python", "submission_id_v0": "s909106276", "submission_id_v1": "s961733692", "cpu_time_v0": 910, "cpu_time_v1": 790, "memory_v0": 117852, "memory_v1": 117860, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 13.19, "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 = input()\n\nP = input()\n\nans = kmpSearch(T, P)\n\nif ans:\n\n print((\"\\n\".join(map(str, ans))))\t\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 = input()\n\nP = input()\n\nans = kmpSearch(T, P)\n\nif ans:\n\n print((\"\\n\".join(map(str, ans))))\t\n\n\n", "code_v0_loc": 36, "code_v1_loc": 36, "code_v0_num_chars": 860, "code_v1_num_chars": 867, "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 = input()\nP = input()\nans = kmpSearch(T, P)\nif ans:\n print((\"\\n\".join(map(str, ans))))\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 = input()\nP = input()\nans = kmpSearch(T, P)\nif ans:\n print((\"\\n\".join(map(str, ans))))\n", "code_same": false, "relative_loc_diff_percent": 0.0, "diff": ["- return nx", "+ return tuple(nx)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.215319014, "measured_runtime_v1": 0.1265300495, "runtime_lift": 1.7017223565, "key": ["s909106276", "s961733692"]} {"user_id": "u285891772", "problem_id": "p03078", "language": "python", "submission_id_v0": "s323914382", "submission_id_v1": "s323368336", "cpu_time_v0": 910, "cpu_time_v1": 524, "memory_v0": 69644, "memory_v1": 18184, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 42.42, "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", "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(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", "code_v0_loc": 46, "code_v1_loc": 40, "code_v0_num_chars": 1517, "code_v1_num_chars": 1344, "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", "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(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", "code_same": false, "relative_loc_diff_percent": 13.0434782609, "diff": ["- return int(input())", "+ return int(input())", "- return map(int, input().split())", "+ return list(map(int, input().split()))", "- return zip(*(MAP() for _ in range(n)))", "+ return list(zip(*(MAP() for _ in range(n))))", "-AB = []", "+ans = []", "- AB.append(A[i] + B[j])", "-AB.sort(reverse=True)", "-AB = AB[:3000]", "-ABC = sorted([C[0] + AB[i] for i in range(min(3000, X * Y))], reverse=True)", "-for j in range(1, Z):", "- ABC_tmp = sorted([C[j] + AB[i] for i in range(min(3000, X * Y))])", "- ABC += ABC_tmp", "- ABC.sort(reverse=True)", "- ABC = ABC[:3000]", "-print(*ABC[:K], sep=\"\\n\")", "+ for k in range(Z):", "+ if (i + 1) * (j + 1) * (k + 1) <= K:", "+ ans.append(A[i] + B[j] + C[k])", "+ else:", "+ break", "+for a in sorted(ans)[::-1][:K]:", "+ print(a)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3039683881, "measured_runtime_v1": 0.2292593994, "runtime_lift": 1.3258709952, "key": ["s323914382", "s323368336"]} {"user_id": "u285891772", "problem_id": "p02837", "language": "python", "submission_id_v0": "s234390283", "submission_id_v1": "s698943579", "cpu_time_v0": 281, "cpu_time_v1": 125, "memory_v0": 5204, "memory_v1": 5964, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 55.52, "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, log\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 math import gcd\n\nfrom heapq import heappush, heappop\n\nfrom functools import reduce\n\nfrom decimal import Decimal\n\ndef input(): return sys.stdin.readline().strip()\n\ndef INT(): return int(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\nfrom decimal import *\n\n\n\nN = INT()\n\nxy = []\n\n\n\nfor i in range(N):\n\n\tA = INT()\n\n\txy.append([LIST() for _ in range(A)])\n\n\n\nans = 0\n\nfor i in range(1< 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", "code_v0_loc": 30, "code_v1_loc": 27, "code_v0_num_chars": 885, "code_v1_num_chars": 783, "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", "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", "code_same": false, "relative_loc_diff_percent": 10.0, "diff": ["-dy = [-1, 0, 0, 1]", "-dx = [0, -1, 1, 0]", "- t = a // (10**j) % 10", "- return a - t * (10**j) + t * (10**i)", "+ if i > j:", "+ i, j = j, i", "+ return a[:i] + a[j] + a[i + 1 : j] + a[i] + a[j + 1 :]", "- start = 8 - MAP.find(\"0\")", "- MAP = int(MAP)", "- goal = (\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"0\")", "- goal = 123456780", "+ start = MAP.find(\"0\")", "+ goal = \"123456780\""], "diff_only_import_comment": false, "measured_runtime_v0": 0.3641724348, "measured_runtime_v1": 0.096000421, "runtime_lift": 3.7934462245, "key": ["s804728708", "s622088378"]} {"user_id": "u588341295", "problem_id": "p03078", "language": "python", "submission_id_v0": "s622309249", "submission_id_v1": "s171509372", "cpu_time_v0": 118, "cpu_time_v1": 37, "memory_v0": 8728, "memory_v1": 4976, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 68.64, "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(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", "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(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", "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(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", "code_same": false, "relative_loc_diff_percent": 11.9047619048, "diff": ["+from heapq import heappush, heappop", "-ABC = []", "-for i in range(X):", "- for j in range(Y):", "- if (i + 1) * (j + 1) > K:", "- break", "- for k in range(Z):", "- if (i + 1) * (j + 1) * (k + 1) > K:", "- break", "- ABC.append(A[i] + B[j] + C[k])", "-ABC.sort(reverse=True)", "+que = []", "+heappush(que, (-(A[0] + B[0] + C[0]), 0, 0, 0))", "+S = {(0, 0, 0)}", "- print((ABC[i]))", "+ ans = heappop(que)", "+ print((-ans[0]))", "+ a, b, c = ans[1:]", "+ if a + 1 < X and (a + 1, b, c) not in S:", "+ heappush(que, (-(A[a + 1] + B[b] + C[c]), a + 1, b, c))", "+ S.add((a + 1, b, c))", "+ if b + 1 < Y and (a, b + 1, c) not in S:", "+ heappush(que, (-(A[a] + B[b + 1] + C[c]), a, b + 1, c))", "+ S.add((a, b + 1, c))", "+ if c + 1 < Z and (a, b, c + 1) not in S:", "+ heappush(que, (-(A[a] + B[b] + C[c + 1]), a, b, c + 1))", "+ S.add((a, b, c + 1))"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2840606916, "measured_runtime_v1": 0.2124910862, "runtime_lift": 1.3368122711, "key": ["s622309249", "s171509372"]} {"user_id": "u864197622", "problem_id": "p02758", "language": "python", "submission_id_v0": "s598598719", "submission_id_v1": "s066197035", "cpu_time_v0": 1348, "cpu_time_v1": 954, "memory_v0": 102564, "memory_v1": 97192, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 29.23, "input": "mod = 998244353\n\nN = int(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]))", "target": "import sys\n\ninput = sys.stdin.readline\n\n\n\nmod = 998244353\n\nN = int(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]))", "code_v0_loc": 32, "code_v1_loc": 35, "code_v0_num_chars": 675, "code_v1_num_chars": 717, "code_v0_no_empty_lines": "mod = 998244353\nN = int(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", "code_v1_no_empty_lines": "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nN = int(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", "code_same": false, "relative_loc_diff_percent": 8.5714285714, "diff": ["+import sys", "+", "+input = sys.stdin.readline"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2547301891, "measured_runtime_v1": 0.0065454967, "runtime_lift": 38.9168615134, "key": ["s598598719", "s066197035"]} {"user_id": "u297574184", "problem_id": "p02792", "language": "python", "submission_id_v0": "s401307257", "submission_id_v1": "s179676165", "cpu_time_v0": 236, "cpu_time_v1": 18, "memory_v0": 3064, "memory_v1": 3064, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 92.37, "input": "def solve():\n\n N = int(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", "target": "def solve():\n\n strN = 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", "code_v0_loc": 32, "code_v1_loc": 37, "code_v0_num_chars": 778, "code_v1_num_chars": 917, "code_v0_no_empty_lines": "def solve():\n N = int(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", "code_v1_no_empty_lines": "def solve():\n strN = 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", "code_same": false, "relative_loc_diff_percent": 13.5135135135, "diff": ["- N = int(input())", "+ strN = input()", "+ N = int(strN)", "+ maxD = len(strN)", "- for d in range(1, 5):", "- for i in range(10**d):", "- j = x * 10 ** (d + 1) + i * 10 + y", "- if 1 <= j <= N:", "- num += 1", "- else:", "- break", "+ for d in range(1, maxD - 2):", "+ num += 10**d", "+ if maxD - 2 > 0:", "+ if x < int(strN[0]):", "+ num += 10 ** (maxD - 2)", "+ elif x == int(strN[0]):", "+ num += int(strN[1:-1]) + 1", "+ if y > int(strN[-1]):", "+ num -= 1", "- for A in range(1, N + 1):", "- ss = str(A)", "- ans += numss[int(ss[-1])][int(ss[0])]", "+ for i in range(1, 10):", "+ for j in range(1, 10):", "+ ans += numss[i][j] * numss[j][i]"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3220527915, "measured_runtime_v1": 0.2179562147, "runtime_lift": 1.4776031599, "key": ["s401307257", "s179676165"]} {"user_id": "u020390084", "problem_id": "p03309", "language": "python", "submission_id_v0": "s289814925", "submission_id_v1": "s781437429", "cpu_time_v0": 334, "cpu_time_v1": 258, "memory_v0": 27244, "memory_v1": 36640, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 22.75, "input": "import math\n\nimport statistics\n\nn = int(input())\n\na = list(map(int,input().split()))\n\na = [aa-i-1 for i, aa in enumerate(a)]\n\nanswer = n*10**20\n\nmedian_low = statistics.median_low(a)\n\nmedian_high = statistics.median_high(a)\n\n\n\nfor m in (median_low,median_high):\n\n ans=0\n\n for aa in a:\n\n ans += abs(aa-m)\n\n answer = min(ans,answer)\n\nprint(answer)\n", "target": "#!/usr/bin/env python3\n\nimport sys\n\n\n\n\n\ndef solve(N: int, A: \"List[int]\"):\n\n difA = [0]*N\n\n\n\n for i in range(N):\n\n difA[i] = A[i]-(i+1)\n\n\n\n difA.sort()\n\n if N%2 == 0:\n\n g1 = difA[N//2]\n\n g2 = difA[N//2-1]\n\n a1 = 0\n\n a2 = 0\n\n for i in range(N):\n\n a1 += abs(difA[i]-g1)\n\n a2 += abs(difA[i]-g2)\n\n print((min(a1,a2)))\n\n \n\n else:\n\n g = difA[N//2]\n\n a = 0\n\n for i in range(N):\n\n a += abs(difA[i]-g)\n\n print(a)\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 A = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\n\n solve(N, A)\n\n\n\nif __name__ == '__main__':\n\n main()\n", "code_v0_loc": 15, "code_v1_loc": 42, "code_v0_num_chars": 352, "code_v1_num_chars": 891, "code_v0_no_empty_lines": "import math\nimport statistics\n\nn = int(input())\na = list(map(int, input().split()))\na = [aa - i - 1 for i, aa in enumerate(a)]\nanswer = n * 10**20\nmedian_low = statistics.median_low(a)\nmedian_high = statistics.median_high(a)\nfor m in (median_low, median_high):\n ans = 0\n for aa in a:\n ans += abs(aa - m)\n answer = min(ans, answer)\nprint(answer)\n", "code_v1_no_empty_lines": "#!/usr/bin/env python3\nimport sys\n\n\ndef solve(N: int, A: \"List[int]\"):\n difA = [0] * N\n for i in range(N):\n difA[i] = A[i] - (i + 1)\n difA.sort()\n if N % 2 == 0:\n g1 = difA[N // 2]\n g2 = difA[N // 2 - 1]\n a1 = 0\n a2 = 0\n for i in range(N):\n a1 += abs(difA[i] - g1)\n a2 += abs(difA[i] - g2)\n print((min(a1, a2)))\n else:\n g = difA[N // 2]\n a = 0\n for i in range(N):\n a += abs(difA[i] - g)\n print(a)\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 A = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"\n solve(N, A)\n\n\nif __name__ == \"__main__\":\n main()\n", "code_same": false, "relative_loc_diff_percent": 64.2857142857, "diff": ["-import math", "-import statistics", "+#!/usr/bin/env python3", "+import sys", "-n = int(input())", "-a = list(map(int, input().split()))", "-a = [aa - i - 1 for i, aa in enumerate(a)]", "-answer = n * 10**20", "-median_low = statistics.median_low(a)", "-median_high = statistics.median_high(a)", "-for m in (median_low, median_high):", "- ans = 0", "- for aa in a:", "- ans += abs(aa - m)", "- answer = min(ans, answer)", "-print(answer)", "+", "+def solve(N: int, A: \"List[int]\"):", "+ difA = [0] * N", "+ for i in range(N):", "+ difA[i] = A[i] - (i + 1)", "+ difA.sort()", "+ if N % 2 == 0:", "+ g1 = difA[N // 2]", "+ g2 = difA[N // 2 - 1]", "+ a1 = 0", "+ a2 = 0", "+ for i in range(N):", "+ a1 += abs(difA[i] - g1)", "+ a2 += abs(difA[i] - g2)", "+ print((min(a1, a2)))", "+ else:", "+ g = difA[N // 2]", "+ a = 0", "+ for i in range(N):", "+ a += abs(difA[i] - g)", "+ print(a)", "+ return", "+", "+", "+def main():", "+ def iterate_tokens():", "+ for line in sys.stdin:", "+ for word in line.split():", "+ yield word", "+", "+ tokens = iterate_tokens()", "+ N = int(next(tokens)) # type: int", "+ A = [int(next(tokens)) for _ in range(N)] # type: \"List[int]\"", "+ solve(N, A)", "+", "+", "+if __name__ == \"__main__\":", "+ main()"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2912476273, "measured_runtime_v1": 0.217194303, "runtime_lift": 1.3409542662, "key": ["s289814925", "s781437429"]} {"user_id": "u753803401", "problem_id": "p03078", "language": "python", "submission_id_v0": "s362357786", "submission_id_v1": "s175109634", "cpu_time_v0": 451, "cpu_time_v1": 323, "memory_v0": 62572, "memory_v1": 53208, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 28.38, "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", "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", "code_v0_loc": 41, "code_v1_loc": 31, "code_v0_num_chars": 1596, "code_v1_num_chars": 979, "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", "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", "code_same": false, "relative_loc_diff_percent": 24.3902439024, "diff": ["-def slove():", "- import sys", "- import heapq", "- import collections", "+import sys", "+import collections", "+import heapq", "+", "+def solve():", "+ mod = 10**9 + 7", "+ b = list(map(int, input().rstrip(\"\\n\").split()))", "+ c = list(map(int, input().rstrip(\"\\n\").split()))", "- b = list(map(int, input().rstrip(\"\\n\").split()))", "- c = list(map(int, input().rstrip(\"\\n\").split()))", "- q = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]", "- heapq.heapify(q)", "- fq = collections.defaultdict(list)", "- fq[(-(a[0] + b[0] + c[0]), 0, 0, 0), 1] = 1", "- t = 0", "- for _ in range(k):", "- if len(q) != 0:", "- p = heapq.heappop(q)", "- t = p[0]", "- aq = p[1]", "- bq = p[2]", "- cq = p[3]", "- if aq + 1 < len(a):", "- if (-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq) not in fq:", "- heapq.heappush(q, [-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq])", "- fq[(-(a[aq + 1] + b[bq] + c[cq]), aq + 1, bq, cq)] = 1", "- if bq + 1 < len(b):", "- if (-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq) not in fq:", "- heapq.heappush(q, [-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq])", "- fq[(-(a[aq] + b[bq + 1] + c[cq]), aq, bq + 1, cq)] = 1", "- if cq + 1 < len(c):", "- if (-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1) not in fq:", "- heapq.heappush(q, [-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1])", "- fq[(-(a[aq] + b[bq] + c[cq + 1]), aq, bq, cq + 1)] = 1", "- print((-t))", "+ ql = [[-(a[0] + b[0] + c[0]), 0, 0, 0]]", "+ heapq.heapify(ql)", "+ fq = collections.defaultdict(int)", "+ fq[0, 0, 0]", "+ for i in range(k):", "+ s, ap, bp, cp = heapq.heappop(ql)", "+ for app, bpp, cpp in [[ap + 1, bp, cp], [ap, bp + 1, cp], [ap, bp, cp + 1]]:", "+ if app < x and bpp < y and cpp < z:", "+ if (app, bpp, cpp) not in fq:", "+ heapq.heappush(ql, [-(a[app] + b[bpp] + c[cpp]), app, bpp, cpp])", "+ fq[app, bpp, cpp]", "+ print((-s))", "- slove()", "+ solve()"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3093440776, "measured_runtime_v1": 0.1565137908, "runtime_lift": 1.9764653063, "key": ["s362357786", "s175109634"]} {"user_id": "u881590806", "problem_id": "p02264", "language": "python", "submission_id_v0": "s309974156", "submission_id_v1": "s779537604", "cpu_time_v0": 780, "cpu_time_v1": 600, "memory_v0": 14072, "memory_v1": 28548, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 23.08, "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])", "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", "code_v0_loc": 44, "code_v1_loc": 48, "code_v0_num_chars": 881, "code_v1_num_chars": 1197, "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", "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", "code_same": false, "relative_loc_diff_percent": 8.3333333333, "diff": ["- def __init__(self, values):", "- self.values = values", "+ def __init__(self, l):", "+ self.values = []", "+ self.l = l", "+ for _ in range(l):", "+ self.values.append(None)", "+ self.head = 0", "+ self.tail = 0", "- def empty(self):", "- if len(self.values) == 0:", "- return True", "+ def inc(self, n):", "+ if n + 1 >= self.l:", "+ return 0", "- return False", "+ return n + 1", "- self.values.append(v)", "+ if self.inc(self.head) == self.tail:", "+ print(\"overflow\")", "+ exit()", "+ self.values[self.head] = v", "+ self.head = self.inc(self.head)", "- if len(self.values) <= 0:", "- raise", "+ if self.head == self.tail:", "+ print(\"underflow\")", "+ exit()", "+ v = self.values[self.tail]", "+ self.tail = self.inc(self.tail)", "+ return v", "+", "+ def size(self):", "+ if self.head >= self.tail:", "+ return self.head - self.tail", "- v = self.values[0]", "- del self.values[0]", "- return v", "+ self.head + (self.l - self.tail)", "-processes = []", "-for i in range(n):", "+queue = Queue(200000)", "+for _ in range(n):", "- processes.append((n, int(t)))", "-queue = Queue(processes)", "-clock = 0", "-done = []", "-while not queue.empty():", "- p = queue.dequeue()", "- n = p[0]", "- t = p[1]", "+ t = int(t)", "+ queue.enqueue((n, t))", "+c = 0", "+while queue.size() > 0:", "+ n, t = queue.dequeue()", "- clock += t", "- done.append((n, clock))", "+ c += t", "+ print(n, c)", "- clock += q", "-for p in done:", "- print(p[0], p[1])", "+ c += q"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3044010155, "measured_runtime_v1": 0.1198908706, "runtime_lift": 2.5389841115, "key": ["s309974156", "s779537604"]} {"user_id": "u906428167", "problem_id": "p02821", "language": "python", "submission_id_v0": "s228028161", "submission_id_v1": "s587768475", "cpu_time_v0": 305, "cpu_time_v1": 262, "memory_v0": 55448, "memory_v1": 54460, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 14.1, "input": "from bisect import bisect_left\n\nfrom bisect import bisect_right\n\n\n\nn,m = list(map(int, input().split()))\n\na = list(map(int, input().split()))\n\na = sorted(a)\n\n\n\na_count = [0]*100010\n\na_sum = [0]*100010\n\n\n\nfor i in range(n):\n\n a_count[a[i]] += 1\n\n a_sum[a[i]] += a[i]\n\n\n\nfor i in range(100005,-1,-1):\n\n a_count[i] += a_count[i+1]\n\n a_sum[i] += a_sum[i+1]\n\n\n\ndef chk(x):\n\n case = 0\n\n for i in range(n):\n\n if 0<= x-a[i]<= 10**5+5:\n\n case += a_count[x-a[i]]\n\n elif x-a[i] < 0:\n\n case += n\n\n if case >= m:\n\n ch = True\n\n else:\n\n ch = False\n\n return ch\n\n\n\nl = 2*a[-1]+1 #NG\n\nr = 1 #OK\n\n\n\nwhile abs(r-l) > 1:\n\n kk = (r+l)//2\n\n if chk(kk):\n\n r = kk\n\n else:\n\n l = kk\n\n\n\nans = 0\n\nsm = sum(a)\n\n\n\nl = r\n\n\n\ncase = 0\n\nfor i in range(n):\n\n num = n-bisect_right(a,l-a[i]-1)\n\n case += num\n\n ans += num*a[i]*2\n\n\n\nans -= (case-m)*l\n\n\n\nprint(ans)", "target": "n, m = list(map(int, input().split()))\n\na = [int(x) for x in input().split()]\n\n\n\naa = [0]*(10**5+1)\n\naa_sum = [0]*(10**5+1)\n\n\n\nfor x in a:\n\n aa[x] += 1\n\n aa_sum[x] += x\n\n\n\nfor i in range(10**5)[::-1]:\n\n aa[i] = aa[i] + aa[i+1]\n\n aa_sum[i] = aa_sum[i] + aa_sum[i+1]\n\n\n\n\n\ndef count(x):\n\n cnt = 0\n\n sm = 0\n\n for i in range(n):\n\n if x-a[i] < 0:\n\n cnt += n\n\n sm += aa_sum[0]+n*a[i]\n\n elif x-a[i] > 10**5:\n\n continue\n\n else:\n\n cnt += aa[x-a[i]]\n\n sm += aa_sum[x-a[i]]+aa[x-a[i]]*a[i]\n\n\n\n return cnt, sm\n\n\n\n\n\nbottom = 0\n\ntop = 10**6\n\n\n\nwhile top - bottom > 1:\n\n mid = (top+bottom) // 2\n\n cnt, sm = count(mid)\n\n if cnt < m:\n\n top = mid\n\n else:\n\n bottom = mid\n\n\n\ncnt, sm = count(bottom)\n\nans = sm - (cnt-m)*bottom\n\n\n\nprint(ans)\n", "code_v0_loc": 55, "code_v1_loc": 46, "code_v0_num_chars": 930, "code_v1_num_chars": 839, "code_v0_no_empty_lines": "from bisect import bisect_left\nfrom bisect import bisect_right\n\nn, m = list(map(int, input().split()))\na = list(map(int, input().split()))\na = sorted(a)\na_count = [0] * 100010\na_sum = [0] * 100010\nfor i in range(n):\n a_count[a[i]] += 1\n a_sum[a[i]] += a[i]\nfor i in range(100005, -1, -1):\n a_count[i] += a_count[i + 1]\n a_sum[i] += a_sum[i + 1]\n\n\ndef chk(x):\n case = 0\n for i in range(n):\n if 0 <= x - a[i] <= 10**5 + 5:\n case += a_count[x - a[i]]\n elif x - a[i] < 0:\n case += n\n if case >= m:\n ch = True\n else:\n ch = False\n return ch\n\n\nl = 2 * a[-1] + 1 # NG\nr = 1 # OK\nwhile abs(r - l) > 1:\n kk = (r + l) // 2\n if chk(kk):\n r = kk\n else:\n l = kk\nans = 0\nsm = sum(a)\nl = r\ncase = 0\nfor i in range(n):\n num = n - bisect_right(a, l - a[i] - 1)\n case += num\n ans += num * a[i] * 2\nans -= (case - m) * l\nprint(ans)\n", "code_v1_no_empty_lines": "n, m = list(map(int, input().split()))\na = [int(x) for x in input().split()]\naa = [0] * (10**5 + 1)\naa_sum = [0] * (10**5 + 1)\nfor x in a:\n aa[x] += 1\n aa_sum[x] += x\nfor i in range(10**5)[::-1]:\n aa[i] = aa[i] + aa[i + 1]\n aa_sum[i] = aa_sum[i] + aa_sum[i + 1]\n\n\ndef count(x):\n cnt = 0\n sm = 0\n for i in range(n):\n if x - a[i] < 0:\n cnt += n\n sm += aa_sum[0] + n * a[i]\n elif x - a[i] > 10**5:\n continue\n else:\n cnt += aa[x - a[i]]\n sm += aa_sum[x - a[i]] + aa[x - a[i]] * a[i]\n return cnt, sm\n\n\nbottom = 0\ntop = 10**6\nwhile top - bottom > 1:\n mid = (top + bottom) // 2\n cnt, sm = count(mid)\n if cnt < m:\n top = mid\n else:\n bottom = mid\ncnt, sm = count(bottom)\nans = sm - (cnt - m) * bottom\nprint(ans)\n", "code_same": false, "relative_loc_diff_percent": 16.3636363636, "diff": ["-from bisect import bisect_left", "-from bisect import bisect_right", "-", "-a = list(map(int, input().split()))", "-a = sorted(a)", "-a_count = [0] * 100010", "-a_sum = [0] * 100010", "-for i in range(n):", "- a_count[a[i]] += 1", "- a_sum[a[i]] += a[i]", "-for i in range(100005, -1, -1):", "- a_count[i] += a_count[i + 1]", "- a_sum[i] += a_sum[i + 1]", "+a = [int(x) for x in input().split()]", "+aa = [0] * (10**5 + 1)", "+aa_sum = [0] * (10**5 + 1)", "+for x in a:", "+ aa[x] += 1", "+ aa_sum[x] += x", "+for i in range(10**5)[::-1]:", "+ aa[i] = aa[i] + aa[i + 1]", "+ aa_sum[i] = aa_sum[i] + aa_sum[i + 1]", "-def chk(x):", "- case = 0", "+def count(x):", "+ cnt = 0", "+ sm = 0", "- if 0 <= x - a[i] <= 10**5 + 5:", "- case += a_count[x - a[i]]", "- elif x - a[i] < 0:", "- case += n", "- if case >= m:", "- ch = True", "- else:", "- ch = False", "- return ch", "+ if x - a[i] < 0:", "+ cnt += n", "+ sm += aa_sum[0] + n * a[i]", "+ elif x - a[i] > 10**5:", "+ continue", "+ else:", "+ cnt += aa[x - a[i]]", "+ sm += aa_sum[x - a[i]] + aa[x - a[i]] * a[i]", "+ return cnt, sm", "-l = 2 * a[-1] + 1 # NG", "-r = 1 # OK", "-while abs(r - l) > 1:", "- kk = (r + l) // 2", "- if chk(kk):", "- r = kk", "+bottom = 0", "+top = 10**6", "+while top - bottom > 1:", "+ mid = (top + bottom) // 2", "+ cnt, sm = count(mid)", "+ if cnt < m:", "+ top = mid", "- l = kk", "-ans = 0", "-sm = sum(a)", "-l = r", "-case = 0", "-for i in range(n):", "- num = n - bisect_right(a, l - a[i] - 1)", "- case += num", "- ans += num * a[i] * 2", "-ans -= (case - m) * l", "+ bottom = mid", "+cnt, sm = count(bottom)", "+ans = sm - (cnt - m) * bottom"], "diff_only_import_comment": false, "measured_runtime_v0": 0.6311447213, "measured_runtime_v1": 0.3899716654, "runtime_lift": 1.6184373822, "key": ["s228028161", "s587768475"]} {"user_id": "u260980560", "problem_id": "p01105", "language": "python", "submission_id_v0": "s936098014", "submission_id_v1": "s480075396", "cpu_time_v0": 50, "cpu_time_v1": 40, "memory_v0": 8604, "memory_v1": 8508, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 20.0, "input": "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\nget = L.get\n\npush = H.append\n\nwhile Q:\n\n l, p = heappop(Q)\n\n if L[p] < l: continue\n\n if l+1 < 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 < 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 < 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: push((p, l))\n\nprint(*map(L.__getitem__, eval(\"e&%s\"%\",e&\".join(open(0).read().replace(*\"-~\").replace(*\"*&\").replace(*\"1e\").split()[:-1]))),sep='\\n')\n", "target": "a=65280; b=61680; c=52428; d=43690; e=65535\n\nfrom heapq import heappush, heappop\n\nQ = [(1, a), (1, b), (1, c), (1, d)]\n\nL = {a: 1, b: 1, c: 1, d: 1, e: 1, e: 1, 0: 1}\n\nH = []\n\nget = L.get\n\npush = H.append\n\nwhile Q:\n\n l, p = heappop(Q)\n\n if L[p] < l: continue\n\n if l+1 < get(p ^ e, 17):\n\n L[p ^ e] = l+1\n\n l < 15 and heappush(Q, (l+1, p ^ e))\n\n if l < 13:\n\n li = 13-l; l3 = 3+l\n\n for q, r in H:\n\n if r <= li:\n\n k = p & q\n\n if r < get(k, 17)-l3:\n\n L[k] = l3+r\n\n r < li and heappush(Q, (l3+r, k))\n\n k = p ^ q\n\n if r < get(k, 17)-l3:\n\n L[k] = l3+r\n\n r < li and heappush(Q, (l3+r, k))\n\n else: break\n\n if l < 7: push((p, l))\n\nprint(*map(L.__getitem__, eval(\"e&\"+\",e&\".join(open(0).read().replace(*\"-~\").replace(*\"*&\").replace(*\"1e\").split()[:-1]))),sep='\\n')\n", "code_v0_loc": 26, "code_v1_loc": 28, "code_v0_num_chars": 917, "code_v1_num_chars": 953, "code_v0_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 = []\nget = L.get\npush = H.append\nwhile Q:\n l, p = heappop(Q)\n if L[p] < l:\n continue\n if l + 1 < 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 < 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 < 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 push((p, l))\nprint(\n *map(\n L.__getitem__,\n eval(\n \"e&%s\"\n % \",e&\".join(\n open(0).read().replace(*\"-~\").replace(*\"*&\").replace(*\"1e\").split()[:-1]\n )\n ),\n ),\n sep=\"\\n\"\n)\n", "code_v1_no_empty_lines": "a = 65280\nb = 61680\nc = 52428\nd = 43690\ne = 65535\nfrom heapq import heappush, heappop\n\nQ = [(1, a), (1, b), (1, c), (1, d)]\nL = {a: 1, b: 1, c: 1, d: 1, e: 1, e: 1, 0: 1}\nH = []\nget = L.get\npush = H.append\nwhile Q:\n l, p = heappop(Q)\n if L[p] < l:\n continue\n if l + 1 < get(p ^ e, 17):\n L[p ^ e] = l + 1\n l < 15 and heappush(Q, (l + 1, p ^ e))\n if l < 13:\n li = 13 - l\n l3 = 3 + l\n for q, r in H:\n if r <= li:\n k = p & q\n if r < get(k, 17) - l3:\n L[k] = l3 + r\n r < li and heappush(Q, (l3 + r, k))\n k = p ^ q\n if r < get(k, 17) - l3:\n L[k] = l3 + r\n r < li and heappush(Q, (l3 + r, k))\n else:\n break\n if l < 7:\n push((p, l))\nprint(\n *map(\n L.__getitem__,\n eval(\n \"e&\"\n + \",e&\".join(\n open(0).read().replace(*\"-~\").replace(*\"*&\").replace(*\"1e\").split()[:-1]\n )\n ),\n ),\n sep=\"\\n\"\n)\n", "code_same": false, "relative_loc_diff_percent": 7.1428571429, "diff": ["-base = [a, b, c, d, e, 0]", "-Q = [(1, el) for el in base]", "-L = {el: 1 for el in base}", "+Q = [(1, a), (1, b), (1, c), (1, d)]", "+L = {a: 1, b: 1, c: 1, d: 1, e: 1, e: 1, 0: 1}", "- if l + 1 < 16:", "- heappush(Q, (l + 1, p ^ e))", "- if l + 3 < 16:", "+ l < 15 and heappush(Q, (l + 1, p ^ e))", "+ if l < 13:", "+ li = 13 - l", "+ l3 = 3 + l", "- if l + r + 3 <= 16:", "- if l + r + 3 < get(p & q, 17):", "- L[p & q] = l + r + 3", "- if l + r + 3 < 16:", "- heappush(Q, (l + r + 3, p & q))", "- if l + r + 3 < get(p ^ q, 17):", "- L[p ^ q] = l + r + 3", "- if l + r + 3 < 16:", "- heappush(Q, (l + r + 3, p ^ q))", "+ if r <= li:", "+ k = p & q", "+ if r < get(k, 17) - l3:", "+ L[k] = l3 + r", "+ r < li and heappush(Q, (l3 + r, k))", "+ k = p ^ q", "+ if r < get(k, 17) - l3:", "+ L[k] = l3 + r", "+ r < li and heappush(Q, (l3 + r, k))", "- \"e&%s\"", "- % \",e&\".join(", "+ \"e&\"", "+ + \",e&\".join("], "diff_only_import_comment": false, "measured_runtime_v0": 0.4434673564, "measured_runtime_v1": 0.3305070457, "runtime_lift": 1.3417788278, "key": ["s936098014", "s480075396"]} {"user_id": "u638795007", "problem_id": "p04020", "language": "python", "submission_id_v0": "s043977447", "submission_id_v1": "s372001933", "cpu_time_v0": 265, "cpu_time_v1": 111, "memory_v0": 44252, "memory_v1": 8004, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 58.11, "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", "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\"\"\"", "code_v0_loc": 26, "code_v1_loc": 74, "code_v0_num_chars": 729, "code_v1_num_chars": 1504, "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", "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", "code_same": false, "relative_loc_diff_percent": 64.8648648649, "diff": ["+def examA():", "+ S = SI()", "+ if \"W\" in S and not \"E\" in S:", "+ print(\"No\")", "+ elif \"E\" in S and not \"W\" in S:", "+ print(\"No\")", "+ elif \"N\" in S and not \"S\" in S:", "+ print(\"No\")", "+ elif \"S\" in S and not \"N\" in S:", "+ print(\"No\")", "+ else:", "+ print(\"Yes\")", "+ return", "+", "+", "- cur = 0", "- for i in A:", "- if i == 0:", "- ans += cur // 2", "- cur = 0", "- else:", "- cur += i", "- ans += cur // 2", "+ for i in range(N - 1):", "+ ans += A[i] // 2", "+ if A[i] % 2 and A[i + 1] >= 1:", "+ ans += 1", "+ A[i + 1] -= 1", "+ ans += A[N - 1] // 2", "-import sys, copy, bisect, itertools, heapq, math", "+def examC():", "+ ans = 0", "+ print(ans)", "+ return", "+", "+", "+def examD():", "+ N = I()", "+ S = [I() for _ in range(N)]", "+ ans = 0", "+ print(ans)", "+ return", "+", "+", "+def examE():", "+ ans = 0", "+ print(ans)", "+ return", "+", "+", "+def examF():", "+ ans = 0", "+ print(ans)", "+ return", "+", "+", "+import sys, bisect, itertools, heapq, math, random", "+from copy import deepcopy", "+global mod, mod2, inf, alphabet, _ep", "-inf = float(\"inf\")", "+mod2 = 998244353", "+inf = 10**18", "+_ep = 10 ** (-12)", "+alphabet = [chr(ord(\"a\") + i) for i in range(26)]", "+sys.setrecursionlimit(10**6)", "+\"\"\"", "+\"\"\""], "diff_only_import_comment": false, "measured_runtime_v0": 0.1928541586, "measured_runtime_v1": 0.006450581, "runtime_lift": 29.8971764609, "key": ["s043977447", "s372001933"]} {"user_id": "u607865971", "problem_id": "p03164", "language": "python", "submission_id_v0": "s900171177", "submission_id_v1": "s494365384", "cpu_time_v0": 1438, "cpu_time_v1": 1016, "memory_v0": 27184, "memory_v1": 19300, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 29.35, "input": "import sys\n\nfrom collections import Counter, deque, defaultdict\n\nfrom itertools import accumulate, permutations, combinations, takewhile, compress, cycle\n\nfrom functools import reduce\n\nfrom math import ceil, floor, log10, log2, factorial\n\nfrom pprint import pprint\n\n\n\nsys.setrecursionlimit(1000000)\n\n# MOD = 10 ** 9 + 7\n\n# N = int(input())\n\n# A = [int(x) for x in input().split()]\n\n# V = [[0] * 100 for _ in range(100)]\n\n# A = [int(input()) for _ in range(N)]\n\n\n\nN, W = [int(x) for x in input().split()]\n\n\n\ndp = [float('inf')] * 1000 * 100*10\n\nvs = set()\n\nvs.add(0)\n\ndp[0] = 0\n\n\n\nfor i in range(N):\n\n w, v = [int(x) for x in input().split()]\n\n\n\n tmpDP = dp.copy()\n\n for vv in list(vs):\n\n if dp[vv + v] > dp[vv] + w:\n\n tmpDP[vv + v] = dp[vv] + w\n\n vs.add(vv + v)\n\n dp = tmpDP\n\n\n\n\n\nans = 0\n\nfor v in list(vs):\n\n if dp[v] <= W:\n\n ans = max(ans, v)\n\nprint(ans)\n", "target": "import sys\n\nfrom collections import Counter, deque, defaultdict\n\nfrom itertools import accumulate, permutations, combinations, takewhile, compress, cycle\n\nfrom functools import reduce\n\nfrom math import ceil, floor, log10, log2, factorial\n\nfrom pprint import pprint\n\n\n\nsys.setrecursionlimit(1000000)\n\n# MOD = 10 ** 9 + 7\n\n# N = int(input())\n\n# A = [int(x) for x in input().split()]\n\n# V = [[0] * 100 for _ in range(100)]\n\n# A = [int(input()) for _ in range(N)]\n\n\n\nN, W = [int(x) for x in input().split()]\n\n\n\ndp = defaultdict(lambda: float('inf'))\n\ndp[0] = 0\n\n\n\nfor i in range(N):\n\n w, v = [int(x) for x in input().split()]\n\n\n\n add = defaultdict(lambda: float('inf'))\n\n for vv in list(dp.keys()):\n\n if dp[vv + v] > dp[vv] + w:\n\n add[vv + v] = dp[vv] + w\n\n dp.update(add)\n\n\n\nprint((max([i for i in list(dp.items()) if i[1] <= W], key=lambda x:x[0])[0]))\n", "code_v0_loc": 37, "code_v1_loc": 29, "code_v0_num_chars": 908, "code_v1_num_chars": 876, "code_v0_no_empty_lines": "import sys\nfrom collections import Counter, deque, defaultdict\nfrom itertools import accumulate, permutations, combinations, takewhile, compress, cycle\nfrom functools import reduce\nfrom math import ceil, floor, log10, log2, factorial\nfrom pprint import pprint\n\nsys.setrecursionlimit(1000000)\n# MOD = 10 ** 9 + 7\n# N = int(input())\n# A = [int(x) for x in input().split()]\n# V = [[0] * 100 for _ in range(100)]\n# A = [int(input()) for _ in range(N)]\nN, W = [int(x) for x in input().split()]\ndp = [float(\"inf\")] * 1000 * 100 * 10\nvs = set()\nvs.add(0)\ndp[0] = 0\nfor i in range(N):\n w, v = [int(x) for x in input().split()]\n tmpDP = dp.copy()\n for vv in list(vs):\n if dp[vv + v] > dp[vv] + w:\n tmpDP[vv + v] = dp[vv] + w\n vs.add(vv + v)\n dp = tmpDP\nans = 0\nfor v in list(vs):\n if dp[v] <= W:\n ans = max(ans, v)\nprint(ans)\n", "code_v1_no_empty_lines": "import sys\nfrom collections import Counter, deque, defaultdict\nfrom itertools import accumulate, permutations, combinations, takewhile, compress, cycle\nfrom functools import reduce\nfrom math import ceil, floor, log10, log2, factorial\nfrom pprint import pprint\n\nsys.setrecursionlimit(1000000)\n# MOD = 10 ** 9 + 7\n# N = int(input())\n# A = [int(x) for x in input().split()]\n# V = [[0] * 100 for _ in range(100)]\n# A = [int(input()) for _ in range(N)]\nN, W = [int(x) for x in input().split()]\ndp = defaultdict(lambda: float(\"inf\"))\ndp[0] = 0\nfor i in range(N):\n w, v = [int(x) for x in input().split()]\n add = defaultdict(lambda: float(\"inf\"))\n for vv in list(dp.keys()):\n if dp[vv + v] > dp[vv] + w:\n add[vv + v] = dp[vv] + w\n dp.update(add)\nprint((max([i for i in list(dp.items()) if i[1] <= W], key=lambda x: x[0])[0]))\n", "code_same": false, "relative_loc_diff_percent": 21.6216216216, "diff": ["-dp = [float(\"inf\")] * 1000 * 100 * 10", "-vs = set()", "-vs.add(0)", "+dp = defaultdict(lambda: float(\"inf\"))", "- tmpDP = dp.copy()", "- for vv in list(vs):", "+ add = defaultdict(lambda: float(\"inf\"))", "+ for vv in list(dp.keys()):", "- tmpDP[vv + v] = dp[vv] + w", "- vs.add(vv + v)", "- dp = tmpDP", "-ans = 0", "-for v in list(vs):", "- if dp[v] <= W:", "- ans = max(ans, v)", "-print(ans)", "+ add[vv + v] = dp[vv] + w", "+ dp.update(add)", "+print((max([i for i in list(dp.items()) if i[1] <= W], key=lambda x: x[0])[0]))"], "diff_only_import_comment": false, "measured_runtime_v0": 0.5805827644, "measured_runtime_v1": 0.1952783756, "runtime_lift": 2.9731032046, "key": ["s900171177", "s494365384"]} {"user_id": "u670180528", "problem_id": "p03806", "language": "python", "submission_id_v0": "s355426542", "submission_id_v1": "s468498336", "cpu_time_v0": 1133, "cpu_time_v1": 172, "memory_v0": 4980, "memory_v1": 4980, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 84.82, "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()", "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", "code_v0_loc": 21, "code_v1_loc": 27, "code_v0_num_chars": 492, "code_v1_num_chars": 590, "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", "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", "code_same": false, "relative_loc_diff_percent": 22.2222222222, "diff": ["+ ua = ub = 15", "- for i in range(400, -1, -1):", "- for j in range(400, -1, -1):", "+ for i in range(ua, -1, -1):", "+ for j in range(ub, -1, -1):", "+ if ua < i + a:", "+ ua = i + a", "+ if ub < j + b:", "+ ub = j + b"], "diff_only_import_comment": false, "measured_runtime_v0": 1.1710306553, "measured_runtime_v1": 0.275720624, "runtime_lift": 4.2471638081, "key": ["s355426542", "s468498336"]} {"user_id": "u761529120", "problem_id": "p03634", "language": "python", "submission_id_v0": "s135133436", "submission_id_v1": "s083939253", "cpu_time_v0": 1459, "cpu_time_v1": 754, "memory_v0": 135740, "memory_v1": 94752, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 48.32, "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(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]))", "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(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()", "code_v0_loc": 29, "code_v1_loc": 48, "code_v0_num_chars": 553, "code_v1_num_chars": 1130, "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(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", "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(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", "code_same": false, "relative_loc_diff_percent": 39.5833333333, "diff": ["+import heapq", "-sys.setrecursionlimit(10**6)", "+input = sys.stdin.readline", "-def dfs(v, p, d):", "- for i, j in tree[v]:", "- if i != p:", "- depth[i] = d + j", "- dfs(i, v, d + j)", "+def dijkstra(s, edge, N):", "+ d = [float(\"inf\")] * N", "+ used = [True] * N", "+ d[s] = 0", "+ used[s] = False", "+ edgelist = []", "+ for a, b in edge[s]:", "+ heapq.heappush(edgelist, a * (10**6) + b)", "+ while len(edgelist):", "+ minedge = heapq.heappop(edgelist)", "+ if not used[minedge % (10**6)]:", "+ continue", "+ v = minedge % (10**6)", "+ d[v] = minedge // (10**6)", "+ used[v] = False", "+ for e in edge[v]:", "+ if used[e[1]]:", "+ heapq.heappush(edgelist, (e[0] + d[v]) * (10**6) + e[1])", "+ return d", "-N = int(input())", "-tree = [[] for _ in range(N)]", "-for i in range(N - 1):", "- a, b, c = list(map(int, input().split()))", "- a -= 1", "- b -= 1", "- tree[a].append((b, c))", "- tree[b].append((a, c))", "-Q, K = list(map(int, input().split()))", "-depth = [0 for i in range(N)]", "-depth[K - 1] = 0", "-dfs(K - 1, -1, 0)", "-for _ in range(Q):", "- x, y = list(map(int, input().split()))", "- print((depth[x - 1] + depth[y - 1]))", "+def main():", "+ N = int(input())", "+ edge = [[] for _ in range(N)]", "+ for _ in range(N - 1):", "+ a, b, c = list(map(int, input().split()))", "+ a -= 1", "+ b -= 1", "+ edge[a].append([c, b])", "+ edge[b].append([c, a])", "+ Q, K = list(map(int, input().split()))", "+ K -= 1", "+ d = dijkstra(K, edge, N)", "+ for _ in range(Q):", "+ x, y = list(map(int, input().split()))", "+ x -= 1", "+ y -= 1", "+ print((d[x] + d[y]))", "+", "+", "+if __name__ == \"__main__\":", "+ main()"], "diff_only_import_comment": false, "measured_runtime_v0": 0.5217886055, "measured_runtime_v1": 0.3235212803, "runtime_lift": 1.6128416807, "key": ["s135133436", "s083939253"]} {"user_id": "u968166680", "problem_id": "p02599", "language": "python", "submission_id_v0": "s648865207", "submission_id_v1": "s892817156", "cpu_time_v0": 1665, "cpu_time_v1": 1042, "memory_v0": 247668, "memory_v1": 267648, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 37.42, "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\nMOD = 1000000007\n\n\n\n# Reference: https://www.geeksforgeeks.org/queries-number-distinct-elements-subarray/\n\n# Python3 code to find number of\n\n# distinct numbers in a subarray\n\nMAX = 1000001\n\n\n\n# structure to store queries\n\nclass Query:\n\n def __init__(self, l, r, idx):\n\n self.l = l\n\n self.r = r\n\n self.idx = idx\n\n\n\n\n\n# updating the bit array\n\ndef update(idx, val, bit, n):\n\n while idx <= n:\n\n bit[idx] += val\n\n idx += idx & -idx\n\n\n\n\n\n# querying the bit array\n\ndef query(idx, bit, n):\n\n summ = 0\n\n while idx:\n\n summ += bit[idx]\n\n idx -= idx & -idx\n\n return summ\n\n\n\n\n\ndef answeringQueries(arr, n, queries, q):\n\n\n\n # initialising bit array\n\n bit = [0] * (n + 1)\n\n\n\n # holds the rightmost index of\n\n # any number as numbers of a[i]\n\n # are less than or equal to 10^6\n\n last_visit = [-1] * MAX\n\n\n\n # answer for each query\n\n ans = [0] * q\n\n\n\n query_counter = 0\n\n for i in range(n):\n\n\n\n # If last visit is not -1 update -1 at the\n\n # idx equal to last_visit[arr[i]]\n\n if last_visit[arr[i]] != -1:\n\n update(last_visit[arr[i]] + 1, -1, bit, n)\n\n\n\n # Setting last_visit[arr[i]] as i and\n\n # updating the bit array accordingly\n\n last_visit[arr[i]] = i\n\n update(i + 1, 1, bit, n)\n\n\n\n # If i is equal to r of any query store answer\n\n # for that query in ans[]\n\n while query_counter < q and queries[query_counter].r == i:\n\n ans[queries[query_counter].idx] = query(queries[query_counter].r + 1, bit, n) - query(\n\n queries[query_counter].l, bit, n\n\n )\n\n query_counter += 1\n\n\n\n # print answer for each query\n\n for i in range(q):\n\n print((ans[i]))\n\n\n\n\n\n# This code is contributed by\n\n# sanjeev2552\n\n\n\n\n\ndef main():\n\n N, Q = list(map(int, readline().split()))\n\n C = list(map(int, readline().split()))\n\n (*LR,) = list(map(int, read().split()))\n\n\n\n queries = [0] * Q\n\n for i, (l, r) in enumerate(zip(*[iter(LR)] * 2)):\n\n queries[i] = Query(l - 1, r - 1, i)\n\n\n\n queries.sort(key=lambda x: x.r)\n\n answeringQueries(C, N, queries, Q)\n\n\n\n return\n\n\n\n\n\nif __name__ == '__main__':\n\n main()\n\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\nMOD = 1000000007\n\n\n\n\n\nclass BIT:\n\n def __init__(self, n):\n\n self.n = n\n\n self.data = [0] * (n + 1)\n\n\n\n def add(self, i, x=1):\n\n i += 1\n\n while i <= self.n:\n\n self.data[i] += x\n\n i += i & -i\n\n\n\n def get_sum(self, i):\n\n i += 1\n\n x = 0\n\n while i > 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", "code_v0_loc": 99, "code_v1_loc": 68, "code_v0_num_chars": 2366, "code_v1_num_chars": 1436, "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", "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", "code_same": false, "relative_loc_diff_percent": 31.3131313131, "diff": ["-# Reference: https://www.geeksforgeeks.org/queries-number-distinct-elements-subarray/", "-# Python3 code to find number of", "-# distinct numbers in a subarray", "-MAX = 1000001", "-# structure to store queries", "-class Query:", "- def __init__(self, l, r, idx):", "- self.l = l", "- self.r = r", "- self.idx = idx", "-# updating the bit array", "-def update(idx, val, bit, n):", "- while idx <= n:", "- bit[idx] += val", "- idx += idx & -idx", "+class BIT:", "+ def __init__(self, n):", "+ self.n = n", "+ self.data = [0] * (n + 1)", "+", "+ def add(self, i, x=1):", "+ i += 1", "+ while i <= self.n:", "+ self.data[i] += x", "+ i += i & -i", "+", "+ def get_sum(self, i):", "+ i += 1", "+ x = 0", "+ while i > 0:", "+ x += self.data[i]", "+ i -= i & -i", "+ return x", "+", "+ # Return sum for [l, r)", "+ def get_sum_range(self, l, r):", "+ return self.get_sum(r - 1) - self.get_sum(l - 1)", "-# querying the bit array", "-def query(idx, bit, n):", "- summ = 0", "- while idx:", "- summ += bit[idx]", "- idx -= idx & -idx", "- return summ", "-", "-", "-def answeringQueries(arr, n, queries, q):", "- # initialising bit array", "- bit = [0] * (n + 1)", "- # holds the rightmost index of", "- # any number as numbers of a[i]", "- # are less than or equal to 10^6", "- last_visit = [-1] * MAX", "- # answer for each query", "- ans = [0] * q", "- query_counter = 0", "- for i in range(n):", "- # If last visit is not -1 update -1 at the", "- # idx equal to last_visit[arr[i]]", "- if last_visit[arr[i]] != -1:", "- update(last_visit[arr[i]] + 1, -1, bit, n)", "- # Setting last_visit[arr[i]] as i and", "- # updating the bit array accordingly", "- last_visit[arr[i]] = i", "- update(i + 1, 1, bit, n)", "- # If i is equal to r of any query store answer", "- # for that query in ans[]", "- while query_counter < q and queries[query_counter].r == i:", "- ans[queries[query_counter].idx] = query(", "- queries[query_counter].r + 1, bit, n", "- ) - query(queries[query_counter].l, bit, n)", "- query_counter += 1", "- # print answer for each query", "- for i in range(q):", "- print((ans[i]))", "-", "-", "-# This code is contributed by", "-# sanjeev2552", "- N, Q = list(map(int, readline().split()))", "+ N, Q = map(int, readline().split())", "- (*LR,) = list(map(int, read().split()))", "- queries = [0] * Q", "+ LR = map(int, read().split())", "+ prev = [-1] * (N + 1)", "+ ps = [[] for _ in range(N)]", "+ for i, c in enumerate(C):", "+ if prev[c] != -1:", "+ ps[prev[c]].append(i)", "+ prev[c] = i", "+ qs = [[] for _ in range(N + 1)]", "- queries[i] = Query(l - 1, r - 1, i)", "- queries.sort(key=lambda x: x.r)", "- answeringQueries(C, N, queries, Q)", "+ l -= 1", "+ r -= 1", "+ qs[l].append((r, i))", "+ ans = [0] * Q", "+ bit = BIT(N)", "+ for l in range(N - 1, -1, -1):", "+ for r in ps[l]:", "+ bit.add(r)", "+ for r, i in qs[l]:", "+ ans[i] = (r - l + 1) - bit.get_sum(r)", "+ print(*ans, sep=\"\\n\")"], "diff_only_import_comment": false, "measured_runtime_v0": 0.264044944, "measured_runtime_v1": 0.2106282006, "runtime_lift": 1.2536067971, "key": ["s648865207", "s892817156"]} {"user_id": "u023958502", "problem_id": "p03078", "language": "python", "submission_id_v0": "s928848207", "submission_id_v1": "s406476908", "cpu_time_v0": 1927, "cpu_time_v1": 827, "memory_v0": 4720, "memory_v1": 4592, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 57.08, "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))", "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]", "code_v0_loc": 27, "code_v1_loc": 23, "code_v0_num_chars": 1135, "code_v1_num_chars": 962, "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", "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", "code_same": false, "relative_loc_diff_percent": 14.8148148148, "diff": ["+import heapq", "+", "+already = [[0, 0, 0]]", "-already = [[0, 0, 0]]", "-place_sum = []", "- place_sum.append([x + 1, y, z])", "- check.append(asort[x + 1] + bsort[y] + csort[z])", "+ heapq.heappush(check, (-(asort[x + 1] + bsort[y] + csort[z]), x + 1, y, z))", "- place_sum.append([x, y + 1, z])", "- check.append(asort[x] + bsort[y + 1] + csort[z])", "+ heapq.heappush(check, (-(asort[x] + bsort[y + 1] + csort[z]), x, y + 1, z))", "- place_sum.append([x, y, z + 1])", "- check.append(asort[x] + bsort[y] + csort[z + 1])", "- print((max(check)))", "- x, y, z = (", "- place_sum[check.index(max(check))][0],", "- place_sum[check.index(max(check))][1],", "- place_sum[check.index(max(check))][2],", "- )", "- place_sum.pop(check.index(max(check)))", "- check.remove(max(check))", "+ heapq.heappush(check, (-(asort[x] + bsort[y] + csort[z + 1]), x, y, z + 1))", "+ maxsum = heapq.heappop(check)", "+ print((-maxsum[0]))", "+ x, y, z = maxsum[1], maxsum[2], maxsum[3]"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2974797392, "measured_runtime_v1": 0.2210724421, "runtime_lift": 1.3456210843, "key": ["s928848207", "s406476908"]} {"user_id": "u619458041", "problem_id": "p03034", "language": "python", "submission_id_v0": "s001695168", "submission_id_v1": "s404140535", "cpu_time_v0": 1002, "cpu_time_v1": 783, "memory_v0": 17360, "memory_v1": 14388, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 21.86, "input": "import sys\n\n\n\ndef main():\n\n input = sys.stdin.readline\n\n N = int(input())\n\n S = list(map(int, input().split()))\n\n\n\n ans = 0\n\n for C in range(1, N//2):\n\n n = N // C\n\n point = 0\n\n used = set([0])\n\n for k in range(1, n):\n\n A = N - 1 - k*C\n\n\n\n if A in used or k*C in used or A == k*C:\n\n break\n\n used.add(A)\n\n used.add(k*C)\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", "target": "import sys\n\n\n\ndef main():\n\n input = sys.stdin.readline\n\n N = int(input())\n\n S = list(map(int, input().split()))\n\n\n\n ans = 0\n\n # C = A - B\n\n for C in range(1, N//2):\n\n n = (N-1) // C\n\n point = 0\n\n for k in range(1, n):\n\n A = N-1 - k*C\n\n\n\n # Check A and B are positive integer, and S_i is not used twice.\n\n #\n\n # B = A - C and B >= 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", "code_v0_loc": 28, "code_v1_loc": 33, "code_v0_num_chars": 563, "code_v1_num_chars": 905, "code_v0_no_empty_lines": "import sys\n\n\ndef main():\n input = sys.stdin.readline\n N = int(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", "code_v1_no_empty_lines": "import sys\n\n\ndef main():\n input = sys.stdin.readline\n N = int(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", "code_same": false, "relative_loc_diff_percent": 15.1515151515, "diff": ["+ # C = A - B", "- n = N // C", "+ n = (N - 1) // C", "- used = set([0])", "- if A in used or k * C in used or A == k * C:", "+ # Check A and B are positive integer, and S_i is not used twice.", "+ #", "+ # B = A - C and B >= 0, so A must be over C (A > C).", "+ #", "+ # If C is aliquot of N-1 (N-1 % C = 0), A is also aliquot of N-1", "+ # (N-1 % A = 0) because A + kC = N-1. Therefore when A is less than", "+ # or equal kC, the A's value is already used by kC.", "+ if A < C or ((N - 1) % C == 0 and A <= k * C):", "- used.add(A)", "- used.add(k * C)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3095349545, "measured_runtime_v1": 0.0814658375, "runtime_lift": 3.7995675745, "key": ["s001695168", "s404140535"]} {"user_id": "u260980560", "problem_id": "p00713", "language": "python", "submission_id_v0": "s376249504", "submission_id_v1": "s496295641", "cpu_time_v0": 32130, "cpu_time_v1": 27750, "memory_v0": 6520, "memory_v1": 6552, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 13.63, "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)", "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)", "code_v0_loc": 33, "code_v1_loc": 32, "code_v0_num_chars": 1141, "code_v1_num_chars": 1143, "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", "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", "code_same": false, "relative_loc_diff_percent": 3.0303030303, "diff": ["- return [[xc - k * yd, yc + k * xd], [xc + k * yd, yc - k * xd]]", "+ xd *= k", "+ yd *= k", "+ return [[xc - yd, yc + xd], [xc + yd, yc - xd]]", "- p = [list(map(float, input().split())) for i in range(n)]", "- p.sort()", "+ p = sorted(list(map(float, input().split())) for i in range(n))", "- if dx - bx >= 2.0:", "+ if dx - ex >= 1.0:"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3026192219, "measured_runtime_v1": 0.1054183228, "runtime_lift": 2.8706510771, "key": ["s376249504", "s496295641"]} {"user_id": "u260980560", "problem_id": "p01105", "language": "python", "submission_id_v0": "s457180384", "submission_id_v1": "s699385465", "cpu_time_v0": 130, "cpu_time_v1": 50, "memory_v0": 7848, "memory_v1": 7824, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 61.54, "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", "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", "code_v0_loc": 15, "code_v1_loc": 24, "code_v0_num_chars": 639, "code_v1_num_chars": 874, "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", "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", "code_same": false, "relative_loc_diff_percent": 37.5, "diff": ["-L = {el: 1 for el in [a, b, c, d, e, 0]}", "-for i in range(6):", "- R = sorted(L.items(), key=lambda x: x[1])", "- for p, l in R:", "- if l < 16:", "- L[p ^ e] = min(L.get(p ^ e, 16), l + 1)", "- if l + 3 < 16:", "- for q, r in R:", "- if l + r + 3 <= 16:", "- L[p & q] = min(L.get(p & q, 16), l + r + 3)", "- L[p ^ q] = min(L.get(p ^ q, 16), l + r + 3)", "- else:", "- break", "- else:", "- break", "+from heapq import heappush, heappop", "+", "+base = [a, b, c, d, e, 0]", "+Q = [(1, el) for el in base]", "+L = {el: 1 for el in base}", "+H = []", "+while Q:", "+ l, p = heappop(Q)", "+ if L[p] < l:", "+ continue", "+ if l + 1 < L.get(p ^ e, 17):", "+ L[p ^ e] = l + 1", "+ if l + 1 < 16:", "+ heappush(Q, (l + 1, p ^ e))", "+ if l + 3 < 16:", "+ for q, r in H:", "+ if l + r + 3 <= 16:", "+ if l + r + 3 < L.get(p & q, 17):", "+ L[p & q] = l + r + 3", "+ if l + r + 3 < 16:", "+ heappush(Q, (l + r + 3, p & q))", "+ if l + r + 3 < L.get(p ^ q, 17):", "+ L[p ^ q] = l + r + 3", "+ if l + r + 3 < 16:", "+ heappush(Q, (l + r + 3, p ^ q))", "+ else:", "+ break", "+ if l < 7:", "+ H.append((p, l))"], "diff_only_import_comment": false, "measured_runtime_v0": 1.012686343, "measured_runtime_v1": 0.2560091887, "runtime_lift": 3.9556640457, "key": ["s457180384", "s699385465"]} {"user_id": "u989345508", "problem_id": "p03798", "language": "python", "submission_id_v0": "s244589711", "submission_id_v1": "s160001244", "cpu_time_v0": 1408, "cpu_time_v1": 1267, "memory_v0": 3892, "memory_v1": 3880, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 10.01, "input": "n=int(input())\n\ns=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", "target": "n=int(input())\n\ns=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", "code_v0_loc": 82, "code_v1_loc": 69, "code_v0_num_chars": 2079, "code_v1_num_chars": 1752, "code_v0_no_empty_lines": "n = int(input())\ns = 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", "code_v1_no_empty_lines": "n = int(input())\ns = 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", "code_same": false, "relative_loc_diff_percent": 15.8536585366, "diff": ["+a = [\"S\", \"W\"]", "- if x[i][j] == \"S\":", "- x[i] += \"S\"", "- else:", "- x[i] += \"W\"", "+ x[i] += a[x[i][j] != \"S\"]", "- if x[i][j] == \"S\":", "- x[i] += \"W\"", "- else:", "- x[i] += \"S\"", "+ x[i] += a[x[i][j] == \"S\"]", "- if x[i][j] == \"S\":", "- x[i] += \"W\"", "- else:", "- x[i] += \"S\"", "+ x[i] += a[x[i][j] == \"S\"]", "- if x[i][j] == \"S\":", "- x[i] += \"S\"", "- else:", "- x[i] += \"W\"", "- # print(x[i])", "+ x[i] += a[x[i][j] != \"S\"]"], "diff_only_import_comment": false, "measured_runtime_v0": 0.206637172, "measured_runtime_v1": 0.0056119666, "runtime_lift": 36.8208127342, "key": ["s244589711", "s160001244"]} {"user_id": "u747602774", "problem_id": "p03039", "language": "python", "submission_id_v0": "s108635717", "submission_id_v1": "s387237372", "cpu_time_v0": 543, "cpu_time_v1": 230, "memory_v0": 9432, "memory_v1": 9412, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 57.64, "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", "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", "code_v0_loc": 38, "code_v1_loc": 42, "code_v0_num_chars": 796, "code_v1_num_chars": 809, "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", "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", "code_same": false, "relative_loc_diff_percent": 9.5238095238, "diff": ["- ans += f1(x, y, n, m) + f1(1, 1, x, y) + f1(1, y, x, m) + f1(x, 1, n, y)", "- ans -= f2(x, n) + f2(1, x) + f2(1, y) + f2(y, m)", "+ a = n - x + 1", "+ b = m - y + 1", "+ c = m * (a * (a - 1) + x * (x - 1))", "+ d = n * (b * (b - 1) + y * (y - 1))", "+ ans += (c + d) // 2"], "diff_only_import_comment": false, "measured_runtime_v0": 0.4582999928, "measured_runtime_v1": 0.3618569455, "runtime_lift": 1.2665225816, "key": ["s108635717", "s387237372"]} {"user_id": "u072053884", "problem_id": "p02245", "language": "python", "submission_id_v0": "s696240934", "submission_id_v1": "s480327836", "cpu_time_v0": 120, "cpu_time_v1": 60, "memory_v0": 10724, "memory_v1": 13476, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 50.0, "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')))", "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)))", "code_v0_loc": 60, "code_v1_loc": 48, "code_v0_num_chars": 2264, "code_v1_num_chars": 1231, "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", "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", "code_same": false, "relative_loc_diff_percent": 20.0, "diff": ["+adjacent = (", "+ (1, 3), # 0", "+ (0, 2, 4), # 1", "+ (1, 5), # 2", "+ (0, 4, 6), # 3", "+ (1, 3, 5, 7), # 4", "+ (2, 4, 8), # 5", "+ (3, 7), # 6", "+ (4, 6, 8), # 7", "+ (5, 7), # 8", "+)", "+import collections", "+", "+GOAL = [1, 2, 3, 4, 5, 6, 7, 8, 0]", "+# Bidirectional search using breadth-first search", "+def solve(start):", "+ if start == GOAL:", "+ return 0", "+ # 0: forward, 1: backward", "+ generated_state = {tuple(start): 0, tuple(GOAL): 1}", "+ step = {tuple(start): 0, tuple(GOAL): 0}", "+ s = 0", "+ state1 = [(start, 0), (GOAL, 1)]", "+ while state1:", "+ state2 = state1[:]", "+ state1 = []", "+ s += 1", "+ for s2, d in state2:", "+ i = s2.index(0)", "+ for p in adjacent[i]:", "+ s1 = s2[:]", "+ s1[i], s1[p] = s1[p], 0", "+ key = tuple(s1)", "+ if key in generated_state:", "+ if generated_state[key] != d:", "+ return s + step[key]", "+ continue", "+ state1.append((s1, d))", "+ generated_state[key] = d", "+ step[key] = s", "+", "+", "-init = \"\".join(sys.stdin.read().split())", "-# Bidirectional search using breadth-first search", "-def solve(start, goal):", "- if start == goal:", "- return 0", "- generated_state = {start: 0, goal: 1} # 0: foreward, 1: backward", "- step = {start: 0, goal: 0}", "- s = 0", "- c_d = [(start, 0), (goal, 1)] # configure and direction", "- while True:", "- q = iter(c_d)", "- c_d = []", "- s += 1", "- for c, d in q:", "- i = c.find(\"0\")", "- if 0 <= i <= 5:", "- t = str.maketrans(\"0\" + c[i + 3], c[i + 3] + \"0\")", "- t_c = c.translate(t)", "- if t_c in generated_state:", "- if generated_state[t_c] != d:", "- return s + step[t_c]", "- else:", "- generated_state[t_c] = d", "- step[t_c] = s", "- c_d.append((t_c, d))", "- if i >= 3:", "- t = str.maketrans(\"0\" + c[i - 3], c[i - 3] + \"0\")", "- t_c = c.translate(t)", "- if t_c in generated_state:", "- if generated_state[t_c] != d:", "- return s + step[t_c]", "- else:", "- generated_state[t_c] = d", "- step[t_c] = s", "- c_d.append((t_c, d))", "- if i == 0 or i == 1 or i == 3 or i == 4 or i == 6 or i == 7:", "- t = str.maketrans(\"0\" + c[i + 1], c[i + 1] + \"0\")", "- t_c = c.translate(t)", "- if t_c in generated_state:", "- if generated_state[t_c] != d:", "- return s + step[t_c]", "- else:", "- generated_state[t_c] = d", "- step[t_c] = s", "- c_d.append((t_c, d))", "- if i == 1 or i == 2 or i == 4 or i == 5 or i == 7 or i == 8:", "- t = str.maketrans(\"0\" + c[i - 1], c[i - 1] + \"0\")", "- t_c = c.translate(t)", "- if t_c in generated_state:", "- if generated_state[t_c] != d:", "- return s + step[t_c]", "- else:", "- generated_state[t_c] = d", "- step[t_c] = s", "- c_d.append((t_c, d))", "-", "-", "-print((solve(init, \"123456780\")))", "+start = list(map(int, sys.stdin.read().split()))", "+print((solve(start)))"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3218115091, "measured_runtime_v1": 0.2098443508, "runtime_lift": 1.533572421, "key": ["s696240934", "s480327836"]} {"user_id": "u852690916", "problem_id": "p02794", "language": "python", "submission_id_v0": "s356881403", "submission_id_v1": "s623982203", "cpu_time_v0": 2735, "cpu_time_v1": 2229, "memory_v0": 44580, "memory_v1": 43936, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 18.5, "input": "import sys\n\ndef main():\n\n input = sys.stdin.readline\n\n N = int(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(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()", "target": "import sys\n\ndef main():\n\n input = sys.stdin.readline\n\n N = int(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(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()", "code_v0_loc": 52, "code_v1_loc": 54, "code_v0_num_chars": 1262, "code_v1_num_chars": 1288, "code_v0_no_empty_lines": "import sys\n\n\ndef main():\n input = sys.stdin.readline\n N = int(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(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", "code_v1_no_empty_lines": "import sys\n\n\ndef main():\n input = sys.stdin.readline\n N = int(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(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", "code_same": false, "relative_loc_diff_percent": 3.7037037037, "diff": ["- is_odd = bin(p).count(\"1\") & 1", "+ is_odd = 0", "+ is_odd ^= 1"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3895377469, "measured_runtime_v1": 0.2566085732, "runtime_lift": 1.5180231199, "key": ["s356881403", "s623982203"]} {"user_id": "u295361373", "problem_id": "p02612", "language": "python", "submission_id_v0": "s197156959", "submission_id_v1": "s836901225", "cpu_time_v0": 226, "cpu_time_v1": 180, "memory_v0": 68124, "memory_v1": 68072, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 20.35, "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(input())\n\ndef si():return 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()", "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(input())\n\ndef si():return 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", "code_v0_loc": 77, "code_v1_loc": 66, "code_v0_num_chars": 1162, "code_v1_num_chars": 1190, "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(input())\n\n\ndef si():\n return 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", "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(input())\n\n\ndef si():\n return 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", "code_same": false, "relative_loc_diff_percent": 14.2857142857, "diff": ["+from heapq import heappush, heappop"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3258618799, "measured_runtime_v1": 0.2078528001, "runtime_lift": 1.5677531392, "key": ["s197156959", "s836901225"]} {"user_id": "u001024152", "problem_id": "p03806", "language": "python", "submission_id_v0": "s636298531", "submission_id_v1": "s857325561", "cpu_time_v0": 1682, "cpu_time_v1": 292, "memory_v0": 59496, "memory_v1": 48860, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 82.64, "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)", "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)", "code_v0_loc": 34, "code_v1_loc": 29, "code_v0_num_chars": 926, "code_v1_num_chars": 775, "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", "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", "code_same": false, "relative_loc_diff_percent": 14.7058823529, "diff": ["-G_MAX = 40 * 10", "-N_MAX = 40", "-INF = float(\"inf\")", "-dp = [[[INF] * (G_MAX + 1) for _ in range(G_MAX + 1)] for _ in range(N_MAX + 1)]", "-N, Ma, Mb = list(map(int, input().split()))", "-a, b, c = [], [], []", "-for _ in range(N):", "- ai, bi, ci = list(map(int, input().split()))", "- a.append(ai)", "- b.append(bi)", "- c.append(ci)", "-dp[0][0][0] = 0", "+N, Ma, Mb = list(map(int, input().split()))", "+a = [0] * N", "+b = [0] * N", "+c = [0] * N", "- for ca in range(G_MAX + 1):", "- for cb in range(G_MAX + 1):", "- if isinf(dp[i][ca][cb]):", "+ a[i], b[i], c[i] = list(map(int, input().split()))", "+W_MAX = 40 * 10", "+dp = [[float(\"inf\")] * (W_MAX + 1) for _ in range(W_MAX + 1)]", "+dp[0][0] = 0", "+for i in range(N):", "+ for wa in reversed(list(range(W_MAX + 1))):", "+ for wb in reversed(list(range(W_MAX + 1))):", "+ if isinf(dp[wa][wb]):", "- dp[i + 1][ca][cb] = min(dp[i + 1][ca][cb], dp[i][ca][cb])", "- dp[i + 1][ca + a[i]][cb + b[i]] = min(", "- dp[i + 1][ca + a[i]][cb + b[i]], dp[i][ca][cb] + c[i]", "- )", "-ans = INF", "-for ca in range(1, G_MAX + 1):", "- for cb in range(1, G_MAX + 1):", "- if ca * Mb == cb * Ma:", "- ans = min(ans, dp[N][ca][cb])", "+ if wa + a[i] <= W_MAX and wb + b[i] <= W_MAX:", "+ dp[wa + a[i]][wb + b[i]] = min(", "+ dp[wa + a[i]][wb + b[i]], dp[wa][wb] + c[i]", "+ )", "+ans = float(\"inf\")", "+for wa in range(1, W_MAX + 1):", "+ for wb in range(1, W_MAX + 1):", "+ if wa * Mb == wb * Ma:", "+ ans = min(ans, dp[wa][wb])"], "diff_only_import_comment": false, "measured_runtime_v0": 2.4082550259, "measured_runtime_v1": 0.8679478877, "runtime_lift": 2.7746539396, "key": ["s636298531", "s857325561"]} {"user_id": "u312025627", "problem_id": "p02901", "language": "python", "submission_id_v0": "s827366183", "submission_id_v1": "s086626630", "cpu_time_v0": 364, "cpu_time_v1": 311, "memory_v0": 78552, "memory_v1": 75116, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 14.56, "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", "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", "code_v0_loc": 34, "code_v1_loc": 36, "code_v0_num_chars": 827, "code_v1_num_chars": 882, "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", "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", "code_same": false, "relative_loc_diff_percent": 5.5555555556, "diff": ["+ import sys", "+", "+ input = sys.stdin.buffer.readline"], "diff_only_import_comment": false, "measured_runtime_v0": 0.4147989278, "measured_runtime_v1": 0.289175185, "runtime_lift": 1.4344208955, "key": ["s827366183", "s086626630"]} {"user_id": "u427344224", "problem_id": "p03253", "language": "python", "submission_id_v0": "s043094515", "submission_id_v1": "s952701444", "cpu_time_v0": 1290, "cpu_time_v1": 20, "memory_v0": 5164, "memory_v1": 3064, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 98.45, "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", "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", "code_v0_loc": 56, "code_v1_loc": 42, "code_v0_num_chars": 1269, "code_v1_num_chars": 1072, "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", "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", "code_same": false, "relative_loc_diff_percent": 25.0, "diff": ["-from math import factorial", "-", "-", "-def comb(n, r, R):", "- if n not in R:", "- a = factorial(n)", "- R[n] = a", "- else:", "- a = R[n]", "- if n - r not in R:", "- b = factorial(n - r)", "- R[n - r] = b", "- else:", "- b = R[n - r]", "- if r not in R:", "- c = factorial(r)", "- R[r] = c", "- else:", "- c = R[r]", "- return a // (b * c)", "+def combination(n, r):", "+ r = min(n - r, r)", "+ result = 1", "+ for i in range(n, n - r, -1):", "+ result *= i", "+ for i in range(1, r + 1):", "+ result //= i", "+ return result", "-R = dict()", "- r *= comb(v + n - 1, v, R)", "+ r *= combination(v + n - 1, v)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.4743831277, "measured_runtime_v1": 0.1920195122, "runtime_lift": 2.4704943903, "key": ["s043094515", "s952701444"]} {"user_id": "u864197622", "problem_id": "p02822", "language": "python", "submission_id_v0": "s981663077", "submission_id_v1": "s820806781", "cpu_time_v0": 1240, "cpu_time_v1": 890, "memory_v0": 93784, "memory_v1": 100756, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 28.23, "input": "import sys\n\ninput = sys.stdin.readline\n\nfrom collections import deque\n\nN = int(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))", "target": "import sys\n\ninput = sys.stdin.readline\n\nfrom collections import deque\n\nN = int(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))", "code_v0_loc": 41, "code_v1_loc": 50, "code_v0_num_chars": 951, "code_v1_num_chars": 1128, "code_v0_no_empty_lines": "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\nN = int(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", "code_v1_no_empty_lines": "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\nN = int(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", "code_same": false, "relative_loc_diff_percent": 18.0, "diff": ["+pow2 = [1]", "+for i in range(N + 10):", "+ pow2.append(pow2[-1] * 2 % mod)", "+invpow2 = [pow(pow2[-1], mod - 2, mod)]", "+for i in range(N + 10)[::-1]:", "+ invpow2.append(invpow2[-1] * 2 % mod)", "+invpow2 = invpow2[::-1]", "- t = 1 + (1 - pow(inv2, N - A[i], mod)) * pow(2, N - A[i], mod)", "+ t = 1 + (1 - invpow2[N - A[i]]) * pow2[N - A[i]]", "- s = (s * pow(inv2, A[j], mod)) % mod", "- t = (t + (1 - pow(inv2, A[j], mod)) * pow(2, A[j], mod)) % mod", "+ s = (s * invpow2[A[j]]) % mod", "+ t = (t + (1 - invpow2[A[j]]) * pow2[A[j]]) % mod"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2550587091, "measured_runtime_v1": 0.1362446928, "runtime_lift": 1.8720634461, "key": ["s981663077", "s820806781"]} {"user_id": "u687343821", "problem_id": "p03074", "language": "python", "submission_id_v0": "s599311447", "submission_id_v1": "s168736691", "cpu_time_v0": 62, "cpu_time_v1": 44, "memory_v0": 5568, "memory_v1": 4596, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 29.03, "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 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(res 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))", "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))", "code_v0_loc": 28, "code_v1_loc": 30, "code_v0_num_chars": 624, "code_v1_num_chars": 620, "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", "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", "code_same": false, "relative_loc_diff_percent": 6.6666666667, "diff": ["+fac = [1]", "+for i in range(1, n * m + 1):", "+ fac.append((fac[-1] * i) % mod)", "-fac = [1]", "-inv = [1]", "-for i in range(1, n * m + 1):", "- fac.append((fac[-1] * i) % mod)", "- inv.append(pow(fac[i], mod - 2))", "+def inv(i):", "+ return pow(fac[i], mod - 2)", "- return (fac[n] * inv[k] * inv[n - k]) % mod", "+ return (fac[n] * inv(k) * inv(n - k)) % mod", "-def doit(n, m, k):", "- ret = 0", "- for d in range(m):", "- ret = (ret + d * (m - d)) % mod", "- return (ret * n * n * cmb(n * m - 2, k - 2)) % mod", "-", "-", "-print(((doit(n, m, k) + doit(m, n, k)) % mod))", "+x = sum(d * (m - d) for d in range(m)) % mod", "+y = sum(d * (n - d) for d in range(n)) % mod", "+c = cmb(n * m - 2, k - 2)", "+x = (x * n * n * c) % mod", "+y = (y * m * m * c) % mod", "+print(((x + y) % mod))"], "diff_only_import_comment": false, "measured_runtime_v0": 0.7987827396, "measured_runtime_v1": 0.3213389852, "runtime_lift": 2.4857946791, "key": ["s871362008", "s362897835"]} {"user_id": "u070201429", "problem_id": "p03608", "language": "python", "submission_id_v0": "s030633020", "submission_id_v1": "s301564470", "cpu_time_v0": 137, "cpu_time_v1": 113, "memory_v0": 74552, "memory_v1": 74516, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 17.52, "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", "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", "code_v0_loc": 36, "code_v1_loc": 37, "code_v0_num_chars": 868, "code_v1_num_chars": 914, "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", "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", "code_same": false, "relative_loc_diff_percent": 2.7027027027, "diff": ["- for i in range(n):", "- for j in range(n):", "+ for i in range(n - 1):", "+ for j in range(i + 1, n):", "+ d[j][i] = d[i][j]"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2599997888, "measured_runtime_v1": 0.1532082543, "runtime_lift": 1.697035123, "key": ["s030633020", "s301564470"]} {"user_id": "u873917047", "problem_id": "p03828", "language": "python", "submission_id_v0": "s924740576", "submission_id_v1": "s078000611", "cpu_time_v0": 523, "cpu_time_v1": 182, "memory_v0": 3188, "memory_v1": 3188, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 65.2, "input": "#coding: UTF-8\n\nimport math\n\nN=int(input())\n\ndef prime_list(k):\n\n lis=[True for i in range(1,k+1)]\n\n lis[0]=False\n\n for i in range(2,k+1):\n\n j=2\n\n while j*j<=i:\n\n if i%j==0:\n\n lis[i-1]=False\n\n break\n\n else:\n\n j+=1\n\n return lis\n\n# print(lis)\n\ndef p_fact(k,N):\n\n plist=prime_list(k)\n\n lis=[0]*N\n\n for i in range(0,k):\n\n n=0\n\n if plist[i]:\n\n while k%(i+1)==0:\n\n n+=1\n\n k=k/(i+1)\n\n lis[i]=n\n\n return lis\n\nout_lis=[0]*N\n\nfor i in range(1,N+1):\n\n input_lis=p_fact(i,N)\n\n out_lis=[out_lis[j]+input_lis[j] for j in range(0,N)]\n\n#print(out_lis)\n\nout=1\n\nfor i in range(0,N):\n\n out=out*(out_lis[i]+1)\n\nprint((out%1000000007))", "target": "#coding: UTF-8\n\nimport math\n\nN=int(input())\n\ndef prime_list(k):\n\n lis=[True for i in range(1,k+1)]\n\n lis[0]=False\n\n for i in range(2,k+1):\n\n j=2\n\n while j*j<=i:\n\n if i%j==0:\n\n lis[i-1]=False\n\n break\n\n else:\n\n j+=1\n\n return lis\n\n# print(lis)\n\ndef p_fact(k,N,plist):\n\n# plist=prime_list(k)\n\n lis=[0]*N\n\n for i in range(0,k):\n\n n=0\n\n if plist[i]:\n\n while k%(i+1)==0:\n\n n+=1\n\n k=k/(i+1)\n\n lis[i]=n\n\n return lis\n\n# print(lis)\n\nout_lis=[0]*N\n\nplist=prime_list(N)\n\nfor i in range(1,N+1):\n\n input_lis=p_fact(i,N,plist)\n\n out_lis=[out_lis[j]+input_lis[j] for j in range(0,N)]\n\n#print(out_lis)\n\nout=1\n\nfor i in range(0,N):\n\n out=out*(out_lis[i]+1)\n\n#print(out%1000000007)\n\nprint((out%(10**9+7)))", "code_v0_loc": 36, "code_v1_loc": 39, "code_v0_num_chars": 791, "code_v1_num_chars": 865, "code_v0_no_empty_lines": "# coding: UTF-8\nimport math\n\nN = int(input())\n\n\ndef prime_list(k):\n lis = [True for i in range(1, k + 1)]\n lis[0] = False\n for i in range(2, k + 1):\n j = 2\n while j * j <= i:\n if i % j == 0:\n lis[i - 1] = False\n break\n else:\n j += 1\n return lis\n\n\n# print(lis)\ndef p_fact(k, N):\n plist = prime_list(k)\n lis = [0] * N\n for i in range(0, k):\n n = 0\n if plist[i]:\n while k % (i + 1) == 0:\n n += 1\n k = k / (i + 1)\n lis[i] = n\n return lis\n\n\nout_lis = [0] * N\nfor i in range(1, N + 1):\n input_lis = p_fact(i, N)\n out_lis = [out_lis[j] + input_lis[j] for j in range(0, N)]\n# print(out_lis)\nout = 1\nfor i in range(0, N):\n out = out * (out_lis[i] + 1)\nprint((out % 1000000007))\n", "code_v1_no_empty_lines": "# coding: UTF-8\nimport math\n\nN = int(input())\n\n\ndef prime_list(k):\n lis = [True for i in range(1, k + 1)]\n lis[0] = False\n for i in range(2, k + 1):\n j = 2\n while j * j <= i:\n if i % j == 0:\n lis[i - 1] = False\n break\n else:\n j += 1\n return lis\n\n\n# print(lis)\ndef p_fact(k, N, plist):\n # plist=prime_list(k)\n lis = [0] * N\n for i in range(0, k):\n n = 0\n if plist[i]:\n while k % (i + 1) == 0:\n n += 1\n k = k / (i + 1)\n lis[i] = n\n return lis\n\n\n# print(lis)\nout_lis = [0] * N\nplist = prime_list(N)\nfor i in range(1, N + 1):\n input_lis = p_fact(i, N, plist)\n out_lis = [out_lis[j] + input_lis[j] for j in range(0, N)]\n# print(out_lis)\nout = 1\nfor i in range(0, N):\n out = out * (out_lis[i] + 1)\n# print(out%1000000007)\nprint((out % (10**9 + 7)))\n", "code_same": false, "relative_loc_diff_percent": 7.6923076923, "diff": ["-def p_fact(k, N):", "- plist = prime_list(k)", "+def p_fact(k, N, plist):", "+ # plist=prime_list(k)", "+# print(lis)", "+plist = prime_list(N)", "- input_lis = p_fact(i, N)", "+ input_lis = p_fact(i, N, plist)", "-print((out % 1000000007))", "+# print(out%1000000007)", "+print((out % (10**9 + 7)))"], "diff_only_import_comment": false, "measured_runtime_v0": 0.6020502172, "measured_runtime_v1": 0.3540123932, "runtime_lift": 1.7006472899, "key": ["s924740576", "s078000611"]} {"user_id": "u800534567", "problem_id": "p02245", "language": "python", "submission_id_v0": "s424620538", "submission_id_v1": "s007973982", "cpu_time_v0": 3310, "cpu_time_v1": 2340, "memory_v0": 34416, "memory_v1": 34452, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 29.31, "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", "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", "code_v0_loc": 34, "code_v1_loc": 32, "code_v0_num_chars": 845, "code_v1_num_chars": 831, "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", "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", "code_same": false, "relative_loc_diff_percent": 5.8823529412, "diff": ["-Q = queue.Queue()", "-V = dict()", "-Q.put([f, f.index(\"0\"), 0])", "-V[f] = True", "-while not Q.empty():", "- u = Q.get()", "+Q = [[f, f.index(\"0\"), 0]]", "+V = {f: True}", "+while len(Q) > 0:", "+ u = Q.pop(0)", "- v[2] += 1", "- Q.put(v)", "+ v[2] += 1 # dir[r]", "+ Q.append(v)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.5507428885, "measured_runtime_v1": 0.3782181978, "runtime_lift": 1.4561512154, "key": ["s424620538", "s007973982"]} {"user_id": "u585482323", "problem_id": "p03558", "language": "python", "submission_id_v0": "s378178699", "submission_id_v1": "s370816259", "cpu_time_v0": 982, "cpu_time_v1": 230, "memory_v0": 88880, "memory_v1": 47180, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 76.58, "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", "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", "code_v0_loc": 108, "code_v1_loc": 53, "code_v0_num_chars": 2164, "code_v1_num_chars": 1252, "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", "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", "code_same": false, "relative_loc_diff_percent": 50.9259259259, "diff": ["-from collections import defaultdict", "-from collections import deque", "+from collections import defaultdict, deque", "+from itertools import permutations", "-import random", "- return list(map(int, sys.stdin.readline().split()))", "+ return [int(x) for x in sys.stdin.readline().split()]", "- return list(map(list, sys.stdin.readline().split()))", "+ return [list(x) for x in sys.stdin.readline().split()]", "- return list(sys.stdin.readline())[:-1]", "+ res = list(sys.stdin.readline())", "+ if res[-1] == \"\\n\":", "+ return res[:-1]", "+ return res", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = I()", "- return l", "+ return [I() for i in range(n)]", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = LI()", "- return l", "+ return [LI() for i in range(n)]", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = S()", "- return l", "+ return [S() for i in range(n)]", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = SR()", "- return l", "+ return [LS() for i in range(n)]", "+sys.setrecursionlimit(1000000)", "-# A", "-def A():", "- s = S()", "- t = S()", "- if s + t == t[::-1] + s[::-1]:", "- print(\"YES\")", "- else:", "- print(\"NO\")", "-# B", "-def B():", "- n = I()", "- for i in range(int(n**0.5) + 2)[::-1]:", "- if i * i <= n:", "- print((i * i))", "- quit()", "-", "-", "-# C", "-def C():", "- n = I()", "- a = LI()", "- b = LI()", "- c = LI()", "- q = [0 for i in range(n)]", "- ans = 0", "- a.sort()", "- b.sort()", "- c.sort()", "- for i in range(n):", "- j = bisect.bisect_left(a, b[i])", "- q[i] = j", "- for i in range(n - 1):", "- q[i + 1] += q[i]", "- q.insert(0, 0)", "- for i in range(n):", "- j = bisect.bisect_left(b, c[i])", "- ans += q[j]", "- print(ans)", "-", "-", "-# D", "-def D():", "- def dijkstra():", "- d = [float(\"inf\") for i in range(k)]", "- q = [[0, 1]]", "- d[1] = 0", "- while q:", "- dx, x = heappop(q)", "- for y, dy in v[x]:", "- if d[y] > dx + dy:", "- d[y] = dx + dy", "- heappush(q, [d[y], y])", "- print((d[0] + 1))", "+def solve():", "+ def v(n):", "+ return [n * 10 % k, (n + 1) % k]", "- if k == 1:", "- print((1))", "- quit()", "- v = [[] for i in range(k)]", "- for i in range(1, k):", "- v[i].append([(i + 1) % k, 1])", "- v[i].append([i * 10 % k, 0])", "- dijkstra()", "-", "-", "-# E", "-def E():", "- return", "-", "-", "-# F", "-def F():", "- return", "-", "-", "-# G", "-def G():", "- return", "-", "-", "-# H", "-def H():", "+ d = [float(\"inf\")] * k", "+ d[1] = 1", "+ q = deque([1])", "+ while q:", "+ x = q.popleft()", "+ vx = v(x)", "+ dx = d[x]", "+ for c in range(2):", "+ nd = dx + c", "+ y = vx[c]", "+ if nd < d[y]:", "+ d[y] = nd", "+ if c:", "+ q.append(y)", "+ else:", "+ q.appendleft(y)", "+ print((d[0]))", "- D()", "+ solve()"], "diff_only_import_comment": false, "measured_runtime_v0": 0.6112481251, "measured_runtime_v1": 0.2866115916, "runtime_lift": 2.1326706352, "key": ["s378178699", "s370816259"]} {"user_id": "u648212584", "problem_id": "p03253", "language": "python", "submission_id_v0": "s901379470", "submission_id_v1": "s767594103", "cpu_time_v0": 251, "cpu_time_v1": 204, "memory_v0": 16168, "memory_v1": 45680, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 18.73, "input": "import sys\n\ninput = sys.stdin.buffer.readline\n\nfrom collections import defaultdict\n\nimport copy\n\n\n\ndef main():\n\n N,M = list(map(int,input().split()))\n\n d = defaultdict(int)\n\n MOD = 10**9+7\n\n R = 10**5+100\n\n fac = [0 for _ in range(R+1)]\n\n fac[0],fac[1] = 1,1\n\n inv = copy.deepcopy(fac)\n\n invfac = copy.deepcopy(fac)\n\n \n\n for i in range(2,R+1):\n\n fac[i] = (fac[i-1]*i)%MOD\n\n inv[i] = MOD-(MOD//i)*inv[MOD%i]%MOD\n\n invfac[i] = (invfac[i-1]*inv[i])%MOD\n\n \n\n def coef(x,y):\n\n num = (((fac[x+y]*invfac[y])%MOD)*invfac[x]%MOD)\n\n return num\n\n\n\n while M%2 == 0:\n\n d[2] += 1\n\n M //= 2\n\n f = 3\n\n while f ** 2 <= M:\n\n if M % f == 0:\n\n d[f] += 1\n\n M //= f\n\n else:\n\n f += 2\n\n if M != 1:\n\n d[M] += 1\n\n \n\n l = list(d.values())\n\n ans = 1\n\n for num in l:\n\n ans *= coef(num,N-1)\n\n ans %= MOD\n\n \n\n print(ans)\n\n \n\nif __name__ == \"__main__\":\n\n main()", "target": "import sys\n\ninput = sys.stdin.buffer.readline\n\n\n\ndef main():\n\n N,M = list(map(int,input().split()))\n\n MOD = 10**9+7\n\n \n\n def 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\n\n if temp!=1:\n\n arr.append([temp, 1])\n\n\n\n return arr\n\n \n\n cl = factorization(M)\n\n \n\n def combinations(x,y,N):\n\n fac = [0]*(N+1)\n\n fac[0],fac[1] = 1,1\n\n \n\n for i in range(2,N+1):\n\n fac[i] = (fac[i-1]*i)%MOD\n\n \n\n return (fac[x+y]*pow(fac[x],MOD-2,MOD)*pow(fac[y],MOD-2,MOD))%MOD\n\n \n\n ans = 1\n\n for pr,num in cl:\n\n ans *= combinations(N-1,num,N+num)\n\n ans %= MOD\n\n \n\n print(ans)\n\n \n\nif __name__ == \"__main__\":\n\n main()\n", "code_v0_loc": 47, "code_v1_loc": 43, "code_v0_num_chars": 1020, "code_v1_num_chars": 972, "code_v0_no_empty_lines": "import sys\n\ninput = sys.stdin.buffer.readline\nfrom collections import defaultdict\nimport copy\n\n\ndef main():\n N, M = list(map(int, input().split()))\n d = defaultdict(int)\n MOD = 10**9 + 7\n R = 10**5 + 100\n fac = [0 for _ in range(R + 1)]\n fac[0], fac[1] = 1, 1\n inv = copy.deepcopy(fac)\n invfac = copy.deepcopy(fac)\n for i in range(2, R + 1):\n fac[i] = (fac[i - 1] * i) % MOD\n inv[i] = MOD - (MOD // i) * inv[MOD % i] % MOD\n invfac[i] = (invfac[i - 1] * inv[i]) % MOD\n\n def coef(x, y):\n num = ((fac[x + y] * invfac[y]) % MOD) * invfac[x] % MOD\n return num\n\n while M % 2 == 0:\n d[2] += 1\n M //= 2\n f = 3\n while f**2 <= M:\n if M % f == 0:\n d[f] += 1\n M //= f\n else:\n f += 2\n if M != 1:\n d[M] += 1\n l = list(d.values())\n ans = 1\n for num in l:\n ans *= coef(num, N - 1)\n ans %= MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "code_v1_no_empty_lines": "import sys\n\ninput = sys.stdin.buffer.readline\n\n\ndef main():\n N, M = list(map(int, input().split()))\n MOD = 10**9 + 7\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 return arr\n\n cl = factorization(M)\n\n def combinations(x, y, N):\n fac = [0] * (N + 1)\n fac[0], fac[1] = 1, 1\n for i in range(2, N + 1):\n fac[i] = (fac[i - 1] * i) % MOD\n return (\n fac[x + y] * pow(fac[x], MOD - 2, MOD) * pow(fac[y], MOD - 2, MOD)\n ) % MOD\n\n ans = 1\n for pr, num in cl:\n ans *= combinations(N - 1, num, N + num)\n ans %= MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "code_same": false, "relative_loc_diff_percent": 8.5106382979, "diff": ["-from collections import defaultdict", "-import copy", "- d = defaultdict(int)", "- R = 10**5 + 100", "- fac = [0 for _ in range(R + 1)]", "- fac[0], fac[1] = 1, 1", "- inv = copy.deepcopy(fac)", "- invfac = copy.deepcopy(fac)", "- for i in range(2, R + 1):", "- fac[i] = (fac[i - 1] * i) % MOD", "- inv[i] = MOD - (MOD // i) * inv[MOD % i] % MOD", "- invfac[i] = (invfac[i - 1] * inv[i]) % MOD", "- def coef(x, y):", "- num = ((fac[x + y] * invfac[y]) % MOD) * invfac[x] % MOD", "- return num", "+ def factorization(n):", "+ arr = []", "+ temp = n", "+ for i in range(2, int(-(-(n**0.5) // 1)) + 1):", "+ if temp % i == 0:", "+ cnt = 0", "+ while temp % i == 0:", "+ cnt += 1", "+ temp //= i", "+ arr.append([i, cnt])", "+ if temp != 1:", "+ arr.append([temp, 1])", "+ return arr", "- while M % 2 == 0:", "- d[2] += 1", "- M //= 2", "- f = 3", "- while f**2 <= M:", "- if M % f == 0:", "- d[f] += 1", "- M //= f", "- else:", "- f += 2", "- if M != 1:", "- d[M] += 1", "- l = list(d.values())", "+ cl = factorization(M)", "+", "+ def combinations(x, y, N):", "+ fac = [0] * (N + 1)", "+ fac[0], fac[1] = 1, 1", "+ for i in range(2, N + 1):", "+ fac[i] = (fac[i - 1] * i) % MOD", "+ return (", "+ fac[x + y] * pow(fac[x], MOD - 2, MOD) * pow(fac[y], MOD - 2, MOD)", "+ ) % MOD", "+", "- for num in l:", "- ans *= coef(num, N - 1)", "+ for pr, num in cl:", "+ ans *= combinations(N - 1, num, N + num)"], "diff_only_import_comment": false, "measured_runtime_v0": 1.7565106795, "measured_runtime_v1": 0.2943952236, "runtime_lift": 5.9665053592, "key": ["s901379470", "s767594103"]} {"user_id": "u532966492", "problem_id": "p03039", "language": "python", "submission_id_v0": "s814969347", "submission_id_v1": "s884180243", "cpu_time_v0": 555, "cpu_time_v1": 399, "memory_v0": 27096, "memory_v1": 3192, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 28.11, "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))", "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))", "code_v0_loc": 30, "code_v1_loc": 42, "code_v0_num_chars": 731, "code_v1_num_chars": 1114, "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", "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", "code_same": false, "relative_loc_diff_percent": 28.5714285714, "diff": ["-def cmb(n, r, mod):", "- if r < 0 or r > n:", "- return 0", "- r = min(r, n - r)", "- return g1[n] * g2[r] * g2[n - r] % mod", "+def power_mod(a, b, mod=10**9 + 7):", "+ i, temp, box = 0, b, []", "+ while 2**i <= b:", "+ i += 1", "+ for j in range(i - 1, -1, -1):", "+ box = [[j, temp // 2**j]] + box", "+ temp -= 2**j * (temp // 2**j)", "+ box[0].append(a)", "+ ans = box[0][1] * a % mod", "+ for j in range(1, i):", "+ box[j].append(box[j - 1][2] ** 2 % mod)", "+ if box[j][1] == 1:", "+ ans = (ans * box[j][2]) % mod", "+ return ans", "-A = 2 * 10**5", "+def n_func(n, mod=10**9 + 7):", "+ ans = 1", "+ for i in range(1, n + 1):", "+ ans = (ans * i) % mod", "+ return ans", "+", "+", "+def nPr(n, r, mod=10**9 + 7):", "+ ans = n_func(n - r, mod)", "+ ans = power_mod(ans, mod - 2, mod)", "+ return ans * n_func(n, mod) % mod", "+", "+", "+def nCr(n, r, mod=10**9 + 7):", "+ ans = n_func(n - r, mod) * n_func(r, mod) % mod", "+ ans = power_mod(ans, mod - 2, mod)", "+ return ans * n_func(n, mod) % mod", "+", "+", "+N, M, K = list(map(int, input().split()))", "+keisuu = nCr(N * M - 2, K - 2)", "-g1 = [1, 1]", "-g2 = [1, 1]", "-inverse = [0, 1]", "-for i in range(2, A + 1):", "- g1.append((g1[-1] * i) % mod)", "- inverse.append((-inverse[mod % i] * (mod // i)) % mod)", "- g2.append((g2[-1] * inverse[-1]) % mod)", "-N, M, K = list(map(int, input().split()))", "-keisuu = cmb(N * M - 2, K - 2, mod)"], "diff_only_import_comment": false, "measured_runtime_v0": 2.5172936699, "measured_runtime_v1": 0.2314554, "runtime_lift": 10.8759340674, "key": ["s814969347", "s884180243"]} {"user_id": "u585482323", "problem_id": "p03371", "language": "python", "submission_id_v0": "s026349855", "submission_id_v1": "s676818074", "cpu_time_v0": 206, "cpu_time_v1": 183, "memory_v0": 40944, "memory_v1": 39408, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 11.17, "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", "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", "code_v0_loc": 97, "code_v1_loc": 43, "code_v0_num_chars": 1751, "code_v1_num_chars": 1027, "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", "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", "code_same": false, "relative_loc_diff_percent": 55.6701030928, "diff": ["-from collections import defaultdict", "-from collections import deque", "+from collections import defaultdict, deque", "+from itertools import permutations", "-import random", "- return list(map(int, sys.stdin.readline().split()))", "+ return [int(x) for x in sys.stdin.readline().split()]", "- return list(map(list, sys.stdin.readline().split()))", "+ return [list(x) for x in sys.stdin.readline().split()]", "- return list(sys.stdin.readline())[:-1]", "+ res = list(sys.stdin.readline())", "+ if res[-1] == \"\\n\":", "+ return res[:-1]", "+ return res", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = I()", "- return l", "+ return [I() for i in range(n)]", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = LI()", "- return l", "+ return [LI() for i in range(n)]", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = S()", "- return l", "+ return [S() for i in range(n)]", "- l = [None for i in range(n)]", "- for i in range(n):", "- l[i] = LS()", "- return l", "+ return [LS() for i in range(n)]", "-# A", "-def A():", "- return", "-# B", "-def B():", "- return", "-", "-", "-# C", "-def C():", "- return", "-", "-", "-# D", "-def D():", "- return", "-", "-", "-# E", "-def E():", "- return", "-", "-", "-# F", "-def F():", "- a, b, c, X, Y = LI()", "+def solve():", "+ A, B, C, x, y = LI()", "- for z in range(300001):", "- if z % 2 == 0:", "- m = c * z", "- x = z // 2", "- y = z // 2", "- m += a * max(0, X - x)", "- m += b * max(0, Y - y)", "- if m < ans:", "- ans = m", "+ for c in range(200001)[::2]:", "+ a = b = c >> 1", "+ a = max(0, x - a)", "+ b = max(0, y - b)", "+ s = A * a + B * b + C * c", "+ if s < ans:", "+ ans = s", "- return", "-", "-", "-# G", "-def G():", "- n = I()", "- x = LI()", "- f = [(i, x[i]) for i in range(n)]", "- f.sort(key=lambda x: x[1])", "- g = [(f[i][0], i) for i in range(n)]", "- g.sort(key=lambda x: x[0])", "- for i in range(n):", "- if g[i][1] < n // 2:", "- print((f[n // 2][1]))", "- else:", "- print((f[n // 2 - 1][1]))", "- return", "-", "-", "-# H", "-def H():", "- return", "-", "-", "-# I", "-def I_():", "- return", "-", "-", "-# J", "-def J():", "- F()", "+ solve()"], "diff_only_import_comment": false, "measured_runtime_v0": 1.3533082061, "measured_runtime_v1": 0.0063346879, "runtime_lift": 213.6345491689, "key": ["s026349855", "s676818074"]} {"user_id": "u426534722", "problem_id": "p02245", "language": "python", "submission_id_v0": "s237914915", "submission_id_v1": "s694650984", "cpu_time_v0": 730, "cpu_time_v1": 50, "memory_v0": 25688, "memory_v1": 8488, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 93.15, "input": "from collections import deque\n\nN = 3\n\nm = {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},\n\n 0: {3, 1}}\n\ngoal = 123456780\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 solve():\n\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\n\n start = 8 - MAP.find(\"0\")\n\n MAP = int(MAP)\n\n if MAP == goal:\n\n return 0\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 return cnt\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\ndef MAIN():\n\n print((solve()))\n\nMAIN()\n\n\n", "target": "from collections import deque\n\nN = 3\n\nm = {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},\n\n 0: {3, 1}}\n\ngoal = 123456780\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 solve():\n\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\n\n zero = 8 - MAP.find(\"0\")\n\n start = int(MAP)\n\n if start == goal:\n\n return 0\n\n dp = deque([(0, start, zero, 1), (0, goal, 0, 0)])\n\n TABLE = {start: (1, 0), goal: (0, 0)}\n\n while dp:\n\n cnt, M, yx, flg = dp.popleft()\n\n cnt += 1\n\n for nyx in m[yx]:\n\n key = g(yx, nyx, M)\n\n if key in TABLE:\n\n if TABLE[key][0] != flg:\n\n return TABLE[key][1] + cnt\n\n continue\n\n TABLE[key] = (flg, cnt)\n\n dp.append((cnt, key, nyx, flg))\n\ndef MAIN():\n\n print((solve()))\n\nMAIN()\n\n\n", "code_v0_loc": 30, "code_v1_loc": 31, "code_v0_num_chars": 815, "code_v1_num_chars": 949, "code_v0_no_empty_lines": "from collections import deque\n\nN = 3\nm = {\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}\ngoal = 123456780\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 solve():\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\n start = 8 - MAP.find(\"0\")\n MAP = int(MAP)\n if MAP == goal:\n return 0\n dp = deque([(0, start, MAP)])\n LOG = {MAP}\n while dp:\n cnt, yx, M = dp.popleft()\n if M == goal:\n return cnt\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\ndef MAIN():\n print((solve()))\n\n\nMAIN()\n", "code_v1_no_empty_lines": "from collections import deque\n\nN = 3\nm = {\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}\ngoal = 123456780\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 solve():\n MAP = \"\".join(input().replace(\" \", \"\") for _ in range(N))\n zero = 8 - MAP.find(\"0\")\n start = int(MAP)\n if start == goal:\n return 0\n dp = deque([(0, start, zero, 1), (0, goal, 0, 0)])\n TABLE = {start: (1, 0), goal: (0, 0)}\n while dp:\n cnt, M, yx, flg = dp.popleft()\n cnt += 1\n for nyx in m[yx]:\n key = g(yx, nyx, M)\n if key in TABLE:\n if TABLE[key][0] != flg:\n return TABLE[key][1] + cnt\n continue\n TABLE[key] = (flg, cnt)\n dp.append((cnt, key, nyx, flg))\n\n\ndef MAIN():\n print((solve()))\n\n\nMAIN()\n", "code_same": false, "relative_loc_diff_percent": 3.2258064516, "diff": ["- start = 8 - MAP.find(\"0\")", "- MAP = int(MAP)", "- if MAP == goal:", "+ zero = 8 - MAP.find(\"0\")", "+ start = int(MAP)", "+ if start == goal:", "- dp = deque([(0, start, MAP)])", "- LOG = {MAP}", "+ dp = deque([(0, start, zero, 1), (0, goal, 0, 0)])", "+ TABLE = {start: (1, 0), goal: (0, 0)}", "- cnt, yx, M = dp.popleft()", "- if M == goal:", "- return cnt", "+ cnt, M, yx, flg = dp.popleft()", "- CM = g(yx, nyx, M)", "- if not CM in LOG:", "- dp.append((cnt, nyx, CM))", "- LOG.add(CM)", "+ key = g(yx, nyx, M)", "+ if key in TABLE:", "+ if TABLE[key][0] != flg:", "+ return TABLE[key][1] + cnt", "+ continue", "+ TABLE[key] = (flg, cnt)", "+ dp.append((cnt, key, nyx, flg))"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2854871392, "measured_runtime_v1": 0.2155938864, "runtime_lift": 1.3241894008, "key": ["s237914915", "s694650984"]} {"user_id": "u296518383", "problem_id": "p03806", "language": "python", "submission_id_v0": "s823150149", "submission_id_v1": "s174409855", "cpu_time_v0": 255, "cpu_time_v1": 220, "memory_v0": 44124, "memory_v1": 43356, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 13.73, "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))", "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))", "code_v0_loc": 23, "code_v1_loc": 26, "code_v0_num_chars": 611, "code_v1_num_chars": 721, "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", "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", "code_same": false, "relative_loc_diff_percent": 11.5384615385, "diff": ["+sumA = sum([ABC[i][0] for i in range(N)])", "+sumB = sum([ABC[i][1] for i in range(N)])", "-dp = [[INF for j in range(401)] for i in range(401)]", "+dp = [[INF for j in range(sumB + 1)] for i in range(sumA + 1)]", "- for i in range(400, -1, -1):", "- for j in range(400, -1, -1):", "+ for i in range(sumA, -1, -1):", "+ for j in range(sumB, -1, -1):", "-for i in range(1, 401):", "- for j in range(1, 401):", "+for i in range(1, sumA + 1):", "+ for j in range(1, sumB + 1):"], "diff_only_import_comment": false, "measured_runtime_v0": 0.8101779278, "measured_runtime_v1": 0.2126889092, "runtime_lift": 3.8092156792, "key": ["s823150149", "s174409855"]} {"user_id": "u064505481", "problem_id": "p02555", "language": "python", "submission_id_v0": "s988049268", "submission_id_v1": "s031685542", "cpu_time_v0": 173, "cpu_time_v1": 74, "memory_v0": 76464, "memory_v1": 70408, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 57.23, "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()", "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()", "code_v0_loc": 32, "code_v1_loc": 45, "code_v0_num_chars": 739, "code_v1_num_chars": 1050, "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", "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", "code_same": false, "relative_loc_diff_percent": 28.8888888889, "diff": ["-setrecursionlimit(10**6)", "+# setrecursionlimit(10**6)", "- @lru_cache(None)", "- def dp(currsum):", "- if currsum == s:", "- return 1", "- cnt = 0", "- for d in range(3, 2001):", "- if currsum + d <= s:", "- cnt += dp(currsum + d)", "- cnt %= MOD", "- return cnt", "+ def binom_tables(n, q):", "+ fact = [1 for _ in range(n + 1)]", "+ inv = [1 for _ in range(n + 1)]", "+ for i in range(1, n + 1):", "+ fact[i] = (fact[i - 1] * i) % q", "+ inv[i] = pow(fact[i], q - 2, q)", "+ return fact, inv", "- print((dp(0)))", "+ F, I = binom_tables(s + 700, MOD)", "+", "+ def binom(n, k, q):", "+ return (F[n] * ((I[k] * I[n - k]) % q)) % q", "+", "+ ans = 0", "+ for r in range(1, 700):", "+ objects = s - 3 * r", "+ if objects + r - 1 < objects or objects < 0:", "+ break", "+ x = binom(objects + r - 1, objects, MOD)", "+ ans += x", "+ ans %= MOD", "+ print(ans)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.7214400458, "measured_runtime_v1": 0.2090635548, "runtime_lift": 3.4508168897, "key": ["s988049268", "s031685542"]}