File size: 65,392 Bytes
133fe23 | 1 2 3 4 5 6 7 8 | {"user_id": "u984276646", "problem_id": "p03674", "language": "python", "submission_id_v0": "s545310428", "submission_id_v1": "s792744532", "cpu_time_v0": 433, "cpu_time_v1": 334, "memory_v0": 43480, "memory_v1": 43988, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 22.86, "input": "n = int(input())\n\na = list(map(int, input().split()))\n\nD = {i: [0] for i in range(1, n+1)}\n\nfor i in range(n+1):\n\n D[a[i]][0] += 1\n\n D[a[i]].append(i)\n\npl, pr = 0, 0\n\nfor i in D:\n\n if D[i][0] == 2:\n\n pl = D[i][1]\n\n pr = D[i][2]\n\n break\n\nL = pl\n\nM = pr - pl - 1\n\nN = n - pr\n\nmod = int(1e9) + 7 # <-- input modulo\n\nmaxf = n+11 # <-- input factional limitation\n\n\n\ndef make_fact(n, k):\n\n tmp = n\n\n perm = [i for i in range(k)]\n\n L = [0 for _ in range(k)]\n\n for i in range(k):\n\n L[i] = tmp % (i + 1)\n\n tmp //= i + 1\n\n LL = [0 for _ in range(k)]\n\n for i in range(k):\n\n LL[i] = perm[L[-i-1]]\n\n for j in range(L[-i-1]+1, k):\n\n perm[j-1] = perm[j]\n\n return LL\n\n\n\ndef doubling(n, m, modulo=mod):\n\n y = 1\n\n base = n\n\n tmp = m\n\n while tmp != 0:\n\n if tmp % 2 == 1:\n\n y *= base\n\n if modulo > 0:\n\n y %= modulo\n\n base *= base\n\n if modulo > 0:\n\n base %= modulo\n\n tmp //= 2\n\n return y\n\n\n\ndef inved(a, modulo=mod):\n\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\n\n while l != 0:\n\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\n\n k, l = l, k % l\n\n return x % modulo\n\n\n\nfact = [1 for _ in range(maxf+1)]\n\ninvf = [1 for _ in range(maxf+1)]\n\n\n\nfor i in range(maxf):\n\n fact[i+1] = (fact[i] * (i+1)) % mod\n\ninvf[-1] = inved(fact[-1])\n\nfor i in range(maxf, 0, -1):\n\n invf[i-1] = (invf[i] * i) % mod\n\n\n\nfor i in range(1, n+2):\n\n S = fact[n]*invf[i-1]*invf[n-i+1]%mod\n\n if i <= n-1:\n\n S += fact[n-1]*invf[i]*invf[n-1-i]%mod\n\n S %= mod\n\n if i <= n-M:\n\n S -= fact[n-1-M]*invf[i-1]*invf[n-M-i]%mod\n\n S %= mod\n\n if i <= n:\n\n S += fact[n-1]*invf[i-1]*invf[n-i]%mod\n\n S %= mod\n\n print(S)", "target": "n = int(input())\n\na = list(map(int, input().split()))\n\nD = {i: [0] for i in range(1, n+1)}\n\nfor i in range(n+1):\n\n D[a[i]][0] += 1\n\n D[a[i]].append(i)\n\npl, pr = 0, 0\n\nfor i in D:\n\n if D[i][0] == 2:\n\n pl = D[i][1]\n\n pr = D[i][2]\n\n break\n\nL = pl\n\nM = pr - pl - 1\n\nN = n - pr\n\nmod = int(1e9) + 7 # <-- input modulo\n\nmaxf = n+11 # <-- input factional limitation\n\n\n\ndef make_fact(n, k):\n\n tmp = n\n\n perm = [i for i in range(k)]\n\n L = [0 for _ in range(k)]\n\n for i in range(k):\n\n L[i] = tmp % (i + 1)\n\n tmp //= i + 1\n\n LL = [0 for _ in range(k)]\n\n for i in range(k):\n\n LL[i] = perm[L[-i-1]]\n\n for j in range(L[-i-1]+1, k):\n\n perm[j-1] = perm[j]\n\n return LL\n\n\n\ndef doubling(n, m, modulo=mod):\n\n y = 1\n\n base = n\n\n tmp = m\n\n while tmp != 0:\n\n if tmp % 2 == 1:\n\n y *= base\n\n if modulo > 0:\n\n y %= modulo\n\n base *= base\n\n if modulo > 0:\n\n base %= modulo\n\n tmp //= 2\n\n return y\n\n\n\ndef inved(a, modulo=mod):\n\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\n\n while l != 0:\n\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\n\n k, l = l, k % l\n\n return x % modulo\n\n\n\nfact = [1 for _ in range(maxf+1)]\n\ninvf = [1 for _ in range(maxf+1)]\n\n\n\nfor i in range(maxf):\n\n fact[i+1] = (fact[i] * (i+1)) % mod\n\ninvf[-1] = inved(fact[-1])\n\nfor i in range(maxf, 0, -1):\n\n invf[i-1] = (invf[i] * i) % mod\n\n\n\nfor i in range(1, n+2):\n\n S = fact[n+1]*invf[i]*invf[n-i+1]%mod\n\n if i <= n-M:\n\n S -= fact[n-1-M]*invf[i-1]*invf[n-M-i]%mod\n\n S %= mod\n\n print(S)\n", "code_v0_loc": 75, "code_v1_loc": 69, "code_v0_num_chars": 1780, "code_v1_num_chars": 1635, "code_v0_no_empty_lines": "n = int(input())\na = list(map(int, input().split()))\nD = {i: [0] for i in range(1, n + 1)}\nfor i in range(n + 1):\n D[a[i]][0] += 1\n D[a[i]].append(i)\npl, pr = 0, 0\nfor i in D:\n if D[i][0] == 2:\n pl = D[i][1]\n pr = D[i][2]\n break\nL = pl\nM = pr - pl - 1\nN = n - pr\nmod = int(1e9) + 7 # <-- input modulo\nmaxf = n + 11 # <-- input factional limitation\n\n\ndef make_fact(n, k):\n tmp = n\n perm = [i for i in range(k)]\n L = [0 for _ in range(k)]\n for i in range(k):\n L[i] = tmp % (i + 1)\n tmp //= i + 1\n LL = [0 for _ in range(k)]\n for i in range(k):\n LL[i] = perm[L[-i - 1]]\n for j in range(L[-i - 1] + 1, k):\n perm[j - 1] = perm[j]\n return LL\n\n\ndef doubling(n, m, modulo=mod):\n y = 1\n base = n\n tmp = m\n while tmp != 0:\n if tmp % 2 == 1:\n y *= base\n if modulo > 0:\n y %= modulo\n base *= base\n if modulo > 0:\n base %= modulo\n tmp //= 2\n return y\n\n\ndef inved(a, modulo=mod):\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\n while l != 0:\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\n k, l = l, k % l\n return x % modulo\n\n\nfact = [1 for _ in range(maxf + 1)]\ninvf = [1 for _ in range(maxf + 1)]\nfor i in range(maxf):\n fact[i + 1] = (fact[i] * (i + 1)) % mod\ninvf[-1] = inved(fact[-1])\nfor i in range(maxf, 0, -1):\n invf[i - 1] = (invf[i] * i) % mod\nfor i in range(1, n + 2):\n S = fact[n] * invf[i - 1] * invf[n - i + 1] % mod\n if i <= n - 1:\n S += fact[n - 1] * invf[i] * invf[n - 1 - i] % mod\n S %= mod\n if i <= n - M:\n S -= fact[n - 1 - M] * invf[i - 1] * invf[n - M - i] % mod\n S %= mod\n if i <= n:\n S += fact[n - 1] * invf[i - 1] * invf[n - i] % mod\n S %= mod\n print(S)\n", "code_v1_no_empty_lines": "n = int(input())\na = list(map(int, input().split()))\nD = {i: [0] for i in range(1, n + 1)}\nfor i in range(n + 1):\n D[a[i]][0] += 1\n D[a[i]].append(i)\npl, pr = 0, 0\nfor i in D:\n if D[i][0] == 2:\n pl = D[i][1]\n pr = D[i][2]\n break\nL = pl\nM = pr - pl - 1\nN = n - pr\nmod = int(1e9) + 7 # <-- input modulo\nmaxf = n + 11 # <-- input factional limitation\n\n\ndef make_fact(n, k):\n tmp = n\n perm = [i for i in range(k)]\n L = [0 for _ in range(k)]\n for i in range(k):\n L[i] = tmp % (i + 1)\n tmp //= i + 1\n LL = [0 for _ in range(k)]\n for i in range(k):\n LL[i] = perm[L[-i - 1]]\n for j in range(L[-i - 1] + 1, k):\n perm[j - 1] = perm[j]\n return LL\n\n\ndef doubling(n, m, modulo=mod):\n y = 1\n base = n\n tmp = m\n while tmp != 0:\n if tmp % 2 == 1:\n y *= base\n if modulo > 0:\n y %= modulo\n base *= base\n if modulo > 0:\n base %= modulo\n tmp //= 2\n return y\n\n\ndef inved(a, modulo=mod):\n x, y, u, v, k, l = 1, 0, 0, 1, a, modulo\n while l != 0:\n x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)\n k, l = l, k % l\n return x % modulo\n\n\nfact = [1 for _ in range(maxf + 1)]\ninvf = [1 for _ in range(maxf + 1)]\nfor i in range(maxf):\n fact[i + 1] = (fact[i] * (i + 1)) % mod\ninvf[-1] = inved(fact[-1])\nfor i in range(maxf, 0, -1):\n invf[i - 1] = (invf[i] * i) % mod\nfor i in range(1, n + 2):\n S = fact[n + 1] * invf[i] * invf[n - i + 1] % mod\n if i <= n - M:\n S -= fact[n - 1 - M] * invf[i - 1] * invf[n - M - i] % mod\n S %= mod\n print(S)\n", "code_same": false, "relative_loc_diff_percent": 8.0, "diff": ["- S = fact[n] * invf[i - 1] * invf[n - i + 1] % mod", "- if i <= n - 1:", "- S += fact[n - 1] * invf[i] * invf[n - 1 - i] % mod", "- S %= mod", "+ S = fact[n + 1] * invf[i] * invf[n - i + 1] % mod", "- if i <= n:", "- S += fact[n - 1] * invf[i - 1] * invf[n - i] % mod", "- S %= mod"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3162681131, "measured_runtime_v1": 0.0655883436, "runtime_lift": 4.8220170785, "key": ["s545310428", "s792744532"]}
{"user_id": "u864197622", "problem_id": "p02794", "language": "python", "submission_id_v0": "s167224132", "submission_id_v1": "s245735210", "cpu_time_v0": 294, "cpu_time_v1": 228, "memory_v0": 50156, "memory_v1": 49128, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 22.45, "input": "N = 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\n\n\nP = [-1] * N\n\nDE = [0] * N\n\nQ = [0]\n\nwhile Q:\n\n i = Q.pop()\n\n for a in X[i][::-1]:\n\n if a != P[i]:\n\n P[a] = i\n\n DE[a] = DE[i] + 1\n\n X[a].remove(i)\n\n Q.append(a)\n\n\n\ndef lp(u, v):\n\n t = 0\n\n while u != v:\n\n if DE[u] > DE[v]:\n\n t += 1 << u-1\n\n u = P[u]\n\n elif DE[u] < DE[v]:\n\n t += 1 << v-1\n\n v = P[v]\n\n else:\n\n t += 1 << u-1\n\n t += 1 << v-1\n\n u = P[u]\n\n v = P[v]\n\n \n\n return t\n\n\n\nY = []\n\nM = int(input())\n\nfor _ in range(M):\n\n a, b = list(map(int, input().split()))\n\n a, b = a-1, b-1\n\n Y.append(lp(a, b))\n\n\n\nD = {1<<i: i for i in range(50)}\n\nZ = [0] * (1<<M)\n\nans = 0\n\nCC = [0] * N\n\nBC = [0] * (1<<17)\n\nfor m in range(1, 1<<17):\n\n a = m & (-m)\n\n BC[m] = BC[m^a] + 1\n\nfor m in range(1<<M):\n\n a = m & (-m)\n\n if a == m:\n\n if a == 0:\n\n Z[m] = 0\n\n else:\n\n Z[m] = Y[D[a]]\n\n else:\n\n Z[m] = Z[m^a] | Y[D[a]]\n\n \n\n aa = Z[m]\n\n bc = BC[aa % (1<<17)]\n\n aa >>= 17\n\n bc += BC[aa % (1<<17)]\n\n aa >>= 17\n\n bc += BC[aa]\n\n CC[N - 1 - bc] += (1 if BC[m%1024] + BC[m>>10] & 1 == 0 else -1)\n\n\n\nprint((sum([2 ** i * CC[i] for i in range(N)])))", "target": "N = 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\n\n\nP = [-1] * N\n\nDE = [0] * N\n\nQ = [0]\n\nwhile Q:\n\n i = Q.pop()\n\n for a in X[i][::-1]:\n\n if a != P[i]:\n\n P[a] = i\n\n DE[a] = DE[i] + 1\n\n X[a].remove(i)\n\n Q.append(a)\n\n\n\ndef lp(u, v):\n\n t = 0\n\n while u != v:\n\n if DE[u] > DE[v]:\n\n t += 1 << u-1\n\n u = P[u]\n\n elif DE[u] < DE[v]:\n\n t += 1 << v-1\n\n v = P[v]\n\n else:\n\n t += 1 << u-1\n\n t += 1 << v-1\n\n u = P[u]\n\n v = P[v]\n\n \n\n return t\n\n\n\nY = []\n\nM = int(input())\n\nfor _ in range(M):\n\n a, b = list(map(int, input().split()))\n\n a, b = a-1, b-1\n\n Y.append(lp(a, b))\n\n\n\ndef popcnt(n):\n\n c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555)\n\n c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333)\n\n c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f)\n\n c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff)\n\n c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff)\n\n c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff)\n\n return c\n\n\n\nD = {1<<i: i for i in range(50)}\n\nZ = [0] * (1<<M)\n\nans = 0\n\nCC = [0] * N\n\nfor m in range(1<<M):\n\n a = m & (-m)\n\n if a == m:\n\n if a == 0:\n\n Z[m] = 0\n\n else:\n\n Z[m] = Y[D[a]]\n\n else:\n\n Z[m] = Z[m^a] | Y[D[a]]\n\n \n\n CC[N - 1 - popcnt(Z[m])] += (1 if popcnt(m) & 1 == 0 else -1)\n\n\n\nprint((sum([2 ** i * CC[i] for i in range(N)])))", "code_v0_loc": 70, "code_v1_loc": 69, "code_v0_num_chars": 1435, "code_v1_num_chars": 1654, "code_v0_no_empty_lines": "N = 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)\nP = [-1] * N\nDE = [0] * N\nQ = [0]\nwhile Q:\n i = Q.pop()\n for a in X[i][::-1]:\n if a != P[i]:\n P[a] = i\n DE[a] = DE[i] + 1\n X[a].remove(i)\n Q.append(a)\n\n\ndef lp(u, v):\n t = 0\n while u != v:\n if DE[u] > DE[v]:\n t += 1 << u - 1\n u = P[u]\n elif DE[u] < DE[v]:\n t += 1 << v - 1\n v = P[v]\n else:\n t += 1 << u - 1\n t += 1 << v - 1\n u = P[u]\n v = P[v]\n return t\n\n\nY = []\nM = int(input())\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n a, b = a - 1, b - 1\n Y.append(lp(a, b))\nD = {1 << i: i for i in range(50)}\nZ = [0] * (1 << M)\nans = 0\nCC = [0] * N\nBC = [0] * (1 << 17)\nfor m in range(1, 1 << 17):\n a = m & (-m)\n BC[m] = BC[m ^ a] + 1\nfor m in range(1 << M):\n a = m & (-m)\n if a == m:\n if a == 0:\n Z[m] = 0\n else:\n Z[m] = Y[D[a]]\n else:\n Z[m] = Z[m ^ a] | Y[D[a]]\n aa = Z[m]\n bc = BC[aa % (1 << 17)]\n aa >>= 17\n bc += BC[aa % (1 << 17)]\n aa >>= 17\n bc += BC[aa]\n CC[N - 1 - bc] += 1 if BC[m % 1024] + BC[m >> 10] & 1 == 0 else -1\nprint((sum([2**i * CC[i] for i in range(N)])))\n", "code_v1_no_empty_lines": "N = 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)\nP = [-1] * N\nDE = [0] * N\nQ = [0]\nwhile Q:\n i = Q.pop()\n for a in X[i][::-1]:\n if a != P[i]:\n P[a] = i\n DE[a] = DE[i] + 1\n X[a].remove(i)\n Q.append(a)\n\n\ndef lp(u, v):\n t = 0\n while u != v:\n if DE[u] > DE[v]:\n t += 1 << u - 1\n u = P[u]\n elif DE[u] < DE[v]:\n t += 1 << v - 1\n v = P[v]\n else:\n t += 1 << u - 1\n t += 1 << v - 1\n u = P[u]\n v = P[v]\n return t\n\n\nY = []\nM = int(input())\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n a, b = a - 1, b - 1\n Y.append(lp(a, b))\n\n\ndef popcnt(n):\n c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)\n c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)\n c = (c & 0x0F0F0F0F0F0F0F0F) + ((c >> 4) & 0x0F0F0F0F0F0F0F0F)\n c = (c & 0x00FF00FF00FF00FF) + ((c >> 8) & 0x00FF00FF00FF00FF)\n c = (c & 0x0000FFFF0000FFFF) + ((c >> 16) & 0x0000FFFF0000FFFF)\n c = (c & 0x00000000FFFFFFFF) + ((c >> 32) & 0x00000000FFFFFFFF)\n return c\n\n\nD = {1 << i: i for i in range(50)}\nZ = [0] * (1 << M)\nans = 0\nCC = [0] * N\nfor m in range(1 << M):\n a = m & (-m)\n if a == m:\n if a == 0:\n Z[m] = 0\n else:\n Z[m] = Y[D[a]]\n else:\n Z[m] = Z[m ^ a] | Y[D[a]]\n CC[N - 1 - popcnt(Z[m])] += 1 if popcnt(m) & 1 == 0 else -1\nprint((sum([2**i * CC[i] for i in range(N)])))\n", "code_same": false, "relative_loc_diff_percent": 1.4285714286, "diff": ["+", "+", "+def popcnt(n):", "+ c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)", "+ c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)", "+ c = (c & 0x0F0F0F0F0F0F0F0F) + ((c >> 4) & 0x0F0F0F0F0F0F0F0F)", "+ c = (c & 0x00FF00FF00FF00FF) + ((c >> 8) & 0x00FF00FF00FF00FF)", "+ c = (c & 0x0000FFFF0000FFFF) + ((c >> 16) & 0x0000FFFF0000FFFF)", "+ c = (c & 0x00000000FFFFFFFF) + ((c >> 32) & 0x00000000FFFFFFFF)", "+ return c", "+", "+", "-BC = [0] * (1 << 17)", "-for m in range(1, 1 << 17):", "- a = m & (-m)", "- BC[m] = BC[m ^ a] + 1", "- aa = Z[m]", "- bc = BC[aa % (1 << 17)]", "- aa >>= 17", "- bc += BC[aa % (1 << 17)]", "- aa >>= 17", "- bc += BC[aa]", "- CC[N - 1 - bc] += 1 if BC[m % 1024] + BC[m >> 10] & 1 == 0 else -1", "+ CC[N - 1 - popcnt(Z[m])] += 1 if popcnt(m) & 1 == 0 else -1"], "diff_only_import_comment": false, "measured_runtime_v0": 0.4825011034, "measured_runtime_v1": 0.2223737774, "runtime_lift": 2.1697751823, "key": ["s167224132", "s245735210"]}
{"user_id": "u637175065", "problem_id": "p03553", "language": "python", "submission_id_v0": "s305170925", "submission_id_v1": "s833575440", "cpu_time_v0": 88, "cpu_time_v1": 46, "memory_v0": 7240, "memory_v1": 10956, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 47.73, "input": "import math,string,itertools,math,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\n\n\nsys.setrecursionlimit(10**7)\n\ninf = 10**20\n\neps = 1.0 / 10**15\n\nmod = 10**9+7\n\n\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\n\ndef LS(): return sys.stdin.readline().split()\n\ndef I(): return int(sys.stdin.readline())\n\ndef F(): return float(sys.stdin.readline())\n\ndef S(): return input()\n\ndef pf(s): return print(s, flush=True)\n\ndef divisions(n):\n\n sq = int(math.sqrt(n)+1)\n\n d = collections.defaultdict(int)\n\n while n % 2 == 0:\n\n n //= 2\n\n d[2] += 1\n\n i = 3\n\n while n > 1 and sq >= i:\n\n if n % i == 0:\n\n n //= i\n\n d[i] += 1\n\n else:\n\n i += 2\n\n\n\n if n > 1:\n\n d[n] += 1\n\n\n\n r = [1]\n\n for k, v in d.items():\n\n for c in r[:]:\n\n for i in range(1,v+1):\n\n r.append(c*(k**i))\n\n\n\n return sorted(r)\n\n\n\ndef main():\n\n n = I()\n\n a = LI()\n\n s = set()\n\n for i in range(n,0,-1):\n\n d = divisions(i)\n\n ld = len(d)\n\n for j in range(1,2**ld):\n\n c = []\n\n ff = True\n\n for k in range(ld):\n\n if j & (1<<k):\n\n f = True\n\n for e in c:\n\n if d[k] % e == 0:\n\n f = False\n\n ff = False\n\n break\n\n if f:\n\n c.append(d[k])\n\n if not ff:\n\n break\n\n if ff:\n\n s.add(tuple(c + [n+1]))\n\n b = sorted(list(s), reverse=True)\n\n for c in b:\n\n t = 0\n\n for j in range(1,n+1):\n\n f = False\n\n for e in c:\n\n if j%e == 0:\n\n f = True\n\n break\n\n if f:\n\n t += a[j-1]\n\n if t < 0:\n\n for j in range(1,n+1):\n\n f = False\n\n for e in c:\n\n if j%e == 0:\n\n f = True\n\n break\n\n if f:\n\n a[j-1] = 0\n\n\n\n return sum(a)\n\n\n\n\n\n\n\nprint(main())\n\n\n\n\n", "target": "import math,string,itertools,math,heapq,collections,re,array,bisect,sys,copy,functools\n\nimport time,random\n\n\n\nsys.setrecursionlimit(10**7)\n\ninf = 10**20\n\neps = 1.0 / 10**10\n\nmod = 10**9+7\n\nmod2 = 998244353\n\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\n\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\n\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\n\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]\n\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\n\ndef LS(): return sys.stdin.readline().split()\n\ndef I(): return int(sys.stdin.readline())\n\ndef F(): return float(sys.stdin.readline())\n\ndef S(): return input()\n\ndef pf(s): return print(s, flush=True)\n\ndef pe(s): return print(str(s), file=sys.stderr)\n\ndef JA(a, sep): return sep.join(map(str, a))\n\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\n\n\n\n\n\nclass Flow():\n\n def __init__(self, e, N):\n\n self.E = e\n\n self.N = N\n\n\n\n def max_flow(self, s, t):\n\n r = 0\n\n e = self.E\n\n\n\n def f(c, cap):\n\n v = self.v\n\n v[c] = 1\n\n if c == t:\n\n return cap\n\n for i in range(self.N):\n\n if v[i] or e[c][i] <= 0:\n\n continue\n\n cp = min(cap, e[c][i])\n\n k = f(i, cp)\n\n if k > 0:\n\n e[c][i] -= k\n\n e[i][c] += k\n\n return k\n\n return 0\n\n\n\n while True:\n\n self.v = [None] * self.N\n\n fs = f(s, inf)\n\n if fs == 0:\n\n break\n\n r += fs\n\n\n\n return r\n\n\n\n\n\ndef main():\n\n n = I()\n\n a = LI()\n\n\n\n s = n\n\n t = n + 1\n\n e = [[0] * (n+2) for _ in range(n+2)]\n\n for i in range(n):\n\n c = a[i]\n\n if c < 0:\n\n e[s][i] = -c\n\n ii = i + 1\n\n for j in range(ii*2, n+1, ii):\n\n e[i][j-1] = inf\n\n else:\n\n e[i][t] = c\n\n\n\n\n\n fl = Flow(e, n+2)\n\n r = fl.max_flow(s,t)\n\n\n\n return sum(map(lambda x: max(0,x), a)) - r\n\n\n\n# start = time.time()\n\nprint(main())\n\n# pe(time.time() - start)\n\n\n\n\n\n\n", "code_v0_loc": 92, "code_v1_loc": 89, "code_v0_num_chars": 2351, "code_v1_num_chars": 2252, "code_v0_no_empty_lines": "import math, string, itertools, math, heapq, collections, re, array, bisect, sys, random, time, copy, functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**15\nmod = 10**9 + 7\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LF():\n return [float(x) for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef F():\n return float(sys.stdin.readline())\n\n\ndef S():\n return input()\n\n\ndef pf(s):\n return print(s, flush=True)\n\n\ndef divisions(n):\n sq = int(math.sqrt(n) + 1)\n d = collections.defaultdict(int)\n while n % 2 == 0:\n n //= 2\n d[2] += 1\n i = 3\n while n > 1 and sq >= i:\n if n % i == 0:\n n //= i\n d[i] += 1\n else:\n i += 2\n if n > 1:\n d[n] += 1\n r = [1]\n for k, v in d.items():\n for c in r[:]:\n for i in range(1, v + 1):\n r.append(c * (k**i))\n return sorted(r)\n\n\ndef main():\n n = I()\n a = LI()\n s = set()\n for i in range(n, 0, -1):\n d = divisions(i)\n ld = len(d)\n for j in range(1, 2**ld):\n c = []\n ff = True\n for k in range(ld):\n if j & (1 << k):\n f = True\n for e in c:\n if d[k] % e == 0:\n f = False\n ff = False\n break\n if f:\n c.append(d[k])\n if not ff:\n break\n if ff:\n s.add(tuple(c + [n + 1]))\n b = sorted(list(s), reverse=True)\n for c in b:\n t = 0\n for j in range(1, n + 1):\n f = False\n for e in c:\n if j % e == 0:\n f = True\n break\n if f:\n t += a[j - 1]\n if t < 0:\n for j in range(1, n + 1):\n f = False\n for e in c:\n if j % e == 0:\n f = True\n break\n if f:\n a[j - 1] = 0\n return sum(a)\n\n\nprint(main())\n", "code_v1_no_empty_lines": "import math, string, itertools, math, heapq, collections, re, array, bisect, sys, copy, functools\nimport time, random\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9 + 7\nmod2 = 998244353\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in sys.stdin.readlines()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LF():\n return [float(x) for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef F():\n return float(sys.stdin.readline())\n\n\ndef S():\n return input()\n\n\ndef pf(s):\n return print(s, flush=True)\n\n\ndef pe(s):\n return print(str(s), file=sys.stderr)\n\n\ndef JA(a, sep):\n return sep.join(map(str, a))\n\n\ndef JAA(a, s, t):\n return s.join(t.join(map(str, b)) for b in a)\n\n\nclass Flow:\n def __init__(self, e, N):\n self.E = e\n self.N = N\n\n def max_flow(self, s, t):\n r = 0\n e = self.E\n\n def f(c, cap):\n v = self.v\n v[c] = 1\n if c == t:\n return cap\n for i in range(self.N):\n if v[i] or e[c][i] <= 0:\n continue\n cp = min(cap, e[c][i])\n k = f(i, cp)\n if k > 0:\n e[c][i] -= k\n e[i][c] += k\n return k\n return 0\n\n while True:\n self.v = [None] * self.N\n fs = f(s, inf)\n if fs == 0:\n break\n r += fs\n return r\n\n\ndef main():\n n = I()\n a = LI()\n s = n\n t = n + 1\n e = [[0] * (n + 2) for _ in range(n + 2)]\n for i in range(n):\n c = a[i]\n if c < 0:\n e[s][i] = -c\n ii = i + 1\n for j in range(ii * 2, n + 1, ii):\n e[i][j - 1] = inf\n else:\n e[i][t] = c\n fl = Flow(e, n + 2)\n r = fl.max_flow(s, t)\n return sum(map(lambda x: max(0, x), a)) - r\n\n\n# start = time.time()\nprint(main())\n# pe(time.time() - start)\n", "code_same": false, "relative_loc_diff_percent": 3.2608695652, "diff": ["-import math, string, itertools, math, heapq, collections, re, array, bisect, sys, random, time, copy, functools", "+import math, string, itertools, math, heapq, collections, re, array, bisect, sys, copy, functools", "+import time, random", "-eps = 1.0 / 10**15", "+eps = 1.0 / 10**10", "+mod2 = 998244353", "+dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]", "+ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]", "- return [int(x) for x in sys.stdin.readline().split()]", "+ return list(map(int, sys.stdin.readline().split()))", "+", "+", "+def LLI():", "+ return [list(map(int, l.split())) for l in sys.stdin.readlines()]", "-def divisions(n):", "- sq = int(math.sqrt(n) + 1)", "- d = collections.defaultdict(int)", "- while n % 2 == 0:", "- n //= 2", "- d[2] += 1", "- i = 3", "- while n > 1 and sq >= i:", "- if n % i == 0:", "- n //= i", "- d[i] += 1", "- else:", "- i += 2", "- if n > 1:", "- d[n] += 1", "- r = [1]", "- for k, v in d.items():", "- for c in r[:]:", "- for i in range(1, v + 1):", "- r.append(c * (k**i))", "- return sorted(r)", "+def pe(s):", "+ return print(str(s), file=sys.stderr)", "+", "+", "+def JA(a, sep):", "+ return sep.join(map(str, a))", "+", "+", "+def JAA(a, s, t):", "+ return s.join(t.join(map(str, b)) for b in a)", "+", "+", "+class Flow:", "+ def __init__(self, e, N):", "+ self.E = e", "+ self.N = N", "+", "+ def max_flow(self, s, t):", "+ r = 0", "+ e = self.E", "+", "+ def f(c, cap):", "+ v = self.v", "+ v[c] = 1", "+ if c == t:", "+ return cap", "+ for i in range(self.N):", "+ if v[i] or e[c][i] <= 0:", "+ continue", "+ cp = min(cap, e[c][i])", "+ k = f(i, cp)", "+ if k > 0:", "+ e[c][i] -= k", "+ e[i][c] += k", "+ return k", "+ return 0", "+", "+ while True:", "+ self.v = [None] * self.N", "+ fs = f(s, inf)", "+ if fs == 0:", "+ break", "+ r += fs", "+ return r", "- s = set()", "- for i in range(n, 0, -1):", "- d = divisions(i)", "- ld = len(d)", "- for j in range(1, 2**ld):", "- c = []", "- ff = True", "- for k in range(ld):", "- if j & (1 << k):", "- f = True", "- for e in c:", "- if d[k] % e == 0:", "- f = False", "- ff = False", "- break", "- if f:", "- c.append(d[k])", "- if not ff:", "- break", "- if ff:", "- s.add(tuple(c + [n + 1]))", "- b = sorted(list(s), reverse=True)", "- for c in b:", "- t = 0", "- for j in range(1, n + 1):", "- f = False", "- for e in c:", "- if j % e == 0:", "- f = True", "- break", "- if f:", "- t += a[j - 1]", "- if t < 0:", "- for j in range(1, n + 1):", "- f = False", "- for e in c:", "- if j % e == 0:", "- f = True", "- break", "- if f:", "- a[j - 1] = 0", "- return sum(a)", "+ s = n", "+ t = n + 1", "+ e = [[0] * (n + 2) for _ in range(n + 2)]", "+ for i in range(n):", "+ c = a[i]", "+ if c < 0:", "+ e[s][i] = -c", "+ ii = i + 1", "+ for j in range(ii * 2, n + 1, ii):", "+ e[i][j - 1] = inf", "+ else:", "+ e[i][t] = c", "+ fl = Flow(e, n + 2)", "+ r = fl.max_flow(s, t)", "+ return sum(map(lambda x: max(0, x), a)) - r", "+# start = time.time()", "+# pe(time.time() - start)"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2170818343, "measured_runtime_v1": 0.0062613072, "runtime_lift": 34.670369248, "key": ["s305170925", "s833575440"]}
{"user_id": "u072053884", "problem_id": "p02378", "language": "python", "submission_id_v0": "s432486243", "submission_id_v1": "s242092393", "cpu_time_v0": 350, "cpu_time_v1": 120, "memory_v0": 8348, "memory_v1": 8420, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 65.71, "input": "# Acceptance of input\n\n\n\nimport sys\n\n\n\nfile_input = sys.stdin\n\n\n\nX, Y, E = list(map(int, file_input.readline().split()))\n\n\n\nv_num = X + Y + 2\n\n\n\nadj_mat = [[0] * (v_num) for i in range(v_num)]\n\n\n\nfor line in file_input:\n\n x, y = list(map(int, line.split()))\n\n adj_mat[x][X + y] = 1\n\n\n\ns = X + Y\n\nt = s + 1\n\n\n\nfor i in range(X):\n\n adj_mat[s][i] = 1\n\n\n\nfor i in range(X, s):\n\n adj_mat[i][t] = 1\n\n\n\n# Dinic's algorithm\n\n\n\nimport collections\n\n\n\n# BFS for residual capacity network to construct level graph\n\ndef bfs(start, goal, parent):\n\n unvisited = [True] * v_num\n\n queue = collections.deque()\n\n queue.append(start)\n\n unvisited[start] = False\n\n while queue:\n\n u = queue.popleft()\n\n for v, r_capacity in enumerate(adj_mat[u]):\n\n if unvisited[v] and (r_capacity > 0):\n\n parent[v].append(u)\n\n queue.append(v)\n\n unvisited[v] = False\n\n return unvisited[goal]\n\n\n\n# DFS for level graph and construct blocking flow\n\ndef dfs(goal, path, parent, blocking_flow):\n\n v = path[-1]\n\n if v == goal:\n\n aug_path_flow = 10000\n\n for x, y in zip(path[1:], path[:-1]):\n\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\n\n for x, y in zip(path[1:], path[:-1]):\n\n adj_mat[x][y] -= aug_path_flow\n\n adj_mat[y][x] += aug_path_flow\n\n blocking_flow[0] += aug_path_flow\n\n else:\n\n for u in parent[v]:\n\n path.append(u)\n\n dfs(goal, path, parent, blocking_flow)\n\n path.pop()\n\n\n\ndef dinic(source, sink):\n\n max_flow = 0\n\n parent = [[] for i in range(v_num)]\n\n while not bfs(source, sink, parent):\n\n blocking_flow = [0]\n\n path = [sink]\n\n # search in reverse direction from sink\n\n dfs(source, path, parent, blocking_flow)\n\n max_flow += blocking_flow[0]\n\n parent = [[] for i in range(v_num)]\n\n return max_flow\n\n\n\n# output\n\nprint((dinic(s, t)))", "target": "# Acceptance of input\n\n\n\nimport sys\n\n\n\nfile_input = sys.stdin\n\n\n\nX, Y, E = list(map(int, file_input.readline().split()))\n\n\n\nv_num = X + Y + 2\n\n\n\nadj_mat = [[0] * (v_num) for i in range(v_num)]\n\n\n\nfor line in file_input:\n\n x, y = list(map(int, line.split()))\n\n adj_mat[x][X + y] = 1\n\n\n\ns = X + Y\n\nt = s + 1\n\n\n\nfor i in range(X):\n\n adj_mat[s][i] = 1\n\n\n\nfor i in range(X, s):\n\n adj_mat[i][t] = 1\n\n\n\n# Dinic's algorithm\n\n\n\nimport collections\n\n\n\n# BFS for residual capacity network to construct level graph\n\ndef bfs(start, goal, parent):\n\n level = [v_num] * v_num\n\n unvisited = [True] * v_num\n\n queue = collections.deque()\n\n queue.append(start)\n\n level[start] = 0\n\n unvisited[start] = False\n\n while queue:\n\n u = queue.popleft()\n\n next_level = level[u] + 1\n\n for v, r_capacity in enumerate(adj_mat[u]):\n\n if (level[v] >= next_level) and (r_capacity > 0):\n\n level[v] = next_level\n\n parent[v].append(u)\n\n if unvisited[v]:\n\n queue.append(v)\n\n unvisited[v] = False\n\n return level[goal]\n\n\n\n# DFS for level graph and construct blocking flow\n\ndef dfs(goal, path, parent, blocking_flow):\n\n v = path[-1]\n\n if v == goal:\n\n aug_path_flow = 10000\n\n for x, y in zip(path[1:], path[:-1]):\n\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\n\n for x, y in zip(path[1:], path[:-1]):\n\n adj_mat[x][y] -= aug_path_flow\n\n adj_mat[y][x] += aug_path_flow\n\n blocking_flow[0] += aug_path_flow\n\n else:\n\n for u in parent[v]:\n\n path.append(u)\n\n dfs(goal, path, parent, blocking_flow)\n\n path.pop()\n\n\n\ndef dinic(source, sink):\n\n max_flow = 0\n\n parent = [[] for i in range(v_num)]\n\n while bfs(source, sink, parent) != v_num:\n\n blocking_flow = [0]\n\n path = [sink]\n\n # search in reverse direction from sink\n\n dfs(source, path, parent, blocking_flow)\n\n max_flow += blocking_flow[0]\n\n parent = [[] for i in range(v_num)]\n\n return max_flow\n\n\n\n# output\n\nprint((dinic(s, t)))", "code_v0_loc": 75, "code_v1_loc": 80, "code_v0_num_chars": 1953, "code_v1_num_chars": 2133, "code_v0_no_empty_lines": "# Acceptance of input\nimport sys\n\nfile_input = sys.stdin\nX, Y, E = list(map(int, file_input.readline().split()))\nv_num = X + Y + 2\nadj_mat = [[0] * (v_num) for i in range(v_num)]\nfor line in file_input:\n x, y = list(map(int, line.split()))\n adj_mat[x][X + y] = 1\ns = X + Y\nt = s + 1\nfor i in range(X):\n adj_mat[s][i] = 1\nfor i in range(X, s):\n adj_mat[i][t] = 1\n# Dinic's algorithm\nimport collections\n\n# BFS for residual capacity network to construct level graph\ndef bfs(start, goal, parent):\n unvisited = [True] * v_num\n queue = collections.deque()\n queue.append(start)\n unvisited[start] = False\n while queue:\n u = queue.popleft()\n for v, r_capacity in enumerate(adj_mat[u]):\n if unvisited[v] and (r_capacity > 0):\n parent[v].append(u)\n queue.append(v)\n unvisited[v] = False\n return unvisited[goal]\n\n\n# DFS for level graph and construct blocking flow\ndef dfs(goal, path, parent, blocking_flow):\n v = path[-1]\n if v == goal:\n aug_path_flow = 10000\n for x, y in zip(path[1:], path[:-1]):\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\n for x, y in zip(path[1:], path[:-1]):\n adj_mat[x][y] -= aug_path_flow\n adj_mat[y][x] += aug_path_flow\n blocking_flow[0] += aug_path_flow\n else:\n for u in parent[v]:\n path.append(u)\n dfs(goal, path, parent, blocking_flow)\n path.pop()\n\n\ndef dinic(source, sink):\n max_flow = 0\n parent = [[] for i in range(v_num)]\n while not bfs(source, sink, parent):\n blocking_flow = [0]\n path = [sink]\n # search in reverse direction from sink\n dfs(source, path, parent, blocking_flow)\n max_flow += blocking_flow[0]\n parent = [[] for i in range(v_num)]\n return max_flow\n\n\n# output\nprint((dinic(s, t)))\n", "code_v1_no_empty_lines": "# Acceptance of input\nimport sys\n\nfile_input = sys.stdin\nX, Y, E = list(map(int, file_input.readline().split()))\nv_num = X + Y + 2\nadj_mat = [[0] * (v_num) for i in range(v_num)]\nfor line in file_input:\n x, y = list(map(int, line.split()))\n adj_mat[x][X + y] = 1\ns = X + Y\nt = s + 1\nfor i in range(X):\n adj_mat[s][i] = 1\nfor i in range(X, s):\n adj_mat[i][t] = 1\n# Dinic's algorithm\nimport collections\n\n# BFS for residual capacity network to construct level graph\ndef bfs(start, goal, parent):\n level = [v_num] * v_num\n unvisited = [True] * v_num\n queue = collections.deque()\n queue.append(start)\n level[start] = 0\n unvisited[start] = False\n while queue:\n u = queue.popleft()\n next_level = level[u] + 1\n for v, r_capacity in enumerate(adj_mat[u]):\n if (level[v] >= next_level) and (r_capacity > 0):\n level[v] = next_level\n parent[v].append(u)\n if unvisited[v]:\n queue.append(v)\n unvisited[v] = False\n return level[goal]\n\n\n# DFS for level graph and construct blocking flow\ndef dfs(goal, path, parent, blocking_flow):\n v = path[-1]\n if v == goal:\n aug_path_flow = 10000\n for x, y in zip(path[1:], path[:-1]):\n aug_path_flow = min(aug_path_flow, adj_mat[x][y])\n for x, y in zip(path[1:], path[:-1]):\n adj_mat[x][y] -= aug_path_flow\n adj_mat[y][x] += aug_path_flow\n blocking_flow[0] += aug_path_flow\n else:\n for u in parent[v]:\n path.append(u)\n dfs(goal, path, parent, blocking_flow)\n path.pop()\n\n\ndef dinic(source, sink):\n max_flow = 0\n parent = [[] for i in range(v_num)]\n while bfs(source, sink, parent) != v_num:\n blocking_flow = [0]\n path = [sink]\n # search in reverse direction from sink\n dfs(source, path, parent, blocking_flow)\n max_flow += blocking_flow[0]\n parent = [[] for i in range(v_num)]\n return max_flow\n\n\n# output\nprint((dinic(s, t)))\n", "code_same": false, "relative_loc_diff_percent": 6.25, "diff": ["+ level = [v_num] * v_num", "+ level[start] = 0", "+ next_level = level[u] + 1", "- if unvisited[v] and (r_capacity > 0):", "+ if (level[v] >= next_level) and (r_capacity > 0):", "+ level[v] = next_level", "- queue.append(v)", "- unvisited[v] = False", "- return unvisited[goal]", "+ if unvisited[v]:", "+ queue.append(v)", "+ unvisited[v] = False", "+ return level[goal]", "- while not bfs(source, sink, parent):", "+ while bfs(source, sink, parent) != v_num:"], "diff_only_import_comment": false, "measured_runtime_v0": 0.2959556043, "measured_runtime_v1": 0.2352844019, "runtime_lift": 1.2578632579, "key": ["s432486243", "s242092393"]}
{"user_id": "u216928054", "problem_id": "p02560", "language": "python", "submission_id_v0": "s978863609", "submission_id_v1": "s598945859", "cpu_time_v0": 297, "cpu_time_v1": 234, "memory_v0": 78412, "memory_v1": 70336, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 21.21, "input": "#!/usr/bin/env python3\n\nimport sys\n\nsys.setrecursionlimit(10**6)\n\nINF = 10 ** 9 + 1 # sys.maxsize # float(\"inf\")\n\nMOD = 10 ** 9 + 7\n\n\n\n\n\ndef floor_sum(n, m, a, b):\n\n ret = 0\n\n if a >= m:\n\n ret += (n - 1) * n * (a // m) // 2\n\n a %= m\n\n if b >= m:\n\n ret += n * (b // m)\n\n b %= m\n\n y_max = (a * n + b) // m\n\n x_max = y_max * m - b\n\n if y_max == 0:\n\n return ret\n\n ret += (n - (x_max + a - 1) // a) * y_max\n\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\n\n return ret\n\n\n\n\n\ndef debug(*x):\n\n print(*x, file=sys.stderr)\n\n\n\n\n\ndef solve(SOLVE_PARAMS):\n\n pass\n\n\n\n\n\ndef main():\n\n # parse input\n\n T = int(input())\n\n for _t in range(T):\n\n N, M, A, B = map(int, input().split())\n\n print(floor_sum(N, M, A, B))\n\n\n\n\n\n# tests\n\nT1 = \"\"\"\n\n5\n\n4 10 6 3\n\n6 5 4 3\n\n1 1 0 0\n\n31415 92653 58979 32384\n\n1000000000 1000000000 999999999 999999999\n\n\"\"\"\n\nTEST_T1 = \"\"\"\n\n>>> as_input(T1)\n\n>>> main()\n\n3\n\n13\n\n0\n\n314095480\n\n499999999500000000\n\n\"\"\"\n\n\n\n\n\ndef _test():\n\n import doctest\n\n doctest.testmod()\n\n g = globals()\n\n for k in sorted(g):\n\n if k.startswith(\"TEST_\"):\n\n doctest.run_docstring_examples(g[k], g, name=k)\n\n\n\n\n\ndef as_input(s):\n\n \"use in test, use given string as input file\"\n\n import io\n\n f = io.StringIO(s.strip())\n\n g = globals()\n\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\n\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\n\n\n\n\n\ninput = sys.stdin.buffer.readline\n\nread = sys.stdin.buffer.read\n\n\n\nif sys.argv[-1] == \"-t\":\n\n print(\"testing\")\n\n _test()\n\n sys.exit()\n\n\n\nmain()\n", "target": "#!/usr/bin/env python3\n\nimport sys\n\nsys.setrecursionlimit(10**6)\n\nINF = 10 ** 9 + 1 # sys.maxsize # float(\"inf\")\n\nMOD = 10 ** 9 + 7\n\n\n\n\n\ndef floor_sum_1(n, m, a, b):\n\n ret = 0\n\n if a >= m:\n\n ret += (n - 1) * n * (a // m) // 2\n\n a %= m\n\n if b >= m:\n\n ret += n * (b // m)\n\n b %= m\n\n y_max = (a * n + b) // m\n\n x_max = y_max * m - b\n\n if y_max == 0:\n\n return ret\n\n ret += (n - (x_max + a - 1) // a) * y_max\n\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\n\n return ret\n\n\n\n\n\ndef floor_sum(n, m, a, b):\n\n ret = 0\n\n while True:\n\n if a >= m:\n\n ret += (n - 1) * n * (a // m) // 2\n\n a %= m\n\n if b >= m:\n\n ret += n * (b // m)\n\n b %= m\n\n y_max = (a * n + b) // m\n\n x_max = y_max * m - b\n\n if y_max == 0:\n\n return ret\n\n ret += (n - (x_max + a - 1) // a) * y_max\n\n n = y_max\n\n m, a, b = a, m, (a - x_max % a) % a\n\n\n\n\n\ndef debug(*x):\n\n print(*x, file=sys.stderr)\n\n\n\n\n\ndef solve(SOLVE_PARAMS):\n\n pass\n\n\n\n\n\ndef main():\n\n # parse input\n\n T = int(input())\n\n for _t in range(T):\n\n N, M, A, B = map(int, input().split())\n\n print(floor_sum(N, M, A, B))\n\n\n\n\n\n# tests\n\nT1 = \"\"\"\n\n5\n\n4 10 6 3\n\n6 5 4 3\n\n1 1 0 0\n\n31415 92653 58979 32384\n\n1000000000 1000000000 999999999 999999999\n\n\"\"\"\n\nTEST_T1 = \"\"\"\n\n>>> as_input(T1)\n\n>>> main()\n\n3\n\n13\n\n0\n\n314095480\n\n499999999500000000\n\n\"\"\"\n\n\n\n\n\ndef _test():\n\n import doctest\n\n doctest.testmod()\n\n g = globals()\n\n for k in sorted(g):\n\n if k.startswith(\"TEST_\"):\n\n doctest.run_docstring_examples(g[k], g, name=k)\n\n\n\n\n\ndef as_input(s):\n\n \"use in test, use given string as input file\"\n\n import io\n\n f = io.StringIO(s.strip())\n\n g = globals()\n\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\n\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\n\n\n\n\n\ninput = sys.stdin.buffer.readline\n\nread = sys.stdin.buffer.read\n\n\n\nif sys.argv[-1] == \"-t\":\n\n print(\"testing\")\n\n _test()\n\n sys.exit()\n\n\n\nmain()\n", "code_v0_loc": 87, "code_v1_loc": 105, "code_v0_num_chars": 1613, "code_v1_num_chars": 2066, "code_v0_no_empty_lines": "#!/usr/bin/env python3\nimport sys\n\nsys.setrecursionlimit(10**6)\nINF = 10**9 + 1 # sys.maxsize # float(\"inf\")\nMOD = 10**9 + 7\n\n\ndef floor_sum(n, m, a, b):\n ret = 0\n if a >= m:\n ret += (n - 1) * n * (a // m) // 2\n a %= m\n if b >= m:\n ret += n * (b // m)\n b %= m\n y_max = (a * n + b) // m\n x_max = y_max * m - b\n if y_max == 0:\n return ret\n ret += (n - (x_max + a - 1) // a) * y_max\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\n return ret\n\n\ndef debug(*x):\n print(*x, file=sys.stderr)\n\n\ndef solve(SOLVE_PARAMS):\n pass\n\n\ndef main():\n # parse input\n T = int(input())\n for _t in range(T):\n N, M, A, B = map(int, input().split())\n print(floor_sum(N, M, A, B))\n\n\n# tests\nT1 = \"\"\"\n5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n\"\"\"\nTEST_T1 = \"\"\"\n>>> as_input(T1)\n>>> main()\n3\n13\n0\n314095480\n499999999500000000\n\"\"\"\n\n\ndef _test():\n import doctest\n\n doctest.testmod()\n g = globals()\n for k in sorted(g):\n if k.startswith(\"TEST_\"):\n doctest.run_docstring_examples(g[k], g, name=k)\n\n\ndef as_input(s):\n \"use in test, use given string as input file\"\n import io\n\n f = io.StringIO(s.strip())\n g = globals()\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\n\n\ninput = sys.stdin.buffer.readline\nread = sys.stdin.buffer.read\nif sys.argv[-1] == \"-t\":\n print(\"testing\")\n _test()\n sys.exit()\nmain()\n", "code_v1_no_empty_lines": "#!/usr/bin/env python3\nimport sys\n\nsys.setrecursionlimit(10**6)\nINF = 10**9 + 1 # sys.maxsize # float(\"inf\")\nMOD = 10**9 + 7\n\n\ndef floor_sum_1(n, m, a, b):\n ret = 0\n if a >= m:\n ret += (n - 1) * n * (a // m) // 2\n a %= m\n if b >= m:\n ret += n * (b // m)\n b %= m\n y_max = (a * n + b) // m\n x_max = y_max * m - b\n if y_max == 0:\n return ret\n ret += (n - (x_max + a - 1) // a) * y_max\n ret += floor_sum(y_max, a, m, (a - x_max % a) % a)\n return ret\n\n\ndef floor_sum(n, m, a, b):\n ret = 0\n while True:\n if a >= m:\n ret += (n - 1) * n * (a // m) // 2\n a %= m\n if b >= m:\n ret += n * (b // m)\n b %= m\n y_max = (a * n + b) // m\n x_max = y_max * m - b\n if y_max == 0:\n return ret\n ret += (n - (x_max + a - 1) // a) * y_max\n n = y_max\n m, a, b = a, m, (a - x_max % a) % a\n\n\ndef debug(*x):\n print(*x, file=sys.stderr)\n\n\ndef solve(SOLVE_PARAMS):\n pass\n\n\ndef main():\n # parse input\n T = int(input())\n for _t in range(T):\n N, M, A, B = map(int, input().split())\n print(floor_sum(N, M, A, B))\n\n\n# tests\nT1 = \"\"\"\n5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n\"\"\"\nTEST_T1 = \"\"\"\n>>> as_input(T1)\n>>> main()\n3\n13\n0\n314095480\n499999999500000000\n\"\"\"\n\n\ndef _test():\n import doctest\n\n doctest.testmod()\n g = globals()\n for k in sorted(g):\n if k.startswith(\"TEST_\"):\n doctest.run_docstring_examples(g[k], g, name=k)\n\n\ndef as_input(s):\n \"use in test, use given string as input file\"\n import io\n\n f = io.StringIO(s.strip())\n g = globals()\n g[\"input\"] = lambda: bytes(f.readline(), \"ascii\")\n g[\"read\"] = lambda: bytes(f.read(), \"ascii\")\n\n\ninput = sys.stdin.buffer.readline\nread = sys.stdin.buffer.read\nif sys.argv[-1] == \"-t\":\n print(\"testing\")\n _test()\n sys.exit()\nmain()\n", "code_same": false, "relative_loc_diff_percent": 17.1428571429, "diff": ["-def floor_sum(n, m, a, b):", "+def floor_sum_1(n, m, a, b):", "+", "+", "+def floor_sum(n, m, a, b):", "+ ret = 0", "+ while True:", "+ if a >= m:", "+ ret += (n - 1) * n * (a // m) // 2", "+ a %= m", "+ if b >= m:", "+ ret += n * (b // m)", "+ b %= m", "+ y_max = (a * n + b) // m", "+ x_max = y_max * m - b", "+ if y_max == 0:", "+ return ret", "+ ret += (n - (x_max + a - 1) // a) * y_max", "+ n = y_max", "+ m, a, b = a, m, (a - x_max % a) % a"], "diff_only_import_comment": false, "measured_runtime_v0": 0.1788789105, "measured_runtime_v1": 0.0066359096, "runtime_lift": 26.9562007629, "key": ["s978863609", "s598945859"]}
{"user_id": "u585482323", "problem_id": "p03634", "language": "python", "submission_id_v0": "s798160758", "submission_id_v1": "s876456894", "cpu_time_v0": 777, "cpu_time_v1": 659, "memory_v0": 85552, "memory_v1": 85552, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 15.19, "input": "#!usr/bin/env python3\n\nfrom collections import defaultdict\n\nfrom collections import deque\n\nfrom heapq import heappush, heappop\n\nimport sys\n\nimport math\n\nimport bisect\n\nimport random\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\n\ndef I(): return int(sys.stdin.readline())\n\ndef LS():return list(map(list, sys.stdin.readline().split()))\n\ndef S(): return list(sys.stdin.readline())[:-1]\n\ndef IR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = I()\n\n return l\n\ndef LIR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = LI()\n\n return l\n\ndef SR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = S()\n\n return l\n\ndef LSR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = SR()\n\n return l\n\nmod = 1000000007\n\n\n\n#A\n\n\"\"\"\n\ndef gcd(a,b):\n\n if a == 0:\n\n return b\n\n return gcd(b%a,a)\n\nn = I()\n\na = IR(n)\n\nl = a[0]\n\nfor i in range(1,n):\n\n g = gcd(l,a[i])\n\n l *= a[i]//g\n\nprint(l)\n\n\"\"\"\n\n\n\n#B\n\nn = I()\n\nv = [[] for i in range(n)]\n\nfor i in range(n-1):\n\n a,b,c = LI()\n\n a -= 1\n\n b -= 1\n\n v[a].append([b,c])\n\n v[b].append([a,c])\n\nQ,k = LI()\n\nd = [-1 for i in range(n)]\n\nd[k-1] = 0\n\nq = deque()\n\nq.append(k-1)\n\nwhile q:\n\n x = q.pop()\n\n for y,c in v[x]:\n\n if d[y] == -1:\n\n d[y] = d[x]+c\n\n q.append(y)\n\nfor i in range(Q):\n\n x,y = LI()\n\n x -= 1\n\n y -= 1\n\n print((d[x]+d[y]))\n\n#C\n\n\n\n#D\n\n\n\n#E\n\n\n\n#F\n\n\n\n#G\n\n\n\n#H\n\n\n\n#I\n\n\n\n#J\n\n\n\n#K\n\n\n\n#L\n\n\n\n#M\n\n\n\n#N\n\n\n\n#O\n\n\n\n#P\n\n\n\n#Q\n\n\n\n#R\n\n\n\n#S\n\n\n\n#T\n", "target": "#!usr/bin/env python3\n\nfrom collections import defaultdict\n\nfrom collections import deque\n\nfrom heapq import heappush, heappop\n\nimport sys\n\nimport math\n\nimport bisect\n\nimport random\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\n\ndef I(): return int(sys.stdin.readline())\n\ndef LS():return list(map(list, sys.stdin.readline().split()))\n\ndef S(): return list(sys.stdin.readline())[:-1]\n\ndef IR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = I()\n\n return l\n\ndef LIR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = LI()\n\n return l\n\ndef SR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = S()\n\n return l\n\ndef LSR(n):\n\n l = [None for i in range(n)]\n\n for i in range(n):l[i] = SR()\n\n return l\n\nmod = 1000000007\n\n\n\n#A\n\n\"\"\"\n\ndef gcd(a,b):\n\n if a == 0:\n\n return b\n\n return gcd(b%a,a)\n\nn = I()\n\na = IR(n)\n\nl = a[0]\n\nfor i in range(1,n):\n\n g = gcd(l,a[i])\n\n l *= a[i]//g\n\nprint(l)\n\n\"\"\"\n\n\n\n#B\n\nn = I()\n\nv = [[] for i in range(n)]\n\nfor i in range(n-1):\n\n a,b,c = LI()\n\n a -= 1\n\n b -= 1\n\n v[a].append([b,c])\n\n v[b].append([a,c])\n\nQ,k = LI()\n\nd = [-1 for i in range(n)]\n\nd[k-1] = 0\n\nq = deque()\n\nq.append(k-1)\n\nwhile q:\n\n x = q.popleft()\n\n for y,c in v[x]:\n\n if d[y] == -1:\n\n d[y] = d[x]+c\n\n q.append(y)\n\nfor i in range(Q):\n\n x,y = LI()\n\n x -= 1\n\n y -= 1\n\n print((d[x]+d[y]))\n\n#C\n\n\n\n#D\n\n\n\n#E\n\n\n\n#F\n\n\n\n#G\n\n\n\n#H\n\n\n\n#I\n\n\n\n#J\n\n\n\n#K\n\n\n\n#L\n\n\n\n#M\n\n\n\n#N\n\n\n\n#O\n\n\n\n#P\n\n\n\n#Q\n\n\n\n#R\n\n\n\n#S\n\n\n\n#T\n", "code_v0_loc": 105, "code_v1_loc": 105, "code_v0_num_chars": 1535, "code_v1_num_chars": 1539, "code_v0_no_empty_lines": "#!usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = I()\n return l\n\n\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = LI()\n return l\n\n\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = S()\n return l\n\n\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = SR()\n return l\n\n\nmod = 1000000007\n# A\n\"\"\"\ndef gcd(a,b):\n if a == 0:\n return b\n return gcd(b%a,a)\nn = I()\na = IR(n)\nl = a[0]\nfor i in range(1,n):\n g = gcd(l,a[i])\n l *= a[i]//g\nprint(l)\n\"\"\"\n# B\nn = I()\nv = [[] for i in range(n)]\nfor i in range(n - 1):\n a, b, c = LI()\n a -= 1\n b -= 1\n v[a].append([b, c])\n v[b].append([a, c])\nQ, k = LI()\nd = [-1 for i in range(n)]\nd[k - 1] = 0\nq = deque()\nq.append(k - 1)\nwhile q:\n x = q.pop()\n for y, c in v[x]:\n if d[y] == -1:\n d[y] = d[x] + c\n q.append(y)\nfor i in range(Q):\n x, y = LI()\n x -= 1\n y -= 1\n print((d[x] + d[y]))\n# C\n# D\n# E\n# F\n# G\n# H\n# I\n# J\n# K\n# L\n# M\n# N\n# O\n# P\n# Q\n# R\n# S\n# T\n", "code_v1_no_empty_lines": "#!usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = I()\n return l\n\n\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = LI()\n return l\n\n\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = S()\n return l\n\n\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = SR()\n return l\n\n\nmod = 1000000007\n# A\n\"\"\"\ndef gcd(a,b):\n if a == 0:\n return b\n return gcd(b%a,a)\nn = I()\na = IR(n)\nl = a[0]\nfor i in range(1,n):\n g = gcd(l,a[i])\n l *= a[i]//g\nprint(l)\n\"\"\"\n# B\nn = I()\nv = [[] for i in range(n)]\nfor i in range(n - 1):\n a, b, c = LI()\n a -= 1\n b -= 1\n v[a].append([b, c])\n v[b].append([a, c])\nQ, k = LI()\nd = [-1 for i in range(n)]\nd[k - 1] = 0\nq = deque()\nq.append(k - 1)\nwhile q:\n x = q.popleft()\n for y, c in v[x]:\n if d[y] == -1:\n d[y] = d[x] + c\n q.append(y)\nfor i in range(Q):\n x, y = LI()\n x -= 1\n y -= 1\n print((d[x] + d[y]))\n# C\n# D\n# E\n# F\n# G\n# H\n# I\n# J\n# K\n# L\n# M\n# N\n# O\n# P\n# Q\n# R\n# S\n# T\n", "code_same": false, "relative_loc_diff_percent": 0.0, "diff": ["- x = q.pop()", "+ x = q.popleft()"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3495916958, "measured_runtime_v1": 0.1121557097, "runtime_lift": 3.1170209395, "key": ["s798160758", "s876456894"]}
{"user_id": "u488401358", "problem_id": "p02649", "language": "python", "submission_id_v0": "s231020544", "submission_id_v1": "s831601953", "cpu_time_v0": 688, "cpu_time_v1": 413, "memory_v0": 76468, "memory_v1": 102912, "status_v0": "Accepted", "status_v1": "Accepted", "improvement_frac": 39.97, "input": "def popcount(x):\n\n x = x - ((x >> 1) & 0x55555555)\n\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\n\n x = (x + (x >> 4)) & 0x0f0f0f0f\n\n x = x + (x >> 8)\n\n x = x + (x >> 16)\n\n return x & 0x0000007f\n\n\n\ncmb=[[0 for i in range(51)] for j in range(51)]\n\ncmb[0][0]=1\n\nfor i in range(51):\n\n for j in range(51):\n\n if i!=50 and j!=50:\n\n cmb[i+1][j+1]+=cmb[i][j]\n\n if i!=50:\n\n cmb[i+1][j]+=cmb[i][j]\n\n\n\nfor i in range(1,51):\n\n for j in range(2,51):\n\n cmb[i][j]+=cmb[i][j-1]\n\n\n\nN,K,T,S=list(map(int,input().split()))\n\na=list(map(int,input().split()))\n\n\n\nmust0=[i for i in range(18) if S>>i &1==0]\n\nmust1=[i for i in range(18) if T>>i &1==1]\n\n\n\nA=[]\n\nfor val in a:\n\n check=True\n\n for j in must0:\n\n check=check&(val>>j &1==0)\n\n for j in must1:\n\n check=check&(val>>j &1==1)\n\n if check:\n\n A.append(val)\n\n\n\nif not A:\n\n print((0))\n\n exit()\n\n\n\nbit=[]\n\nfor i in range(18):\n\n if i not in must0 and i not in must1:\n\n bit.append(i)\n\n\n\nfor i in range(len(A)):\n\n temp=0\n\n for j in range(len(bit)):\n\n temp+=(A[i]>>bit[j] &1==1)*2**j\n\n A[i]=temp\n\n\n\nans=0\n\nn=len(bit)\n\ndata=[0]*(2**n)\n\nfor i in range(2**n):\n\n t=set([])\n\n for a in A:\n\n data[a&i]+=1\n\n t.add(a&i)\n\n temp=0\n\n for val in t:\n\n temp+=cmb[data[val]][min(K,data[val])]\n\n ans+=temp*(-1)**popcount(i)\n\n for val in t:\n\n data[val]=0\n\n\n\nprint(ans)\n", "target": "def popcount(x):\n\n x = x - ((x >> 1) & 0x55555555)\n\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\n\n x = (x + (x >> 4)) & 0x0f0f0f0f\n\n x = x + (x >> 8)\n\n x = x + (x >> 16)\n\n return x & 0x0000007f\n\n\n\ncmb=[[0 for i in range(51)] for j in range(51)]\n\ncmb[0][0]=1\n\nfor i in range(51):\n\n for j in range(51):\n\n if i!=50:\n\n cmb[i+1][j]+=cmb[i][j]\n\n if j!=50 and i!=50:\n\n cmb[i+1][j+1]+=cmb[i][j]\n\n\n\n\n\nfor i in range(1,51):\n\n for j in range(2,51):\n\n cmb[i][j]+=cmb[i][j-1]\n\n\n\nimport random\n\nN,K,T,S=list(map(int,input().split()))\n\na=list(map(int,input().split()))\n\n\n\nmust0=[i for i in range(18) if S>>i &1==0]\n\nmust1=[i for i in range(18) if T>>i &1==1]\n\n\n\nA=[]\n\nfor val in a:\n\n check=True\n\n for j in must0:\n\n check=check&(val>>j &1==0)\n\n for j in must1:\n\n check=check&(val>>j &1==1)\n\n if check:\n\n A.append(val)\n\n\n\nif not A:\n\n print((0))\n\n exit()\n\n\n\nbit=[]\n\nfor i in range(18):\n\n if i not in must0 and i not in must1:\n\n bit.append(i)\n\n\n\nfor i in range(len(A)):\n\n temp=0\n\n for j in range(len(bit)):\n\n temp+=(A[i]>>bit[j] &1==1)*2**j\n\n A[i]=temp\n\n\n\nans=0\n\nn=len(bit)\n\ndata=[0]*(2**n)\n\npc=[popcount(i) for i in range(2**n)]\n\nfor i in range(2**n):\n\n for a in A:\n\n data[a&i]+=1\n\n for a in A:\n\n if data[a&i]:\n\n ans+=cmb[data[a&i]][min(K,data[a&i])]*(-1)**pc[i]\n\n data[a&i]=0\n\n\n\nprint(ans)", "code_v0_loc": 68, "code_v1_loc": 67, "code_v0_num_chars": 1445, "code_v1_num_chars": 1441, "code_v0_no_empty_lines": "def popcount(x):\n x = x - ((x >> 1) & 0x55555555)\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\n x = (x + (x >> 4)) & 0x0F0F0F0F\n x = x + (x >> 8)\n x = x + (x >> 16)\n return x & 0x0000007F\n\n\ncmb = [[0 for i in range(51)] for j in range(51)]\ncmb[0][0] = 1\nfor i in range(51):\n for j in range(51):\n if i != 50 and j != 50:\n cmb[i + 1][j + 1] += cmb[i][j]\n if i != 50:\n cmb[i + 1][j] += cmb[i][j]\nfor i in range(1, 51):\n for j in range(2, 51):\n cmb[i][j] += cmb[i][j - 1]\nN, K, T, S = list(map(int, input().split()))\na = list(map(int, input().split()))\nmust0 = [i for i in range(18) if S >> i & 1 == 0]\nmust1 = [i for i in range(18) if T >> i & 1 == 1]\nA = []\nfor val in a:\n check = True\n for j in must0:\n check = check & (val >> j & 1 == 0)\n for j in must1:\n check = check & (val >> j & 1 == 1)\n if check:\n A.append(val)\nif not A:\n print((0))\n exit()\nbit = []\nfor i in range(18):\n if i not in must0 and i not in must1:\n bit.append(i)\nfor i in range(len(A)):\n temp = 0\n for j in range(len(bit)):\n temp += (A[i] >> bit[j] & 1 == 1) * 2**j\n A[i] = temp\nans = 0\nn = len(bit)\ndata = [0] * (2**n)\nfor i in range(2**n):\n t = set([])\n for a in A:\n data[a & i] += 1\n t.add(a & i)\n temp = 0\n for val in t:\n temp += cmb[data[val]][min(K, data[val])]\n ans += temp * (-1) ** popcount(i)\n for val in t:\n data[val] = 0\nprint(ans)\n", "code_v1_no_empty_lines": "def popcount(x):\n x = x - ((x >> 1) & 0x55555555)\n x = (x & 0x33333333) + ((x >> 2) & 0x33333333)\n x = (x + (x >> 4)) & 0x0F0F0F0F\n x = x + (x >> 8)\n x = x + (x >> 16)\n return x & 0x0000007F\n\n\ncmb = [[0 for i in range(51)] for j in range(51)]\ncmb[0][0] = 1\nfor i in range(51):\n for j in range(51):\n if i != 50:\n cmb[i + 1][j] += cmb[i][j]\n if j != 50 and i != 50:\n cmb[i + 1][j + 1] += cmb[i][j]\nfor i in range(1, 51):\n for j in range(2, 51):\n cmb[i][j] += cmb[i][j - 1]\nimport random\n\nN, K, T, S = list(map(int, input().split()))\na = list(map(int, input().split()))\nmust0 = [i for i in range(18) if S >> i & 1 == 0]\nmust1 = [i for i in range(18) if T >> i & 1 == 1]\nA = []\nfor val in a:\n check = True\n for j in must0:\n check = check & (val >> j & 1 == 0)\n for j in must1:\n check = check & (val >> j & 1 == 1)\n if check:\n A.append(val)\nif not A:\n print((0))\n exit()\nbit = []\nfor i in range(18):\n if i not in must0 and i not in must1:\n bit.append(i)\nfor i in range(len(A)):\n temp = 0\n for j in range(len(bit)):\n temp += (A[i] >> bit[j] & 1 == 1) * 2**j\n A[i] = temp\nans = 0\nn = len(bit)\ndata = [0] * (2**n)\npc = [popcount(i) for i in range(2**n)]\nfor i in range(2**n):\n for a in A:\n data[a & i] += 1\n for a in A:\n if data[a & i]:\n ans += cmb[data[a & i]][min(K, data[a & i])] * (-1) ** pc[i]\n data[a & i] = 0\nprint(ans)\n", "code_same": false, "relative_loc_diff_percent": 1.4705882353, "diff": ["- if i != 50 and j != 50:", "- cmb[i + 1][j + 1] += cmb[i][j]", "+ if j != 50 and i != 50:", "+ cmb[i + 1][j + 1] += cmb[i][j]", "+import random", "+", "+pc = [popcount(i) for i in range(2**n)]", "- t = set([])", "- t.add(a & i)", "- temp = 0", "- for val in t:", "- temp += cmb[data[val]][min(K, data[val])]", "- ans += temp * (-1) ** popcount(i)", "- for val in t:", "- data[val] = 0", "+ for a in A:", "+ if data[a & i]:", "+ ans += cmb[data[a & i]][min(K, data[a & i])] * (-1) ** pc[i]", "+ data[a & i] = 0"], "diff_only_import_comment": false, "measured_runtime_v0": 0.3163019059, "measured_runtime_v1": 0.2340069544, "runtime_lift": 1.3516773748, "key": ["s231020544", "s831601953"]}
|