problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
⌀ | fixed_code
stringlengths 12
526k
⌀ | labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
⌀ | fixed_submission_id
int64 2
1.54M
⌀ | user_id
stringlengths 10
10
⌀ | language
stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02838
|
"""
def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m, ans = 10**9 + 7, 0
for s in map(lambda x: x.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
"""
import numpy as np
def solve(string):
n, *a = map(int, string.split())
# a = ["{:060b}".format(_a) for _a in a]
a = np.asarray(a, dtype=np.int64)
m = 10**9 + 7
ans = 0
for i in range(60):
s = (a & 1).sum()
a >>= 1
# s = "".join(d).count("1")
# ans += s * (n - s) * pow(2, 59 - i, m)
ans = (ans + s * (n - s) * (1 << i)) % m
return str(ans)
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
|
"""
def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m, ans = 10**9 + 7, 0
for s in map(lambda x: x.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
"""
import numpy as np
def solve(string):
n, *a = map(int, string.split())
# a = ["{:060b}".format(_a) for _a in a]
a = np.asarray(a, dtype=np.int64)
m = 10**9 + 7
ans = 0
for i in range(60):
s = int((a & 1).sum())
a >>= 1
# ans += s * (n - s) * pow(2, 59 - i, m)
ans = (ans + s * (n - s) * (1 << i)) % m
return str(ans)
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
|
[
"call.add",
"call.arguments.change"
] | 644,078
| 644,079
|
u046187684
|
python
|
p02838
|
def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m = 10**9 + 7
ans = 0
for s in map(str.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
|
def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m = 10**9 + 7
ans = 0
for s in map(lambda x: x.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
|
[
"call.arguments.change"
] | 644,080
| 644,081
|
u046187684
|
python
|
p02838
|
import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod)
|
import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod)
|
[
"call.arguments.add"
] | 644,088
| 644,089
|
u841621946
|
python
|
p02838
|
import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.sum(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod)
|
import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod)
|
[
"assignment.value.change",
"identifier.change"
] | 644,090
| 644,089
|
u841621946
|
python
|
p02838
|
a=int(input())
n=list(map(int,input().split()))
mod=10**9+7
import numpy as np
a=np.array(a)
md = len(bin(max(a)))
ans = 0
for d in range(md):
cnt1 = np.count_nonzero((a>>d)&1)
ans += cnt1 * (n-cnt1) * (1<<d)
ans %= mod
print(ans%mod)
|
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
import numpy as np
a=np.array(a)
md = len(bin(max(a)))
ans = 0
for d in range(md):
cnt1 = np.count_nonzero((a>>d)&1)
ans += cnt1 * (n-cnt1) * (1<<d)
ans %= mod
print(ans%mod)
|
[
"assignment.variable.change",
"identifier.change"
] | 644,168
| 644,169
|
u332253305
|
python
|
p02838
|
MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
ans = 0
m = 1
for _ in range(60):
bits = sum((a & m for a in A))
print(bits)
bits //= m
ans += (bits * (N - bits) * m)
ans %= MOD
m <<= 1
print(ans % MOD)
|
MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
ans = 0
m = 1
for i in range(60):
bits = sum((a & m for a in A))
bits //= m
ans += (bits * (N - bits) * m)
ans %= MOD
m <<= 1
print(ans % MOD)
|
[
"identifier.change",
"call.remove"
] | 644,247
| 644,248
|
u910756197
|
python
|
p02838
|
N = 60
MOD = 10**9 + 7
n = int(input())
c0 = [0 for _ in range(N)]
c1 = [0 for _ in range(N)]
a = list(map(int,input().split()))
for i in range(n):
for j in range(N):
if a[i] & (1 << j) == 0:
c0[j] += 1
else:
c1[j] += 1
ans = 0
for i in range(n-1):
for j in range(N):
if a[i] & (1 << j) == 0:
c0[j] -=1
else:
c1[j] -=1
for j in range(N):
if a[i] & (1 << j) == 0:
ans += (1<<j) * c0[j]
else:
ans += (1<<j) * c1[j]
print(ans % MOD)
|
N = 60
MOD = 10**9 + 7
n = int(input())
c0 = [0 for _ in range(N)]
c1 = [0 for _ in range(N)]
a = list(map(int,input().split()))
for i in range(n):
for j in range(N):
if a[i] & (1 << j) == 0:
c0[j] += 1
else:
c1[j] += 1
ans = 0
for i in range(n-1):
for j in range(N):
if a[i] & (1 << j) == 0:
c0[j] -=1
else:
c1[j] -=1
for j in range(N):
if a[i] & (1 << j) == 0:
ans += (1<<j) * c1[j]
else:
ans += (1<<j) * c0[j]
print(ans % MOD)
|
[
"identifier.change",
"expression.operation.binary.change"
] | 644,317
| 644,318
|
u330661451
|
python
|
p02838
|
import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 10**12:
break
start_point = bisect.bisect_right(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for i in range(len(abin)):
if abin[i] == '1':
keta_list[len(abin)-1-i] += 1
count = 0
for idx,keta_count in enumerate(keta_list):
count += (N-keta_count) * bit_list[idx] * keta_count
count = count % (1000000000+7)
print(count)
|
import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 2**60:
break
start_point = bisect.bisect_right(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for i in range(len(abin)):
if abin[i] == '1':
keta_list[len(abin)-1-i] += 1
count = 0
for idx,keta_count in enumerate(keta_list):
count += (N-keta_count) * bit_list[idx] * keta_count
count = count % (1000000000+7)
print(count)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 644,387
| 644,388
|
u415154163
|
python
|
p02838
|
import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 10**12:
break
start_point = bisect.bisect_left(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for i in range(len(abin)):
if abin[i] == '1':
keta_list[len(abin)-1-i] += 1
count = 0
for idx,keta_count in enumerate(keta_list):
count += (N-keta_count) * bit_list[idx] * keta_count % (1000000000+7)
print(count)
|
import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 2**60:
break
start_point = bisect.bisect_right(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for i in range(len(abin)):
if abin[i] == '1':
keta_list[len(abin)-1-i] += 1
count = 0
for idx,keta_count in enumerate(keta_list):
count += (N-keta_count) * bit_list[idx] * keta_count
count = count % (1000000000+7)
print(count)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 644,389
| 644,388
|
u415154163
|
python
|
p02838
|
import numpy as np
MAX_DIGIT = 60
MOD = 1e9 + 7
N = int(input())
A = np.array([int(a) for a in input().split()])
answer = 0
for d in range(MAX_DIGIT + 1):
A, r = (A>>1), A % 2
s = int(r.sum())
base = (1<<d) % MOD #this may be key
answer += (base * s * (N - s)) % MOD
answer %= MOD
print(answer)
|
import numpy as np
MAX_DIGIT = 60
MOD = 10**9 + 7
N = int(input())
A = np.array([int(a) for a in input().split()])
answer = 0
for d in range(MAX_DIGIT + 1):
A, r = (A>>1), A % 2
s = int(r.sum())
base = (1<<d) % MOD #this may be key
answer += (base * s * (N - s)) % MOD
answer %= MOD
print(answer)
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 644,399
| 644,400
|
u065621181
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.array(input().split(), dtype=np.int64)
X = (1 << np.arange(60, dtype=np.int64)) & A.reshape(-1,1)
B = np.sum(X != 0, axis=0)
total = 0
for i,count in enumerate(B):
total += count * (N - count) * (1 << i)
print(total % (10**9 + 7))
|
import numpy as np
N = int(input())
A = np.array(input().split(), dtype=np.int64)
X = (1 << np.arange(60, dtype=np.int64)) & A.reshape(-1,1)
B = np.sum(X != 0, axis=0)
total = 0
for i,count in enumerate(B):
total += int(count) * int(N - count) * int(1 << i)
print(total % (10**9 + 7))
|
[
"call.add",
"call.arguments.change",
"type_conversion.to_integer.change",
"type_conversion.to_number.change"
] | 644,443
| 644,444
|
u663093503
|
python
|
p02838
|
N = int(input())
A = list(map(int, input().split()))
def sumXOR( arr, n):
sum = 0
for i in range(0, 64):
# Count of zeros and ones
zc = 0
oc = 0
# Individual sum at each bit position
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = (zc + 1)
else:
oc = (oc + 1)
arr[j] = int(arr[j] / 2)
# calculating individual bit sum
idsum = (oc * zc * ((1 << i))) % 1000000007
# final sum
sum = (sum + idsum)
return sum
print(sumXOR(A, N) % 1000000007)
|
N = int(input())
A = list(map(int, input().split()))
def sumXOR( arr, n):
sum = 0
for i in range(0, 64):
# Count of zeros and ones
zc = 0
oc = 0
# Individual sum at each bit position
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = (zc + 1)
else:
oc = (oc + 1)
arr[j] = (arr[j] >> 1)
# calculating individual bit sum
idsum = (oc * zc * ((1 << i))) % 1000000007
# final sum
sum = (sum + idsum)
return sum
print(sumXOR(A, N) % 1000000007)
|
[] | 644,451
| 644,452
|
u861095163
|
python
|
p02838
|
def sumXOR( arr, n):
MOD = 10 ** 9 + 7
sum = 0
for i in range(0, 61):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
else:
oc = oc + 1
arr[j] = int(arr[j] / 2)
idsum = oc * zc * (1 << i)
sum = (sum + idsum) % MOD;
return sum
n = int(input())
A = list(map(int, input().split()))
sum = 0
sum = sumXOR(A, n);
print(sum)
|
def sumXOR(arr, n):
MOD = 10 ** 9 + 7
sum = 0
for i in range(0, 61):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
else:
oc = oc + 1
arr[j] = arr[j] // 2
idsum = oc * zc * (1 << i)
sum = (sum + idsum) % MOD;
return sum
n = int(input())
A = list(map(int, input().split()))
sum = 0
sum = sumXOR(A, n);
print(sum)
|
[
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 644,453
| 644,454
|
u802963389
|
python
|
p02838
|
def fastio():
import sys
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
n, = I()
a = I()
ans = 0
for bit in range(64):
c = [0, 0]
for i in a:
c[(i >> bit)&1] += 1
ans += c[0] * c[1] * 2**bit
# print(ans, c[0], c[1], 2**i)
print(ans)
|
def fastio():
import sys
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
n, = I()
a = I()
ans = 0
for bit in range(64):
c = [0, 0]
for i in a:
c[(i >> bit)&1] += 1
ans += c[0] * c[1] * 2**bit
ans %= MOD
# print(ans, c[0], c[1], 2**i)
print(ans)
|
[] | 644,504
| 644,505
|
u075489826
|
python
|
p02838
|
import sys
def input():
return sys.stdin.readline()[:-1]
N = int(input())
A=list(map(int,input().split()))
l=[0]*59
for i in A:
s=str(bin(i))[2:]
for j in range(len(s)):
if s[-j-1]=="1":
l[j]+=1
a=0
for i in range(59):
a=(a+2**i*l[i]*(N-l[i]))%(10**9+7)
print(a)
|
import sys
def input():
return sys.stdin.readline()[:-1]
N = int(input())
A=list(map(int,input().split()))
l=[0]*60
for i in A:
s=str(bin(i))[2:]
for j in range(len(s)):
if s[-j-1]=="1":
l[j]+=1
a=0
for i in range(60):
a=(a+2**i*l[i]*(N-l[i]))%(10**9+7)
print(a)
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 644,600
| 644,601
|
u187516587
|
python
|
p02838
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
MOD = 10**9 + 7
def sumXOR(arr, n):
sumation = 0
for i in range(0, 64):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
else:
oc = oc + 1
arr[j] = int(arr[j] / 2)
idsum = oc * zc * (1 << i)
sumation = sumation + idsum
sumation %= MOD
return sumation
n = int(input())
a = [int(item) for item in input().split()]
print(sumXOR(a, n))
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
MOD = 10**9 + 7
def sumXOR(arr, n):
sumation = 0
for i in range(0, 64):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
else:
oc = oc + 1
arr[j] = arr[j] // 2
idsum = oc * zc * (1 << i)
sumation = sumation + idsum
sumation %= MOD
return sumation
n = int(input())
a = [int(item) for item in input().split()]
print(sumXOR(a, n))
|
[
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 644,650
| 644,651
|
u052499405
|
python
|
p02838
|
n=int(input())
a=[int(i) for i in input().split()]
cnt=[0 for i in range(64)]
mask=1
for i in range(64):
for j in a:
if j|mask==j: #立っている
cnt[i]+=1
mask*=2
x=1
res=0
for i in range(64):
res+=2*cnt[i]*(n-cnt[i])*x
res%=1000000007
x*=2
print(res//2)
|
n=int(input())
a=[int(i) for i in input().split()]
cnt=[0 for i in range(64)]
mask=1
for i in range(64):
for j in a:
if j|mask==j: #立っている
cnt[i]+=1
mask*=2
x=1
res=0
for i in range(64):
res+=cnt[i]*(n-cnt[i])*x
res%=1000000007
x*=2
print(res)
|
[
"expression.operation.binary.remove"
] | 644,652
| 644,653
|
u422104747
|
python
|
p02837
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2-1):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1:
if ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1 and ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
[
"expression.operation.binary.remove"
] | 644,700
| 644,701
|
u606146341
|
python
|
p02837
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1:
if ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1 and ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
[
"expression.operation.binary.remove"
] | 644,702
| 644,701
|
u606146341
|
python
|
p02837
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2 - 1):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1 and ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1 and ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
[
"expression.operation.binary.remove"
] | 644,703
| 644,701
|
u606146341
|
python
|
p02837
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2-1):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1:
if ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1:
if ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
[
"expression.operation.binary.remove"
] | 644,700
| 644,704
|
u606146341
|
python
|
p02837
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1:
if ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1:
if ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
[
"expression.operation.binary.remove"
] | 644,702
| 644,704
|
u606146341
|
python
|
p02837
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2 - 1):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1 and ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
for x in range(n):
if lst[a][x] != -1:
if ((bit >> x) & 1) != lst[a][x]:
flg = False
break
if flg:
ans = max(ans, bin(bit).count('1'))
print(ans)
|
[
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 644,703
| 644,704
|
u606146341
|
python
|
p02837
|
n = int(input())
a = [0]*n
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a[i] = int(input())
for j in range(a[i]):
tmp1,tmp2 = list(map(int,input().split()))
x[i].append(tmp1-1)
y[i].append(tmp2)
ans = 0
honest = [0]*n
cnt=0
for i in range(2**n): #bit全探索
for j in range(n):
if((i>>j)&1):
honest[j] = 1
cnt+=1
else:
honest[j] = 0
f = True
for k in range(n):
if honest[k]!=1:
f = False
break
for l in range(a[k]):
if y[k][l]!=honest[x[k][l]]:
f = False
break
if f:
ans = max(ans,cnt)
cnt=0
print(ans)
|
n = int(input())
a = [0]*n
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a[i] = int(input())
for j in range(a[i]):
tmp1,tmp2 = list(map(int,input().split()))
x[i].append(tmp1-1)
y[i].append(tmp2)
ans = 0
honest = [0]*n
cnt=0
for i in range(2**n): #bit全探索
for j in range(n):
if((i>>j)&1):
honest[j] = 1
cnt+=1
else:
honest[j] = 0
f = True
for k in range(n):
if honest[k]!=1:
continue
for l in range(a[k]):
if y[k][l]!=honest[x[k][l]]:
f = False
break
if f:
ans = max(ans,cnt)
cnt=0
print(ans)
|
[
"control_flow.break.remove"
] | 644,715
| 644,716
|
u184817817
|
python
|
p02837
|
def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
if P[j] == 0:
P[j] = 1
break
else:
P[j] = 0
if sum(P) <= ans:
continue
flag = 0
for p in range(len(P)):
if P[p] == 1:
for s in S[p]:
if s[1]!= P[s[0]]:
flag = 1
if flag == 1:
continue
else:
ans = sum(P)
print(ans)
if name == 'main':
main()
|
def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
if P[j] == 0:
P[j] = 1
break
else:
P[j] = 0
if sum(P) <= ans:
continue
flag = 0
for p in range(len(P)):
if P[p] == 1:
for s in S[p]:
if s[1]!= P[s[0]]:
flag = 1
if flag == 1:
continue
else:
ans = sum(P)
print(ans)
if __name__ == '__main__':
main()
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 644,717
| 644,718
|
u098335893
|
python
|
p02837
|
def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
if P[j] == 0:
P[j] = 1
break
else:
P[j] = 0
if sum(P) <= ans:
continue
flag = 0
for p in range(len(P)):
if P[p] == 1:
for s in S[p]:
if s[1]!= P[s[0]]:
flag = 1
if flag == 1:
continue
else:
ans = sum(P)
print(ans)
if name == 'main':
main()
|
def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
if P[j] == 0:
P[j] = 1
break
else:
P[j] = 0
if sum(P) <= ans:
continue
flag = 0
for p in range(len(P)):
if P[p] == 1:
for s in S[p]:
if s[1]!= P[s[0]]:
flag = 1
if flag == 1:
continue
else:
ans = sum(P)
print(ans)
if __name__ == '__main__':
main()
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 644,719
| 644,718
|
u098335893
|
python
|
p02837
|
import collections
import itertools
n = int(input())
per_dict = collections.defaultdict(list)
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
per_dict[i + 1].append([x,y])
for i in range(n, -1, -1):
flag = True
for honests in itertools.combinations(range(1, n + 1), i):
for h in honests:
for x, y in per_dict[h]:
if y == 1 and x not in honests:
flag = False
if y == 0 and x in honests:
flag = False
if flag == True:
break
if flag == True:
break
print(i)
|
import collections
import itertools
n = int(input())
per_dict = collections.defaultdict(list)
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
per_dict[i + 1].append([x,y])
for i in range(n, -1, -1):
flag = True
for honests in itertools.combinations(range(1, n + 1), i):
flag = True
for h in honests:
for x, y in per_dict[h]:
if y == 1 and x not in honests:
flag = False
if y == 0 and x in honests:
flag = False
if flag == True:
break
if flag == True:
break
print(i)
|
[
"assignment.add"
] | 644,722
| 644,723
|
u558494840
|
python
|
p02837
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def countSetBits(n):
count = 0
while (n):
count += n & 1
n >>= 1
return count
def main():
N = I()
mat = [[-1 for __ in range(N)] for _ in range(N)]
for i, _ in enumerate(range(N)):
A = I()
for __ in range(A):
targ, b = LI()
mat[i][targ - 1] = b
ans = 0
for bit in range(1 << N):
err = False
for j in range(N):
honest_man = (bit & (1<<j))
if honest_man:
for k in range(N):
r = mat[j][k]
if r == -1:
continue
if (bit >> k) & 1 == r:
err = True
if not err:
ans = max(ans, countSetBits(bit))
print(ans)
'''
for bit in range(1 << N):
truth = [-1 for _ in range(N)]
err = False
for i in range(N):
honest_man = (bit & (1<<(N-1-i)))
if honest_man:
for j in range(len(mat[i])):
con = mat[i][j]
targ_ix = j
if con != -1:
if truth[targ_ix] != con:
if truth[targ_ix] != -1:
err = True
if (bit & (1<<(N-1-targ_ix))) != con:
print('i: {0:{fill}3b}'.format(i, fill='0'))
print('bit: {0:{fill}3b}'.format(bit, fill='0'))
print("1<<(N-1-targ_ix): {0:{fill}3b}".format(bit & (1<<(N-1-targ_ix)), fill='0'))
print("con: ", con)
err = True
truth[targ_ix] = con
if not err:
ans = max(ans, countSetBits(bit))
'''
main()
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def countSetBits(n):
count = 0
while (n):
count += n & 1
n >>= 1
return count
def main():
N = I()
mat = [[-1 for __ in range(N)] for _ in range(N)]
for i, _ in enumerate(range(N)):
A = I()
for __ in range(A):
targ, b = LI()
mat[i][targ - 1] = b
ans = 0
for bit in range(1 << N):
err = False
for j in range(N):
honest_man = (bit & (1<<j))
if honest_man:
for k in range(N):
r = mat[j][k]
if r == -1:
continue
if (bit >> k) & 1 != r:
err = True
if not err:
ans = max(ans, countSetBits(bit))
print(ans)
'''
for bit in range(1 << N):
truth = [-1 for _ in range(N)]
err = False
for i in range(N):
honest_man = (bit & (1<<(N-1-i)))
if honest_man:
for j in range(len(mat[i])):
con = mat[i][j]
targ_ix = j
if con != -1:
if truth[targ_ix] != con:
if truth[targ_ix] != -1:
err = True
if (bit & (1<<(N-1-targ_ix))) != con:
print('i: {0:{fill}3b}'.format(i, fill='0'))
print('bit: {0:{fill}3b}'.format(bit, fill='0'))
print("1<<(N-1-targ_ix): {0:{fill}3b}".format(bit & (1<<(N-1-targ_ix)), fill='0'))
print("con: ", con)
err = True
truth[targ_ix] = con
if not err:
ans = max(ans, countSetBits(bit))
'''
main()
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 644,728
| 644,729
|
u531436689
|
python
|
p02837
|
N = int(input())
table = [[-1]*(N) for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
table[i][x] = y
# print(table)
# table[i][x] 人iが人xを正直者;1,真偽不明:0,未言及:-1
ans = 0
for i in range(2**N):
hito = [0]*N
for j in range(N):
if i >> j & 1:
hito[j] = 1
flag = True
cnt = 0
for j in range(N):
if i >> j & 1:
cnt += 1
for k in range(N):
if table[j][k] != -1:
if table[j][k] != hito[k]:
flag = False
if flag:
if cnt > ans:
ans = cnt
print(ans)
#print(3 >> 0) # 3????
|
N = int(input())
table = [[-1]*(N) for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
table[i][x-1] = y
# print(table)
# table[i][x] 人iが人xを正直者;1,真偽不明:0,未言及:-1
ans = 0
for i in range(2**N):
hito = [0]*N
for j in range(N):
if i >> j & 1:
hito[j] = 1
flag = True
cnt = 0
for j in range(N):
if i >> j & 1:
cnt += 1
for k in range(N):
if table[j][k] != -1:
if table[j][k] != hito[k]:
flag = False
if flag:
if cnt > ans:
ans = cnt
print(ans)
#print(3 >> 0) # 3????
|
[
"assignment.change"
] | 644,736
| 644,737
|
u503228842
|
python
|
p02837
|
N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
return res
ans = 0
patterns = power2(N)
for p in patterns:
flag = True
for i, remark in enumerate(remarks):
if p[i] == 0: #不親切者の発言を無視
continue
for w in remark:
if p[w[0]-1] != w[1]: #発言の矛盾を判定:
flag = False
break
# print(w)
if flag: #すべての発言で矛盾がなかった場合
ans = max(ans, p.count(1))
break
print(ans)
|
N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
return res
ans = 0
patterns = power2(N)
for p in patterns:
flag = True
for i, remark in enumerate(remarks):
if p[i] == 0: #不親切者の発言を無視
pass
else:
for w in remark:
if p[w[0]-1] != w[1]: #発言の矛盾を判定:
flag = False
break
# print(w)
if flag: #すべての発言で矛盾がなかった場合
ans = max(ans, p.count(1))
print(ans)
|
[
"control_flow.continue.remove",
"control_flow.pass.add",
"control_flow.break.remove"
] | 644,742
| 644,743
|
u724428568
|
python
|
p02837
|
N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
return res
ans = 0
patterns = power2(N)
for p in patterns:
flag = True
for i, remark in enumerate(remarks):
if p[i] == 0: #不親切者の発言を無視
continue
for w in remark:
if p[w[0]-1] != w[1]: #発言の矛盾を判定:
flag = False
break
# print(w)
if flag: #すべての発言で矛盾がなかった場合
ans = max(ans, p.count(1))
break
print(ans)
|
N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
return res
ans = 0
patterns = power2(N)
for p in patterns:
flag = True
for i, remark in enumerate(remarks):
if p[i] == 0: #不親切者の発言を無視
continue
else:
for w in remark:
if p[w[0]-1] != w[1]: #発言の矛盾を判定:
flag = False
break
# print(w)
if flag: #すべての発言で矛盾がなかった場合
ans = max(ans, p.count(1))
print(ans)
|
[
"control_flow.break.remove"
] | 644,742
| 644,745
|
u724428568
|
python
|
p02837
|
def bin_(n):
return str(bin(n))[2: ]
N = int(input())
syougen = [[] for i in range(N)]
for i in range(N):
a = int(input())
for j in range(a):
x,y = input().split()
x,y = int(x)-1,int(y)
syougen[i].append((x,y))
start = 2**N-1
max_ = 0
for i in range(2**N):
num = i
uso = 0
keta=bin(num)[2:]
while(len(keta)<N):
keta = "0"+keta
print(keta)
for j in range(N):
if(keta[j]=="1"):
for p in range(len(syougen[j])):
x,y = syougen[j][p]
if(keta[x] != str(y)):
uso = 1
break
suuji = str(bin(num))[2:]
count = 0
for i in range(len(suuji)):
if(suuji[i]=="1"):
count += 1
if(uso==0):
max_ = max(max_,count)
print(max_)
|
def bin_(n):
return str(bin(n))[2: ]
N = int(input())
syougen = [[] for i in range(N)]
for i in range(N):
a = int(input())
for j in range(a):
x,y = input().split()
x,y = int(x)-1,int(y)
syougen[i].append((x,y))
start = 2**N-1
max_ = 0
for i in range(2**N):
num = i
uso = 0
keta=bin(num)[2:]
while(len(keta)<N):
keta = "0"+keta
for j in range(N):
if(keta[j]=="1"):
for p in range(len(syougen[j])):
x,y = syougen[j][p]
if(keta[x] != str(y)):
uso = 1
break
suuji = str(bin(num))[2:]
count = 0
for i in range(len(suuji)):
if(suuji[i]=="1"):
count += 1
if(uso==0):
max_ = max(max_,count)
print(max_)
|
[
"call.remove"
] | 644,746
| 644,747
|
u720384347
|
python
|
p02837
|
N = int(input())
testinomy = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(input())
testinomy[i][i] = 1
for j in range(A):
x, y = map(int, input().split())
testinomy[i][x - 1] = y
ans = 0
for honests in range(N ** 2 - 1):
bit = '{:015b}'.format(honests)[::-1]
ok_flag = True
for i in range(N):
if bit[i] == '1':
for j, k in enumerate(testinomy[i]):
str_k = str(k)
if bit[j] == '1' and str_k != '0':
pass
elif bit[j] == '0' and str_k != '1':
pass
else:
ok_flag = False
break
# if str_k != '-1':
# if str_k == '1' and bit[j] == '1':
# pass
# elif str_k == '0' and bit[j] == '0':
# pass
# else:
# ok_flag = False
# break
if ok_flag == False:
break
if ok_flag:
ans = max(ans, sum(map(int, bit)))
print(ans)
|
N = int(input())
testinomy = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(input())
testinomy[i][i] = 1
for j in range(A):
x, y = map(int, input().split())
testinomy[i][x - 1] = y
ans = 0
for honests in range(2 ** N):
bit = '{:015b}'.format(honests)[::-1]
ok_flag = True
for i in range(N):
if bit[i] == '1':
for j, k in enumerate(testinomy[i]):
str_k = str(k)
if bit[j] == '1' and str_k != '0':
pass
elif bit[j] == '0' and str_k != '1':
pass
else:
ok_flag = False
break
# if str_k != '-1':
# if str_k == '1' and bit[j] == '1':
# pass
# elif str_k == '0' and bit[j] == '0':
# pass
# else:
# ok_flag = False
# break
if ok_flag == False:
break
if ok_flag:
ans = max(ans, sum(map(int, bit)))
print(ans)
|
[
"expression.operation.binary.remove"
] | 644,748
| 644,749
|
u168333670
|
python
|
p02837
|
n = int(input())
Adj = [[-1]*n for _ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
xij,yij = map(int, input().split( ))
xij -= 1
Adj[i][xij] = yij###==ってなんぞ
#print(Adj)
ans = 0
bt = 1<<n
for b in range(bt):#全探索
flag = True
tmp = 0
for i in range(n):
for j in range(n):
if Adj[i][j]>=0:
if ((b>>i) &1) and ((Adj[i][j]==0) ^ ((b>>j) &1)):#正直者の答えが矛盾,醜いがあとでビット演算子確認
flag = False
break
if not flag:
break
if flag:
for t in range(n):
tmp += (b>>t)&1
#print("test",b,tmp,flag)
ans = max(tmp, ans)
#print(b,ans)
print(ans)
|
n = int(input())
Adj = [[-1]*n for _ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
xij,yij = map(int, input().split( ))
xij -= 1
Adj[i][xij] = yij###==ってなんぞ
#print(Adj)
ans = 0
bt = 1<<n
for b in range(bt):#全探索
flag = True
tmp = 0
for i in range(n):
for j in range(n):
if Adj[i][j]>=0:
if ((b>>i) &1) and not ((Adj[i][j]==0) ^ ((b>>j) &1)):#正直者の答えが矛盾,醜いがあとでビット演算子確認
flag = False
break
if not flag:
break
if flag:
for t in range(n):
tmp += (b>>t)&1
#print("test",b,tmp,flag)
ans = max(tmp, ans)
#print(b,ans)
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 644,757
| 644,758
|
u520276780
|
python
|
p02837
|
# C問題
from itertools import combinations
import numpy as np
N = int(input())
A = []
x = []
y = []
for i in range(N):
# 人iの証言を格納する
Ai = int(input())
A.append(Ai)
x.append([])
y.append([])
for j in range(Ai):
xyij = input().split(" ")
x[i].append(int(xyij[0]) - 1)
y[i].append(int(xyij[1]))
def judge_contradiction(honest_index, N, A, x, y):
# 大丈夫ならTrue、矛盾ならFalse
all_people_judge = np.zeros(N, dtype="int")
all_people_judge[:] = -1
for i in honest_index:
all_people_judge[i] = 1
for ind in honest_index:
# 人indは正直者。
# この人の証言をもとに、all_people_judgeを完成させる
for i in range(A[ind]):
# 証言： 人x[ind][i]は、y[ind][i]である
target, testimony = x[ind][i], y[ind][i]
if all_people_judge[target] == -1:
all_people_judge[target] = testimony
continue
elif all_people_judge[target] == testimony:
continue
else:
# 矛盾が発生！
return False
# all_people_judgeで正直者と判定された人が、honest_indexでもそうなっているか判定
for i in range(N):
if all_people_judge[i] == 1:
if np.any(np.array(honest_index) == i):
continue
else:
return False
return True
def doit(N, A, x, y):
for numHonest in range(N, 0-1, -1):
# numHonest 人が正直者であるとき
for honest_index in combinations(np.arange(N), numHonest):
# N人の正直者は、honest_indexに記載されたN人である
# それで矛盾が生じないか、確かめる
# import pdb; pdb.set_trace()
if judge_contradiction(honest_index, N, A, x, y) == True:
return numHonest
else:
continue
return "hey"
doit(N, A, x, y)
|
# C問題
from itertools import combinations
import numpy as np
N = int(input())
A = []
x = []
y = []
for i in range(N):
# 人iの証言を格納する
Ai = int(input())
A.append(Ai)
x.append([])
y.append([])
for j in range(Ai):
xyij = input().split(" ")
x[i].append(int(xyij[0]) - 1)
y[i].append(int(xyij[1]))
def judge_contradiction(honest_index, N, A, x, y):
# 大丈夫ならTrue、矛盾ならFalse
all_people_judge = np.zeros(N, dtype="int")
all_people_judge[:] = -1
for i in honest_index:
all_people_judge[i] = 1
for ind in honest_index:
# 人indは正直者。
# この人の証言をもとに、all_people_judgeを完成させる
for i in range(A[ind]):
# 証言： 人x[ind][i]は、y[ind][i]である
target, testimony = x[ind][i], y[ind][i]
if all_people_judge[target] == -1:
all_people_judge[target] = testimony
continue
elif all_people_judge[target] == testimony:
continue
else:
# 矛盾が発生！
return False
# all_people_judgeで正直者と判定された人が、honest_indexでもそうなっているか判定
for i in range(N):
if all_people_judge[i] == 1:
if np.any(np.array(honest_index) == i):
continue
else:
return False
return True
def doit(N, A, x, y):
for numHonest in range(N, 0-1, -1):
# numHonest 人が正直者であるとき
for honest_index in combinations(np.arange(N), numHonest):
# N人の正直者は、honest_indexに記載されたN人である
# それで矛盾が生じないか、確かめる
# import pdb; pdb.set_trace()
if judge_contradiction(honest_index, N, A, x, y) == True:
return numHonest
else:
continue
return "hey"
print(doit(N, A, x, y))
|
[
"call.add",
"call.arguments.change"
] | 644,765
| 644,766
|
u283341082
|
python
|
p02837
|
import sys
input = sys.stdin.readline
_n = int(input())
said = []
for i in range(_n):
ai = int(input())
said.append([list(map(int, input().split())) for _ in range(ai)])
ans = 0
for i in range(2 ** _n):
ynflg = 1
flg = format(i, 'b').zfill(_n)
for sy, tag in zip(said, flg):
if tag == 0:
continue
for s in sy:
if flg[s[0] - 1] != str(s[1]):
ynflg = 0
break
if ynflg == 0:
break
if ynflg == 1:
ans = max(ans, flg.count('1'))
print(ans)
|
import sys
input = sys.stdin.readline
_n = int(input())
said = []
for i in range(_n):
ai = int(input())
said.append([list(map(int, input().split())) for _ in range(ai)])
ans = 0
for i in range(2 ** _n):
ynflg = 1
flg = format(i, 'b').zfill(_n)
for sy, tag in zip(said, flg):
if tag == '0':
continue
for s in sy:
if flg[s[0] - 1] != str(s[1]):
ynflg = 0
break
if ynflg == 0:
break
if ynflg == 1:
ans = max(ans, flg.count('1'))
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 644,770
| 644,771
|
u056083426
|
python
|
p02839
|
import time
t1 = time.time()
h,w = map(int,input().split())
grid = []
for i in range(h):
grid.append(list(map(int,input().split())))
for i in range(h):
lsti = list(map(int,input().split()))
for j in range(w):
grid[i][j] = abs(grid[i][j]-lst[j])
lst = [[set() for _ in range(w)] for _ in range(h)]
lst[0][0].add(grid[0][0])
for j in range(1,w):
for x in lst[0][j-1]:
lst[0][j].add(abs(grid[0][j]-x))
if (grid[0][j] + x) <= 6400:
lst[0][j].add(grid[0][j]+x)
for i in range(1,h):
for x in lst[i-1][0]:
lst[i][0].add(abs(grid[i][0]-x))
if grid[i][0] + x <= 6400:
lst[i][0].add(grid[i][0]+x)
for i in range(1,h):
for j in range(1,w):
for x in lst[i][j-1]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
for x in lst[i-1][j]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
t = time.time()
if t - t1 > 1.8:
print(0)
exit()
print(min(lst[h-1][w-1]))
|
import time
t1 = time.time()
h,w = map(int,input().split())
grid = []
for i in range(h):
grid.append(list(map(int,input().split())))
for i in range(h):
lst = list(map(int,input().split()))
for j in range(w):
grid[i][j] = abs(grid[i][j]-lst[j])
lst = [[set() for _ in range(w)] for _ in range(h)]
lst[0][0].add(grid[0][0])
for j in range(1,w):
for x in lst[0][j-1]:
lst[0][j].add(abs(grid[0][j]-x))
if (grid[0][j] + x) <= 6400:
lst[0][j].add(grid[0][j]+x)
for i in range(1,h):
for x in lst[i-1][0]:
lst[i][0].add(abs(grid[i][0]-x))
if grid[i][0] + x <= 6400:
lst[i][0].add(grid[i][0]+x)
for i in range(1,h):
for j in range(1,w):
for x in lst[i][j-1]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
for x in lst[i-1][j]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
t = time.time()
if t - t1 > 1.8:
print(0)
exit()
print(min(lst[h-1][w-1]))
|
[
"assignment.variable.change",
"identifier.change"
] | 644,875
| 644,876
|
u201928947
|
python
|
p02839
|
import sys
#input = sys.stdin.readline
def main():
inp = lambda: list(map(int, input().split()))
h,w=inp()
a=[inp() for _ in range(h)]
b=[inp() for _ in range(h)]
d=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
d[i][j]=abs(a[i][j]-b[i][j])
zero=80*(h+w)+2
dp=[[0]*w for _ in range(h)]
dp[0][0]=1<<(zero+d[0][0])|1<<(zero-d[0][0])
for i in range(h):
for j in range(w):
if i==0:
if j==0:
continue
else:
dp[i][j]=dp[i][j-1]<<d[i][j]|dp[i][j-1]>>d[i][j]
else:
if j==0:
dp[i][j]=dp[i-1][j]<<d[i][j]|dp[i-1][j]>>d[i][j]
else:
dp[i][j]=dp[i-1][j]<<d[i][j]|dp[i-1][j]>>d[i][j]
dp[i][j]=dp[i][j]|(dp[i][j-1]<<d[i][j]|dp[i][j-1]>>d[i][j])
ans=dp[-1][-1]
print(dp)
for i in range(zero):
if ans>>(zero+i)&1 or ans>>(zero-i)&1:
print(i)
exit()
if __name__ == '__main__':
main()
|
import sys
#input = sys.stdin.readline
def main():
inp = lambda: list(map(int, input().split()))
h,w=inp()
a=[inp() for _ in range(h)]
b=[inp() for _ in range(h)]
d=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
d[i][j]=abs(a[i][j]-b[i][j])
zero=80*(h+w)+2
dp=[[0]*w for _ in range(h)]
dp[0][0]=1<<(zero+d[0][0])|1<<(zero-d[0][0])
for i in range(h):
for j in range(w):
if i==0:
if j==0:
continue
else:
dp[i][j]=dp[i][j-1]<<d[i][j]|dp[i][j-1]>>d[i][j]
else:
if j==0:
dp[i][j]=dp[i-1][j]<<d[i][j]|dp[i-1][j]>>d[i][j]
else:
dp[i][j]=dp[i-1][j]<<d[i][j]|dp[i-1][j]>>d[i][j]
dp[i][j]=dp[i][j]|(dp[i][j-1]<<d[i][j]|dp[i][j-1]>>d[i][j])
ans=dp[-1][-1]
for i in range(zero):
if ans>>(zero+i)&1 or ans>>(zero-i)&1:
print(i)
exit()
if __name__ == '__main__':
main()
|
[
"call.remove"
] | 644,877
| 644,878
|
u919730120
|
python
|
p02839
|
H,W = map(int,input().split())
A = np.zeros((H,W))
for c in [1,-1]:
for i in range(H):
num = list(map(int,input().split()))
A[i,:] += np.array(num) * c
M = 160*80
dp = [[0]*W for _ in range(H)]
dp[0][0] = 1 << M
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= dp[i-1][j]
if j > 0:
dp[i][j] |= dp[i][j-1]
a = abs(A[i,j])
dp[i][j] = (dp[i][j] << int(a)) | (dp[i][j] >> int(a))
i = M
while True:
if (dp[H-1][W-1] >> i) & 1:
print(i-M)
break
i += 1
|
import numpy as np
H,W = map(int,input().split())
A = np.zeros((H,W))
for c in [1,-1]:
for i in range(H):
num = list(map(int,input().split()))
A[i,:] += np.array(num) * c
M = 160*80
dp = [[0]*W for _ in range(H)]
dp[0][0] = 1 << M
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= dp[i-1][j]
if j > 0:
dp[i][j] |= dp[i][j-1]
a = abs(A[i,j])
dp[i][j] = (dp[i][j] << int(a)) | (dp[i][j] >> int(a))
i = M
while True:
if (dp[H-1][W-1] >> i) & 1:
print(i-M)
break
i += 1
|
[] | 644,997
| 644,998
|
u700278227
|
python
|
p02839
|
import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 165
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = True
for i in range(H):
for j in range(W):
if i+1 < H:
d = ds[i+1][j]
dp[i+1][j][d:] = np.logical_or(dp[i][j][:size-d], dp[i+1][j][d:])
dp[i+1][j][:size-d] = np.logical_or(dp[i][j][d:], dp[i+1][j][:size-d])
dp[i+1][j][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i+1][j][:d+1])
if j+1 < W:
d = ds[i][j+1]
dp[i][j+1][d:] = np.logical_or(dp[i][j][:size-d], dp[i][j+1][d:])
dp[i][j+1][:size-d] = np.logical_or(dp[i][j][d:], dp[i][j+1][:size-d])
dp[i][j+1][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i][j+1][:d+1])
print(np.min(np.where(dp[-1][-1])))
|
import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 100005
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = True
for i in range(H):
for j in range(W):
if i+1 < H:
d = ds[i+1][j]
dp[i+1][j][d:] = np.logical_or(dp[i][j][:size-d], dp[i+1][j][d:])
dp[i+1][j][:size-d] = np.logical_or(dp[i][j][d:], dp[i+1][j][:size-d])
dp[i+1][j][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i+1][j][:d+1])
if j+1 < W:
d = ds[i][j+1]
dp[i][j+1][d:] = np.logical_or(dp[i][j][:size-d], dp[i][j+1][d:])
dp[i][j+1][:size-d] = np.logical_or(dp[i][j][d:], dp[i][j+1][:size-d])
dp[i][j+1][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i][j+1][:d+1])
print(np.min(np.where(dp[-1][-1])))
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,139
| 645,137
|
u034128150
|
python
|
p02839
|
import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 165
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = True
for i in range(H):
for j in range(W):
if i+1 < H:
d = ds[i+1][j]
dp[i+1][j][d:] = np.logical_or(dp[i][j][:size-d], dp[i+1][j][d:])
dp[i+1][j][:size-d] = np.logical_or(dp[i][j][d:], dp[i+1][j][:size-d])
dp[i+1][j][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i+1][j][:d+1])
if j+1 < W:
d = ds[i][j+1]
dp[i][j+1][d:] = np.logical_or(dp[i][j][:size-d], dp[i][j+1][d:])
dp[i][j+1][:size-d] = np.logical_or(dp[i][j][d:], dp[i][j+1][:size-d])
dp[i][j+1][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i][j+1][:d+1])
print(np.min(np.where(dp[-1][-1])))
|
import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 10005
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = True
for i in range(H):
for j in range(W):
if i+1 < H:
d = ds[i+1][j]
dp[i+1][j][d:] = np.logical_or(dp[i][j][:size-d], dp[i+1][j][d:])
dp[i+1][j][:size-d] = np.logical_or(dp[i][j][d:], dp[i+1][j][:size-d])
dp[i+1][j][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i+1][j][:d+1])
if j+1 < W:
d = ds[i][j+1]
dp[i][j+1][d:] = np.logical_or(dp[i][j][:size-d], dp[i][j+1][d:])
dp[i][j+1][:size-d] = np.logical_or(dp[i][j][d:], dp[i][j+1][:size-d])
dp[i][j+1][:d+1] = np.logical_or(dp[i][j][d::-1], dp[i][j+1][:d+1])
print(np.min(np.where(dp[-1][-1])))
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,139
| 645,140
|
u034128150
|
python
|
p02839
|
R, C = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(R)]
B = [list(map(int, input().split())) for _ in range(R)]
dp = [0] * R
dp[0] = s = 1 << 6400
for row_a, row_b in zip(A, B):
for i, (a, b) in enumerate(zip(row_a, row_b)):
d = abs(a - b)
if i > 0:
dp[i] |= dp[i - 1]
dp[i] = (dp[i] << d) | (dp[i] >> d)
g = dp[-1]
for i in range(6401):
if g & (s << i) or g & (s >> i):
print(i)
quit()
|
R, C = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(R)]
B = [list(map(int, input().split())) for _ in range(R)]
dp = [0] * C
dp[0] = s = 1 << 6400
for row_a, row_b in zip(A, B):
for i, (a, b) in enumerate(zip(row_a, row_b)):
d = abs(a - b)
if i > 0:
dp[i] |= dp[i - 1]
dp[i] = (dp[i] << d) | (dp[i] >> d)
g = dp[-1]
for i in range(6401):
if g & (s << i) or g & (s >> i):
print(i)
quit()
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 645,184
| 645,185
|
u638282348
|
python
|
p02839
|
import numpy as np
h,w=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(h)]
b=[list(map(int,input().split())) for _ in range(h)]
d=[]
for i in range(h):
d.append([abs(a[i][j]-b[i][j]) for j in range(w)])
dp=np.zeros((h,w,200))
# dp[r][c][j]:(r,c)まで考えたときjにできるかbool値
dp[0,0,d[0][0]+100]=1
for i in range(w-1):
if d[0][i+1]==0:
dp[0,i+1]+=dp[0,i]
continue
dp[0,i+1,d[0][i+1]:]+=dp[0,i,:-d[0][i+1]]
dp[0,i+1,:-d[0][i+1]]+=dp[0,i,d[0][i+1]:]
for i in range(h-1):
if d[i+1][0]==0:
dp[i+1,0]+=dp[i,0]
continue
dp[i+1,0,d[i+1][0]:]+=dp[i,0,:-d[i+1][0]]
dp[i+1,0,:-d[i+1][0]]+=dp[i,0,d[i+1][0]:]
for r in range(1,h):
for c in range(1,w):
if d[r][c]==0:
dp[r,c]+=dp[r-1,c]
dp[r,c]+=dp[r,c-1]
continue
dp[r,c,d[r][c]:]+=dp[r-1,c,:-d[r][c]]
dp[r,c,:-d[r][c]]+=dp[r-1,c,d[r][c]:]
dp[r,c,d[r][c]:]+=dp[r,c-1,:-d[r][c]]
dp[r,c,:-d[r][c]]+=dp[r,c-1,d[r][c]:]
print(min([abs(e-100) for e in np.where(dp[h-1,w-1]>0)[0]]))
|
import numpy as np
h,w=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(h)]
b=[list(map(int,input().split())) for _ in range(h)]
d=[]
for i in range(h):
d.append([abs(a[i][j]-b[i][j]) for j in range(w)])
dp=np.zeros((h,w,12800))
# dp[r][c][j]:(r,c)まで考えたときjにできるか。0：できない。1以上：できる。
dp[0,0,d[0][0]+6400]=1
for i in range(w-1):
if d[0][i+1]==0:
dp[0,i+1]+=dp[0,i]
continue
dp[0,i+1,d[0][i+1]:]+=dp[0,i,:-d[0][i+1]]
dp[0,i+1,:-d[0][i+1]]+=dp[0,i,d[0][i+1]:]
for i in range(h-1):
if d[i+1][0]==0:
dp[i+1,0]+=dp[i,0]
continue
dp[i+1,0,d[i+1][0]:]+=dp[i,0,:-d[i+1][0]]
dp[i+1,0,:-d[i+1][0]]+=dp[i,0,d[i+1][0]:]
for r in range(1,h):
for c in range(1,w):
if d[r][c]==0:
dp[r,c]+=dp[r-1,c]
dp[r,c]+=dp[r,c-1]
continue
dp[r,c,d[r][c]:]+=dp[r-1,c,:-d[r][c]]
dp[r,c,:-d[r][c]]+=dp[r-1,c,d[r][c]:]
dp[r,c,d[r][c]:]+=dp[r,c-1,:-d[r][c]]
dp[r,c,:-d[r][c]]+=dp[r,c-1,d[r][c]:]
print(min([abs(e-6400) for e in np.where(dp[h-1,w-1]>0)[0]]))
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 645,204
| 645,203
|
u707124227
|
python
|
p02839
|
H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
Z = 100
dp = [[0] * (W + 1) for _ in range(H + 1)]
dp[0][0] = (1 << Z)
for h in range(H):
for w in range(W):
d = dp[h][w]
k = abs(A[h][w] - B[h][w])
dp[h + 1][w] |= (d << k) | (d >> k)
dp[h][w + 1] |= (d << k) | (d >> k)
ans = 10**18
for a in (dp[H][W - 1], dp[H - 1][W]):
for d in range(Z * 2 + 10):
if a & (1 << d) != 0:
ans = min(ans, abs(d - Z))
print(ans)
|
H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
Z = 1000
dp = [[0] * (W + 1) for _ in range(H + 1)]
dp[0][0] = (1 << Z)
for h in range(H):
for w in range(W):
d = dp[h][w]
k = abs(A[h][w] - B[h][w])
dp[h + 1][w] |= (d << k) | (d >> k)
dp[h][w + 1] |= (d << k) | (d >> k)
ans = 10**18
for a in (dp[H][W - 1], dp[H - 1][W]):
for d in range(Z * 2 + 10):
if a & (1 << d) != 0:
ans = min(ans, abs(d - Z))
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,217
| 645,218
|
u392319141
|
python
|
p02839
|
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def GI(V,E,ls=None,Directed=False,index=1):
org_inp=[];g=[[] for i in range(V)]
FromStdin=True if ls==None else False
for i in range(E):
if FromStdin:
inp=LI()
org_inp.append(inp)
else:
inp=ls[i]
if len(inp)==2:
a,b=inp;c=1
else:
a,b,c=inp
if index==1:a-=1;b-=1
aa=(a,c);bb=(b,c);g[a].append(bb)
if not Directed:g[b].append(aa)
return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
mp=[boundary]*(w+2);found={}
for i in range(h):
s=input()
for char in search:
if char in s:
found[char]=((i+1)*(w+2)+s.index(char)+1)
mp_def[char]=mp_def[replacement_of_found]
mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
mp+=[boundary]*(w+2)
return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def bit_combination(n,base=2):
rt=[]
for tb in range(base**n):s=[tb//(base**bt)%base for bt in range(n)];rt+=[s]
return rt
def gcd(x,y):
if y==0:return x
if x%y==0:return y
while x%y!=0:x,y=y,x%y
return y
def show(*inp,end='\n'):
if show_flg:print(*inp,end=end)
YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
FourNb=[(1,0),(-1,0),(0,1),(0,-1)];EightNb=[(1,0),(-1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('EWNS',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()
class Tree:
def __init__(self,inp_size=None,ls=None,init=True,index=0):
self.LCA_init_stat=False
self.ETtable=[]
if init:
if ls==None:
self.stdin(inp_size,index=index)
else:
self.size=len(ls)+1
self.edges,_=GI(self.size,self.size-1,ls,index=index)
return
def stdin(self,inp_size=None,index=1):
if inp_size==None:
self.size=int(input())
else:
self.size=inp_size
self.edges,_=GI(self.size,self.size-1,index=index)
return
def listin(self,ls,index=0):
self.size=len(ls)+1
self.edges,_=GI(self.size,self.size-1,ls,index=index)
return
def __str__(self):
return str(self.edges)
def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
q=deque()
q.append(x)
v=[-1]*self.size
v[x]=root_v
while q:
c=q.pop()
for nb,d in self.edges[c]:
if v[nb]==-1:
q.append(nb)
v[nb]=func(v[c],nb,d)
return v
def EulerTour(self,x):
q=deque()
q.append(x)
self.depth=[None]*self.size
self.depth[x]=0
self.ETtable=[]
self.ETdepth=[]
self.ETin=[-1]*self.size
self.ETout=[-1]*self.size
cnt=0
while q:
c=q.pop()
if c<0:
ce=~c
else:
ce=c
for nb,d in self.edges[ce]:
if self.depth[nb]==None:
q.append(~ce)
q.append(nb)
self.depth[nb]=self.depth[ce]+1
self.ETtable.append(ce)
self.ETdepth.append(self.depth[ce])
if self.ETin[ce]==-1:
self.ETin[ce]=cnt
else:
self.ETout[ce]=cnt
cnt+=1
return
def LCA_init(self,root):
self.EulerTour(root)
self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)
self.LCA_init_stat=True
return
def LCA(self,root,x,y):
if self.LCA_init_stat==False:
self.LCA_init(root)
xin,xout=self.ETin[x],self.ETout[x]
yin,yout=self.ETin[y],self.ETout[y]
a=min(xin,yin)
b=max(xout,yout,xin,yin)
id_of_min_dep_in_et=self.st.query_id(a,b+1)
return self.ETtable[id_of_min_dep_in_et]
class SparseTable: # O(N log N) for init, O(1) for query(l,r)
def __init__(self,ls,init_func=min,init_idl=float('inf')):
self.func=init_func
self.idl=init_idl
self.size=len(ls)
self.N0=self.size.bit_length()
self.table=[ls[:]]
self.index=[list(range(self.size))]
self.lg=[0]*(self.size+1)
for i in range(2,self.size+1):
self.lg[i]=self.lg[i>>1]+1
for i in range(self.N0):
tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]
tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]
self.table+=[tmp]
self.index+=[tmp_id]
# return func of [l,r)
def query(self,l,r):
if r>self.size:r=self.size
#N=(r-l).bit_length()-1
N=self.lg[r-l]
return self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))])
# return index of which val[i] = func of v among [l,r)
def query_id(self,l,r):
if r>self.size:r=self.size
#N=(r-l).bit_length()-1
N=self.lg[r-l]
a,b=self.index[N][l],self.index[N][max(0,r-(1<<N))]
if self.table[0][a]==self.func(self.table[N][l],self.table[N][r-(1<<N)]):
b=a
return b
def __str__(self):
return str(self.table[0])
def print(self):
for i in self.table:
print(*i)
class Comb:
def __init__(self,n,mo=10**9+7):
self.fac=[0]*(n+1)
self.inv=[1]*(n+1)
self.fac[0]=1
self.fact(n)
for i in range(1,n+1):
self.fac[i]=i*self.fac[i-1]%mo
self.inv[n]*=i
self.inv[n]%=mo
self.inv[n]=pow(self.inv[n],mo-2,mo)
for i in range(1,n):
self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
return
def fact(self,n):
return self.fac[n]
def invf(self,n):
return self.inv[n]
def comb(self,x,y):
if y<0 or y>x:
return 0
return self.fac[x]*self.inv[x-y]*self.inv[y]%mo
show_flg=False
show_flg=True
ans=0
h,w=LI()
ans=0
a=[[0]*(1+w)]
b=[[0]*(1+w)]
for i in range(h):
a.append([0]+LI())
for i in range(h):
b.append([0]+LI())
MX=80*80*3
ini=1<<MX
dp=[[0 for i in range(w+1)]for j in range(h+1)]
dp[1][1]=ini
for i in range(1,h+1):
for j in range(1,w+1):
d=abs(a[i][j]-b[i][j])
dp[i][j]|=(dp[i-1][j]<<d)|(dp[i-1][j]>>d)
dp[i][j]|=(dp[i][j-1]<<d)|(dp[i][j-1]>>d)
ans=dp[h][w]
for i in range(MX+1):
if (ans>>(MX+i))&1:
print(i)
exit()
if (ans>>(MX-i))&1:
print(i)
exit()
|
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def GI(V,E,ls=None,Directed=False,index=1):
org_inp=[];g=[[] for i in range(V)]
FromStdin=True if ls==None else False
for i in range(E):
if FromStdin:
inp=LI()
org_inp.append(inp)
else:
inp=ls[i]
if len(inp)==2:
a,b=inp;c=1
else:
a,b,c=inp
if index==1:a-=1;b-=1
aa=(a,c);bb=(b,c);g[a].append(bb)
if not Directed:g[b].append(aa)
return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
mp=[boundary]*(w+2);found={}
for i in range(h):
s=input()
for char in search:
if char in s:
found[char]=((i+1)*(w+2)+s.index(char)+1)
mp_def[char]=mp_def[replacement_of_found]
mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
mp+=[boundary]*(w+2)
return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def bit_combination(n,base=2):
rt=[]
for tb in range(base**n):s=[tb//(base**bt)%base for bt in range(n)];rt+=[s]
return rt
def gcd(x,y):
if y==0:return x
if x%y==0:return y
while x%y!=0:x,y=y,x%y
return y
def show(*inp,end='\n'):
if show_flg:print(*inp,end=end)
YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
FourNb=[(1,0),(-1,0),(0,1),(0,-1)];EightNb=[(1,0),(-1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('EWNS',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()
class Tree:
def __init__(self,inp_size=None,ls=None,init=True,index=0):
self.LCA_init_stat=False
self.ETtable=[]
if init:
if ls==None:
self.stdin(inp_size,index=index)
else:
self.size=len(ls)+1
self.edges,_=GI(self.size,self.size-1,ls,index=index)
return
def stdin(self,inp_size=None,index=1):
if inp_size==None:
self.size=int(input())
else:
self.size=inp_size
self.edges,_=GI(self.size,self.size-1,index=index)
return
def listin(self,ls,index=0):
self.size=len(ls)+1
self.edges,_=GI(self.size,self.size-1,ls,index=index)
return
def __str__(self):
return str(self.edges)
def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
q=deque()
q.append(x)
v=[-1]*self.size
v[x]=root_v
while q:
c=q.pop()
for nb,d in self.edges[c]:
if v[nb]==-1:
q.append(nb)
v[nb]=func(v[c],nb,d)
return v
def EulerTour(self,x):
q=deque()
q.append(x)
self.depth=[None]*self.size
self.depth[x]=0
self.ETtable=[]
self.ETdepth=[]
self.ETin=[-1]*self.size
self.ETout=[-1]*self.size
cnt=0
while q:
c=q.pop()
if c<0:
ce=~c
else:
ce=c
for nb,d in self.edges[ce]:
if self.depth[nb]==None:
q.append(~ce)
q.append(nb)
self.depth[nb]=self.depth[ce]+1
self.ETtable.append(ce)
self.ETdepth.append(self.depth[ce])
if self.ETin[ce]==-1:
self.ETin[ce]=cnt
else:
self.ETout[ce]=cnt
cnt+=1
return
def LCA_init(self,root):
self.EulerTour(root)
self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)
self.LCA_init_stat=True
return
def LCA(self,root,x,y):
if self.LCA_init_stat==False:
self.LCA_init(root)
xin,xout=self.ETin[x],self.ETout[x]
yin,yout=self.ETin[y],self.ETout[y]
a=min(xin,yin)
b=max(xout,yout,xin,yin)
id_of_min_dep_in_et=self.st.query_id(a,b+1)
return self.ETtable[id_of_min_dep_in_et]
class SparseTable: # O(N log N) for init, O(1) for query(l,r)
def __init__(self,ls,init_func=min,init_idl=float('inf')):
self.func=init_func
self.idl=init_idl
self.size=len(ls)
self.N0=self.size.bit_length()
self.table=[ls[:]]
self.index=[list(range(self.size))]
self.lg=[0]*(self.size+1)
for i in range(2,self.size+1):
self.lg[i]=self.lg[i>>1]+1
for i in range(self.N0):
tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]
tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]
self.table+=[tmp]
self.index+=[tmp_id]
# return func of [l,r)
def query(self,l,r):
if r>self.size:r=self.size
#N=(r-l).bit_length()-1
N=self.lg[r-l]
return self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))])
# return index of which val[i] = func of v among [l,r)
def query_id(self,l,r):
if r>self.size:r=self.size
#N=(r-l).bit_length()-1
N=self.lg[r-l]
a,b=self.index[N][l],self.index[N][max(0,r-(1<<N))]
if self.table[0][a]==self.func(self.table[N][l],self.table[N][r-(1<<N)]):
b=a
return b
def __str__(self):
return str(self.table[0])
def print(self):
for i in self.table:
print(*i)
class Comb:
def __init__(self,n,mo=10**9+7):
self.fac=[0]*(n+1)
self.inv=[1]*(n+1)
self.fac[0]=1
self.fact(n)
for i in range(1,n+1):
self.fac[i]=i*self.fac[i-1]%mo
self.inv[n]*=i
self.inv[n]%=mo
self.inv[n]=pow(self.inv[n],mo-2,mo)
for i in range(1,n):
self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
return
def fact(self,n):
return self.fac[n]
def invf(self,n):
return self.inv[n]
def comb(self,x,y):
if y<0 or y>x:
return 0
return self.fac[x]*self.inv[x-y]*self.inv[y]%mo
show_flg=False
show_flg=True
ans=0
h,w=LI()
ans=0
a=[[0]*(1+w)]
b=[[0]*(1+w)]
for i in range(h):
a.append([0]+LI())
for i in range(h):
b.append([0]+LI())
MX=80*80*3
ini=1<<MX
dp=[[0 for i in range(w+1)]for j in range(h+1)]
dp[0][1]=ini
for i in range(1,h+1):
for j in range(1,w+1):
d=abs(a[i][j]-b[i][j])
dp[i][j]|=(dp[i-1][j]<<d)|(dp[i-1][j]>>d)
dp[i][j]|=(dp[i][j-1]<<d)|(dp[i][j-1]>>d)
ans=dp[h][w]
for i in range(MX+1):
if (ans>>(MX+i))&1:
print(i)
exit()
if (ans>>(MX-i))&1:
print(i)
exit()
|
[
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 645,221
| 645,222
|
u623819879
|
python
|
p02839
|
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
H, W = map(int, input().split())
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
for _ in range(H):
B.append(list(map(int, input().split())))
"""
明らかなdp臭。
dp[i][j] = (マス(0, 0)から(i, j)に進むときの偏りとしてありうるものの集合)
とおく。(0<=i<=H-1, 0<=j<=W-1, 0<=d<=80)
残念ながらPypyだとsetでdp値を保持しているとTLEするので、setではなくビットで偏りの値を管理する
ただし-diffの方向にビットシフトするとき0桁目以下が切り捨てられてしまうので、最初から適当に
offsetで桁の水増しをしておく
"""
offset = 80 * 164
dp = [[0] * W for _ in range(H)]
dp[0][0] |= 1 << (A[0][0] - B[0][0] + offset)
dp[0][0] |= 1 << (B[0][0] - A[0][0] + offset)
for i in range(1, H):
diff = abs(A[i][0] - B[i][0])
dp[i][0] |= dp[i - 1][0] << diff
dp[i][0] |= dp[i - 1][0] >> diff
for j in range(1, W):
diff = abs(A[0][j] - B[0][j])
dp[i][0] |= dp[0][j - 1] << diff
dp[i][0] |= dp[0][j - 1] >> diff
for i in range(1, H):
for j in range(1, W):
diff = abs(A[i][j] - B[i][j])
dp[i][j] |= dp[i - 1][j] << diff
dp[i][j] |= dp[i - 1][j] >> diff
dp[i][j] |= dp[i][j - 1] << diff
dp[i][j] |= dp[i][j - 1] >> diff
ans1 = offset
while not (dp[H - 1][W - 1] & (1 << ans1)):
ans1 += 1
ans2 = offset
while not (dp[H - 1][W - 1] & (1 << ans2)):
ans2 -= 1
print(min(ans1 - offset, offset - ans2))
if __name__ == "__main__":
main()
|
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
H, W = map(int, input().split())
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
for _ in range(H):
B.append(list(map(int, input().split())))
"""
明らかなdp臭。
dp[i][j] = (マス(0, 0)から(i, j)に進むときの偏りとしてありうるものの集合)
とおく。(0<=i<=H-1, 0<=j<=W-1, 0<=d<=80)
残念ながらPypyだとsetでdp値を保持しているとTLEするので、setではなくビットで偏りの値を管理する
ただし-diffの方向にビットシフトするとき0桁目以下が切り捨てられてしまうので、最初から適当に
offsetで桁の水増しをしておく
"""
offset = 80 * 164
dp = [[0] * W for _ in range(H)]
dp[0][0] |= 1 << (A[0][0] - B[0][0] + offset)
dp[0][0] |= 1 << (B[0][0] - A[0][0] + offset)
for i in range(1, H):
diff = abs(A[i][0] - B[i][0])
dp[i][0] |= dp[i - 1][0] << diff
dp[i][0] |= dp[i - 1][0] >> diff
for j in range(1, W):
diff = abs(A[0][j] - B[0][j])
dp[0][j] |= dp[0][j - 1] << diff
dp[0][j] |= dp[0][j - 1] >> diff
for i in range(1, H):
for j in range(1, W):
diff = abs(A[i][j] - B[i][j])
dp[i][j] |= dp[i - 1][j] << diff
dp[i][j] |= dp[i - 1][j] >> diff
dp[i][j] |= dp[i][j - 1] << diff
dp[i][j] |= dp[i][j - 1] >> diff
ans1 = offset
while not (dp[H - 1][W - 1] & (1 << ans1)):
ans1 += 1
ans2 = offset
while not (dp[H - 1][W - 1] & (1 << ans2)):
ans2 -= 1
print(min(ans1 - offset, offset - ans2))
if __name__ == "__main__":
main()
|
[
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"identifier.replace.add",
"literal.replace.remove"
] | 645,264
| 645,265
|
u107639613
|
python
|
p02839
|
def run():
ofs = 100
H, W = map(int, input().split())
dp = [[0 for w in range(W)] for h in range(H)]
a = [list(map(int, input().split())) for i in range(H)]
b = [list(map(int, input().split())) for i in range(H)]
c = [[abs(a[i][j] - b[i][j]) for j in range(W)] for i in range(H)]
dp[0][0] = (1 << ofs + c[0][0]) | (1 << ofs - c[0][0])
for h in range(1, H):
dp[h][0] = (dp[h-1][0] << c[h][0]) | (dp[h-1][0] >> c[h][0])
for w in range(1, W):
dp[0][w] = (dp[0][w-1] << c[0][w]) | (dp[0][w-1] >> c[0][w])
for h in range(1, H):
for w in range(1, W):
v = c[h][w]
dp[h][w] = (dp[h-1][w] << v) | (dp[h-1][w] >> v)
dp[h][w] |= (dp[h][w-1] << v) | (dp[h][w-1] >> v)
s = list(bin(dp[-1][-1] >> ofs))
for i in range(len(s)):
if s[-1-i] == '1':
print(i)
break
if __name__ == '__main__':
run()
|
def run():
ofs = 1000
H, W = map(int, input().split())
dp = [[0 for w in range(W)] for h in range(H)]
a = [list(map(int, input().split())) for i in range(H)]
b = [list(map(int, input().split())) for i in range(H)]
c = [[abs(a[i][j] - b[i][j]) for j in range(W)] for i in range(H)]
dp[0][0] = (1 << ofs + c[0][0]) | (1 << ofs - c[0][0])
for h in range(1, H):
dp[h][0] = (dp[h-1][0] << c[h][0]) | (dp[h-1][0] >> c[h][0])
for w in range(1, W):
dp[0][w] = (dp[0][w-1] << c[0][w]) | (dp[0][w-1] >> c[0][w])
for h in range(1, H):
for w in range(1, W):
v = c[h][w]
dp[h][w] = (dp[h-1][w] << v) | (dp[h-1][w] >> v)
dp[h][w] |= (dp[h][w-1] << v) | (dp[h][w-1] >> v)
s = list(bin(dp[-1][-1] >> ofs))
for i in range(len(s)):
if s[-1-i] == '1':
print(i)
break
if __name__ == '__main__':
run()
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,286
| 645,287
|
u365375535
|
python
|
p02839
|
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 80
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
|
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 1000
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,320
| 645,319
|
u379629675
|
python
|
p02839
|
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 80
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
|
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 3200
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,320
| 645,321
|
u379629675
|
python
|
p02839
|
h, w = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(h)]
b = [list(map(int, input().split())) for _ in range(h)]
x = (h + w) * 80
dp = [[0] * w for _ in range(h)]
d = abs(a[0][0] - b[0][0])
dp[0][0] = 1 << (x - d)
for i in range(h):
for j, (ae, be) in enumerate(zip(a[i], b[i])):
if h == w == 0:
continue
d = abs(ae - be)
bt = 0
if i != 0:
bt |= dp[i-1][j] << d
bt |= dp[i-1][j] >> d
if j != 0:
bt |= dp[i][j-1] << d
bt |= dp[i][j-1] >> d
dp[i][j] = bt
dp = dp[-1][-1]
b = bin(dp)[2:]
can_make = [i - x for i, be in enumerate(b[::-1]) if be == "1"]
ans = min(x if x >= 0 else -x for x in can_make)
print(ans)
|
h, w = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(h)]
b = [list(map(int, input().split())) for _ in range(h)]
x = (h + w) * 80
dp = [[0] * w for _ in range(h)]
d = abs(a[0][0] - b[0][0])
dp[0][0] = 1 << (x - d)
for i in range(h):
for j, (ae, be) in enumerate(zip(a[i], b[i])):
if i == j == 0:
continue
d = abs(ae - be)
bt = 0
if i != 0:
bt |= dp[i-1][j] << d
bt |= dp[i-1][j] >> d
if j != 0:
bt |= dp[i][j-1] << d
bt |= dp[i][j-1] >> d
dp[i][j] = bt
dp = dp[-1][-1]
b = bin(dp)[2:]
can_make = [i - x for i, be in enumerate(b[::-1]) if be == "1"]
ans = min(x if x >= 0 else -x for x in can_make)
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,322
| 645,323
|
u893063840
|
python
|
p02839
|
H, W=map(int, input().split())
maxK=161
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in range(1, H+1):
for j in range(1, W+1):
for k in range(maxK):
if dp[i-1][j][k]==1 or dp[i][j-1][k]==1:
k_candidate1, k_candidate2=abs(k-C[i-1][j-1]), abs(k+C[i-1][j-1])
if k_candidate1<maxK:
dp[i][j][k_candidate1]=1
if k_candidate2<maxK:
dp[i][j][k_candidate2]=1
for k in range(maxK):
if dp[H][W][k]==1:
print(k)
break
|
H, W=map(int, input().split())
maxK=80*80+1
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in range(1, H+1):
for j in range(1, W+1):
for k in range(maxK):
if dp[i-1][j][k]==1 or dp[i][j-1][k]==1:
k_candidate1, k_candidate2=abs(k-C[i-1][j-1]), abs(k+C[i-1][j-1])
if k_candidate1<maxK:
dp[i][j][k_candidate1]=1
if k_candidate2<maxK:
dp[i][j][k_candidate2]=1
for k in range(maxK):
if dp[H][W][k]==1:
print(k)
break
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,497
| 645,498
|
u419877586
|
python
|
p02839
|
H, W=map(int, input().split())
maxK=81
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in range(1, H+1):
for j in range(1, W+1):
for k in range(maxK):
if dp[i-1][j][k]==1 or dp[i][j-1][k]==1:
k_candidate1, k_candidate2=abs(k-C[i-1][j-1]), abs(k+C[i-1][j-1])
if k_candidate1<maxK:
dp[i][j][k_candidate1]=1
if k_candidate2<maxK:
dp[i][j][k_candidate2]=1
for k in range(maxK):
if dp[H][W][k]==1:
print(k)
break
|
H, W=map(int, input().split())
maxK=80*80+1
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in range(1, H+1):
for j in range(1, W+1):
for k in range(maxK):
if dp[i-1][j][k]==1 or dp[i][j-1][k]==1:
k_candidate1, k_candidate2=abs(k-C[i-1][j-1]), abs(k+C[i-1][j-1])
if k_candidate1<maxK:
dp[i][j][k_candidate1]=1
if k_candidate2<maxK:
dp[i][j][k_candidate2]=1
for k in range(maxK):
if dp[H][W][k]==1:
print(k)
break
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 645,499
| 645,498
|
u419877586
|
python
|
p02839
|
import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp[0, x], z[0, x])
for y in range(1, z.shape[0]):
calc(dp[y - 1, 0], dp[y, 0], z[y, 0])
for x in range(1, z.shape[1]):
calc(dp[y, x - 1], dp[y, x], z[y, x])
calc(dp[y - 1, x], dp[y, x], z[y, x])
if (x + y) % 50 == 0:
dp[y, x] = dp[y, x] > 0
for i in range(zero, dp.shape[2]):
if dp[dp.shape[0] - 1, dp.shape[1] - 1, i] > 0:
return i - zero
return -1
def main2():
stdin = open('/dev/stdin')
H, W = map(int, stdin.readline().split())
a = np.empty((H, W), i8)
b = np.empty((H, W), i8)
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
a[i, j] = c
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
b[i, j] = c
z = np.abs(a - b)
dp = np.zeros((H, W, 80 * 80 *2 + 1), i8)
ans = solve(z, dp)
print(ans)
|
import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp[0, x], z[0, x])
for y in range(1, z.shape[0]):
calc(dp[y - 1, 0], dp[y, 0], z[y, 0])
for x in range(1, z.shape[1]):
calc(dp[y, x - 1], dp[y, x], z[y, x])
calc(dp[y - 1, x], dp[y, x], z[y, x])
if (x + y) % 50 == 0:
dp[y, x] = dp[y, x] > 0
for i in range(zero, dp.shape[2]):
if dp[dp.shape[0] - 1, dp.shape[1] - 1, i] > 0:
return i - zero
return -1
def main2():
stdin = open('/dev/stdin')
H, W = map(int, stdin.readline().split())
a = np.empty((H, W), i8)
b = np.empty((H, W), i8)
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
a[i, j] = c
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
b[i, j] = c
z = np.abs(a - b)
dp = np.zeros((H, W, 80 * 80 *2 + 1), i8)
ans = solve(z, dp)
print(ans)
main2()
|
[
"call.add"
] | 645,507
| 645,508
|
u326609687
|
python
|
p02839
|
import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp[0, x], z[0, x])
for y in range(1, z.shape[0]):
calc(dp[y - 1, 0], dp[y, 0], z[y, 0])
for x in range(1, z.shape[1]):
calc(dp[y, x - 1], dp[y, x], z[y, x])
calc(dp[y - 1, x], dp[y, x], z[y, x])
if (x + y) % 10 == 0:
dp[y, x] = dp[y, x] > 0
for i in range(zero, dp.shape[2]):
if dp[dp.shape[0] - 1, dp.shape[1] - 1, i] > 0:
return i - zero
return -1
def main2():
stdin = open('/dev/stdin')
H, W = map(int, stdin.readline().split())
a = np.empty((H, W), i8)
b = np.empty((H, W), i8)
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
a[i, j] = c
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
b[i, j] = c
z = np.abs(a - b)
dp = np.zeros((H, W, 80 * 80 *2 + 1), i8)
ans = solve(z, dp)
print(ans)
|
import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp[0, x], z[0, x])
for y in range(1, z.shape[0]):
calc(dp[y - 1, 0], dp[y, 0], z[y, 0])
for x in range(1, z.shape[1]):
calc(dp[y, x - 1], dp[y, x], z[y, x])
calc(dp[y - 1, x], dp[y, x], z[y, x])
if (x + y) % 50 == 0:
dp[y, x] = dp[y, x] > 0
for i in range(zero, dp.shape[2]):
if dp[dp.shape[0] - 1, dp.shape[1] - 1, i] > 0:
return i - zero
return -1
def main2():
stdin = open('/dev/stdin')
H, W = map(int, stdin.readline().split())
a = np.empty((H, W), i8)
b = np.empty((H, W), i8)
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
a[i, j] = c
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
b[i, j] = c
z = np.abs(a - b)
dp = np.zeros((H, W, 80 * 80 *2 + 1), i8)
ans = solve(z, dp)
print(ans)
main2()
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 645,509
| 645,508
|
u326609687
|
python
|
p02839
|
import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp[0, x], z[0, x])
for y in range(1, z.shape[0]):
calc(dp[y - 1, 0], dp[y, 0], z[y, 0])
for x in range(1, z.shape[1]):
calc(dp[y, x - 1], dp[y, x], z[y, x])
calc(dp[y - 1, x], dp[y, x], z[y, x])
if (x + y) % 10 == 0:
dp[y, x] = dp[y, x] > 0
for i in range(zero, dp.shape[2]):
if dp[dp.shape[0] - 1, dp.shape[1] - 1, i] > 0:
return i - zero
return -1
def main2():
stdin = open('/dev/stdin')
H, W = map(int, stdin.readline().split())
a = np.empty((H, W), i8)
b = np.empty((H, W), i8)
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
a[i, j] = c
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
b[i, j] = c
z = np.abs(a - b)
dp = np.zeros((H, W, 80 * 80 *2 + 1), i8)
ans = solve(z, dp)
print(ans)
|
import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp[0, x], z[0, x])
for y in range(1, z.shape[0]):
calc(dp[y - 1, 0], dp[y, 0], z[y, 0])
for x in range(1, z.shape[1]):
calc(dp[y, x - 1], dp[y, x], z[y, x])
calc(dp[y - 1, x], dp[y, x], z[y, x])
if (x + y) % 10 == 0:
dp[y, x] = dp[y, x] > 0
for i in range(zero, dp.shape[2]):
if dp[dp.shape[0] - 1, dp.shape[1] - 1, i] > 0:
return i - zero
return -1
def main2():
stdin = open('/dev/stdin')
H, W = map(int, stdin.readline().split())
a = np.empty((H, W), i8)
b = np.empty((H, W), i8)
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
a[i, j] = c
for i in range(H):
for j, c in enumerate(map(int, stdin.readline().split())):
b[i, j] = c
z = np.abs(a - b)
dp = np.zeros((H, W, 80 * 80 *2 + 1), i8)
ans = solve(z, dp)
print(ans)
main2()
|
[
"call.add"
] | 645,509
| 645,510
|
u326609687
|
python
|
p02839
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#solve
def solve():
h, w = LI()
a = LIR(h)
b = LIR(h)
mab = [[abs(a[y][x]-b[y][x]) for x in range(w)] for y in range(h)]
ab = abs(a[0][0] - b[0][0])
hw = h + w
dp = [[0] * w for i in range(h)]
dp[0][0] |= (1 << (6400 + ab) | 1 >> (6400 - ab))
for i in range(1, h + w - 1):
for x in range(w):
y = i - x - 1
if 0 <= x < w and 0 <= y < h:
value = dp[y][x]
else:
continue
for mx, my in [[0, 1], [1, 0]]:
mx += x
my += y
if 0 <= mx < w and 0 <= my < h:
mxy = mab[my][mx]
dp[my][mx] |= ((value << mxy) | (value >> mxy))
ans = dp[-1][-1]
for i in range(ans.bit_length()):
if ans & (1 << (6400-i)):
print(i)
return
return
#main
if __name__ == '__main__':
solve()
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#solve
def solve():
h, w = LI()
a = LIR(h)
b = LIR(h)
mab = [[abs(a[y][x]-b[y][x]) for x in range(w)] for y in range(h)]
ab = abs(a[0][0] - b[0][0])
hw = h + w
dp = [[0] * w for i in range(h)]
dp[0][0] |= (1 << (6400 + ab) | 1 << (6400 - ab))
for i in range(1, h + w - 1):
for x in range(w):
y = i - x - 1
if 0 <= x < w and 0 <= y < h:
value = dp[y][x]
else:
continue
for mx, my in [[0, 1], [1, 0]]:
mx += x
my += y
if 0 <= mx < w and 0 <= my < h:
mxy = mab[my][mx]
dp[my][mx] |= ((value << mxy) | (value >> mxy))
ans = dp[-1][-1]
for i in range(ans.bit_length()):
if ans & (1 << (6400-i)):
print(i)
return
return
#main
if __name__ == '__main__':
solve()
|
[
"expression.operation.binary.change"
] | 645,516
| 645,517
|
u423585790
|
python
|
p02839
|
import numpy as np
H, W = map(int, input().split())
lst1 = []
lst2 = []
for _ in range(H):
lst1.append([int(i) for i in input().split()])
for _ in range(H):
lst2.append([int(i) for i in input().split()])
arr1, arr2 = np.array(lst1), np.array(lst2)
arr = np.abs(arr1 - arr2)
d = [[0] * W for _ in range(H)]
m = 80 * (H + W)
d[0][0] = 1 << m
for h in range(H):
for w in range(W):
x = arr[h][w]
if h > 0:
print(h,w)
d[h][w] |= d[h - 1][w]
if w > 0:
d[h][w] |= d[h][w - 1]
d[h][w] = d[h][w] << x | d[h][w] >> x
x, y= 1 << m, 1 << m
for i in range(m + 1):
if d[H - 1][W - 1] & x or d[H - 1][W - 1] & y:
print(i)
quit()
x<<=1
y>>=1
|
import numpy as np
H, W = map(int, input().split())
lst1 = []
lst2 = []
for _ in range(H):
lst1.append([int(i) for i in input().split()])
for _ in range(H):
lst2.append([int(i) for i in input().split()])
arr1, arr2 = np.array(lst1), np.array(lst2)
arr = np.abs(arr1 - arr2)
d = [[0] * W for _ in range(H)]
m = 80 * (H + W)
d[0][0] = 1 << m
for h in range(H):
for w in range(W):
x = arr[h][w]
if h > 0:
d[h][w] |= d[h - 1][w]
if w > 0:
d[h][w] |= d[h][w - 1]
d[h][w] = d[h][w] << x | d[h][w] >> x
x, y= 1 << m, 1 << m
for i in range(m + 1):
if d[H - 1][W - 1] & x or d[H - 1][W - 1] & y:
print(i)
quit()
x<<=1
y>>=1
|
[
"call.remove"
] | 645,518
| 645,519
|
u780475861
|
python
|
p02841
|
MD = [map(int, input().split()) for _ in range(N)]
M, D = [list(i) for i in zip(*MD)]
if D[1] == 1:
print(1)
else:
print(0)
|
MD = [map(int, input().split()) for _ in range(2)]
M, D = [list(i) for i in zip(*MD)]
if D[1] == 1:
print(1)
else:
print(0)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 645,567
| 645,568
|
u861274887
|
python
|
p02841
|
md1=map(int,input().split())
md2=map(int,input().split())
print(1 if md1[0]!=md2[0] else 0)
|
md1=list(map(int,input().split()))
md2=list(map(int,input().split()))
print(1 if md1[0]!=md2[0] else 0)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 645,589
| 645,590
|
u556594202
|
python
|
p02841
|
print(+('1\n'in[*open(0)][1]))
|
print(+(' 1\n'in[*open(0)][1]))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 645,597
| 645,598
|
u729133443
|
python
|
p02841
|
m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())
if mi == m2:
print(0)
else:
print(1)
|
m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())
if m1 == m2:
print(0)
else:
print(1)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,624
| 645,625
|
u357751375
|
python
|
p02841
|
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = float('inf')
#############
# Functions #
#############
######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]
######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()
#####Shorten#####
def DD(arg): return defaultdict(arg)
#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)
######Combination######
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo = []
def gyaku_kaijo(n):
if(len(gyaku_kaijo_memo) > n):
return gyaku_kaijo_memo[n]
if(len(gyaku_kaijo_memo) == 0):
gyaku_kaijo_memo.append(1)
while(len(gyaku_kaijo_memo) <= n):
gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
return gyaku_kaijo_memo[n]
def nCr(n,r):
if(n == r):
return 1
if(n < r or r < 0):
return 0
ret = 1
ret = ret * kaijo(n) % MOD
ret = ret * gyaku_kaijo(r) % MOD
ret = ret * gyaku_kaijo(n-r) % MOD
return ret
######Factorization######
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])
if arr==[]:
arr.append([n, 1])
return arr
#####MakeDivisors######
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
#####MakePrimes######
def make_primes(N):
max = int(math.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
#####GCD#####
def gcd(a, b):
while b:
a, b = b, a % b
return a
#####LCM#####
def lcm(a, b):
return a * b // gcd (a, b)
#####BitCount#####
def count_bit(n):
count = 0
while n:
n &= n -1
count += 1
return count
#####ChangeBase#####
def base_10_to_n(X, n):
if X//n:
return base_10_to_n(X//n, n)+[X%n]
return [X%n]
def base_n_to_10(X, n):
return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))
#####IntLog#####
def int_log(n, a):
count = 0
while n>=a:
n //= a
count += 1
return count
#############
# Main Code #
#############
a,b = IL()
c,d = IL()
print(bool(a!=c))
|
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = float('inf')
#############
# Functions #
#############
######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]
######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()
#####Shorten#####
def DD(arg): return defaultdict(arg)
#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)
######Combination######
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo = []
def gyaku_kaijo(n):
if(len(gyaku_kaijo_memo) > n):
return gyaku_kaijo_memo[n]
if(len(gyaku_kaijo_memo) == 0):
gyaku_kaijo_memo.append(1)
while(len(gyaku_kaijo_memo) <= n):
gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
return gyaku_kaijo_memo[n]
def nCr(n,r):
if(n == r):
return 1
if(n < r or r < 0):
return 0
ret = 1
ret = ret * kaijo(n) % MOD
ret = ret * gyaku_kaijo(r) % MOD
ret = ret * gyaku_kaijo(n-r) % MOD
return ret
######Factorization######
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])
if arr==[]:
arr.append([n, 1])
return arr
#####MakeDivisors######
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
#####MakePrimes######
def make_primes(N):
max = int(math.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
#####GCD#####
def gcd(a, b):
while b:
a, b = b, a % b
return a
#####LCM#####
def lcm(a, b):
return a * b // gcd (a, b)
#####BitCount#####
def count_bit(n):
count = 0
while n:
n &= n -1
count += 1
return count
#####ChangeBase#####
def base_10_to_n(X, n):
if X//n:
return base_10_to_n(X//n, n)+[X%n]
return [X%n]
def base_n_to_10(X, n):
return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))
#####IntLog#####
def int_log(n, a):
count = 0
while n>=a:
n //= a
count += 1
return count
#############
# Main Code #
#############
a,b = IL()
c,d = IL()
print(int(a!=c))
|
[
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 645,626
| 645,627
|
u493130708
|
python
|
p02841
|
m1, d1 = map(int,input().split())
m2, d2 = map(int,input().split())
if m1 != m2 and m2 == 1:
print(1)
else:
print(0)
|
m1, d1 = map(int,input().split())
m2, d2 = map(int,input().split())
if m1 != m2 and d2 == 1:
print(1)
else:
print(0)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,644
| 645,645
|
u068142202
|
python
|
p02841
|
l1 = list(map(int,input().split()))
l2 = list(map(int,input().split()))
if l[1] == 1:
print('1')
else:
print('0')
|
l1 = list(map(int,input().split()))
l2 = list(map(int,input().split()))
if l2[1] == 1:
print('1')
else:
print('0')
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,648
| 645,649
|
u264681142
|
python
|
p02841
|
a, b = map(int, input().split())
c, d = map(int, input().split())
print(a!=c)
|
a, b = map(int, input().split())
c, d = map(int, input().split())
print(int(a!=c))
|
[
"call.arguments.add",
"call.arguments.change"
] | 645,652
| 645,653
|
u667084803
|
python
|
p02841
|
a, b = map(int, input().split())
c, d = map(int, input().split())
print(a!=b)
|
a, b = map(int, input().split())
c, d = map(int, input().split())
print(int(a!=c))
|
[
"call.arguments.add",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 645,654
| 645,653
|
u667084803
|
python
|
p02841
|
def main():
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 == m2:
print('1')
else:
print('0')
if __name__ == '__main__':
main()
|
def main():
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print('1')
else:
print('0')
if __name__ == '__main__':
main()
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 645,676
| 645,677
|
u197956883
|
python
|
p02841
|
print(1+input().find(input()[:2]))
|
print(0-input().find(input()[:2]))
|
[] | 645,679
| 645,680
|
u490642448
|
python
|
p02841
|
print(input().count(input()[:2]))
|
print(0-input().find(input()[:2]))
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 645,681
| 645,680
|
u490642448
|
python
|
p02841
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(1 if m1!=d1 else 0)
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(1 if m1!=m2 else 0)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 645,691
| 645,692
|
u690536347
|
python
|
p02841
|
M_1, D_1 = map(int, input().split())
M_2, D_2 = map(int, input().split())
if M_1 != M_2:
print(0)
else:
print(1)
|
M_1, D_1 = map(int, input().split())
M_2, D_2 = map(int, input().split())
if M_1 != M_2:
print(1)
else:
print(0)
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,697
| 645,698
|
u370721525
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.array(input().split(), np.int64)
ans = 0
for k in range(60):
x = sum(A >> k & 1)
ans += x * (N - x) * 2**k
print(ans % (10**9+7))
|
import numpy as np
N = int(input())
A = np.array(input().split(), np.int64)
ans = 0
for k in range(60):
x = int(np.sum(A >> k & 1))
ans += x * (N - x) * 2**k
print(ans % (10**9+7))
|
[
"call.add",
"call.arguments.change"
] | 645,736
| 645,735
|
u006493569
|
python
|
p02838
|
N = int(input())
lis = [0]*60
for a in input().split():
a = int(a)
for i,j in range(60):
lis[i] += a % 2
a = a//2
ans = 0
for i, j in enumerate(lis):
ans += j * (N-j) *(2**i)
ans = ans % (10**9 + 7)
print(ans)
|
N = int(input())
lis = [0]*60
for a in input().split():
a = int(a)
for i in range(60):
lis[i] += a % 2
a = a//2
ans = 0
for i, j in enumerate(lis):
ans += j * (N-j) *(2**i)
ans = ans % (10**9 + 7)
print(ans)
|
[] | 645,761
| 645,762
|
u262869085
|
python
|
p02838
|
# -*- coding: utf-8 -*-
import numpy as np
def main():
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
A = np.array(A, np.int64)
ans = 0
for i in range(60):
bit = np.count_nonzero(A | 0)
ans += bit * (N - bit) * (2 ** i)
ans %= mod
A >>= 1
print(ans)
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
import numpy as np
def main():
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
A = np.array(A, np.int64)
ans = 0
for i in range(60):
bit = np.count_nonzero(A & 1)
ans += bit * (N - bit) * (2 ** i)
ans %= mod
A >>= 1
print(ans)
if __name__ == '__main__':
main()
|
[] | 645,850
| 645,851
|
u981040490
|
python
|
p02838
|
import numpy as np
n=int(input())
a= list(map(int,input().split()))
a=np.array(a,np.int64)
print(a)
max=60
mod=10**9+7
ans=0
cnt1=0
cnt0=0
for i in range(max):
new_a=(a>>i & 1)
cnt1=np.count_nonzero(new_a)
cnt0=n-cnt1
ans=(ans+cnt1*cnt0*(2**i))%mod
cnt1=0
cnt0=0
print(ans)
|
import numpy as np
n=int(input())
a= list(map(int,input().split()))
a=np.array(a,np.int64)
max=60
mod=10**9+7
ans=0
cnt1=0
cnt0=0
for i in range(max):
new_a=(a>>i & 1)
cnt1=np.count_nonzero(new_a)
cnt0=n-cnt1
ans=(ans+cnt1*cnt0*(2**i))%mod
cnt1=0
cnt0=0
print(ans)
|
[
"call.remove"
] | 645,854
| 645,855
|
u397035018
|
python
|
p02838
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9+7
N = int(input())
A = list(map(int, input().split()))
B = [0]*60
C = [0]*60
for i in range(60):
for j in range(N):
if (A[j]>>i)&1 == 0:
C[i] += 1
else:
B[i] += 1
ans = 0
for i in range(60):
ans += B[i]*C[i]*2**i%MOD
print(ans)
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9+7
N = int(input())
A = list(map(int, input().split()))
B = [0]*60
C = [0]*60
for i in range(60):
for j in range(N):
if (A[j]>>i)&1 == 0:
C[i] += 1
else:
B[i] += 1
ans = 0
for i in range(60):
ans += B[i]*C[i]*2**i%MOD
print(ans%MOD)
|
[
"expression.operation.binary.add"
] | 645,893
| 645,894
|
u741397536
|
python
|
p02838
|
MOD = int(1e9) + 7
n = int(input())
a = list(map(int, input().split()))
ans = 0
for b in range(60)[::-1]:
ans <<=1
print(ans)
c = sum(a[i]>>b & 1 for i in range(n))
ans = (ans + c*(n-c))%MOD
print(ans)
|
MOD = int(1e9) + 7
n = int(input())
a = list(map(int, input().split()))
ans = 0
for b in range(60)[::-1]:
ans <<=1
c = sum(a[i]>>b & 1 for i in range(n))
ans = (ans + c*(n-c))%MOD
print(ans)
|
[
"call.remove"
] | 645,924
| 645,925
|
u117348081
|
python
|
p02838
|
mod = 10**9 + 7
def main():
n = int(input())
A = [int(a) for a in input().split()]
ans = 0
for k in range(60):
a = 0
for i in range(n):
a += A[i] & 1
A[i] <<= 1
da = (1 << k) % mod
da *= (n - a)*a
da %= mod
ans += da
ans %= mod
print(ans)
main()
|
mod = 10**9 + 7
def main():
n = int(input())
A = [int(a) for a in input().split()]
ans = 0
for k in range(60):
a = 0
for i in range(n):
a += A[i] & 1
A[i] >>= 1
da = (1 << k) % mod
da *= (n - a)*a
da %= mod
ans += da
ans %= mod
print(ans)
main()
|
[
"expression.operator.change"
] | 645,950
| 645,951
|
u747184036
|
python
|
p02841
|
M_1, D_1 = map(int, input().split(" "))
M_2, D_2 = map(int, input().split(" "))
print(0 if M_1 == M_2 else 0)
|
M_1, D_1 = map(int, input().split(" "))
M_2, D_2 = map(int, input().split(" "))
print(0 if M_1 == M_2 else 1)
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,957
| 645,958
|
u500415792
|
python
|
p02841
|
# A - November 30
def main():
M1, _, M2, _ = map(int, open(0).read().split())
print(M1 != M2)
if __name__ == "__main__":
main()
|
# A - November 30
def main():
M1, _, M2, _ = map(int, open(0).read().split())
print(int(M1 != M2))
if __name__ == "__main__":
main()
|
[
"call.arguments.add",
"call.arguments.change"
] | 645,959
| 645,960
|
u077291787
|
python
|
p02841
|
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print(1 if d2==1 else 2)
|
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print(1 if d2==1 else 0)
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,961
| 645,962
|
u038819082
|
python
|
p02841
|
a, _ = map(int, input().split())
c, d = map(int, input().split())
if a == c and d == 1:
print("1")
else:
print("0")
|
a, _ = map(int, input().split())
c, d = map(int, input().split())
if a != c and d == 1:
print("1")
else:
print("0")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 645,963
| 645,964
|
u756195685
|
python
|
p02841
|
a, _ = map(int, input().split())
c, d = map(int, input().split())
if a == c and d == 1:
print("1")
else:
print("2")
|
a, _ = map(int, input().split())
c, d = map(int, input().split())
if a != c and d == 1:
print("1")
else:
print("0")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 645,965
| 645,964
|
u756195685
|
python
|
p02841
|
a, b = map(int,input().split())
c, d = map(int,input().split())
if d == "1":
print("1")
else:
print("0")
|
a, b = map(int,input().split())
c, d = map(int,input().split())
if d == 1:
print("1")
else:
print("0")
|
[
"control_flow.branch.if.condition.change"
] | 645,974
| 645,975
|
u972892985
|
python
|
p02841
|
m,d = map(int,input().split())
m2,d2 = ap(int,input().split())
if(m!=m2):
print(1)
else:
print(0)
|
m,d = map(int,input().split())
m2,d2 = map(int,input().split())
if(m!=m2):
print(1)
else:
print(0)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 645,978
| 645,979
|
u777394984
|
python
|
p02841
|
def mainFunc():
m1, d1 = list(map(int, list(input().split(" "))))
m2, d2 = list(map(int, list(input().split(" "))))
ans = '1' if m1 == m2 else '0'
print(ans)
mainFunc()
|
def mainFunc():
m1, d1 = list(map(int, list(input().split(" "))))
m2, d2 = list(map(int, list(input().split(" "))))
ans = '1' if m1 != m2 else '0'
print(ans)
mainFunc()
|
[
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change"
] | 645,982
| 645,983
|
u610387229
|
python
|
p02841
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(0)
else:
print(1)
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(1)
else:
print(0)
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,986
| 645,987
|
u031324264
|
python
|
p02841
|
a,b = list(map(int, input().split()))
c,d = list(map(int, input().split()))
if (a != b):
print(1)
else:
print(0)
|
a,b = list(map(int, input().split()))
c,d = list(map(int, input().split()))
if (a != c):
print(1)
else:
print(0)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,992
| 645,993
|
u498575211
|
python
|
p02841
|
in1=input().split()
in2=input().split()
if int(in1[0])==int(in2[0]):
return 0
else:
return 1
|
in1=input().split()
in2=input().split()
if int(in1[0])==int(in2[0]):
print(0)
else:
print(1)
|
[
"function.return_value.change",
"call.arguments.change"
] | 645,998
| 645,999
|
u074060241
|
python
|
p02841
|
m1,d1 = map(int,input().aplit())
m2,d2= map(int,input().split())
if m1!=m2:
print(1)
else:
print(0)
|
m1,d1 = map(int,input().split())
m2,d2= map(int,input().split())
if m1!=m2:
print(1)
else:
print(0)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 646,024
| 646,025
|
u382907940
|
python
|
p02841
|
m1,d1 = map(int,input().aplit())
m2,d2= map(int,input().split())
if m1!=m2:print(1)
else: print(0)
|
m1,d1 = map(int,input().split())
m2,d2= map(int,input().split())
if m1!=m2:
print(1)
else:
print(0)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 646,026
| 646,025
|
u382907940
|
python
|
p02841
|
a, b = map(int, input().split())
c, d = map(int, input().split())
if(a != b):
print(1)
else:
print(0)
|
a, b = map(int, input().split())
c, d = map(int, input().split())
if(a != c):
print(1)
else:
print(0)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 646,047
| 646,048
|
u583276018
|
python
|
p02841
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(0)
else:
print(1)
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(1)
else:
print(0)
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 646,049
| 646,050
|
u138781768
|
python
|
p02841
|
print(1 if int(input().split()[2])==1 else 0)
|
input()
print(1 if int(input().split()[1])==1 else 0)
|
[
"call.add",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 646,062
| 646,063
|
u388817534
|
python
|
p02841
|
for i in range(2):
n.append([int(x) for x in input().split()])
print(1 if n[0][0]!=n[1][0] else 0)
|
n=[]
for i in range(2):
n.append([int(x) for x in input().split()])
print(1 if n[0][0]!=n[1][0] else 0)
|
[
"assignment.add"
] | 646,080
| 646,081
|
u295294832
|
python
|
p02841
|
m1, d1 = map(int, input().split)
m2, d2 = map(int, input().split)
if(m1 == m2):
print('0')
exit()
print('1')
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if(m1 == m2):
print('0')
exit()
print('1')
|
[
"call.add"
] | 646,121
| 646,122
|
u830297276
|
python
|
p02841
|
l = input().split(' ')
m = input().split(' ')
x = m[1]
if str(x) == 1:
print(1)
else:
print(0)
|
l = input().split(' ')
m = input().split(' ')
x = int(m[1])
if x == 1:
print(1)
else:
print(0)
|
[
"call.add",
"control_flow.branch.if.add"
] | 646,148
| 646,149
|
u700929101
|
python
|
p02841
|
str = [input() for i in range(2)]
s1 = str[0].split()
s2 = str[1].split()
if s1[0] != s2[1] and int(s1[1]) != int(s2[1]):
print("1")
else:
print("0")
|
str = [input() for i in range(2)]
s1 = str[0].split()
s2 = str[1].split()
if s1[0] != s2[0] and int(s1[1]) >= int(s2[1]):
print("1")
else:
print("0")
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 646,152
| 646,153
|
u571646975
|
python
|
p02841
|
ip=input().strip()
while((len)==0):
ip=input().strip()
m,d=map(int,ip.split())
m1,d1=map(int,input().split())
odd=[1,3,5,7,8,10,12]
eve=[4,6,9,11]
if m in odd:
if(d==31):
print(1)
else:
print(0)
elif m in even:
if(d==30):
print(1)
else:
print(0)
else:
if(d==28):
print(1)
else:
print(0)
|
ip=input().strip()
while((len)==0):
ip=input().strip()
m,d=map(int,ip.split())
m1,d1=map(int,input().split())
odd=[1,3,5,7,8,10,12]
eve=[4,6,9,11]
if m in odd:
if(d==31):
print(1)
else:
print(0)
elif m in eve:
if(d==30):
print(1)
else:
print(0)
else:
if(d==28):
print(1)
else:
print(0)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 646,158
| 646,159
|
u002813843
|
python
|
p02841
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(m1 == m2 if 1 else 0)
|
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(0 if m1 == m2 else 1)
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 646,162
| 646,163
|
u698849142
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.